grokking-algorithms/chapter11/README.md

# 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 greatest value.
add some notes 2024-01-19 17:21:42 +00:00			`# Dynamic Programming`

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

			`- Useful when trying to optimize something given a constraint.`
typo 2024-01-19 17:23:09 +00:00			`- Example, items in a knapsack of size W that gives the greatest value.`