Topic: Linked List Problem / Level: intermediate

Problem: Implement a function to rotate a circular singly linked list so that the last node becomes the head.

Run the code to see the output here...