More Problems

• Implement a function to rotate a circular singly linked list such that every k-th node becomes the new head while preserving the relative order of the remaining nodes.
• Write a function to flatten a multilevel circular singly linked list where each node may have both child and random pointers.
• How do you rearrange nodes in a multilevel circular singly linked list such that all prime values come before composite values?
• 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 sorted circular singly linked lists where each list contains nodes with both next and random pointers?
• Implement a function to reverse every k-th node in a multilevel circular singly linked list where each node has both a next and a child pointer.
• Write a function to flatten a multilevel circular singly linked list where each node contains both child and sibling pointers.
• How do you rearrange nodes in a circular singly linked list such that nodes with prime-indexed positions come before composite-indexed positions?