# Zuma Game: Practice Notes

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

## Key idea

BFS or memoized DFS over (board, hand). Insert only next to a matching color (plus a few edge cases) and collapse chains repeatedly after each insert.

## 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

Exponential, small inputs.

## Common mistake

Forgetting chain reactions after the first removal.

## 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 AI interview helper that uses your resume.