Given an array arr[] consisting of 2* N elements in the form of { a1, a2, …, aN, b1, b2, …, bN }, the task… Read More

# Category Archives: Divide and Conquer

Given a mountain array arr[] and an integer X, the task is to find the smallest index of X in the given array. If no… Read More

Given an array arr[] of size N, the task is to find the minimum count of array elements found by applying the Randomized Binary Search… Read More

Given two positive integers N and X, the task is to find the smallest divisor of N which is closest to X. Examples: Input: N… Read More

Given an array arr[] of even length N and an integer K, the task is to minimize the count of replacing array elements by an… Read More

Given an array arr[] consiting of N integers representing the number of coins in each pile, and an integer H, the task is to find… Read More

Given an array arr[] of size N and an integer K, the task is to find all the array elements that appear more than (N… Read More

Given a positive integer N, the task is to construct an array a[] using first N natural numbers which contains no such triplet (i, j,… Read More

Given an array wood[] of size N, representing the length of N pieces of wood and an integer K, at least K pieces of the… Read More

Given two sorted arrays, arr[], brr[] of size N, and M, the task is to merge the two given arrays such that they form a… Read More

Given two integers K, X, and an array arr[] consisting of N distinct elements, the task is to find X elements closest to the Kth… Read More

Given two integers N and M, generate a sequence of N binary strings by the following steps: S0 = “0” S1 = “1” Generate remaining… Read More