Added tags 2341-2344.

Author: javadev

README.md

@@ -1848,10 +1848,10 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
 
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|---------
-| 2344 |[Minimum Deletions to Make Array Divisible](src/main/java/g2301_2400/s2344_minimum_deletions_to_make_array_divisible/Solution.java)| Hard || 13 | 88.89
-| 2343 |[Query Kth Smallest Trimmed Number](src/main/java/g2301_2400/s2343_query_kth_smallest_trimmed_number/Solution.java)| Medium || 52 | 75.00
-| 2342 |[Max Sum of a Pair With Equal Sum of Digits](src/main/java/g2301_2400/s2342_max_sum_of_a_pair_with_equal_sum_of_digits/Solution.java)| Medium || 99 | 100.00
-| 2341 |[Maximum Number of Pairs in Array](src/main/java/g2301_2400/s2341_maximum_number_of_pairs_in_array/Solution.java)| Easy || 2 | 80.00
+| 2344 |[Minimum Deletions to Make Array Divisible](src/main/java/g2301_2400/s2344_minimum_deletions_to_make_array_divisible/Solution.java)| Hard | Array, Math, Sorting, Heap_Priority_Queue, Number_Theory | 13 | 88.89
+| 2343 |[Query Kth Smallest Trimmed Number](src/main/java/g2301_2400/s2343_query_kth_smallest_trimmed_number/Solution.java)| Medium | Array, String, Divide_and_Conquer, Sorting, Heap_Priority_Queue, Radix_Sort, Quickselect | 52 | 75.00
+| 2342 |[Max Sum of a Pair With Equal Sum of Digits](src/main/java/g2301_2400/s2342_max_sum_of_a_pair_with_equal_sum_of_digits/Solution.java)| Medium | Array, Hash_Table, Sorting, Heap_Priority_Queue | 99 | 100.00
+| 2341 |[Maximum Number of Pairs in Array](src/main/java/g2301_2400/s2341_maximum_number_of_pairs_in_array/Solution.java)| Easy | Array, Hash_Table, Sorting | 2 | 80.00
 | 2338 |[Count the Number of Ideal Arrays](src/main/java/g2301_2400/s2338_count_the_number_of_ideal_arrays/Solution.java)| Hard | Math, Dynamic_Programming, Combinatorics, Number_Theory | 21 | 99.04
 | 2337 |[Move Pieces to Obtain a String](src/main/java/g2301_2400/s2337_move_pieces_to_obtain_a_string/Solution.java)| Medium | Two_Pointers, String | 23 | 82.39
 | 2336 |[Smallest Number in Infinite Set](src/main/java/g2301_2400/s2336_smallest_number_in_infinite_set/SmallestInfiniteSet.java)| Medium | Hash_Table, Design, Heap_Priority_Queue | 12 | 96.69

src/main/java/g2301_2400/s2341_maximum_number_of_pairs_in_array/Solution.java

@@ -1,6 +1,6 @@
 package g2301_2400.s2341_maximum_number_of_pairs_in_array;
 
-// #Easy #2022_07_18_Time_2_ms_(80.00%)_Space_42.3_MB_(80.00%)
+// #Easy #Array #Hash_Table #Sorting #2022_07_18_Time_2_ms_(80.00%)_Space_42.3_MB_(80.00%)
 
 import java.util.Arrays;
 

src/main/java/g2301_2400/s2342_max_sum_of_a_pair_with_equal_sum_of_digits/Solution.java

@@ -1,6 +1,7 @@
 package g2301_2400.s2342_max_sum_of_a_pair_with_equal_sum_of_digits;
 
-// #Medium #2022_07_18_Time_99_ms_(100.00%)_Space_121.2_MB_(100.00%)
+// #Medium #Array #Hash_Table #Sorting #Heap_Priority_Queue
+// #2022_07_18_Time_99_ms_(100.00%)_Space_121.2_MB_(100.00%)
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/g2301_2400/s2343_query_kth_smallest_trimmed_number/Solution.java

@@ -1,6 +1,7 @@
 package g2301_2400.s2343_query_kth_smallest_trimmed_number;
 
-// #Medium #2022_07_19_Time_52_ms_(75.00%)_Space_58.8_MB_(37.50%)
+// #Medium #Array #String #Divide_and_Conquer #Sorting #Heap_Priority_Queue #Radix_Sort #Quickselect
+// #2022_07_19_Time_52_ms_(75.00%)_Space_58.8_MB_(37.50%)
 
 import java.util.ArrayList;
 import java.util.Arrays;

src/main/java/g2301_2400/s2344_minimum_deletions_to_make_array_divisible/Solution.java

@@ -1,6 +1,7 @@
 package g2301_2400.s2344_minimum_deletions_to_make_array_divisible;
 
-// #Hard #2022_07_19_Time_13_ms_(88.89%)_Space_77.2_MB_(77.78%)
+// #Hard #Array #Math #Sorting #Heap_Priority_Queue #Number_Theory
+// #2022_07_19_Time_13_ms_(88.89%)_Space_77.2_MB_(77.78%)
 
 public class Solution {
     public int minOperations(int[] nums, int[] numsDivide) {