This is by far the best explanation for this problem for me, you explained the whole thought process like why should we use map, why doubly linked list and not singly linked list etc. Thank you.
Use of the map data-structure kind of hand-waves over the interesting bits of the O(1) requirement. That is to say, how can we assert that the backing map impl actually is O(1) for insert & put? Presuming the Map is actually backed by a tree, i'd wager that O(1) ops are not actually O(1), but probably O(log n). If a hashmap is used, you can get O(1) time, but given that O(1) was a key requirement of the video, "just use a map" may or may not be adequate explanation if you need to defend the solution to someone such as an interviewer. Agree/disagree?
@Byte By Byte we are not storing which element is the least recently used in the map. How do we know that 3 is the next least recently used element from the map? So, how we can directly go to that element from the list and delete it when we try to get the next element?
We are maintaining the order in the linked list. So you remove the item from the end of the list and then looking it up in the map to remove it from there as well
jlstr Thanks! Glad you enjoyed it. And it’s an iPad app called Whiteboard Brush Whiteboard Brush by Lidong Chen apps.apple.com/us/app/whiteboard-brush/id496465537
Hi @bytebybyte u r earlier videos where u sit down and explains the problem and solves it was very effective than present few videos. Please start again same series of videos. Also explain how to use academic algorithms to solve leetcode problems. I find them very different and none of algorithm matches to most of leetcode problems.
I’m working on a bunch of new technical content. Let me know if there are any problems/algorithms you’d like to see me teach!
Graphs and DP
Dev- House any particular problems or algorithms?
Please work on leetcode.com/problems/unique-binary-search-trees/ (dp + trees)
it would be nice to see an explanation of KMP here
Karastuba Algorithm
This is by far the best explanation for this problem for me, you explained the whole thought process like why should we use map, why doubly linked list and not singly linked list etc. Thank you.
Lovely explanation man. The pace at which he talks and explains automatically makes it easy to understand.
Use of the map data-structure kind of hand-waves over the interesting bits of the O(1) requirement. That is to say, how can we assert that the backing map impl actually is O(1) for insert & put? Presuming the Map is actually backed by a tree, i'd wager that O(1) ops are not actually O(1), but probably O(log n). If a hashmap is used, you can get O(1) time, but given that O(1) was a key requirement of the video, "just use a map" may or may not be adequate explanation if you need to defend the solution to someone such as an interviewer. Agree/disagree?
after i spent couple of hours for different videos, this is the best which explain clearly between doubly linked list and map. thanks
Thank you for your video, I had seen other videos using your type of solution for this problem, but you were the first one who explained it clearly.
Do you have any code solution for that?
WHAT IF WE HAD A MAP WHERE THE VALUE IS A POINTER TO THE NODE
2:10 If 1 and 2 got added first, then 7 and 8 would go to the other end. You add items from the opposite end than where you remove items.
@Byte By Byte we are not storing which element is the least recently used in the map. How do we know that 3 is the next least recently used element from the map? So, how we can directly go to that element from the list and delete it when we try to get the next element?
We are maintaining the order in the linked list. So you remove the item from the end of the list and then looking it up in the map to remove it from there as well
Hi Sam! It’s about time someone created a clear explanation to this problem! Hey, what App is that for the digital whiteboard? Thanks!
jlstr Thanks! Glad you enjoyed it. And it’s an iPad app called Whiteboard Brush Whiteboard Brush by Lidong Chen apps.apple.com/us/app/whiteboard-brush/id496465537
Nice explanation.
You should do way more of these!
Hyperian that’s the plan! Anything specific you want to see?
@@ByteByByte
Spiral matrix 3
Thank you very much... A wonderful & nice explanation...
Thankss... I finally understood how map connects with the linked list. I've watched so many videos O.o
great video!
Best explanation ever!!
Nice explanation!
such a clear explanation
+1 on the doubly linked list
Having a problem with DP problems.
Did you ever figure them out and if so what resources helped the most
Thanks a lot man!!!!!
Expert level competitive programming algorithms.
Hi @bytebybyte u r earlier videos where u sit down and explains the problem and solves it was very effective than present few videos. Please start again same series of videos. Also explain how to use academic algorithms to solve leetcode problems. I find them very different and none of algorithm matches to most of leetcode problems.
Am I the only one who think The person, who posted it, is really hot?