Given the head of a sorted linked list, remove all duplicates such that each element appears only once, and return the list in sorted order.

Constraints:

• $0 \leq$ n $\leq 300$, where n is the number of nodes in the list.

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

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

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.