NeetCode 150 · 0/1 Knapsack
DP where each item may be used at most once, choosing a subset that hits or approaches 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 0/1 Knapsack Pattern Guide.
Featured Problems (2)
Explore More Patterns in NeetCode 150
Track your progress across all 150 problems in this curriculum roadmap.