Practice Remove Linked List Elements
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Remove Linked List Elements on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
head = [1,2,6,3,4,5,6], val = 6
Output
[1,2,3,4,5]
# Example 2
Input
head = [], val = 1
Output
[]
# Example 3
Input
head = [7,7,7,7], val = 7
Output
[]
Constraints
The number of nodes in the list is in the range [0, 10^4].
1 <= Node.val <= 50
0 <= val <= 50
Related LeetCode Problems
Practice more problems similar to Remove Linked List Elements.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.