Скачать или смотреть Leetcode 746 | Min cost of climbing stairs | dynamic programming

This DP problem of cost of climbing stairs (Leetcode 746) will help you cracking the first round of interviews of many companies as well as revise your basics of dynamic programming.

Welcome to Joey'sTech !
In this video of dynamic programming tutorial you are going to learn the problem of calculating cost of climbing stairs.

This is a classic dynamic programming problem and let's say if you have just started learning about the dynamic programming technique then you must watch
this video twice or thrice to grasp the concept. To become an expert in coding and algorithms, you need to do two things - 1) practice which also means solving more and more problems.
2) Solve easy DP problems first then move to intermediate and then to problems of advanced difficulty.


--------Problem statement-------

There are N stairs connecting the ground to the floor.

Each step in the staircase has a cost associated with it.

You can begin climbing the stairs from either the 1st step or the 2nd step.

If you are standing at the ith step then after paying the cost associated with it you can move to either (i+1)th step or (i+2)th step.

So, with all this information give to you find the minimum cost which you will pay to reach the floor through the stairs.

------------------------------------------ Also Watch -------------------------------------------
Minimum cost path in a matrix dynamic programming
   • How to find minimum cost path in a matrix ...  

Maximum sub square matrix problem using dynamic programming
   • Dynamic Programming Tutorial : Maximum sub...  

Total number of unique paths in a matrix
   • Find all possible paths between two points...  


Assembly line scheduling problem
   • Assembly Line Scheduling using Dynamic pro...  

Friends Pairing Problem using dynamic programming
   • Friends pairing problem explanation: Step ...  

Step by step explanation of the Rod cutting problem
   • Rod Cutting Problem dynamic programming : ...