Concepts3
⚙️AlgorithmIntermediate
Knapsack Problems
Knapsack problems ask how to pick items under a weight (or cost) limit to maximize value or to check if a target sum is reachable.
#0/1 knapsack#unbounded knapsack#bounded knapsack+12
⚙️AlgorithmIntermediate
Coin Change and Variants
Coin Change uses dynamic programming to find either the minimum number of coins to reach a target or the number of ways to reach it.
#coin change#dynamic programming#unbounded knapsack+12
⚙️AlgorithmIntermediate
Dynamic Programming Fundamentals
Dynamic programming (DP) solves complex problems by breaking them into overlapping subproblems and using their optimal substructure.
#dynamic programming#memoization#tabulation+12