More Problems

• Implement a function to merge two sorted doubly linked lists into one sorted circular doubly linked list without using extra memory.
• Write a function to reverse every alternate node in a circular singly linked list without breaking the list structure.
• How do you detect and remove a loop in a linked list where each node contains multiple pointers to other nodes?
• 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?