Notes / Low Level Design / 11 Classic Lld Interview Problems / 18 Cache Lru Lfu

18 — Cache (LRU/LFU)

Implements an in-memory cache with fixed capacity, exercising O(1) get/put eviction design via a hash map paired with a doubly linked list for LRU or frequency buckets for LFU.

Chapter Navigation
On This Page

18 — Cache (LRU/LFU)

Purpose

[stub: cache-lru-lfu]

Metadata

AuthorAmit Singh
Scopelow-level-design

Local graph

Full graph →