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