ProblemNest
Sign In
You are coding as a Guest. Sign in with Google in 1 tap to save your daily streak, lock in +50 XP & boost your college rank!
Save Streak (1-Tap Google)
9:00 AM Daily Incident ReleaseMaintaining a 7-day streak grants a 2.5× Recruiter Visibility Multiplier on the Recruiter Talent Radar.
Multiplier Ladder:1d: 1.0ו3d: 1.5ו7d: 2.5× MAX
🔥Min Cost Climbing Stairs: Dual Step OptimizationEasy
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak

Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.

EasyDynamic Programming•Acceptance: 65.8%

Min Cost Climbing Stairs: Dual Step Optimization

Targeted in FAANG & Tech OA:AmazonMicrosoft
Real-World Engineering Context
Underpins energy minimization routes in robotic leg kinematics and network hop battery consumption budgeting.
You are given an integer array `cost` where `cost[i]` is the cost of `i`th step on a staircase. Once you pay the cost, you can either climb one or two steps. You can either start from the step with index `0`, or the step with index `1`. Return the minimum cost to reach the top of the floor (past index `n - 1`).

Sample Test Cases

Input: [[10,15,20]]
Expected: 15
Input: [[1,100,1,1,1,100,1,1,100,1]]
Expected: 6
Input: [[0,0]]
Expected: 0

Constraints

  • 2 <= cost.length <= 1000
  • 0 <= cost[i] <= 999
Verified Proof-of-Work ATS PortfolioCryptographic Verification
Export tamper-proof problem verifications to your direct ATS applications
DevScore: Unranked (0/1000)

Every verified problem solve writes authentic cryptographic proof-of-work to your profile. Attach your verified DevScore badge to ATS applications to stand out to engineering hiring teams across 4,000+ verified live tech openings (23,000+ cumulative audited) on RoleNest.

Explore 4,000+ Direct ATS Openings on RoleNest ↗Solve Challenge to Activate Ledger