More Problems

• Write a function to rotate a circular doubly linked list such that nodes with prime values appear before nodes with even values.
• How do you split a sorted singly linked list into two lists where one list contains nodes with prime-numbered positions and the other contains composite-numbered positions?
• Implement a function to reverse every k-th node in a circular singly linked list without recursion while preserving the structure of the list.
• Write a function to merge two sorted circular doubly linked lists where one list contains prime values and the other contains composite values.
• How do you detect and remove all loops in a multilevel circular singly linked list where nodes may have random pointers?
• Implement a function to reverse the first n nodes in a circular doubly linked list while leaving the rest of the list unchanged.
• Write a function to rearrange nodes in a circular doubly linked list such that all even-positioned nodes come before odd-positioned nodes.
• How do you split a doubly linked list into two lists where one list contains nodes with prime-numbered positions and the other contains composite-numbered positions?