More Problems

• Write a function to split a circular singly linked list into two lists based on whether the node values are even or odd.
• How do you reverse every third node in a doubly linked list using an iterative approach?
• Implement a function to detect and remove a loop in a circular singly linked list using recursion.
• Write a function to merge two sorted circular singly linked lists into one sorted singly linked list without recursion.
• How do you rotate a doubly linked list to the left by k positions without recursion?
• Implement a function to reverse every second node in a circular singly linked list using recursion.
• Write a function to reverse the first n nodes in a circular singly linked list without recursion.
• How do you split a singly linked list into two lists where one contains nodes with values divisible by 3 and the other contains nodes with values not divisible by 3?