Skip to content
Welcome to contribute to Chinese-to-English translation! Please visit #914 for more details.

# Chapter 14. Dynamic programming

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
- 14.2 Characteristics of DP problems
- 14.3 DP problem-solving approach¶
- 14.4 0-1 Knapsack problem
- 14.5 Unbounded knapsack problem
- 14.6 Edit distance problem
- 14.7 Summary

##### Feel free to drop your insights, questions or suggestions