Detect & Remove Cycle in a Linked List | Floyd's Cycle Detection Algorithm | DSA-One Course #39
Vložit
- čas přidán 7. 09. 2021
- Hey guys, In this video, We're going to learn Floyd's cycle Detection Algorithm. This algorithm is used to detect and remove cycle in a Linked List.
Code: www.geeksforgeeks.org/detect-...
🥳 Join our Telegram Community:
Telegram channel: telegram.me/realanujbhaiya
Telegram group: telegram.me/dsa_one
🚀 Follow me on:
Instagram: / anuj.kumar.sharma
Linkedin: / sharma-kumar-anuj
Twitter: / realanujbhaiya
💸 Use coupon code ANUJBHAIYA on GeeksforGeeks to avail discounts on courses!
📚 Complete DSA Playlist: • DSA-One Course - The C...
Complete Android Development Playlist: • Android Development Tu...
Hashtags:
#anujbhaiya #dsaone
Ignore these tags:
detect
detect lying
detect lyin
dust detect
detect lies
detect movie
detect tempo
detect fakes
detect liars
dyson v15 detect
detect short film
detect short movie
how to detect liars
dewalt power detect
dyson v12 detect slim
how to detect baloney
how to detect deception
detect independent film
detect telugu short film
how to detect dark matter
dyson v15 detect inceleme
detect the honest officer
how to detect counterfeit
linked list
linked list in c
linked list conept
linked lists
linked list in hindi
linked list in python
linked list examples
linked list in c programming
c programming for beginners
beginners
c tutorial for beginners
stock market for beginners
sql for beginners
beginner
beginner chinese
it beginner course
beginner in coding
apis for beginners
investing for beginners
beginner sewing tips
sql beginners
beginner ds algo
c programming for begineers
I really like those who taught concepts in Hindi. Becz being an Indian jitne clarity Hindi me aate hai utne English me kabhi nahi aate. English me sirf concept samagh aata hai or Hindi me concept ghus jaata hai.. Thanks for making such a good content.
Your dry run technique is the best bro.
just wow! thank you very much for making DSA easy comfortable and lovable!
Thank you very much brother, I am in lot of confusion with this "linked list cycle check". Your video helped me to understand in a better way and the way of teaching is simply amazzzzzzing.
Thanks Anuj Bhaiya,For Making DSA Easy to Learn
Thank u Anuj Bhaiya
Sukriya bhai 😍 itna regular ho kr toh padh b nahi paate jitna regularly videos aa rhe h, Tx for ur time bhai.
Crystal Clear Explaination!
Thank you so much...
Easy to understand..very nice I am following all ur lectures...!!!
this dsa-algo course is really helpful , if possible create more videos like this to solve the classical question of dsa
Aisi explaination with proof mai pahli baar dekh raha hun
Thank you very much bhaiya
Very Nice Explanation,
For removing the loop, we can put a condition in the while loop without maintaining another pointer
while(start->next != meet->next)
{
start = start->next;
meet=meet->next;
}
meet->next = NULL;
This is should remove the loop
this is the best teacher for dsa on youtube i am sure...
Thank you. You have done a great job explaining this. Many other videos I saw (mostly in English) does not do a good job of explaining why the start of the cycle node will be the meeting point after the slow pointer is reset back to start of the list.
What a mind blowing and easy explanation
thank you so much sir i was struggling to understand the second proof but you made it clear. ❤
yes, it is very helpful sir..
Thank You Anuj Bhaiya, now I am clear with Floyd's Cycle Detection Algorithm. :)
👍 YES, IT WAS HELPFUL. THANKYOU SO MUCH FOR SHARING YOUR KNOWLEDGE WITH US. 🙏🙏🔥🔥🔥
Thank you sir your teaching method is amazing its really helpful to understand the concept of
dsa
Yes, This was helpful ❤️
Wonderful explanation 👏
Thank you so much It was so helpful...
Just keep going 👍
The idea was helpful!
YES, IT WAS HELPFUL. THANKYOU SO MUCH FOR SHARING YOUR KNOWLEDGE WITH US.
Simple and best explanation !
As always It was helpful. Thanks for the explanation :)
yes, it was helpful. Great Explanation
That was a fantastic explanation!
Best explanation for this question
your explain's skill really good , i got this linked list problem .Thanks keep contniue.
Best explanation ever got for this problem
thx bhaiya ur great and here is my solution to remove cycle :-
public static void removeCycle(Node node, Node head) {
LinkedList_copied list = new LinkedList_copied();
if(node == null || node.next == null) {
return;
}
Node curr = head;
Node ptr = node;
Node prev = null;
while(curr != ptr) {
prev = ptr;
ptr = ptr.next;
curr = curr.next;
}
prev.next = null;
}
It was really very helpful thanks 👍
Finally understood, thanks!
YES, It was helpful.💖
Yes, very helpful
Great 😃 explanation thank you 😊
awesome explanation bhaiya 😀
Best explaination on the youtube...Thank you bhaiyaaaaaa
Yes it was helpful, thankyou
Proof was amazing, thanks
Very niceee keep up the great work👍👍
Maja aa gaya bhai, best video on linkedlist
Bhaiya ye course complete kerna bht acha course h very useful h or thoda jaldi jaldi videos dalo awesome course h ♥️♥️♥️
This is awesome!
Thank you so much
Best Video in CZcams till date.
Tagda explanation bhaiya ji
Bs isi trh aur saare problems ki vdo daalte rho
Yes ,it was helpful!
extremely helpful. thanks.
yes sir it was very much helpful
Yes video was helpful 😃
Yes it was helpful 😇
Wonderful explanation bahiya
very helpful.
Yes, It was very very helpful
Jod! explanation
Thank you Sir💕❤️❤️💕
Thanks ❤️
Great explaination
YES, IT WAS HELPFUL
Yes it was helpful. Thank you.
Big Yes! Apne naya sekha diya
YES,IT WAS HELPFUL TQ Anuj Bhaiya
very helpful.. thank u bhaiya
YES, It was helpful
Yes, It was helpful.
Great explanation ❤
helpful, Thanks a lot 😀
it is helpfull bhaiya
bhaiya kya tagda dry run krke smjhaya hai mja hi aagya
bhot bdiya mzaa aagya bhaiya
Thanks for the video
wonderful explanation
Nice explanation Anuj Bhaiyan ji
Thanks sir, the proof was the simplest explaination ever!
it was very helpful bhaiyaa!
Yes it was helpful
yes! it was helpful bhaiya thank u so much
Bahut se bhi uppppar helpful
Really helping video bhiya...keep uploading...placement season is going on . (tier 3 cllg )😅
Yes, it was helpful
Veryy much helpful bro...thank you 🙇🙇
your are just superb sir!😘
yes, it was helpful.
yes !! it was helpful.
Next level 👌
Yes it was helpful!!
Next level 💯 👌 bhai (bro) , I just love the way how you proved that. Literally great 👍 explanation 👏
Yes, helpful video ❤❤
I saw your first video and you got a subscriber....
really helpful...
Thank you brother!
bhaiya yaar matlab maza hi aa gya
Thank you
Yes very helpful
Sirra ❤️❤️
It is helpful bhaiya ❤️
Please add more interview questions cover all dsa topics as fast as possible..I am following from ur course java for placements .I am unable to find This type of teaching . Please add more videos fast my placements are running in my clg🙏🙏..and thanks so much for ur contribution ❤️❤️
Exactly this series is one of the best on youtube
Thank you bhaiyea!
Yes it was helpful sir
Amazing explanation