More Problems

• Write a function to merge two sorted circular singly linked lists where one list contains prime values and the other contains composite values.
• How do you detect and remove all loops in a circular doubly 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 remaining nodes unchanged.
• Write a function to rearrange nodes in a doubly linked list such that nodes with even values come before nodes with odd values.
• How do you split a doubly linked list into two lists where one contains prime-indexed nodes and the other contains composite-indexed nodes?
• Implement a function to rotate a circular singly linked list by k positions while preserving the relative order of the first m nodes.
• Write a function to flatten a multilevel doubly linked list where each node may contain both forward and backward pointers.
• How do you merge k unsorted circular singly linked lists into one sorted circular doubly linked list using merge sort?