Remove Duplicates from an unsorted Linked list. | Algorithms

Remove Duplicates from an unsorted Linked list. | Algorithms

Objec­tive: Write a pro­gram to remove the dupli­cates from an unsorted linked list

Exam­ple:

Input Linked List : 1->2->2->4->3->3->2
Out­put : 1->2->4->3

Input: An unsorted linked list

Out­put: Linked list with no duplicates.

Approach:

• Cre­ate a Hash Table
• Take two point­ers, pre­vN­ode and CurrNode.
• Pre­vN­ode will point to the head of the linked list and cur­rN­ode will point to the head.next.

• Now nav­i­gate through the linked list.
• Check every node data is present in the HashTable.
• if yes then delete that node using pre­vN­ode and currNode.
• If No, then insert that node data into the linked list
• Return the head of the list

Time Com­plex­ity : O(n)
Space Com­plex­ity : O(n)

Read full article from Remove Duplicates from an unsorted Linked list. | Algorithms