Practice Container With Most Water

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#11

LeetCode Problem

Container With Most Water

Array Two Pointers Greedy

Problem Statement

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.

Source: Container With Most Water on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

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

Output

# Example 2

Input

height = [1,1]

Output

Constraints

n == height.length

2 <= n <= 10^5

0 <= height[i] <= 10^4

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free