More Problems

• Implement a function to reverse the first half of a circular singly linked list without affecting the second half.
• Write a function to rotate a multilevel circular doubly linked list where each node may have both child and sibling pointers.
• How do you rearrange nodes in a circular singly linked list such that nodes with negative values come before positive values?
• Implement a function to reverse the last n nodes in a doubly linked list without recursion.
• 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.