More Problems

• Implement a function to flatten a circular doubly linked list where each node may have a child pointer.
• Write a function to rearrange nodes in a circular singly linked list such that nodes with negative values come before non-negative values.
• How do you reverse every second node in a circular singly linked list using recursion?
• Write a function to rotate a circular doubly linked list left by k positions without recursion.
• How do you reverse every third node in a singly linked list using an iterative approach?
• Implement a function to split a sorted singly linked list into two lists based on even and odd indexed nodes.
• Write a function to merge two unsorted doubly linked lists into one sorted circular singly linked list without using extra space.
• How do you detect and remove a loop in a circular singly linked list using recursion?