Code RoomTrapping rain water
HardPrep Room Coding #1609

Trapping rain water

CodingAlgorithms & data structuresSenior–Staff~35 min

Given an elevation map where each bar has width 1, return how many units of water it can trap after raining.

Implement
trap(height: list[int]) → int
Examples
in[[0,1,0,2,1,0,1,3,2,1,2,1]]out6
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

0:00 of about 35 min
InputExpectedGot
[[0,1,0,2,1,0,1,3,2,1,2,1]]6not run yetsample