Test your understanding of various coding challenges focusing on algorithm efficiency.

Coding

Challenge Yourself

#
## Statement

You're given an integer array `height` of length $n$, and 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 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 =$ `height.length`

- $2 \leq$ $n$ $\leq 10^3$

- $0 \leq$ `height[i]` $\leq 10^3$

## Examples

Try to solve the Container with Most Water problem.

Container with Most Water

Practice daily coding challenges to help you code harder, think sharper, and build dev muscle!

Action	Tickets Earned
Complete Daily Challenge	+1
10-Day Streak	+10
20-Day Streak	+20
30-Day Streak	+30
LinkedIn post with #30DaysofCode Everyday (and tag Educative)	+2 per post
Most-Liked Post Overall	+20
Top of Leaderboard	+50
Leaderboard: 2nd place	+30
Leaderboard: 3rd place	+20

Action	Tickets Earned
Complete Daily Challenge	+1
10-Day Streak	+10
20-Day Streak	+20
30-Day Streak	+30
LinkedIn post with #30DaysofCode Everyday (and tag Educative)	+2 per post
Most-Liked Post Overall	+20
Top of Leaderboard	+50
Leaderboard: 2nd place	+30
Leaderboard: 3rd place	+20

Problem: Container with Most Water

Statement

Problem: Container with Most Water

Statement