Question: Write a simple implementation of an LRU (Least Recently Used) cache with a given capacity. If the cache is full, the least recently used item
- Write a simple implementation of an LRU (Least Recently Used) cache with a given capacity. If the cache is full, the least recently used item should be evicted when adding a new item.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
