← All questions
HardCoding
Trapping Rain Water II
Asked at
Twilio
1Give yourself 5 minutes
2Answer out loud, not in your head
3Then compare with the answer below
0
Stuck? Show a way to structure it+
- 01Push every boundary cell into a min-heap and mark visited.
- 02Pop the currently lowest enclosing boundary.
- 03Visit unvisited neighbors and add positive height difference.
- 04Push each neighbor with max(current boundary, neighbor height).
Reference answer
Then expect these follow-ups
Why must the heap start with the boundary?
Tests: problem transformation
What graph shortest-path idea is this similar to?
Tests: minimax paths
Free to read · better with Enzo
Practice this out loud with Enzo
Enzo runs it as a mock interview, pushes back with follow-ups, and grades you on the rubric.
Next question