More Problems

• Write a function to merge two sorted circular singly linked lists into one sorted doubly linked list without using extra memory.
• How do you detect and remove all loops in a circular singly linked list where each node has both forward and backward pointers?
• Implement a function to reverse the first n nodes in a multilevel circular singly linked list while leaving the rest of the list unchanged.
• Write a function to rearrange nodes in a circular singly linked list such that all prime-numbered nodes come before composite-numbered nodes.
• How do you split a doubly linked list into two lists where one list contains nodes divisible by 4 and the other divisible by 5?
• Implement a function to rotate a multilevel circular singly linked list such that every k-th node becomes the new head while preserving the list structure.
• Write a function to flatten a multilevel circular doubly linked list where each node may have both forward and backward pointers.
• How do you merge k unsorted circular singly linked lists into one sorted circular doubly linked list using heapsort?