Cycle

3 articles

dsa1 min read

Detect a cycle in a linked list in O(1) space using Floyd's two-pointer tortoise and hare algorithm.

March 19, 2026Read →

dsa2 min read

Find the node where a cycle begins using Floyd's algorithm: detect meeting point, then reset one pointer to head.

March 19, 2026Read →

dsa1 min read

Find the duplicate in an array of n+1 integers in O(1) space by treating indices as a linked list with Floyd's cycle detection.

March 19, 2026Read →