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 n strings in any order. Sort all the strings (lexicographically), but if a string is present completely as a prefix in another string, then string with larger length should come first. Examples: Input : 3 cap apple captain Output : apple captain cap Explanation: cap is present in captain as a prefix, so string : captain being… 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 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 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 »
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 »
