Search⌘ K
AI Features

Solution: Minimum Moves to Spread Stones Over Grid

Solution: Minimum Moves to Spread Stones Over Grid asks you to transform a three-by-three grid into one with one stone per cell using the fewest adjacent moves.

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 ...