What is Dynamic Programming?
A Dynamic Programming is an algorithm technique based on recurrent formula and one (or some starting states). A sub solution of the problem is constructed from previously found ones. DP solutions have polynomial1 complexity which assures a much faster running time than other techniques like Backtracking and Brute Forcing
Problems
Leetcode
footnotes:
tags: dp, dynamic-programming
sources:
Footnotes
-
Consisting of several terms ↩