Merge pull request #317 from tiennguyen2310/patch-95

Create TakingMaximumEnergyFromTheMysticDungeon.java

Author: abhishektripathi66

src/codingquestions/leetcode/TakingMaximumEnergyFromTheMysticDungeon.java

@@ -0,0 +1,59 @@
+/*
+3147. Taking Maximum Energy From the Mystic Dungeon
+Solved
+Medium
+Topics
+premium lock icon
+Companies
+Hint
+In a mystic dungeon, n magicians are standing in a line. Each magician has an attribute that gives you energy. Some magicians can give you negative energy, which means taking energy from you.
+
+You have been cursed in such a way that after absorbing energy from magician i, you will be instantly transported to magician (i + k). This process will be repeated until you reach the magician where (i + k) does not exist.
+
+In other words, you will choose a starting point and then teleport with k jumps until you reach the end of the magicians' sequence, absorbing all the energy during the journey.
+
+You are given an array energy and an integer k. Return the maximum possible energy you can gain.
+
+Note that when you are reach a magician, you must take energy from them, whether it is negative or positive energy.
+
+ 
+
+Example 1:
+
+Input: energy = [5,2,-10,-5,1], k = 3
+
+Output: 3
+
+Explanation: We can gain a total energy of 3 by starting from magician 1 absorbing 2 + 1 = 3.
+
+Example 2:
+
+Input: energy = [-2,-3,-1], k = 2
+
+Output: -1
+
+Explanation: We can gain a total energy of -1 by starting from magician 2.
+
+ 
+
+Constraints:
+
+1 <= energy.length <= 105
+-1000 <= energy[i] <= 1000
+1 <= k <= energy.length - 1
+*/
+class Solution {
+    public int maximumEnergy(int[] energy, int k) {
+        int res = -100000;
+        int n = energy.length;
+        for(int i = n - k; i < n; i++){
+            //traverse backward
+            int cur = 0;
+            for(int j = i; j >= 0; j -= k){
+                cur += energy[j];
+                res = Math.max(res, cur);
+            }
+        }
+        return res;
+    }
+}