WEEK 7

Dynamic Programming - 5th April 2022

1. Bellman Ford
   You are given n # of 2D matrices to multiply. Find out the minimum # of multiplications you need to perform.

2. 01 Knapack
   You are given n elements. Price and weight of each element is also given. You can only have items of total weight W. Calculate the total price of the products that we can have using 0-1 knapsack algorithm.

3. Floyd Warshall
   Greedy Algorithm You are given 2 strings and you have to find the Longest Common Subsequence between them.