Topic: divide-and-conquer-problem / Level: beginner

• 101. Use binary search to find the smallest element in a rotated sorted array with duplicate elements.
• 102. Write a divide and conquer solution to find the kth smallest element in a 2D matrix.
• 103. Implement a solution to count the number of elements between two given values in a sorted array using divide and conquer.
• 104. Solve the problem of finding the number of unique elements in a list of intervals using divide and conquer.
• 105. Implement binary search to find the smallest element greater than a given number in a rotated sorted array.
• 106. Write a divide and conquer algorithm to find the longest common prefix of two strings.
• 107. Use divide and conquer to find the largest square sub-matrix with all 1s in a binary matrix.
• 108. Implement a solution to find the longest palindromic subsequence in a string using divide and conquer.
• 109. Solve the problem of finding the minimum element in a circular array using divide and conquer.
• 110. Write a divide and conquer solution to find the number of distinct elements in a sorted array.
• 111. Implement a divide and conquer approach to solve the problem of finding the maximum product of two elements in an unsorted array.
• 112. Solve the problem of finding the k-th smallest element in a rotated sorted array using divide and conquer.
• 113. Implement binary search to find the maximum element in a rotated sorted array with duplicate elements.
• 114. Write a divide and conquer algorithm to find the maximum difference between two elements in a bitonic array.
• 115. Use binary search to find the first occurrence of a number in a rotated sorted array.
• 116. Implement a solution to find the minimum element in a sorted matrix using divide and conquer.
• 117. Solve the problem of finding the maximum number of non-overlapping subarrays in an array using divide and conquer.
• 118. Write a divide and conquer algorithm to find the longest palindromic substring in a string.
• 119. Implement binary search to find the element closest to a given number in a sorted array.
• 120. Use divide and conquer to solve the problem of counting the number of distinct subarrays with a given sum.
• 121. Implement binary search to find the first element smaller than a given number in a sorted array.
• 122. Write a divide and conquer algorithm to find the minimum number of operations to make an array non-decreasing.
• 123. Use divide and conquer to find the number of elements smaller than a given value in a rotated sorted array.
• 124. Implement binary search to find the largest element in a rotated sorted array with duplicates.
• 125. Solve the problem of counting the number of distinct elements in an array using divide and conquer.
• 126. Write a divide and conquer solution to find the maximum element in an unsorted array.
• 127. Use binary search to find the smallest element in a bitonic array.
• 128. Implement a divide and conquer approach to find the number of distinct pairs with a given sum in two sorted arrays.
• 129. Solve the problem of finding the minimum number of swaps to sort an array using divide and conquer.
• 130. Write a divide and conquer algorithm to find the smallest missing positive integer in an unsorted array.
• 131. Implement binary search to find the position of the first element greater than a given number in a sorted array.
• 132. Use divide and conquer to find the longest common suffix of two strings.
• 133. Solve the problem of counting the number of elements larger than a given number in a rotated sorted array using divide and conquer.
• 134. Implement a divide and conquer approach to find the maximum product of two elements in a sorted array.
• 135. Write a divide and conquer algorithm to solve the problem of finding the maximum number of overlapping intervals.
• 136. Implement binary search to find the maximum element in a bitonic array.
• 137. Solve the problem of finding the number of distinct elements in a rotated sorted array using divide and conquer.
• 138. Use binary search to check if a number exists in a sorted matrix.
• 139. Write a divide and conquer algorithm to solve the problem of finding the minimum number of operations to make an array strictly increasing.
• 140. Implement a solution to find the longest increasing subsequence in a circular array using divide and conquer.
• 141. Solve the problem of finding the k-th largest element in a rotated sorted array using divide and conquer.
• 142. Write a divide and conquer approach to count the number of elements in a sorted array that are divisible by a given number.
• 143. Implement binary search to find the maximum element in a rotated array with duplicate elements.
• 144. Use divide and conquer to find the smallest element in a circular sorted array.
• 145. Solve the problem of counting the number of elements smaller than a given value in two sorted arrays using divide and conquer.
• 146. Write a divide and conquer algorithm to find the maximum sum of two elements in an array.
• 147. Implement a divide and conquer solution to find the longest increasing subsequence in a bitonic array.
• 148. Use binary search to find the largest element smaller than a given number in a sorted array.
• 149. Solve the problem of finding the longest common prefix of a list of strings using divide and conquer.
• 150. Write a divide and conquer algorithm to solve the problem of finding the smallest missing positive integer in a circular array.

• More Levels

• Intermediate
• Advanced