In this video, I have explained how to detect cycle in linked list. I have explained 2 methods to solve this:
1. Using Hashmap
2. Using Floyd Cycle Detection algorithm (Tortoise-hare algorithm)
I have also given the proof of why the slow and fast pointers will meet in Floyd Cycle Detection algorithm.
Source code: [ Ссылка ]
00:00 Introduction
00:07 Problem explanation
02:05 Method 1 - Using Hashmap
04:40 Method 2 - Floyd Cycle Detection Algorithm
09:33 Why Floyd Cycle Detection Algorithm works ?
13:53 Implementation
-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------
For Linked List tutorials, please refer to the below playlist:
[ Ссылка ]
For Binary tree tutorials, please refer to the below playlist:
[ Ссылка ]
For Binary search tree tutorials, please refer to the below playlist:
[ Ссылка ]
For in-depth Graph theory and implementation details, please refer to the below playlist:
[ Ссылка ]
#DataStructure,#LinkedList,#FitCoder,#Algorithm,#competitiveprogramming,#faang,#codinginterview
