Wrong anwer verdict appendList

#1

what if k > n , then in which fashion we have to print the list?

#2

Lets say the input linked list is -
1 2 3 4 and k=5
The correct output is - 4 1 2 3
Do one simple thing -
Make a function which pushes the last node to the front of the linked list. And simply call it k times. Finally print the linked list.