Given an integer array nums and an integer k, return the maximum sum of a non-empty subsequence of nums such that for every two consecutive elements in the subsequence with original indices i and j (where i $<$ j), the condition j $-$ i $\leq$ k is satisfied.

Note: A subsequence of an array is obtained by deleting zero or more elements from the array without changing the relative order of the remaining elements.

Constraints:

• $1 \leq$ k $\leq$ nums.length $\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.