More Problems

• How do you rearrange nodes in a doubly linked list such that nodes with prime-indexed positions come before composite-indexed positions?
• Implement a function to flatten a circular singly linked list where each node may contain both a next and a sibling pointer.
• Write a function to rotate a circular doubly linked list such that the node with the second-largest value becomes the new head.
• How do you split a sorted circular singly linked list into two lists where one contains prime values and the other contains composite values?
• Implement a function to reverse every third node in a multilevel circular singly linked list without recursion.
• 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.