Staircase counting and digit sequence decodings
Filed under Grofers
The question
Count the number of ways to reach the nth stair using 1, 2, or 3 steps, print possible decodings of a digit sequence, and find the time complexity for recurrence relation T(n) = T(n-1) + (n-2)T(n-2).
No write-up yet. Related questions below have one.
Related Grofers questions
Collected from public candidate posts and coding forums. Updated Nov 2026.