Container With the Most Water

Try to solve the Container With the Most Water problem.


You’re given an integer array height of length nn, and there are nn vertical lines drawn such that the two endpoints of the ithi^{th} line are (i,0)(i, 0) and (ii, height[i]).

Find two lines from the input array that, together with the x-axis, form a container that holds as much water as possible. Return the maximum amount of water a container can store.

Note: You may not slant the container.


  • n=n = height.length

  • 22 \leq nn 103\leq 10^3

  • 00 \leq height[i] 103\leq 10^3


Level up your interview prep. Join Educative to access 80+ hands-on prep courses.