More Problems

• Write a function to reverse every k-th node in a circular singly linked list without recursion, while maintaining the structure of the list.
• How do you split a circular singly linked list into two lists where one contains prime-numbered nodes and the other contains composite-numbered nodes?
• Implement a function to rotate a circular doubly linked list such that every second node becomes the new head, while preserving the list structure.
• Write a function to flatten a multilevel circular doubly linked list where each node may have both next and child pointers.
• How do you detect the first common node in three linked lists where each list contains multiple forward and backward pointers?
• Implement a function to reverse the first half of a circular singly linked list while preserving the structure of the second half.
• Write a function to rearrange nodes in a circular singly linked list such that nodes with even-indexed positions come before odd-indexed positions.
• How do you split a circular doubly linked list into two lists where one list contains nodes with prime values and the other contains composite values?