mediumTwo Pointers Pattern
Container With Most Water
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:
height = [1,8,6,2,5,4,8,3,7]Output:
49Explanation: Lines at index 1 (height 8) and index 8 (height 7) form the largest container.
Hints (0/3)
Try to solve it first! Click "Reveal Next Hint" if you get stuck.
Your Code:
Results:
Output
Click "Run" to execute your code