GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Patterns
  3. /0/1 Knapsack
←All Patterns
Dynamic ProgrammingEvidence Contributing

0/1 Knapsack

DP where each item may be used at most once, choosing a subset that hits or approaches a target.

Practice Problems: 2
Difficulty: 0 Easy·2 Medium·0 Hard

Core technique

Review the technique, then try the mapped problems below. The right approach depends on each problem's constraints.

  • Core Strategy: DP where each item may be used at most once, choosing a subset that hits or approaches a target.

Canonical Practice Problems

2 problems
1.Partition Equal Subset SumMedium
Solve on LeetCode↗
2.Target SumMedium
Solve on LeetCode↗

Curated Sheets Containing This Pattern

NeetCode 150

2 problems

→

NeetCode All

2 problems

→

Striver A2Z

2 problems

→

Related Algorithmic Patterns

Dynamic Programming

Circular Array DP

Dynamic Programming

Expand Around Center

Dynamic Programming

Grid / 2D Path DP

Dynamic Programming

Interval DP

Dynamic Programming

Linear 1D DP

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