LRU Cache - Explanation, Java Implementation and Demo

preview_player
Показать описание
Explanation and implementation of the LRU (Least Recently Used) Cache in Java. We do a hands on coding using Java and also try to run our cache.
This is also one of the very common interview questions asked in software engineering.

  1. Bhrigu Srivastava
  2. lru
  3. least recently used
  4. cache
  5. java
  6. programming
Рекомендации по теме
LRU Cache - 0:23:41

LRU Cache - Explanation, Java Implementation and Demo

LeetCode 146. LRU 0:18:00

LeetCode 146. LRU Cache (Algorithm Explained)

LRU Cache - 0:17:49

LRU Cache - Twitch Interview Question - Leetcode 146

LRU Cache - 0:12:52

LRU Cache - 146. LeetCode - Java

Implement LRU cache 0:12:25

Implement LRU cache

lru cache using 0:13:07

lru cache using java linked hashmap

LRU cache | 0:09:02

LRU cache | Live Coding with Explanation | Leetcode #146

Implementing LRU Cache 0:07:08

Implementing LRU Cache using LinkedHashMap in Java

[Java] Leetcode 146. 0:16:32

[Java] Leetcode 146. LRU Cache [Design #1]

LRU Cache || 0:22:37

LRU Cache || LEETCODE 146 || Detailed Explanation JAVA

Implement LRU Cache 0:17:05

Implement LRU Cache | Leetcode

LRU Cache Implementation 0:18:47

LRU Cache Implementation | Codewise explanation using Queue & Map | Java Code

L18. Implement LRU 0:24:56

L18. Implement LRU Cache

LRU Cache in 0:19:55

LRU Cache in Java

What is LRU 0:08:45

What is LRU cache?

Master Java's LinkedHashMap 0:06:44

Master Java's LinkedHashMap with this LRU Cache Implementation - LeetCode 146. LRU Cache

LRU cache | 0:06:33

LRU cache | Leetcode #146

Design and Implement 0:02:09

Design and Implement a Least Recently Used (LRU) Cache in Java interview

Lecture 17: What 0:10:52

Lecture 17: What is LRU Cache? | SPG | JAVA

Implement LRU Cache 0:17:18

Implement LRU Cache - LeetCode 146 | Least Recently Used Cache | Algorithm Explained - Java Solution

How to Implement 0:03:50

How to Implement LRU Cache in Java with a 5 Element Limit

LeetCode in Java 0:08:52

LeetCode in Java - LRU Cache

LRU cache implementation 0:13:40

LRU cache implementation | How to implement LRU cache in Java

[SOLVED!] LRU Cache 0:13:59

[SOLVED!] LRU Cache - LeetCode 146 - Java

Комментарии
Автор

In the 'put' function, inside 'if(currentNode != null)' there should be a 'return' in the end of this block. This is because we don't need to create new node if the node with that key is already present.
(or, put the remainig lines in that function in 'else' block).

The code gist on GitHub is updated

BhriguSrivastava
Автор

Very good explanation. Please load more videos.

akhilsrivastava
Автор

hi! the UseCache code is available somewhere? thanks for the tips!

gamopim
Автор

Thanks for the explaination! i think in put function, in block where currentNode !=null there should be return also.

gouravkumar
Автор

when it refers 4 again order must change, so as for 2 if you don't change order, how will you decide which need to delete for new entry?

dewendrapandey
Автор

Just one question in my mind.. If we are adding a new element and capacity is available, then why we are adding it at the beginning??

ankitgupta-phnk
Автор

Hey brother, there is a fundamental problem you have missed in the LRU .
lets say we have 2->4 ->7 and again there is 4 which is requested we need to adjust the linked list again to 4->2->7 coz 4 is now recently used and the order should be retained
lets say again 7 is hit, now the order will become 7->4>2 if you carefully observer now the least recently used is actually 2 - please fix this

rozersmith