LRU (Least Recently Used) Cache
hardData StructuresHigh freq+350 XPFrontend AlgoArena
Implement LRUCache(capacity) with .get(key) and .put(key, value) methods.
What it has to do
.get(key)returns value or -1 if absent, marking key as recently used..put(key, value)inserts or updates value. Evicts least recently used item when capacity is exceeded.
Where it's been asked
- Amazon
- Microsoft
- Meta
From public interview reports — a problem very like this one has shown up in a round at these companies. Not an exhaustive list.
Try it yourself· Edit the code, then press Run
Loading playground...
Ready to check it?
1 tests run against your code, right here in your browser. Sign in to claim the XP when you pass.
Need a nudge?
Reveal a conceptual hint or the reference solution. Both were written and reviewed with the problem — no runtime magic.
Discussion
Sign in to postSign in to join the conversation.Sign in
No comments yet. Be the first to say something.