| Bitmask DP: TSP and Subset-Enumeration DP | concept | 2 | Open |
| Book Exercise Lanes | exercise | 6 | Open |
| Choosing the Right Paradigm for Optimization Problems | concept | 6 | Open |
| Digit DP: Counting Numbers With Constraints | concept | 2 | Open |
| DP on DAGs and Graph-Based DP | concept | 4 | Open |
| Edit Distance and Sequence Alignment | concept | 2 | Open |
| Fibonacci and the Rolling-Array Space Reduction | concept | 4 | Open |
| Grid DP: Paths, Obstacles, Collect-Maximum | concept | 3 | Open |
| Interval DP: Matrix Chain, Optimal BST, Balloon Burst | concept | 3 | Open |
| Knapsack Variants and State Design | concept | 4 | Open |
| Learning Resources | resource | 8 | Open |
| Longest Increasing Subsequence: O(n^2) and O(n log n) Patience | concept | 3 | Open |
| Memoization vs Tabulation: Trade-offs | concept | 4 | Open |
| Module 4: Dynamic Programming & Optimization | module_overview | 1 | Open |
| Optimal Substructure: When a Problem Admits DP | concept | 3 | Open |
| Overlapping Subproblems: Why Naive Recursion Wastes Work | concept | 4 | Open |
| Proving Greedy Correctness (Exchange Argument) vs Recognizing It Fails | concept | 3 | Open |
| Reconstructing the Solution From a DP Table | concept | 3 | Open |
| Reference and Selective Reading | reference | 9 | Open |
| State Compression and When It Is Worth It | concept | 2 | Open |
| Tree DP: Independent Set, Diameter, Rerooting | concept | 1 | Open |