# Sliding Puzzle: Explained

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

## Key idea

BFS on the 2x3 board state graph; each state is a string, and the blank slides into its 2-4 neighbors.

## 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(6!).

## Common mistake

A* without a visited set, which can loop forever on this tiny but cyclic space.

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