More Problems

• Implement a function to merge two sorted doubly linked lists where each node contains both next and child pointers.
• Write a function to reverse every k-th node in a circular singly linked list while maintaining the relative order of other nodes.
• How do you rearrange nodes in a doubly linked list such that nodes with prime values come before nodes with composite values?
• Implement a function to flatten a multilevel circular singly linked list where each node contains both child and sibling pointers.
• Write a function to rotate a circular singly linked list such that the node with the smallest value becomes the new head.
• How do you split a sorted circular singly linked list into two lists where one list contains nodes divisible by 3 and the other by 5?
• Implement a function to reverse every second node in a multilevel circular singly linked list without recursion.
• Write a function to merge two sorted circular singly linked lists where one list contains prime values and the other contains composite values.