README.md

Module 13 — Dynamic Programming

9 topics. Each note is a lecture-style outline you fill in; implement the matching code/ skeleton until the tests/ pass.

Topics

1. The Dynamic Programming Paradigm
2. 0/1 Knapsack
3. Longest Common Subsequence
4. Longest Increasing Subsequence
5. Edit Distance
6. Matrix Chain Multiplication
7. Coin Change
8. Rod Cutting
9. Dynamic Programming on Trees

Practice

• Problem Set — Coding / Conceptual / Challenge sections

Layout

• notes/ — the workbook pages
• code/ — Java skeletons to implement
• problemset/ — one stub per coding problem
• tests/ — JUnit 5 tests (run ./gradlew test_13-dynamic-programming)