<ul><li>LRU (Least Recently Used) cache is a data structure that stores a limited number of items, prioritizing recently accessed items for fast access.</li><li>Caching involves temporarily storing frequently accessed data to reduce access time.</li><li>Cache Eviction is the process of removing items from the cache to free up space when it's full.</li><li>Cache Hit occurs when requested data is found in the cache, leading to fast retrieval; Cache Miss happens when the data is not present, necessitating retrieval from slower primary storage.</li></ul>

Interview Question: Implementing LRU Cache

Discover more