Given the head node head of a singly linked list sorted in ascending order, remove every value that appears more than once so that only values that occur exactly once remain in the list. Return the head of the modified linked list.

Note: Nodes with duplicate values are removed entirely, not reduced to a single occurrence.

Constraints:

• The number of nodes in the list is in the range $[0, 300]$.

• $-100 \leq$ Node.val $\leq 100$.

• The linked list is guaranteed to be sorted in ascending order.

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.