SIMPLE EASY SOLUTION
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int areaOfMaxDiagonal(vector<vector<int>>& dimensions) {
        long long maxd=-1;
        int area=0;
        for (int i=0;i<dimensions.size();i++)
        {
            
                long long d=(dimensions[i][0]*dimensions[i][0]+dimensions[i][1]*dimensions[i][1]);
                if (d>maxd)
                {
                    maxd=d;
                    area=dimensions[i][0]*dimensions[i][1];
                }
                else if (d==maxd)
                {
                    area=max(area,dimensions[i][0]*dimensions[i][1]);
                }
        }

        return area;

    }
};
```
['C++']