please make similar playlist on string data structure with such vast variety

at 12:51 in pseudo code of tortoise and hare algo fast should move two step just telling so that no one confuses else am not that capable that i can find out ur mistakes

@user-ns7tu5no1i

2 ай бұрын

you re right i came to comment this out but you ve done it much before i m going to

@randalthor69

Күн бұрын

chill dude nobody's thinking that

at 12:53, just correct fast as fast = fast->next->next, rest is aweasome .......

slow and fast pointer concept was awesome

Bro this video deserves a lot more that just 844 likes. Everyone please do your part.

Understood well..Thanks Striver!!!

Love u sir 💕 thanks for ur efforts 💓 please keep it up , u are very intelligent 🤓

Understood, Thanks striver for thia amazing video.

Thank you so much striver!!

love u brother, Great Explanation ❤

Understood bhai Thank you

Amazing Explanation.

your explanation is great for understanding the problem. Thank you bro❤

Great Explanation ❤

is it ok? to not come up with the optimal solution , but understood very well after learning.

Please make playlist on string very much needed.

great explanation

awesome content

Thank you bhaiya

love you bro ,

UNDERSTOOD SIR

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

Thanks a lot

Understood✅🔥🔥

rhank you bhayya

Thnak you

Understooood

Great

Striver , at 12:49 please change it to fast->next->next;

understood.

good algo

Nice

Understood

Sir in both we can do n/2 ...and point front=temp->next

understood

Today i give the same sol in the class

can someone pls write the code for the fast and slow logic in vs code i am completely unable to write that logic in the vs code

@swapnilpawar8487

5 ай бұрын

#include using namespace std; class Node{ public: int data; Node* next; }; class linkedList{ public: Node* head; linkedList(){ head=nullptr; } void append(int data){ Node* newNode =new Node(); newNode->data=data; newNode->next=nullptr; if(head==nullptr) head=newNode; else{ Node* p=head; while(p->next !=nullptr){ p=p->next; } p->next=newNode; } } Node* middleNode(){ Node* slow=head; Node* fast=head; while(fast != nullptr && fast->next != nullptr){ slow = slow->next; fast= fast->next->next; } return slow; } }; int main(){ int A[]={12,43,23,86,64,3,56,7,577,10}; int n=sizeof(A)/sizeof(A[0]); linkedList MyList; for(int i=0;i

US

I'm a final year student should I follow sde a-z sheet as a beginner reply me

@arundhatipatil457

8 ай бұрын

first learn c++ then tcs striver sheet and then follow a to z sheet

@harshpalsingh1145

7 ай бұрын

It matters on your capabilities as well. If you feel a-z sheet is comfortable then follow it otherwise do easier sheets first. Also learning a language like cpp or java and learning DSA are two different things. Give importance to both and yes you can do both side by side.

us

Great Explanation ❤

Understood

understood

Understood

Understood

understood

Understood

understood