More Problems

• Write a function to merge two sorted circular singly linked lists into one sorted doubly linked list using bucket sort.
• How do you detect and remove loops in a multilevel circular singly linked list where each node contains both forward and child pointers?
• Implement a function to rotate a circular singly linked list such that every k-th node becomes the new head while preserving the structure of sibling pointers.
• Write a function to flatten a multilevel circular singly linked list where each node contains both next and sibling pointers.
• How do you rearrange nodes in a circular doubly linked list such that all nodes with prime-numbered values come before composite-numbered values?
• Write a function to rotate a multilevel circular singly linked list such that every k-th node becomes the new head, preserving the structure of both child and sibling pointers.
• How do you merge two unsorted circular doubly linked lists into one sorted circular singly linked list using heapsort?
• Implement a function to reverse every second node in a circular singly linked list without recursion, while preserving the structure of the list.