@backstreetbrogrammer
--------------------------------------------------------------------------------
PROBLEM STATEMENT: Design LRU cache
--------------------------------------------------------------------------------
In computing, a cache is a hardware or software component that stores data so that future requests for that data can be served faster; the data stored in a cache might be the result of an earlier computation or a copy of data stored elsewhere.
A cache hit occurs when the requested data can be found in a cache, while a cache miss occurs when it cannot.
Cache hits are served by reading data from the cache, which is faster than recomputing a result or reading from a slower data store; thus, the more requests that can be served from the cache, the faster the system performs.
To be cost-effective and to enable efficient use of data, caches must be relatively small.
The Least Recently Used (LRU) cache is a cache eviction algorithm that organizes elements in order of use. In LRU, as the name suggests, the element that hasn't been used for the longest time will be evicted from the cache.
Design an LRU cache using Java provided API / collections - LinkedHashMap.
- Follow up
Design an LRU cache which uses classic data structures and is also thread safe.
Github: github.com/backstreetbrogramm...
- Top Java Coding Interview Problems Playlist: • Top Java Coding Interv...
- Apache Spark for Java Developers Playlist: • Apache Spark for Java ...
- Upgrade to Java 21 Playlist: • Upgrade to Java 21
- Java Serialization Playlist: • Java Serialization
- Dynamic Programming Playlist: • Dynamic Programming
#java #javadevelopers #javaprogramming #javacodinginterview
Негізгі бет Ғылым және технология 53 - Design LRU cache
Пікірлер