More Problems

• Write a function to merge two sorted circular singly linked lists where one contains nodes with prime values and the other contains composite values.
• How do you detect and remove loops in a multilevel circular doubly linked list where nodes contain both forward and backward pointers?
• Implement a function to reverse the first n nodes in a multilevel circular singly linked list, while maintaining the relative order of the remaining nodes.
• Write a function to rearrange nodes in a circular doubly linked list such that all prime-numbered nodes come before composite-numbered nodes.
• How do you split a circular singly linked list into two lists where one contains prime-indexed nodes and the other contains composite-indexed nodes?
• Implement a function to rotate a multilevel circular singly linked list by k positions while maintaining the structure of child pointers.
• 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?