Min Cos Climbing Stairs | Dynamic Programming | Leetcode 746

In this video, I have explained the solution of min cost climbing stairs from leetcode. This solution uses bottom-up approach by storing the cost to reach the first two steps directly in dp array,and loop from index 2 onward, calculating the min cost to reach each step based on the previosuly stored values. #dynamicprogramming #leetcode