More Problems

• 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.
• How do you detect and remove loops in multiple linked lists where each list may contain multiple loops?
• Implement a function to reverse every k-th node in a multilevel circular singly linked list.
• Write a function to split a circular singly linked list into two lists where one list contains prime numbers and the other contains composite numbers.
• How do you flatten a linked list where each node has a pointer to another linked list and a sibling list?