Knapsack

LeetCode 2218 note: piles are taken from the top, so taking x coins is worth a prefix sum; a grouped knapsack with dp[j] = the best value taking j coins so far, enumerating how many from each pile

0/1, unbounded, reachability, counting, and optimization states

LeetCode 4041 note: with operations in any order, BFS finds every value a number can become (up to sum) with the fewest steps, then the same grouped 0/1 knapsack as 4040

LeetCode 4040 note: with multiplications before divisions, the best is always multiply-only or divide-only; list each number’s reachable values and costs, then run a grouped 0/1 knapsack

LeetCode 2585 note: a bounded (grouped) knapsack; each question type takes 0 to count questions, with capacity running backwards and the count enumerated inside

LeetCode note for Target Sum, rebuilt from the original learning note

LeetCode note for Partition Equal Subset Sum, rebuilt from the original learning note

LeetCode note for Profitable Schemes, rebuilt from the original learning note

LeetCode note for Ones and Zeroes, rebuilt from the original learning note

LeetCode note for Form Largest Integer With Digits That Add Up To Target, rebuilt from the original learning note

LeetCode note for Last Stone Weight II, rebuilt from the original learning note