In this post, we are going to solve the **Remove Duplicates from Sorted List** **Leetcode Solution**Â problem of **Leetcode**. This Leetcode problem is done in many programming languages like C++, Java, and Python.

**Problem**

Given theÂ `head`

Â of a sorted linked list,Â *delete all duplicates such that each element appears only once*. ReturnÂ *the linked listÂ sortedÂ as well*.

**Example 1:**

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

**Example 2:**

Input:head = [1,1,2,3,3]Output:[1,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.

Now, letâ€™s see the leetcode solution ofÂ **Remove Duplicates from Sorted List****Leetcode Solution**.

**Remove Duplicates from Sorted List** **Leetcode Solution in Python**

class Solution: def deleteDuplicates(self, head: ListNode) -> ListNode: curr = head while curr: while curr.next and curr.val == curr.next.val: curr.next = curr.next.next curr = curr.next return head

**Remove Duplicates from Sorted List Leetcode Solution** **in CPP**

class Solution { public: ListNode* deleteDuplicates(ListNode* head) { ListNode* curr = head; while (curr) { while (curr->next && curr->val == curr->next->val) curr->next = curr->next->next; curr = curr->next; } return head; } };

**Remove Duplicates from Sorted List Leetcode Solution in Java**

class Solution { public ListNode deleteDuplicates(ListNode head) { ListNode curr = head; while (curr != null) { while (curr.next != null && curr.val == curr.next.val) curr.next = curr.next.next; curr = curr.next; } return head; } }

**Note:**Â This problemÂ ** Remove Duplicates from Sorted List** is generated byÂ

**LeetcodeÂ**but the solution is provided byÂ

**Chase2learn**This tutorial is only forÂ EducationalÂ andÂ LearningÂ purposes.