Tap here to switch tabs
Problem
Submissions

Problem: Minimum Moves to Spread Stones Over Grid

Minimum Moves to Spread Stones Over Grid gives a three-by-three grid and asks for the fewest moves to place one stone in every cell, moving one stone at a time to a side-adjacent cell.

Statement

Given a 2D grid of integers of size (3×33 \times 3), where each value represents the number of stones in the given cell, return the minimum number of moves required to place exactly one stone in each grid cell.

Constraints:

  • Only one stone can be moved in one move.

  • Stone from a cell can only be moved to another cell if they are adjacent (share a side).

  • The sum of all stones in the grid must be equal to 99.

  • grid.length, grid[i].length ==3 == 3

  • 0≤0 \le grid[i][j] ≤9 \le 9

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Minimum Moves to Spread Stones Over Grid

Minimum Moves to Spread Stones Over Grid gives a three-by-three grid and asks for the fewest moves to place one stone in every cell, moving one stone at a time to a side-adjacent cell.

Statement

Given a 2D grid of integers of size (3×33 \times 3), where each value represents the number of stones in the given cell, return the minimum number of moves required to place exactly one stone in each grid cell.

Constraints:

  • Only one stone can be moved in one move.

  • Stone from a cell can only be moved to another cell if they are adjacent (share a side).

  • The sum of all stones in the grid must be equal to 99.

  • grid.length, grid[i].length ==3 == 3

  • 0≤0 \le grid[i][j] ≤9 \le 9