solulubeta
Sign in
NeetCode 150 / 1-D Dynamic Programming
13.02 · Problem

Min Cost Climbing Stairs

Easy 1-D DP over positions 1 video LC 746 Pro

This problem is part of solulu Pro

cost[i] is the price of stepping on stair i. After paying, you can climb 1 or 2 stairs. You may start on stair 0 or stair 1. Return the minimum cost to reach the top, the position just past the last stair.

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 100 of 150 · updated 2026-10-12