# Freedom Trail: Interview Notes

Freedom Trail shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DP on (ring position, key index): from the current pointer, walk left or right to the next needed letter and take the cheaper spin plus one press.

## 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(n m).

## Common mistake

Always spinning the shorter visual arc without noticing two copies of the letter can make the longer-looking way cheaper.

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