54 - Design LRU cache using LinkedHashMap in Java

@backstreetbrogrammer

--------------------------------------------------------------------------------
SOLUTION: Design LRU cache using LinkedHashMap in Java
--------------------------------------------------------------------------------
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.

We can use LinkedHashMap constructor with "accessOrder" argument as TRUE and overriding "removeEldestEntry(Map.Entry)" method for implementing LRU cache.

public LinkedHashMap(int initialCapacity,
float loadFactor,
boolean accessOrder)

#java #javadevelopers #javaprogramming #javacodinginterview

[annapureddyravi]

Thank you sir ..Simple and nice explannation.