Climbing stairs cost
Each index has a cost to step on; you may start at index 0 or 1 and climb 1 or 2 steps at a time. Return the minimum cost to go past the last step.
Implement
min_cost_climbing(cost: list[int]) → intExamples
in
[[10,15,20]]out15What 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
[[10,15,20]]15not run yetsample