Divide and Conquer Interview Questions and Practice Problems

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 –


  1. Binary Search
  2. Find number of rotations in a circularly sorted array
  3. Search an element in a circular sorted array
  4. Find first or last occurrence of a given number in a sorted array
  5. Count occurrences of a number in a sorted array with duplicates
  6. Find smallest missing element from a sorted array
  7. Find Floor and Ceil of a number in a sorted array
  8. Search in a nearly sorted array in O(log(n)) time
  9. Find number of 1’s in a sorted binary array
  10. Find the peak element in an array
  11. Maximum Sum Subarray using Divide & Conquer
  12. Find Minimum and Maximum element in an array using minimum comparisons
  13. Efficiently implement power function | Recursive and Iterative
  14. Find Missing Term in a Sequence in log(n) time
  15. Division of Two Numbers using Binary Search Algorithm
  16. Find Floor and Ceil of a number in a sorted array (Recursive solution)
  17. Find Minimum and Maximum element in an array by doing minimum comparisons
  18. Find Frequency of each element in a sorted array containing duplicates
  19. Ternary Search vs Binary search
  20. Exponential search
  21. Interpolation search
  22. Merge Sort Algorithm
  23. Iterative Merge Sort Algorithm (Bottom-up Merge Sort)
  24. Merge Sort Algorithm for Singly Linked List
  25. Inversion Count of an array
  26. Quicksort Algorithm
  27. Iterative Implementation of Quicksort
  28. Hybrid QuickSort
  29. Quicksort using Dutch National Flag Algorithm
  30. Quick Sort using Hoare’s Partitioning scheme


Thank you for being with us. 🙂


Leave a Reply

Notify of