More Problems

• Write a function to rotate a circular singly linked list by k positions using recursion.
• How do you split a singly linked list into two linked lists based on even and odd positions?
• Implement a function to merge two unsorted circular singly linked lists into one sorted circular doubly linked list.
• Write a function to reverse every second node in a circular doubly linked list using an iterative approach.
• How do you rotate a doubly linked list right by k positions using an iterative approach?
• Implement a function to delete every k-th node in a circular singly linked list without losing its structure.
• Write a function to rearrange nodes in a doubly linked list such that nodes with odd values appear before even values.
• How do you merge two sorted circular singly linked lists where each node has a random pointer to another node?