Container - The Formula

The area formula is: $A = (j - i) \times \min(h_i, h_j)$ where $h_i = height[i]$ and $h_j = height[j]$.

The width $(j - i)$ is the distance between lines. The height is limited by the shorter line (water spills over the shorter side).

You want to maximize this product. The brute force approach checks all pairs in $O(n^2)$ time. Can you do better?