Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in JavaScript

Solution: Min Cost Climbing Stairs

Let’s solve the Min Cost Climbing Stairs problem using the Dynamic Programming pattern.

We'll cover the following...

Statement

You are given an integer array, cost, where cost[i] represents the cost of stepping onto the ithi^{th} stair. After paying the cost of the stair you land on, you may climb either one or two steps forward. You may begin your climb from step 00 or step 11 ...