Simple iterative solution
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```cpp []\nclass Solution {\npublic:\n    int areaOfMaxDiagonal(vector<vector<int>>& dimensions) {\n        int maxArea = -1;\n        int maxDiagonal = -1;\n        int n = dimensions.size();\n        for(int i = 0;i<n;i++){\n            int l = dimensions[i][0];\n            int w = dimensions[i][1];\n            int daigonal = l*l + w*w;\n            int area = l*w;\n            if(daigonal > maxDiagonal){\n                maxDiagonal = daigonal;\n                maxArea = area;\n            }else if(daigonal == maxDiagonal && area > maxArea){\n                maxArea = area;\n            }\n        }\n        return maxArea;\n    }\n};\n```
['C++']