More Problems

• Implement a function to rotate a circular doubly linked list such that every node with a value divisible by k becomes the new head.
• Write a function to merge two sorted circular singly linked lists where one list is sorted in reverse order.
• How do you detect and merge two circular linked lists where both lists contain multiple cycles?
• Implement a function to reverse the last k nodes in a singly linked list while leaving the first n nodes unchanged.
• Write a function to flatten a circular singly linked list where each node contains a pointer to a stack.
• How do you split a doubly linked list into two lists where one list contains even-positioned nodes and the other contains odd-positioned nodes?
• Implement a function to merge two sorted doubly linked lists where each node has a random pointer.
• Write a function to rotate a circular doubly linked list so that every prime-numbered node becomes the new head.