More Problems

• Implement a function to split a circular singly linked list into two separate lists where one contains nodes with values divisible by 2 and the other contains nodes with values divisible by 3.
• Write a function to reverse nodes between two given positions m and n in a circular doubly linked list using recursion.
• How do you rotate a circular singly linked list left by k positions without recursion?
• Implement a function to detect and remove a loop in a doubly linked list using recursion.
• Write a function to split a sorted singly linked list into two lists where one contains prime numbers and the other contains non-prime numbers.
• How do you reverse every alternate node in a circular singly linked list using an iterative approach?
• Implement a function to flatten a multilevel circular singly linked list where each node has a next pointer and a random pointer.
• Write a function to rearrange nodes in a doubly linked list such that all negative values appear before non-negative values.