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 of N size denotes number of students and element of array denotes marks of students ,marks belongs between 1 to 100, where A[i] is less or equal to 32 denotes that student was fail and A[i] grater or equal to 91 denotes it was passed with hons. The task is to find minimum number of… Read More »
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 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 »
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 »
