Updated tags

javadev · javadev · commit 95c471db2722 · 2025-07-08T09:57:48.000+03:00
diff --git a/src/main/java/g3601_3700/s3602_hexadecimal_and_hexatrigesimal_conversion/Solution.java b/src/main/java/g3601_3700/s3602_hexadecimal_and_hexatrigesimal_conversion/Solution.java
@@ -1,6 +1,6 @@
 package g3601_3700.s3602_hexadecimal_and_hexatrigesimal_conversion;
 
-// #Easy #2025_07_06_Time_1_ms_(100.00%)_Space_42.14_MB_(100.00%)
+// #Easy #String #Math #2025_07_08_Time_2_ms_(100.00%)_Space_42.19_MB_(96.97%)
 
 public class Solution {
     public String concatHex36(int n) {
diff --git a/src/main/java/g3601_3700/s3603_minimum_cost_path_with_alternating_directions_ii/Solution.java b/src/main/java/g3601_3700/s3603_minimum_cost_path_with_alternating_directions_ii/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3603_minimum_cost_path_with_alternating_directions_ii;
 
-// #Medium #2025_07_06_Time_7_ms_(99.88%)_Space_64.11_MB_(100.00%)
+// #Medium #Array #Dynamic_Programming #Matrix
+// #2025_07_08_Time_6_ms_(100.00%)_Space_64.48_MB_(99.27%)
 
 public class Solution {
     public long minCost(int m, int n, int[][] waitCost) {
diff --git a/src/main/java/g3601_3700/s3604_minimum_time_to_reach_destination_in_directed_graph/Solution.java b/src/main/java/g3601_3700/s3604_minimum_time_to_reach_destination_in_directed_graph/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3604_minimum_time_to_reach_destination_in_directed_graph;
 
-// #Medium #2025_07_06_Time_5_ms_(100.00%)_Space_102.51_MB_(100.00%)
+// #Medium #Heap_Priority_Queue #Graph #Shortest_Path
+// #2025_07_08_Time_5_ms_(100.00%)_Space_102.82_MB_(98.27%)
 
 import java.util.Arrays;
 
diff --git a/src/main/java/g3601_3700/s3605_minimum_stability_factor_of_array/Solution.java b/src/main/java/g3601_3700/s3605_minimum_stability_factor_of_array/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3605_minimum_stability_factor_of_array;
 
-// #Hard #2025_07_06_Time_105_ms_(80.71%)_Space_64.43_MB_(_%)
+// #Hard #Array #Math #Greedy #Binary_Search #Segment_Tree #Number_Theory
+// #2025_07_08_Time_117_ms_(76.55%)_Space_63.59_MB_(36.28%)
 
 public class Solution {
     public int minStable(int[] nums, int maxC) {
diff --git a/src/main/java/g3601_3700/s3606_coupon_code_validator/Solution.java b/src/main/java/g3601_3700/s3606_coupon_code_validator/Solution.java
@@ -1,6 +1,6 @@
 package g3601_3700.s3606_coupon_code_validator;
 
-// #Easy #2025_07_06_Time_6_ms_(96.45%)_Space_45.62_MB_(86.71%)
+// #Easy #Array #String #Hash_Table #Sorting #2025_07_08_Time_6_ms_(96.35%)_Space_45.61_MB_(86.10%)
 
 import java.util.ArrayList;
 import java.util.HashSet;
diff --git a/src/main/java/g3601_3700/s3607_power_grid_maintenance/Solution.java b/src/main/java/g3601_3700/s3607_power_grid_maintenance/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3607_power_grid_maintenance;
 
-// #Medium #2025_07_06_Time_74_ms_(97.09%)_Space_131.74_MB_(75.90%)
+// #Medium #Array #Hash_Table #Depth_First_Search #Breadth_First_Search #Heap_Priority_Queue #Graph
+// #Union_Find #Ordered_Set #2025_07_08_Time_84_ms_(94.64%)_Space_131.60_MB_(76.86%)
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/main/java/g3601_3700/s3608_minimum_time_for_k_connected_components/Solution.java b/src/main/java/g3601_3700/s3608_minimum_time_for_k_connected_components/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3608_minimum_time_for_k_connected_components;
 
-// #Medium #2025_07_06_Time_34_ms_(99.90%)_Space_97.19_MB_(22.20%)
+// #Medium #Sorting #Binary_Search #Graph #Union_Find
+// #2025_07_08_Time_34_ms_(99.83%)_Space_97.36_MB_(23.12%)
 
 public class Solution {
     public int minTime(int n, int[][] edges, int k) {
diff --git a/src/main/java/g3601_3700/s3609_minimum_moves_to_reach_target_in_grid/Solution.java b/src/main/java/g3601_3700/s3609_minimum_moves_to_reach_target_in_grid/Solution.java
@@ -1,6 +1,6 @@
 package g3601_3700.s3609_minimum_moves_to_reach_target_in_grid;
 
-// #Hard #2025_07_06_Time_1_ms_(100.00%)_Space_40.89_MB_(95.45%)
+// #Hard #Math #2025_07_08_Time_1_ms_(99.42%)_Space_41.19_MB_(82.08%)
 
 public class Solution {
     public int minMoves(int sx, int sy, int tx, int ty) {
