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

• 1051. Implement a divide and conquer approach to solve the problem of finding the largest sum of non-overlapping subarrays.
• 1052. Write a divide and conquer solution to solve the word break problem.
• 1053. Use divide and conquer to solve the problem of finding the maximum difference between two elements in an array.
• 1054. Implement a divide and conquer algorithm to solve the minimum cost path problem in a weighted grid.
• 1055. Write a divide and conquer solution to solve the problem of counting the number of inversions in two sorted arrays.
• 1056. Use divide and conquer to find the maximum product of a subarray in a circular array.
• 1057. Implement a divide and conquer approach to solve the problem of scheduling jobs with deadlines to maximize profit.
• 1058. Write a divide and conquer solution to find the largest palindrome in a string.
• 1059. Use divide and conquer to solve the problem of finding the smallest range covering elements from k sorted arrays.
• 1060. Implement a divide and conquer algorithm to solve the problem of counting the number of valid parentheses combinations.
• 1061. Write a divide and conquer solution to solve the problem of finding the longest increasing subsequence in a circular array.
• 1062. Use divide and conquer to solve the problem of finding the minimum number of coins to make a certain amount.
• 1063. Implement a divide and conquer approach to solve the problem of partitioning an array into k subsets with equal sum.
• 1064. Write a divide and conquer solution to find the number of ways to partition a set into k subsets.
• 1065. Use divide and conquer to solve the problem of finding the longest palindromic subsequence in an array.
• 1066. Implement a divide and conquer algorithm to solve the all-pairs shortest path problem using matrix multiplication.
• 1067. Write a divide and conquer solution to find the maximum submatrix sum in a 2D array.
• 1068. Use divide and conquer to solve the problem of finding the minimum number of operations to transform one string into another.
• 1069. Implement a divide and conquer approach to solve the problem of counting the number of ways to tile a 2xN board.
• 1070. Write a divide and conquer solution to solve the longest path in a weighted directed acyclic graph (DAG).
• 1071. Use divide and conquer to solve the problem of finding the largest square of 1s in a binary matrix.
• 1072. Implement a divide and conquer algorithm to find the maximum area of a rectangle formed by a set of points on a 2D plane.
• 1073. Write a divide and conquer solution to solve the minimum edit distance problem between two strings.
• 1074. Use divide and conquer to solve the problem of finding the number of ways to partition an array into two subsets with equal sum.
• 1075. Implement a divide and conquer approach to solve the problem of maximizing the sum of non-adjacent elements in an array.
• 1076. Write a divide and conquer solution to find the minimum number of insertions and deletions to convert one string into another.
• 1077. Use divide and conquer to solve the problem of finding the maximum subarray sum in a matrix.
• 1078. Implement a divide and conquer algorithm to solve the problem of counting the number of islands in a 2D binary matrix.
• 1079. Write a divide and conquer solution to solve the longest common substring problem.
• 1080. Use divide and conquer to solve the problem of finding the minimum number of partitions needed to partition a string into palindromic substrings.
• 1081. Implement a divide and conquer approach to solve the problem of finding the smallest common element in all rows of a matrix.
• 1082. Write a divide and conquer solution to find the number of ways to decode a message given a mapping of numbers to letters.
• 1083. Use divide and conquer to solve the problem of finding the maximum height of a binary tree.
• 1084. Implement a divide and conquer algorithm to solve the problem of counting the number of subarrays with a given sum.
• 1085. Write a divide and conquer solution to solve the problem of finding the k closest points to the origin in a 2D plane.
• 1086. Use divide and conquer to solve the problem of counting the number of subsequences in an array that sum to a given value.
• 1087. Implement a divide and conquer approach to solve the problem of finding the longest zigzag path in a binary tree.
• 1088. Write a divide and conquer solution to solve the problem of finding the minimum absolute difference between two elements in an array.
• 1089. Use divide and conquer to solve the problem of finding the largest number of intervals that can be scheduled without overlapping.
• 1090. Implement a divide and conquer algorithm to solve the problem of maximizing the number of tasks that can be completed given their start and end times.
• 1091. Write a divide and conquer solution to solve the problem of finding the maximum number of non-overlapping subarrays that sum to zero.
• 1092. Use divide and conquer to solve the problem of counting the number of distinct subsequences in an array.
• 1093. Implement a divide and conquer approach to solve the problem of finding the smallest missing positive integer in an unsorted array.
• 1094. Write a divide and conquer solution to solve the problem of finding the minimum element in a rotated sorted array.
• 1095. Use divide and conquer to solve the problem of finding the maximum number of overlapping intervals in a set of intervals.
• 1096. Implement a divide and conquer algorithm to solve the problem of finding the maximum distance between two points in a set of points.
• 1097. Write a divide and conquer solution to find the longest increasing path in a matrix.
• 1098. Use divide and conquer to solve the problem of finding the number of ways to traverse a grid from the top-left corner to the bottom-right corner.
• 1099. Implement a divide and conquer approach to solve the problem of finding the smallest range that includes at least one element from each of k sorted arrays.
• 1100. Write a divide and conquer solution to solve the problem of counting the number of subarrays whose product is greater than a given value.

• More Levels

• Beginner
• Advanced