More Problems

• Write a function to split a circular singly linked list into two lists where one list contains prime-numbered nodes and the other contains composite-numbered nodes.
• How do you flatten a multilevel doubly linked list where each node may have pointers to both children and sibling nodes?
• Implement a function to detect and remove loops in multiple circular linked lists where each list contains random pointers to other lists.
• Write a function to rearrange nodes in a multilevel circular singly linked list such that nodes with prime values come before nodes with composite values.
• How do you merge k sorted linked lists where each list may contain both next pointers and child pointers to other linked lists?
• Implement a function to reverse the second half of a circular singly linked list while preserving the structure of the first half.
• Write a function to split a doubly linked list into two separate lists based on whether the node values are divisible by a given number.
• How do you rotate a circular singly linked list such that nodes with the lowest values come before nodes with the highest values?