More Problems

• How do you implement a self-balancing skip list with multiple levels of linked lists?
• Implement a function to reverse every k-th node in a circular doubly linked list without using recursion.
• Write a function to merge two unsorted linked lists into one sorted circular doubly linked list using quicksort.
• How do you detect the first common node in two linked lists that may have arbitrary cycles?
• Implement a function to convert a binary search tree (BST) into a sorted circular doubly linked list in-place.
• Write a function to delete every alternate node from a circular doubly linked list where nodes have random pointers.
• How do you rotate a doubly linked list by k positions while maintaining the order of the first n nodes?
• Implement a function to reverse the first and last halves of a circular singly linked list separately.