Skip to main content

Find Cycle Start

Learn Find Cycle Start (Linked List, Data Structures & Algorithms) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Finding WHERE the Cycle Begins Detecting a cycle exists is phase 1 of Floyd's algorithm. Phase 2 finds exactly which node the cycle starts at: reset one pointer to the head, keep the other at the meeting point, then advance BOTH one step at a time - they meet exactly at the cycle's entrance.

More lessons in Linked List