Skip to main content

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.

Problems7 / 152
Sign in

Container With Most Water

MEDIUMArrayTwo 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.

Example 1

Input:  height = [1,8,6,2,5,4,8,3,7]
Output: 49

Example 2

Input:  height = [1,1]
Output: 1
Show hint

Use two pointers from both ends. Always move the pointer with the smaller height, as moving the larger one won't increase the area.

Draft saves automatically

Loading editor...

Submit also runs hidden tests
height =
[1,8,6,2,5,4,8,3,7]
Expected
49
Run with your own input (JSON)