class Solution:
    def maxArea(self, height: List[int]) -> int:
        i = 0
        j = len(height)-1
        res = 0
        area = 0
        while i < j:
            area = min(height[i],height[j])*(j-i)
            #print(area)
            res = max(res,area)
            if height[i]<height[j]:
                i+=1
            else:
                j-=1
        return res

class Solution:
    def maxArea(self, height: List[int]) -> int:
        i = 0
        j = len(height)-1
        res = 0
        area = 0
        while i < j:
            area = min(height[i],height[j])*(j-i)
            #print(area)
            res = max(res,area)
            if height[i]<height[j]:
                i+=1
            else:
                j-=1
        return res

#print(area)