# Remove Duplicates from Sorted List II Leetcode Solution

#### ByBrokenprogrammers

Dec 17, 2022

In this post, you will know how to solve the Remove Duplicates from Sorted List II Leetcode Solution problem of Leetcode. This Leetcode problem is done in many programming languages like C++, Java, and Python.

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Leetcode by yourself. If you find any difficulty after trying several times, then you can look for solutions.

## Problem

Given the `head` of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return the linked list sorted as well.

Example 1:

```Input: head = [1,2,3,3,4,4,5]
Output: [1,2,5]
```

Example 2:

```Input: head = [1,1,1,2,3]
Output: [2,3]
```

Constraints:

• The number of nodes in the list is in the range `[0, 300]`.
• `-100 <= Node.val <= 100`
• The list is guaranteed to be sorted in ascending order.

### Remove Duplicates from Sorted List II Leetcode Solutions in Python

```class Solution:
def deleteDuplicates(self, head: ListNode) -> ListNode:
prev = dummy
prev = prev.next
else:
return dummy.next
```

### Remove Duplicates from Sorted List II Leetcode Solutionsin CPP

```class Solution {
public:
ListNode* prev = &dummy;
prev = prev->next;
else
}
return dummy.next;
}
};
```

### Remove Duplicates from Sorted List II Leetcode Solutions in Java

```class Solution {
ListNode dummy = new ListNode(0, head);
ListNode prev = dummy;
prev = prev.next;
else
}
return dummy.next;
}
}
```

Note: This problem Remove Duplicates from Sorted List II is generated by Leetcode but the solution is provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.