# Shortest Path Visiting All Nodes: Practice Notes
Shortest Path Visiting All Nodes shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
BFS on state (node, visited-bitmask); done when mask is full.
## 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(2^n * n^2).
## Common mistake
A Held-Karp DP that forgets you may revisit a node to reach others.
## 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 real-time interview help.