# How to remove duplicates from the sorted linked list

Last Updated: May 15, 2022
Difficulty Level :
MEDIUM

## Introduction

In this blog, we will learn how we can remove duplicates from a sorted linked list. So let's suppose we have a Linked List sorted in increasing order, and it may or may not contain some duplicate nodes. Now we need to remove all the duplicate nodes from this link list. For example-

There are numerous approaches to doing the above task, as we can travel through the linked list by comparing the current node with its next node and removing the next node if it is equal. Or we can also use a two-pointer approach where the first pointer helps us traverse through the linked list, and the second pointer only points to the distinct nodes in the list. Another approach could be to use an unordered map to store all the nodes, and as maps don't allow duplicates, thus we will get rid of all the duplicates. So let's see all of these methods one by one; start with the simple traversal-based approach.

## Approach 1: Naive

The naive approach to solve this problem is to iterate through the linked list and keep comparing the current node with its next node, and if they are the same, delete the next node and move to the next node. Finally, print the linked list. This approach can be implemented using recursion, so let's go through both implementations one by one.

### Algorithm

1. Take the linked list from user input-
2. Iterate through the linked list and compare the current node with the next node-
3. If they are equal, delete the next node after storing the pointer to the next node of the next node. Then link the current node with the next to the next node.
4. If not, then continue traversing the linked list.
5. Finally, print the linked list.

### Implementation

``````#include <bits/stdc++.h>
using namespace std;
//Structure for a node in the linked list.
struct node
{
int data;
struct node *next;
};
//Function to remove duplicates.
{
//Pointer to traverse the linked list.
//pointer to store the next to the next pointer of the current
//node.
node* nextofcurr;
if(curr==nullptr)
{
return;
}
while(curr->next!=nullptr)
{
//When the next node is a duplicate of the current node.
if(curr->data==curr->next->data)
{
//Store the next of the next node.
nextofcurr=curr->next->next;
//Delete the next node
free(curr->next);
//Assign the next node to the iterator.
curr->next=nextofcurr;
}
//When the next node is not a duplicate of the current
//node.
else
{
curr=curr->next;
}
}
}
//Function to push nodes into the list.
void push(struct node** headr, int new_val)
{
//Creatng a new node.
struct node* new_node= new node();
//Putting the value in the node.
new_node->data= new_val;
//Linking the node to the list.
//Shifting the head pointer to the new node.
}
//Driver function.
int main()
{
//Creating an empty list.
//Enter no  of nodes in the node.
int size;
cout<<"Enter the number of nodes in the list- ";
cin>>size;
//Pushing the nodes in it.
cout<<"Enter the nodes in the list- ";
for(int i=0;i<size;i++)
{
int a;
cin>>a;
}
//To remove duplicates from the sorted linked list.
{
}
return 0;
}``````

Input

``````7
5 4 3 2 2 2 1``````

Output

``````Enter the number of nodes in the list-
Enter the nodes in the list-
1 2 3 4 5 ``````

### Complexity Analysis

The time complexity of this approach is- O(N), where N is the number of nodes in the linked list.

The space complexity of this approach is- O(1)

### Recursive implementation of the above approach

``````#include <bits/stdc++.h>
using namespace std;
//Structure for a node in linked list.
struct node
{
int data;
struct node *next;
};
//Function to remove duplicates.
{
//To store the duplicate nodes which will be deleted.
node* todelete;
{
return;
}
{
//When the next node is a duplicate of the current node.
{
//For removing the duplicate node.
//Moving the current node to the next to the next node.
//Delete the duplicate node
free(todelete);
//Recursive call to the fucntion with the next node.
}
else
{
//When the next node is not a duplicate of the
//current node.
}
}
}
//Function to push nodes into the list.
void push(struct node** headr, int new_val)
{
//Creatng a new node.
struct node* new_node= new node();
//Putting the value in the node.
new_node->data= new_val;
//Linking the node to the list.
//Shifting the head pointer to the new node.
}
//Driver function.
int main()
{
//Creating an empty list.
//Enter no  of nodes in the node.
int size;
cout<<"Enter the number of nodes in the list- ";
cin>>size;
//Pushing the nodes in it.
cout<<"Enter the nodes in the list- ";
for(int i=0;i<size;i++)
{
int a;
cin>>a;
}
//To remove duplicates from the sorted linked list.
{
}
return 0;
}``````

Input

``````7
5 4 3 2 2 2 1``````

Output

``````Enter the number of nodes in the list-
Enter the nodes in the list-
1 2 3 4 5 ``````

#### Complexity Analysis

The time complexity of this approach is- O(N)

The space complexity of this approach is- O(N)

## Approach 2: Using Two Pointers

This approach uses two-pointers to remove duplicates from the sorted linked list. The first pointer iterates through the whole list. And the second pointer moves over only those nodes which are distinct. While iterating through the list, whenever the first pointer encounter duplicate nodes, it skips them, and when it encounters a distinct node, it moves the second pointer from the last distinct node to this new node.

### Algorithm

1. Take the linked list from user input-
2. Declare two-pointers and initialize them with the head of the linked list
3. Iterate through the list using the first pointer-
4. If it encounters a node that duplicates its previous, it does nothing, and if the node is distinct, it moves the second pointer to that node.

### Implementation

