Improved tags.

javadev · web-flow · commit b8acd93fcf63 · 2022-08-21T13:52:42.000+03:00
diff --git a/src/main/java/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/Solution.java b/src/main/java/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph;
 
-// #Medium #Depth_First_Search #Breadth_First_Search #Union_Find #Graph
+// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Union_Find
 // #2022_06_26_Time_32_ms_(100.00%)_Space_108.9_MB_(100.00%)
 
 import java.util.HashMap;
diff --git a/src/main/java/g2301_2400/s2317_maximum_xor_after_operations/Solution.java b/src/main/java/g2301_2400/s2317_maximum_xor_after_operations/Solution.java
@@ -1,7 +1,6 @@
 package g2301_2400.s2317_maximum_xor_after_operations;
 
-// #Medium #Array #Math #Bit_Manipulation
-// #2022_06_26_Time_1_ms_(100.00%)_Space_53.3_MB_(100.00%)
+// #Medium #Array #Math #Bit_Manipulation #2022_06_26_Time_1_ms_(100.00%)_Space_53.3_MB_(100.00%)
 
 public class Solution {
     public int maximumXOR(int[] nums) {
diff --git a/src/main/java/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/Solution.java b/src/main/java/g2301_2400/s2322_minimum_score_after_removals_on_a_tree/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2322_minimum_score_after_removals_on_a_tree;
 
-// #Hard #Array #Bit_Manipulation #Tree #Depth_First_Search
+// #Hard #Array #Depth_First_Search #Tree #Bit_Manipulation
 // #2022_06_30_Time_255_ms_(70.70%)_Space_117.2_MB_(57.14%)
 
 import java.util.ArrayList;
diff --git a/src/main/java/g2301_2400/s2325_decode_the_message/Solution.java b/src/main/java/g2301_2400/s2325_decode_the_message/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2325_decode_the_message;
 
-// #Easy #Hash_Table #String #2022_07_03_Time_7_ms_(42.86%)_Space_42.6_MB_(57.14%)
+// #Easy #String #Hash_Table #2022_07_03_Time_7_ms_(42.86%)_Space_42.6_MB_(57.14%)
 
 import java.util.HashMap;
 import java.util.Map;
diff --git a/src/main/java/g2301_2400/s2326_spiral_matrix_iv/Solution.java b/src/main/java/g2301_2400/s2326_spiral_matrix_iv/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2326_spiral_matrix_iv;
 
-// #Medium #Array #Linked_List #Matrix #Simulation
+// #Medium #Array #Matrix #Simulation #Linked_List
 // #2022_07_15_Time_12_ms_(85.48%)_Space_61.9_MB_(90.83%)
 
 import com_github_leetcode.ListNode;
diff --git a/src/main/java/g2301_2400/s2327_number_of_people_aware_of_a_secret/Solution.java b/src/main/java/g2301_2400/s2327_number_of_people_aware_of_a_secret/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2327_number_of_people_aware_of_a_secret;
 
-// #Medium #Dynamic_Programming #Queue #Simulation
+// #Medium #Dynamic_Programming #Simulation #Queue
 // #2022_07_04_Time_7_ms_(80.00%)_Space_44_MB_(10.00%)
 
 public class Solution {
diff --git a/src/main/java/g2301_2400/s2328_number_of_increasing_paths_in_a_grid/Solution.java b/src/main/java/g2301_2400/s2328_number_of_increasing_paths_in_a_grid/Solution.java
@@ -1,7 +1,7 @@
 package g2301_2400.s2328_number_of_increasing_paths_in_a_grid;
 
-// #Hard #Array #Dynamic_Programming #Depth_First_Search #Breadth_First_Search #Graph
-// #Topological_Sort #Memoization #Matrix #2022_07_04_Time_43_ms_(100.00%)_Space_89.1_MB_(63.64%)
+// #Hard #Array #Dynamic_Programming #Depth_First_Search #Breadth_First_Search #Matrix #Graph
+// #Memoization #Topological_Sort #2022_07_04_Time_43_ms_(100.00%)_Space_89.1_MB_(63.64%)
 
 public class Solution {
     private int help(int[][] a, int i, int j, int n, int m, int[][] dp) {
diff --git a/src/main/java/g2301_2400/s2331_evaluate_boolean_binary_tree/Solution.java b/src/main/java/g2301_2400/s2331_evaluate_boolean_binary_tree/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2331_evaluate_boolean_binary_tree;
 
-// #Easy #Binary_Search #Tree #Depth_First_Search
+// #Easy #Depth_First_Search #Tree #Binary_Search
 // #2022_07_10_Time_0_ms_(100.00%)_Space_46.1_MB_(85.71%)
 
 import com_github_leetcode.TreeNode;
diff --git a/src/main/java/g2301_2400/s2332_the_latest_time_to_catch_a_bus/Solution.java b/src/main/java/g2301_2400/s2332_the_latest_time_to_catch_a_bus/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2332_the_latest_time_to_catch_a_bus;
 
-// #Medium #Array #Two_Pointers #Binary_Search #Sorting
+// #Medium #Array #Sorting #Binary_Search #Two_Pointers
 // #2022_07_10_Time_28_ms_(100.00%)_Space_59.3_MB_(100.00%)
 
 import java.util.Arrays;
diff --git a/src/main/java/g2301_2400/s2337_move_pieces_to_obtain_a_string/Solution.java b/src/main/java/g2301_2400/s2337_move_pieces_to_obtain_a_string/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2337_move_pieces_to_obtain_a_string;
 
-// #Medium #Two_Pointers #String #2022_07_13_Time_23_ms_(82.39%)_Space_54.8_MB_(61.95%)
+// #Medium #String #Two_Pointers #2022_07_13_Time_23_ms_(82.39%)_Space_54.8_MB_(61.95%)
 
 public class Solution {
     public boolean canChange(String start, String target) {
diff --git a/src/main/java/g2301_2400/s2338_count_the_number_of_ideal_arrays/Solution.java b/src/main/java/g2301_2400/s2338_count_the_number_of_ideal_arrays/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2338_count_the_number_of_ideal_arrays;
 
-// #Hard #Math #Dynamic_Programming #Combinatorics #Number_Theory
+// #Hard #Dynamic_Programming #Math #Number_Theory #Combinatorics
 // #2022_07_13_Time_21_ms_(99.04%)_Space_46.3_MB_(81.25%)
 
 import java.util.Arrays;
diff --git a/src/main/java/g2301_2400/s2343_query_kth_smallest_trimmed_number/Solution.java b/src/main/java/g2301_2400/s2343_query_kth_smallest_trimmed_number/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2343_query_kth_smallest_trimmed_number;
 
-// #Medium #Array #String #Divide_and_Conquer #Sorting #Heap_Priority_Queue #Radix_Sort #Quickselect
+// #Medium #Array #String #Sorting #Heap_Priority_Queue #Divide_and_Conquer #Quickselect #Radix_Sort
 // #2022_07_19_Time_52_ms_(75.00%)_Space_58.8_MB_(37.50%)
 
 import java.util.ArrayList;
diff --git a/src/main/java/g2301_2400/s2347_best_poker_hand/Solution.java b/src/main/java/g2301_2400/s2347_best_poker_hand/Solution.java
@@ -1,7 +1,6 @@
 package g2301_2400.s2347_best_poker_hand;
 
-// #Easy #Array #Hash_Table #Counting
-// #2022_07_26_Time_1_ms_(76.92%)_Space_41.6_MB_(30.77%)
+// #Easy #Array #Hash_Table #Counting #2022_07_26_Time_1_ms_(76.92%)_Space_41.6_MB_(30.77%)
 
 import java.util.HashMap;
 
diff --git a/src/main/java/g2301_2400/s2351_first_letter_to_appear_twice/Solution.java b/src/main/java/g2301_2400/s2351_first_letter_to_appear_twice/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2351_first_letter_to_appear_twice;
 
-// #Easy #Hash_Table #String #Counting #2022_08_14_Time_0_ms_(100.00%)_Space_42.3_MB_(29.00%)
+// #Easy #String #Hash_Table #Counting #2022_08_14_Time_0_ms_(100.00%)_Space_42.3_MB_(29.00%)
 
 public class Solution {
     public char repeatedCharacter(String s) {
diff --git a/src/main/java/g2301_2400/s2358_maximum_number_of_groups_entering_a_competition/Solution.java b/src/main/java/g2301_2400/s2358_maximum_number_of_groups_entering_a_competition/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2358_maximum_number_of_groups_entering_a_competition;
 
-// #Medium #Array #Math #Binary_Search #Greedy
+// #Medium #Array #Math #Greedy #Binary_Search
 // #2022_08_14_Time_0_ms_(100.00%)_Space_70.5_MB_(27.33%)
 
 public class Solution {
diff --git a/src/main/java/g2301_2400/s2363_merge_similar_items/Solution.java b/src/main/java/g2301_2400/s2363_merge_similar_items/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2363_merge_similar_items;
 
-// #Easy #Array #Sorting #Hash_Table #Ordered_Set
+// #Easy #Array #Hash_Table #Sorting #Ordered_Set
 // #2022_08_14_Time_3_ms_(100.00%)_Space_43_MB_(100.00%)
 
 import java.util.ArrayList;
diff --git a/src/main/java/g2301_2400/s2365_task_scheduler_ii/Solution.java b/src/main/java/g2301_2400/s2365_task_scheduler_ii/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2365_task_scheduler_ii;
 
-// #Medium #Array #Simulation #Hash_Table #2022_08_14_Time_70_ms_(55.56%)_Space_123.3_MB_(11.11%)
+// #Medium #Array #Hash_Table #Simulation #2022_08_14_Time_70_ms_(55.56%)_Space_123.3_MB_(11.11%)
 
 import java.util.HashMap;
 
diff --git a/src/main/java/g2301_2400/s2367_number_of_arithmetic_triplets/Solution.java b/src/main/java/g2301_2400/s2367_number_of_arithmetic_triplets/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2367_number_of_arithmetic_triplets;
 
-// #Easy #Array #Enumeration #Hash_Table #Two_Pointers
+// #Easy #Array #Hash_Table #Two_Pointers #Enumeration
 // #2022_08_14_Time_3_ms_(66.67%)_Space_42.1_MB_(25.00%)
 
 import java.util.HashSet;
diff --git a/src/main/java/g2301_2400/s2368_reachable_nodes_with_restrictions/Solution.java b/src/main/java/g2301_2400/s2368_reachable_nodes_with_restrictions/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2368_reachable_nodes_with_restrictions;
 
-// #Medium #Array #Tree #Graph #Hash_Table #Depth_First_Search #Breadth_First_Search
+// #Medium #Array #Hash_Table #Depth_First_Search #Breadth_First_Search #Tree #Graph
 // #2022_08_16_Time_59_ms_(85.71%)_Space_89.6_MB_(85.71%)
 
 import java.util.ArrayDeque;
diff --git a/src/main/java/g2301_2400/s2374_node_with_highest_edge_score/Solution.java b/src/main/java/g2301_2400/s2374_node_with_highest_edge_score/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2374_node_with_highest_edge_score;
 
-// #Medium #Graph #Hash_Table #2022_08_19_Time_4_ms_(97.68%)_Space_85.4_MB_(85.92%)
+// #Medium #Hash_Table #Graph #2022_08_19_Time_4_ms_(97.68%)_Space_85.4_MB_(85.92%)
 
 public class Solution {
     public int edgeScore(int[] edges) {
diff --git a/src/main/java/g2301_2400/s2376_count_special_integers/Solution.java b/src/main/java/g2301_2400/s2376_count_special_integers/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2376_count_special_integers;
 
-// #Hard #Math #Dynamic_Programming #2022_08_19_Time_0_ms_(100.00%)_Space_39.1_MB_(95.76%)
+// #Hard #Dynamic_Programming #Math #2022_08_19_Time_0_ms_(100.00%)_Space_39.1_MB_(95.76%)
 
 public class Solution {
     private int[] cntMap;
