Remove Duplicates from an Unsorted Linked List
Last Updated :
23 Jul, 2025
Given an unsorted linked list containing n nodes, the task is to remove duplicate nodes while preserving the original order.
Examples:
Input: 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
Output: 12 -> 11 -> 21 -> 41 -> 43
Explanation: The second occurrence of 12 (the one after 11) and the second occurrence of 21 (the one at the end) are removed, resulting in a linked list that maintains the order of their first appearances.
Input: 1 -> 2 -> 3 -> 2 -> 4
Output: 1 -> 2 -> 3 -> 4
Explanation: Similarly, the second occurrence of 2 is removed, ensuring that each number appears only once while maintaining the order of their first appearances.
[Naive Approach] Using Nested Loops - O(n^2) Time and O(1) Space
The idea is to use two loops to remove duplicates from an unsorted linked list. The first loop goes through each node one by one. For each node, the second loop checks all the nodes that come after it to see if there are any duplicates. If a duplicate is found, it removes it by changing the links. This way, we keep only the first occurrence of each number while maintaining their order.
C++
// C++ program to remove duplicates from an
// unsorted linked list
#include <iostream>
using namespace std;
class Node {
public:
int data;
Node* next;
Node(int val) {
data = val;
next = nullptr;
}
};
// Function to remove duplicates using nested loops
Node* removeDuplicates(Node* head) {
Node* curr1 = head;
// Traverse each node in the list
while (curr1 != nullptr) {
Node* curr2 = curr1;
// Traverse the remaining nodes to find and
// remove duplicates
while (curr2->next != nullptr) {
// Check if the next node has the same
// data as the current node
if (curr2->next->data == curr1->data) {
// Duplicate found, remove it
Node* duplicate = curr2->next;
curr2->next = curr2->next->next;
// Free the memory of the duplicate node
delete duplicate;
} else {
// If the next node has different data from
// the current node, move to the next node
curr2 = curr2->next;
}
}
// Move to the next node in the list
curr1 = curr1->next;
}
return head;
}
void printList(Node* head) {
Node* curr = head;
while (curr != nullptr) {
cout << curr->data << " ";
curr = curr->next;
}
cout << endl;
}
int main() {
// Create a singly linked list:
// 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
Node* head = new Node(12);
head->next = new Node(11);
head->next->next = new Node(12);
head->next->next->next = new Node(21);
head->next->next->next->next = new Node(41);
head->next->next->next->next->next = new Node(43);
head->next->next->next->next->next->next = new Node(21);
head = removeDuplicates(head);
printList(head);
return 0;
}
// C program to remove duplicates from an
// unsorted linked list
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node* next;
};
// Function to remove duplicates using nested loops
struct Node* removeDuplicates(struct Node* head) {
struct Node* curr1 = head;
// Traverse each node in the list
while (curr1 != NULL) {
struct Node* curr2 = curr1;
// Traverse the remaining nodes to find and
// remove duplicates
while (curr2->next != NULL) {
// Check if the next node has the same
// data as the current node
if (curr2->next->data == curr1->data) {
// Duplicate found, remove it
struct Node* duplicate = curr2->next;
curr2->next = curr2->next->next;
// Free the memory of the duplicate node
free(duplicate);
} else {
// If the next node has different data from
// the current node, move to the next node
curr2 = curr2->next;
}
}
// Move to the next node in the list
curr1 = curr1->next;
}
return head;
}
void printList(struct Node* head) {
struct Node* curr = head;
while (curr != NULL) {
printf("%d ", curr->data);
curr = curr->next;
}
printf("\n");
}
struct Node* createNode(int data) {
struct Node* newNode =
(struct Node*)malloc(sizeof(struct Node));
newNode->data = data;
newNode->next = NULL;
return newNode;
}
int main() {
// Create a singly linked list:
// 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
struct Node* head = createNode(12);
head->next = createNode(11);
head->next->next = createNode(12);
head->next->next->next = createNode(21);
head->next->next->next->next = createNode(41);
head->next->next->next->next->next = createNode(43);
head->next->next->next->next->next->next = createNode(21);
head = removeDuplicates(head);
printList(head);
return 0;
}
// Java program to remove duplicates from an
// unsorted linked list
class Node {
int data;
Node next;
Node(int val) {
this.data = val;
this.next = null;
}
}
// Function to remove duplicates using nested loops
class GfG {
static Node removeDuplicates(Node head) {
Node curr1 = head;
// Traverse each node in the list
while (curr1 != null) {
Node curr2 = curr1;
// Traverse the remaining nodes to find and
// remove duplicates
while (curr2.next != null) {
// Check if the next node has the same
// data as the current node
if (curr2.next.data == curr1.data) {
// Duplicate found, remove it
curr2.next = curr2.next.next;
} else {
// If the next node has different data from
// the current node, move to the next node
curr2 = curr2.next;
}
}
// Move to the next node in the list
curr1 = curr1.next;
}
return head;
}
static void printList(Node head) {
Node curr = head;
while (curr != null) {
System.out.print(curr.data + " ");
curr = curr.next;
}
System.out.println();
}
public static void main(String[] args) {
// Create a singly linked list:
// 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
Node head = new Node(12);
head.next = new Node(11);
head.next.next = new Node(12);
head.next.next.next = new Node(21);
head.next.next.next.next = new Node(41);
head.next.next.next.next.next = new Node(43);
head.next.next.next.next.next.next = new Node(21);
head = removeDuplicates(head);
printList(head);
}
}
# Python program to remove duplicates from an
# unsorted linked list
class Node:
def __init__(self, val):
self.data = val
self.next = None
# Function to remove duplicates using nested loops
def remove_duplicates(head):
curr1 = head
# Traverse each node in the list
while curr1:
curr2 = curr1
# Traverse the remaining nodes to find and
# remove duplicates
while curr2.next:
# Check if the next node has the same
# data as the current node
if curr2.next.data == curr1.data:
# Duplicate found, remove it
curr2.next = curr2.next.next
else:
# If the next node has different data from
# the current node, move to the next node
curr2 = curr2.next
# Move to the next node in the list
curr1 = curr1.next
return head
def print_list(head):
curr = head
while curr:
print(curr.data, end=" ")
curr = curr.next
print()
if __name__ == "__main__":
# Create a singly linked list:
# 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
head = Node(12)
head.next = Node(11)
head.next.next = Node(12)
head.next.next.next = Node(21)
head.next.next.next.next = Node(41)
head.next.next.next.next.next = Node(43)
head.next.next.next.next.next.next = Node(21)
head = remove_duplicates(head)
print_list(head)
// C# program to remove duplicates from an
// unsorted linked list
using System;
class Node {
public int Data;
public Node Next;
public Node(int val) {
this.Data = val;
this.Next = null;
}
}
// Function to remove duplicates using nested loops
class GfG {
static Node RemoveDuplicates(Node head) {
Node curr1 = head;
// Traverse each node in the list
while (curr1 != null) {
Node curr2 = curr1;
// Traverse the remaining nodes to find and
// remove duplicates
while (curr2.Next != null) {
// Check if the next node has the same
// data as the current node
if (curr2.Next.Data == curr1.Data) {
// Duplicate found, remove it
curr2.Next = curr2.Next.Next;
} else {
// If the next node has different data from
// the current node, move to the next node
curr2 = curr2.Next;
}
}
// Move to the next node in the list
curr1 = curr1.Next;
}
return head;
}
static void PrintList(Node head) {
Node curr = head;
while (curr != null) {
Console.Write(curr.Data + " ");
curr = curr.Next;
}
Console.WriteLine();
}
static void Main() {
// Create a singly linked list:
// 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
Node head = new Node(12);
head.Next = new Node(11);
head.Next.Next = new Node(12);
head.Next.Next.Next = new Node(21);
head.Next.Next.Next.Next = new Node(41);
head.Next.Next.Next.Next.Next = new Node(43);
head.Next.Next.Next.Next.Next.Next = new Node(21);
head = RemoveDuplicates(head);
PrintList(head);
}
}
// JavaScript program to remove duplicates from an
// unsorted linked list
class Node {
constructor(val)
{
this.data = val;
this.next = null;
}
}
// Function to remove duplicates using nested loops
function removeDuplicates(head) {
let curr1 = head;
// Traverse each node in the list
while (curr1 != null) {
let curr2 = curr1;
// Traverse the remaining nodes to find and
// remove duplicates
while (curr2.next != null) {
// Check if the next node has the same
// data as the current node
if (curr2.next.data === curr1.data) {
// Duplicate found, remove it
curr2.next = curr2.next.next;
}
else {
// If the next node has different data from
// the current node, move to the next node
curr2 = curr2.next;
}
}
// Move to the next node in the list
curr1 = curr1.next;
}
return head;
}
function printList(head) {
let curr = head;
while (curr != null) {
console.log(curr.data + " ");
curr = curr.next;
}
console.log();
}
// Create a singly linked list:
// 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
let head = new Node(12);
head.next = new Node(11);
head.next.next = new Node(12);
head.next.next.next = new Node(21);
head.next.next.next.next = new Node(41);
head.next.next.next.next.next = new Node(43);
head.next.next.next.next.next.next = new Node(21);
head = removeDuplicates(head);
printList(head);
Time Complexity: O(n^2), Due to two nested loops
Auxiliary Space: O(1)
[Expected Approach] Using HashSet - O(n) Time and O(n) Space
In this approach, we can use a hash set to keep track of the values (nodes) that have already been seen. As we traverse the linked list, for each node, we check if its value is already in the hash set. If the value is found, it means it's a duplicate, so we remove that node by adjusting the pointers of the previous node to skip the current one. If the value is not found, we add it to the hash set and move to the next node.
C++
// C++ implementation to remove duplicates from
// an unsorted singly linked list using hashing
#include <bits/stdc++.h>
using namespace std;
class Node {
public:
int data;
Node *next;
Node(int x) {
data = x;
next = nullptr;
}
};
Node *removeDuplicates(Node *head) {
unordered_set<int> hashSet;
Node *curr = head;
Node *prev = nullptr;
while (curr != nullptr) {
// Check if the element is already in the hash table
if (hashSet.find(curr->data) != hashSet.end()) {
// Element is present, remove it
prev->next = curr->next;
// Delete the curr node
Node *temp = curr;
curr = curr->next;
delete temp;
}
else {
// Element is not present, add it to hash table
hashSet.insert(curr->data);
prev = curr;
curr = curr->next;
}
}
return head;
}
void printList(Node *head) {
Node *curr = head;
while (curr != nullptr) {
cout << curr->data << " ";
curr = curr->next;
}
cout << endl;
}
int main() {
// Create a singly linked list:
// 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
Node* head = new Node(12);
head->next = new Node(11);
head->next->next = new Node(12);
head->next->next->next = new Node(21);
head->next->next->next->next = new Node(41);
head->next->next->next->next->next = new Node(43);
head->next->next->next->next->next->next = new Node(21);
head = removeDuplicates(head);
printList(head);
return 0;
}
// Java implementation to remove duplicates from
// an unsorted singly linked list using hashing
import java.util.HashSet;
class Node {
int data;
Node next;
Node(int x) {
data = x;
next = null;
}
}
class GfG {
static Node removeDuplicates(Node head) {
HashSet<Integer> hashSet = new HashSet<>();
Node curr = head;
Node prev = null;
while (curr != null) {
// Check if the element is already in the hash table
if (hashSet.contains(curr.data)) {
// Element is present, remove it
prev.next = curr.next;
} else {
// Element is not present, add it to hash table
hashSet.add(curr.data);
prev = curr;
}
curr = curr.next;
}
return head;
}
static void printList(Node head) {
Node curr = head;
while (curr != null) {
System.out.print(curr.data + " ");
curr = curr.next;
}
System.out.println();
}
public static void main(String[] args) {
// Create a singly linked list:
// 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
Node head = new Node(12);
head.next = new Node(11);
head.next.next = new Node(12);
head.next.next.next = new Node(21);
head.next.next.next.next = new Node(41);
head.next.next.next.next.next = new Node(43);
head.next.next.next.next.next.next = new Node(21);
head = removeDuplicates(head);
printList(head);
}
}
# Python implementation to remove duplicates from
# an unsorted singly linked list using hashing
class Node:
def __init__(self, x):
self.data = x
self.next = None
def remove_duplicates(head):
hash_set = set()
curr = head
prev = None
while curr is not None:
# Check if the element is already in the hash table
if curr.data in hash_set:
# Element is present, remove it
prev.next = curr.next
curr = curr.next
else:
# Element is not present, add it to hash table
hash_set.add(curr.data)
prev = curr
curr = curr.next
return head
def print_list(head):
curr = head
while curr is not None:
print(curr.data, end=" ")
curr = curr.next
print()
if __name__ == "__main__":
# Create a singly linked list:
# 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
head = Node(12)
head.next = Node(11)
head.next.next = Node(12)
head.next.next.next = Node(21)
head.next.next.next.next = Node(41)
head.next.next.next.next.next = Node(43)
head.next.next.next.next.next.next = Node(21)
head = remove_duplicates(head)
print_list(head)
// C# implementation to remove duplicates from
// an unsorted singly linked list using hashing
using System;
using System.Collections.Generic;
class Node {
public int Data;
public Node Next;
public Node(int x) {
Data = x;
Next = null;
}
}
class GfG {
static Node RemoveDuplicates(Node head) {
HashSet<int> hashSet = new HashSet<int>();
Node curr = head;
Node prev = null;
while (curr != null) {
// Check if the element is already in the hash table
if (hashSet.Contains(curr.Data)) {
// Element is present, remove it
prev.Next = curr.Next;
curr = curr.Next;
} else {
// Element is not present, add it to hash table
hashSet.Add(curr.Data);
prev = curr;
curr = curr.Next;
}
}
return head;
}
static void PrintList(Node head) {
Node curr = head;
while (curr != null) {
Console.Write(curr.Data + " ");
curr = curr.Next;
}
Console.WriteLine();
}
static void Main() {
// Create a singly linked list:
// 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
Node head = new Node(12);
head.Next = new Node(11);
head.Next.Next = new Node(12);
head.Next.Next.Next = new Node(21);
head.Next.Next.Next.Next = new Node(41);
head.Next.Next.Next.Next.Next = new Node(43);
head.Next.Next.Next.Next.Next.Next = new Node(21);
head = RemoveDuplicates(head);
PrintList(head);
}
}
// JavaScript implementation to remove duplicates from
// an unsorted singly linked list using hashing
class Node {
constructor(x) {
this.data = x;
this.next = null;
}
}
function removeDuplicates(head) {
const hashSet = new Set();
let curr = head;
let prev = null;
while (curr !== null) {
// Check if the element is already in the hash table
if (hashSet.has(curr.data)) {
// Element is present, remove it
prev.next = curr.next;
curr = curr.next;
} else {
// Element is not present, add it to hash table
hashSet.add(curr.data);
prev = curr;
curr = curr.next;
}
}
return head;
}
function printList(head) {
let curr = head;
while (curr !== null) {
console.log(curr.data, ' ');
curr = curr.next;
}
console.log();
}
// Create a singly linked list:
// 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21
let head = new Node(12);
head.next = new Node(11);
head.next.next = new Node(12);
head.next.next.next = new Node(21);
head.next.next.next.next = new Node(41);
head.next.next.next.next.next = new Node(43);
head.next.next.next.next.next.next = new Node(21);
head = removeDuplicates(head);
printList(head);
Time Complexity: O(n), where n are the number of nodes in the linked list.
Auxiliary Space: O(n)
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