Given a linked list, determine if it contains a loop. Return true if there is a loop in the linked list. Otherwise, return false.

Detecting a loop in a linked list can be efficiently done using Floyd's Cycle-Finding Algorithm.

• Use two pointers: slow and fast. Slow moves one step, fast moves two steps.

• If there's a loop, the fast p...read more