Skip to content
Programmingoneonone
Programmingoneonone
  • Engineering Subjects
    • Internet of Things (IoT)
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
    • 100+ C++ Programs
  • Solutions
    • HackerRank
      • Algorithms Solutions
      • C solutions
      • C++ solutions
      • Java solutions
      • Python solutions
    • Leetcode Solutions
    • HackerEarth Solutions
  • Work with US
Programmingoneonone
Programmingoneonone

Leetcode Remove Duplicates from Sorted List problem solution

YASH PAL, 31 July 202418 January 2026

In this Leetcode Remove Duplicates from Sorted List problem solution we have 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.

Leetcode Remove Duplicates from Sorted List problem solution

Leetcode Remove Duplicates from Sorted List problem solution in Python.

class Solution:
    def deleteDuplicates(self, head: ListNode) -> ListNode:
        if not head:
            return
        current = head
        if current:
            while current.next and current:
                # print(current.val)
                if current.val == current.next.val:
                    current.next = current.next.next
                else:
                    current= current.next
        return head

Remove Duplicates from Sorted List problem solution in Java.

public ListNode deleteDuplicates(ListNode head) {
        ListNode dummy = head;
        while(dummy != null && dummy.next !=null){
            if(dummy.val == dummy.next.val) dummy.next = dummy.next.next;
            else dummy = dummy.next;
        }
        return head;
    }

Problem solution in C++.

class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        if (head==nullptr)
            return 0;
        struct ListNode* ptr;
        ptr=head;
        while (ptr->next != nullptr){
            if (ptr->val ==ptr->next->val){
                ptr->next=ptr->next->next;
            }
            else
               ptr=ptr->next;
        }
        return head;
        
    }
};

Problem solution in C.

struct ListNode* deleteDuplicates(struct ListNode* head){
    
    struct ListNode* cur = head;
    if(head == NULL)
        return head;
    
    while(cur->next != NULL)
    {
        if(cur->val == (cur->next->val))
        {
            cur->next = cur->next->next;
        }
        else
            cur = cur->next;
    }
    
    return head;

}

coding problems solutions Leetcode Problems Solutions Leetcode

Post navigation

Previous post
Next post

Leave a Reply

Your email address will not be published. Required fields are marked *

Programmingoneonone

We at Programmingoneonone, also known as Programming101 is a learning hub of programming and other related stuff. We provide free learning tutorials/articles related to programming and other technical stuff to people who are eager to learn about it.

Pages

  • About US
  • Contact US
  • Privacy Policy

Practice

  • Java
  • C++
  • C

Follow US

  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2026 Programmingoneonone | WordPress Theme by SuperbThemes