Missing Test Case - 3147. Taking Maximum Energy From the Mystic Dungeon

[shaikh631]

LeetCode Username

ayan_9819

Problem Number, Title, and Link

https://leetcode.com/problems/taking-maximum-energy-from-the-mystic-dungeon/submissions/1797610041

Bug Category

Problem description

Bug Description

Taking Maximum Energy From the Mystic Dungeon

Language Used for Code

Java

Code used for Submit/Run operation

class Solution {
    public int maximumEnergy(int[] energy, int k) {
        int l = energy.length;
        int[] dp = new int[l];
        int result = Integer.MIN_VALUE;
        for (int i = l - 1; i >= 0; i--) {
            dp[i] = energy[i] + (i + k < l ? dp[i + k] : 0);
             result = Math.max(result, dp[i]);
        }
        return result;
    }
    
}

Expected behavior

3 ms
Beats 60.69%

Screenshots

Additional context

No response

[exalate-issue-sync]

oj-leetcode commented: Thank you for reaching out regarding the problem "Taking Maximum Energy From the Mystic Dungeon." It seems there might be some confusion or issue with the problem description, but to better assist you, I would need more specific details about what aspect of the description you believe is problematic or unclear. Could you please elaborate on the issues you're encountering with the description, or clarify if there are any discrepancies in the outputs with your expected results?

Your feedback is important to us, and we want to ensure the best experience for all users. Looking forward to your reply.

Best regards,
LeetCode Support Team