Leetcode 70. Climbing Stairs
Count the number of distinct sequences of 1- or 2-step moves that sum to n — the ways follow the recurrence ways(n)=ways(n-1)+ways(n-2) (i.e., Fibonacci-like), with 1 ≤ n ≤ 45.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.