Divide-and-conquer-question - Beginner Questions

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

91. Find the median of two sorted arrays using a divide and conquer approach.
92. Write a function to find the maximum length of a contiguous subarray with at most k distinct elements using divide and conquer.
93. Given a binary tree, find the lowest common ancestor of two nodes using divide and conquer.
94. Implement a function to find the number of unique paths to reach the bottom-right corner of a grid using divide and conquer.
95. Write a function to count the number of ways to decode a given string of digits using divide and conquer.
96. Given a list of integers, find the maximum difference between any two elements using divide and conquer.
97. Implement a function to find the longest increasing path in a matrix using divide and conquer.
98. Write a function to check if a string is a valid anagram of another string using divide and conquer.
99. Given an array, find the number of ways to split it into two subsets such that their sums are equal using divide and conquer.
100. Implement a function to find the maximum area of a histogram using divide and conquer.
101. Find the longest substring with at most two distinct characters using divide and conquer.
102. Write a function to find the number of unique characters in a string using divide and conquer.
103. Given an array, find the majority element (element that appears more than n/2 times) using divide and conquer.
104. Implement a function to reverse the words in a string using divide and conquer.
105. Write a function to check if a number is a Fibonacci number using divide and conquer.
106. Given two arrays, find their intersection using a divide and conquer strategy.
107. Implement a function to find the first non-repeating character in a string using divide and conquer.
108. Write a function to find the longest path in a grid without obstacles using divide and conquer.
109. Given an integer n, find the number of ways to express it as a sum of positive integers using divide and conquer.
110. Implement a function to calculate the product of all elements in an array using divide and conquer.
111. Find the shortest path in a binary tree from root to a target node using divide and conquer.
112. Write a function to find the longest increasing subsequence in a sequence of numbers using divide and conquer.
113. Given a matrix, find the number of islands (groups of 1s) using divide and conquer.
114. Implement a function to find the longest common substring between two strings using divide and conquer.
115. Write a function to count the number of occurrences of a number in a sorted array using divide and conquer.
116. Given a string, find the longest substring that contains all unique characters using divide and conquer.
117. Implement a function to find the smallest element in a rotated sorted array using divide and conquer.
118. Write a function to find the longest path in a grid with obstacles using divide and conquer.
119. Given an array of integers, find the maximum product of any three integers using divide and conquer.
120. Implement a function to find the longest contiguous subarray with a sum of zero 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.