Beats 91.77% Solutions | Python
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: O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n![image.png](https://assets.leetcode.com/users/images/5fef2e08-668d-44f4-a80c-c0c02c70f5c6_1729000826.0634496.png)\n\n# Code\n```python3 []\nclass Solution:\n    def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:\n        max_tuple = (0, 0)\n        index = 0\n\n        for i, dimension in enumerate(dimensions):\n            cur_tuple = ((dimension[0] ** 2) + (dimension[1] ** 2),  dimension[0] * dimension[1])\n            \n            if cur_tuple > max_tuple:\n                max_tuple = cur_tuple\n                index = i   \n\n        return dimensions[index][0] * dimensions[index][1]\n\n```
['Python3']