Last Minute Notes
Github
Docs
Learn
Search
⌘
K
@sayanstwt
Lessons
Learn
/
Data Structures & Algorithms
/
Linked Lists
Fast & Slow Pointers
7 min
Beginner
8 steps
Detect cycles and find middles with two speeds.
Steps
0
Reached null
never
Visited set
1 nodes
O(n) space
1
2
3
4
5
6
curr
current
visited
done
In this lesson
Step 1 of 8
1
The problem
2
Two speeds
3
Detect
4
Why meet
5
Cycle start
6
The math
7
Middle
8
Recap