Knapsack DP: capacity tables and grid paths · 2 of 2
Knapsack
Choose items under a weight limit with a state for the items considered and the capacity, keep one row of the table, and reuse it for reachable sums, counts and unlimited copies.
0 of 9 solved
Difficulty: how hard each problem is if its topic is new to you.
- Very EasyRelated to the lesson, but quick to solve even before reading it.
- EasyQuick once you know the topic; approachable right after the lesson.
- NormalNeeds a bit more thinking.
- HardCan take a long time to find the approach.
- Very HardChallenges strong solvers; often needs several observations beyond the lesson.
- InsaneHarder than a reasonable contest at this level would ask; leave it for later.
