More Problems

• How do you reverse the second half of a singly linked list without recursion?
• Write a function to rotate a circular doubly linked list to the left by k positions without using extra space.
• How do you reverse every third node in a circular singly linked list using recursion?
• Implement a function to merge two sorted circular singly linked lists into one sorted circular doubly linked list.
• Write a function to remove all nodes from a doubly linked list whose values are greater than the sum of their neighbors.
• How do you split a singly linked list into two linked lists, where one contains nodes with prime values and the other non-prime?
• Implement a function to reverse every k nodes in a doubly linked list using an iterative approach.
• Write a function to rotate a singly linked list to the right by k positions using an iterative approach.