Dynamic Programming | Sohag's Blog

Dynamic Programming | Sohag's Blog

Longest Common Sub-sequence:

Edit Distance Problem:

Longest Increasing subsequence: (Implementation)

Integer Knapsack Problem (Duplicate Items permitted): (Implementation)
, where C is the total capacity.
, where N is the total number of items.
is the weight of the i-th element.

0/1 Knapsack problem:

Subset sum problem (Balanced Partition): (Implementation)
M[i,j] = true or false;

Coin change problem: (Details)

Matrix chain multiplication:

Floyd-Warshall Algorithm ( All pairs shortest path):
= weight of a shortest path from i to j for which all intermediate vertices are considered from the set {1,2….k}

Read full article from Dynamic Programming | Sohag's Blog