Skip to content

problem4.md

Latest commit

 

History

History
13 lines (10 loc) · 721 Bytes

problem4.md

File metadata and controls

13 lines (10 loc) · 721 Bytes

Problem 4: Maximum Volumetric Boundary (Container With Most Water)

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 i-th 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.

Input Format

  • An array of integers height.

Example

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.