Three OA Problems, One a Pizza Discount Simulation

First question: given a 3x3 grid with stones placed on it — some cells may have more than one stone, and some cells may be empty — move stones between adjacent cells so that every cell ends up with exactly one stone. Find the minimum number of moves needed. This corresponds to LeetCode 2850, Minimum Moves to Spread Stones Over Grid. Second question: given a set of 2D coordinate points (x, y) and…

Shared by a candidate · reported Sep 2026. Interview formats change; use it as a guide, not a script.