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