This was really well done! Could you provide some examples where a linked list might be a preferred data structure? I feel like I don't see the more complex/less intuitive data structures in the real world and it'd be helpful to know where they ought to be.
I wanted to understand one thing ...that is time complexity of operations in LinkedIn list... isn't it is that we have to access and travel to a particular node to insert a particular node..so don't it become O(n)? Because access in linked list not being easy and each one being O(1).
Great video and clear explanation. One question about your implementation of Linked List in code, particularly the find functionality. Would this be used to understand where in the linked list a known valued element is? OR, is it used for finding and retrieving a given element of the linked list. It seems counterintuitive to use value as input for the second case.
How the complexity of inserting an item in the middle is O(1)? I think it should be O(n). If you store the tail then inserting in the end is O(1). But, to get the middle node you have to traverse to the middle and also you have to store the number of total items for that.
0:24 how is it fixed size If I can append more elements ? from array import array my_array = array('i', [1, 2, 3, 4]) print(my_array) my_array.append(6) print(my_array) -----output----- >>array('i', [1, 2, 3, 4]) >>array('i', [1, 2, 3, 4, 6])
Sorry to say this!. Please add a email verification method to your website. I typed a wrong mail address by accident. But It gave me access to the roadmap pdf.
I struggled to understand the differences between arrays and linked lists at college, you made it so simple! Thank you a lot!
I find fascinating how you make these topics so understandable through your animations I really ❤️ that and also, HOPE to see more DATA STRUCTURES 🙏
الحمدالله,
اللهم علمنا ما ينفعنا وانفعنا بما علمتنا إنك أنت العليم الحكيم 🙏
آمين .. أضف "أ" في وصف القناة (description) عندك في أول الآية لتكون (( ألا بذكر الله تطمئن القلوب )).
@@muhammadadel3566 جزاك لله خير
the visual explanation part is pretty good, hanks!
this playlist is a GEM! thank you so much!
This was really well done! Could you provide some examples where a linked list might be a preferred data structure? I feel like I don't see the more complex/less intuitive data structures in the real world and it'd be helpful to know where they ought to be.
Really appreciate the test cases at the end!
❤️ Best Data Structure course
I wanted to understand one thing ...that is time complexity of operations in LinkedIn list... isn't it is that we have to access and travel to a particular node to insert a particular node..so don't it become O(n)? Because access in linked list not being easy and each one being O(1).
Interesting, did you find out in the end?
Explain in a very easy way. Thank you so much Kamran bhai.
That's the best explanation I've ever heard! thanks
Nice demonstration. Thanks for the efforts.
These are so good man..keep these going.
Great video and clear explanation. One question about your implementation of Linked List in code, particularly the find functionality. Would this be used to understand where in the linked list a known valued element is? OR, is it used for finding and retrieving a given element of the linked list. It seems counterintuitive to use value as input for the second case.
It is really Awesome..
this topic is so understandable, i love how u animated this topic so good. thanks a lot !!! (sorry for my bad eng hehe)
clear explanation with good examples👏
Awesome bro!!
How the complexity of inserting an item in the middle is O(1)? I think it should be O(n). If you store the tail then inserting in the end is O(1). But, to get the middle node you have to traverse to the middle and also you have to store the number of total items for that.
peekTime O(n) + Operatin O(1) == O(n), but if we have the peektime(index) is O(1)
@@MiguelBeneditApa and how de we have peektime(index) with O(1) if we are not keeping index?
Thank you so much man.
Very well explained!
thank you so much !
I love the way you explained it i really wanna appreciate your effort
Looking forward for more videos from your side.
0:24 how is it fixed size If I can append more elements ?
from array import array
my_array = array('i', [1, 2, 3, 4])
print(my_array)
my_array.append(6)
print(my_array)
-----output-----
>>array('i', [1, 2, 3, 4])
>>array('i', [1, 2, 3, 4, 6])
amazing
I understood everything until the practical example at the end lol. Still learning C basics
I don't understand the "fixed in size" part. Could someone elaborate pls.
I need the implementation in Python
Sorry to say this!. Please add a email verification method to your website. I typed a wrong mail address by accident. But It gave me access to the roadmap pdf.
10.43
wow
Sir make web hacking basics and advance in ur roadmap.sh
Its awesome and helpful content ❤️