More Problems

• Write a function to rearrange nodes in a multilevel circular singly linked list such that nodes with prime values come before nodes with composite values.
• How do you merge k sorted linked lists where each list may contain both next pointers and child pointers to other linked lists?
• Implement a function to reverse the second half of a circular singly linked list while preserving the structure of the first half.
• Write a function to split a doubly linked list into two separate lists based on whether the node values are divisible by a given number.
• How do you rotate a circular singly linked list such that nodes with the lowest values come before nodes with the highest values?
• Implement a function to flatten a multilevel circular doubly linked list where each node may contain multiple child pointers.
• Write a function to reverse every k-th node in a doubly linked list while maintaining the structure of the list.
• How do you split a sorted circular singly linked list into k lists where each list contains alternating prime and composite values?