Container With Most Water

Medium

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

Notice that you may not slant the container.

Example 1

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

Output: 49

Explanation: The vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water the container can contain is 49 (between index 1 and index 8).

Example 2

Input: height = [1,1]

Output: 1

Constraints

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

Show Hints (3)

Hint 1: Start with the widest container (pointers at both ends).

Hint 2: The area is limited by the shorter line. Move the pointer pointing to the shorter line inward.

Hint 3: Why? Moving the longer line inward will never increase the area (width decreases, and height is still limited by the shorter line).

Loading editor...

Test Results

Click "Run" to execute your code against test cases

AI Tutor

Socratic guidance - I'll ask questions, not give answers

AI Tutor

Hello! I'm your AI tutor, here to guide you through this problem using the Socratic method. I won't give you direct answers, but I'll ask questions and provide hints to help you discover the solution yourself. What's your first instinct when you look at this problem? What approach comes to mind?