How should I practice Sliding Puzzle?

Start by reading the full statement, solve the visible examples, then compare the pattern against related NVIDIA phone screen problems in FastPrep.

Is Sliding Puzzle associated with NVIDIA?

FastPrep tags this as a NVIDIA phone screen coding practice problem when the problem catalog has that company and stage context.

Sliding Puzzle

NVIDIA● HardFULLTIMEPHONE SCREEN

Learn

Problem statement

The 2 x 3 board contains tiles 1 through 5 and one empty cell 0. In one move, swap the empty cell with a tile directly above, below, left or right of it.

Return the minimum moves needed to reach [[1,2,3],[4,5,0]]. Return -1 if the target is unreachable.

Function

slidingPuzzle(board: int[][]) → int

Examples

Example 1

board = [[1,2,3],[4,0,5]]return = 1

Swap the empty cell with tile 5.

Example 2

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

Swapping the two numbered tiles changes the component; no sequence reaches the target.

Example 3

board = [[4,1,2],[5,0,3]]return = 5

The shortest path uses five legal swaps.

Constraints

board has exactly two rows and three columns.
Its six cells contain each integer from 0 through 5 exactly once.