More Problems

• Write a function to rearrange nodes in a circular doubly linked list such that all odd-positioned nodes come before even-positioned nodes.
• How do you detect the intersection point of two unsorted singly linked lists using Floyd’s cycle detection?
• Implement a function to rotate a circular singly linked list left by k positions using an iterative approach.
• Write a function to reverse nodes between two positions m and n in a doubly linked list without recursion.
• How do you merge two sorted circular singly linked lists into one sorted circular singly linked list without using extra space?
• Implement a function to detect and remove a loop in a doubly linked list using recursion.
• Write a function to split a singly linked list into two separate lists based on whether the node values are divisible by 3.
• How do you rearrange nodes in a circular singly linked list such that all negative values come before positive values?