How To Reverse A Singly Linked List | The Ultimate Explanation (Iteratively & Recursively)

That was really helpful man. I'm grateful! Keep up with the good work!

I don't understand when the first iteration prev was NULL and what happens when we do curr.next=prev; prev=curr; what this do ıs also NULL pointer has block of memory and we are pointing to it ?

Keep up the good work! Doing a great job on the content.

Thank you 🤍🤍🤍

you got the concept right but you're missing alot of information on when the going backwards in the stack starts, the first iteration just returns it second step back next->next is not valid and then the third iteration back it starts setting everything.

I feel like this video needs a mosh pit, it's so intense hahaha

Thanks for the video! You simplified this so much for me!

Had to rewind a lot but first video that worked to understand it :)

You sir are awesome!

well explained

One of the more clear explanations of this god forsaken problem. Thank you

my homie always there to help me with data structures

you're amazing dude! Thanks a lot!

Very intense and a lot of excitement but the squeaky sounds of your shoes makes it difficult to hear and focus.

great explanation....I am able to visualize the recursion while you explain

Finally, I got it! Thank you so much for your video! Your channel is a hidden jam!

ily

f4ck recursion

Thank you so much bro

this was the best explanation

Am I watching an algo explanation or a basketball game Mr. Squeaks?

Very helpful video. However, if you could go slower and in a calmer manner, it would be more beginner friendly!

Life saver bro
Thanks for your kind explanation

Thnx! Finally, I got this logic of returning back after top to bottom😄

really love his way to explain this question🤣
he is so enthusiastic and energetic!

Thank you

took me sometime for me to digest. thank you.

this is the best explanation for listNode reverse! Really appreciate it !!

I loved this video and it was incredibly helpful! I have a question though; at the end of the recursive solution, wouldn't you have a mini (partial?) circular list between your final two values?

Where given
1 --> 2 --> 3 --> null
you end up with
3 --> 2 <--> 1? Where 1's next value is still 2 instead of null?

this was awesome and helped me out a lot. Thank you!

epic explaination.

You explained it very well

Damn! this is the best video I found. It just cleared all my doubts for reversing a linked list recursively. Thanks for the video.

Yoooo that went craazyyyy

Yea I subscribed. You had me on the edge of my seat the entire video like I'm watching a suspenseful movie.

Thank you man, helped me to understand this f***ing recursive approach

I found myself smiling as I watched this video because your passion and enthusiasm really shone through. Great explanation and good work!

can anyone help me with javascript solution

good job , ty for explain

Lay off the adderall.

Great Teacher man! Finally got the recursion when you could help me visualize going downwards then backup. Thank you man!!

This is literally the best explanation I have come across🙌

You explain so well. Thank You!❤❤

How is there so many people trying to solve this problem lmao

I finally understand this. Thank you.