More Problems

• 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 such that every second node becomes the new head, while preserving the structure of sibling pointers.
• Write a function to flatten a multilevel circular doubly linked list where each node contains both forward and sibling pointers.
• How do you merge k unsorted circular doubly linked lists into one sorted circular singly linked list using merge sort?
• Implement a function to reverse the second half of a circular singly linked list while maintaining the relative order of the first half.
• Write a function to split a singly linked list into two lists where one contains nodes with prime-numbered positions and the other contains composite-numbered positions.
• How do you detect and merge two sorted circular singly linked lists where one list contains both forward and random pointers?
• Implement a function to flatten a circular singly linked list where each node contains both forward and child pointers.