L4. Reverse a DLL | Multiple Approaches

Problem Link: tinyurl.com/mw45vuf6
Entire LL Sheet: takeuforward.org/linked-list/...
Check our A2Z DSA Course: takeuforward.org/strivers-a2z...
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/takeuforward

[@purushottam108]

17:21 "And the interviewer will hire you,no worry" best part🤑🤑🥰🥰

[@Thunder97654]

😂

[@qihse1531]

This simple problem is insanely hard to me...thank you Striver!!

[@aravindsagar9433]

instead of using next ad back which is a bit ambiguous you could've used next and previous ( prev ) which will be more understandable

[@itsorcus649]

🤓

[@harshitgarg2820]

Loved your dedication sir, completed this ques and loving this series like all others. Top-tier content🔥🔥

[@keshavchoudhary8857]

this type of great content cannot be found elsewhere , Excellent!!!

[@hermionegranger7443]

Is kunal kushwaha better or this one?

[@Ayush37262]

​@@hermionegranger7443I think Striver, Kunal is more into Controversies

[@user-jw2sz7in7x]

you are the boss .. please make a playlist about competitive programming.

[@Sunny-hg5oe]

Great thought of using the stacks!!!!

[@RRR-qv1so]

Thank you for this amazing playlist bhaiya ❤❤

[@shubhamanand8557]

It really helps me to understand in a very easy manner.
Thanks a lot bhaiya.

[@shanipratapsingh916]

Thank you sir this amazing lecture 🥰

[@ankit-jangid]

nice explanation brother, 1 thing I'd like to advice is please use the same variable names while coding which you use while explaining, it would be helpful. Good work and your videos are great!!✌🏻😇 thanks

[@Vvvvviieiei123]

lecture 4 done,love u bhaiya

[@guneeshvats46]

Dude your lectures are amazing

[@saitejanedunoori5451]

great work and thank you !

[@adebisisheriff159]

Thanks Striver!!!

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

[@vaibhavvm4147]

Bro how do u approach DSA, do u first watch videos and then solve it on ur own or how?

[@AmanSharma-xy1qm]

initially, i learn first the therory part like methods that are used in this, and i usually watch Striver's playlist of that topic , and learn the patterns of the questions then i go to leetcode and gfg and solve same patterns problems. With the approaches i learned from Striver. That's all. Hope you got this.@@vaibhavvm4147

[@Rahul_Mongia]

@@vaibhavvm4147 video dekh le bhai, dimag khol......., phir related ques khud try kar

[@TON-108]

Understood!!!
Thank You.......

[@BeWarrior-dw4br]

The takeuforward website is not loading .. I'm trying to access the A2Z sheet for the last three days but it is not working.

[@chetashreejagtap7585]

thank you striver👍👍

[@oyeesharme]

thanks bhaiya for your efforts

[@NazeerBashaShaik]

Understood, thank you.

[@user-ok6km9me6x]

Thank You Bhaiya.

[@pratyushtripathi1728]

Understood 😊

[@YourCodeVerse]

Understood✅🔥🔥

[@Ergoswami]

Completed!

[@lifehustlers164]

17:20 , dream come true!!!

[@tle964]

nice video

[@subee128]

Thanks

[@karthik-varma-1579]

i taught of doing same approach. of changing and head and swap its pointers

[@khalasianiket816]

understood ❤

[@user-uv5or5bm2c]

Understood !!

[@abhishekprasad010]

Understood!

[@rizonkumarrahi]

Great

[@r_uhi05]

understood!

[@harshuke5831]

Understood

[@sumitworld918]

Undertood 😌

[@gourabrajak8132]

👍😊

[@user-di7cc8jp1w]

nice

[@vishious14]

My approach looks something like this:
Publlic class Solution{
public static Node reverseDLL(Node head) {
Node p=null,curr=null,f=head;
while(f!=null){
p = curr;
curr = f;
f=f.next;
curr.next = p;
if(p!=null) p.prev = curr;
}
head = curr;
return head;
}
}

[@aaryangupta4505]

if(head==NULL||head->next==NULL)
return head;

Node* temp = NULL;
Node* curr = head;
while (curr != NULL)
{
curr->prev = curr->next;
curr->next = temp;
temp=curr;
curr = curr->prev;
}
return temp;

[@Zomb-zj4ip]

understooooooooooooood

[@harshitjaiswal9439]

🔥🔥🔥

[@chiragbansod8252]

understood

[@user-ke7fs7ds6h]

striver is best

[@himanshukaushik9223]

Bhaiya 0(1) ma bhi solution hai kya iska ??

[@TarunKumar-km5ps]

👌👌👌👌👌👌👌👌👌👌👌👌

[@user-ud2mb7lk6q]

If we point the head to last node, the behaviour would be same as revered doubly Linked list right??? Why do we need to do these processing???

[@techwithsam4302]

In that case we can't traverse in the forward direction instead we have to go backward to traverse!!

[@UjjwalMishra-xf9un]

why this code is not working,, its all same just using one extra variable;
Node* reverseDLL(Node* head)
{
if(head==nullptr || head->next==nullptr)return head;

Node * current=head;
Node *back=nullptr;
Node *front=nullptr;
Node *temp=nullptr;
while(current){
back=current->prev;
front=current->next;
temp=back;
back=front;
front=temp;
current=current->prev;
}
return back->prev;
}

[@charuprabha9696]

[@varun1017]

why this is correct and
last=curr->prev;
curr->prev=curr->next;
curr->next=last;
this is not working?
last=curr->next;
curr->next=curr->prev;
curr->prev=last;

[@user-gk4zy6bk7l]

god

[@Rohith__Dev]

28-06-2024

[@user-ns7tu5no1i]

class Solution
{
public:
Node* reverseDLL(Node * head)
{
if(head == NULL || head->next == NULL)
{
return head;
}
Node* pichli = head;
while(head->next != NULL)
{
pichli = head;
head = head -> next;
}
Node*mover = head;
mover->next = pichli;
mover->prev = NULL;
Node*back = mover;
mover = mover->next;
pichli = pichli->prev;
while(pichli != NULL)
{
mover->prev = back;
mover->next = pichli;
back = mover;
mover = mover->next;
pichli = pichli->prev;
}
mover->next = NULL;
mover->prev = back;
return head;
}
}; this is i ve done but ur one is more intutive and easy also

[@harshilpatel3205]

Understood 🫡

[@ganeshvhatkar9253]

Understood

[@ashishpradhan6250]

understood

[@pradipkumarmukhi]

Understood

[@adityapandey23]

Understood

[@himanshidafouty347]

Understood

[@firebout7675]

understood