More Problems

• Implement a function to rotate a circular singly linked list right by k positions without using extra space.
• Write a function to reverse the first half of a doubly linked list using an iterative approach.
• How do you detect and remove a loop in a circular singly linked list using recursion?
• Implement a function to merge two sorted doubly linked lists into one sorted circular doubly linked list.
• 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?
• Write a function to split a circular singly linked list into two lists where one contains nodes with even values and the other contains odd values.
• How do you rotate a doubly linked list to the right by k positions using recursion?