Topic: linked-list-problem / Level: intermediate

• 1151. Write a function to merge two sorted circular singly linked lists into one sorted doubly linked list.
• 1152. How do you reverse every second node in a circular singly linked list without using extra memory?
• 1153. Implement a function to remove all nodes with even values from a circular doubly linked list.
• 1154. Write a function to rotate a singly linked list such that the last node becomes the head.
• 1155. How do you split a singly linked list into two separate lists, one containing nodes with even values and the other with odd values?
• 1156. Implement a function to find the node at the middle of a circular singly linked list using recursion.
• 1157. Write a function to check if two doubly linked lists are identical in terms of both structure and values.
• 1158. How do you reverse every third node in a singly linked list using iteration?
• 1159. Implement a function to flatten a doubly linked list where each node has a child pointer pointing to a sublist.
• 1160. Write a function to delete every k-th node from a circular doubly linked list.
• 1161. How do you rotate a doubly linked list left by k positions using an iterative approach?
• 1162. Implement a function to reverse every group of k nodes in a circular singly linked list.
• 1163. Write a function to split a doubly linked list into two lists based on a given pivot value.
• 1164. How do you rearrange nodes in a singly linked list such that nodes with even values appear before nodes with odd values?
• 1165. Implement a function to merge two sorted circular doubly linked lists into one sorted circular singly linked list.
• 1166. Write a function to reverse the first half of a singly linked list using an iterative approach.
• 1167. How do you remove nodes from a circular singly linked list where each node value is a prime number?
• 1168. Implement a function to delete nodes from a doubly linked list where the sum of the previous and next nodes is greater than the current node value.
• 1169. Write a function to check if a singly linked list contains any repeating elements without using extra space.
• 1170. How do you reverse nodes between two given positions m and n in a circular singly linked list?
• 1171. Implement a function to flatten a circular doubly linked list where each node has a child pointer.
• 1172. Write a function to remove duplicate nodes from an unsorted singly linked list without using extra memory.
• 1173. How do you rearrange nodes in a doubly linked list such that all positive values come before negative values?
• 1174. Implement a function to reverse the second half of a circular singly linked list.
• 1175. Write a function to merge k sorted singly linked lists into one sorted doubly linked list.
• 1176. How do you rotate a circular doubly linked list to the right by k positions?
• 1177. Implement a function to remove every alternate node from a singly linked list without using extra space.
• 1178. Write a function to reverse every second node in a circular doubly linked list using recursion.
• 1179. How do you detect and remove a loop in a circular doubly linked list using Floyds cycle-finding algorithm?
• 1180. Implement a function to merge two sorted singly linked lists, alternating nodes from each list, without using recursion.
• 1181. Write a function to find the length of the longest palindrome in a circular singly linked list.
• 1182. How do you reverse nodes in pairs in a singly linked list using an iterative approach?
• 1183. Implement a function to delete every second node from a circular singly linked list where each node contains a random pointer.
• 1184. Write a function to rotate a singly linked list right by k positions using recursion.
• 1185. How do you split a circular singly linked list into two lists based on a given pivot value?
• 1186. Implement a function to reverse the first n nodes in a circular doubly linked list using recursion.
• 1187. Write a function to merge two sorted circular singly linked lists into one sorted circular doubly linked list.
• 1188. How do you remove every third node from a circular singly linked list without losing the list structure?
• 1189. Implement a function to rearrange nodes in a doubly linked list such that all nodes with values divisible by 5 come before others.
• 1190. Write a function to detect if two circular singly linked lists are identical in terms of structure and data.
• 1191. How do you reverse every k nodes in a singly linked list using recursion?
• 1192. Implement a function to flatten a singly linked list where each node has a random pointer and a next pointer.
• 1193. Write a function to rotate a doubly linked list to the right by k positions using recursion.
• 1194. How do you remove nodes from a circular doubly linked list where the node value is greater than the sum of its neighbors?
• 1195. Implement a function to merge two sorted circular doubly linked lists, alternating nodes from each list.
• 1196. Write a function to reverse every alternate node in a circular singly linked list using an iterative approach.
• 1197. How do you split a singly linked list into k parts with each part containing approximately equal nodes?
• 1198. Implement a function to remove all nodes with prime values from a singly linked list without using extra memory.
• 1199. Write a function to merge two unsorted doubly linked lists into one sorted circular singly linked list.
• 1200. How do you reverse the first half of a circular doubly linked list without using recursion?

• More Levels

• Beginner
• Advanced