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

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

Рет қаралды 16,703

3 жыл бұрын

►Full DSA Course - • Data Structures and Al...
►Follow me on Instagram - bit.ly/intrvwkckstrt
►Follow me on LinkedIn - bit.ly/fllwlkdn
►Enroll in the complete course: bit.ly/3W4qthg
►Source Code - github.com/dinesh-varyani/ds-...
►Download DSA Animation Slides - techready.in/courses/150-dsa-...
►Click here to subscribe - kzfaq.info...
Watch all my playlist here:
►Data Structures and Algorithms Course playlist: • Data Structures and Al...
►Mastering JUnit 5 - kzfaq.info?list...
►Mastering Mockito 3 - • Mockito 3 Tutorials
►Analysis of Algorithms - • Analysis of Algorithms
►Linked List Data Structures - • Linked List Data Struc...
►Array Data Structures - • Playlist
►Stack Data Structure - • Stack Data Structure
►Queue Data Structure - • Queue Data Structure
►Binary Tree Data Structure - • Binary Tree Data Struc...
►Graph Data Structure - • Graph Data Structure
►Binary Heap Data Structure - • Binary Heap Data Struc...
►Trie Data Structure - • Trie Data Structure
►Dynamic Programming Algorithms - • Dynamic Programming Al...
►Hashing Data Structures - • Hashing Data Structures
►Sorting and Searching - • Sorting and Searching
►String Algorithms - • String Algorithms
Want to land a software engineering job in the IT industry? This course - 'Visualizing Data Structures and Algorithms' is here to help. The course walks you through multiple Java algorithms, data structures problems, and their solutions with step by step visualizations, so that you are actually learning instead of blindly memorizing solutions.
The course covers in and outs of Data Structures and Algorithms in Java. Java is used as the programming language in the course. Students familiar with Javascript, Python, C#, C++, C, etc will also get to learn concepts without any difficulty. The implementation of various Algorithms and Data Structures have been demonstrated and implemented through animated slides. It covers many interview room questions on Algorithms and Data Structures. The questions and solutions are demonstrated by -
1. Animated slide. (To make visualization of algorithms faster)
2. Coding algorithm on IDE.
The course covers topics such as -
0. Algorithm Analysis
1. Arrays
2. Matrix
3. Singly Linked List
4. Doubly Linked List
5. Circular Singly Linked List
6. Stacks
7. Queues
8. Binary Tree
9. Binary Search Tree
10. Graphs
11. Priority Queues and Heaps
12. Recursion
13. Searching
14. Sorting
15. Strings
16. Trie Data Structure
17. Dynamic Programming
and many more ...
#dsa #algorithms #coding

Пікірлер: 35

@itsdineshvaryani 3 жыл бұрын

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

@saurabhchaturvedi9267 3 жыл бұрын

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 3 жыл бұрын

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 3 жыл бұрын

@@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 3 жыл бұрын

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

@srinivaschalamalasetti1877 11 ай бұрын

The Way of presenting the subject is awesome

@itsdineshvaryani 11 ай бұрын

Thanks

@Orodoro21 2 жыл бұрын

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

@itsdineshvaryani 2 жыл бұрын

Welcome !!!

@shubhamagarwal1434 2 жыл бұрын

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

@itsdineshvaryani 2 жыл бұрын

Thanks !!!

@DolaLado 2 жыл бұрын

ty.

@sanjushekhawat6446 3 жыл бұрын

Thanks sir

@itsdineshvaryani 3 жыл бұрын

Welcome !!!

@shashisaurabhsinha7502 3 жыл бұрын

Nice sir

@itsdineshvaryani 3 жыл бұрын

Thanks !!!

@abhishekranjan1094 3 жыл бұрын

Nice

@itsdineshvaryani 3 жыл бұрын

Thanks !!!

@MANISHYADAV-dd4ug 2 жыл бұрын

❤️❤️❤️

@itsdineshvaryani 2 жыл бұрын

thanks !!!

@aryandubey4991 2 жыл бұрын

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

@vantal4115 2 жыл бұрын

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 2 жыл бұрын

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

@vantal4115 2 жыл бұрын

@@itsdineshvaryani thank u sir👍

@huzaifaimran9468 3 жыл бұрын

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 3 жыл бұрын

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