More Problems

• Write a function to merge two sorted circular singly linked lists where one list contains both forward and backward pointers.
• How do you detect and remove all loops in a multilevel circular doubly linked list where nodes contain random pointers?
• Implement a function to rotate a circular singly linked list by k positions while maintaining the relative order of the last n nodes.
• Write a function to flatten a multilevel circular singly linked list where each node contains both a next pointer and a random pointer.
• How do you rearrange nodes in a multilevel circular doubly linked list such that nodes with prime values come before composite values?
• Write a function to rotate a multilevel circular doubly linked list by k positions without recursion, while preserving the order of sibling pointers.
• How do you merge two unsorted doubly linked lists into one sorted circular singly linked list using bucket sort?
• Implement a function to reverse every third node in a circular singly linked list, using recursion and maintaining the structure of the list.