You are given a string s consisting only of characters ‘a’ and ‘b’. You can delete any number of characters in s to make s balanced. s is balanced if there is no pair of indices (i,j) such that i < j and s[i] = ‘b’ and s[j]= ‘a’. Return the minimum number of deletions needed to make… Read More »
Given an array (with all elements greater than 0), create a non-decreasing array by swapping 2 elements if their gcd(Greatest Common Factor) is equal to the minimum element of the array. You have to print “YES” if this is possible, and if not print “NO”. Examples: Input: a[] = {6,2,4,8,12} Output: YES Explaination: Swap a[1] and a[2] and… Read More »
Given three arrays start[], duration[], amount[] of length N. A person can make money of amount[i] working for the time period [start[i], start[i]+duration[i]] on task i. Maximum amount of money a person can make from the N tasks. Note: Person can work on only one task at a time. Example : Input : start[] = {15, 10, 30,… Read More »
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 »
In Artificial Intelligence you will encounter this puzzle. Given below is a crypt-arithmetic problem solved. Example : SEND + MORE ——- = MONEY ——- CP + IS + FUN ——– = TRUE ——- All the different alphabets range from 0-9 and each and every alphabet should have a unique value. All the same letters have to be the… 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 »
