Remove nodes with a given value

Q: Remove nodes with a given value

This is a Coding & Algorithms interview question from Capital One for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

Problem

You are given the head of a singly linked list and an integer target.

Remove all nodes whose value equals target, and return the (possibly new) head of the list.

Input

head : head node of a singly linked list (may be null )
target : integer

Output

The head of the linked list after deletions

Constraints

Number of nodes: 0 <= n <= 10^5
Node values and target fit in 32-bit signed integer
Must run in O(n) time and O(1) extra space (not counting the list itself)

Examples

1 -> 2 -> 6 -> 3 -> 4 -> 5 -> 6 , target = 6 ⇒ 1 -> 2 -> 3 -> 4 -> 5
7 -> 7 -> 7 , target = 7 ⇒ (empty list)
(empty list) , target = 1 ⇒ (empty list)