You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
25 lines
884 B
25 lines
884 B
---
|
|
comments: true
|
|
icon: material/table-pivot
|
|
---
|
|
|
|
# Chapter 14. Dynamic programming
|
|
|
|
{ class="cover-image" }
|
|
|
|
!!! abstract
|
|
|
|
Streams merge into rivers, and rivers merge into the sea.
|
|
|
|
Dynamic programming combines the solutions of small problems to solve bigger problems, step by step leading us to the solution.
|
|
|
|
## Chapter contents
|
|
|
|
- [14.1 Introduction to dynamic programming](intro_to_dynamic_programming.md)
|
|
- [14.2 Characteristics of DP problems](dp_problem_features.md)
|
|
- [14.3 DP problem-solving approach¶](dp_solution_pipeline.md)
|
|
- [14.4 0-1 Knapsack problem](knapsack_problem.md)
|
|
- [14.5 Unbounded knapsack problem](unbounded_knapsack_problem.md)
|
|
- [14.6 Edit distance problem](edit_distance_problem.md)
|
|
- [14.7 Summary](summary.md)
|