More Problems

• Implement a function to flatten a circular singly linked list where each node may have both child and random pointers.
• Write a function to rotate a circular doubly linked list such that every k-th node becomes the new head while maintaining the list structure.
• How do you rearrange nodes in a multilevel singly linked list such that all prime values appear before composite values?
• Implement a function to reverse every alternate node in a circular doubly linked list without recursion.
• Write a function to split a sorted singly linked list into two lists where one list contains prime values and the other contains non-prime values.
• How do you flatten a multilevel circular singly linked list where each node has both next and child pointers?
• Implement a function to merge two sorted circular singly linked lists where one list contains random pointers to nodes in the other list.
• Write a function to reverse every second node in a circular doubly linked list using recursion without breaking the list structure.