L9. Reverse a LinkedList | Iterative and Recursive

Problem Link: tinyurl.com/2a...
Entire LL Sheet: takeuforward.o...
Check our A2Z DSA Course: takeuforward.o...
Please do give us a like, and subscribe to us if you are new to our channel.
Do follow us on our socials: linktr.ee/take...

[@pratulyapratap9329]

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

[@samreenimam8608]

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

[@user-wp7kd9dv6i]

same

[@aryanpinto5105]

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

[@tanishagupta9997]

Hands down, the best explanation on UA-cam!

[@_SahilShah]

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

[@surayahappy120]

so beautiful so elegant just looking like a wow

[@durgeshjadhav01]

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

[@abid3801]

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

[@sanchitsanyam7359]

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

[@AmanSharma-xy1qm]

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.

[@hardikkumarsingh]

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

[@jeanishverma6898]

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;

[@gauravmishra8782]

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

[@1handclaps]

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

[@FifthArima]

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

[@raghavgarg-oo6mx]

explanation of the recursive approach was just exceptional .
thankyouu striver

[@MrRon-jx9vx]

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

[@ritikshandilya7075]

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

[@surge3.14]

Your DryRun thing in these recursion approaches is amazing

[@amitarya4894]

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

[@harshilpatel3205]

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

[@ddevarapaga5134]

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

[@ujjwalsingh6889]

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

[@prathambhatia3040]

Thanks for that dry run approach

[@rahuldwivedi4758]

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);
}

[@HemangSinghal-op5ep]

Awesome Explanation!

[@honeyjot8709]

Loved the explanation for recursive solution, especially the DRY RUN

[@mohitparmar01]

best explanation ever!

[@swathigp3818]

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

[@kalpking...4496]

understood very much
thank you sir

[@user-bc6ss6gp3z]

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

[@bhusanrath9698]

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

[@stith_pragya]

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

[@lakshayverma6557]

dry run was awesome

[@AbhishekKumar-cd4gg]

understood , best part was dry run of recursive code

[@girirajsingh4467]

you are a genius

[@_thingsthatmatter]

i love youuuu u r thee besttttt teacherrrrrrrr EVERRRRRRRRRRRRR

[@swagatrout3075]

thank you man tanks for clarifying the recursion from scratch

[@nuraynasirzade]

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

[@romanreigns4235]

Same bro

[@adharapuramnavaneeth9925]

greatest video superb sir !!

[@ankithazra2005]

you are god

[@hiteshsharma9192]

Broo your way of explaining is awesom👍👍

[@amanpratapsingh1981]

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.

[@sarthakkk8628]

you can find the links on his website whose link is in the description.

[@MayankisG]

Understood

[@annapureddyravi4054]

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

[@Ammmmmmmman]

Dry run part was actually brilliant

[@ManasNandMohan]

So Beautiful , So elegant just looking like a WoW

[@knowthrvdo]

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

[@aavashkuikel1341]

15:00 Recursion Starts

[@pradipthij3552]

best explanation ever

[@kumarnishantnitallahabad160]

Wow great explanation

[@hashcodez757]

9:45 Take U Forward

[@instinct1098]

Recursive is damnn good!!

[@sibiranganath]

Recursive approach: 14:50

[@rockstarCoolz]

Thanks 🙏 sir

[@khalasianiket816]

understood ❤

[@prathameshjadhav2942]

Awesome teaching

[@adebisisheriff159]

Simply the best!!!

[@ojasviagrawal3180]

excellent explanation was just fabbb

[@saitehith6647]

Just Brilliant ❤

[@pavanKumar-hm7on]

you are our god . thank you soo much

[@bushrahussain3005]

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

[@rishu4800]

Amazing explanation

[@pankajsunal9819]

thanks for this explanation

[@user-pc5gs7ru5o]

Best video explanation

[@Arnavfellasleep]

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

[@sumit2080]

understood

[@codeman3828]

Great video

[@gauravbanerjee2898]

Understood Thanks a lot ❣❣

[@banothutharun2743]

what a man 👏👏

[@user-dv1ts9db8i]

UNDERSTOOD SIR

[@diptamo]

bhaiyaa app great ho❤❤❤❤

[@user-tk2vg5jt3l]

Thank you bhaiya

[@justvibin6601]

Amazing !!!

[@adithyahegdekota2586]

14:!4 The death stare

[@manga_mania.]

Thank you striver😃😃

[@thenarmada007]

Man, I must say, wonderful video. You explained the recursive solution so well 🤌. I have a much deeper understanding of how to deal with recursion in general because of you. Usually, in recursion people skip through the nitty-gritty details like the current state of the variables involved and the structure of the linked list in intermediate steps, but you have gone through all of it, so thanks! Hope you get more views and subscribers.

[@YourCodeVerse]

Understood✅🔥🔥

[@s.saranya2486]

the BEST💯

[@user-or5oz1pk2x]

Thanks A lot

[@snehashisratna9074]

big fan bhai luv you bhai

[@CoderGrow1]

understand

[@ArpanChakraborty-do6yz]

Understand ❤❤

[@surayahappy120]

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

[@Ashutoshkumar-jx9wk]

Thanks ❤

[@whitedevil2869]

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

[@NARUTOUZUMAKI-bk4nx]

Understooood

[@AnuragParoha-ck5ds]

understood!!!

[@GGARIN.C.R]

20:04 check it out🤣

[@subee128]

Thanks

[@RituSingh-ne1mk]

Understood!

[@codingalley6229]

🐐

[@manasbhatia1191]

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

[@vibhavsharma2724]

I think it's you only.

[@aspirant500days7]

No man. I've given up on Linked last multiple times to reach this far (not even half).

[@Shivi32590]

Thank you Sir.

[@ashutosh61290]

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

[@takeUforward]

Pdhai kar lo, meko dekh kr kya hoga 🤦🏼‍♂️

[@aasimahsan6167]

@@takeUforward 😂

[@vatsaljain662]

@@takeUforward Thank You for your Hardwork Bhaiya

[@AbhishekKumar-nz9dn]

@@takeUforward 😂jainwin

[@GADDAMSAHITHYAKUMARRAJA]

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

[@Anime-ub7vs]

recursive solution of linked list
ListNode* reverseList(ListNode* head) {
if(head == NULL) return NULL ;
if(head->next == NULL ) return head ;
ListNode * newHead = reverseList(head->next);
head->next->next = head ;
head->next = NULL;
return newHead ;
}

[@utpalkant6354]

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

[@shreyanshvijoy4786]

Fab

[@anupkhismatrao9280]

❤