More Problems

• Write a function to rotate a circular doubly linked list by k positions such that every k-th node becomes the new head.
• How do you merge two linked lists where each node contains a random pointer to another node within the same list?
• Implement a function to reverse the second half of a circular doubly linked list while leaving the first half unchanged.
• Write a function to split a singly linked list into k parts, ensuring each part has the same sum of node values.
• How do you implement an efficient merge operation for two sorted circular singly linked lists with minimal extra space?
• Implement a function to rotate a multilevel circular singly linked list where each node may have a child pointer.
• Write a function to flatten a linked list where each node contains both a next pointer and a down pointer to another linked list.
• How do you merge two sorted linked lists where nodes may have duplicate values and random pointers?