How to remove loop from a Singly Linked List? | Floyd Cycle Detection Algorithm | (Animation)

[@itsdineshvaryani]

Please *Subscribe* and *Click Bell* 🔔🔔🔔 Icon for More Updates. To get *Data Structures and Algorithms* complete course for free please follow this link - kzbin.info/aero/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d

[@shubhamagarwal1434]

Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over KZbin with java implementation and found this. Hats Off To You Man..Excellent Work. GOD BLESS YOU :)

[@itsdineshvaryani]

Thanks !!!

[@srinivaschalamalasetti1877]

The Way of presenting the subject is awesome

[@itsdineshvaryani]

Thanks

[@saurabhchaturvedi9267]

Awsome Dinesh !! I took your Data Structures course in Udemy 2 years back, and it really helped in strengthening my DS skills. Recently came to know via ur udemy mailer that you're making the course content free . And i see you're adding new content. Subscribing you without a thought !! Thank you 🙏

[@itsdineshvaryani]

Thanks a lot !!! I was heartbroken by udemy recently ... So i unpublished courses from there and uploaded here for free ... Hopefully i get fanbase n money like i used to get on udemy ... Please share playlist with ur friends and colleagues.

[@saurabhchaturvedi9267]

@@itsdineshvaryani Sure . I always recommend it to everyone since i took it in Oct 2019 from Udemy . It made me take interest in DSA again . Your course way too simple to understand than Tim Buchalka's course on udemy, but i'm still not sure why its not that popular . I will suggest you to add more complex problems which people look for , in your simple manner that you teach and gather more connections on LinkedIn and share a video a day , that will help increase traffic to your channel may be .

[@itsdineshvaryani]

Thanks !!! ... Yes i am adding more and more problems now.

[@Orodoro21]

wow! thank you so much for this simplest and yet greatest explanation

[@itsdineshvaryani]

Welcome !!!

[@aryandubey4991]

In method first we can provide slowptr.next.next=null in if condition

[@DolaLado]

ty.

[@vantal4115]

Sir going through your course its great . Is this enough for the preparation of dsa part in interviews I am in my third year and going to face placements soon plz guide me

[@itsdineshvaryani]

it will give you insight abt DSA ... so that you are comfortable solving DSA problems ...

[@vantal4115]

@@itsdineshvaryani thank u sir👍

[@shashisaurabhsinha7502]

Nice sir

[@itsdineshvaryani]

Thanks !!!

[@sanjushekhawat6446]

Thanks sir

[@itsdineshvaryani]

Welcome !!!

[@wakeelmalik8387]

if node6 point to node1 then your code will fail

[@abhishekranjan1094]

Nice

[@itsdineshvaryani]

Thanks !!!

[@S__DhruvTrehan]

this code is not passing all the test cases on gfg practice platform

[@itsdineshvaryani]

ok thanks for the update !!!

[@shubham8943]

Sir its not passing the test cases on gfg

[@itsdineshvaryani]

make it pass by finding out the edge case

[@DreamCrushBgm-26]

yes..

[@MANISHYADAV-dd4ug]

❤️❤️❤️

[@itsdineshvaryani]

thanks !!!

[@huzaifaimran9468]

Hi, I tried it but it wont work for single loop in a linked list, Means it we only have like 4 elements in a loop cause detect loop returns the starting element and then it breaks the connection at 1st indext

[@itsdineshvaryani]

Thats an edge case to be handled at start ... You just need to understand tail n loop logic ...

[@eclipse7450]

1 -> 2 -> 1 I think it will not work

[@rajitdas558]

CODE NOT WORKING !!!!!!!!!!!!!! REPLY with the proper code

[@itsdineshvaryani]

can you check source code provided in desc of video ?