More Problems

• Write a function to rotate a circular doubly linked list so that every prime-numbered node becomes the new head.
• How do you detect and remove all cycles in a doubly linked list where each node contains two forward pointers?
• Implement a function to reverse every alternate group of nodes in a circular doubly linked list without recursion.
• Write a function to flatten a multilevel circular singly linked list where nodes may have a child pointer and a sibling pointer.
• How do you rotate a circular singly linked list so that nodes with even values appear at the front and odd values at the end?
• Implement a function to merge two unsorted circular singly linked lists into one sorted circular doubly linked list.
• Write a function to split a circular doubly linked list into k parts where each part has the same sum of node values.
• How do you reverse every alternate k-th node in a circular singly linked list while maintaining the list structure?