1D Dynamic Programming/Easy

Climbing StairsFREE TRACK

Time: O(N)Space: O(1)

Step 1: Setup & Initialization - Climbing Stairs

DP Transition: dp[i] = dp[i-1] + dp[i-2].

Array Elements & Pointers

[0]

[1]

[2]

[3]

[4]

Live Variables & Invariants

status:Initialized

pattern:Climbing Stairs

Step 1 / 333%

Solution Code

function climbStairs(n: number): number {

  if (n <= 2) return n;

  let a = 1, b = 2;

  for (let i = 3; i <= n; i++) { const c = a + b; a = b; b = c; }

  return b;

Custom Test Case Runner

Input your custom values and visualize step-by-step trace

Quick Presets:

AI DSA Coach

Contextual Tutor for Climbing Stairs

Hello! I am your AI DSA Tutor for **Climbing Stairs** (1D Dynamic Programming). Ask me anything about this algorithm, time complexity, or request a step hint!