More Problems

• Implement a function to reverse every alternate node in a circular singly linked list without recursion, while preserving the relative order of other nodes.
• Write a function to split a sorted singly linked list into two lists, one containing nodes with prime values and the other containing composite values.
• How do you flatten a multilevel circular singly linked list where each node has both next and random pointers?
• 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 k-th node in a circular singly linked list without recursion, while maintaining the structure of the list.
• How do you split a circular singly linked list into two lists where one contains prime-numbered nodes and the other contains composite-numbered nodes?
• Implement a function to rotate a circular doubly linked list such that every second node becomes the new head, while preserving the list structure.
• Write a function to flatten a multilevel circular doubly linked list where each node may have both next and child pointers.