Skip to main content
mediumNeetCode 150

LRU Cache

Design a cache that evicts the least recently used item when full. It's one of the few problems that tests both data structure intuition and clean API design. Interviewers love it because it reveals whether you can combine a hash map with a linked list to get O(1) operations. This pattern shows up constantly in systems design.

Arrays & HashingDesignLinked List

Chat with Fin or Coco right now on mobile.

Start talking through the problem here. Switch to desktop when you're ready to code and run tests.

Start coaching session
Coco
Fin

Meet your coaches

Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.

1LRU Cachemedium

Code + tests need a desktop

Chat works on this phone. Email yourself a link when you want the editor and tests.