MicrosoftCoding·45 minMembers
15-Puzzle Minimum Moves (BFS)
Members only
Given a 4×4 sliding tile puzzle state, return the minimum number of moves to reach the solved configuration (or `-1` if unreachable). Pure BFS on a state graph.
SWE
bfs
graph
grid
medium
Frequency
Single report
Last asked
2026-01-26
Stage
onsite-coding
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...