Given the head of a linked list, repeatedly remove consecutive sequences of nodes whose values sum to $0$ until no such sequences remain.

Return the head of the resulting linked list.

Note: If there are multiple possible answers, you may return any of them.

Constraints:

• The number of nodes in the linked list is in the range $[1, 1000]$.

• $-1000 \leq$ node.val $\leq 1000$

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.