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

There is a sequence of magicians in a line, where energy[i] represents the energy provided by the magician at index i. You may choose any starting magician and absorb their energy. After absorbing energy from magician i, you must jump to magician i + k and absorb their energy. This process continues, jumping by k indices each time, until the next jump goes beyond the bounds of the array.

Return the maximum total energy you can collect.

Constraints:

• $1 \leq$ energy.length $\leq 10^5$

• $-1000 \leq$ energy[i] $\leq 1000$

• $1 \leq$ k $\leq$ energy.length $- 1$

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.