Design a least-recently-used cache

Q: Design a least-recently-used cache

This question evaluates a candidate's understanding of data structures and algorithms for implementing an LRU cache, including choice of data structures, constant-time access and eviction policies, and correct handling of recency updates on reads and writes.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Design and implement a least-recently-used (LRU) cache with a fixed capacity. Support get(key) -> value and put(key, value) in average O(

time. When the cache is full, evict the least recently used entry. Explain your choice of data structures, detail how you update recency on reads and writes, and describe how you handle updates to existing keys, missing keys, and capacity edge cases (e.g., capacity = 0). Analyze time and space complexity.

Design a least-recently-used cache

Overview

Comments (0)