grokking-algorithms/chapter11/README.md
2024-01-19 17:21:42 +00:00

251 B

Dynamic Programming

A programming technique for decomposing a problem into smaller discrete subproblems.

  • Useful when trying to optimize something given a constraint.
    • Example, items in a knapsack of size W that gives the greates value.