CodingMediumcod-g128

Subject CombinatoricsLevel Mid–Senior~18 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Count the number of distinct ordered ways to climb exactly n stairs when each move advances by one of the allowed step sizes given in 'steps' (order matters; [1,2] and [2,1] are different). Return the count. 0 <= n <= 40, each step size in 1..n, steps are distinct.

Implement

count_step_ways(n: int, steps: list[int]) → int

Examples

in[4,[1,2]]out5

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.