You are given an array of integers nums and the head of a singly linked list.

Remove all nodes from the linked list whose value appears in nums.

Return the head of the modified linked list.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^5$

• All elements in nums are unique.

• The number of nodes in the given list is in the range $[1, 10^5]$.

• $1 \leq$ Node.val $\leq 10^5$

• The input is generated such that there is at least $1$ node in the linked list that has a value not present in nums.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.