More Problems

• How do you detect and merge two linked lists where each node has multiple pointers and the lists may contain cycles?
• Implement a function to rotate a circular doubly linked list such that every k-th node becomes the new head using recursion.
• Write a function to flatten a multilevel linked list where each node contains pointers to multiple child lists and sibling lists.
• How do you merge k unsorted linked lists into one sorted circular singly linked list using heapsort?
• Implement a function to reverse every k-th node in a circular singly linked list without recursion while maintaining the list structure.
• 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.