Minimum Cost to Reach End Problem

You are provided with an array ARR of integers of size 'N' and an integer 'K'. The goal is to move from the starting index to the end of the array with the minimum possible cost, considering you can jump from index i to j if j ≤ i + K. The cost to jump from index i to index j is given by abs(ARR[j] - ARR[i]).

Example:

Input:

ARR = [10, 3, 40, 5, 25]
K = 2

Output:

29

Explanation:

The optimal jumps are: from index 0 to 1 (cost: 7), then from index 1 to 3 (cost: 2), and finally from index 3 to 4 (cost: 20). Total cost = 7 + 2 + 20 = 29.

Constraints:

1 ≤ T ≤ 10

2 ≤ N ≤ 1000

1 ≤ K

Question

Minimum Cost to Reach End Problem

You are provided with an array ARR of integers of size 'N' and an integer 'K'. The goal is to move from the starting index to the end of the array with the minimum possible cost, considering you can jump from index i to j if j ≤ i + K. The cost to jump from index i to index j is given by abs(ARR[j] - ARR[i]).

Example:

Input:

ARR = [10, 3, 40, 5, 25]
K = 2

Output:

Explanation:

The optimal jumps are: from index 0 to 1 (cost: 7), then from index 1 to 3 (cost: 2), and finally from index 3 to 4 (cost: 20). Total cost = 7 + 2 + 20 = 29.

Constraints:

1 ≤ T ≤ 10
2 ≤ N ≤ 1000
1 ≤ K < N
0 ≤ ARR[i] <= 10^6
Time Limit: 1 sec

Accepted Answer

Find minimum cost to reach end of array by jumping with constraints

Use dynamic programming to keep track of minimum cost at each index
Iterate through the array and update the minimum cost based on reachable indices within K steps
Calculate cost to jump from current index to reachable indices and update minimum cost accordingly