Linked Lists for Technical Interviews - Full Course
ฝัง
- เผยแพร่เมื่อ 20 มิ.ย. 2024
- Learn how to solve linked list problems for coding challenges and interviews.
✏️ This course was developed by Alvin Zablan from Structy. Check out his channel: / alvintheprogrammer
🔗 Study more data structures and algorithms with Alvin in his complete course: structy.net/
⭐️ Course Contents ⭐️
⌨️ (0:00:00) Course Introduction
⌨️ (0:01:09) What is a Linked List?
⌨️ (0:09:22) Linked List Traversal
⌨️ (0:23:36) Linked List Values (structy.net/problems/linked-l...)
⌨️ (0:33:10) Sum List (structy.net/problems/sum-list)
⌨️ (0:42:31) Linked List Find (structy.net/problems/linked-l...)
⌨️ (0:51:03) Get Node Value (structy.net/problems/get-node...)
⌨️ (0:59:32) Reverse List (structy.net/problems/reverse-...)
⌨️ (1:09:50) Zipper Lists (structy.net/problems/zipper-l...)
🎉 Thanks to our Champion and Sponsor supporters:
👾 Raymond Odero
👾 Agustín Kussrow
👾 aldo ferretti
👾 Otis Morgan
👾 DeezMaster
--
Learn to code for free and get a developer job: www.freecodecamp.org
Read hundreds of articles on programming: freecodecamp.org/news
![แฟนแนวใด๋ - ยูริ โตเกียวมิวสิค [ SyncVersion ]](http://i.ytimg.com/vi/Fm8oDwos2uc/mqdefault.jpg)
I love Alvin's way of teaching. I loved his Dynamic programming video. Please ask him to make some more videos like Graphs and Trees.
He already made videos on those topics bruh
Graphs: th-cam.com/video/2_Uuixtc5i0/w-d-xo.html
Same here
@@spaceface2288 He's going to love them.
I've watched sooooooooo many TH-cam tutorials - this guy is legit the best teacher I've come across so far! Very clear. Thank you so much Alvin
I love Alvin's way of teaching! He's really a master! Thank you very much!
Best video on LL’s that I’ve seen. Thank you, Teacher Alvin!
Started learning linked list this week and could not understand the code for it at all until this video... Super appreciative, this community exists.
Thank you for this Alvin. I had a hard time refreshing linked list by watching countless tutorials and I can't understand why I can't move on with problems. While you are explaining, I am able to answer problems!
This is all you need to learn about linked-list. This is my fifth time viewing and I always seem to comeback and learn something new. It is such an amazing resource. Thanks @Alvin
Bro you explain so good that i've been able to perform the tasks without watching the whole video. Just got the idea and solved it by myself. I love you, Alvin. Happy New Year, mate!
same!
Really cool to see you here Alvin. Great explanations as usual
08:25 one small correction, the order of inserting a node to a linkedlist is that the node you wish to enter has to point first to the node and then you have to take node b to point on node q, if you start by pointing b to q first you will lose all the data of c and d. Great video !! loved it
yup, q.next = c then b.next = q
Oof, hate when people teach wrong things, they should have re edited the video
Hands down the best explanation for linked list. It finally clicked on me after 3 days banging my head against the wall. His algorithms are way more intuitive, both iterative and recursive versions, much much more than what other instructors talked about. Thank you!
I like the way Alwin simplifies the concepts and problems. learnt a lot. Thanks
Alvin is so to the point and voice is good to hear 🙌
Alvin you are the best programming sensei. This Linked List tutorial is just ridiculously good...
Your videos are awesome..Saw your video on Dynamic programming and since then i am not facing any problem in solving such questions.
Alvin we need more of you guys. Grow up your channel. You are a hero
Trust me, I was searching for an hour yesterday to find a good resource to learn Linked Lists. Thank you, FCC.
loved the explanation! Though I knew all these concepts before, I just watched anyway.
your courses're amazing!! I have an interview with google in a couple of hour, I hope your courses work for me !!!
did they
Absolutely the best tutorial video on linked lists. Thank you so much, Alvin! Fantastic teacher.
His tutorial are pure 💎
Completed complete video in one go, took me 4 hours.
Thanks Alvin!!
so on point.
then you forget it the next day haha
@@JustinK0 nope. It sticks with you onwards.
The concepts might be new, but a programmer shouldn't have any problem catching on.
All of these are just basic OOP codes deployed in novel ways
@@ezeanichucks3728 even as programmar you should just split it in hour long study and do continue next day. Whenever I watch in one go I usually forget some important things but when I learn them each day slowly they straight goes to my long term memory
@@JustinK0practice.. inserting.. deleting.. repeating or writing pseudo-code or writing it down on paper and it'll stick with you HARD
what an excellent teacher!
Awesome Video!!! thanks for the detail explanations.
Given a blind like because of Alvin👍…and added to my “Immediate watch” list 😀
Great video Alvin!
welcome back Alvin!
i rlly like the way you explain the problem step by step.
For the iterative Zipper implementation, we need a null check for head1 (ideally for head2 as well). if(head1 === null) return head2; if(head2 === null) return head1;
I love this! I never knew exactly what is a linked list until now and this gives me a ton of awesome ideas! Honestly, thank you very much!
Thanks. This is top notch. On my way to subscribe. Frankly best content ever. Quick and eloquent.
Thank you very much. The best explanaition of js linked lists
The best I have seen so far...Thank you so much... I just checked your platform to make a purchase to go deeper but I couldn't find C# language option (that's my core language).
I don't know if there will be room for that in the future?
I greatly benefited from this JavaScript version.
seeing alvin puts a smile on my face :)
Same.
The video that I had been searching. Thank you so much
You are amazing Alvin! I've learned a lot from you🙌
Bro your research and best way of analysis is amazing.
Who else find this list helpful ️️
Completed watching this tutorial, very informative, thanks a lot 🎉😊
omg who is this guy? He has the best algor interview videos !!
I just realized watching theory tutorials in other languages actually makes learning so much more intuitive, since you can't just blindly copy. You're forced to understand how your language works, and you're forced to implement those ideas without really being able to "cheat". Wow. I'm gonna start watching C tutorials and do them in python. I'm about to hit 10x developer once I understand all this
This is a very good point. I never realized this. This whole time I was trying to avoid tutorials in different languages, not realizing that they were the key to helping my solidify my understanding. Good observation!
same I was forced to code this in my learning language and I was surprised to see how quickly I learned
man this is the best explanation ever.
Amazing, this guy is dynamic and engaging
Love it as always! Big kudos!
Bro your research and best way of analysis is amazing.
Who else find this list helpful ❣️❣️
thank you! needed this video!
I love the way he explain and able to grasp things even though I am a beginner.
Excellent!
My dude is back!!!
Best explanation ever Now I'm much more confidence writing link list problem.
Great teacher!
Amazing !
What a co-incidence .tomorrow we have a amazon technical interview , hope It would help.
Alvin you are a great teacher.
All the members of your department are great
I wish you had Java as one of the programming languages, but I still loved your course and was able to interpret everything in Java because of how you explained the algorithms, it was so simple to even understand recursive, something I always mess up. Thank you!!
No
Thank you so much. You're the best!!!!
Fantastic!!!
Smooth Explanation.
great help! thank you
I love the way you teach 😍.
Please create a course on Backtracking.
Thank you, bro!
Excellent explanation
Beautiful!
Thank you!
As Always, Thanks a Trillion.....
♥️♥️♥️♥️♥️♥️♥️♥️🌿🌿🌿🌿🌿🌿
Best teacher ever!!!
Good job.
Thanks!
I love that you said "A"'s next is "B". That makes link list much easier to conceptualize than other sources which overly complicate it.
That's exactly how I see it
for zipperlist iterative approach, when you add the rest of the list that is leftover tail isn't reassigned to be the new tail. In this case, you're just using "tail" as a pointer to the current end of the constructed list. And tail isnt assigned at all in the recursive solution. Would there be an extra step to iterate through the leftover list to the end and reassign tail? Thanks for your great videos 🔥🔥🔥
muchas gracias !!!
Awesome vids helping me with my uni subject Foundations of Programming, they give us 15 small programming exercises every week for points that count to final mark and also credit and they gave us exercises such as programm ringbuffer using linked list, program queues and stack using linked list. Merge two ordered linked lists and so on xd
Thanks man, your recursive method is great
2nd watched.
Last zipper recursive method is not easily to understand.
Helpful always 👍
True
@@mrrishiraj88 This_Reply = True;
Thanks a lot!!!
Alvin the boss is back in the hood!!!!!!
ALVIN the GOAT!
thanks ...appreciate it
Nice!
Best video on LL for beginner
BEST LINKEDLIST VIDEO EVER
Thankyou Very Very Much🙂🙂🙂🙂🙂🙂
you have saved my life
Hands down the best algorithm explanations. $ Structy purchase.
very appreciated .. 😎🌹✌👍👌
best teacher :DD
I love this channel
The way you explain the link list, even a foolish can understand it. Thanks a lot 😊
Thanks
The Dynammic programming one was a blockbuster hence m here cheer
last zipper recursion was awesome beauty
cool , i am just wonder how did you do such a wonderful explation of animation ?
Alvin the boss
Thank you so much for the course , as always it's awesome!
Can somebody help me please and explain if instead of creating variable `currentHead` inside the function we'll just work with argument `head` and inside while loop just write `head = head.next`
It's working in both cases but I want to see if it's any downside in this approach or something like that.
Thanks in advance !
it's more complicated to read because of the cognitive overload, so for readability purposes it losses points.
now i'm gonna crush this ;)
Oh, thank you very much for such clear and understandable tutorial. It is really awesome and very helpful...
Realy nice teaching style. Just one question. @ 37:00 it says the space is O(n) for the recursive sumList function. That is true for how it is implemented. But couldn't we also achieve O(1) by passing the sum variable into every recursion like it's done with the recursive linkedListValues? Wouldn't hat be much more optimised?
From what I understand, space complexity of O(n) means, in the worst case there will be 'n' call stacks ( i.e when we reach the tail of the linklist), thus passing the integer as a argument will still create n call stacks, hence O(n).
@@atharvarane6165 then why is it different in the recursive version of linkedListValues?
@@iamlookto Must be a mistake, because the memory complexity is determined by the number of return statements because each function call will be stored on the program stack. To generalize, a recursive function's memory complexity is O(recursion depth). As our tree depth suggests, we will have n total return statements and thus the memory complexity is O(n).
this is literally the best video I seen on this. However, you said it can be anything in the data. However, in C# and Java would be different. it would have to be what you choose it to be because you have to initialize the type of data it has to enter so all the nodes would have integers. Am I right or am I wrong?
Good
Alvin is lit