# 11 Container With Most Water

Given `n` non-negative integers `a1,a2, ...,an`, where each represents a point at coordinate `(i,ai)`. `n` vertical lines are drawn such that the two endpoints of line `i` is at `(i,ai)` and `(i, 0)`. Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container and n is at least 2.

**The Idea:** Apply a greedy approach. Being with the widest lines (start and end) to first optimize the width. Then move `left`or `right`iterators, depending on whether or not it supports a height greater than the previous. In other words, ignore smaller heights until a larger one is found. An otherwise smaller height would be that the supported area will be smaller than the previous.

**Complexity:** O(n) time and O(1) space

```
int maxArea(vector<int>& heights) {
    int left = 0, right = heights.size() - 1;
    int max_water = 0;

    while (left < right) {
        int h = min(heights[left], heights[right]);
        max_water = max(max_water, h * (right - left));
        while (heights[left] <= h && left < right) 
            left++;
        while (heights[right] <= h && left < right) 
            right--;
    }

    return max_water;
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/11-container-with-most-water.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.