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.
We'll cover the following...
We'll cover the following...
Statement
Given a 2D grid of integers of size (
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
. grid.length,grid[i].length...