You can climb 1 or 2 steps at a time. Return how many distinct ways to reach step `n`. Variant **#27**.
Example 1
Input: n = 10
Output: 89
Constraints
Acceptance: 72% · Topics: dynamic-programming, math
← All practice problems