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