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

In this video, I'm going to show you how to solve Leetcode 146. LRU Cache which is related to Design.
In fact, I also have a whole section of solving leetcode questions and categorize them: kzbin.info...
In the end, you’ll have a really good understanding on how to solve Leetcode 146. LRU Cache and questions that are similar to this Design.
Now, if you want to get good at Design, please checkout my Design playlist.
• Leetcode: Design

[@horcruxone]

Great work! Thanks!

[@AmyZahirski673]

Dude that was just superb, great job. Can you do Integer to English Words on leetcode?

[@maud9112]

What is the difference for implementing LRU for 4-way set associate? Is there any code for that?

[@TahliaYeseniaJones]

LOL! I did it with heaps and hashing, which is of more time complexity and takes more code for implementation.

[@EricProgramming]

I am glad that you like it

[@Anna78671]

There is another method of removing a node whose reference is given, copy the data from the next node and delete the next node. That way you dont even need a doubly linked list

[@EricProgramming]

That's also a good idea as well

[@algorithm69]

What if the element to remove is the last one ? You need to tell the previous one that it's now the last one.

[@LaytoyaThomas23]

Can you please explain LFU Cache as well? Thanks

[@EricProgramming]

Yes Steven, I did.