Hi there NeuralNine, first of all, thanks for great video. Second, I think there's one case that you missed with function pop(). So it worked fine because normally we barely test with index 0. I guess you can consider this before we do the loop for i in range(index-1): I think we need to check for index is 0 to pop the first index. for linked_list, it will be: if index == 0: self.head = last.next for doubly linked list , it can be: if index == 0: last.next.prev = self.tail self.head = last.next
30:53 The key might be sticky; replacing the keycap might help, or cleaning the keyboard to remove dirt or debris around the key may help as well. If this won't work, adjusting the repeat rate may fix the issue via "kbdrate" on some Linux machines. Check your terminal using "man kbdrate" for more information. If adjusting the rate of keyboard responses does not fix the issue after checking for any debris on said keyboard, the keyboard may need replaced.
Could be the switch failing for the E key. I had an issue with a mouse right click switch that had similar symptoms. Sometimes no click; sometimes double click
@@theseb1979 There are switches for mice too? Thanks for the info. So, does that mean the keyboard will need replaced asap? Or, could they replace the switch for the E key easily?
Thanks for the tip, I returned the keyboard, bought the same again and the issue is now partly resolved. However I feel like the sensitivity of the red switches leads to keys being sent multiple times if I don't press them hard enough.
Very interesting but i think that in the pop() function (of the linked list) we get a problem when we put 0 as a index . i think we can fix this problem by adding a second part of code in the function if the index was 0 so in this code : self.head = last. next
good one thank you alot I wish if you could slow down and its better for me to make step by step progress, you made all the functions finally you try it once I mean if you could make one by one and try it also one by one I hope you understand my point 😅
Slowing down is difficult for me 😅 I like to show all function at once because they are somewhat related. I need to be able to visualize the content to see if the insertion works etc.
Depends on your use case of that data structure But, do note that if you are taking DSA as a course in your institution, there is like a 99% chance that you are required to return the popped value
We don't implement these data structures to use them in projects. We implement them to learn about them so that we can get better at problem solving and pattern recognition, which is a crucial skill. I agree, you will probably never use a class like this in a project.
@@NeuralNine Yes I totally agree on the pedagogy. What I mean is that for me as a non computer scientist / software engineer starting out with python it was never so clear why linked lists mattered. Until I learned what heap and stack are and how python lists are actually implemented.
Absolute legend, this new series is going to change people's lives!
I like these kinda video, the prep code is not prepared enough, and that makes this video more relatable, we're all just... human.
Yeah I noticed in the middle of it that I did not finish the Doubly Linked List example 😂
Literally what I am doing right know! I will check your solution as soon as I try to finish my own. Thanks!
I was looking for dsa in python and you dropped this vid.
Hi there NeuralNine, first of all, thanks for great video. Second, I think there's one case that you missed with function pop(). So it worked fine because normally we barely test with index 0. I guess you can consider this before we do the loop for i in range(index-1):
I think we need to check for index is 0 to pop the first index.
for linked_list, it will be:
if index == 0:
self.head = last.next
for doubly linked list , it can be:
if index == 0:
last.next.prev = self.tail
self.head = last.next
This is my seal. I have watched the entire video, understood it, and I can explain it in my own words, thus I have gained knowledge. This is my seal.
🎉
Thank you, sir! This is exactly what I need!
30:53 The key might be sticky; replacing the keycap might help, or cleaning the keyboard to remove dirt or debris around the key may help as well. If this won't work, adjusting the repeat rate may fix the issue via "kbdrate" on some Linux machines. Check your terminal using "man kbdrate" for more information. If adjusting the rate of keyboard responses does not fix the issue after checking for any debris on said keyboard, the keyboard may need replaced.
Could be the switch failing for the E key. I had an issue with a mouse right click switch that had similar symptoms. Sometimes no click; sometimes double click
@@theseb1979 There are switches for mice too? Thanks for the info.
So, does that mean the keyboard will need replaced asap? Or, could they replace the switch for the E key easily?
Thanks for the tip, I returned the keyboard, bought the same again and the issue is now partly resolved. However I feel like the sensitivity of the red switches leads to keys being sent multiple times if I don't press them hard enough.
@@JLSXMK8depends on the keyboard. I buy mechanical keyboards with hot swappable switches, so it’s easy.
❤🎉 Amazing
Great tutorial! IMHO __iter__ and reverse functions would be great to add
Very cool. I hope you will make a large playlist for DS using python
perfect ... i like your lessons very much
Thanks for watching!
Awesome!
Very interesting but i think that in the pop() function (of the linked list) we get a problem when we put 0 as a index . i think we can fix this problem by adding a second part of code in the function if the index was 0 so in this code : self.head = last. next
good one
thank you alot
I wish if you could slow down and its better for me to make step by step progress, you made all the functions finally you try it once
I mean if you could make one by one and try it also one by one
I hope you understand my point 😅
Slowing down is difficult for me 😅
I like to show all function at once because they are somewhat related. I need to be able to visualize the content to see if the insertion works etc.
Good. Do you have playlist for its C implementation?
A small question if you could help me, in insert you've used index - 1 but by default range function comes with -1 so what's happening? :)
very useful guide
Thanks!
I never used linkes list. On which case, linked list is usefull?
woow......................😌
Great
Sorry man, what whiteboard is that? Looks cool.
If you mean the physical one in the back, it's a simple Amazon Basics whiteboard. If you mean the digital one, it's MyPaint.
This is interesting
👍🏻
Hey was wondering if anyone can recommend a dsa library for python?
Great spaghetti meatballs (bugs).
Maybe you cover this later in the video cuz I haven't finished yet but shouldn't pop also return the value?
Depends on your use case of that data structure
But, do note that if you are taking DSA as a course in your institution, there is like a 99% chance that you are required to return the popped value
sir please solve some problems on these topics along these topics
I have the Codewars playlist where I solve coding challenges if you are interested in that.
Queues and Trees
Will be part of the series!
tactical comment
Одобрямс.
Never felt need for a linkedlist in python because lists are already dynamically allocated.
We don't implement these data structures to use them in projects. We implement them to learn about them so that we can get better at problem solving and pattern recognition, which is a crucial skill. I agree, you will probably never use a class like this in a project.
@@NeuralNine Yes I totally agree on the pedagogy. What I mean is that for me as a non computer scientist / software engineer starting out with python it was never so clear why linked lists mattered. Until I learned what heap and stack are
and how python lists are actually implemented.