C# Runtime 79 ms Beats 57.14%
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```\npublic class Solution {\n    public int AreaOfMaxDiagonal(int[][] dimensions) \n    {\n        var maxDiagonal = 0.0;\n        var maxDiagonalIndex = 0;\n\n        for(int i = 0; i < dimensions.Length; i++)\n        {\n            double curDiagonal = Math.Sqrt(Math.Pow(dimensions[i][0], 2) + Math.Pow(dimensions[i][1], 2));\n            \n            if(curDiagonal > maxDiagonal)\n            {\n                maxDiagonal = curDiagonal;\n                maxDiagonalIndex = i;\n            }\n\n            if(curDiagonal == maxDiagonal)\n            {\n                var areaRecPrev = dimensions[maxDiagonalIndex][0]*dimensions[maxDiagonalIndex][1];\n                var areaRecCur = dimensions[i][0]*dimensions[i][1];\n\n                if(areaRecCur > areaRecPrev)\n                {\n                    maxDiagonalIndex = i;\n                }\n            }\n        }\n        \n        return dimensions[maxDiagonalIndex][0]*dimensions[maxDiagonalIndex][1];\n    }\n}\n```
['C#']