diff --git a/src/main/java/g3701_3800/s3762_minimum_operations_to_equalize_subarrays/Solution.java b/src/main/java/g3701_3800/s3762_minimum_operations_to_equalize_subarrays/Solution.java index f95f68fc3..29e43560d 100644 --- a/src/main/java/g3701_3800/s3762_minimum_operations_to_equalize_subarrays/Solution.java +++ b/src/main/java/g3701_3800/s3762_minimum_operations_to_equalize_subarrays/Solution.java @@ -1,6 +1,6 @@ package g3701_3800.s3762_minimum_operations_to_equalize_subarrays; -// #Hard #Array #Math #Binary_Search #Segment_Tree #Weekly_Contest_478 #Principal +// #Hard #Array #Math #Binary_Search #Segment_Tree #Principal #Weekly_Contest_478 // #2026_05_08_Time_528_ms_(100.00%)_Space_267.97_MB_(76.92%) import java.util.ArrayList; diff --git a/src/main/java/g3801_3900/s3812_minimum_edge_toggles_on_a_tree/Solution.java b/src/main/java/g3801_3900/s3812_minimum_edge_toggles_on_a_tree/Solution.java index 82f702c69..a5f7d133c 100644 --- a/src/main/java/g3801_3900/s3812_minimum_edge_toggles_on_a_tree/Solution.java +++ b/src/main/java/g3801_3900/s3812_minimum_edge_toggles_on_a_tree/Solution.java @@ -1,6 +1,6 @@ package g3801_3900.s3812_minimum_edge_toggles_on_a_tree; -// #Hard #Sorting #Depth_First_Search #Tree #Topological_Sort #Senior_Staff #Graph_Theory +// #Hard #Sorting #Depth_First_Search #Tree #Topological_Sort #Graph_Theory #Senior_Staff // #Biweekly_Contest_174 #2026_06_09_Time_89_ms_(86.67%)_Space_303.92_MB_(28.33%) import java.util.ArrayList; diff --git a/src/main/java/g3801_3900/s3887_incremental_even_weighted_cycle_queries/Solution.java b/src/main/java/g3801_3900/s3887_incremental_even_weighted_cycle_queries/Solution.java index eb2537b70..9a8ce17b1 100644 --- a/src/main/java/g3801_3900/s3887_incremental_even_weighted_cycle_queries/Solution.java +++ b/src/main/java/g3801_3900/s3887_incremental_even_weighted_cycle_queries/Solution.java @@ -1,6 +1,6 @@ package g3801_3900.s3887_incremental_even_weighted_cycle_queries; -// #Hard #Union_Find #Senior_Staff #Graph_Theory #Weekly_Contest_495 +// #Hard #Union_Find #Graph_Theory #Senior_Staff #Weekly_Contest_495 // #2026_08_13_Time_18_ms_(100.00%)_Space_262.39_MB_(65.96%) public class Solution { diff --git a/src/main/java/g3801_3900/s3898_find_the_degree_of_each_vertex/Solution.java b/src/main/java/g3801_3900/s3898_find_the_degree_of_each_vertex/Solution.java index 7f2d1622d..b3225439d 100644 --- a/src/main/java/g3801_3900/s3898_find_the_degree_of_each_vertex/Solution.java +++ b/src/main/java/g3801_3900/s3898_find_the_degree_of_each_vertex/Solution.java @@ -1,6 +1,6 @@ package g3801_3900.s3898_find_the_degree_of_each_vertex; -// #Easy #Array #Matrix #Mid_Level #Weekly_Contest_497 #Graph_Theory +// #Easy #Array #Matrix #Graph_Theory #Mid_Level #Weekly_Contest_497 // #2026_08_13_Time_1_ms_(100.00%)_Space_48.48_MB_(42.57%) public class Solution { diff --git a/src/main/java/g3901_4000/s3910_count_connected_subgraphs_with_even_node_sum/Solution.java b/src/main/java/g3901_4000/s3910_count_connected_subgraphs_with_even_node_sum/Solution.java index 421ea5c26..255bfe698 100644 --- a/src/main/java/g3901_4000/s3910_count_connected_subgraphs_with_even_node_sum/Solution.java +++ b/src/main/java/g3901_4000/s3910_count_connected_subgraphs_with_even_node_sum/Solution.java @@ -1,7 +1,7 @@ package g3901_4000.s3910_count_connected_subgraphs_with_even_node_sum; // #Hard #Array #Depth_First_Search #Breadth_First_Search #Bit_Manipulation #Union_Find #Enumeration -// #Senior_Staff #Graph_Theory #Biweekly_Contest_181 +// #Graph_Theory #Senior_Staff #Biweekly_Contest_181 // #2026_09_18_Time_2_ms_(100.00%)_Space_46.57_MB_(85.71%) public class Solution { diff --git a/src/main/java/g3901_4000/s3924_minimum_threshold_path_with_limited_heavy_edges/Solution.java b/src/main/java/g3901_4000/s3924_minimum_threshold_path_with_limited_heavy_edges/Solution.java index facc0900d..8fce06dc9 100644 --- a/src/main/java/g3901_4000/s3924_minimum_threshold_path_with_limited_heavy_edges/Solution.java +++ b/src/main/java/g3901_4000/s3924_minimum_threshold_path_with_limited_heavy_edges/Solution.java @@ -1,6 +1,6 @@ package g3901_4000.s3924_minimum_threshold_path_with_limited_heavy_edges; -// #Hard #Binary_Search #Senior_Staff #Biweekly_Contest_182 #Breadth_First_Search #Graph_Theory +// #Hard #Breadth_First_Search #Binary_Search #Graph_Theory #Senior_Staff #Biweekly_Contest_182 // #2026_09_29_Time_30_ms_(98.28%)_Space_47.81_MB_(58.62%) import java.util.ArrayDeque; diff --git a/src/main/java/g3901_4000/s3928_minimum_cost_to_buy_apples_ii/Solution.java b/src/main/java/g3901_4000/s3928_minimum_cost_to_buy_apples_ii/Solution.java index 78b74520f..c21666578 100644 --- a/src/main/java/g3901_4000/s3928_minimum_cost_to_buy_apples_ii/Solution.java +++ b/src/main/java/g3901_4000/s3928_minimum_cost_to_buy_apples_ii/Solution.java @@ -1,6 +1,6 @@ package g3901_4000.s3928_minimum_cost_to_buy_apples_ii; -// #Hard #Array #Heap_Priority_Queue #Shortest_Path #Senior_Staff #Graph_Theory #Weekly_Contest_501 +// #Hard #Array #Heap_Priority_Queue #Shortest_Path #Graph_Theory #Senior_Staff #Weekly_Contest_501 // #2026_09_29_Time_694_ms_(97.40%)_Space_49.62_MB_(84.42%) import java.util.ArrayList; diff --git a/src/main/java/g3901_4000/s3939_count_non_adjacent_subsets_in_a_rooted_tree/Solution.java b/src/main/java/g3901_4000/s3939_count_non_adjacent_subsets_in_a_rooted_tree/Solution.java index c4eb83656..bd92be233 100644 --- a/src/main/java/g3901_4000/s3939_count_non_adjacent_subsets_in_a_rooted_tree/Solution.java +++ b/src/main/java/g3901_4000/s3939_count_non_adjacent_subsets_in_a_rooted_tree/Solution.java @@ -1,6 +1,6 @@ package g3901_4000.s3939_count_non_adjacent_subsets_in_a_rooted_tree; -// #Hard #Array #Dynamic_Programming #Tree #Senior_Staff #Biweekly_Contest_183 #Depth_First_Search +// #Hard #Array #Dynamic_Programming #Depth_First_Search #Tree #Senior_Staff #Biweekly_Contest_183 // #2026_09_29_Time_83_ms_(94.12%)_Space_49.60_MB_(29.41%) import java.util.Arrays; diff --git a/src/main/java/g3901_4000/s3957_maximum_sum_of_m_non_overlapping_subarrays_ii/Solution.java b/src/main/java/g3901_4000/s3957_maximum_sum_of_m_non_overlapping_subarrays_ii/Solution.java index 0b12bec49..8a8eb9893 100644 --- a/src/main/java/g3901_4000/s3957_maximum_sum_of_m_non_overlapping_subarrays_ii/Solution.java +++ b/src/main/java/g3901_4000/s3957_maximum_sum_of_m_non_overlapping_subarrays_ii/Solution.java @@ -1,7 +1,7 @@ package g3901_4000.s3957_maximum_sum_of_m_non_overlapping_subarrays_ii; // #Hard #Array #Dynamic_Programming #Binary_Search #Prefix_Sum #Sliding_Window #Queue -// #Monotonic_Queue #Weekly_Contest_505 #Principal +// #Monotonic_Queue #Principal #Weekly_Contest_505 // #2026_10_20_Time_98_ms_(93.55%)_Space_104.56_MB_(90.32%) public class Solution { diff --git a/src/main/java/g3901_4000/s3965_finish_time_of_tasks_i/Solution.java b/src/main/java/g3901_4000/s3965_finish_time_of_tasks_i/Solution.java index fc65d7cc7..3d814e034 100644 --- a/src/main/java/g3901_4000/s3965_finish_time_of_tasks_i/Solution.java +++ b/src/main/java/g3901_4000/s3965_finish_time_of_tasks_i/Solution.java @@ -1,6 +1,6 @@ package g3901_4000.s3965_finish_time_of_tasks_i; -// #Medium #Array #Dynamic_Programming #Tree #Staff #Depth_First_Search #Biweekly_Contest_185 +// #Medium #Array #Dynamic_Programming #Depth_First_Search #Tree #Staff #Biweekly_Contest_185 // #2026_10_22_Time_9_ms_(99.36%)_Space_207.04_MB_(96.15%) public class Solution {