# Overview
LRU in caching is... #flashcard
An eviction policy for [[caching]] where the data that is least recently used (LRU) is evicted first. It is implemented using doubly [[linkedlists]] and [[hash table]]s. It is the most common approach.
<!--ID: 1751507776544-->
# Key Considerations
# Pros
- Easy to implement
# Cons
# Use Cases
# Related Topics