Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to DP: 1D

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›DP: 1D

Climbing Stairs

beginnerlayer I7 · DP: 1D5 tests

You are climbing a staircase of n steps. Each move you may climb either 1 or 2 steps. Return how many distinct ways there are to reach the top.

  • n = 2 gives 2: 1+1 or 2
  • n = 3 gives 3: 1+1+1, 1+2, 2+1
  • Must run in linear time — plain recursion will time out for larger n

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen