More Problems

• Implement a function to rotate a circular doubly linked list so that the last node becomes the head.
• Write a function to rearrange nodes in a circular singly linked list such that nodes with even values appear before odd values.
• How do you reverse every k nodes in a singly linked list without using recursion?
• Implement a function to merge two sorted circular singly linked lists into one sorted doubly linked list.
• Write a function to rotate a doubly linked list left by k positions without using extra memory.
• How do you remove all nodes from a circular singly linked list whose values are greater than the average of the list?
• Implement a function to flatten a multilevel singly linked list where each node may have multiple children.
• Write a function to split a sorted singly linked list into two lists such that the first list contains prime numbers and the second contains non-prime numbers.