# Unique Paths III: Walkthrough

Unique Paths III shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Walk every empty square exactly once from start to end. DFS with a remaining-empty counter: a path is valid when you hit the end and remaining is zero.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, 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(4^{empty}).

## Common mistake

Stopping at the end as soon as you reach it, ignoring unvisited empty squares.

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