0011. Container With Most Water.md

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Notice that you may not slant the container.

/**
 * @param {number[]} height
 * @return {number}
 */
 /*
 Time complexity : O(n). Single pass.

Space complexity : O(1). Constant space is used.
Two pointer Yeah!!
 */
var maxArea = function(height) {
    let l = 0, r = height.length - 1, area = 0;
    while(l < r) {
        area = Math.max(area, Math.min(height[l], height[r]) * (r - l));
        if(height[l] < height[r]) {
            l++;
        } else {
            r--;
        }
    }
    return area;
};