More Problems

• Implement a function to flatten a multilevel singly linked list where each node has pointers to multiple child linked lists.
• Write a function to rotate a doubly linked list by k positions without recursion, while keeping the relative order of the first half of the list.
• How do you split a singly linked list into two lists where one list contains alternating prime and composite values?
• Implement a function to reverse every k-th node in a circular singly linked list while preserving the relative order of the other nodes.
• Write a function to merge two unsorted circular singly linked lists into one sorted doubly linked list using heapsort.
• How do you detect the first common node in two circular linked lists where each list may contain multiple loops?
• Implement a function to reverse the second half of a doubly linked list while leaving the first half unchanged.
• Write a function to rotate a circular singly linked list such that the node with the highest value becomes the new head.