Spread Nine Stones Across a Three-by-Three Grid with Minimum Moves
Company: American
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Online Assessment
Overview: Find the fewest orthogonal stone moves required to leave exactly one stone in every cell of a three-by-three grid.
Read the full American Software Engineer interview experience this question came from