In the **Leetcode Container With Most Water problem solution in Python programming,** You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store.

**Leetcode Container With Most Water problem solution in Python programming**

```
class Solution(object):
def maxArea(self, height):
l = 0
r = len(height) - 1
Max = 0
while l < r:
Max = max(Max, (r - l) * min(height[l], height[r]))
if height[l] < height[r]:
l += 1
else:
r -= 1
return Max
```

**Also read,**

- Leetcode Container With Most Water problem solution in C++
- Leetcode Container With Most Water problem solution in Java
- Leetcode Container With Most Water problem solution in C
- Leetcode Container With Most Water problem solution in C#