Improved tags.

Author: javadev

README.md

@@ -1849,7 +1849,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.16'
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|---------
 | 2455 |[Average Value of Even Numbers That Are Divisible by Three](src/main/java/g2401_2500/s2455_average_value_of_even_numbers_that_are_divisible_by_three/Solution.java)| Easy | Array, Math | 1 | 100.00
-| 2454 |[Next Greater Element IV](src/main/java/g2401_2500/s2454_next_greater_element_iv/Solution.java)| Hard | Array, Sorting, Binary_Search, Stack, Monotonic_Stack, Heap_Priority_Queue | 29 | 95.84
+| 2454 |[Next Greater Element IV](src/main/java/g2401_2500/s2454_next_greater_element_iv/Solution.java)| Hard | Array, Sorting, Binary_Search, Stack, Heap_Priority_Queue, Monotonic_Stack | 29 | 95.84
 | 2453 |[Destroy Sequential Targets](src/main/java/g2401_2500/s2453_destroy_sequential_targets/Solution.java)| Medium | Array, Hash_Table, Counting | 33 | 96.27
 | 2452 |[Words Within Two Edits of Dictionary](src/main/java/g2401_2500/s2452_words_within_two_edits_of_dictionary/Solution.java)| Medium | Array, String | 16 | 70.33
 | 2451 |[Odd String Difference](src/main/java/g2401_2500/s2451_odd_string_difference/Solution.java)| Easy | String, Hash_Table, Math | 0 | 100.00
@@ -1861,7 +1861,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.16'
 | 2443 |[Sum of Number and Its Reverse](src/main/java/g2401_2500/s2443_sum_of_number_and_its_reverse/Solution.java)| Medium | Math, Enumeration | 265 | 80.33
 | 2442 |[Count Number of Distinct Integers After Reverse Operations](src/main/java/g2401_2500/s2442_count_number_of_distinct_integers_after_reverse_operations/Solution.java)| Medium | Array, Hash_Table, Math | 73 | 96.81
 | 2441 |[Largest Positive Integer That Exists With Its Negative](src/main/java/g2401_2500/s2441_largest_positive_integer_that_exists_with_its_negative/Solution.java)| Easy | Array, Hash_Table | 8 | 79.93
-| 2440 |[Create Components With Same Value](src/main/java/g2401_2500/s2440_create_components_with_same_value/Solution.java)| Hard | Array, Math, Tree, Enumeration, Depth_First_Search | 114 | 73.23
+| 2440 |[Create Components With Same Value](src/main/java/g2401_2500/s2440_create_components_with_same_value/Solution.java)| Hard | Array, Math, Depth_First_Search, Tree, Enumeration | 114 | 73.23
 | 2439 |[Minimize Maximum of Array](src/main/java/g2401_2500/s2439_minimize_maximum_of_array/Solution.java)| Medium | Array, Dynamic_Programming, Greedy, Binary_Search, Prefix_Sum | 10 | 90.25
 | 2438 |[Range Product Queries of Powers](src/main/java/g2401_2500/s2438_range_product_queries_of_powers/Solution.java)| Medium | Array, Bit_Manipulation, Prefix_Sum | 73 | 65.07
 | 2437 |[Number of Valid Clock Times](src/main/java/g2401_2500/s2437_number_of_valid_clock_times/Solution.java)| Easy | String, Enumeration | 0 | 100.00
@@ -1875,7 +1875,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.16'
 | 2427 |[Number of Common Factors](src/main/java/g2401_2500/s2427_number_of_common_factors/Solution.java)| Easy | Math, Enumeration, Number_Theory | 1 | 81.93
 | 2426 |[Number of Pairs Satisfying Inequality](src/main/java/g2401_2500/s2426_number_of_pairs_satisfying_inequality/Solution.java)| Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 12 | 99.69
 | 2425 |[Bitwise XOR of All Pairings](src/main/java/g2401_2500/s2425_bitwise_xor_of_all_pairings/Solution.java)| Medium | Array, Bit_Manipulation, Brainteaser | 5 | 38.15
-| 2424 |[Longest Uploaded Prefix](src/main/java/g2401_2500/s2424_longest_uploaded_prefix/LUPrefix.java)| Medium | Binary_Search, Design, Union_Find, Ordered_Set, Segment_Tree, Binary_Indexed_Tree, Heap_(Priority_Queue) | 35 | 99.68
+| 2424 |[Longest Uploaded Prefix](src/main/java/g2401_2500/s2424_longest_uploaded_prefix/LUPrefix.java)| Medium | Binary_Search, Design, Heap_Priority_Queue, Union_Find, Ordered_Set, Segment_Tree, Binary_Indexed_Tree | 35 | 99.68
 | 2423 |[Remove Letter To Equalize Frequency](src/main/java/g2401_2500/s2423_remove_letter_to_equalize_frequency/Solution.java)| Easy | String, Hash_Table, Counting | 1 | 75.41
 | 2421 |[Number of Good Paths](src/main/java/g2401_2500/s2421_number_of_good_paths/Solution.java)| Hard | Array, Tree, Graph, Union_Find | 31 | 99.43
 | 2420 |[Find All Good Indices](src/main/java/g2401_2500/s2420_find_all_good_indices/Solution.java)| Medium | Array, Dynamic_Programming, Prefix_Sum | 13 | 82.76

src/main/java/g2401_2500/s2424_longest_uploaded_prefix/LUPrefix.java

@@ -1,7 +1,7 @@
 package g2401_2500.s2424_longest_uploaded_prefix;
 
-// #Medium #Binary_Search #Design #Union_Find #Ordered_Set #Segment_Tree #Binary_Indexed_Tree
-// #Heap_(Priority_Queue) #2022_11_19_Time_35_ms_(99.68%)_Space_108.8_MB_(92.53%)
+// #Medium #Binary_Search #Design #Heap_Priority_Queue #Union_Find #Ordered_Set #Segment_Tree
+// #Binary_Indexed_Tree #2022_11_19_Time_35_ms_(99.68%)_Space_108.8_MB_(92.53%)
 
 public class LUPrefix {
     private boolean[] res;

src/main/java/g2401_2500/s2440_create_components_with_same_value/Solution.java

@@ -1,6 +1,6 @@
 package g2401_2500.s2440_create_components_with_same_value;
 
-// #Hard #Array #Math #Tree #Enumeration #Depth_First_Search
+// #Hard #Array #Math #Depth_First_Search #Tree #Enumeration
 // #2022_12_13_Time_114_ms_(73.23%)_Space_115.7_MB_(68.01%)
 
 import java.util.ArrayList;

src/main/java/g2401_2500/s2454_next_greater_element_iv/Solution.java

@@ -1,6 +1,6 @@
 package g2401_2500.s2454_next_greater_element_iv;
 
-// #Hard #Array #Sorting #Binary_Search #Stack #Monotonic_Stack #Heap_Priority_Queue
+// #Hard #Array #Sorting #Binary_Search #Stack #Heap_Priority_Queue #Monotonic_Stack
 // #2022_12_15_Time_29_ms_(95.84%)_Space_57.4_MB_(93.32%)
 
 import java.util.ArrayDeque;