Given a linked list, you are asked to shift it by k positions in the right direction.
Input
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.
Output
The data of the linked list is printed automatically. You donβt need to do anything.