cpp-flashcards/org/study_deck_02/dsa/two-pointers/0011-container-with-most-water.org

#+ANKI_DECK: study_deck_02
* TODO 0011. Container With Most Water :medium:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0011. Container With Most Water][0011. Container With Most Water]]
:END:

You are given an integer array ~height~ of length ~n~. There are ~n~ vertical lines drawn such that the two endpoints of the ~i^{th}~ line are ~(i, 0)~ and ~(i, height[i])~.

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return /the maximum amount of water a container can store/.

*Notice* that you may not slant the container.

*Example 1:*


#+begin_src
Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
#+end_src


*Example 2:*


#+begin_src
Input: height = [1,1]
Output: 1
#+end_src


*Constraints:*

 - ~n == height.length~

 - ~2 <= n <= 10^{5}~

 - ~0 <= height[i] <= 10^{4}~

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python :lc-problem 11 :lc-lang python3
class Solution:
    def maxArea(self, height: List[int]) -> int:
#+end_src

** TODO C++
#+begin_src cpp :lc-problem 11
class Solution {
public:
    int maxArea(vector<int>& height) {
        
    }
};
#+end_src