# Garner Chinese Remainder Reconstruction: Study Guide
Garner Chinese Remainder Reconstruction shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build mixed-radix coefficients x = y0 + y1 m0 + y2 m0 m1 + ... so the representative is assembled without a final big modular inverse product.
## 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(k^2) for k moduli.
## Common mistake
Reducing only at the end and overflowing intermediate products when the moduli are large.
## 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 copilot.