# LRU Cache With A Doubly Linked List: Walkthrough
LRU Cache With A Doubly Linked List shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A hash map points to list nodes; move a node to the front on access and evict from the tail.
## 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(1) get and put.
## Common mistake
Updating the map but not unlinking the old node, which leaks entries.
## 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 the Linkjob AI app.