More Problems

• How do you detect the first common node in two linked lists where one list contains a cycle and the other does not?
• Implement a function to reverse the second half of a circular singly linked list without affecting the first half.
• Write a function to rotate a multilevel doubly linked list by k positions where each node has both next and sibling pointers.
• How do you rearrange nodes in a circular singly linked list such that nodes with even-indexed values appear before odd-indexed values?
• Implement a function to reverse the first and last k nodes of a circular doubly linked list while preserving the middle part.
• Write a function to split a circular singly linked list into two lists where one contains nodes with prime-numbered positions.
• How do you flatten a multilevel circular singly linked list where nodes have both next and down pointers?
• Implement a function to merge two sorted doubly linked lists where each node has a random pointer to any other node in the list.