dsa-competitive-programming/leetcode/lc11/mostWater.cpp

class Solution{
    public:
        int maxArea(vector<int> &height){
            int maxArea = 0;
            int left = 0;
            int right = height.size()-1;
            while(left<right){
                maxArea = max(maxArea, (right-left)*min(height[left], height[left]));
                if(height[left]<height[right])
                    left++;
                else
                 right--;;
            }
            return maxArea;
        }
}