Divide-and-conquer-question - Beginner Questions

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

121. Find the first duplicate number in an array using a divide and conquer approach.
122. Write a function to find the longest increasing subsequence of a string using divide and conquer.
123. Given a matrix, find the largest square of 1s using divide and conquer.
124. Implement a function to find the longest alternating subsequence in a string using divide and conquer.
125. Write a function to calculate the total number of distinct palindromic substrings using divide and conquer.
126. Given an array of integers, find the maximum length of a subsequence that can be formed using only even numbers using divide and conquer.
127. Implement a function to find the number of unique triplets that sum to a specific target using divide and conquer.
128. Write a function to find the minimum window substring that contains all characters of another string using divide and conquer.
129. Given a binary tree, find the sum of all nodes at the maximum depth using divide and conquer.
130. Implement a function to calculate the minimum number of swaps required to sort an array using divide and conquer.
131. Find the longest substring without repeating characters in a string using divide and conquer.
132. Write a function to determine if a number is a perfect square using divide and conquer.
133. Given an array of heights, find the maximum area of water that can be trapped between two heights using divide and conquer.
134. Implement a function to find the longest sequence of consecutive numbers in an array using divide and conquer.
135. Write a function to check if a string can be rearranged to form a palindrome using divide and conquer.
136. Given a list of meeting intervals, find the minimum number of conference rooms required using divide and conquer.
137. Implement a function to find the maximum sum of a non-empty subarray using divide and conquer.
138. Write a function to find the longest repeating substring in a string using divide and conquer.
139. Given an array of numbers, find the first missing positive integer using divide and conquer.
140. Implement a function to check if two strings are anagrams of each other using divide and conquer.
141. Find the smallest element in a binary search tree using divide and conquer.
142. Write a function to find the maximum sum rectangle in a 2D matrix using divide and conquer.
143. Given an array, find the number of pairs that sum up to a specific target using divide and conquer.
144. Implement a function to find the total number of unique paths in a grid with obstacles using divide and conquer.
145. Write a function to calculate the maximum sum of a subarray with a fixed length using divide and conquer.
146. Given two strings, check if one is a rotation of the other using divide and conquer.
147. Implement a function to find the longest consecutive subsequence in an array using divide and conquer.
148. Write a function to find the smallest substring that contains all characters of another string using divide and conquer.
149. Given a matrix, find the minimum path sum from the top-left to the bottom-right corner using divide and conquer.
150. Implement a function to find the minimum number of coins to make a specific amount 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.