Topic: linked-list-problem / Level: advanced

• 2051. Write a function to rotate a circular doubly linked list by k positions such that every k-th node becomes the new head.
• 2052. How do you merge two linked lists where each node contains a random pointer to another node within the same list?
• 2053. Implement a function to reverse the second half of a circular doubly linked list while leaving the first half unchanged.
• 2054. Write a function to split a singly linked list into k parts, ensuring each part has the same sum of node values.
• 2055. How do you implement an efficient merge operation for two sorted circular singly linked lists with minimal extra space?
• 2056. Implement a function to rotate a multilevel circular singly linked list where each node may have a child pointer.
• 2057. Write a function to flatten a linked list where each node contains both a next pointer and a down pointer to another linked list.
• 2058. How do you merge two sorted linked lists where nodes may have duplicate values and random pointers?
• 2059. Implement a function to perform in-place radix sort on a singly linked list where nodes store string values.
• 2060. Write a function to rotate a doubly linked list such that every k-th node becomes the new head using recursion.
• 2061. How do you detect the first common node in two circular linked lists with cycles at different points?
• 2062. Implement a function to reverse every k-th node in a doubly linked list while preserving the relative order of other nodes.
• 2063. Write a function to merge two sorted circular doubly linked lists where one list is sorted in ascending order and the other in descending order.
• 2064. How do you rotate a circular singly linked list such that the node with the highest value becomes the new head?
• 2065. Implement a function to reverse the first n nodes in a circular doubly linked list without using recursion.
• 2066. Write a function to split a doubly linked list into two lists where each list contains alternating nodes from the original list.
• 2067. How do you flatten a multilevel linked list where each node has pointers to multiple child linked lists?
• 2068. Implement a function to merge two unsorted doubly linked lists into one sorted singly linked list using heapsort.
• 2069. Write a function to rotate a singly linked list left by k positions while maintaining the order of the first m nodes.
• 2070. How do you detect and merge two linked lists where one list contains cycles and the other does not?
• 2071. Implement a function to reverse every alternate k-th node in a circular singly linked list while maintaining the structure of the list.
• 2072. Write a function to flatten a doubly linked list where each node contains a pointer to a binary search tree (BST).
• 2073. How do you merge k sorted linked lists where each list may have duplicate values and random pointers?
• 2074. Implement a function to perform in-place bucket sort on a circular doubly linked list.
• 2075. Write a function to rotate a multilevel doubly linked list by k positions where each node has both children and siblings.
• 2076. How do you detect and remove loops in multiple linked lists where each list may contain multiple loops?
• 2077. Implement a function to reverse every k-th node in a multilevel circular singly linked list.
• 2078. Write a function to split a circular singly linked list into two lists where one list contains prime numbers and the other contains composite numbers.
• 2079. How do you flatten a linked list where each node has a pointer to another linked list and a sibling list?
• 2080. Implement a function to rotate a circular doubly linked list such that every node with a value divisible by k becomes the new head.
• 2081. Write a function to merge two sorted circular singly linked lists where one list is sorted in reverse order.
• 2082. How do you detect and merge two circular linked lists where both lists contain multiple cycles?
• 2083. Implement a function to reverse the last k nodes in a singly linked list while leaving the first n nodes unchanged.
• 2084. Write a function to flatten a circular singly linked list where each node contains a pointer to a stack.
• 2085. How do you split a doubly linked list into two lists where one list contains even-positioned nodes and the other contains odd-positioned nodes?
• 2086. Implement a function to merge two sorted doubly linked lists where each node has a random pointer.
• 2087. Write a function to rotate a circular doubly linked list so that every prime-numbered node becomes the new head.
• 2088. How do you detect and remove all cycles in a doubly linked list where each node contains two forward pointers?
• 2089. Implement a function to reverse every alternate group of nodes in a circular doubly linked list without recursion.
• 2090. Write a function to flatten a multilevel circular singly linked list where nodes may have a child pointer and a sibling pointer.
• 2091. How do you rotate a circular singly linked list so that nodes with even values appear at the front and odd values at the end?
• 2092. Implement a function to merge two unsorted circular singly linked lists into one sorted circular doubly linked list.
• 2093. Write a function to split a circular doubly linked list into k parts where each part has the same sum of node values.
• 2094. How do you reverse every alternate k-th node in a circular singly linked list while maintaining the list structure?
• 2095. Implement a function to detect the first common node in three linked lists that may have cycles.
• 2096. Write a function to merge k unsorted linked lists into one sorted circular singly linked list using merge sort.
• 2097. How do you flatten a doubly linked list where each node contains both a next pointer and a sibling pointer to another list?
• 2098. Implement a function to rotate a circular singly linked list so that every second node becomes the new head.
• 2099. Write a function to detect and merge two linked lists where both lists contain multiple cycles and backward pointers.
• 2100. How do you reverse every k-th node in a multilevel doubly linked list where nodes have child and sibling pointers?

• More Levels

• Beginner
• Intermediate