11. Container With Most Water
MediumTwo Pointers
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.
Examples
Input: [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: Lines at index 1 and 8 form a container with area 49.
Constraints
- n == height.length
- 2 <= n <= 10^5
- 0 <= height[i] <= 10^4
Loading...
Run checks all cases above. Submit evaluates all test cases.