Topic: Linked List Problem / Level: intermediate

Problem: Write a function to reverse every third node in a circular singly linked list without recursion.

Run the code to see the output here...