More Problems

• Write a function to rotate a singly linked list right by k positions using an iterative approach.
• How do you merge two sorted singly linked lists into one sorted circular doubly linked list using recursion?
• Implement a function to reverse the second half of a circular doubly linked list without recursion.
• Write a function to detect and remove a loop in a circular singly linked list using Floyd’s cycle detection.
• How do you rearrange nodes in a doubly linked list such that nodes with prime values appear before non-prime values?
• Implement a function to rotate a circular singly linked list left by k positions using recursion.
• Write a function to split a circular singly linked list into two lists where one contains even values and the other contains odd values.
• How do you reverse every third node in a doubly linked list without using recursion?