Update tags

javadev · web-flow · commit 535eca81fabb · 2023-01-28T10:10:54.000+02:00
diff --git a/src/main/java/g2401_2500/s2467_most_profitable_path_in_a_tree/Solution.java b/src/main/java/g2401_2500/s2467_most_profitable_path_in_a_tree/Solution.java
@@ -1,6 +1,6 @@
 package g2401_2500.s2467_most_profitable_path_in_a_tree;
 
-// #Medium #Array #Tree #Graph #Depth_First_Search #Breadth_First_Search
+// #Medium #Array #Depth_First_Search #Breadth_First_Search #Tree #Graph
 // #2023_01_11_Time_20_ms_(100.00%)_Space_94_MB_(96.10%)
 
 import java.util.Arrays;
diff --git a/src/main/java/g2401_2500/s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level/Solution.java b/src/main/java/g2401_2500/s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level/Solution.java
@@ -1,6 +1,6 @@
 package g2401_2500.s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level;
 
-// #Medium #Tree #Binary_Tree #Breadth_First_Search
+// #Medium #Breadth_First_Search #Tree #Binary_Tree
 // #2023_01_24_Time_76_ms_(76.46%)_Space_66_MB_(63.11%)
 
 import com_github_leetcode.TreeNode;
diff --git a/src/main/java/g2401_2500/s2476_closest_nodes_queries_in_a_binary_search_tree/Solution.java b/src/main/java/g2401_2500/s2476_closest_nodes_queries_in_a_binary_search_tree/Solution.java
@@ -1,6 +1,6 @@
 package g2401_2500.s2476_closest_nodes_queries_in_a_binary_search_tree;
 
-// #Medium #Array #Tree #Binary_Search #Binary_Tree #Depth_First_Search
+// #Medium #Array #Depth_First_Search #Tree #Binary_Search #Binary_Tree
 // #2023_01_24_Time_185_ms_(51.92%)_Space_98.4_MB_(75.00%)
 
 import com_github_leetcode.TreeNode;
diff --git a/src/main/java/g2401_2500/s2477_minimum_fuel_cost_to_report_to_the_capital/Solution.java b/src/main/java/g2401_2500/s2477_minimum_fuel_cost_to_report_to_the_capital/Solution.java
@@ -1,6 +1,6 @@
 package g2401_2500.s2477_minimum_fuel_cost_to_report_to_the_capital;
 
-// #Medium #Tree #Graph #Breadth_First_Search #Depth_First_Search
+// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Graph
 // #2023_01_25_Time_70_ms_(72.49%)_Space_102.5_MB_(74.76%)
 
 import java.util.ArrayList;
diff --git a/src/main/java/g2401_2500/s2492_minimum_score_of_a_path_between_two_cities/Solution.java b/src/main/java/g2401_2500/s2492_minimum_score_of_a_path_between_two_cities/Solution.java
@@ -1,6 +1,6 @@
 package g2401_2500.s2492_minimum_score_of_a_path_between_two_cities;
 
-// #Medium #Graph #Union_Find #Depth_First_Search #Breadth_First_Search
+// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Union_Find
 // #2023_01_27_Time_13_ms_(92.82%)_Space_101.5_MB_(78.71%)
 
 import java.util.Arrays;
diff --git a/src/main/java/g2401_2500/s2493_divide_nodes_into_the_maximum_number_of_groups/Solution.java b/src/main/java/g2401_2500/s2493_divide_nodes_into_the_maximum_number_of_groups/Solution.java
@@ -1,6 +1,6 @@
 package g2401_2500.s2493_divide_nodes_into_the_maximum_number_of_groups;
 
-// #Hard #Graph #Union_Find #Breadth_First_Search
+// #Hard #Breadth_First_Search #Graph #Union_Find
 // #2023_01_27_Time_443_ms_(77.02%)_Space_47.8_MB_(77.54%)
 
 import java.util.ArrayList;
