To find out whether your single linked list is circluar 2

Problem is : How to find out whether your single linked list is circluar. Lets have a look on the “The Tortoise and the Hare Algorithm”. Time Complexity :  O(n) Simultaneously go through the list by ones (slow iterator) and by twos (fast iterator) or there will be one slow pointer and one will be ...