Given the head of a linked list and an integer, k, return the head of the linked list after swapping the values of the kth node from the beginning and the kth 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≤
k ≤ n ≤500
- −5000≤
Node.value ≤5000