NeetCode 150 · Unbounded Knapsack
DP where each item/coin can be reused an unlimited number of times while building toward a target.
Sheet Problems: 2
Category: Dynamic Programming
ℹ
Curated selection from NeetCode 150
This sheet features 2 problems testing this technique. For the complete collection of problems and detailed algorithmic intuition, visit the Unbounded Knapsack Pattern Guide.
Featured Problems (2)
Explore More Patterns in NeetCode 150
Track your progress across all 150 problems in this curriculum roadmap.