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

• 1001. Write a divide and conquer algorithm to find the median of two sorted arrays.
• 1002. Use divide and conquer to solve the closest pair of points problem.
• 1003. Implement a divide and conquer approach to multiply two large numbers.
• 1004. Write a divide and conquer solution to find the inversion count in an array.
• 1005. Use divide and conquer to solve the problem of finding the k-th smallest element in an unsorted array.
• 1006. Implement a divide and conquer algorithm to merge k sorted linked lists.
• 1007. Write a divide and conquer solution to find the skyline of a set of buildings.
• 1008. Use divide and conquer to solve the problem of finding the majority element in an array.
• 1009. Implement a divide and conquer algorithm to solve the convex hull problem.
• 1010. Write a divide and conquer solution to count the number of inversions required to sort an array.
• 1011. Use divide and conquer to solve the maximum subarray sum problem for a circular array.
• 1012. Implement a divide and conquer approach to multiply two polynomials represented as arrays.
• 1013. Write a divide and conquer solution to find the kth largest element in a stream of numbers.
• 1014. Use divide and conquer to solve the problem of finding the minimum spanning tree in a graph.
• 1015. Implement a divide and conquer algorithm to solve the closest pair of points problem in 3D space.
• 1016. Write a divide and conquer solution to find the longest common prefix of an array of strings.
• 1017. Use divide and conquer to solve the problem of finding the maximum product subarray.
• 1018. Implement a divide and conquer approach to calculate the determinant of a matrix.
• 1019. Write a divide and conquer solution to solve the power set problem.
• 1020. Use divide and conquer to solve the problem of finding the longest bitonic subsequence in an array.
• 1021. Implement a divide and conquer algorithm to merge overlapping intervals.
• 1022. Write a divide and conquer solution to solve the coin change problem.
• 1023. Use divide and conquer to find the k-th smallest element in a union of two sorted arrays.
• 1024. Implement a divide and conquer approach to solve the edit distance problem.
• 1025. Write a divide and conquer solution to solve the matrix chain multiplication problem.
• 1026. Use divide and conquer to find the minimum number of scalar multiplications in matrix chain multiplication.
• 1027. Implement a divide and conquer algorithm to find the shortest path in a weighted graph.
• 1028. Write a divide and conquer solution to find the minimum number of comparisons needed to find both the minimum and maximum of an array.
• 1029. Use divide and conquer to solve the longest common subsequence problem.
• 1030. Implement a divide and conquer approach to find the minimum cost to cut a stick into given lengths.
• 1031. Write a divide and conquer solution to calculate the nth Fibonacci number using matrix exponentiation.
• 1032. Use divide and conquer to solve the problem of counting the number of distinct substrings of a string.
• 1033. Implement a divide and conquer approach to compute the largest rectangle in a histogram.
• 1034. Write a divide and conquer solution to solve the knapsack problem.
• 1035. Use divide and conquer to find the minimum number of insertions to make a string palindrome.
• 1036. Implement a divide and conquer algorithm to solve the balanced partition problem.
• 1037. Write a divide and conquer solution to solve the painters partition problem.
• 1038. Use divide and conquer to solve the problem of finding the number of ways to partition an array into k subarrays.
• 1039. Implement a divide and conquer approach to find the maximum circular subarray sum.
• 1040. Write a divide and conquer solution to calculate the number of distinct subsequences in a string.
• 1041. Use divide and conquer to solve the problem of finding the largest square submatrix with all 1s in a binary matrix.
• 1042. Implement a divide and conquer algorithm to count the number of ways to make change for a given amount using a set of coins.
• 1043. Write a divide and conquer solution to solve the weighted interval scheduling problem.
• 1044. Use divide and conquer to solve the problem of finding the minimum cost path in a grid.
• 1045. Implement a divide and conquer approach to solve the problem of finding the smallest enclosing circle for a set of points.
• 1046. Write a divide and conquer solution to find the maximum number of overlapping intervals in a set of intervals.
• 1047. Use divide and conquer to solve the problem of finding the largest rectangle in a binary matrix.
• 1048. Implement a divide and conquer algorithm to solve the problem of maximizing the profit of scheduling jobs with deadlines and profits.
• 1049. Write a divide and conquer solution to find the minimum number of coins needed to make change for a given amount.
• 1050. Use divide and conquer to solve the problem of counting the number of distinct palindromic substrings in a string.

• More Levels

• Beginner
• Advanced