Binary Search based problems
- Find a peak element in a given array
- Check for Majority Element in a sorted array
- K-th Element of Two Sorted Arrays
- Find the number of zeroes
- Find the Rotation Count in Rotated Sorted array
- Find the point where a monotonically increasing function becomes positive first time
- Median of two sorted arrays
- Median of two sorted arrays of different sizes
- The painter’s partition problem using Binary Search
Divide and Conquer Algorithm
Divide and Conquer algorithm is a problem-solving strategy that involves breaking down a complex problem into smaller, more manageable parts, solving each part individually, and then combining the solutions to solve the original problem. It is a widely used algorithmic technique in computer science and mathematics.
Example: In the Merge Sort algorithm, the “Divide and Conquer” strategy is used to sort a list of elements. Below image illustrate the dividing and merging states to sort the array using Merge Sort.
Table of Content
- What is Divide and Conquer?
- Stages of Divide and Conquer
- Applications of Divide and Conquer
- Basics of Divide and Conquer
- Standard Algorithms on Divide and Conquer
- Binary Search based problems
- Practice problems on Divide and Conquer