- Intoduction to Divide and Conquer
- Binary Search
- Merge Sort
- Quick Sort
- Tiling Problem
- Count Inversions
- Calculate pow(x, n)
- Closest Pair of Points
- Multiply two polynomials
- Strassen’s Matrix Multiplication
- The Skyline Problem
- Maximum Subarray Sum
- Longest Common Prefix
- Search in a Row-wise and Column-wise Sorted 2D Array
- Karatsuba algorithm for fast multiplication
- Convex Hull
- Quickhull Algorithm for Convex Hull
- Distinct elements in subarray using Mo’s Algorithm
- Median of two sorted arrays
- Floor in a Sorted Array
- Find closest number in array
- Find a Fixed Point in a given array
- 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 Rotation Count in Rotated Sorted array
- Find the minimum element in a sorted and rotated array
- Find the only repeating element in a sorted array of size n
- Find index of an extra element present in one sorted array
- Find the element that appears once in a sorted array
- Count number of occurrences (or frequency) in a sorted array
- Find the maximum element in an array which is first increasing and then decreasing
- Decrease and Conquer
- Binary Search on Singly Linked List
- The painter’s partition problem
- Find the number of zeroes
- Numbers whose factorials end with n zeros
- Find the missing number in Arithmetic Progression
- Number of days after which tank will become empty
- Find bitonic point in given bitonic sequence
- Find the point where a monotonically increasing function becomes positive first time
- Program for Tower of Hanoi
- Square root of an integer
- Find cubic root of a number
- Allocate minimum number of pages
- Collect all coins in minimum number of steps
- Modular Exponentiation (Power in Modular Arithmetic)
- Find a peak element in a 2D array