Given the head of a singly linked list that is sorted in nondecreasing order based on the absolute values of its nodes, sort the linked list in nondecreasing order by the actual values of its nodes and return the sorted list.

Constraints:

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

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

• head is sorted in nondecreasing order using the absolute value of its nodes.

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.