More Problems

• Write a function to flatten a multilevel circular singly linked list where each node contains both child and sibling pointers.
• How do you rearrange nodes in a circular singly linked list such that nodes with prime-indexed positions come before composite-indexed positions?
• Implement a function to split a sorted doubly linked list into two lists where one list contains nodes with values divisible by 2 and the other contains nodes divisible by 3.
• Write a function to reverse every alternate node in a circular singly linked list without recursion.
• How do you detect and remove loops in a multilevel doubly linked list where each node contains both child and sibling pointers?
• Implement a function to rotate a circular singly linked list such that every third node becomes the new head without using extra memory.
• Write a function to flatten a multilevel circular doubly linked list where nodes have both next and down pointers.
• How do you split a circular singly linked list into two lists where one list contains prime values and the other contains composite values?