# Walls And Gates: Interview Notes

Walls And Gates shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Multi-source BFS from every gate, filling empty rooms with distance; walls stay -1 and gates stay 0.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS/DFS, union-find, topological sort, or tree DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(mn).

## Common mistake

Running a separate BFS from each empty room.

## 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 this tool.