Skip to content

Instantly share code, notes, and snippets.

@VarunSriram99

VarunSriram99/container_with_most_water.md

Last active November 30, 2024 05:13
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save VarunSriram99/8ef770f99b2d7f7380e4182d1cf0f052 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save VarunSriram99/8ef770f99b2d7f7380e4182d1cf0f052 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
container_with_most_water.md

Container With Most Water

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:

image

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

Output: 49

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

Example 2:

Input: height = [1,1]

Output: 1

Constraints:

  • n == height.length
  • 2 <= n <= 105
  • 0 <= height[i] <= 104
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment