Find maximum amount of water that can be trapped within given set of bars. Assume width of each bar is 1 unit.
Given a schedule containing arrival and departure time of trains in a station, find minimum number of platforms needed in the station so to avoid any delay in arrival of any train.
Given an array of integers, find the maximum sum of subsequence of given array where subsequence contains no adjacent elements.
Given a set of intervals, print all non-overlapping intervals after merging overlapping intervals.
Given a sequence consisting of ‘I’ and ‘D’ where ‘I’ denotes increasing sequence and ‘D’ denotes the decreasing sequence. Decode the given sequence to construct minimum number without repeated digits.
Given two sorted array of integers, find a path involving elements of both arrays whose sum is maximum. We can start from either arrays but we can switch between arrays only through its common elements.
Given an array of integers, find the smallest window in array sorting which will make the entire array sorted in increasing order.
Given an array constructed from another array by taking sum of every distinct pair in it, decode the array to get back the original array elements.
Find largest number possible from set of given numbers. The numbers should be appended to each other in any order to form the largest number.
Given an array of integers, find the length of smallest subarray whose sum of elements is greater than the given positive number.
Given an array of integers, find a sub-array having given sum in it.
Given an array of integers, find minimum sum sub-array of given size k.
Given an Boolean array, find the maximum sequence of continuous 1’s that can be formed by replacing at-most k zeroes by ones.
Given an array of integers, find all distinct combinations of given length where repetition of elements is allowed.