More Problems

• How do you split a doubly linked list into two lists where one list contains nodes with prime values and the other contains composite values?
• Implement a function to merge two sorted circular singly linked lists where nodes contain both next and random pointers.
• Write a function to reverse every k-th node in a multilevel circular singly linked list while maintaining the relative order of other nodes.
• How do you rearrange nodes in a doubly linked list such that nodes with even-positioned values come before odd-positioned values?
• Implement a function to flatten a circular singly linked list where each node contains a next pointer and a pointer to a linked list as its child.
• Write a function to rotate a circular doubly linked list such that the node with the smallest value becomes the new head.
• How do you split a sorted singly linked list into two lists where one contains nodes with values divisible by 4 and the other contains values divisible by 6?
• Implement a function to reverse every second node in a circular doubly linked list without recursion.