Minimum cost for climbing stairs

Open coding-geek21 opened this issue 4 years ago • 2 comments

Using Dynamic programming. Given an integer array C where C[i] is the cost of ith step on a staircase. Once we pay the cost, we can either climb one or two steps. we can either start from the step with index 0, or the step with index 1.

The output will be to return the minimum cost to reach the top of the floor.

Oct 01 '21 16:10 coding-geek21

Kindly please assign me this issue.

Oct 03 '22 17:10 Sandyy07

Hi, @coding-geek21, Hope you are fine. Can I also add some solutions here?

Jan 30 '23 17:01 Parmesh119