Check if a linked list is Circular Linked List
Last Updated :
26 Aug, 2024
Given the head of a singly linked list, the task is to find if given linked list is circular or not. A linked list is called circular if its last node points back to its first node.
Note: The linked list does not contain any internal loops.
Example:
Input: LinkedList: 2->4->6->7->5
Output: true
Explanation: As shown in figure the first and last node is connected, i.e. 5 -> 2
Input: LinkedList: 2->4->6->7->5->1
Output: false
Explanation: As shown in figure this is not a circular linked list.
[Expected Approach-1] By Traversing each node - O(n) time and O(1) space
The main idea is to traverse through the each node of linked list and check if the head->next pointer points back to the starting node (temp). If it does, that means the linked list is circular.
Code Implementation:
C++
// C++ program to check if linked list is circular
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
Node *next;
Node(int x)
{
data = x;
next = NULL;
}
};
// This function returns true if given linked
// list is circular, else false.
bool isCircular(Node *head)
{
// If the head is null, the linked list is empty,
// so it is circular
if (!head)
return true;
// Traverse the linked list until either the end
// is reached or the next node is equal to the head
Node *curr = head;
while (curr && curr->next != head)
curr = curr->next;
// If the end is reached before finding
// the head again, the linked list is not circular
if (!curr)
return false;
// If the head is found again before reaching
// the end, the linked list is circular
return true;
}
int main()
{
Node *head = new Node(1);
head->next = new Node(2);
head->next->next = new Node(3);
head->next->next->next = new Node(4);
isCircular(head) ? cout << "Yes\n" : cout << "No\n";
// Making linked list circular
head->next->next->next->next = head;
isCircular(head) ? cout << "Yes\n" : cout << "No\n";
return 0;
}
C
// C program to check if the linked list is circular
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node* next;
};
struct Node* createNode(int data);
// Function to check if the linked list is circular
int isCircular(struct Node* head) {
// If head is null, list is empty, circular
if (!head) return 1;
struct Node* temp = head;
// Traverse until the end is reached or
// the next node equals the head
while (head && head->next != temp)
head = head->next;
// If end reached before finding head again,
// list is not circular
if (!head || !(head->next))
return 0;
// If head found again, list is circular
return 1;
}
struct Node* createNode(int data) {
struct Node* newNode =
(struct Node*)malloc(sizeof(struct Node));
newNode->data = data;
newNode->next = NULL;
return newNode;
}
int main() {
struct Node* head = createNode(1);
head->next = createNode(2);
head->next->next = createNode(3);
head->next->next->next = createNode(4);
// Check if the linked list is circular
isCircular(head) ? printf("Yes\n") : printf("No\n");
// Making the linked list circular
head->next->next->next->next = head;
// Check again if the linked list is circular
isCircular(head) ? printf("Yes\n") : printf("No\n");
return 0;
}
Java
// Java program to check if
// linked list is circular
class Node {
int data;
Node next;
Node(int data) {
this.data = data;
this.next = null;
}
}
class GfG {
// Function to check if the linked list is circular
static boolean isCircular(Node head) {
// If head is null, list is empty, circular
if (head == null) return true;
Node temp = head;
// Traverse until the end is reached or
// the next node equals the head
while (head != null && head.next != temp)
head = head.next;
// If end reached before finding head again,
// list is not circular
if (head == null || head.next == null)
return false;
// If head found again, list is circular
return true;
}
public static void main(String[] args) {
Node head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);
head.next.next.next = new Node(4);
// Check if the linked list is circular
System.out.println(isCircular(head) ? "Yes" : "No");
// Making the linked list circular
head.next.next.next.next = head;
// Check again if the linked list is circular
System.out.println(isCircular(head) ? "Yes" : "No");
}
}
Python
# Python program to check if linked list is circular
class Node:
def __init__(self, data):
self.data = data
self.next = None
# Function to check if the linked list is circular
def is_circular(head):
# If head is null, list is empty, circular
if not head:
return True
temp = head
# Traverse until the end is reached or
# the next node equals the head
while head and head.next != temp:
head = head.next
# If end reached before finding head again,
# list is not circular
if not head or not head.next:
return False
# If head found again, list is circular
return True
if __name__ == "__main__":
head = Node(1)
head.next = Node(2)
head.next.next = Node(3)
head.next.next.next = Node(4)
# Check if the linked list is circular
print("Yes" if is_circular(head) else "No")
# Making the linked list circular
head.next.next.next.next = head
# Check again if the linked list is circular
print("Yes" if is_circular(head) else "No")
C#
// C# program to check if
// linked list is circular
using System;
class Node {
public int data;
public Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class GfG {
// Function to check if the linked list is circular
static bool IsCircular(Node head) {
// If head is null, list is empty, circular
if (head == null) return true;
Node temp = head;
// Traverse until the end is reached or
// the next node equals the head
while (head != null && head.next != temp)
head = head.next;
// If end reached before finding head again,
// list is not circular
if (head == null || head.next == null)
return false;
// If head found again, list is circular
return true;
}
static void Main(string[] args) {
Node head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);
head.next.next.next = new Node(4);
// Check if the linked list is circular
Console.WriteLine(IsCircular(head) ? "Yes" : "No");
// Making the linked list circular
head.next.next.next.next = head;
// Check again if the linked list is circular
Console.WriteLine(IsCircular(head) ? "Yes" : "No");
}
}
JavaScript
// JavaScript program to check if linked list is circular
// Class representing a node in the list
class Node {
constructor(data) {
this.data = data;
this.next = null;
}
}
// Function to check if the linked list is circular
function isCircular(head) {
// If head is null, list is empty, circular
if (!head) return true;
let temp = head;
// Traverse until the end is reached or
// the next node equals the head
while (head && head.next !== temp)
head = head.next;
// If end reached before finding head again,
// list is not circular
if (!head || !head.next)
return false;
// If head found again, list is circular
return true;
}
// Main part
let head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);
head.next.next.next = new Node(4);
// Check if the linked list is circular
console.log(isCircular(head) ? "Yes" : "No");
// Making the linked list circular
head.next.next.next.next = head;
// Check again if the linked list is circular
console.log(isCircular(head) ? "Yes" : "No");
Time Complexity: O(n), We traverse the linked list in the worst case once, therefore, the time complexity here is linear.
Auxiliary Space: O(1), We are not using any extra space.
[Expected Approach-2] By Maintaining Slow & Fast Pointers - O(n) time and O(1) space
The idea is to use two pointers, slow and fast, to traverse the linked list. The slow pointer moves one step at a time, while the fast pointer moves two steps at a time. If the list is circular, the fast pointer will eventually meet the slow pointer; otherwise, the fast pointer will reach NULL
indicating the list is not circular.
Code Implementation:
C++
// C++ program to check if linked list is circular
#include <bits/stdc++.h>
using namespace std;
struct Node {
int data;
struct Node *next;
Node(int x) {
data = x;
next = NULL;
}
};
// Function to check if the linked list is circular
bool isCircular(Node *head) {
if (!head) {
return true;
}
Node *slow = head;
Node *fast = head->next;
while (fast && fast->next) {
if (slow == fast) {
return true;
}
slow = slow->next;
fast = fast->next->next;
}
return false;
}
int main() {
struct Node *head = new Node(1);
head->next = new Node(2);
head->next->next = new Node(3);
head->next->next->next = new Node(4);
isCircular(head) ? cout << "Yes\n" : cout << "No\n";
// Making linked list circular
head->next->next->next->next = head;
isCircular(head) ? cout << "Yes\n" : cout << "No\n";
return 0;
}
C
// C program to check if linked list is circular
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node* next;
};
struct Node* createNode(int data);
// Function to check if the linked list is circular
int isCircular(struct Node* head) {
if (!head)
return 1;
struct Node *slow = head, *fast = head->next;
// Traverse the linked list with two pointers
while (fast && fast->next) {
if (slow == fast)
return 1;
slow = slow->next;
fast = fast->next->next;
}
return 0;
}
// Function to create a new node
struct Node* createNode(int data) {
struct Node* newNode =
(struct Node*)malloc(sizeof(struct Node));
newNode->data = data;
newNode->next = NULL;
return newNode;
}
int main() {
struct Node* head = createNode(1);
head->next = createNode(2);
head->next->next = createNode(3);
head->next->next->next = createNode(4);
// Check if the linked list is circular
isCircular(head) ? printf("Yes\n") : printf("No\n");
// Making the linked list circular
head->next->next->next->next = head;
// Check again if the linked list is circular
isCircular(head) ? printf("Yes\n") : printf("No\n");
return 0;
}
Java
// Java program to check if linked list is circular
class Node {
int data;
Node next;
Node(int data) {
this.data = data;
this.next = null;
}
}
class GfG {
// Function to check if the linked list is circular
static boolean isCircular(Node head) {
if (head == null)
return true;
Node slow = head, fast = head.next;
// Traverse the linked list with two pointers
while (fast != null && fast.next != null) {
if (slow == fast)
return true;
slow = slow.next;
fast = fast.next.next;
}
return false;
}
public static void main(String[] args) {
Node head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);
head.next.next.next = new Node(4);
// Check if the linked list is circular
System.out.println(isCircular(head) ? "Yes" : "No");
// Making the linked list circular
head.next.next.next.next = head;
// Check again if the linked list is circular
System.out.println(isCircular(head) ? "Yes" : "No");
}
}
Python
# Python program to check if linked list is circular
class Node:
def __init__(self, data):
self.data = data
self.next = None
# Function to check if the linked list is circular
def is_circular(head):
if not head:
return True
slow = head
fast = head.next
while fast and fast.next:
if slow == fast:
return True
slow = slow.next
fast = fast.next.next
return False
if __name__ == "__main__":
head = Node(1)
head.next = Node(2)
head.next.next = Node(3)
head.next.next.next = Node(4)
# Check if the linked list is circular
print("Yes" if is_circular(head) else "No")
# Making the linked list circular
head.next.next.next.next = head
# Check again if the linked list is circular
print("Yes" if is_circular(head) else "No")
C#
// C# program to check if linked list is circular
using System;
class Node {
public int data;
public Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class GfG {
// Function to check if the linked list is circular
static bool IsCircular(Node head) {
if (head == null) {
return true;
}
Node slow = head;
Node fast = head.next;
while (fast != null && fast.next != null) {
if (slow == fast) {
return true;
}
slow = slow.next;
fast = fast.next.next;
}
return false;
}
static void Main(string[] args) {
Node head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);
head.next.next.next = new Node(4);
// Check if the linked list is circular
Console.WriteLine(IsCircular(head) ? "Yes" : "No");
// Making the linked list circular
head.next.next.next.next = head;
// Check again if the linked list is circular
Console.WriteLine(IsCircular(head) ? "Yes" : "No");
}
}
JavaScript
// JavaScript program to check if linked list is circular
class Node {
constructor(data) {
this.data = data;
this.next = null;
}
}
// Function to check if the linked list is circular
function isCircular(head) {
if (!head) {
return true;
}
let slow = head;
let fast = head.next;
while (fast && fast.next) {
if (slow === fast) {
return true;
}
slow = slow.next;
fast = fast.next.next;
}
return false;
}
// Main part
let head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);
head.next.next.next = new Node(4);
// Check if the linked list is circular
console.log(isCircular(head) ? "Yes" : "No");
// Making the linked list circular
head.next.next.next.next = head;
// Check again if the linked list is circular
console.log(isCircular(head) ? "Yes" : "No");
Time Complexity: O(n), We traverse the linked list in the worst case once, therefore, the time complexity here is linear.
Auxiliary Space: O(1), We use two Node pointers, slow and fast, so the extra space is constant.
Check if a linked list is Circular Linked List
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem