Divide-and-conquer-question - Beginner Questions

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

151. Find the maximum length of a subarray with at most k distinct elements using divide and conquer.
152. Write a function to find the total number of valid parentheses combinations for n pairs using divide and conquer.
153. Given an array, find the longest increasing subsequence using divide and conquer.
154. Implement a function to check if a string is a valid palindrome using divide and conquer.
155. Write a function to find the longest substring that contains at most k distinct characters using divide and conquer.
156. Given a binary search tree, find the kth largest element using divide and conquer.
157. Implement a function to find the number of distinct subsequences in a string using divide and conquer.
158. Write a function to check if a string can be formed from a given dictionary using divide and conquer.
159. Given an array, find the number of ways to partition it into two subsets with equal sum using divide and conquer.
160. Implement a function to find the longest palindromic substring in a string using divide and conquer.
161. Find the shortest path in a weighted graph using divide and conquer.
162. Write a function to count the number of distinct islands in a 2D grid using divide and conquer.
163. Given a set of points, find the convex hull using divide and conquer.
164. Implement a function to find the longest path in a directed graph using divide and conquer.
165. Write a function to calculate the number of distinct characters in a substring using divide and conquer.
166. Given a list of jobs with deadlines and profits, find the maximum profit you can earn using divide and conquer.
167. Implement a function to find the maximum sum of a subarray that contains at least one negative number using divide and conquer.
168. Write a function to check if two strings are rotations of each other using divide and conquer.
169. Given a list of integers, find the maximum product of any four integers using divide and conquer.
170. Implement a function to find the longest subsequence of a string that is a palindrome using divide and conquer.
171. Find the number of distinct subsequences of a given string using divide and conquer.
172. Write a function to find the largest rectangle in a binary matrix using divide and conquer.
173. Given an array, find the maximum length of a contiguous subarray with a given sum using divide and conquer.
174. Implement a function to find the maximum sum of non-overlapping intervals using divide and conquer.
175. Write a function to find the longest substring with exactly k distinct characters using divide and conquer.
176. Given an array, find the maximum length of an increasing subsequence using divide and conquer.
177. Implement a function to find the smallest number in an unsorted array using divide and conquer.
178. Write a function to find the largest prime factor of a number using divide and conquer.
179. Given a string, find the longest valid parentheses substring using divide and conquer.
180. Implement a function to find the total number of unique paths from the top-left to the bottom-right corner of a grid using divide and conquer.

Previous
1
2
3
4
5
6
7
Next

More Levels
Intermediate
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.