Updated tags

Author: javadev

src/main/java/g3501_3600/s3550_smallest_index_with_digit_sum_equal_to_index/Solution.java

@@ -1,6 +1,6 @@
 package g3501_3600.s3550_smallest_index_with_digit_sum_equal_to_index;
 
-// #Easy #2025_05_18_Time_1_ms_(100.00%)_Space_44.64_MB_(29.63%)
+// #Easy #Array #Math #2025_05_20_Time_1_ms_(100.00%)_Space_44.55_MB_(45.19%)
 
 public class Solution {
     private int sum(int num) {

src/main/java/g3501_3600/s3551_minimum_swaps_to_sort_by_digit_sum/Solution.java

@@ -1,6 +1,6 @@
 package g3501_3600.s3551_minimum_swaps_to_sort_by_digit_sum;
 
-// #Medium #2025_05_18_Time_211_ms_(99.38%)_Space_61.54_MB_(92.80%)
+// #Medium #Array #Hash_Table #Sorting #2025_05_20_Time_213_ms_(99.23%)_Space_62.28_MB_(84.68%)
 
 import java.util.Arrays;
 

src/main/java/g3501_3600/s3552_grid_teleportation_traversal/Solution.java

@@ -1,6 +1,7 @@
 package g3501_3600.s3552_grid_teleportation_traversal;
 
-// #Medium #2025_05_18_Time_139_ms_(99.44%)_Space_61.40_MB_(98.89%)
+// #Medium #Array #Hash_Table #Breadth_First_Search #Matrix
+// #2025_05_20_Time_146_ms_(98.62%)_Space_60.98_MB_(99.48%)
 
 import java.util.ArrayList;
 import java.util.LinkedList;

src/main/java/g3501_3600/s3553_minimum_weighted_subgraph_with_the_required_paths_ii/Solution.java

@@ -1,6 +1,6 @@
 package g3501_3600.s3553_minimum_weighted_subgraph_with_the_required_paths_ii;
 
-// #Hard #2025_05_18_Time_79_ms_(99.45%)_Space_109.90_MB_(66.85%)
+// #Hard #Array #Depth_First_Search #Tree #2025_05_20_Time_65_ms_(100.00%)_Space_135.10_MB_(31.63%)
 
 import java.util.ArrayList;
 import java.util.Arrays;