Topic: Linked List Problem / Level: intermediate

Problem: How do you rotate a circular singly linked list so that every k-th node becomes the new head?

Run the code to see the output here...