Container With Most Water

Problem Statement

Given n non-negative integers where each represents a point at coordinate (i, height[i]). Find two lines that together with the x-axis form a container that holds the most water.

Approach

Use two pointers from both ends. Move the pointer pointing to the shorter line inward, as it limits the height.

Complexity Analysis

Examples

Example 1

Input: height = [1,8,6,2,5,4,8,3,7] Output: 49 Explanation: Lines at index 1 and 8

Example 2

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

Constraints

• ▸n == height.length
• ▸2 <= n <= 10^5
• ▸0 <= height[i] <= 10^4

Sign in to run your code...