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