More Problems

• Write a function to flatten a circular singly linked list where each node contains both a next and a sibling pointer.
• How do you merge k unsorted circular doubly linked lists into one sorted circular singly linked list using quicksort?
• Implement a function to reverse the second half of a circular singly linked list while leaving the first half unchanged.
• Write a function to split a singly linked list into two lists where one contains prime-numbered positions and the other contains composite-numbered positions.
• How do you detect and merge two sorted circular doubly linked lists where one list contains both child and sibling pointers?
• Implement a function to flatten a circular singly linked list where each node may have both next and child pointers.
• Write a function to rotate a circular doubly linked list such that every third node becomes the new head while preserving the structure of the sibling pointers.
• How do you rearrange nodes in a multilevel circular singly linked list such that all prime-numbered nodes appear before composite-numbered nodes?