dynamic-programming

Leetcode → Dynamic Programming

definition

a method of coding in which we can work “bottom-up” on an optimization problem that has optimal subproblems.

this allows us to not have to do repeated calculations.

table without id file.inlinks as "Example Leetcode Problems"
where file.name = this.file.name