11. Container With Most Water take 2

class Solution:
    def maxArea(self, height: List[int]) -> int:
        largestSeen = 0
        i, j = 0, len(height) - 1

        while i < j:
            curArea = (j - i) * min(height[i], height[j])
            largestSeen = max(largestSeen, curArea)

            if height[i] > height[j]:
                j -= 1
            else:
                i += 1
        
        return largestSeen