Choosing a Subset

Take it or leave it. Subset sum, 0/1 knapsack, unbounded, and why the loop order decides which one you wrote.

0 of 35 answered

• Not triedHow Many Amounts Cannot Be MadeFoundation
• Not triedThe two branchesFoundation
• Not triedWhat the capacity axis holdsFoundation
• Not triedWhy one dimension is not enoughFoundation
• Not triedWhy taking the best value first failsFoundation
• Not triedCombinations to Make an AmountCore
• Not triedCount Subsets With a SumCore
• Not triedFewest CoinsCore
• Not triedFewest Coins With Limited StockCore
• Not triedFewest Items to Reach a TargetCore
• Not triedFill the Bag ExactlyCore
• Not triedHow Many Distinct Subset TotalsCore
• Not triedSome Items Are MandatoryCore
• Not triedSubsets With a Given DifferenceCore
• Not triedSubsets With a Total Divisible by kCore
• Not triedThe Bag With Equal WeightsCore
• Not triedThe same table, storing something elseCore
• Not triedThe Smallest Amount You Cannot MakeCore
• Not triedWhen greedy is actually correctCore
• Not triedWhen items can be reusedCore
• Not triedEnough Profit, Few Enough PeopleChallenge
• Not triedFewest Coins, And Which OnesChallenge
• Not triedHow Many Fillings Are OptimalChallenge
• Not triedLeast Weight for a Value TargetChallenge
• Not triedMultisets of Exactly k CoinsChallenge
• Not triedOne Item Per GroupChallenge
• Not triedRecovering which items were takenChallenge
• Not triedSplit Into Three Equal PartsChallenge
• Not triedSplitting Between Two BagsChallenge
• Not triedThe Bag With a Count LimitChallenge
• Not triedThe Bag With Limited StockChallenge
• Not triedThe loop direction that changes the answerChallenge
• Not triedThe Tallest Pair of Equal StacksChallenge
• Not triedWhich Items Went InChallenge
• Not triedWhy a huge capacity breaks the tableChallenge