Updated tags

javadev · javadev · commit 1eb2028187ee · 2025-06-03T05:06:47.000+03:00
diff --git a/src/main/java/g0101_0200/s0178_rank_scores/script.sql b/src/main/java/g0101_0200/s0178_rank_scores/script.sql
@@ -7,4 +7,3 @@ FROM
     Scores
 ORDER BY
     Rank ASC;
-
diff --git a/src/main/java/g0101_0200/s0182_duplicate_emails/script.sql b/src/main/java/g0101_0200/s0182_duplicate_emails/script.sql
@@ -8,4 +8,3 @@ GROUP BY
     Email
 HAVING
     COUNT(Email) > 1;
-
diff --git a/src/main/java/g3501_3600/s3558_number_of_ways_to_assign_edge_weights_i/Solution.java b/src/main/java/g3501_3600/s3558_number_of_ways_to_assign_edge_weights_i/Solution.java
@@ -1,6 +1,6 @@
 package g3501_3600.s3558_number_of_ways_to_assign_edge_weights_i;
 
-// #Medium #Math #Tree #Depth_First_Search #2025_05_27_Time_12_ms_(100.00%)_Space_106.62_MB_(76.01%)
+// #Medium #Math #Depth_First_Search #Tree #2025_05_27_Time_12_ms_(100.00%)_Space_106.62_MB_(76.01%)
 
 public class Solution {
     private static int mod = (int) 1e9 + 7;
diff --git a/src/main/java/g3501_3600/s3559_number_of_ways_to_assign_edge_weights_ii/Solution.java b/src/main/java/g3501_3600/s3559_number_of_ways_to_assign_edge_weights_ii/Solution.java
@@ -1,6 +1,6 @@
 package g3501_3600.s3559_number_of_ways_to_assign_edge_weights_ii;
 
-// #Hard #Array #Dynamic_Programming #Math #Tree #Depth_First_Search
+// #Hard #Array #Dynamic_Programming #Math #Depth_First_Search #Tree
 // #2025_05_27_Time_138_ms_(64.66%)_Space_133.20_MB_(11.56%)
 
 import java.util.ArrayList;
diff --git a/src/main/java/g3501_3600/s3562_maximum_profit_from_trading_stocks_with_discounts/Solution.java b/src/main/java/g3501_3600/s3562_maximum_profit_from_trading_stocks_with_discounts/Solution.java
@@ -1,6 +1,6 @@
 package g3501_3600.s3562_maximum_profit_from_trading_stocks_with_discounts;
 
-// #Hard #Array #Dynamic_Programming #Tree #Depth_First_Search
+// #Hard #Array #Dynamic_Programming #Depth_First_Search #Tree
 // #2025_05_27_Time_27_ms_(100.00%)_Space_45.29_MB_(82.12%)
 
 import java.util.ArrayList;
diff --git a/src/main/java/g3501_3600/s3566_partition_array_into_two_equal_product_subsets/Solution.java b/src/main/java/g3501_3600/s3566_partition_array_into_two_equal_product_subsets/Solution.java
@@ -1,6 +1,7 @@
 package g3501_3600.s3566_partition_array_into_two_equal_product_subsets;
 
-// #Medium #2025_06_01_Time_0_ms_(100.00%)_Space_42.01_MB_(78.42%)
+// #Medium #Array #Bit_Manipulation #Recursion #Enumeration
+// #2025_06_03_Time_0_ms_(100.00%)_Space_42.45_MB_(36.66%)
 
 public class Solution {
     public boolean checkEqualPartitions(int[] nums, long target) {
diff --git a/src/main/java/g3501_3600/s3567_minimum_absolute_difference_in_sliding_submatrix/Solution.java b/src/main/java/g3501_3600/s3567_minimum_absolute_difference_in_sliding_submatrix/Solution.java
@@ -1,6 +1,6 @@
 package g3501_3600.s3567_minimum_absolute_difference_in_sliding_submatrix;
 
-// #Medium #2025_06_01_Time_7_ms_(99.65%)_Space_46.08_MB_(10.21%)
+// #Medium #Array #Sorting #Matrix #2025_06_03_Time_7_ms_(99.69%)_Space_45.24_MB_(99.03%)
 
 import java.util.Arrays;
 
diff --git a/src/main/java/g3501_3600/s3568_minimum_moves_to_clean_the_classroom/Solution.java b/src/main/java/g3501_3600/s3568_minimum_moves_to_clean_the_classroom/Solution.java
@@ -1,6 +1,7 @@
 package g3501_3600.s3568_minimum_moves_to_clean_the_classroom;
 
-// #Medium #2025_06_01_Time_90_ms_(100.00%)_Space_53.82_MB_(99.66%)
+// #Medium #Array #Hash_Table #Breadth_First_Search #Matrix #Bit_Manipulation
+// #2025_06_03_Time_94_ms_(99.86%)_Space_53.76_MB_(99.86%)
 
 import java.util.ArrayDeque;
 import java.util.ArrayList;
diff --git a/src/main/java/g3501_3600/s3569_maximize_count_of_distinct_primes_after_split/Solution.java b/src/main/java/g3501_3600/s3569_maximize_count_of_distinct_primes_after_split/Solution.java
@@ -1,6 +1,7 @@
 package g3501_3600.s3569_maximize_count_of_distinct_primes_after_split;
 
-// #Hard #2025_06_01_Time_294_ms_(96.15%)_Space_76.16_MB_(61.54%)
+// #Hard #Array #Math #Segment_Tree #Number_Theory
+// #2025_06_03_Time_280_ms_(97.30%)_Space_76.62_MB_(52.25%)
 
 import java.util.Arrays;
 import java.util.HashMap;

-Original file line number
+Diff line change
     Email
 HAVING
     COUNT(Email) > 1;
+-