From ca61d0be8ef9014380f422d2581764c7f4b607af Mon Sep 17 00:00:00 2001
From: nikita0109balwada <nikitabalwada309@gmail.com>
Date: Tue, 3 Mar 2026 09:19:52 +0530
Subject: [PATCH] Added C++ solution for removing duplicates from unsorted
 linked list

---
 .../duplicates_UnsortedLL.cpp                 | 24 +++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 Lecture048 Linked List Day5/duplicates_UnsortedLL.cpp

diff --git a/Lecture048 Linked List Day5/duplicates_UnsortedLL.cpp b/Lecture048 Linked List Day5/duplicates_UnsortedLL.cpp
new file mode 100644
index 00000000..61e266e2
--- /dev/null
+++ b/Lecture048 Linked List Day5/duplicates_UnsortedLL.cpp	
@@ -0,0 +1,24 @@
+Node* removeDuplicates(Node* head) {
+    if (head == NULL) return NULL;
+
+    unordered_set<int> seen;
+    Node* curr = head;
+    Node* prev = NULL;
+
+    while (curr != NULL) {
+
+        // If value already exists, remove node
+        if (seen.find(curr->data) != seen.end()) {
+            prev->next = curr->next;
+            delete curr;
+            curr = prev->next;
+        }
+        else {
+            seen.insert(curr->data);
+            prev = curr;
+            curr = curr->next;
+        }
+    }
+
+    return head;
+}
\ No newline at end of file