<<easy C++ solution -beats 100 %>>
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) {
       float max_diagonal=0;
       float max_area=0;
       for(auto it:dimensions) 
       {
        float length=it[0];
       float breadth=it[1];
       float dia=sqrt(length*length +breadth*breadth);
        float area=length*breadth;
if(max_diagonal<dia){
    max_diagonal=dia;
max_area=area;

       }
       if(max_diagonal == dia)
       {max_area=max(area,max_area);

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