Given an array A[] and size of array is N. The task is to replace element of array A[] are in given range L to R both are included. Element replace by one another Array B[] size of N. Examples: Input : N = 8 A[] = { 3, 5, 3, 4, 9, 3, 1, 6 } B[]… Read More »
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 »
You have a total of n coins and you want to arrange the coins in staircase shape, where every i-th row must have exactly i coins. You want to find the total number of full staircase rows that can be formed. Example: Input : n = 7 Output : 3 We can form the staircase as follows :… 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 an array arr[] and the two elements x and y, the task is to find which element(x or y) has highest occurrence in the array. If the occurrences are the same, then return the smaller element. Examples: Input: arr[] = {1, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5}; x = 4, y = 5;… Read More »
Given an integer array arr[] and K, the task is to count the number of elements ‘A[i]’, such that A[i] * K is also present in the array. Note: If there are duplicates in the array, count them separately. Examples: Input : arr = { 2, 4, 5, 7, 10}, K = 2 Output : 2 Explanation :… Read More »
Given an array arr[] of n elements, write a function to search a given element x in arr[]. Examples: Input : arr[] = {10, 20, 80, 30, 60, 50, 110, 100, 130, 170} x = 110; Output : 6 Input : arr[] = {10, 20, 80, 30, 60, 50, 110, 100, 130, 170} x = 175; Output :… Read More »
Given two strings string1 and string2, the task is to find the smallest substring in string1 containing all characters of string2. Examples : Input: string = “Cplusplus is the best”, pattern = “pp” Output: Smallest window is : plusp Explanation: “plusp” contains all the characters of pattern. Input: string = “Cplusplus”, pattern = “Cpp” Output: Smallest window is… Read More »
Given a stock n-day price, you can only trade at most once a day, you can choose to buy a stock or sell a stock or give up the trade today, the task is to find the maximum profit can reach. Examples: Input : arr = [1,2,10,9] Output : 16 Explanation : You can buy in day 1,2… Read More »
Given a string str. The task is to check whether this string can be splitted into two strings X and Y such that Y is a substring of X X + Y = str (Here, X+Y means X and Y are concatenated) Examples : Input: pleaselea Output: Yes str = “please” + “lea”, Here “lea” is a substring… Read More »
