# Cheney Semispace Copying GC: Study Guide
Cheney Semispace Copying GC shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
From-space and to-space with a scan pointer that evacuates every reachable object exactly once, leaving a forwarding address behind.
## 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
Linear in the size of live data, not the whole heap.
## Common mistake
Forgetting to install a forwarding pointer, which copies the same object twice and breaks the object graph.
## 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 official website.