Updated tags

Author: javadev

src/main/java/g3401_3500/s3436_find_valid_emails/script.sql

@@ -1,5 +1,5 @@
-# #Easy #2025_02_02_Time_256_(100.00%)_Space_0.0_(100.00%)
 # Write your MySQL query statement below
+# #Easy #2025_02_04_Time_451_(70.84%)_Space_0.0_(100.00%)
 select user_id, email from users
 where email regexp '^[A-Za-z0-9_]+@[A-Za-z][A-Za-z0-9_]*\.com$'
 order by user_id

src/main/java/g3401_3500/s3438_find_valid_pair_of_adjacent_digits_in_string/Solution.java

@@ -1,6 +1,6 @@
 package g3401_3500.s3438_find_valid_pair_of_adjacent_digits_in_string;
 
-// #Easy #2025_02_02_Time_1_(100.00%)_Space_43.02_(100.00%)
+// #Easy #String #Hash_Table #Counting #2025_02_04_Time_1_(100.00%)_Space_42.83_(94.06%)
 
 import java.util.Arrays;
 

src/main/java/g3401_3500/s3439_reschedule_meetings_for_maximum_free_time_i/Solution.java

@@ -1,6 +1,6 @@
 package g3401_3500.s3439_reschedule_meetings_for_maximum_free_time_i;
 
-// #Medium #2025_02_02_Time_2_(_%)_Space_63.63_(_%)
+// #Medium #Array #Greedy #Sliding_Window #2025_02_04_Time_2_(83.15%)_Space_63.84_(13.98%)
 
 public class Solution {
     public int maxFreeTime(int eventTime, int k, int[] startTime, int[] endTime) {

src/main/java/g3401_3500/s3440_reschedule_meetings_for_maximum_free_time_ii/Solution.java

@@ -1,6 +1,6 @@
 package g3401_3500.s3440_reschedule_meetings_for_maximum_free_time_ii;
 
-// #Medium #2025_02_02_Time_3_(100.00%)_Space_59.73_(100.00%)
+// #Medium #Array #Greedy #Enumeration #2025_02_04_Time_3_(100.00%)_Space_59.87_(86.57%)
 
 public class Solution {
     public int maxFreeTime(int eventTime, int[] startTime, int[] endTime) {

src/main/java/g3401_3500/s3441_minimum_cost_good_caption/Solution.java

@@ -1,6 +1,6 @@
 package g3401_3500.s3441_minimum_cost_good_caption;
 
-// #Hard #2025_02_02_Time_48_(100.00%)_Space_56.37_(100.00%)
+// #Hard #String #Dynamic_Programming #2025_02_04_Time_48_(96.00%)_Space_56.50_(89.33%)
 
 @SuppressWarnings({"java:S107", "java:S6541"})
 public class Solution {

src/main/java/g3401_3500/s3442_maximum_difference_between_even_and_odd_frequency_i/Solution.java

@@ -1,6 +1,6 @@
 package g3401_3500.s3442_maximum_difference_between_even_and_odd_frequency_i;
 
-// #Easy #2025_02_02_Time_1_(100.00%)_Space_42.30_(_%)
+// #Easy #String #Hash_Table #Counting #2025_02_04_Time_1_(100.00%)_Space_42.34_(92.25%)
 
 import java.util.Arrays;
 

src/main/java/g3401_3500/s3443_maximum_manhattan_distance_after_k_changes/Solution.java

@@ -1,28 +1,36 @@
 package g3401_3500.s3443_maximum_manhattan_distance_after_k_changes;
 
-// #Medium #2025_02_02_Time_189_(_%)_Space_45.65_(100.00%)
+// #Medium #String #Hash_Table #Math #Counting #2025_02_04_Time_50_(96.94%)_Space_45.89_(54.64%)
 
 public class Solution {
     public int maxDistance(String s, int k) {
-        int ans = 0;
-        char[][] dir = new char[][] {{'N', 'E'}, {'N', 'W'}, {'S', 'E'}, {'S', 'W'}};
-        for (char[] d : dir) {
-            int curr = 0;
-            int t = k;
-            for (int i = 0; i < s.length(); ++i) {
-                if (s.charAt(i) == d[0] || s.charAt(i) == d[1]) {
-                    if (t > 0) {
-                        t--;
-                        curr++;
-                    } else {
-                        curr--;
-                    }
-                } else {
-                    curr++;
-                }
-                ans = Math.max(ans, curr);
+        int n = 0;
+        int s = 0;
+        int w = 0;
+        int e = 0;
+        int result = 0;
+        for (char c : s.toCharArray()) {
+            if (c == 'N') {
+                n++;
+            } else if (c == 'S') {
+                s++;
+            } else if (c == 'E') {
+                e++;
+            } else if (c == 'W') {
+                w++;
+            }
+            int hMax = Math.max(n, s);
+            int vMax = Math.max(w, e);
+            int hMin = Math.min(n, s);
+            int vMin = Math.min(w, e);
+            if (hMin + vMin >= k) {
+                int curr = hMax + vMax + k - (hMin + vMin - k);
+                result = Math.max(result, curr);
+            } else {
+                int curr = hMax + vMax + hMin + vMin;
+                result = Math.max(result, curr);
             }
         }
-        return ans;
+        return result;
     }
 }

src/main/java/g3401_3500/s3444_minimum_increments_for_target_multiples_in_an_array/Solution.java

@@ -1,6 +1,7 @@
 package g3401_3500.s3444_minimum_increments_for_target_multiples_in_an_array;
 
-// #Hard #2025_02_02_Time_47_(100.00%)_Space_47.37_(100.00%)
+// #Hard #Array #Dynamic_Programming #Math #Bit_Manipulation #Bitmask #Number_Theory
+// #2025_02_04_Time_47_(95.85%)_Space_47.31_(56.40%)
 
 public class Solution {
     public int minimumIncrements(int[] nums, int[] target) {

src/main/java/g3401_3500/s3445_maximum_difference_between_even_and_odd_frequency_ii/Solution.java

@@ -1,6 +1,7 @@
 package g3401_3500.s3445_maximum_difference_between_even_and_odd_frequency_ii;
 
-// #Hard #2025_02_02_Time_97_(100.00%)_Space_52.67_(100.00%)
+// #Hard #String #Prefix_Sum #Sliding_Window #Enumeration
+// #2025_02_04_Time_94_(85.92%)_Space_53.24_(49.30%)
 
 import java.util.Arrays;