More Problems

• Write a function to split a sorted singly linked list into two lists, one containing prime values and the other containing composite values.
• How do you flatten a multilevel circular singly linked list where each node has both a next and a sibling pointer?
• Implement a function to merge two sorted circular singly linked lists where one list contains nodes with forward pointers and the other with backward pointers.
• Write a function to reverse every k-th node in a circular singly linked list without recursion, while maintaining the structure of the list.
• How do you split a circular singly linked list into two lists, one containing odd-numbered positions and the other containing even-numbered positions?
• Implement a function to rotate a circular doubly linked list such that every k-th node becomes the new head while preserving the relative order of the other nodes.
• Write a function to flatten a multilevel circular doubly linked list where each node contains both a forward and a sibling pointer.
• How do you detect the first common node in three circular singly linked lists where each list contains random pointers?