Added C++ solution for removing duplicates from unsorted linked list

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;
+}