More Problems

• Implement a function to split a sorted doubly linked list into two lists where one list contains nodes with values divisible by 3.
• Write a function to reverse every alternate k-th node in a multilevel singly linked list without recursion.
• How do you detect and remove multiple loops in a circular doubly linked list where nodes contain both next and sibling pointers?
• Implement a function to rotate a circular singly linked list such that every k-th node becomes the new head while maintaining the list structure.
• Write a function to flatten a multilevel doubly linked list where each node has both child pointers and random pointers.
• How do you split a circular doubly linked list into two lists where one list contains nodes with even values and the other contains odd values?
• Implement a function to merge two sorted circular singly linked lists where one list is sorted in ascending order and the other in descending order.
• Write a function to reverse every third node in a circular singly linked list using recursion without breaking the list structure.