Skip to content
Today's problem
Algorithms
Algorithms
Roadmap
Problems
Articles
CS
Algorithms
/
Cache Eviction Policies
Systems
Intermediate
Cache Eviction Policies
When the cache is full, who gets evicted? Compare LRU, MRU, LFU, FIFO, and Clock replacement live.
5
Algorithms
✓
Custom inputs
Algorithms in this module
01
LRU (Least Recently Used)
O(1)
time
·
O(N)
space
▶ Visualize
02
MRU (Most Recently Used)
O(1)
time
·
O(N)
space
▶ Visualize
03
LFU (Least Frequently Used)
O(1)
time
·
O(N)
space
▶ Visualize
04
FIFO (First In, First Out)
O(1)
time
·
O(N)
space
▶ Visualize
05
Clock (Second Chance)
O(N)
time
·
O(N)
space
▶ Visualize
Every Cache Eviction Policies page
Cache Eviction Policies
LRU
MRU
LFU
FIFO
Clock