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 »
Given an integer array arr[] and an integer K (greater than 0), the task is to count the subarray whose elements sum up to a multiple of K, else print -1. A number x is a multiple of K if there exists an integer y such that x = y*k. Remember 0 is also a multiple of K.… 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 a sorted array arr, remove the duplicates in the array itself such that duplicates appear at most twice in the given array arr and print the new length and modified array arr. Examples: Input: arr[] = {0, 0, 7, 7, 7, 7, 8, 9, 9} Output: 7 arr[] ={0, 0, 7, 7, 8, 9, 9} Explanation: The… 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 a square matrix of n order in which two positions are filled. Fill two more positions such that a rectangle is formed by joining all points. Examples: Input: n=4 Matrix[][]= 1 0 0 1 0 0 0 0 0 0 0 0 Output: Matrix[][]= 1 0 0 1 1 0 0 1 0 0 0 0 Input:… Read More »
