Interview Q&A / Data Structures & Algorithms

1. How do you design an LRU cache with O(1) get and put?

   Combine a hash map for instant lookup with an ordering of recent use. In JavaScript a Map remembers insertion order, so deleting and re-inserting a key on each access moves it to the newest end; the oldest key is evicted when full.

   AdvancedQuick answerCoding1 min read