DSA problem
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 i-th 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.
Notice that you may not slant the container. The amount of water held between line i and line j equals the width (j - i) multiplied by the shorter of the two heights min(height[i], height[j]).
Examples
Example 1
Input:
height = [1,8,6,2,5,4,8,3,7]Output:
49Explanation: The lines at index 1 (height 8) and index 8 (height 7) form the container holding the most water. The area is min(8, 7) * (8 - 1) = 7 * 7 = 49.
Example 2
Input:
height = [1,1]Output:
1Explanation: The only container uses both lines: area is min(1, 1) * (1 - 0) = 1.
Constraints
- n == height.length
- 2 <= n <= 10^5
- 0 <= height[i] <= 10^4
3 hints and a full solution walkthrough with step-by-step visualizations are available in the practice editor.