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 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 »
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 »
Given an integer array nums, return the sum of floor(nums[i] / nums[j]) for all pairs of indices 0 <= i, j < nums.length in the array. The floor() function returns the integer part of the division. Examples: Input: nums = [2,5,9] Output: 10 Explanation: floor(2 / 5) = floor(2 / 9) = floor(5 / 9) = 0 floor(2… 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 »
