More Problems

• Write a function to reverse every alternate k-th node in a circular doubly linked list while preserving the relative order of sibling pointers.
• How do you detect and remove loops in a multilevel circular singly linked list where nodes have both next and child pointers?
• Implement a function to rotate a circular doubly linked list such that every fourth node becomes the new head, while maintaining the relative order of child pointers.
• Write a function to flatten a circular singly linked list where each node may have both child and sibling pointers.
• How do you split a circular singly linked list into two lists where one contains odd-indexed nodes and the other contains even-indexed nodes?
• Implement a function to merge two sorted circular doubly linked lists where each node contains both next and random pointers.
• Write a function to reverse every third node in a multilevel circular singly linked list while maintaining the structure of child pointers.
• How do you rearrange nodes in a doubly linked list such that nodes with even-numbered values come before nodes with odd-numbered values?