Simple and detailed java solution beats 95%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```java []\nclass Solution {\n    public int areaOfMaxDiagonal(int[][] dimensions) {\n        int maxArea = 0;\n        double maxDiagonal = 0;\n\n        for (int i = 0; i < dimensions.length; i++) {\n            double width = dimensions[i][0];\n            double height = dimensions[i][1];\n            double diagonal = Math.sqrt(width * width + height * height);\n            int area = (int) (width * height);\n            if (diagonal > maxDiagonal || diagonal == maxDiagonal && area>maxArea) {\n                maxDiagonal = diagonal;\n                maxArea = area;\n            }\n        }\n        return maxArea;\n    }\n}\n```
['Java']