Taking Maximum Energy From the Mystic Dungeon

class Solution {
    public int maximumEnergy(int[] energy, int k) {
      int max = Integer.MIN_VALUE;

      int n = energy.length;

      for(int i=0; i<k; i++) {
        // k postfix sum arrays 
        int sum = 0;
        for(int j=n-1; j-i>=0; j-=k) {
            sum += energy[j-i];
            max = Math.max(sum, max);
        }
      }

      return max;

    }
}