// Container With Most Water — MEDIUM

// Category: two-pointers

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 that holds the most water. Return the **maximum amount of water** it can contain.

**Constraints:**

- `n == height.length`

Example: height = [1,8,6,2,5,4,8,3,7]

Output: 49