# Trapping Rain Water: Explained

Trapping Rain Water shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Water above i is min(maxLeft, maxRight) - height[i]. Two pointers with running left-max and right-max fill the side whose current max is smaller.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n) extra O(1).

## Common mistake

Precomputing both prefix arrays when the two-pointer version already uses constant space.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob.