Leetcode - Container With Most Water
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]).
algorithm Leetcode Two Pointer series-bcdf5b3-Leetcode-Two-Pointer-Sliding-Window