Dynamic Programming

What is the idea behind dynamic programming?

Dynamic Programming breaks down problems into subproblems, then

• solves those subproblems from smallest -> largest
• uses the solution of those subproblems to solve the larger problem

All-Pairs Shortest Path

This is a shorted path implementation that works even with negative weights

Computing Levingstam Distance

This is a measusre of the similarity of two strings.

Knapsack Problem

Weighted Interval Scheduling

Matric Chain Multiplication