Fast & Slow Pointers

Category: Linked List

Difficulty: intermediate

Description: Detect cycles and find middle using two pointers

Time Complexity: O(n)

Space Complexity: O(1)

Related LeetCode Problems

• 141. Linked List Cycle (Easy)
• 142. Linked List Cycle II (Medium)
• 160. Intersection of Two Linked Lists (Easy)
• 876. Middle of the Linked List (Easy)
• 19. Remove Nth Node From End of List (Medium)
• 92. Reverse Linked List II (Medium)
• 328. Odd Even Linked List (Medium)
• 61. Rotate List (Medium)
• 725. Split Linked List in Parts (Medium)
• 143. Reorder List (Medium)
• 23. Merge k Sorted Lists (Hard)
• 25. Reverse Nodes in k-Group (Hard)
• 148. Sort List (Hard)
• 109. Convert Sorted List to Binary Search Tree (Hard)