More Problems

• 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 contains prime-numbered nodes and the other contains composite-numbered nodes?
• Implement a function to reverse every alternate node in a multilevel circular singly linked list while preserving the structure of sibling pointers.
• Write a function to merge two sorted circular singly linked lists into one sorted circular doubly linked list using merge sort.
• How do you detect and remove all loops in a multilevel circular singly linked list where nodes contain both child and sibling pointers?
• Implement a function to rotate a circular singly linked list such that every k-th node becomes the new head while maintaining the structure of child pointers.
• Write a function to flatten a multilevel circular singly linked list where each node contains both forward and sibling pointers.
• How do you rearrange nodes in a circular singly linked list such that all prime values appear before composite values while maintaining the structure?