Skip to content
Programming101
Programming101

Learn everything about programming

  • Home
  • CS Subjects
    • IoT – Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programming101
Programming101

Learn everything about programming

Leetcode Remove Duplicates from Sorted List problem solution

YASH PAL, 31 July 2024

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

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

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

Post navigation

Previous post
Next post
  • HackerRank Separate the Numbers solution
  • How AI Is Revolutionizing Personalized Learning in Schools
  • GTA 5 is the Game of the Year for 2024 and 2025
  • Hackerrank Day 5 loops 30 days of code solution
  • Hackerrank Day 6 Lets Review 30 days of code solution
How to download udemy paid courses for free

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
©2025 Programming101 | WordPress Theme by SuperbThemes