Available question text
Given an m x n height map, compute the total volume of water that can be trapped after raining across the 2D elevation grid. The typical hard-solution uses a min-heap multi-source BFS starting from the boundary to propagate the lowest enclosing height inward and accumulate trapped water as you visit lower neighbors.
Related questions
Continue with questions that share topics or the same question type.
- Calculate Trapping Rain Water
Coding
- Trapping Rain Water
Coding · Array · Dynamic Programming · Monotonic Stack
- Container With Most Water
Coding · Array · Greedy · Two Pointers
- Earliest Finish Time for Land and Water Rides I
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 407. Trapping Rain Water II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source