More Problems

• Write a function to split a sorted doubly linked list into two lists where one contains prime values and the other contains non-prime values.
• How do you flatten a multilevel circular singly linked list where nodes contain both forward and backward pointers?
• Implement a function to merge two sorted circular singly linked lists into one sorted doubly linked list without using recursion.
• Write a function to reverse every alternate k-th node in a multilevel circular doubly linked list without recursion.
• How do you split a circular singly linked list into two lists where one contains nodes with prime-numbered positions and the other contains composite-numbered positions?
• Implement a function to rotate a multilevel circular singly linked list such that nodes with prime values appear before nodes with composite values.
• Write a function to flatten a multilevel circular singly linked list where each node contains both next and child pointers.
• How do you detect the first common node in two linked lists where one list contains random pointers and the other list contains child pointers?