How can you detect a cycle in a linked list efficiently?

Question

Accepted Answer

(C) Floyd's cycle detection (slow & fast pointers). Explanation: Floyd's algorithm uses two pointers (slow moves 1 step, fast moves 2). If they meet, there is a cycle.