Jump game minimum cost path
You start at index 0 of array cost and must reach the last index. From index i you may jump to any index in [i+1, i+k]. Landing on index j adds cost[j]. Return the minimum total cost to reach the last index (cost[0] is counted as you start there). 1 <= len(cost) <= 10^5, 1 <= k <= len(cost), 0 <= cost[i] <= 10^4.
Implement
min_jump_cost(cost: list[int], k: int) → intExamples
in
[[1,3,1,5,2],2]out4What 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 35 min
solution.py
InputExpectedGot
[[1,3,1,5,2],2]4not run yetsample