Bounded Least-Recently-Used Cache
Asked at Microsoft · Coding Questions · Difficulty: Medium · Last asked Apr 21, 2026
Design a bounded cache that remembers the most recently used entries. When it is full and a new key arrives, it discards the entry that has gone unused for the longest time. Both lookups and inserts must stay fast as the cache grows.
Loading the problem…
More Microsoft interview questions
- LLM conceptual questions
- Roofline Analysis and Mixed-Precision Gradients for Matmul
- Tiny Next-Token Prediction Model (PyTorch Fill-In)
- Design Search Autocomplete / Typeahead
- Design a Chatbot Personalization / Memory System
- Design a Job Scheduler / ETL Pipeline