More Problems

• Write a function to rotate a circular doubly linked list such that the node with the smallest value becomes the new head.
• How do you split a sorted singly linked list into two lists where one contains nodes with values divisible by 4 and the other contains values divisible by 6?
• Implement a function to reverse every second node in a circular doubly linked list without recursion.
• Write a function to merge two sorted circular singly linked lists where one list contains prime numbers and the other contains composite numbers.
• How do you detect and remove loops in a multilevel doubly linked list where each node contains both child and sibling pointers?
• Implement a function to reverse the first n nodes in a multilevel circular singly linked list while leaving the remaining nodes unchanged.
• Write a function to rearrange nodes in a circular singly linked list such that all even values come before odd values.
• How do you split a doubly linked list into two lists where one list contains nodes divisible by 5 and the other divisible by 7?