Container With Most Water — C# Coding Problem
Difficulty: medium | Category: two-pointers
Problem Description
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` - `2 <= n <= 10⁵` - `0 <= height[i] <= 10⁴` **Hint:** Use two pointers from both ends. Move the pointer with the smaller height.
Examples
Example 1
Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: Lines at index 1 and 8 hold max water.
Example 2
Input: height = [1,1]
Output: 1