More Problems

• How do you merge two sorted circular singly linked lists where each node has both a next and random pointer?
• Implement a function to reverse every k-th node in a multilevel circular singly linked list where each node has a down pointer.
• Write a function to flatten a doubly linked list where each node contains both next and sibling pointers to another list.
• How do you rearrange nodes in a circular singly linked list such that the list alternates between prime and composite values?
• Implement a function to split a sorted doubly linked list into k parts where each part contains nodes with the same remainder when divided by k.
• Write a function to reverse every alternate node in a multilevel doubly linked list without breaking the structure.
• 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.