More Problems

• Write a function to split a circular singly linked list into two lists based on whether the node values are prime or non-prime.
• How do you rotate a singly linked list left by k positions using an iterative approach?
• Implement a function to reverse nodes between two given positions m and n in a circular singly linked list using recursion.
• Write a function to rearrange nodes in a circular singly linked list such that all positive values come before negative values.
• How do you detect and remove a loop in a doubly linked list using Floyd’s cycle detection algorithm?
• Implement a function to merge two sorted circular doubly linked lists into one sorted circular singly linked list.
• Write a function to reverse every third node in a singly linked list without recursion.
• How do you split a sorted doubly linked list into two lists based on even and odd indexed nodes?