Basic Problemsminimizationlinear
Weighted Climbing Stairs
Each step of an n-step staircase carries a cost to land on it, and a move advances 1 or 2 steps at a time. Find the cheapest total cost to reach the top, starting from either of the first two steps for free.
Do this lesson first: climbing stairsThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.