Given the head of a linked list and an integer, k, return the head of the linked list after swapping the values of the $k^{th}$ node from the beginning and the $k^{th}$ node from the end of the linked list.

Note: We’ll number the nodes of the linked list starting from $1$ to $n$.

Constraints:

• The linked list will have n number of nodes.
• $1 \leq$ k $\leq$ n $\leq 500$
• $-5000 \leq$ Node.value $\leq 5000$

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.