# Grid Game: Interview Notes

Grid Game shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Robot 1 walks a 2-row grid (only right/down-from-row0) and zeroes the cells it visits; robot 2 then takes a path and scores the remaining prefix/suffix. Robot 1 minimizes robot 2's max leftover. Prefix sums: for each column where robot 1 drops, robot 2 gets max(top_right, bottom_left).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Letting robot 1 greedily take the globally largest cells, which can leave a huge leftover on the other row.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at linkjob.ai.