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