CPP solution for Leetcode 3147 — Taking Maximum Energy From the Mystic Dungeon

Author: sarthakjalan05

leetcode 3147.cpp

@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Solution {
+public:
+    int maximumEnergy(vector<int>& energy, int k) {
+        int n = energy.size();
+        vector<int> dp(n, 0);
+        int ans = INT_MIN;
+
+        for (int i = n - 1; i >= 0; i--) {
+            dp[i] = energy[i];
+            if (i + k < n)
+                dp[i] += dp[i + k];
+            ans = max(ans, dp[i]);
+        }
+
+        return ans;
+    }
+};