Given numbers from 1 to 10^10, we need to select that maximum number i from the range such that A*b(i)+C*i does not exceed m. A and C will be given and b(i) means number of bits in the number. Examples: Input : 16 10 150 Output : 8 Explanation: If we take 7 then 16*3+10*7=118,which is less than 150.… Read More »
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 »
Given two arrays of element between 0 to N- 1 of length N. Find the lexicographically smallest array c such that for any index i c[i] = ( a[i] + b[i])%N. To find the lexicographically smallest array we can rearrange the elements of the second array. Example: Input: a[]: {0, 1, 2, 3} b[]: {3, 1, 0, 2} Output:… 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 »
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 »
Two integers n and k is given. Find number of integers i from 1 to n such than difference of i and sum of digits of i is greater than k. Examples: Input : n=12 k=1 Output : 3 Explanation : 10,11,12 satisfies the given condition 10-sod(10) = 10-1 = 9 > k 11-sod(11) = 11-2 = 9… 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 »
Given 2 sorted arrays A and B of size N each. Print the sum of the middle elements of the array obtained after merging the given arrays. Examples: Input: arr1: 1 2 4 6 10 Input: arr2: 4 5 6 9 12 Output: 11 (5 + 6) The approach is similar to that of Merge function of Merge… 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 »
