Climbing stairs
You climb a staircase of n steps, taking 1 or 2 steps at a time. Return the number of distinct ways to reach the top.
Implement
climb_stairs(n: int) → intExamples
in
[2]out2What 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.
0:00 of about 15 min
solution.py
InputExpectedGot
[2]2not run yetsample