Sliding puzzle solver
On a 2x3 board you have five tiles labeled 1..5 and one empty cell labeled 0. A move slides a tile adjacent (up/down/left/right) into the empty cell. Given the starting `board` as a 2x3 list of ints, return the minimum number of moves to reach the solved state `[[1,2,3],[4,5,0]]`. Return -1 if it is unsolvable.
Implement
sliding_puzzle(board: list[list[int]]) → intExamples
in
[[[1,2,3],[4,0,5]]]out1What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 35 min
solution.py
InputExpectedGot
[[[1,2,3],[4,0,5]]]1not run yetsample