Improved tags

Author: javadev

src/main/java/g2801_2900/s2812_find_the_safest_path_in_a_grid/Solution.java

@@ -1,6 +1,6 @@
 package g2801_2900.s2812_find_the_safest_path_in_a_grid;
 
-// #Medium #Array #Binary_Search #Matrix #Union_Find #Breadth_First_Search
+// #Medium #Array #Breadth_First_Search #Binary_Search #Matrix #Union_Find
 // #2023_11_20_Time_57_ms_(100.00%)_Space_65.3_MB_(77.00%)
 
 import java.util.Arrays;

src/main/java/g2801_2900/s2850_minimum_moves_to_spread_stones_over_grid/Solution.java

@@ -1,6 +1,6 @@
 package g2801_2900.s2850_minimum_moves_to_spread_stones_over_grid;
 
-// #Medium #Array #Dynamic_Programming #Matrix #Breadth_First_Search
+// #Medium #Array #Dynamic_Programming #Breadth_First_Search #Matrix
 // #2023_12_15_Time_1_ms_(100.00%)_Space_40.5_MB_(89.16%)
 
 public class Solution {

src/main/java/g2801_2900/s2858_minimum_edge_reversals_so_every_node_is_reachable/Solution.java

@@ -1,13 +1,14 @@
 package g2801_2900.s2858_minimum_edge_reversals_so_every_node_is_reachable;
 
-// #Hard #Dynamic_Programming #Graph #Depth_First_Search #Breadth_First_Search
+// #Hard #Dynamic_Programming #Depth_First_Search #Breadth_First_Search #Graph
 // #2023_12_19_Time_52_ms_(92.31%)_Space_119.5_MB_(75.38%)
 
 import java.util.ArrayList;
 import java.util.LinkedList;
 import java.util.List;
 import java.util.Queue;
 
+@SuppressWarnings("unchecked")
 public class Solution {
  public int[] minEdgeReversals(int n, int[][] edges) {
  List<int[]>[] nexts = new List[n];

src/main/java/g2801_2900/s2867_count_valid_paths_in_a_tree/Solution.java

@@ -1,6 +1,6 @@
 package g2801_2900.s2867_count_valid_paths_in_a_tree;
 
-// #Hard #Dynamic_Programming #Math #Tree #Number_Theory #Depth_First_Search
+// #Hard #Dynamic_Programming #Math #Depth_First_Search #Tree #Number_Theory
 // #2023_12_20_Time_26_ms_(97.33%)_Space_84.2_MB_(80.00%)
 
 import java.util.ArrayList;

src/main/java/g2801_2900/s2872_maximum_number_of_k_divisible_components/Solution.java

@@ -1,6 +1,6 @@
 package g2801_2900.s2872_maximum_number_of_k_divisible_components;
 
-// #Hard #Dynamic_Programming #Tree #Depth_First_Search
+// #Hard #Dynamic_Programming #Depth_First_Search #Tree
 // #2023_12_21_Time_24_ms_(93.51%)_Space_65.3_MB_(19.48%)
 
 import java.util.ArrayList;