leaps.ggTRACK YOUR MASTERY →
PROBLEMS/CORE DP/0/1 KNAPSACK

0/1 Knapsack Problems

28 0/1 Knapsack problems on LeetCode, a Core DP interview pattern, ranked by importance (how often it comes up in real interviews). Difficulty (ELO) and importance shown per problem.

#PROBLEMDIFFELOIMPPATTERNS
1Partition Equal Subset SumMedium154891
2Target SumMedium153488
Combinations / Subsets
3Last Stone Weight IIHard209282
4Number of Ways to Earn PointsHard191074
Modular Arithmetic
5Maximum Profit From Trading StocksPREMIUMMedium154173
General Greedy (Greedy is main insight)
+ 23 more 0/1 Knapsack problems, see all in the explorer →
MORE CORE DP PATTERNS
Linear Recurrence DPLongest Increasing SubsequenceWord Break / String DPUnbounded Knapsack0/1 KnapsackTwo Sequence DP (LCS, Edit distance)Grid Path Problems
// your mastery
Bronze tier crystalSilver tier crystalGold tier crystalPlatinum tier crystalDiamond tier crystal
What's your 0/1 Knapsack tier?

leaps.gg syncs your LeetCode history, scores your 0/1 Knapsack mastery, and recommends exactly which problems to do next with spaced repetition. Free to start.

GET MY MASTERY MAP →