GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Sheets
  3. /NeetCode 150
  4. /0/1 Knapsack
←Back to NeetCode 150
Curated IntersectionSheet: NeetCode 150Pattern: 0/1 Knapsack

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)

1.Partition Equal Subset SumMedium
Solve↗
2.Target SumMedium
Solve↗

Explore More Patterns in NeetCode 150

Track your progress across all 150 problems in this curriculum roadmap.

Back to NeetCode 1500/1 Knapsack Pattern Guide
GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy