Implement LRU cache with O(1) ops

Q: Implement LRU cache with O(1) ops

This question evaluates proficiency in cache design and efficient data structures, covering LRU eviction semantics, O(1) average-time get/put operations, update and missing-key behavior, concurrency/thread-safety considerations, and testing strategy within the Coding & Algorithms domain.

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 fixed-capacity cache supporting get(key) -> value and put(key, value) in O(

average time. When capacity is reached, evict the least recently used entry. Specify how recency is updated on get and put, how updates to existing keys are handled, what to return for missing keys, and discuss thread-safety options and testing strategy.

Implement LRU cache with O(1) ops

Overview

Comments (0)