Floyd Cycle Algorithm:

The algorithm states : Traverse the linked list with two pointers. Move one pointer(slow) to one node forward and the second pointer(fast) to two nodes forward. If these two pointers meet at the same node then there is a loop otherwise the linked ...