Given start and end time of all the cars in a given interval, find the maximum time gap in which no car travels. The start timings are given in sorted order. Examples: Input: start[] = { 1, 2, 6 } end[] = { 3, 5, 9 } Output: 1 Explanation: The first car travels from time unit 1… Read More »
Mex of an array is the smallest non-negative integer that does not appear in the array. Given an array of non-negative integers, find mex of its elements. Examples : Input : arr[] = {0, 3, 1, 2} Output : 4 All integers smaller than 4, i.e. 0, 1, 2 and 3 are present in the array. Hence mex… Read More »
Given an array arr of size n, the task is to sort this array using minimum swaps. We are allowed to swap only adjacent elements. Examples: Input: arr[] = {1, 4, 3, 5, 2} Output: 4 Explaination: After 1st swap: arr[] = {1, 4, 3, 2, 5} After 2nd swap: arr[] = {1, 4, 2, 3, 5} After… Read More »
Given an array with n elements, task is to calculate the difference between the sum of those elements occurring at odd indexes and those at even indexes. Note : For the above problem first we have to check for the bigger sum and from that subtract the smaller sum, either it is of even index or odd index.… Read More »
We have n boxes in which we have to place c magnets such that minimum distance between two magnet should be maximum. As we know any two magnet become aggressive when kept close to each other so we keep them as apart as possible. While keeping apart we calculate the minimum distance which we maximized. Input format: Line… Read More »
You have to paint n boards of length {L1, L2, L3,…,Ln-1}. There are k painters available and each painter takes t time to paint 1 unit of board. You have to get this job done as soon as possible under the constraints that any painter will paint only contiguous sections of boards. 2 painters cannot share a board… Read More »
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 »
