There is an array containing prices of n tickets. A number m is defined as the size of a subsequence S of tickets. Each element in the subsequence covers a continuous range of integers. In other words, when the elements in S are sorted, the absolute difference between any two consecutive elements j and j+1 is either 0… Read More »
Given an array of size N. The task is to find the maximum and the minimum element of the array using the minimum number of comparisons. Examples: Input : A[]={4,2,-1,5,0,-5,7,3,6} Output : Min Element -5 Max Element 7 Input : A[]={3,8,4,2,6,9} Output : Min Element 2 Max Element 9 Approach: The idea is to use the Two Pointer… Read More »
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 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 »
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 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 »
In this article, you will learn to print the Fibonacci sequence of first n term. Fibonacci Series generates subsequent number by adding two previous numbers. The first two terms of the Fibonacci sequence are 0 followed by 1. The Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21 … In mathematical terms, the sequence Fn of… Read More »
