CodingEasycod-p069

Subject Dynamic programmingLevel Entry–Mid~15 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]) → int

Examples

in[[10,15,20]]out15

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.