# 10. 11. Container With Most Water

11\. Container With Most WaterMedium25.1K1.3KCompanies

You are given an integer array `height` of length `n`. There are `n` vertical lines drawn such that the two endpoints of the `ith` 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:**

![](https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg)

<pre><code><strong>Input: height = [1,8,6,2,5,4,8,3,7]
</strong><strong>Output: 49
</strong><strong>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.
</strong></code></pre>

**Example 2:**

<pre><code><strong>Input: height = [1,1]
</strong><strong>Output: 1
</strong></code></pre>

**Constraints:**

* `n == height.length`
* `2 <= n <= 105`
* `0 <= height[i] <= 104`

{% embed url="<https://leetcode.com/problems/container-with-most-water/>" %}

> time: O(n)

> space: O(1)

```jsx
/**
 * @param {number[]} height
 * @return {number}
 */

var maxArea = function (height) {
    let max = 0;
    let l = 0;
    let r = height.length - 1;
    while (l < r) {
        const h = Math.min(height[l], height[r]);
        const c = h * (r - l);

        if (max < c) max = c;
        if (height[l] === h) l++; else r--;
    }

    return max;
};
```