More Problems

• Write a function to rotate a circular singly linked list such that nodes with values divisible by k come before nodes with non-divisible values.
• How do you flatten a multilevel singly linked list where nodes may have pointers to multiple child lists and sibling lists?
• Implement a function to split a doubly linked list into two lists where one list contains nodes with prime values and the other contains composite values.
• Write a function to rearrange nodes in a circular doubly linked list such that nodes with odd-positioned values come before even-positioned values.
• How do you reverse the second half of a circular singly linked list while leaving the first half unchanged?
• Write a function to rotate a circular doubly linked list such that the node with the largest value becomes the new head.
• How do you merge k unsorted linked lists into one sorted circular doubly linked list using recursion?
• Implement a function to reverse every k-th node in a doubly linked list while preserving the structure of the list.