More Problems

• How do you split a sorted doubly linked list into two lists where one contains even-positioned nodes and the other contains odd-positioned nodes?
• Implement a function to merge two unsorted circular doubly linked lists into one sorted circular singly linked list using quicksort.
• Write a function to reverse every second node in a circular singly linked list using recursion without breaking the list structure.
• How do you rearrange nodes in a singly linked list such that nodes with odd values come before nodes with even values?
• Implement a function to flatten a circular singly linked list where each node has both a next pointer and a random pointer.
• Write a function to rotate a doubly linked list such that nodes with prime values appear before nodes with composite values.
• How do you split a circular singly linked list into two lists where one contains nodes with values divisible by 5?
• Implement a function to reverse every k-th node in a circular doubly linked list without recursion.