Topic: linked-list-problem / Level: intermediate

• 1101. Write a function to check if a doubly linked list is a palindrome using a two-pointer technique.
• 1102. How do you rotate a circular singly linked list by k positions without modifying the structure?
• 1103. Implement a function to merge two sorted circular doubly linked lists into one sorted list with no duplicates.
• 1104. Write a function to reverse every alternate node in a doubly linked list without swapping data.
• 1105. How do you find the intersection point of two sorted singly linked lists?
• 1106. Implement a function to delete the middle node of a circular singly linked list in a single pass.
• 1107. Write a function to remove all nodes with values greater than a given value in a circular doubly linked list.
• 1108. How do you split a doubly linked list into k parts of approximately equal lengths?
• 1109. Implement a function to find the longest increasing subsequence in a circular singly linked list.
• 1110. Write a function to reverse nodes in a singly linked list in groups of k without recursion.
• 1111. How do you rotate a doubly linked list by k positions while keeping the structure intact?
• 1112. Implement a function to merge k sorted doubly linked lists into one sorted circular singly linked list.
• 1113. Write a function to rearrange nodes in a circular singly linked list such that all even values come before odd values.
• 1114. How do you remove nodes from a singly linked list whose values are less than the average of the list?
• 1115. Implement a function to rotate a circular doubly linked list left by k positions using recursion.
• 1116. Write a function to check if two singly linked lists are mirror images of each other.
• 1117. How do you reverse every third node in a doubly linked list without using extra space?
• 1118. Implement a function to convert a circular doubly linked list into a binary search tree.
• 1119. Write a function to merge two sorted singly linked lists, alternating nodes from each list.
• 1120. How do you delete every second node from a doubly linked list where each node contains a random pointer?
• 1121. Implement a function to reverse nodes between two positions m and n in a circular singly linked list.
• 1122. Write a function to rotate a singly linked list right by k positions using an iterative approach.
• 1123. How do you detect if a circular singly linked list has a loop and return the node where the loop begins?
• 1124. Implement a function to split a doubly linked list into two sublists such that all nodes with values greater than a pivot go to one list.
• 1125. Write a function to rearrange a singly linked list such that all nodes with values less than k come before nodes with values greater than or equal to k.
• 1126. How do you rotate a circular singly linked list so that the last node becomes the head?
• 1127. Implement a function to flatten a multilevel singly linked list with children nodes at different levels.
• 1128. Write a function to delete nodes from a circular doubly linked list where each node value is divisible by 3.
• 1129. How do you reverse every alternate group of nodes in a doubly linked list?
• 1130. Implement a function to check if two circular singly linked lists are anagrams of each other.
• 1131. Write a function to merge two sorted doubly linked lists into one sorted linked list without extra memory.
• 1132. How do you rearrange nodes in a circular singly linked list so that the first half is in ascending order and the second half is in descending order?
• 1133. Implement a function to find the node at the middle of a circular doubly linked list.
• 1134. Write a function to reverse the first n nodes in a circular doubly linked list using an iterative approach.
• 1135. How do you remove nodes from a singly linked list whose sum of values equals a given target using recursion?
• 1136. Implement a function to split a circular singly linked list into two separate linked lists based on even and odd values.
• 1137. Write a function to rotate a doubly linked list right by k positions without using recursion.
• 1138. How do you reverse nodes between two given positions m and n in a doubly linked list?
• 1139. Implement a function to check if two circular doubly linked lists are identical.
• 1140. Write a function to rearrange a singly linked list such that all negative numbers appear before non-negative numbers.
• 1141. How do you split a circular doubly linked list into three parts with approximately equal lengths?
• 1142. Implement a function to rotate a singly linked list so that every k-th node becomes the new head.
• 1143. Write a function to remove duplicate nodes from an unsorted doubly linked list without using extra space.
• 1144. How do you reverse every alternate node in a circular singly linked list using recursion?
• 1145. Implement a function to merge two circular doubly linked lists, alternating nodes from each list.
• 1146. Write a function to find the union and intersection of two sorted singly linked lists.
• 1147. How do you rotate a circular singly linked list by k positions to the left without using extra space?
• 1148. Implement a function to delete every second node from a circular doubly linked list.
• 1149. Write a function to reverse the second half of a circular singly linked list using an iterative approach.
• 1150. How do you check if two doubly linked lists contain the same elements in the same order?

• More Levels

• Beginner
• Advanced