Container With Most Water

Medium

Topics
ArrayTwo PointersGreedy

Given an integer array height of length n, find two lines that together with the x-axis form a container holding the most water. Return the maximum area.

Example 1

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

Example 2

Input:  height = [1,1]
Output: 1

Constraints

  • 2 <= height.length <= 10^5
  • 0 <= height[i] <= 10^4
Run ⌘' · Submit ⌘⏎