Given a linked list where the starting point of that linked list is denoted by**head**, and there may or may not be a cycle present. For instance:

<center></center>


Here we need to find out the point**C**, i.e the starting point of the cycle.

6. If they point to any same node at any point of their journey, it would indicate that the cycle indeed exists in the linked list.

7. If we get null, it would indicate that the linked list has no cycle.

<center></center>


Now, that we have figured out that there is a cycle present in the linked list, for the next step we need to find out the starting point of cycle, i.e.,**C**.

Lets try to calculate the distance covered by both of the pointers till they point they met within the cycle.

<center></center>


$slowDist = a + xL + b$ , $x\ge0$