You are given an integer array nums and an integer k.

You begin at index $0$ of the array. In each move, you can jump from your current index i to any index j such that i $< j \leq \min($nums.length $- 1$, i $+ k)$.

Your goal is to reach the final index nums.length $- 1$. The score of your path is the sum of the elements at all visited indices.

Return the maximum possible score you can obtain.

Constraints:

• $1 \leq$ nums.length, k $\leq 10^5$

• $-10^4 \leq$ nums[i] $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.