## Merge M sorted lists of variable length

Given M sorted lists of variable length, print them in sorted order efficiently.

Read More Merge M sorted lists of variable lengthCoding made easy

Given M sorted lists of variable length, print them in sorted order efficiently.

Read More Merge M sorted lists of variable lengthGiven a mobile keypad having digits from [0-9] associated with each key, count total possible combinations of digits having length n. We can start with any digit and press only four adjacent keys of any digit. Keypad also contains * and # key which we are not allowed to press.

Read More Count total possible combinations of N-digit numbers in a mobile keypadGiven a string and a pattern containing wildcard characters i.e. ‘*’ and ‘?’, where ‘?’ can match to any single character in input string and ‘*’ can match to any number of characters including zero characters, design an efficient algorithm to find if the pattern matches with the complete input string or not.

Read More Wildcard Pattern MatchingThe longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique.

Read More Longest Increasing SubsequenceGiven an array of integers, find sub-array in it that has maximum product of its elements.

Read More Find maximum product subarray in a given arrayGiven a list containing future prediction of share prices, find maximum profit that can be earned by buying and selling shares any number of times with constraint that a new transaction can only start after previous transaction is complete. i.e. we can only hold at-most one share at a time.

Read More Maximum profit earned by buying and selling shares any number of timesFind maximum amount of water that can be trapped within given set of bars. Assume width of each bar is 1 unit.

Read More Trapping Rain Water within given set of barsGiven a set of intervals, print all non-overlapping intervals after merging overlapping intervals.

Read More Merging Overlapping IntervalsGiven 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.

Read More Decode the given sequence to construct minimum number without repeated digitsGiven 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.

Read More Find maximum sum path involving elements of given arraysGiven an array of integers, find a sub-array having given sum in it.

Read More Find subarray having given sum in given array of integersGiven an array of integers, find minimum sum sub-array of given size k.

Read More Find minimum sum subarray of given size kGiven an array of integers, find contiguous subarray within it which has the largest sum.

Read More Maximum subarray problem (Kadane’s algorithm)Given an array of integers, find the maximum difference between two elements in the array such that smaller element appears before the larger element.

Read More Find maximum difference between two elements in the array by satisfying given constraints