Solution: Swapping Nodes in a Linked List

Statement

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$

Pattern: In-place Manipulation of a Linked List

We need to find the $k^{th}$ node from the start of the linked list and the $k^{th}$ ...