Problem bank
Easy1-D DPNeetCode 150 · #99/150

Climbing Stairs

  1. 1
    Learn the pattern

    Define dp[i] in words first, then the recurrence is usually one line. Start from the base cases.

  2. 2
    Watch it run

    See this exact pattern animated step by step before you touch the keyboard.

    Open visualizer
  3. 3
    Solve it

    Solve it on LeetCode, then mark it solved here to keep your streak alive.

Cheapest Flights Within K StopsMin Cost Climbing Stairs