L9. Reverse a LinkedList | Iterative and Recursive

[@pratulyapratap9329]

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

[@_SahilShah]

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

[@samreenimam8608]

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

[@user-wp7kd9dv6i]

same

[@tanisha999-e2w]

Hands down, the best explanation on KZbin!

[@aryanpinto5105]

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

[@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..

[@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.

[@surayahappy120]

so beautiful so elegant just looking like a wow

[@gauravmishra8782]

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

[@hardikkumarsingh]

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

[@sanchitsanyam7359]

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

[@1handclaps]

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

[@raghavgarg-oo6mx]

explanation of the recursive approach was just exceptional . thankyouu striver

[@AADITYASINGH-b2z]

Kudos from the entire community for such beautiful explanation.

[@dhruvsovasaria]

thankyou , tried to understand the recursive approach from everywhere before this since last night , finally understood

[@adityamukherjee2207]

bhaiyya thank u so much for this explanation tomorrow i have ds end sem exam and still this video helped me a lot . thank u so much.

[@Salman_Patel_07]

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

[@endlesslearning26]

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

[@ritikshandilya7075]

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

[@harshilpatel3205]

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

[@darshitsingh4378]

BEST VIDEO ON KZbin SEEN ALL

[@adveshdarvekar7733]

Thank you for putting so much hardwork!

[@MrRon-jx9vx]

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

[@surge3.14]

Your DryRun thing in these recursion approaches is amazing

[@honeyjot8709]

Loved the explanation for recursive solution, especially the DRY RUN

[@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👍👍

[@Rieshu-l9i]

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

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

[@arhamansari1312]

Excellent work. Thank you so much!!!

[@bhusanrath9698]

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

[@PeterParker-ee6ep]

dry run makes the explanation clear.

[@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).

[@stith_pragya]

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

[@amitarya4894]

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

[@AbhishekKumar-cd4gg]

understood , best part was dry run of recursive code

[@swathigp3818]

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

[@swagatrout3075]

thank you man tanks for clarifying the recursion from scratch

[@_thingsthatmatter]

i love youuuu u r thee besttttt teacherrrrrrrr EVERRRRRRRRRRRRR

[@FifthArima]

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

[@kalpking...4496]

understood very much thank you sir

[@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;

[@Ammmmmmmman]

Dry run part was actually brilliant

[@prathambhatia3040]

Thanks for that dry run approach

[@hiteshsharma9192]

Broo your way of explaining is awesom👍👍

[@AvijitGhosh-o1r]

Very well explained. Thanks

[@mohitparmar01]

best explanation ever!

[@adharapuramnavaneeth9925]

greatest video superb sir !!

[@prad2003]

best explanation ever

[@HemangSinghal-op5ep]

Awesome Explanation!

[@girirajsingh4467]

you are a genius

[@knowthrvdo]

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

[@adebisisheriff159]

Simply the best!!!

[@prathameshjadhav2942]

Awesome teaching

[@pavanKumar-hm7on]

you are our god . thank you soo much

[@pankajsunal9819]

thanks for this explanation

[@kumarnishantnitallahabad160]

Wow great explanation

[@saitehith6647]

Just Brilliant ❤

[@ojasviagrawal3180]

excellent explanation was just fabbb

[@rishu4800]

Amazing explanation

[@annapureddyravi4054]

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

[@ManasNandMohan]

So Beautiful , So elegant just looking like a WoW

[@lakshayverma6557]

dry run was awesome

[@ankithazra2005]

you are god

[@dhanushkiran-k3j]

Best video explanation

[@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

[@Arnavfellasleep]

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

[@codeman3828]

Great video

[@banothutharun2743]

what a man 👏👏

[@ABISHEK-r7k]

UNDERSTOOD SIR

[@KeerthiTummala296]

🥳💯 percent effective

[@instinct1098]

Recursive is damnn good!!

[@gauravbanerjee2898]

Understood Thanks a lot ❣❣

[@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.

[@aavashkuikel1341]

15:00 Recursion Starts

[@sibiranganath]

Recursive approach: 14:50

[@YourCodeVerse]

Understood✅🔥🔥

[@khalasianiket816]

understood ❤

[@diptamoy12]

bhaiyaa app great ho❤❤❤❤

[@SomalinBagarty]

Amazing !!!

[@manga_mania.]

Thank you striver😃😃

[@s.saranya2486]

the BEST💯

[@whitedevil2869]

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

[@Learnprogramming-q7f]

Thank you bhaiya

[@snehashisratna9074]

big fan bhai luv you bhai

[@NARUTOUZUMAKI-bk4nx]

Understooood

[@harigs72]

What is this benefit of doing in recurssion

[@rockstarCoolz]

Thanks 🙏 sir

[@ArpanChakraborty-do6yz]

Understand ❤❤

[@nishant4595]

the beeesssttttttttt!!!!!

[@surayahappy120]

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

[@DeepakPatel-d5v]

Thanks A lot

[@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

[@Ashutoshkumar-jx9wk]

Thanks ❤

[@hashcodez757]

9:45 Take U Forward

[@AnuragParoha-ck5ds]

understood!!!

[@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 ; }

[@adithyahegdekota2586]

14:!4 The death stare

[@codingalley6229]

🐐