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