only one test case got passed
not able to find bugs
plz help
K append problem
@Bhavya_Goel for k=n print linklist as it is and for k>n do k=k%n;
i know it was not mentioned in the question but it is in the testcases.
dont forget to hit like and mark resolved if cleared 
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.
You are suppose to append last k elements to the front.While in your code you are making kth node as head instead of end - kth node.It might be possible that kth node not equal to kth node from end.Like for length =6 and k=2:
You are going to 2nd node from start while you are supposed to go from kth node from end(ie.4th node from start).Here is my solution ,please check it as well.I don’t think you are handling all edge cases as well(I might be wrong :))