More Problems

• Implement a function to rotate a circular doubly linked list such that every third node becomes the new head.
• Write a function to split a singly linked list into k groups where each group contains at least one prime number.
• How do you merge k sorted doubly linked lists into one sorted circular doubly linked list?
• Implement a function to convert a doubly linked list into a balanced binary search tree (BST) in-place.
• Write a function to rotate a multilevel circular doubly linked list by k positions where each node has multiple children.
• How do you implement a sparse linked list that supports fast insertions and deletions at arbitrary positions?
• Implement a function to reverse the second half of a circular doubly linked list while preserving the first half.
• Write a function to rearrange nodes in a circular singly linked list such that the list alternates between even and odd values.