NexCode
ProblemsSubmissions
HA
Problems
Connecting

42. Trapping Rain Water

Hard
ArrayTwo PointersDynamic ProgrammingStack

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.

Input

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

Expected

6