Available question text
Given a 3x3 grid containing nine stones (possibly stacked), compute the minimum number of adjacent side moves needed to reach a configuration with exactly one stone in each cell. This is equivalent to assigning each stone to a unique target cell while minimizing total Manhattan distance — solvable with min-cost bipartite matching or min-cost flow.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2850. Minimum Moves to Spread Stones Over Grid
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source