More Problems

• Implement a function to merge two unsorted doubly linked lists into one sorted circular singly linked list without using extra memory.
• Write a function to rearrange nodes in a circular doubly linked list such that nodes with prime-numbered positions come before non-prime positions.
• How do you flatten a multilevel singly linked list where each node contains a pointer to a binary tree?
• Implement a function to reverse every k-th node in a circular doubly linked list while maintaining the relative order of the remaining nodes.
• Write a function to rotate a singly linked list so that the node with the second-largest value becomes the new head.
• How do you merge k sorted circular singly linked lists into one sorted circular doubly linked list without recursion?
• Implement a function to detect the first common node in three linked lists where the lists may contain cycles.
• Write a function to split a doubly linked list into two lists where one list contains all nodes with even-positioned values.