In this tutorial, we will write the Python program to check whether a given linked list is a circular linked list or not. We will understand the various efficient methods to determine a circular linked list. It is understood that you are familiar with the basic concept of the linked list and the Circular linked list (can skip introduction part). If you are not familiar with linked list, let's briefly overview the linked list.

The linked list is a linear data structure that stores the address of the next element. Each element is known as node, and a node consists of data and the memory address of the next element. We can access the linked list's element through the pointer, and the first node is known as the head.

A linked list provides the advantage over the array because it stores the element dynamically where the array has a fixed size. In the linked list, we can insert and delete the element easily.

A circular linked list is one type of linked list which last following pointer field has a reference to one of the elements in the list. On the other hand, the next pointer field of the pointer element has the null value. A loop exists in a linked list when no NULL is reached as we traverse the entire linked list. ## How can we check the Given Linked list is Circular?

As per the definition of both linked lists, we can find out easily when we traverse the linked list.

• If a no node is pointing to null.
• If any node in the linked list points towards the head or starting node, then the linked list is circular.

Let's understand the solution.

### Solution - 1:

Follow the below steps to check whether a given list is a circular or not.

1. Traverse the entire linked list.
2. Check if the node is pointing to the head.
3. If it returns true, it means a given linked list is circular.

Let's understand the below code.

Example -

Output:

```The given linked list is not a circular list
The given linked list is a circular list
```

Explanation -

In the above code, we have created a Node class to initialize the node of the linked list. Then we created a LinkedList class that will point to the head node of the linked list; initially, it is none. Finally, we defined the CircularList function that determines whether a given linked list is circular or not.

In this function, we checked if a head is equal to none. If true, then it returns True. If the head is not none, assign the head's next element to the current and set i as zero. Then we define the while loop, which will run until the current is not none and the current is not head. If the loop terminates the conditions, the return current is equal to the head.

### Solution -2: Two Pointer Solution

We can use the two pointers with the different speed to determine whether a given linked list is a circular linked list or not. We define a slow pointer and a fast pointer. We use these pointers to traverse the linked list. The slow pointer moves one step at a time and a fast pointer moves two steps at a time.

If a linked list is not a circular, the fast pointer will reach at the end of the element whose next pointer is null.

Let's understand the approach.

• Check if head is null, returns false.
• If not, create two pointers slow, and fast => slow=head, fast = head.next.
• Run a loop, while slow is not equal to fast.
• Inside the loop, if fast is null or next is null then return false.
• If not then assign => slow = slow.next, fast = fast.next.next.
• Returns true.

Let's implement the above approach into the Python code.

Example -

Output:

```The Given list is a circular list
```

Explanation -

## Complexity Analysis of the Two Pointer Solution

If the linked list doesn't have the cycle, the fast pointer will reach the end. Therefore the time complexities will be the O (n) in this case. If the linked list has a cycle, we need to calculate the number of steps to make the fast pointer catch the slow pointer. Let's understand the movement of both pointers.

The slow pointer requires K steps to enter the cycle where the fast pointer has already in the cycle and element apart from the slow pointer in the linked list direction.

The total run time will be 0 (K+D), where K is the number of elements between the head and the start element of the cycle. The D represents the distance between the two pointers when the slow pointer reaches the cycle. The space complexity is O (1).

## Conclusion

In this tutorial, we have learned about how we can check a linked list is a circular linked list. We have discussed the two solutions, the first is a brute-force approach, and the second is a two-pointer solution. The two-pointer solution is easy to implement and also more efficient.

### Feedback   