Java Easy Solution
Complexity
Time complexity: O(n)

Space complexity: O(1)
Code


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

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

# Code
```java []
class Solution {
    public int areaOfMaxDiagonal(int[][] dimensions) {
        int maxArea = 0;
        double d = 0;
        for(int i=0; i<dimensions.length; i++){
            int h = dimensions[i][0];
            int b = dimensions[i][1];
            double diagonal = Math.sqrt((long)(h*h) + (long)(b*b));
            if(d < diagonal || (diagonal == d && h * b > maxArea)){
                d = diagonal;
                maxArea = h*b;
            }
        }
        return maxArea;
    }
}
```
['Java']