Detect & Remove Cycle in a Linked List | Floyd's Cycle Detection Algorithm | DSA-One Course #39

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.geeksforge...
🥳 Join our Telegram Community:
Telegram channel: telegram.me/re...
Telegram group: telegram.me/ds...
🚀 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

[@ruchitachandel2348]

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.

[@nimishnandwana1085]

Your dry run technique is the best bro.

[@manishkumargupta8677]

Aisi explaination with proof mai pahli baar dekh raha hun
Thank you very much bhaiya

[@khudkikhoz]

Sukriya bhai 😍 itna regular ho kr toh padh b nahi paate jitna regularly videos aa rhe h, Tx for ur time bhai.

[@danishuddin9752]

just wow! thank you very much for making DSA easy comfortable and lovable!

[@debasishphukon5345]

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

[@arshadjaved8136]

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 ❤️❤️

[@Hrit]

Exactly this series is one of the best on youtube

[@shivamgupta-ch8kw]

Best explaination on the youtube...Thank you bhaiyaaaaaa

[@sanketgoel6453]

this dsa-algo course is really helpful , if possible create more videos like this to solve the classical question of dsa

[@preranaramteke5908]

Thanks Anuj Bhaiya,For Making DSA Easy to Learn

[@gpavansai7207]

Thank You Anuj Bhaiya, now I am clear with Floyd's Cycle Detection Algorithm. :)

[@DipsOfficial802]

Thank u Anuj Bhaiya

[@sakshi07222]

Best explanation ever got for this problem

[@kartikkusmude9008]

Best explanation for this question

[@cliffmathew]

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.

[@Kunalkekaram]

bhaiya kya tagda dry run krke smjhaya hai mja hi aagya

[@BRSanush]

Crystal Clear Explaination!
Thank you so much...

[@iti_koookie9678]

Thank you so much It was so helpful...
Just keep going 👍

[@naiduaravind4641]

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.

[@tejaslomate9214]

yes, it is very helpful sir..

[@BhaktiPath-gk6fo]

Best Video in UA-cam till date.

[@pranjalnama2420]

thank you so much sir i was struggling to understand the second proof but you made it clear. ❤

[@RohitKumar-nb8qe]

It was simply awesome and crystal clear..

[@roopeshverma9719]

Thanks sir, the proof was the simplest explaination ever!

[@good114]

Thank you Sir💕❤️❤️💕

[@moshoyab4964]

Bhaiya ye course complete kerna bht acha course h very useful h or thoda jaldi jaldi videos dalo awesome course h ♥️♥️♥️

[@kondurisaivarshath686]

YES,IT WAS HELPFUL TQ Anuj Bhaiya

[@MOHAMMEDKHALANDER-g1c]

Next level 💯 👌 bhai (bro) , I just love the way how you proved that. Literally great 👍 explanation 👏

[@kishandwivedi2444]

Tagda explanation bhaiya ji
Bs isi trh aur saare problems ki vdo daalte rho

[@anuragchatterjee241]

awesome explanation bhaiya 😀

[@ananyasiingh21]

Just give an additional if statement to handle the null pointer error in the detectCycle function.

[@swethakare429]

Easy to understand..very nice I am following all ur lectures...!!!

[@nitinanand1092]

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

[@gouravrawat6476]

Amazing and Best explanation

[@abd11868]

Sir I don't think ki slow wala pointer ek se zyda cycle lagyega.... kyu ki jab wo cycle ki starting point pr reach krega us time "fast pointer" to "slow pointer" ke beech ka gap N step hoga, and N

[@levi-lb6dp]

Thanks ❤️

[@arshadahmed4951]

👍 YES, IT WAS HELPFUL. THANKYOU SO MUCH FOR SHARING YOUR KNOWLEDGE WITH US. 🙏🙏🔥🔥🔥

[@ravikumar4870]

YES, IT WAS HELPFUL. THANKYOU SO MUCH FOR SHARING YOUR KNOWLEDGE WITH US.

[@mindbehaviour9195]

Maja aa gaya bhai, best video on linkedlist

[@yashjadhav6838]

Jod! explanation

[@shivamchouhan8426]

your explain's skill really good , i got this linked list problem .Thanks keep contniue.

[@cricketind8830]

Yes, very helpful

[@anjalitehlani4114]

So helpful🤗 Thank you❤️

[@logicalrisi]

Yes

[@s.g.prajapati3597]

The idea was helpful!

[@shivamKumar-pv7gz]

Wonderful explanation bahiya

[@rohan8758]

Nice explanation Anuj Bhaiyan ji

[@everymaterialforstudy4893]

Thank you sir your teaching method is amazing its really helpful to understand the concept of
dsa

