Given a sequence A1,A2,A3,….,An and an empty sequence B. You need to find M minimum number of times this sequence should be appended in B, so that the length of longest increasing sequence in B is maximum possible. Examples: Input : [2,1] Output : 2 Explaination: If we append the sequence 2 times then the resulting sequence is… Read More »
Given 2 strings A and B, the task is to count the number of substrings of A which are also present in B. Example: Input: a=”plu” b=”Cplusplus” Output: 6 Explanation: p, l, u, pl, lu, and plu are the 6 substrings of string a present in string b also. Approach: We will just run 2 loops and find… 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 »
Given a positive number N denoting the number of People, an array ‘Heights‘ which contains the heights of N persons standing in a queue, and an array ‘Infronts‘ whose each entry gives the number of persons who are taller than him and standing in front of him in the queue, return the list of actual order of every… Read More »
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 »
