Tap here to switch tabs
Problem
Submissions

Problem: Container with Most Water

Container with Most Water gives an array of line heights. Choose two lines that form a vertical-sided container with the x-axis and return the greatest amount of water it can hold.

Statement

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.

Constraints:

  • n=n = height.length

  • 2≤2 \leq nn ≤103\leq 10^3

  • 0≤0 \leq height[i] ≤103\leq 10^3

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Container with Most Water

Container with Most Water gives an array of line heights. Choose two lines that form a vertical-sided container with the x-axis and return the greatest amount of water it can hold.

Statement

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.

Constraints:

  • n=n = height.length

  • 2≤2 \leq nn ≤103\leq 10^3

  • 0≤0 \leq height[i] ≤103\leq 10^3