More Problems

• Implement a function to merge two unsorted doubly linked lists into one sorted singly linked list using heapsort.
• Write a function to rotate a singly linked list left by k positions while maintaining the order of the first m nodes.
• How do you detect and merge two linked lists where one list contains cycles and the other does not?
• Implement a function to reverse every alternate k-th node in a circular singly linked list while maintaining the structure of the list.
• Write a function to flatten a doubly linked list where each node contains a pointer to a binary search tree (BST).
• How do you merge k sorted linked lists where each list may have duplicate values and random pointers?
• Implement a function to perform in-place bucket sort on a circular doubly linked list.
• Write a function to rotate a multilevel doubly linked list by k positions where each node has both children and siblings.