# Train Algorithm Old Gen GC: Explained
Train Algorithm Old Gen GC shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Divide the old generation into numbered trains and cars, collecting one car at a time and evicting popular objects to later trains.
## 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
Bounds pause time by the size of one car, independent of heap size.
## Common mistake
Moving a popular object into the same train that still holds pointers to it, which never lets that train become collectable.
## 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 here.