Topic: linked-list-problem / Level: advanced

• 2101. Write a function to rotate a circular singly linked list such that the node with the lowest value becomes the new head.
• 2102. How do you merge two sorted doubly linked lists where each node contains a random pointer to any other node in the list?
• 2103. Implement a function to reverse the first and last k nodes in a circular doubly linked list while leaving the middle unchanged.
• 2104. Write a function to flatten a multilevel circular doubly linked list where each node has multiple child pointers.
• 2105. How do you split a doubly linked list into k sublists where each sublist has nodes with prime values?
• 2106. Implement a function to detect and remove a loop in a doubly linked list where each node has a forward and a backward pointer.
• 2107. Write a function to rotate a circular singly linked list so that nodes with odd values come before nodes with even values.
• 2108. How do you reverse every alternate group of nodes in a multilevel doubly linked list where each node has both forward and backward pointers?
• 2109. Implement a function to merge two unsorted doubly linked lists into one sorted circular singly linked list without using extra memory.
• 2110. Write a function to rearrange nodes in a circular doubly linked list such that nodes with prime-numbered positions come before non-prime positions.
• 2111. How do you flatten a multilevel singly linked list where each node contains a pointer to a binary tree?
• 2112. Implement a function to reverse every k-th node in a circular doubly linked list while maintaining the relative order of the remaining nodes.
• 2113. Write a function to rotate a singly linked list so that the node with the second-largest value becomes the new head.
• 2114. How do you merge k sorted circular singly linked lists into one sorted circular doubly linked list without recursion?
• 2115. Implement a function to detect the first common node in three linked lists where the lists may contain cycles.
• 2116. Write a function to split a doubly linked list into two lists where one list contains all nodes with even-positioned values.
• 2117. How do you reverse every alternate k-th node in a circular singly linked list while preserving the list structure?
• 2118. Implement a function to flatten a multilevel circular singly linked list where each node contains both a next and a down pointer.
• 2119. Write a function to rotate a multilevel doubly linked list by k positions where each node has multiple sibling pointers.
• 2120. How do you split a circular doubly linked list into two lists such that one list contains nodes with values divisible by 3?
• 2121. Implement a function to reverse every second node in a doubly linked list using recursion.
• 2122. Write a function to merge two sorted circular singly linked lists where one list contains prime values and the other contains composite values.
• 2123. How do you detect and merge two linked lists where each node has multiple pointers and the lists may contain cycles?
• 2124. Implement a function to rotate a circular doubly linked list such that every k-th node becomes the new head using recursion.
• 2125. Write a function to flatten a multilevel linked list where each node contains pointers to multiple child lists and sibling lists.
• 2126. How do you merge k unsorted linked lists into one sorted circular singly linked list using heapsort?
• 2127. Implement a function to reverse every k-th node in a circular singly linked list without recursion while maintaining the list structure.
• 2128. Write a function to split a singly linked list into two lists where one list contains nodes with prime-numbered positions.
• 2129. How do you rearrange nodes in a circular doubly linked list such that nodes with even values appear before nodes with odd values?
• 2130. Implement a function to reverse the first half of a circular singly linked list while leaving the second half unchanged.
• 2131. Write a function to rotate a doubly linked list such that every third node becomes the new head without using extra memory.
• 2132. How do you flatten a multilevel circular doubly linked list where nodes have both child pointers and sibling pointers?
• 2133. Implement a function to detect and remove loops in multiple linked lists where each list may contain multiple backward pointers.
• 2134. Write a function to rearrange nodes in a circular singly linked list such that nodes with even-numbered positions come before odd-numbered positions.
• 2135. How do you split a sorted singly linked list into k lists where each list contains alternating prime and composite values?
• 2136. Implement a function to merge two unsorted circular singly linked lists into one sorted circular doubly linked list using heapsort.
• 2137. Write a function to reverse every third node in a multilevel doubly linked list where each node has pointers to multiple children.
• 2138. How do you rotate a circular singly linked list by k positions while maintaining the order of the first m nodes?
• 2139. Implement a function to detect and merge two linked lists where both lists contain multiple loops and backward pointers.
• 2140. Write a function to flatten a doubly linked list where each node contains both forward and backward pointers and a random pointer.
• 2141. How do you reverse every k-th node in a circular singly linked list using recursion while maintaining the relative order of the remaining nodes?
• 2142. Implement a function to rotate a circular doubly linked list so that every node with an odd-numbered position becomes the new head.
• 2143. Write a function to split a circular doubly linked list into two lists where one list contains nodes with even values and the other contains odd values.
• 2144. How do you merge two sorted singly linked lists where nodes have multiple forward pointers to other nodes in the list?
• 2145. Implement a function to reverse every alternate node in a circular singly linked list without breaking the structure.
• 2146. Write a function to rotate a circular singly linked list such that nodes with values divisible by k come before nodes with non-divisible values.
• 2147. How do you flatten a multilevel singly linked list where nodes may have pointers to multiple child lists and sibling lists?
• 2148. Implement a function to split a doubly linked list into two lists where one list contains nodes with prime values and the other contains composite values.
• 2149. Write a function to rearrange nodes in a circular doubly linked list such that nodes with odd-positioned values come before even-positioned values.
• 2150. How do you reverse the second half of a circular singly linked list while leaving the first half unchanged?

• More Levels

• Beginner
• Intermediate