Divide and conquer (D&C) is an algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem.
In this post, we have list out commonly asked interview questions that can be solved with Divide and conquer technique –
- Binary Search
- Find number of rotations in a circularly sorted array
- Search an element in a circular sorted array
- Find first or last occurrence of a given number in a sorted array
- Count occurrences of a number in a sorted array with duplicates
- Find smallest missing element from a sorted array
- Find Floor and Ceil of a number in a sorted array
- Search in a nearly sorted array in O(log(n)) time
- Find number of 1’s in a sorted binary array
- Find the peak element in an array
- Maximum Sum Subarray using Divide & Conquer
- Find Minimum and Maximum element in an array using minimum comparisons
- Efficiently implement power function | Recursive and Iterative
- Find Missing Term in a Sequence in log(n) time
- Division of Two Numbers using Binary Search Algorithm
- Find Floor and Ceil of a number in a sorted array (Recursive solution)
- Find Minimum and Maximum element in an array by doing minimum comparisons
- Find Frequency of each element in a sorted array containing duplicates
- Ternary Search vs Binary search
- Exponential search
- Interpolation search
- Merge Sort Algorithm
- Iterative Merge Sort Algorithm (Bottom-up Merge Sort)
- Merge Sort Algorithm for Singly Linked List
- Inversion Count of an array
- Quicksort Algorithm
- Iterative Implementation of Quicksort
- Hybrid QuickSort
- Quicksort using Dutch National Flag Algorithm
- Quick Sort using Hoare’s Partitioning scheme
Thank you for being with us. 🙂
Leave a Reply