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

• 1101. Use divide and conquer to solve the problem of finding the longest palindromic substring in a string.
• 1102. Implement a divide and conquer algorithm to find the largest rectangle area in a histogram.
• 1103. Write a divide and conquer solution to find the intersection of two arrays.
• 1104. Use divide and conquer to solve the problem of counting the number of ways to arrange n queens on an n×n chessboard.
• 1105. Implement a divide and conquer approach to find the shortest path in a weighted graph using Dijkstras algorithm.
• 1106. Write a divide and conquer solution to find the minimum height of a binary tree given its nodes.
• 1107. Use divide and conquer to solve the problem of finding the first missing positive integer in an unsorted array.
• 1108. Implement a divide and conquer algorithm to solve the problem of merging k sorted arrays.
• 1109. Write a divide and conquer solution to find the maximum sum of non-contiguous elements in an array.
• 1110. Use divide and conquer to solve the problem of finding the longest common prefix among an array of strings.
• 1111. Implement a divide and conquer approach to find the maximum sum of a subarray with at most one deletion.
• 1112. Write a divide and conquer solution to find the longest increasing subsequence in a 2D array.
• 1113. Use divide and conquer to solve the problem of determining if two strings are anagrams.
• 1114. Implement a divide and conquer algorithm to find the smallest number of operations needed to convert one string into another.
• 1115. Write a divide and conquer solution to find the largest element in a rotated sorted array.
• 1116. Use divide and conquer to solve the problem of finding the k-th largest element in a stream of numbers.
• 1117. Implement a divide and conquer approach to count the number of valid parentheses combinations.
• 1118. Write a divide and conquer algorithm to solve the problem of calculating the square root of a number.
• 1119. Use divide and conquer to solve the problem of finding the maximum number of elements that can be taken from two arrays while maintaining their sorted order.
• 1120. Implement a divide and conquer solution to find the minimum number of operations required to make two strings equal.
• 1121. Write a divide and conquer algorithm to find the maximum sum of a non-empty subarray in an array.
• 1122. Use divide and conquer to solve the problem of finding the longest common subsequence in two strings.
• 1123. Implement a divide and conquer approach to solve the problem of calculating the power of a number using exponentiation by squaring.
• 1124. Write a divide and conquer solution to find the maximum product of three numbers in an array.
• 1125. Use divide and conquer to solve the problem of finding the number of unique paths in a grid with obstacles.
• 1126. Implement a divide and conquer algorithm to find the minimum number of coins needed to make change for a given amount.
• 1127. Write a divide and conquer solution to find the number of ways to tile a 2×n board using 1×2 tiles.
• 1128. Use divide and conquer to solve the problem of finding the longest contiguous subarray with a given sum.
• 1129. Implement a divide and conquer approach to solve the problem of counting the number of triangles that can be formed with given points in a 2D plane.
• 1130. Write a divide and conquer solution to find the maximum distance between any two points in a given set of points.
• 1131. Use divide and conquer to solve the problem of finding the number of elements in an array that are greater than a given value.
• 1132. Implement a divide and conquer algorithm to find the longest sequence of consecutive integers in an array.
• 1133. Write a divide and conquer solution to find the maximum value in a binary search tree.
• 1134. Use divide and conquer to solve the problem of determining if a set of intervals overlaps.
• 1135. Implement a divide and conquer approach to find the first non-repeating character in a string.
• 1136. Write a divide and conquer solution to solve the problem of counting the number of inversions in an array.
• 1137. Use divide and conquer to find the smallest number that can be obtained by multiplying two numbers represented as arrays.
• 1138. Implement a divide and conquer algorithm to solve the problem of finding the length of the longest substring without repeating characters.
• 1139. Write a divide and conquer solution to find the minimum cost of multiplying a chain of matrices.
• 1140. Use divide and conquer to solve the problem of finding the longest common substring of two strings.
• 1141. Implement a divide and conquer approach to find the longest common subsequence in three strings.
• 1142. Write a divide and conquer algorithm to solve the problem of counting the number of distinct palindromic substrings in a string.
• 1143. Use divide and conquer to find the largest rectangle area that can be formed in a histogram.
• 1144. Implement a divide and conquer solution to find the maximum height of a binary tree given its nodes.
• 1145. Write a divide and conquer algorithm to find the longest common prefix in a sorted array of strings.
• 1146. Use divide and conquer to solve the problem of counting the number of distinct elements in a rotated sorted array.
• 1147. Implement a divide and conquer approach to find the second smallest element in a rotated sorted array.
• 1148. Write a divide and conquer solution to find the number of unique paths in a grid with obstacles.
• 1149. Use divide and conquer to solve the problem of finding the smallest missing positive integer in an unsorted array.
• 1150. Implement a divide and conquer algorithm to solve the problem of calculating the Fibonacci number using matrix exponentiation.

• More Levels

• Beginner
• Advanced