# Cuckoo Hashing Eviction Walk: Interview Notes
Cuckoo Hashing Eviction Walk shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Each key may live in one of two tables; on collision, evict the occupant to its alternate slot and follow the walk, kicking until a vacant slot appears.
## 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
Expected O(1) lookup (at most two probes) and expected amortized O(1) insert below a load-factor threshold.
## Common mistake
Not detecting a cycle in the eviction walk, which loops forever instead of triggering a rehash.
## 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 this tool.