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

[@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.

[@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

[@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!

[@DipsOfficial802]

Thank u Anuj Bhaiya

[@preranaramteke5908]

Thanks Anuj Bhaiya,For Making DSA Easy to Learn

[@shivamgupta-ch8kw]

Best explaination on the youtube...Thank you bhaiyaaaaaa

[@kartikkusmude9008]

Best explanation for this question

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

[@BhaktiPath-gk6fo]

Best Video in KZbin till date.

[@BRSanush]

Crystal Clear Explaination! Thank you so much...

[@sakshi07222]

Best explanation ever got for this problem

[@gpavansai7207]

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

[@Kunalkekaram]

bhaiya kya tagda dry run krke smjhaya hai mja hi aagya

[@moshoyab4964]

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

[@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.

[@sanketgoel6453]

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

[@good114]

Thank you Sir💕❤️❤️💕

[@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

[@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.

[@mindbehaviour9195]

Maja aa gaya bhai, best video on linkedlist

[@levi-lb6dp]

Thanks ❤️

[@aryansinha1818]

Bahut se bhi uppppar helpful

[@kishandwivedi2444]

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

[@iti_koookie9678]

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

[@noormaaz]

Big Yes! Apne naya sekha diya

[@roopeshverma9719]

Thanks sir, the proof was the simplest explaination ever!

[@pranjalnama2420]

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

[@anuragchatterjee241]

awesome explanation bhaiya 😀

[@yashjadhav6838]

Jod! explanation

[@RohitKumar-nb8qe]

It was simply awesome and crystal clear..

[@swethakare429]

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

[@rohan8758]

Nice explanation Anuj Bhaiyan ji

[@cricketind8830]

Yes, very helpful

[@ravikumar4870]

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

[@gouravrawat6476]

Amazing and Best explanation

[@s.g.prajapati3597]

The idea was helpful!

[@anjalitehlani4114]

So helpful🤗 Thank you❤️

[@logicalrisi]

Yes

[@kondurisaivarshath686]

YES,IT WAS HELPFUL TQ Anuj Bhaiya

[@atharvshelgaonkar4694]

Yes video was helpful 😃

[@arshadahmed4951]

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

[@mohammedsayeed4876]

What a mind blowing and easy explanation

[@mohdumar6990]

bhot bdiya mzaa aagya bhaiya

[@SunoTohSahi]

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

[@ananyasiingh21]

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

[@shivamchouhan8426]

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

[@everymaterialforstudy4893]

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

[@amitkumarlkr]

Great 😃 explanation thank you 😊

[@shaikaqib3496]

YES, IT WAS HELPFUL

[@sakshumpandey3859]

yes sir it was very much helpful

[@eddiepulaski237]

Yes, It was very very helpful

[@ritikarai1232]

Yes it was helpful

[@ayushp4471]

thank you bhaiya ❤

[@ravikantmaurya1979]

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

[@srishtychoudhary7750]

yes, it was helpful. Great Explanation

[@Ak-in5cu]

bhaiya yaar matlab maza hi aa gya

[@onlyPROFIT_BITCOIN]

Yes it was helpful 😇

[@kartikpatidar3378]

Yes

[@Sandeep_Kumar2022]

Yes, helpful video ❤❤

[@KaranBulani]

Amazing explanation

[@MOHAMMEDKHALANDER-g1c]

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

[@QniqueTales]

it is helpfull bhaiya

[@mritunjay7065]

Simple and best explanation !

[@akhilballa8320]

Veryy much helpful bro...thank you 🙇🙇

[@saniyapathan8968]

Best!!

[@mcafree1345]

best explainnation

[@utkarshgautam1940]

ek number bhai

[@anupchaudhary4253]

Great explanation ❤

[@VkThummanapally]

Yes Very Helpful

[@ramankr0022]

extremely helpful. thanks.

[@chetantailor3620]

very helpful.

[@AbhishekKumar-cd4gg]

nice explanation

[@AshuSingh-dh3yt]

Yes anuj bhaiya

[@helloak7156]

Crystal clear

[@blackwolfkills]

Great explaination

[@bharatmakkar9706]

Clear-cut explanation😃

[@JiGLifyy]

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

[@Knowledgeduniya1432]

Aww thanks bhaiya ji (sir)♥️🙏🏻

[@abhijeetmohapatra808]

Yes, This was helpful ❤️

[@karishmashaik2729]

YES,It is helpful

[@subhamadhikari]

Thank you brother!

[@oshinechandra8720]

maza hi agya bhaiya😁

[@infinity2arbitrary681]

It was really very helpful thanks 👍

[@jayeshsingh7764]

YES

[@mukeshmahadev7419]

Yes, Thanks bro

[@Rohitislampur]

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

[@anchalsharma0843]

You're right @Rohitislampur

[@vrindasharma4035]

it was very helpful bhaiyaa!

[@sohampatil2742]

Yes! It was helpful 😁🙂

[@K.AnshulReddy]

lovely proof

[@jainikprajapati1632]

Thank you Yes very helpful

[@MohitJain-g9z]

nice explanation.

[@animetimes5563]

yes

[@SaurabhGangamwar]

Thanks

[@anuragrajput6479]

Thank you .

[@furqanahmad5446]

very helpful.. thank u bhaiya

[@sagrika7096]

Thanku bhaia 🐥

[@vaibhzDixit]

Thanks alot

[@amolnakhate6274]

it was very useful