More Problems

• Implement a function to merge two sorted circular doubly linked lists, alternating nodes from each list.
• Write a function to reverse every alternate node in a circular singly linked list using an iterative approach.
• How do you split a singly linked list into k parts with each part containing approximately equal nodes?
• Implement a function to remove all nodes with prime values from a singly linked list without using extra memory.
• Write a function to merge two unsorted doubly linked lists into one sorted circular singly linked list.
• How do you reverse the first half of a circular doubly linked list without using recursion?
• Write a function to reverse nodes between two given positions m and n in a doubly linked list without using recursion.
• How do you rotate a circular singly linked list left by k positions without using extra memory?