Leetcode 11. Container With Most Water

Given heights of vertical lines at unit-spaced x-coordinates, pick two indices i<j to maximize the area min(height[i],height[j])*(j-i). With n up to 1e5, the problem requires a linear-time two-pointer/greedy approach instead of brute-force O(n^2).