Dynamic programming Dynamic programming (DP) is a computer programming method which consists in breaking down a complex problem into smaller problems, usually in a recursive way. Then, these problems are solved one at a time, typically storing the already computed results so as to avoid computing them more than once. Dynamic programming and the Fibonacci … Continue reading Dynamic programming and the Fibonacci series