In a country some special kinds of coins are available. The coin’s value is decided by a rule, that the values of the coins are first N positive odd numbers. As an example, if N = 3 then coins consisting values are [1,2,5]. For quality, the country decided that every people should have exactly one coin of each… Read More »
Mithlesh has ‘N’ buckets each consisting of some fruits. Mithlesh wants to eat at least ‘M’ fruits and so, he decided to set a marker (integer) as maximum as possible such that if he eats “number of fruits in the i-th bucket – marker” fruits then it must be at least ‘M’. Note: Each bucket may not have… Read More »
Given a vector vec, and a integer K the task is to count the number of elements such that it occurs only once in the vector and with the number Kth times less and more is not present in the vector. For example: if 9 is present in the vector and K=3 then, 6 and 12 should not… Read More »
Given two arrays a and b of the same size. Find the count of total pair in array a, such that the sum of elements of pair of array a is greater than the sum of elements of the corresponding pair of array b. Example: Input: a={5,7,4,8,11} b={3,6,1,9,13} Output: 6 Explanation: The pairs are (5,7)>(3,6), (5,7)>(3,6),… Read More »
Given an array consisting of integers in range 1 to n consisting of only one duplicate element. Find out the duplicate element in O(logN) time. Examples: Input : 6 1 1 2 3 4 5 Output : 1 Input : 5 1 2 3 4 4 Output : 4 Using Binary Search: Time Complexity: O(logN)
Given a zero-indexed array P containing N integers (a permutation of number from 1 to N), where P[i] denotes the number of the rose which will start blooming on day number i+1, and integer K, return the latest day on which there is some blossoming group of size K. If there is no such day function should return… Read More »
Given an array arr[] of N points. The task is to sort these points according to it’s distance from the origin. Examples: Input: arr[] = { {5,0}, {4,0}, {3,0}, {2,0}, {1,0} } Output: (1,0) (2,0) (3,0) (4,0) (5,0) distance bw (0,0) and (1,0) = 1 distance bw (0,0) and (2,0) = 2 distance bw (0,0) and (3,0) =… Read More »
Given an array arr, the task is to find the sum of the elements which have composite frequencies in the array. Examples: Input: arr[] = {5, 4, 6, 5, 4, 6} Output: 0 All the elements appear 2 times which is a prime So, 0 Input: arr[] = {1, 2, 3, 3, 2, 1, 3, 2, 1, 3,… Read More »
Given an array arr, the task is to find the product of the elements which have composite frequencies in the array. Examples: Input: arr[] = {4, 6, 5, 4, 6} Output: 5 Only 5 occurs composite number time, So, 5 Input: arr[] = {1, 2, 3, 3, 2, 1, 3, 2, 1, 3, 3, 1} Output: 1 Only… 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 »
