Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1 | Algorithms
Objective: Design and Implement a data structure Least Recently Used (LRU) Cache. Least Recently Used (LRU) Cache: You have given a cache (or memory) capacity. The cache will be filled with items you will access or look for it. The most recently accessed item will be at the top of the cache whereas least recently used cache will be at the end of the cache