3000-maximum-area-of-longest-diagonal-rectangle.py

# time complexity: O(n)
# space complexity: O(1)
from math import sqrt
from typing import List


class Solution:
    def areaOfMaxDiagonal(self, dimensions: List[List[int]]) -> int:
        maxDiagonal = 0
        result = 0
        for length, width in dimensions:
            if sqrt(length ** 2 + width ** 2) > maxDiagonal:
                maxDiagonal = sqrt(length ** 2 + width ** 2)
                result = length * width
            elif sqrt(length ** 2 + width ** 2) == maxDiagonal:
                result = max(length * width, result)
        return result


dimensions = [[9, 3], [8, 6]]
print(Solution().areaOfMaxDiagonal(dimensions))
dimensions = [[3, 4], [4, 3]]
print(Solution().areaOfMaxDiagonal(dimensions))
dimensions = [[4, 7], [8, 9], [5, 3], [6, 10], [2, 9], [3, 10], [2, 2], [5, 8], [5, 10], [5, 6], [8, 9], [10, 7], [8, 9], [3, 7], [2, 6], [5, 1], [7, 4], [1, 10], [1, 7], [6, 9], [3, 3], [4, 6], [8, 2], [10, 6], [7, 9], [9, 2], [1, 2], [3, 8], [10, 2], [4, 1], [9, 7], [10, 3], [6, 9], [9, 8], [7, 7], [5, 7], [5, 4], [6, 5], [1, 8], [2, 3], [7, 10], [3, 9], [5, 7], [2, 4], [5, 6], [9, 5], [8, 8], [8, 10], [6, 8], [5, 1], [
    10, 8], [7, 4], [2, 1], [2, 7], [10, 3], [2, 5], [7, 6], [10, 5], [10, 9], [5, 7], [10, 6], [4, 3], [10, 4], [1, 5], [8, 9], [3, 1], [2, 5], [9, 10], [6, 6], [5, 10], [10, 2], [6, 10], [1, 1], [8, 6], [1, 7], [6, 3], [9, 3], [1, 4], [1, 1], [10, 4], [7, 9], [4, 5], [2, 8], [7, 9], [7, 3], [4, 9], [2, 8], [4, 6], [9, 1], [8, 4], [2, 4], [7, 8], [3, 5], [7, 6], [8, 6], [4, 7], [25, 60], [39, 52], [16, 63], [33, 56]]
print(Solution().areaOfMaxDiagonal(dimensions))