## Search in a sorted 2D matrix (Stored in row major order)

Given an integer ‘K’ and a row-wise sorted 2-D Matrix i.e. the matrix has the following properties: Integers in each row are sorted from left… Read More »

- Merge Sort
- QuickSort
- Binary Search
- Count Inversions in an array | Set 1 (Using Merge Sort)
- Modular Exponentiation (Power in Modular Arithmetic)
- Median of two sorted arrays of same size
- Program for Tower of Hanoi
- Write a program to calculate pow(x,n)
- Find the minimum element in a sorted and rotated array
- The painter's partition problem
- Maximum Subarray Sum using Divide and Conquer algorithm
- Square root of an integer
- Divide and Conquer Algorithm | Introduction
- Find the Rotation Count in Rotated Sorted array
- Largest Rectangular Area in a Histogram | Set 1
- Find a peak element
- Place k elements such that minimum distance is maximized
- Maximum and minimum of an array using minimum number of comparisons
- The painter's partition problem | Set 2
- Count number of occurrences (or frequency) in a sorted array
- Median of two sorted arrays of different sizes
- K-th Element of Two Sorted Arrays
- Closest Pair of Points using Divide and Conquer algorithm
- Divide and Conquer | Set 5 (Strassen's Matrix Multiplication)
- Count all possible walks from a source to a destination with exactly k edges
- Find the element that appears once in a sorted array
- Find the maximum element in an array which is first increasing and then decreasing
- Iterative Tower of Hanoi
- Binary Search on Singly Linked List
- Karatsuba algorithm for fast multiplication using Divide and Conquer algorithm

Given an integer ‘K’ and a row-wise sorted 2-D Matrix i.e. the matrix has the following properties: Integers in each row are sorted from left… Read More »

Given an array ‘arr’, the task is to find all possible integers each of which is the bitwise AND of at least one non-empty sub-array… Read More »

Pre-requisites: Segment Tree Given an array of digits arr[]. Given a number of range [L, R] and a digit X with each range. The task… Read More »

Given an sorted array of positive numbers our tasks is to find the kth smallest sum of continuous subarray. Examples: Input : a[] = {1,… Read More »

Binary Search is searching technique which works on Divide and Conquer approach. It used to search any element in a sorted array. As compared to… Read More »

We are given a recursive function that describes Nth terms in form of other terms. In this article we have taken specific example. Now you… Read More »

Binary Search is a technique used to search element in a sorted list. In this article, we will looking at library functions to do Binary… Read More »

Prerequisite :Merge Sort and Quick Sort Quick sort is an internal algorithm which is based on divide and conquer strategy. In this: The array of… Read More »

Given two numbers and . The task is to find the number of ways in which a can be represented by a set such that… Read More »

TL;DR In this article I’m trying to explain the difference/similarities between dynamic programing and divide and conquer approaches based on two examples: binary search and… Read More »

Given N rods of different lengths. The task is to cut all the rods with some maximum integer height ‘h’ such that sum of cut-off… Read More »

Given a list of n-1 integers and these integers are in the range of 1 to n. There are no duplicates in list. One of… Read More »

Given a sorted array and a target value, find the first element that is strictly smaller than given element. Examples: Input : arr[] = {1,… Read More »

Given a sorted array and a target value, find the first element that is strictly greater than given element. Examples: Input : arr[] = {1,… Read More »

Given three numbers a, b and c, we need to find (ab) % c Now why do “% c” after exponentiation, because ab will be… Read More »