More Problems

• Implement a function to flatten a circular singly linked list where each node has a child pointer.
• Write a function to rearrange nodes in a circular singly linked list such that all nodes with prime values come before nodes with non-prime values.
• How do you reverse every third node in a circular singly linked list using recursion?
• Implement a function to rotate a circular doubly linked list to the right by k positions using an iterative approach.
• Write a function to reverse nodes between two positions m and n in a singly linked list without recursion.
• How do you merge two sorted doubly linked lists into one sorted circular singly linked list using recursion?
• Write a function to reverse the second half of a doubly linked list using an iterative approach.
• How do you split a sorted singly linked list into two lists based on whether the node values are prime or non-prime?