A bounded cache that evicts least-recently-used and expires entries.
Name it
Say what this problem really is, professionally — the concept + when it bites.
Explain it out loud
Say it in your own words — but hit these: least recently used · eviction · accessorder · ttl · o(1)
checking microphone…
Code it (7-step rhythm, narrate)
Clarify → approach → data model → narrate → edge → test → tradeoff. AI off. Problem: LRU cache →
Edge cases — say + handle each
Say the trade-off
“A LinkedHashMap is the simple O(1) route; a manual map + doubly-linked list gives more control at more code.”
checking microphone…
Answer the follow-up
Why might a LinkedHashMap-based 'LRU' be silently wrong?
Catch the classic bug
Spot the wrong implementation in <60s. open the bug drill →