Given *n* non-negative integers *a _{1}*,

*a*, …,

_{2}*a*, where each represents a point at coordinate (

_{n }*i*,

*a*).

_{i}*n*vertical lines are drawn such that the two endpoints of line

*i*is at (

*i*,

*a*) and (

_{i}*i*, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

**Note: **You may not slant the container and *n* is at least 2.

**Example:**

Input:[1,8,6,2,5,4,8,3,7]Output:49

## Solution

### Java Program

class Solution { public int maxArea(int[] height) { //Two pointer Approach int l = 0, r = height.length-1; int maxArea = 0; while(l < r) { int heightMinimum = Math.min(height[l],height[r]); int width = r - l; int area = heightMinimum * width; maxArea = Math.max(area,maxArea); if(height[l] < height[r]) l++; else r--; } return maxArea; } }

Time Complexity: O(n)

Space Complexity: O(1)