code.davidloor.com
HHard· two-pointers· dynamic-programming· array

Trapping Rain Water

Trapping Rain Water

Given an array height representing an elevation map where the width of each bar is 1, compute how much water can be trapped after it rains.

Example

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

Constraints

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

Entry — trap

Grading — exact over 4 tests

Stuck? Browse algorithmic patterns → or read the Python / JS foundations.
Awaiting first run
Reference solution unlocks after a run & 60 s of work.