/leetcode 11/ container with most water - Two Pointer Approach : O(n)

leetcode11b.cpp

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