Divide-and-conquer-question - Intermediate Questions

Topic: Divide-and-conquer-question / Level: Intermediate

201. Implement the merge sort algorithm and analyze its time complexity.
202. Write a function to sort an array using the quick sort algorithm, and discuss its average and worst-case time complexities.
203. Given two sorted arrays, merge them into a single sorted array using a divide and conquer approach.
204. Use binary search to find the square root of a given number with a precision of 0.01.
205. Implement a function that finds the k-th smallest element in an unsorted array using a divide and conquer approach.
206. Write a function to find the majority element in an array (the element that appears more than n/2 times) using a modified divide and conquer approach.
207. Given an array of integers, count the number of inversions using the merge sort technique.
208. Use the divide and conquer technique to find the closest pair of points in a 2D space.
209. Write a function that solves the "maximum subarray problem" using divide and conquer.
210. Implement Strassen's algorithm to multiply two matrices, and analyze its complexity.
211. Given a list of points, find the convex hull using the divide and conquer approach.
212. Write a function to find the longest common subsequence (LCS) between two strings using divide and conquer.
213. Implement a function that finds the maximum product of three integers in an array using a divide and conquer strategy.
214. Given a matrix, find the maximum sum rectangle using the divide and conquer technique.
215. Write a function to find the median of two sorted arrays in logarithmic time.
216. Implement a function that finds all unique paths in a grid with obstacles using divide and conquer.
217. Use divide and conquer to find the longest palindromic substring in a given string.
218. Given an array, determine if it can be partitioned into two subsets with equal sum using divide and conquer.
219. Write a function to find the number of unique ways to climb stairs when each step can be 1, 2, or 3 steps at a time.
220. Implement a function to count the number of ways to tile a 2 x n rectangle using 1 x 2 dominoes.
221. Given a binary tree, find its diameter using a divide and conquer approach.
222. Write a function to find the longest increasing subsequence in an array using divide and conquer.
223. Implement a function to determine if a string is a valid anagram of another string using divide and conquer.
224. Given an array of stock prices, find the maximum profit that can be made by buying and selling once using a divide and conquer strategy.
225. Write a function to find the longest substring with at most k distinct characters using a divide and conquer approach.
226. Use divide and conquer to compute the product of two polynomials represented as arrays.
227. Implement a function to find the smallest number in a rotated sorted array using binary search.
228. Given a string, count the number of distinct palindromic substrings using divide and conquer.
229. Write a function to find the longest common prefix of a list of strings using a divide and conquer approach.
230. Given an unsorted array, find the median value using the QuickSelect algorithm.

Previous
1
2
3
4
5
6
7
Next

More Levels
Beginner
Advanced

Most Visited

Given an array, find the maximum sum of a subarray that has a given sum using divide and conquer. Given a string, find the first non-repeating character using divide and conquer. Implement a function to find the first non-repeating character in a string using divide and conquer. Write a function to find the minimum window substring that contains all characters of another string using divide and conquer. Write a function to find the longest common prefix among an array of strings using divide and conquer. Write a function to find the longest common prefix among an array of strings using divide and conquer. Write a function that generates all possible combinations of a given string using divide and conquer. Given an integer n, find the number of ways to express it as a sum of positive integers using divide and conquer. Given a string, find the longest valid parentheses substring using divide and conquer. Write a function that counts the number of inversions in an array using the merge sort technique. Given an array, find the number of ways to split it into two subsets such that their sums are equal using divide and conquer. Write a function to find the longest increasing subsequence of a string using divide and conquer. Implement a function to find the longest alternating subsequence in a string using divide and conquer. Write a function to find the longest increasing subsequence in a sequence of numbers using divide and conquer. Given a binary search tree, find the kth largest element using divide and conquer.