Skip to content

Posts from the ‘Dynamic Programming’ Category

For some given sequence of characters ‘(‘, ‘)’, ‘[', and ']‘ , Find the shortest possible regular brackets sequence, that contains the given character sequence as a sub sequence. on February 8, 2012

Wagner–Fischer algorithm – To find Levenshtein distance ( C program ) on June 22, 2011

Determining the Length of Longest Increasing Subsequence using DP approach and Patience Sorting on March 5, 2011

Dynamic Programming Algorithm to find the minimum number of coins to make a certain amount of change out of a given set of denominations on March 2, 2011

Fibonacci Numbers – [Recursion , Iterative using Dynamic Programming , Matrix Property] on February 28, 2011