Home
Log in
DescriptionSubmissionsSolution
DescriptionSubmissionsSolution
Loading...

Log in to run or submit

n =

Codey

Practise coding problems, test your solutions and track your progress.

Explore

  • Problems
  • About
  • Contact

Legal

  • Privacy Policy
  • Terms of Use

© 2026 Codey. Personal learning project.

Solution
Updated: 2026-02-23

Idea

Number of ways is Fibonacci: dp[i] = dp[i-1] + dp[i-2].

Approach

Iterate with two variables for O(1) space.

Code
Loading...
Complexity
Time: O(n)
Space: O(1)
Solution
Updated: 2026-02-23

Idea

Number of ways is Fibonacci: dp[i] = dp[i-1] + dp[i-2].

Approach

Iterate with two variables for O(1) space.

Code
Loading...
Complexity
Time: O(n)
Space: O(1)