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

[@tanisha999-e2w]

Hands down, the best explanation on TH-cam!

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

[@abid3801]

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

[@monikarawat5125]

Right actually over the moon 🌝 sir 🙏🏻🙏🏻taught us the beauty of recursion beautifully and factually ❤😇

[@aryanpinto5105]

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

[@1handclaps]

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

[@durgeshjadhav01]

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

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

[@pranavdharkar]

recursive approach is explained crystal clear in the documentation article

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

[@NidhiKumari-vu3oj]

I am amazed by the recursive solution and loved the dry run...thank you so much!!!! :)

[@gauravmishra8782]

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

[@surayahappy120]

so beautiful so elegant just looking like a wow

[@raghavgarg-oo6mx]

explanation of the recursive approach was just exceptional .
thankyouu striver

[@ritikshandilya7075]

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

[@MrRon-jx9vx]

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

[@AADITYASINGH-b2z]

Kudos from the entire community for such beautiful explanation.

[@Salman_Patel_07]

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

[@surge3.14]

Your DryRun thing in these recursion approaches is amazing

[@ddevarapaga5134]

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

[@harshilpatel3205]

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

[@endlesslearning26]

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

[@dhruvsovasaria]

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

[@darshitsingh4378]

BEST VIDEO ON TH-cam SEEN ALL

[@PCCOERCoder]

Lecture successfully completed on 27/11/2024 🔥🔥

[@nithins6273]

did u complete whole linked list playlist?

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

[@vedikamishra009]

@@vibhavsharma2724 🙂

[@saitamathecoder1386]

Just you buddy

[@adveshdarvekar7733]

Thank you for putting so much hardwork!

[@ujjwalsingh6889]

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

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

[@Ammmmmmmman]

Dry run part was actually brilliant

[@Rieshu-l9i]

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

[@honeyjot8709]

Loved the explanation for recursive solution, especially the DRY RUN

[@_thingsthatmatter]

i love youuuu u r thee besttttt teacherrrrrrrr EVERRRRRRRRRRRRR

[@hiteshsharma9192]

Broo your way of explaining is awesom👍👍

[@FifthArima]

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

[@amitarya4894]

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

[@adharapuramnavaneeth9925]

greatest video superb sir !!

[@swagatrout3075]

thank you man tanks for clarifying the recursion from scratch

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

[@cjonyoutube3011]

Beautifully explained

[@ankitghanshala7382]

head->next in recursive call is the head for base condition..so the function returns last node after head->next recursive call for the second last node is called.

[@swathigp3818]

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

[@arhamansari1312]

Excellent work. Thank you so much!!!

[@kalpking...4496]

understood very much
thank you sir

[@dharmeshkumarkhairnar6583]

Good Approach!

[@lakshayverma6557]

dry run was awesome

[@adebisisheriff159]

Simply the best!!!

[@mohitparmar01]

best explanation ever!

[@PratibhaSharma-h7b]

Thanks a ton Striver
.

[@girirajsingh4467]

you are a genius

[@prathambhatia3040]

Thanks for that dry run approach

[@HemangSinghal-op5ep]

Awesome Explanation!

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

[@highfiveseries2244]

12/22/2024 _Good Explanation Striver bhaiya ❤

[@saitehith6647]

Just Brilliant ❤

[@kumarnishantnitallahabad160]

Wow great explanation

[@prad2003]

best explanation ever

[@AvijitGhosh-o1r]

Very well explained. Thanks

[@AbhishekKumar-cd4gg]

understood , best part was dry run of recursive code

[@prathamesh009m]

Awesome teaching

[@ojasviagrawal3180]

excellent explanation was just fabbb

[@KrishnaKumar-b4m9p]

in the recursive code instead of assigning head->next as front everytime and then operating on front to point it to head we can do a simple more approach with just 2 lines. we can directly tell head's next pointer to point towards head and at last tell head to point towards null. easy peasy just 2 line code. Here is the code-
ListNode* reverse(ListNode* head){
if(head==nullptr || head->next==nullptr){
return head;
}
ListNode* newhead= reverse(head->next);



head->next->next = head; // Point the next node's next to the current node
head->next = nullptr;


return newhead;

}

[@KrishnaKumar-b4m9p]

will anyone tell me whats the benefit of learning recursive solution if its time complexity is still same as the simple method in which we were changing the links?

[@AshwaniKumar-ew1cn]

Superb!

[@dhanushkiran-k3j]

Best video explanation

[@knowthrvdo]

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

[@rishu4800]

Amazing explanation

[@codeman3828]

Great video

[@shwetachoudhary9003]

got it soo well❤

[@PeterParker-ee6ep]

dry run makes the explanation clear.

[@__.redcode._]

t1 = head; // Initialize t1 to point to the head
t3 = NULL; // Initialize t3 as NULL (previous pointer)
t4 = t1->next; // Initialize t4 to the second node in the list
t2 = NULL; // Initialize t2 as NULL
int c = 1; // Start with c = 1
while (t4 != NULL) {
if (c == 1) {
c--; // Decrement c
t2 = t1; // Set t2 to point to t1
t4 = t2->next; // Move t4 to the next node
t1->next = t3; // Reverse the link for t1
t3 = t2; // Move t3 forward to t2
} else {
c++; // Increment c
t3 = t4->next; // Store the next node of t4 in t3
t1 = t4; // Move t1 forward to t4
t4->next = t2; // Reverse the link for t4
t2 = t1; // Move t2 forward to t1
t4 = t3; // Move t4 forward to the next node
}
}
head = t1; // Update head to the new first node after reversal
this might be a complex alternative , was for me when i deduced for the first time ;) and little bit of confusion removal by GPT my friend in need
using swapping the pointers and accessing their respected node's next for reversing the linked list

[@sibiranganath]

Recursive approach: 14:50

[@pankajsunal9819]

thanks for this explanation

[@SomalinBagarty]

Amazing !!!

[@banothutharun2743]

what a man 👏👏

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

[@YourCodeVerse]

Understood✅🔥🔥

[@deepakff7498]

bhaya u r the best

[@gauravbanerjee2898]

Understood Thanks a lot ❣❣

[@pavanKumar-hm7on]

you are our god . thank you soo much

[@aavashkuikel1341]

15:00 Recursion Starts

[@ABISHEK-r7k]

UNDERSTOOD SIR

[@s.saranya2486]

the BEST💯

[@shouryadubey2878]

watched 2 times then i understood code flow completely

[@ManasNandMohan]

So Beautiful , So elegant just looking like a WoW

[@RamkumarB-k5r]

I understood bro...

[@ankithazra2005]

you are god

[@diptamoy12]

bhaiyaa app great ho❤❤❤❤

[@RohanWaniMIT]

Love you striver

[@ArpanChakraborty-do6yz]

Understand ❤❤

[@snehashisratna9074]

big fan bhai luv you bhai

[@manga_mania.]

Thank you striver😃😃

[@khalasianiket816]

understood ❤

[@hashcodez757]

9:45 Take U Forward

[@rockstarCoolz]

Thanks 🙏 sir

[@annapureddyravi4054]

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

[@mainakdasgupta7130]

thank you man

[@Learnprogramming-q7f]

Thank you bhaiya