You are given the head of a singly linked list. Delete the middle node from the linked list and return the head of the modified linked list.

The middle node of a linked list of size $n$ is the $\lfloor n / 2 \rfloor$th node from the beginning using $0$ based indexing, where $\lfloor x \rfloor$ denotes the largest integer less than or equal to $x$.

Constraints:

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

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

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.