Topic: linked-list-problem / Level: intermediate

• 1051. Write a function to sort a circular doubly linked list in ascending order using merge sort.
• 1052. How do you detect and remove a loop in a circular singly linked list without using extra space?
• 1053. Implement a function to split a singly linked list into two linked lists, one with odd values and one with even values.
• 1054. Write a function to rotate a circular doubly linked list by k positions.
• 1055. How do you reverse every alternate node in a circular singly linked list without swapping data?
• 1056. Implement a function to find the length of the longest palindrome in a doubly linked list.
• 1057. Write a function to merge two sorted circular singly linked lists into one sorted doubly linked list.
• 1058. How do you remove all nodes from a singly linked list whose values are multiples of a given number?
• 1059. Implement a function to reverse nodes in a singly linked list between two given positions.
• 1060. Write a function to detect if two doubly linked lists are identical in terms of structure and data.
• 1061. How do you find the middle node in a circular doubly linked list using a two-pointer technique?
• 1062. Implement a function to convert a doubly linked list into a circular doubly linked list.
• 1063. Write a function to remove all duplicate nodes from a sorted singly linked list without using extra space.
• 1064. How do you rearrange nodes in a doubly linked list so that all odd nodes appear before even nodes?
• 1065. Implement a function to flatten a multilevel doubly linked list where each node may have multiple children.
• 1066. Write a function to find the first and last occurrence of a given value in a doubly linked list.
• 1067. How do you remove the nth node from the end of a circular singly linked list in one pass?
• 1068. Implement a function to split a circular singly linked list into k parts with approximately equal lengths.
• 1069. Write a function to merge two unsorted circular singly linked lists into one sorted list without duplicates.
• 1070. How do you reverse nodes in a doubly linked list in groups of k nodes without recursion?
• 1071. Implement a function to rotate a singly linked list in such a way that the last node becomes the head.
• 1072. Write a function to delete all nodes from a circular singly linked list that have values greater than a given number.
• 1073. How do you split a circular doubly linked list into two equal parts?
• 1074. Implement a function to find the intersection point of two unsorted singly linked lists.
• 1075. Write a function to rearrange a doubly linked list such that nodes with odd values appear before nodes with even values.
• 1076. How do you check if a circular singly linked list is a palindrome using a two-pointer approach?
• 1077. Implement a function to convert a circular singly linked list into a binary search tree.
• 1078. Write a function to delete every node with a prime value from a doubly linked list.
• 1079. How do you merge two sorted linked lists where each node has a random pointer?
• 1080. Implement a function to rotate a circular singly linked list to the right by k positions.
• 1081. Write a function to reverse nodes in a singly linked list in groups of k, with each group reversed in the opposite direction.
• 1082. How do you rearrange a doubly linked list so that all nodes with values less than a given value are before those greater than or equal to it?
• 1083. Implement a function to check if two circular doubly linked lists are mirror images of each other.
• 1084. Write a function to rotate a doubly linked list by k positions to the right.
• 1085. How do you reverse every alternate group of k nodes in a circular singly linked list using an iterative approach?
• 1086. Implement a function to remove the kth node from the start of a circular doubly linked list.
• 1087. Write a function to merge two sorted singly linked lists into a circular singly linked list.
• 1088. How do you delete all duplicate nodes from a doubly linked list without using extra space?
• 1089. Implement a function to split a sorted doubly linked list into two sorted singly linked lists.
• 1090. Write a function to rearrange nodes in a singly linked list such that all positive numbers appear before negative numbers.
• 1091. How do you reverse a singly linked list in place using recursion?
• 1092. Implement a function to delete all nodes from a singly linked list that are greater than the sum of the next two nodes.
• 1093. Write a function to rotate a circular doubly linked list left by k positions.
• 1094. How do you detect the length of the loop in a circular singly linked list using Floyd’s cycle detection?
• 1095. Implement a function to reverse the second half of a doubly linked list.
• 1096. Write a function to merge two circular singly linked lists into one sorted doubly linked list.
• 1097. How do you remove every k-th node from a circular doubly linked list without breaking the list structure?
• 1098. Implement a function to reverse the first n nodes in a circular singly linked list using recursion.
• 1099. Write a function to rearrange nodes in a doubly linked list such that all nodes with values divisible by 3 appear before others.
• 1100. How do you split a doubly linked list into two linked lists based on a pivot value?

• More Levels

• Beginner
• Advanced