# Category Archives: Divide and Conquer

## Number of days after which tank will become emptyAugust 20, 2017

Given a tank with capacity C liters which is completely filled in starting. Everyday tank is filled with l liters of water and in the… Read More »

## Shuffle 2n integers in format {a1, b1, a2, b2, a3, b3, ……, an, bn} without using extra spaceJuly 12, 2017

Given an array of 2n elements in the following format { a1, a2, a3, a4, ….., an, b1, b2, b3, b4, …., bn }. The… Read More »

## Find index of an extra element present in one sorted arrayMay 29, 2017

Given two sorted arrays. There is only 1 difference between the arrays. First array has one element extra added in between. Find the index of… Read More »

## Convex Hull (Simple Divide and Conquer Algorithm)May 28, 2017

Convex hull is the smallest convex polygon containing all the given points. Input is an array of points specified by their x and y coordinates.… Read More »

## K-th Element of Two Sorted ArraysMay 21, 2017

Given two sorted arrays of size m and n respectively, you are tasked with finding the element that would be at the k’th position of… Read More »

## Collect all coins in minimum number of stepsMay 17, 2017

Given many stacks of coins which are arranged adjacently. We need to collect all these coins in the minimum number of steps where in one… Read More »

## Find a peak element in a 2D arrayMay 14, 2017

An element is a peak element if it is greater than or equal to its four neighbors, left, right, top and bottom. For example neighbors… Read More »

## Search element in a sorted matrix

Given a sorted matrix mat[n][m] and an element ‘x’. Find position of x in the matrix if it is present, else print -1. Matrix is… Read More »

## Quickhull Algorithm for Convex HullApril 19, 2017

Given a set of points, a Convex hull is the smallest convex polygon containing all the given points. Input is an array of points specified… Read More »

## Place k elements such that minimum distance is maximizedApril 18, 2017

Given an array representing n positions along a straight line. Find k (where k

## Allocate minimum number of pagesMarch 17, 2017

Given number of pages in n different books and m students. The books are arranged in ascending order of number of pages. Every student is… Read More »

## Easy way to remember Strassen’s Matrix EquationMarch 3, 2017

Strassen’s matrix is a Divide and Conquer method that helps us to multiply two matrices(of size n X n). You can refer to the link,… Read More »

## Find the Rotation Count in Rotated Sorted arrayMarch 1, 2017

Consider an array of distinct numbers sorted in increasing order. The array has been rotated (anti-clockwise) k number of times. Given such an array, find… Read More »

## Minimum difference between adjacent elements of array which contain elements from each row of a matrixDecember 26, 2016

Given a matrix of N rows and M columns, the task is to find the minimum absolute difference between any of the two adjacent elements… Read More »

## Find bitonic point in given bitonic sequenceDecember 18, 2016

You are given a bitonic sequence, the task is to find Bitonic Point in it. A Bitonic Sequence is a sequence of numbers which is… Read More »