Classic DP Families

Knapsack, coin change, LIS, edit distance and LCS, interval DP, bitmask DP, and tree DP.

0 / 5 solved

Question Tags Difficulty Success

1. Twelve At Capacity Eight

dynamic-programmingknapsack +1

Medium —

2. Ascending Buys Three Copies

dynamic-programmingknapsack +2

Medium —

3. Six Ways Or Three

dynamic-programmingcounting-dp +2

Medium —

4. The Tails Array Lies

dynamic-programminglis +2

Hard —

5. When W Is Enormous

dynamic-programmingknapsack +2

Hard —

Learning Resources

cp-algorithms, Knapsack problem

cp-algorithms, Longest increasing subsequence

USACO Guide, Knapsack DP

USACO Guide, Paths on Grids

Competitive Programmer's Handbook, Chapter 7, Dynamic programming

Up next

5 of 5 questions here are still unsolved.

Next module DP Optimization & Space Reduction