Skip to content

Practice Sliding Puzzle

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#773
LeetCode Problem

Sliding Puzzle

ArrayDynamic ProgrammingBacktrackingBreadth-First SearchMemoizationMatrix

Problem Statement

On an 2 x 3 board, there are five tiles labeled from 1 to 5, and an empty square represented by 0. A move consists of choosing 0 and a 4-directionally adjacent number and swapping it. The state of the board is solved if and only if the board is [[1,2,3],[4,5,0]]. Given the puzzle board board, return the least number of moves required so that the state of the board is solved. If it is impossible for the state of the board to be solved, return -1.

Source: Sliding Puzzle on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
board = [[1,2,3],[4,0,5]]
Output
1

# Example 2

Input
board = [[1,2,3],[5,4,0]]
Output
-1

# Example 3

Input
board = [[4,1,2],[5,0,3]]
Output
5

Constraints

board.length == 2
board[i].length == 3
0 <= board[i][j] <= 5
Each value board[i][j] is unique.

Related LeetCode Problems

Practice more problems similar to Sliding Puzzle.

37 Sudoku Solver Hard22 Generate Parentheses Medium36 Valid Sudoku Medium1 Two Sum Easy4 Median of Two Sorted Arrays Hard
← Previous Jewels and StonesNext → Global and Local Inversions

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free