Skip to content

Overview Resume Score

Practice

LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading problem

Trapping Rain Water · hard two pointers interview problem · Larpy

hard· two-pointers Mock interview

Trapping Rain Water

Given `height`, a list of non-negative bar heights each of width 1, compute how much rain water is trapped between the bars after it rains.

Figure

height by indexbar heighttrapped (computed)

Examples

in: height = [0,1,0,2,1,0,1,3,2,1,2,1]

out: 6

6 units pool in the dips

Constraints

0 <= len(height) <= 2*10^4
0 <= height[i] <= 10^5

Hints

target: O(n) time, O(1) space⌘↩ run · ⇧⌘↩ submit

More two-pointers problems

Valid Palindromeeasy
Widest Water Tankmedium
Two Sum II - Sorted Inputmedium
3Summedium
Sort Colorsmedium
3Sum Closestmedium