More Problems

• Write a function to flatten a multilevel circular doubly linked list where nodes have both next and random pointers.
• How do you split a circular singly linked list into two lists where one contains even-positioned nodes and the other contains odd-positioned nodes?
• Implement a function to merge two sorted circular singly linked lists where each list may contain duplicate values.
• Write a function to reverse every third node in a circular doubly linked list without recursion while maintaining the list structure.
• How do you rearrange nodes in a doubly linked list such that nodes with prime values appear before nodes with composite values?
• Implement a function to flatten a multilevel singly linked list where each node has pointers to multiple child linked lists.
• Write a function to rotate a doubly linked list by k positions without recursion, while keeping the relative order of the first half of the list.
• How do you split a singly linked list into two lists where one list contains alternating prime and composite values?