diff --git a/src/main/java/g3501_3600/s3544_subtree_inversion_sum/Solution.java b/src/main/java/g3501_3600/s3544_subtree_inversion_sum/Solution.java
index 99e0346ec..7f62ceff2 100644
--- a/src/main/java/g3501_3600/s3544_subtree_inversion_sum/Solution.java
+++ b/src/main/java/g3501_3600/s3544_subtree_inversion_sum/Solution.java
@@ -1,6 +1,6 @@
 package g3501_3600.s3544_subtree_inversion_sum;
 
-// #Hard #Array #Dynamic_Programming #Tree #Depth_First_Search
+// #Hard #Array #Dynamic_Programming #Depth_First_Search #Tree
 // #2025_05_13_Time_159_ms_(89.47%)_Space_154.99_MB_(71.05%)
 
 import java.util.ArrayList;
diff --git a/src/main/java/g3501_3600/s3547_maximum_sum_of_edge_values_in_a_graph/Solution.java b/src/main/java/g3501_3600/s3547_maximum_sum_of_edge_values_in_a_graph/Solution.java
index 813df15ee..4d759e453 100644
--- a/src/main/java/g3501_3600/s3547_maximum_sum_of_edge_values_in_a_graph/Solution.java
+++ b/src/main/java/g3501_3600/s3547_maximum_sum_of_edge_values_in_a_graph/Solution.java
@@ -1,6 +1,6 @@
 package g3501_3600.s3547_maximum_sum_of_edge_values_in_a_graph;
 
-// #Hard #Sorting #Greedy #Graph #Depth_First_Search
+// #Hard #Sorting #Depth_First_Search #Greedy #Graph
 // #2025_05_13_Time_32_ms_(95.35%)_Space_63.82_MB_(98.45%)
 
 import java.util.ArrayList;