← All practice quizzes🎯 Today’s placement challenge — 10 questions, no login. Can you score 10/10?Take today’s challenge →
Quiz: 0/1 Knapsack and Subset Sum
5 questions · new set on every retakeNo time limitPass: 60%+10 XP on first pass
The classic "pick items under a weight limit" problem, solved with a 2D table and then a 1D array. Learn why greedy fails, why the loop must run backwards, and how subset sum and equal partition use the same idea.
Log in to take the quiz
Free account · see your score, answers and explanations, earn XP