Skip to content
ı
Workspace
Visualizer
Search anything…
⌘ K
Desk
Path
Problems
Review
More
Library
/
Fast and Slow Pointers (Floyd)
arrays
Best
O(1)
Avg
O(n)
Worst
O(n)
Space
O(1)
Preparing Fast and Slow Pointers (Floyd)...
Moves two pointers at different speeds (tortoise and hare) to detect cycles or find middle elements.