Detect cycle in a linked list

• Use Floyd's Tortoise and Hare algorithm

• Start with two pointers, one moving twice as fast as the other

• If they meet at some point, there is a cycle