LRU Cache Walkthrough (Leetcode #146)

Показать описание

In this video I walk through a solution for LRU Cache (Leetcode #146) to help with knowledge dictionaries and doubly linked lists.

Рекомендации по теме

Комментарии

God bless you, after countless Hindi lectures finally something which makes sense to me...

vladimirvisnovsky

I was surprised that this problem is ranked hard, not because I think it's super easy but bc of how clear your logic was, thank you!

NYmarlon

You were pretty honest overall! I liked the effort.

blitzspirit

Yes, a very clear presentation. Good work.
One small quibble: At ~11:40, the node.next should become prev.next since the insertion may not be exactly at the tail, right? Ditto for line 25 vis-a-vis the reference to tail. The nice thing about the head and tail sentinels is their facilitation of positional agnosticism (no need for special-casing in the linkage update for head/tail).

chronos

YOU ARE AWESOME!!!! This is really clear! Also, did you get your arms from programming??

ReneeSLiu-zxtj

Lucid Explanation. Can you please provide solutions for all leetcode solutions ?

hamsinisankaran

Amazing tutorial, very clear and conscience. Thanks!

reyou

Amazingly simple explanation. Thank you so much!

vigilo

What are we adding as the value into the dictionary?

demonpreet

Brolic. Great tutorial. Better than using Ordereddict().

colorfulcodes

Do you need a hahtable/dict? I imagine you can accomplish the same using a Set on known values.

andrewfacchiano

shouldn you be adding from the head and popping from the tail? And why use a double linked list when you can use a single linked list to implement a queue?

Soccercrazyigboman

Thank you so much. you made it look so much! :)

sourabhguptaurl

Thank you so much! This was so helpful!

linhphan

Good try but has some awkward conventions. First off, adding to the tail is unconventional, through me for a loop when its usually you add to the head. Also, noticed he isn't familiar with Python, strange syntax, "next" is a keyword in python. Could have just done a circular linked list instead. More than 50 lines of code in an interview is fine. I believe 100 lines for most interviews means you are doing something wrong.

joe-se

couldn't this be done with a hashtable ?

SulixD

can you do in C instead of python. I dont know python. what is best way to get in touch with you

dumbbel

didn't really no what you was talking about lol did you, maybe first you should learn it yourself before teaching others?

anon-slvp

LRU Cache Walkthrough (Leetcode #146)

LRU Cache Walkthrough (Leetcode #146)

LeetCode 146. LRU Cache (Algorithm Explained)

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

LRU cache | Leetcode #146

LRU cache | Live Coding with Explanation | Leetcode #146

Unleash Python's Power: Build an Ultra-Fast LRU Cache in Minutes - LeetCode 146. LRU Cache

LRU Cache - Leet Code #146

146. LRU Cache - Day 18/31 Leetcode July Challenge

Master LRU Cache with C++ | Efficient Coding with STL Library - 146. LRU Cache

Implement An LRU Cache - The LRU Cache Eviction Policy ('LRU Cache' on LeetCode)

Leetcode 146: LRU Cache

LRU Cache | lru cache | lru cache leetcode | leetcode 146

Master the LRU Cache with JavaScript's Map Object in Minutes - 146. LRU Cache

LRU Cache - Leetcode 146

LeetCode 146 LRU Cache

146. LRU Cache (Leetcode Medium)

146. LRU Cache. LeetCode Daily Challenges Explained (18.07.2023)

146. LRU Cache | Leetcode | Python

Leetcode 146. LRU Cache (DoubleLinkedList)

146 LRU Cache

Leetcode | Medium | 146. LRU Cache | Data Structure | Javascript

Leetcode 146 - LRU Cache

LRU Cache: 146 - interview question @ google, apple, amazon, meta, microsoft

Leetcode 146. LRU Cache - OrderedDict, and review Cache Eviction Policies