# 01 Matrix: Interview Notes

01 Matrix 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 0; each 1's distance is settled the first time it is reached.

## 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, Dijkstra, Union-Find, or interval 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

A separate BFS from every 1, which is O((mn)^2).

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