More Problems

• Write a function to rotate a circular doubly linked list such that every third node becomes the new head without recursion.
• How do you rearrange nodes in a multilevel singly linked list such that nodes with prime values come before composite values?
• Implement a function to reverse every alternate k-th node in a circular singly linked list without recursion.
• Write a function to split a sorted singly linked list into two lists where one contains prime values and the other contains composite values.
• How do you flatten a multilevel circular singly linked list where each node has both next and child pointers?
• Implement a function to merge two sorted circular doubly linked lists where each list may contain random pointers.
• Write a function to reverse every second node in a circular doubly linked list without recursion while preserving the list structure.
• How do you split a circular singly linked list into two lists where one list contains odd-positioned nodes and the other contains even-positioned nodes?