#11.Container With Most Water [LeetCode Grind 75 in Java]

class Solution {
    public int maxArea(int[] height) {
        //two pointer approach
        int l = 0;
        int r = height.length - 1;
        int maxAr = 0;

        while(l < r){
            int area = (r - l) * Math.min(height[l], height[r]);
            maxAr = Math.max(maxAr, area);

            if(height[l] < height[r]){
                l ++;
            }else {
                r --;
            }
        }

        return maxAr;   
    }
}