# Overview
LFU on caching is... #flashcard
An eviction policy for [[caching]] where the data that is least frequently used (LFU) is evicted first. It is implemented using two doubly [[linkedlists]].
<!--ID: 1751507776547-->
# Key Considerations
# Pros
# Cons of LFU in Caching #flashcard
- Complicated to implement
<!--ID: 1751507776550-->
# Use Cases
# Related Topics