# Snakes And Ladders: Interview Notes

Snakes And Ladders shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

BFS on board labels 1..n^2; translate label to (r,c) with the boustrophedon order, then follow a snake/ladder if present.

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

## Common mistake

Applying a snake or ladder twice, or mis-mapping odd rows.

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