Topic: Linked List Problem / Level: intermediate

Problem: How do you rotate a circular singly linked list so that the last node becomes the head?

Run the code to see the output here...