Jump game minimum cost path
Your task
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.
Examples
min_jump_cost(cost: list[int], k: int) -> intExample 1
Input
min_jump_cost([1, 3, 1, 5, 2], 2)Output
4