More Problems

• How do you split a circular singly linked list into k lists where each list contains exactly one prime number?
• Implement a function to flatten a multilevel doubly linked list with both forward and backward pointers.
• Write a function to rearrange nodes in a circular singly linked list such that nodes with prime values come before non-prime values.
• 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.