More Problems

• Write a function to split a singly linked list into two lists where one list contains nodes with prime-numbered positions.
• How do you rearrange nodes in a circular doubly linked list such that nodes with even values appear before nodes with odd values?
• Implement a function to reverse the first half of a circular singly linked list while leaving the second half unchanged.
• Write a function to rotate a doubly linked list such that every third node becomes the new head without using extra memory.
• How do you flatten a multilevel circular doubly linked list where nodes have both child pointers and sibling pointers?
• Implement a function to detect and remove loops in multiple linked lists where each list may contain multiple backward pointers.
• Write a function to rearrange nodes in a circular singly linked list such that nodes with even-numbered positions come before odd-numbered positions.
• How do you split a sorted singly linked list into k lists where each list contains alternating prime and composite values?