More Problems

• How do you detect and merge two sorted circular singly linked lists where one list contains both forward and backward pointers?
• Implement a function to flatten a circular singly linked list where each node contains a pointer to both a sibling and a child linked list.
• Write a function to rotate a circular singly linked list such that every third node becomes the new head, while preserving the list structure.
• How do you rearrange nodes in a multilevel doubly linked list such that all nodes with prime values appear before nodes with composite values?
• Implement a function to reverse every alternate node in a circular singly linked list without recursion, while preserving the relative order of other nodes.
• Write a function to split a sorted singly linked list into two lists where one contains prime-numbered nodes and the other contains composite-numbered nodes.
• How do you flatten a multilevel circular singly linked list where each node has both forward and random pointers?
• Implement a function to merge two sorted circular singly linked lists where each node contains both next and random pointers.