Table Of Contents
Introduction To Dynamic Programming
- Fibonacci Numbers
- Coin Change
- Longest Increasing Subsequence
- Longest Common Subsequence & Edit Distance
- Interval DP/Matrix Chain Multiplication ✓
- Bitmask DP
- Tree DP
Not-so-easy DP
- Partition DP
- State Swapping Trick
- Digit DP
- Broken Profile
- Component DP
- Matching DP
- Permutation and DP
- Game Theory
Advanced DP
- Matrix Exponentiation ✓
- Barricade's Trick ✓
- Subset Sum, Möbius Inversion & Subset Convolution ✓
- Memory Optimization Techniques
- Data Structures in DP ✓
- Slope Trick
- Exchange Argument ✓
- Generating Function
- Polynomial Interpolation ✓
- Calculus and Dynamic Programming
DP Optimizations
- Convex Hull Trick
- Divide and Conquer Optimization
- Knuth Optimization
- 1D/1D Optimization
- Alien's Trick