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

@Thunder97654

19 күн бұрын

😂

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

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

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

@hermionegranger7443

5 ай бұрын

Is kunal kushwaha better or this one?

@Ayush37262

4 ай бұрын

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

Great thought of using the stacks!!!!

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

Күн бұрын

🤓

Thank you for this amazing playlist bhaiya ❤❤

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

Thanks Striver!!!

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

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

great work and thank you !

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

lecture 4 done,love u bhaiya

thank you striver👍👍

Dude your lectures are amazing

Understood, thank you.

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

5 ай бұрын

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

@AmanSharma-xy1qm

5 ай бұрын

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

3 ай бұрын

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

Thank You Bhaiya.

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

Understood✅🔥🔥

Understood 😊

Completed!

Thanks

Understood !!

nice video

understood ❤

Great

Understood!

understood!

Understood

17:20 , dream come true!!!

understood

nice

understooooooooooooood

Undertood 😌

🔥🔥🔥

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

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;

👍😊

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

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

striver is best

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

7 күн бұрын

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

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

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;

god

28-06-2024

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

Understood 🫡

Understood

understood

Understood

Understood

Understood

understood