Container With Most Water Python Solution

lcpy gen -n 11   # by problem number
lcpy gen -s container_with_most_water   # by problem name

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49

Input: height = [1,1]
Output: 1

class Solution:
    # Time: O(n)
    # Space: O(1)
    def max_area(self, height: list[int]) -> int:
        left = 0
        right = len(height) - 1
        max_area_so_far = 0

        while left < right:
            area = min(height[left], height[right]) * (right - left)
            max_area_so_far = max(area, max_area_so_far)
            if height[right] > height[left]:
                left += 1
            else:
                right -= 1

        return max_area_so_far