**LRU (Least Recently Used)** is an algorithm that determines how the data is handled when the cache is full. When the cache memory is full, LRU selects the data that is least recently used and it's removed from the cache memory. The priority of the data is set based on importance of the data. If the data is fetched/updated recently, the priority is set as a highest. You can think of it as moving the item on top of the list, where last item from the list is removed if the cache is full. If the data was not used for given operation - eventually it would land to the bottom of the list and it would be removed. ### See also 1. [[What is the difference between LRU and LFU cache?]] ### Reference 1. [LRU Cache - Geeksforgeeks](https://www.geeksforgeeks.org/lru-cache-implementation/)