Topics: dynamic programming, some backtracking. I like to code intuitively, and have tried incorporating as much intuition as possible in this repo that deals with dynamic programming problems. Methods followed are uniform and build on top of each other. I started in the given order:
- knapsack (0-1, unbounded)
- longest common subseq
- matrix chain multiplication