L9. Reverse a LinkedList | Iterative and Recursive 

00:10 Iterative Approach 14:39 Recursive Approach very nice explanation Striver! Understood!

U r not only teaching linkedlist u r teaching values to give back to this community.. Thankyou Striver

I was confused until I watched the dry run of recursion... Thanks for having Striver!..

Hands down, the best explanation on RU-vid!

Was a bit confused regarding recursive approach of this problem for a while. Your explanation just cleared out all of it. Great video!!❤💯

so beautiful so elegant just looking like a wow

Awesome man. The way you tried to portray the recursive one is actually over the moon..

recursive approach of soving linked list is awesome non of any youtuber has explained it such fantastically

Logic are crystal clear with your perfection in explanation , i don't even need to look code .

All the video lectures and the articles helped me a lot to gain confidence in DSA and will be helping me in the interviews. Thank you Striver bhaiya for bringing such amazing content for free.

Exceptional explanation !!! I've never intuitively understood recursive version of reversing a LinkedList, but this video helped me understand that too so easily🙇🙇

The dry run part is genius!! very nice explanation.

Kudos from the entire community for such beautiful explanation.

explanation of the recursive approach was just exceptional . thankyouu striver

The way he explains sounds like Arnab Goswami highlighting the news ! 😂

Crystal clear !!! Thanks for explaining the recursion topic soo beautifully and making it easier to understand. ❤

If you are a beginner or even an intermediate this is the best playlist to follow for DSA

Great explanation!!! The best i've ever seen on recursion !

Your DryRun thing in these recursion approaches is amazing

Recursion approach is just LIT , bhai kamal kr diya striver bhai

The recursion code is always a delight to understand , coz you think that how could be solved soo elegantly

BEST VIDEO ON RU-vid SEEN ALL

Brooo u are crazyyyy that dry run is the best i have seen thank you understood

Amazing explanation at recursive approach thank you striver for this amazing course😊🎉

Thank you for putting so much hardwork!

Finally I understood this recursive concept.........Nice Explanation👍👍

In iterative method use this , if you get null exception: Node temp = head; Node p = null; While(temp!=null){ Node curr = temp.next; temp.next=p; p=temp; temp=curr; } return p;

Is it me or anyone else also thinks that things have been a little tougher from Linked List

Awesome and hats off 🙏🙏 thank you so much Striver.

Loved the explanation for recursive solution, especially the DRY RUN

i love youuuu u r thee besttttt teacherrrrrrrr EVERRRRRRRRRRRRR

dry run makes the explanation clear.

Amazingly explained, #Striver rocks, gold bless you & all

Very well explained. Thanks

I was very confused with this recursive method, how does it reverse. It is super clear after watching your video !

UNDERSTOOD, Thank You So Much for this wonderful video...........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

you are a genius

thank you man tanks for clarifying the recursion from scratch

Thanks for that dry run approach

Dry run part was actually brilliant

understood very much thank you sir

you are god

Awesome Explanation!

best explanation ever!

greatest video superb sir !!

Broo your way of explaining is awesom👍👍

So Beautiful , So elegant just looking like a WoW

understood , best part was dry run of recursive code

best explanation ever

NICE LECTURE AND PLZ UPLOAD REMAINING LECTURES OF A TO Z SDA SHEET PLZ THEY ARE VERY HELPFULL FOR US

Striver i'm solving A2Z course and i'm at the strings but there is no video explanation for them. i searched videos on youtube but one explains in detail and clear like you. So can you PLEASE make videos on that topic(i will wait). Thank You

you are our god . thank you soo much

dry run was awesome

Even more concise: function reverseList(head, prev=null){ if(head === null) return prev; const next = head.next; head.next = prev; return reverseList(head.next, head); }

Simply the best!!!

Wow great explanation

Bro can you push the code ..The way you explain is very interesting to watch and learn the concepts.

Just Brilliant ❤

Understood

Recursive is damnn good!!

Awesome teaching

thanks for this explanation

Best video explanation

excellent explanation was just fabbb

Hey, I find your videos very valuable interms of understanding things, but just not able to find the links in the description whatever you mention in the video, not sure why. Thanks Striver for these videos.

Amazing explanation

understood ❤

Understood Thanks a lot ❣❣

what a man 👏👏

Thank you striver😃😃

UNDERSTOOD SIR

bhaiyaa app great ho❤❤❤❤

Great video

Amazing !!!

Bhai mere college ke professors ko nikal do, Raj bhai ko HOD bana do.

the BEST💯

Thank you bhaiya

Understood✅🔥🔥

Understood Will comeback after a month and report where I am.

bro is recording me aap bahut hi jyda tired dikh rhe ho.. aapko ek acche neend ki jrurat hai..

Understand ❤❤

Which process is the best you have to explain in 1 min through time n space complexity steps in the end which you didn't

big fan bhai luv you bhai

Thanks 🙏 sir

Thanks A lot

14:!4 The death stare

0:00 -4:58 = Brute Force (Using Stack) 5:00 - 14:45 = Iterative 14:50 = Recursive

Understooood

understood

What is this benefit of doing in recurssion

best best best best ...................................................................

Thanks ❤

🐐

understood!!!

Understood!

the beeesssttttttttt!!!!!

In recursive way m..I wrote the same code given above ..... Stack overflow error aa raha hain ....give me soln

Thanks

Recursive approach: 14:50

why can't we just change the head rather than using temporary node and then return the head;