More Problems

• How do you rearrange nodes in a circular singly linked list such that all nodes with prime values appear at the front and composite values at the end?
• Implement a function to split a sorted singly linked list into two lists where one contains even numbers and the other contains odd numbers.
• Write a function to reverse every alternate k-th node in a multilevel doubly linked list without breaking the structure of the list.
• How do you detect and remove loops in a circular singly linked list where each node contains multiple forward and backward pointers?
• Implement a function to rotate a circular doubly linked list such that every k-th node becomes the new head, preserving the structure.
• Write a function to flatten a circular singly linked list where each node contains both a next and a sibling pointer.
• 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.