# Category Archives: Divide and Conquer

## Sequences of given length where every element is more than or equal to twice of previous

Given two integers m & n, find the number of possible sequences of length n such that each of the next element is greater than… Read More »

## Find index of an extra element present in one sorted array

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

## Convex Hull using Divide and Conquer Algorithm

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

## K-th Element of Two Sorted Arrays

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 steps

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 array

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 Hull

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 maximized

Given an array representing n positions along a straight line. Find k (where k <= n) elements from the array such that the maximum distance… Read More »

## Allocate minimum number of pages

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 »

## Qualcomm Interview Experience | Set 9 (Experienced through Linkedin Invite)

I have applied for Graphics Software Engineer position through LinkedIn. I was called for interview after 2 weeks of applying. Interview took place in Bangalore… Read More »

## Easy way to remember Strassen’s Matrix Equation

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 array

Consider an array of distinct numbers sorted in increasing order. The array has been rotated (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 matrix

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 sequence

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 »