Container With Most Water

container-with-most-water.py

class Solution:
    def maxArea(self, height: List[int]) -> int:
        maxArea, currArea, l, r = 0,0, 0, len(height)-1
        
        while(l < r and l >= 0 and r <= len(height)-1):
            currArea = min(height[l],height[r]) * (r-l)
            if currArea > maxArea:
                maxArea = currArea # udpate the max area
            
            if height[l] < height[r]: # left pointer needs to be incremented
                l += 1
            else:  # both cases of height[l] > height[r] and height[l] == height[r]
                r -= 1
        return maxArea