Dynamic Programming

Day 1 (3 hours)

1. Introduction to Dynamic Programming (1.5 hours)

2. 0/1 Knapsack Problem (1.5 hours)

Day 2 (3 hours)

1. Longest Increasing Subsequence (1.5 hours)

2. Matrix Chain Multiplication (1.5 hours)

Day 3 (3 hours)

1. Coin Change Problem (1.5 hours)

2. Edit Distance (1.5 hours)

Day 4 (3 hours)

1. Longest Common Subsequence (1.5 hours)

2. Subset Sum Problem (1.5 hours)

Day 5 (3 hours)

1. Practice Problems (3 hours)