# Multi-Source BFS Distance Map: Practice Notes

Multi-Source BFS Distance Map shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Seed the queue with every source at distance 0 and expand once; each cell gets its nearest-source distance.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(cells).

## Common mistake

Running one BFS per source, which is quadratic.

## 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 AI interview helper that uses your resume.