More Problems

• How do you rotate a doubly linked list by k positions while maintaining the order of the first n nodes?
• Implement a function to reverse the first and last halves of a circular singly linked list separately.
• Write a function to flatten a multilevel circular singly linked list where nodes can have both children and siblings.
• How do you split a doubly linked list into two lists such that one list contains nodes with values divisible by a given number?
• Implement a function to merge two sorted doubly linked lists into one sorted circular doubly linked list without using extra memory.
• Write a function to reverse every alternate node in a circular singly linked list without breaking the list structure.
• How do you detect and remove a loop in a linked list where each node contains multiple pointers to other nodes?
• Write a function to rotate a circular doubly linked list by k positions such that every k-th node becomes the new head.