# Unique Paths III: Explained

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

## Key idea

DFS/backtracking that walks every empty square exactly once; increment the answer when you reach the end with zero empties left.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, 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(3^{empty}).

## Common mistake

Stopping at the end as soon as you touch it, without checking that every empty cell was visited.

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