Dynamic Programming – Longest Common Subsequence
This is the first post in Dynamic Programming – Online Classes. Dynamic programming have been a very interesting topic and technique to solve problems which exhibit a specific set of behaviors. We will...
View ArticleDynamic Programming – Distinct Paths between two points
Introduction This is the second post in Dynamic Programming – Online Classes. This is another article which demonstrates the usage of dynamic programming to solve a different problem in hand. To learn...
View ArticleDynamic Programming – Minimum Number of Coins
This is the third post in Dynamic Programming – Online Classes. This is another article which demonstrates the usage of dynamic programming to solve a different problem in hand. To learn the basics of...
View ArticleFurther Reading for Minimum Spanning Tree
Introduction This is a supplement to the posts for Minimum Spanning Tree and their Analysis. Check out the other related articles in the following section. Further Reading for Minimum Spanning Tree...
View ArticleDynamic Programming – Longest Palindromic Sequence
Palindromes are fascinating character sequences in a string. A palindrome is a string which reads the same when read from either of the ends. This post in particular talks about palindromic sub...
View ArticleDynamic Programming – CrazyNumbers
Problem Statement We are interested in finding the count of all N digit crazy numbers. Let us define a crazy number. A crazy number is a number where the magnitude of its consecutive digits differ by...
View ArticleFind Interleaving Strings using Dynamic Programming
Introduction This problem is already discussed in the post here. This post attempts to solve the same using the dynamic programming approach. Here is a brief description of the problem. Given three...
View ArticleSolving 0/1 Knapsack problem using Dynamic Programming
Introduction A knapsack is a bag with straps, usually carried by soldiers to help them take their valuables or things which they might need during their journey. The 0/1 knapsack problem is a very...
View ArticleMinimum Edit Distance
The post describes the concept of Minimum Edit Distance and tries to formulate the idea into code using Dynamic Programming. The post Minimum Edit Distance appeared first on Techie Me.
View Article