LC 0011 [M] Container With Most Water - ALawliet/algorithms GitHub Wiki
class Solution:
def maxArea(self, height: List[int]) -> int:
res = 0
l = 0
r = len(height) - 1
while l < r:
area = (r - l) * min(height[l], height[r])
res = max(res, area)
if height[l] < height[r]:
l += 1
else:
r -= 1
return res