Given a linked list, you are asked to shift it by k positions in the right direction.
The initial data for the linked list is obtained automatically. You don’t need to do anything. It’s guaranteed that the size of the linked list does not exceed and the values in the linked list don’t exceed in their absolute value. The value of k is always smaller than or equal to the size of the linked list.
The data of the linked list is printed automatically. You don’t need to do anything.