Practice Trapping Rain Water
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Trapping Rain Water on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
height = [0,1,0,2,1,0,1,3,2,1,2,1]
Output
6
# Example 2
Input
height = [4,2,0,3,2,5]
Output
9
Constraints
n == height.length
1 <= n <= 2 * 10^4
0 <= height[i] <= 10^5
Related LeetCode Problems
Practice more problems similar to Trapping Rain Water.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.