Skip to content

problem19.md

Latest commit

 

History

History
11 lines (8 loc) · 367 Bytes

problem19.md

File metadata and controls

11 lines (8 loc) · 367 Bytes

Problem 19: Atmospheric Catchment

Problem Statement

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Use a stack-based approach.

Input Format

  • An array of integers height.

Example

Input: height = [0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1]
Output: 6