Trapping Rain Water
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.

30:00

Trapping Rain Water
hard
Topics
Companies

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.

Example 1:
Input: [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
Constraints:

  • n==height.lengthn == \text{height.length}

  • 1≤n≤2×1041 \leq n \leq 2 \times 10^4

  • 0≤height[i]≤1050 \leq \text{height}[i] \leq 10^5

Input
arr =[0,1,0,2,1,0,1,3,2,1,2,1]
0
L
1
0
2
1
0
1
3
2
1
2
1
R
Left Max
0
Right Max
1
Total Water

0

Variables
No variables to display
DepthFunction Call
Stack empty
0/56