Given a list of jobs where each job has a start and finish time, and also has profit associated with it, find maximum profit subset of non-overlapping jobs.
Given a set of rectangular 3D boxes, create a stack of boxes which is as tall as possible. A box can be placed on top of another box if the dimensions of the 2D base of the lower box are each strictly larger than those of the 2D base of the higher box. Multiple instances …
Given a M x N rectangular grid, efficiently count all paths starting from the first cell (0,0) to the last cell (N-1,M-1) in the grid. We can either move down, or move towards right from a cell.
Given a string, find minimum cuts needed to partition it such that each partition is a palindrome.
Given a square matrix, print maximum length snake sequence in it. A Snake sequence is defined as a sequence of numbers where each new number, which can only be located to the right or down of the current number, is either plus or minus one.
Given a string and a dictionary of words, determine if string can be segmented into a space-separated sequence of one or more dictionary words.
The longest decreasing subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, highest to lowest, and in which the subsequence is as long as possible.
Given a list containing future prediction of share prices, find maximum profit that can be earned by buying and selling shares at most twice with a 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.
Given a list containing future prediction of share prices, find maximum profit that can be earned by buying and selling shares at most k times with a 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.
A string is K-Palindrome if it becomes a palindrome on removing at most k characters from it. Write an algorithm to check if a given string is K-Palindrome or not.
Given 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.
Write an algorithm to replace each element in an array of positive integers such that the difference between adjacent elements in the array is less than or equal to a given target. We need to minimize the adjustment cost which is the sum of differences between new and old values. In other words, minimize ∑|A[i] …