There is given a sum and you have to find whether this sum is resultant of summation of first n natural numbers or not. If it is summation of first n natural numbers then simply print value of n if that is not the case then simply print -1. Examples : Input : 15 Output : 5 Explanation… Read More »
Given an array in increasing order and a target, return indices of two numbers such that they add up to the target. You have to return an array of indices where the zeroeth index value is less than first index value. Note: Your returned answers (both index1 and index2) are not zero-based. You may assume that each input… Read More »
Given a Binary String S of length N which consists of only 0 and 1, the task is to remove minimum number of 0’s from the string such that all 1’s form a contiguous subsegment. Return numbers of 0’s which are removed, if the string is already having all 1’s in contiguous format return -1. Examples: Input :… Read More »
Given an array of size N, print the index of the distinct element from the array, provided the array has only one distinct element and rest other elements are same. Examples: Input: Arr[]={10,10,10,10,20} Output: Distinct Element found at index : 4 Input: Arr[]={7,7,7,0,7,7,7,7} Output: Distinct Element found at index : 3 Approach: Linearly traverse through the array and… Read More »
Given two lowercase alphabet strings s and t return whether you can create a 1-to-1 mapping for each letter in s to another letter (could be the same letter) such that s could be mapped to t, with the ordering of characters preserved. Input: s = “coco”, t = “kaka” Output: True Explanation: We can create this mapping:… Read More »
The min-product of an array is equal to the minimum value in the array multiplied by the array’s sum. For example, the array [3,2,5] (minimum value is 2) has a min-product of 2 * (3+2+5) = 2 * 10 = 20. A subarray is a contiguous part of an array. Input: nums = [1,2,3,2] Output: 14 Explanation: The… Read More »
Given an array of distinct positive integers arr[] of length N, the task is to count all the number of pairs of indices (i , j) such that a[j]−a[i] = j−i given that i<j always. Examples: Input: 2 3 1 4 Output: 2 Input: 1 2 3 4 Output: 6 Approach-1: Simple Brute Force: We will use 2 for… 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 »