More Problems

• Write a function to merge two sorted doubly linked lists where nodes have both next and sibling pointers to other nodes in the list.
• How do you detect and merge two sorted circular singly linked lists where one list contains backward pointers and the other contains forward pointers?
• Implement a function to rotate a doubly linked list such that every third node becomes the new head while maintaining the list structure.
• Write a function to reverse every alternate k-th node in a circular singly linked list without recursion while keeping the relative order of other nodes.
• How do you rearrange nodes in a circular singly linked list such that the list alternates between even and odd values?
• Implement a function to detect the first common node in three linked lists where each list may contain random pointers.
• Write a function to split a doubly linked list into two lists where one list contains nodes with prime values and the other contains non-prime values.
• How do you flatten a circular singly linked list where each node contains a pointer to another list and a sibling list?