← Back to all problems
Easy

Min Cost Climbing Stairs

Updated Feb 24, 2026

Problem

Return minimum cost to reach the top.

Constraints

2 <= cost.length <= 1000

Examples

Example 1

Input: {"cost": [10, 15, 20]}
Output: 15

Function Signature

def minCostClimbingStairs(self, cost: list[int]) -> int

How to Submit

Implement a Solution class with a minCostClimbingStairs method.

Your method will be called with the input parameters and should return the answer.