Delete All Occurrences of a Given Key in a Linked List

Given the head of a linked list and a key, delete all nodes whose values match the given key.

Statement

We’re given the head of a linked list and a key. Delete all the nodes that contain the given key.

Note: The input linked list will not have cycles in it.

Example

The following example elaborates this problem further:

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.