intermediate level
Dynamic Programming
Study Material for Dynamic Programming
Ch 26: Dynamic Programming — Foundations
The DP Paradigm · The DP Recipe · Classic DP Problems · Longest Increasing Subsequence (LIS) · Maximum Subarray Sum (Kadane's Algorithm)
Ch 27: Dynamic Programming — Knapsack & Subsets
The 0-1 Knapsack Problem · Unbounded Knapsack · Subset Sum & Knapsack Variants · Bitmask DP
Ch 28: Backtracking & Meet-in-the-Middle
The Backtracking Template · Generating Combinatorial Objects · Pruning · Meet-in-the-Middle
Related Topics
Was this helpful?
Published by RunTimeFix · Comprehensive guides for competitive programming