More Problems

• Implement a function to merge two sorted circular doubly linked lists where each list may contain random pointers.
• Write a function to reverse every k-th node in a circular singly linked list using recursion 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 split a circular doubly linked list into two lists where one list contains nodes with values divisible by 3.
• Write a function to flatten a circular singly linked list where each node may have both next and child pointers.
• How do you rotate a doubly linked list such that every third node becomes the new head using recursion?
• Implement a function to reverse every alternate node in a circular singly linked list without recursion.
• Write a function to split a sorted singly linked list into two lists where one contains prime-indexed nodes and the other contains composite-indexed nodes.