Two Pointers/Container With Most WaterMedium

This practice workspace is built for desktop. Open it on a larger screen to start solving.

Container With Most Water

Two Pointers·Medium

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 that holds the most water. Return the maximum amount of water the container can store.

Notice that you may not slant the container.

Examples

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

Output: 49

The lines at index 1 (height 8) and index 8 (height 7) form a container with area min(8,7) * (8-1) = 49.

Input: height = [1,1]

Output: 1

Input: height = [4,3,2,1,4]

Output: 16

Constraints

n == height.length
2 <= n <= 10^5
0 <= height[i] <= 10^4

00:00Preview Mode (Read Only)

Loading editor…

Tests

Preview Mode

This is a read-only preview of DSAMind's AI coaching. Sign up to get custom feedback on your own solution.

Passed32 ms

First attempt — retry to track metric movement here.

Your approach

Pattern:Two Pointers
Time:O(N)
Space:O(1)

Complete approach — pattern and complexity both named.

Coach

What you got right

You correctly matched the sorted input requirement and implemented a linear-time scan using two pointers.

Where it diverged

No divergence detected. The code correctly aligns with the stated approach.

Next attempt: focus on

Try solving related sliding window problems to build familiarity with two-pointer variants.

Signals

No signals fired — clean run, you stayed in flow.