Taking Maximum Energy From the Mystic Dungeon

Given an array and a step k, pick a starting index and sum the values at i, i+k, i+2k, ... until you fall off the end (you must take negative values too); return the maximum possible total. The core challenge is to evaluate these k interleaved arithmetic subsequences and pick the maximum suffix sum among them.