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.