Breaking
Category

## Dynamic programming

Category

Edit distance is a way of quantifying how dissimilar two strings are to one another by counting the minimum number of operations required to transform one string into the other.

Write program to find the sum of subarray within a one-dimensional array of numbers which has the largest sum.

Given a set of integers, is there a non-empty subset whose sum is zero? For example, given the set {-7, -3, -2, 5, 8}, the answer is yes because the subset {-3, -2, 5} sums to zero.

Coin Change is the problem of finding the number of ways of making changes for a particular amount of cents, n, using a given set of denominations d{1} dots d{m}.

Find the number of ways to get the summation of values on each face when all dice thrown. We have N dice with M faces.

Longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences

Optimal binary search tree can be static or dynamic. The tree cannot be modified in static optimality. The tree can be modified any time in the dynamic optimality.

Given a set of matrices and find the most efficient way to multiply matrix. Write an efficient way to…

Write a program to find the maximum value obtainable by cutting up the rod and selling the pieces. Rod length is N

Write a program for String matching which takes pattern and string.