``````#include <bits/stdc++.h>
using namespace std;
//Structure for a node in linked list.
struct node
{
int data;
struct node *next;
};
//Function to remove duplicates.
{
//Two reference pointers, one for iterating through the linked
//list, another for pointing to first occurence of every
//distinct node.
//Traversing through the list.
while(ptr1!=nullptr)
{
//Comparing the current node with the next node.
if(ptr1->data!=ptr2->data)
{
//If a new node is found, skip the duplicates.
ptr2->next=ptr1;
ptr2=ptr1;
}
//Move the iterator to the next node.
ptr1=ptr1->next;
}
//When the last node has duplicates.
if(ptr2!=ptr1)
{
ptr2->next=nullptr;
}
}
//Function to push nodes into the list.
void push(struct node** headr, int new_val)
{
//Creatng a new node.
struct node* new_node= new node();
//Putting the value in the node.
new_node->data= new_val;
//Linking the node to the list.
//Shifting the head pointer to the new node.
}
//Driver function.
int main()
{
//Creating an empty list.
//Enter no  of nodes in the node.
int size;
cout<<"Enter the number of nodes in the list- ";
cin>>size;
//Pushing the nodes in it.
cout<<"Enter the nodes in the list- ";
for(int i=0;i<size;i++)
{
int a;
cin>>a;
}
//To remove duplicates from the sorted linked list.
{
}
return 0;
}``````

Input

``````7
5 4 3 2 2 2 1``````

Output

``````Enter the number of nodes in the list-
Enter the nodes in the list-
1 2 3 4 5 ``````

### Complexity Analysis

The time complexity of this approach is- O(N)

The space complexity of this approach is- O(1)

## Approach 3: Using Maps

Another approach to solving this problem is using maps. We traverse through the linked list and check if the node has already occurred or node. If it has not occurred, we print it and mark it as visited on the map. And skip it if it is already visited.

### Algorithm

1. Take the linked list from user input-
2. Create a map that takes node data and boolean variables as key-value pairs.
3. Traverse through the linked list, and if a node appears for the first time or not-
4. If Yes, print it and mark it as visited on the map.
5. Else move on to the next node.

### Implementation

``````#include <bits/stdc++.h>
using namespace std;
//Structure for a node in the linked list.
struct node
{
int data;
struct node *next;
};
//Function to remove duplicates.
{
//Map to store the distinct values.
unordered_map<int, bool> distinctnodes;
//To traverse through the nodes.
while(curr)
{
//If the current nodes is its first occurence.
if(distinctnodes.find(curr->data)==distinctnodes.end())
{
cout<<curr->data<<" ";
}
//Marked the node as visited.
distinctnodes[curr->data]=true;
curr=curr->next;
}
}
//Function to push nodes into the list.
void push(struct node** headr, int new_val)
{
//Creatng a new node.
struct node* new_node= new node();
//Putting the value in the node.
new_node->data= new_val;
//Linking the node to the list.
//Shifting the head pointer to the new node.
}
//Driver function.
int main()
{
//Creating an empty list.
//Enter no  of nodes in the node.
int size;
cout<<"Enter the number of nodes in the list- ";
cin>>size;
//Pushing the nodes in it.
cout<<"Enter the nodes in the list- ";
for(int i=0;i<size;i++)
{
int a;
cin>>a;
}
//To remove duplicates from the sorted linked list.
}``````

Input

``````7
5 4 3 2 2 2 1``````

Output

``````Enter the number of nodes in the list-
Enter the nodes in the list-
1 2 3 4 5 ``````

### Complexity Analysis

The time complexity of this approach is- O(N)

The space complexity of this approach is- O(1)

### What are the types of the linked list?

The linked list is generally of four types-

### What is the difference between array and linked lists?

The array is a contiguous block of elements of similar data types. In contrast, a linked list is a collection of objects called nodes. These nodes contain data and pointers to the next nodes in the linked list. These nodes are not necessarily stored in contiguous memory blocks.

Random access of elements refers to a condition when we can access any element in a collection of elements directly in one step, i.e., in O(1) time. It is possible in an array but not in linked lists.

### What is the time complexity of insert operation on unordered maps in C++ STL?

The insert operation on unordered maps in C++ STL is constant O(1) in average cases and linear O(N) in worst cases.

### What is the difference between a node in a singly linked list and a doubly-linked list?

A node in a singly linked list only contains data and the pointer to the next node, whereas a doubly-linked list contains data and pointers to the next and previous nodes.

## Conclusion

In this blog, we learned the different approaches used to remove duplicates from the sorted linked list.

• We started with the basic approach of traversing through the linked list and comparing the current node with the next node, and if they are equal, delete the next node and link the current node to the next node.
• The second approach used two pointers. One iterates through the whole list, and the second pointer moves only over the distinct nodes. In this method, the first pointer continues traversing until it finds a distinct node, and then the second pointer is moved to that node. Finally, we print the nodes traversed by the second pointer.
• The last approach uses a map to remove duplicates from the sorted linked list. We create a map with integer and bool as key-value pairs. Now we traverse through the linked list and check if a node is visited or not. If not, we print it, and if visited, we continue the traversal without printing.

More suggested problems based on LinkedList are Remove Duplicates from Sorted List, Add One to LinkedList, Cycle Detection in Singly LinkedList, and many more.

Refer to the top list of problems of Map data structure

I hope that this blog has helped you enhance your knowledge regarding the above Data Structures and Algorithms problem and if you would like to learn more, check out our articles on the CodeStudio. Enroll in our courses, refer to the test series and problems available, and look at the interview bundle for placement preparations for big tech companies like Amazon, Microsoft, Google, and many more.

Do upvote our blogs if you find them helpful and engaging!

Happy Learning!!