More Problems

• Write a function to rearrange nodes in a circular doubly linked list such that all prime-numbered nodes come before composite-numbered nodes.
• How do you split a circular singly linked list into two lists where one contains prime-indexed nodes and the other contains composite-indexed nodes?
• Implement a function to rotate a multilevel circular singly linked list by k positions while maintaining the structure of child pointers.
• Write a function to flatten a circular singly linked list where each node contains both a next and a sibling pointer.
• How do you merge k unsorted circular doubly linked lists into one sorted circular singly linked list using quicksort?
• Implement a function to reverse the second half of a circular singly linked list while leaving the first half unchanged.
• Write a function to split a singly linked list into two lists where one contains prime-numbered positions and the other contains composite-numbered positions.
• How do you detect and merge two sorted circular doubly linked lists where one list contains both child and sibling pointers?