Updated tags and solution

Author: javadev

src/main/java/g3301_3400/s3354_make_array_elements_equal_to_zero/Solution.java

@@ -1,6 +1,6 @@
 package g3301_3400.s3354_make_array_elements_equal_to_zero;
 
-// #Easy #2024_11_18_Time_1_ms_(100.00%)_Space_42.2_MB_(100.00%)
+// #Easy #Array #Simulation #Prefix_Sum #2024_11_19_Time_1_ms_(95.09%)_Space_41.9_MB_(92.55%)
 
 public class Solution {
     public int countValidSelections(int[] nums) {

src/main/java/g3301_3400/s3355_zero_array_transformation_i/Solution.java

@@ -1,6 +1,6 @@
 package g3301_3400.s3355_zero_array_transformation_i;
 
-// #Medium #2024_11_18_Time_3_ms_(100.00%)_Space_94.7_MB_(100.00%)
+// #Medium #Array #Prefix_Sum #2024_11_19_Time_3_ms_(91.34%)_Space_96_MB_(17.22%)
 
 public class Solution {
     public boolean isZeroArray(int[] nums, int[][] queries) {

src/main/java/g3301_3400/s3356_zero_array_transformation_ii/Solution.java

@@ -1,44 +1,29 @@
 package g3301_3400.s3356_zero_array_transformation_ii;
 
-// #Medium #2024_11_18_Time_22_ms_(100.00%)_Space_113.5_MB_(100.00%)
+// #Medium #Array #Binary_Search #Prefix_Sum #2024_11_19_Time_4_ms_(93.46%)_Space_118.5_MB_(13.87%)
 
 public class Solution {
     public int minZeroArray(int[] nums, int[][] queries) {
-        int total = 0;
-        int l = 0;
-        int h = queries.length - 1;
-        for (int i : nums) {
-            total += i;
-        }
-        if (total == 0) {
-            return 0;
-        }
-        while (l <= h) {
-            int m = l + (h - l) / 2;
-            if (isPossible(nums, queries, total, m)) {
-                h = m - 1;
-            } else {
-                l = m + 1;
-            }
-        }
-        return h + 2 > queries.length ? -1 : h + 2;
-    }
-
-    private boolean isPossible(int[] nums, int[][] queries, int total, int k) {
-        int[] res = new int[nums.length + 1];
-        int sum = 0;
-        for (int i = 0; i <= k; i++) {
-            int[] q = queries[i];
-            res[q[0]] += q[2];
-            res[q[1] + 1] -= q[2];
-        }
+        int[] diff = new int[nums.length];
+        int idx = 0;
+        int d = 0;
         for (int i = 0; i < nums.length; i++) {
-            sum += res[i];
-            if (nums[i] - sum > 0) {
-                return false;
+            d += diff[i];
+            while (nums[i] + d > 0 && idx < queries.length) {
+                int[] q = queries[idx];
+                if (i >= q[0] && i <= q[1]) {
+                    d -= q[2];
+                }
+                diff[q[0]] -= q[2];
+                if (q[1] + 1 < nums.length) {
+                    diff[q[1] + 1] += q[2];
+                }
+                idx++;
+            }
+            if (nums[i] + d > 0) {
+                return -1;
             }
-            total -= nums[i];
         }
-        return total == 0;
+        return idx;
     }
 }

src/main/java/g3301_3400/s3357_minimize_the_maximum_adjacent_element_difference/Solution.java

@@ -1,6 +1,6 @@
 package g3301_3400.s3357_minimize_the_maximum_adjacent_element_difference;
 
-// #Hard #2024_11_18_Time_5_ms_(100.00%)_Space_58.9_MB_(100.00%)
+// #Hard #Array #Greedy #Binary_Search #2024_11_19_Time_5_ms_(100.00%)_Space_59.2_MB_(29.41%)
 
 public class Solution {
     public int minDifference(int[] nums) {