L13. Find the middle element of the LinkedList

L13. Find the middle element of the LinkedList | Multiple Approaches

Рет қаралды 80,724

take U forward

Күн бұрын

Пікірлер

@yashsherekar7148 Жыл бұрын

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

@Rahulkumar-cg8rh 8 ай бұрын

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

@BhanuPratapSinghRajawat-iz2tf Жыл бұрын

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

@AyushRawat-v8m 7 ай бұрын

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

@randalthor69 5 ай бұрын

chill dude nobody's thinking that

@racks8493 4 ай бұрын

noticed

@KartikeyTT 8 ай бұрын

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

@dogwoofwoof8154 7 ай бұрын

slow and fast pointer concept was awesome

@trailblazer555 10 ай бұрын

Understood well..Thanks Striver!!!

@parul8334 Жыл бұрын

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

@CS-RubavathyMR 10 ай бұрын

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

@priyotoshsahaThePowerOf23 5 ай бұрын

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

@hareshnayak7302 9 ай бұрын

Understood, Thanks striver for thia amazing video.

@PCCOERCoder Ай бұрын

Lecture successfully completed on 27/11/2024 🔥🔥

@nirajchanekar 9 ай бұрын

love u brother, Great Explanation ❤

@DhrumilShahDOTin 4 ай бұрын

bro this was simple as f .... appreciated

@vattiyeshwanth282 7 ай бұрын

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

@knowthrvdo 10 ай бұрын

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

@anuplohar23 11 ай бұрын

Great Explanation ❤

@selene8721 8 ай бұрын

Thank you so much striver!!

@shrutishukla6336 9 ай бұрын

Amazing Explanation.

@ManishKumar-v7r7q 2 ай бұрын

Why used && in while statement not || in the optimized solution?

@akashdevmore4447 2 ай бұрын

like if fast ptr reaches end of LL or fast ptr points to null then we have to break the loop.so loop should run means slow and fast ptrs should move till fast ptr reaches end of LL or points to null. so if any of cases happens then while loop will break and give exact middle of LL.

@samarthpai5359 Ай бұрын

Understood sir

@sophiejena5499 2 ай бұрын

Nice explanation

@_CodeLifeChronicles_ 7 ай бұрын

great explanation

@ddevarapaga5134 5 ай бұрын

Understood bhai Thank you

@YourCodeVerse 11 ай бұрын

Understood✅🔥🔥

@rockstarCoolz 7 ай бұрын

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

@Adarsh_agrahari 8 ай бұрын

Today i give the same sol in the class

@ABISHEK-r7k 11 ай бұрын

UNDERSTOOD SIR

@vinaynegi8454 5 ай бұрын

love you bro ,

@striverdaaadi Жыл бұрын

awesome content

@kartikpatel-u8b 3 ай бұрын

🤗🤗Here is the code with 100% beat: ListNode* middleNode(ListNode* head) { ListNode* slow=head; ListNode* fast=head; while(fast && fast->next) slow=slow->next, fast=fast->next->next; return slow; }

@ShubhamSolanki-uz4ht 2 ай бұрын

Understand ✌️

@Learnprogramming-q7f 10 ай бұрын

Thank you bhaiya

@ssss1234aaaa 11 ай бұрын

Please make playlist on string very much needed.

@PawanKumar-hq6dy Ай бұрын

public Node middle(Node head){ if(head == null || head.next == null) return head; Node slow = head; Node fast = head.next; while (fast!=null){ slow = slow.next; if(fast.next == null){ break; } fast = fast.next.next; } return slow; }

@DeadPoolx1712 3 ай бұрын

UNDERSTOOD;

@NARUTOUZUMAKI-bk4nx 11 ай бұрын

Understooood

@DeepakPatel-d5v 9 ай бұрын

Thanks a lot

@malaykhakhar 11 ай бұрын

Great

@rushidesai2836 8 ай бұрын

Nice

@om3478 11 күн бұрын

understood!!

@MJBZG 6 ай бұрын

good algo

@therealartist9 11 ай бұрын

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 11 ай бұрын

#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

@kalabanki4865 Жыл бұрын

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

@arundhatipatil457 Жыл бұрын

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

@harshpalsingh1145 Жыл бұрын

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.