Added 2 solutions

varunu28 · varunu28 · commit 53e20c65a95d · 2020-08-09T07:45:01.000-05:00
diff --git a/Easy/Make The String Great.java b/Easy/Make The String Great.java
@@ -0,0 +1,18 @@
+class Solution {
+  public String makeGood(String s) {
+    Stack<Character> stack = new Stack<>();
+    for (char c : s.toCharArray()) {
+      if (!stack.isEmpty() && Math.abs(stack.peek() - c) == 32) {
+        stack.pop();
+      }
+      else {
+        stack.push(c);
+      }
+    }
+    StringBuilder sb = new StringBuilder();
+    while (!stack.isEmpty()) {
+      sb.append(stack.pop());
+    }
+    return sb.reverse().toString();
+  }
+}
diff --git a/Medium/Maximum Number of Non-Overlapping Subarrays With Sum Equals Target.java b/Medium/Maximum Number of Non-Overlapping Subarrays With Sum Equals Target.java
@@ -0,0 +1,18 @@
+class Solution {
+  public int maxNonOverlapping(int[] nums, int target) {
+    int sum = 0;
+    int count = 0;
+    Map<Integer, Integer> map = new HashMap<>();
+    map.put(0, -1);
+    int lastIdx = -1;
+    for (int i = 0; i < nums.length; i++) {
+      sum += nums[i];
+      if (map.containsKey(sum - target) && map.get(sum - target) >= lastIdx) {
+        count++;
+        lastIdx = i;
+      }
+      map.put(sum, i);
+    }
+    return count;
+  }
+}
diff --git a/Medium/Rotting Oranges.java b/Medium/Rotting Oranges.java
