More Problems

• 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?
• Implement a function to merge two sorted doubly linked lists where each node has both forward and backward pointers.
• Write a function to reverse every second node in a circular doubly linked list using recursion without breaking the list structure.
• How do you rearrange nodes in a singly linked list such that nodes with prime values come before composite values?
• Implement a function to flatten a circular singly linked list where each node may have both next and child pointers.
• Write a function to rotate a circular doubly linked list such that nodes with prime values appear before nodes with even values.