More Problems

• Write a function to reverse every third node in a circular singly linked list using recursion without breaking the list structure.
• How do you rearrange nodes in a doubly linked list such that nodes with prime-indexed positions come before composite-indexed positions?
• Implement a function to flatten a multilevel circular singly linked list where each node may have multiple sibling and child pointers.
• Write a function to rotate a circular singly linked list such that every node with an odd value comes before every node with an even value.
• How do you split a doubly linked list into two lists, one containing nodes divisible by 5 and the other containing nodes divisible by 7?
• Implement a function to reverse every second node in a circular doubly linked list while preserving the structure of the remaining nodes.
• Write a function to merge two sorted circular singly linked lists where each node contains both forward and random pointers.
• How do you detect and remove all loops in a circular doubly linked list where each node has multiple forward and backward pointers?