Skip to content
Programming101
Programmingoneonone

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
Programmingoneonone

Learn everything about programming

Leetcode Remove Linked List Elements problem solution

YASH PAL, 31 July 2024

In this Leetcode Remove Linked List Elements problem solution we have Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val == val, and return the new head.

Leetcode Remove Linked List Elements problem solution

Topics we are covering

Toggle
  • Problem solution in Python.
  • Problem solution in Java.
  • Problem solution in C++.
  • Problem solution in C.

Problem solution in Python.

class Solution:
    def removeElements(self, head: ListNode, val: int) -> ListNode:
        arr = []
        newList = head
        newListHead = head
        while head != None:
            if head.val != val:            
                arr.append(head.val)
            head = head.next
            
        for i in range(len(arr)):
            newList.val = arr[i]
            if(i == len(arr) - 1):
                newList.next = None
            else:
                newList = newList.next
        if len(arr) == 0:
            newListHead = None
        return newListHead

Problem solution in Java.

public ListNode removeElements(ListNode head, int val)
	{
		if (head == null)
			return null;

		ListNode curr = head;
		ListNode prev = null;

		while (curr != null)
		{
			if (curr.val == val)
			{
				if (prev != null)
					prev.next = curr.next;
				else
					head = head.next;
			}
			else
			{
				prev = curr;
			}
			curr = curr.next;
		}
		return head;
	}

Problem solution in C++.

class Solution {
public:
    Solution(){
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    ListNode* removeElements(ListNode* head, int val) {
        while((head != nullptr) && (head->val == val))
            head = head->next;
        ListNode *temp = head;
        while(temp != nullptr){
            ListNode *next = temp->next;
            while((next != nullptr) && (next->val == val)){
                temp->next = next->next;
                next = next->next;
            }
            temp = temp->next;
        }
        return head;
    }
};

Problem solution in C.

struct ListNode* removeElements(struct ListNode* head, int val) 
{
    struct ListNode **pp, *p;

    pp = &head;
    while (*pp) {
        p = *pp;
        if ((*pp)->val == val) { /* found one */
            *pp = p->next;
            free(p);
        } else
            pp = &p->next;
    }

    return head;
}

coding problems solutions

Post navigation

Previous post
Next post
  • Automating Image Format Conversion with Python: A Complete Guide
  • 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
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
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes