More Problems

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