climbing stairs problem | dynamic programming part-2

Published: 19 January 2018
on channel: Cook The Code

251

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

Watch video climbing stairs problem | dynamic programming part-2 online, duration hours minute second in high quality that is uploaded to the channel Cook The Code 19 January 2018. Share the link to the video on social media so that your subscribers and friends will also watch this video. This video clip has been viewed 251 times and liked it 3 visitors.

2,090