Skip to main content
easyNeetCode 150

Min Cost Climbing Stairs

This problem is a state-machine in disguise, and DP is how you keep it under control. It's a great warm-up that builds state-and-transition thinking without a ton of moving parts. Once you define the right state, the transitions usually write themselves.

Arrays & HashingDynamic Programming

Chat with Fin or Coco right now on mobile.

Start talking through the problem here. Switch to desktop when you're ready to code and run tests.

Start coaching session
Coco
Fin

Meet your coaches

Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.

1Min Cost Climbing Stairseasy
Based onLeetCode

Code + tests need a desktop

Chat works on this phone. Email yourself a link when you want the editor and tests.