Mark As Completed Discussion

Good morning! Here's our prompt for today.

Now that we've implemented a linked list, can you write a method that will delete all nodes of a given value?

Description

You're given the following standard structure as the definition of a linked list node:

JAVASCRIPT
1class LinkedListNode {
2	constructor(val) {
3		this.val = val;
4		this.next = null;
5	}
6}

The follow scenario is how we would invoke the method with a linked list 1 -> 2 -> 2 -> 5 -> 6. As you can see, running the method results in removing all 2s in the list.

Description
JAVASCRIPT
1// head = 1 -> 2 -> 2 -> 5 -> 6
2// val = 2
3removeNodes(head, val);
4// 1 -> 5 -> 6

Constraints

  • The value of the nodes as well as the value to be deleted are within integer limits (between -1000000000 and 1000000000 )
  • After deleting the nodes, you need to return the head of the new linked list
  • The given linked list can be null
  • In case all nodes are deleted, return null
  • Expected time complexity : O(n)
  • Expected Space complexity : O(1)

Try to solve this here or in Interactive Mode.

How do I practice this challenge?

JAVASCRIPT
OUTPUT
:001 > Cmd/Ctrl-Enter to run, Cmd/Ctrl-/ to comment

We'll now take you through what you need to know.

How do I use this guide?