More Problems

• Implement a function to rotate a multilevel circular singly linked list such that nodes with prime values appear at the front.
• Write a function to flatten a multilevel doubly linked list where each node may contain both forward and child pointers.
• How do you merge k unsorted doubly linked lists into one sorted circular singly linked list using merge sort?
• Implement a function to reverse the second half of a circular doubly linked list while leaving the first half unchanged.
• Write a function to split a singly linked list into two lists where one list contains nodes with even-positioned values and the other contains odd-positioned values.
• How do you detect and merge two sorted doubly linked lists where one list contains cycles and the other does not?
• Implement a function to flatten a circular singly linked list where each node may have both child and sibling pointers.
• Write a function to rotate a circular doubly linked list such that every third node becomes the new head without recursion.