Fast and Slow Pointers
Move one pointer twice as fast as another.
Easy
Detects cycles in linked lists (Floyd's algorithm) and finds the middle node in one pass.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.