More Problems

• Write a function to split a singly linked list into two lists where one contains nodes with even-indexed values and the other contains odd-indexed values.
• How do you flatten a multilevel doubly linked list where each node contains both forward and backward pointers?
• Implement a function to rotate a circular singly linked list by k positions where nodes with prime values come first.
• Write a function to detect and merge two sorted singly linked lists where one list contains cycles and the other does not.
• How do you reverse every k-th node in a circular doubly linked list using recursion without extra memory?
• Implement a function to split a circular singly linked list into two lists where one contains nodes with prime values.
• Write a function to flatten a doubly linked list where each node contains both a next and a down pointer to another linked list.
• How do you rearrange nodes in a multilevel singly linked list such that nodes with odd values come before nodes with even values?