More Problems

• How do you detect and remove all loops in a circular singly linked list where each node has random and sibling pointers?
• Implement a function to rotate a circular singly linked list such that every third node becomes the new head.
• Write a function to flatten a circular singly linked list where each node has a next pointer and a pointer to a linked list as its child.
• How do you split a doubly linked list into two lists where each list contains alternating prime and composite numbers?
• Implement a function to merge two unsorted circular doubly linked lists into one sorted circular singly linked list using merge sort.
• Write a function to reverse every k-th node in a circular singly linked list using recursion while keeping the relative order of other nodes intact.
• How do you rearrange nodes in a circular doubly linked list so that all nodes with prime values appear before nodes with composite values?
• Implement a function to flatten a multilevel circular singly linked list where each node may have a next pointer, a child pointer, and a random pointer.