One combination of made up of N different things. You are given an array of length N which indicate the amount of N different things which one combination contain. You are given another array of same N things you already have. Find number of combination we can make. Example: Input: 2 4 8 16 16 16 Output: 2… Read More »
Given an array arr[] of size N, find the length of its longest subarray such that the sum of its elements not divisible by K, or determine that such subarray does not exist. Examples: Input : N = 3 , K = 3 arr[] = {1, 2, 3} Output : 2 Explanation : Subarray [2,3] has sum of… Read More »
Prerequisite – What is Algorithm | Introduction to Algorithms Advantages of Divide and Conquer Solving difficult problems: Divide and conquer is an efficient method for solving difficult problems. For example, consider the Tower of Hanoi problem which reduces the degree of difficulty since it divides the problem into subproblems that are easily solvable, solving the trivial cases and… Read More »
Find the minimum number ‘N’ such that the sum of ‘N’ natural numbers is greater than or equal to a given number ‘NUM’ using Binary Search. In this problem, we need to find the minimum number ‘N’ such that the sum of the first ‘N’ number is greater than or equal to the user given number ‘NUM’. The… Read More »
Recursion is a powerful way of developing algorithms in which the solution of a problem is determined by the solution of one or more identical subproblems. A recursive solution involves two parts: at least one BASE CASE in which the solution returned is not dependent on any solution of any subproblem, and at least one RECURSIVE CASE, where… Read More »
We’re given a function in the format of f(x). We have to find the minimum absolute difference between f(x) and given number k over a range (0 – 10^6). This article assumes you know the working principle of binary search. If you don’t know, please go and check out the binary search. To understand this concept, let’s assume… Read More »
In a prison, there are N cells. The positions of the cells are given in an array. The Jailer has to place all the prisoners in the cells in an ordered manner such that minimum distance between any two prisoners is as large as possible. You have to find that distance. Note: The cells are in a straight… Read More »
There is an array arr[] of length N. Your task is to find the sum of the minimum elements of each possible sub-array of the array. Examples: Input : arr[] = {2, 4, 6, 8, 10} Output : 75 Explanation : Min of all sub-arrays: {2} – 2 {2, 4} – 2 {2, 4, 6} – 2 {2,… Read More »
Given an array arr[] of n positive integers and q queries, in which each query have an integer k. For each query, the task is to output the minimum size of subarray whose binary representation of each elements if concatenated will have at least k number of set bits. If no such array exist, print -1. Examples: Input… Read More »
Given a sorted rotated array, the task is to find index of minimum element of the array. Following solution assumes that all elements are distinct. Examples: Input : arr[] = {5, 6, 1, 2, 3, 4} Output : 2 Minimum element in the array is 1, hence index will be 2 Input : arr[] = {2, 3, 4,… Read More »
