# Category Archives: Divide and Conquer

We have to paint n boards of length {A1, A2…An}. There are k painters available and each takes 1 unit time to paint 1 unit… Read More
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
Given an array of 2n elements in the following format { a1, a2, a3, a4, ….., an, b1, b2, b3, b4, …., bn }. The… Read More
I was contacted by the HR on LinkedIn about the opening of Full Stack Developer at PayTM Noida. 1st Round (Duration – 2 hours) Tell… Read More
Round 1 (Online Test): Four Programming Questions- a) Given a string find number of different substrings that are palindromes. b) In a matrix we can… Read More
We are given a sorted array A[] of n elements. We need to find if x is present in A or not.In binary search we… Read More
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
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
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
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
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
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
Given a sorted matrix mat[n][m] and an element ‘x’. Find the position of x in the matrix if it is present, else print -1. Matrix… Read More
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
Given an array representing n positions along a straight line. Find k (where k <= n) elements from the array such that the minimum distance… Read More