Container With Most Water - Read Statement

Given $n$ non-negative integers representing heights of vertical lines, find two lines that form a container holding the most water.

The container's area is $\min(height[i], height[j]) \times (j - i)$.

Example: For heights [1,8,6,2,5,4,8,3,7], the max area is $49$ (between heights $8$ and $7$, width $7$).