Remove All Duplicates From Sorted Linkedlist

easy
Question Solve Solutions 
1. You are give a single sorted linkedlist of numbers. 
2. remove all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return the remaning linked list.

Input Format

1->1->1->4->5->6->6->7->8->9->9->9->null

Output Format

4->5->7->8->null

Constraints

0 <= N <= 10^6

Notice


Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
12
1 1 1 4 5 6 6 7 8 9 9 9
Output
4 5 7 8
Previous
Remove Duplicate From Sorted Linkedlist
Next
Segregate 01 Node Of Linkedlist Over Swapping Nodes

Related Questions

easy Reverse A Linkedlist easy Middle Of A Linked List easy Palindrome Linkedlist easy Fold Of Linkedlist easy Unfold Of Linkedlist easy Merge Two Sorted Linkedlist easy Mergesort Linkedlist easy Segregate Even And Odd Nodes In A Linkedlist easy Remove Nth Node From End Of Linkedlist easy Merge K Sorted Linkedlist easy Reverse Node Of Linkedlist In K Group easy Reverse In Range easy Copy Linkedlist With Random Pointers easy Is Cycle Present In Linkedlist easy Add Two Linkedlist medium Subtract Two Linkedlist