Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 407. Trapping Rain Water II
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.