[@arifsaleem-7377]

wonderful explanation

[@aryansinha1818]

Bahut se bhi uppppar helpful

[@JiGLifyy]

Really helping video bhiya...keep uploading...placement season is going on . (tier 3 cllg )😅

[@mohammedsayeed4876]

What a mind blowing and easy explanation

[@amitkumarlkr]

Great 😃 explanation thank you 😊

[@Rohitislampur]

The equation should be
A + B = (n-2m) * (B+C)
instead of
A + B = (n-m) * (B+C)

[@anchalsharma0843]

You're right @Rohitislampur

[@sanjayguptab.r1899]

Yes it was helpful

[@noormaaz]

Big Yes! Apne naya sekha diya

[@akhilballa8320]

Veryy much helpful bro...thank you 🙇🙇

[@eddiepulaski237]

Yes, It was very very helpful

[@ThisAmit]

Yes it was helpful. Thank you.

[@atharvshelgaonkar4694]

Yes video was helpful 😃

[@pratikchakraborty6999]

Bhaiyaa please upload more project bases learning videos on android development playlist. Earlier 5 projects were awesome.

[@nargisp434]

yes it is very very very helpful..plz make video on some more question

[@shaikaqib3496]

YES, IT WAS HELPFUL

[@mritunjay7065]

Simple and best explanation !

[@Knowledgeduniya1432]

Aww thanks bhaiya ji (sir)♥️🙏🏻

[@kartikpatidar3378]

Yes

[@mohdumar6990]

bhot bdiya mzaa aagya bhaiya

[@ravikantmaurya1979]

I saw your first video and you got a subscriber....

[@bishalkundu7592]

class Solution
{
//Function to remove a loop in the linked list.
public static void removeLoop(Node head){
// code here
// remove the loop without losing any nodes
Node slow,fast;
slow=fast=head;
while(fast!=null && fast.next!=null){
fast=fast.next.next;
slow=slow.next;
if(slow==fast){
break;
}
}
if(fast==null || fast.next==null) return;
if(slow==head){ // If the intersection is in the 1st node itself
while(slow.next!=head){
slow=slow.next;
}
slow.next=null;
return;
}
Node curr=head,prev=slow;
while(slow!=curr){
prev=slow;
slow=slow.next;
curr=curr.next;
}
prev.next=null;
}
}
This is the actual code for those who needs it!

[@anjaligoyal8106]

Very helpful

[@srishtychoudhary7750]

yes, it was helpful. Great Explanation

[@Ak-in5cu]

bhaiya yaar matlab maza hi aa gya

[@sudhanshudwivedi9610]

It was veryyyyyyy helpful❤❤✨ ye course jaldi jaldi complete kra dijiye bhaiya!🙂
please

[@mruduladdipalli5417]

Ek Number Bhai

[@Sandeep_Kumar2022]

Yes, helpful video ❤❤

[@ramankr0022]

extremely helpful. thanks.

[@bharatmakkar9706]

Clear-cut explanation😃

[@saniyapathan8968]

Best!!

[@blackwolfkills]

Great explaination

[@SunoTohSahi]

gazab bhaiya gazab 🔥🔥🔥.
!!!!!!!!!!!

[@jayeshsingh7764]

YES

[@anupchaudhary4253]

Great explanation ❤

[@anujagrawal60]

Hi Anuj, this was an excellent explanation. Just a suggestion that you can take the refrence from relative velocity to even simpler. Also you can say that 2*speed_slow = speed_fast for given time resulting the distance equation for same time.
Also, thank you again for this great explanation. Really appreciate your efforts and hard work

[@Atul_Agnihotri]

Yes, It was helpful.

[@furqanahmad5446]

very helpful.. thank u bhaiya

[@QniqueTales]

it is helpfull bhaiya

[@gauravjain969]

bhaiya please also cover EDGE CASES , remove loop krne vale program mai aapne edge case cover nahi kra jiske bina code bekaar h

[@AbhishekKumar-cd4gg]

nice explanation

[@helloak7156]

Crystal clear

[@subhamadhikari]

Thank you brother!

[@vrindasharma4035]

it was very helpful bhaiyaa!

[@spiral546]

yes

[@workwithmohiit]

Yes it was helpful sir

[@mcafree1345]

best explainnation

[@jainikprajapati1632]

Thank you
Yes very helpful

[@MohitJain-g9z]

nice explanation.

[@infinity2arbitrary681]

It was really very helpful thanks 👍

[@kapiljetwani3540]

thank you bhaiya❤❤

[@VkThummanapally]

Yes Very Helpful

[@onlyPROFIT_BITCOIN]

Yes it was helpful 😇

[@K.AnshulReddy]

lovely proof