Skip to main content
Min Cost Climbing Stairs | AlgoCracked
AlgoCracked
ProblemsMin Cost Climbing Stairs
Easy64.0% acceptance
Dynamic ProgrammingArray

Min Cost Climbing Stairs

Each step of a staircase has a cost[i] . You may start at step 0 or step 1, and from a step you may climb one or two steps. Paying a step's cost lets you leave it. Return the minimum total cost to reach the top (just past the last step). Input format Input is a single array, e.g. [[10,15,20]] .

Loading workspace…