More Problems

• Implement a function to detect the first node of a loop in a circular doubly linked list using Floyd’s cycle detection.
• Write a function to rearrange nodes in a singly linked list such that all negative values appear before non-negative values.
• How do you merge two unsorted singly linked lists into one sorted doubly linked list without using extra memory?
• Implement a function to reverse every second node in a circular singly linked list using an iterative approach.
• Write a function to rotate a circular singly linked list left by k positions using recursion.
• How do you detect the intersection point of two sorted doubly linked lists without using extra memory?
• Implement a function to split a doubly linked list into two separate lists based on prime values and non-prime values.
• Write a function to reverse every third node in a singly linked list using recursion.