climbing stairs problem | dynamic programming part-2

Published: 19 January 2018
on channel: Cook The Code
251
3

what is Dynamic Programming:-
Dynamic Programming is an algorithmic paradigm that solves a given complex problem by breaking it into subproblems and stores the results of subproblems to avoid computing the same results again.

The two main properties of a problem that suggest that the given problem can be solved using Dynamic programming.

1) Overlapping Subproblems
2) Optimal Substructure