Added tags.

Author: javadev

README.md

@@ -1487,10 +1487,10 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
 |------|----------------|-------------|-------------|----------|---------
 | 2320 |[Count Number of Ways to Place Houses](src/main/java/g2301_2400/s2320_count_number_of_ways_to_place_houses/Solution.java)| Medium | Dynamic_Programming | 13 | 82.46
 | 2319 |[Check if Matrix Is X-Matrix](src/main/java/g2301_2400/s2319_check_if_matrix_is_x_matrix/Solution.java)| Easy | Array, Matrix | 3 | 53.58
-| 2318 |[Number of Distinct Roll Sequences](src/main/java/g2301_2400/s2318_number_of_distinct_roll_sequences/Solution.java)| Hard || 254 | 91.67
-| 2317 |[Maximum XOR After Operations](src/main/java/g2301_2400/s2317_maximum_xor_after_operations/Solution.java)| Medium || 1 | 100.00
-| 2316 |[Count Unreachable Pairs of Nodes in an Undirected Graph](src/main/java/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/Solution.java)| Medium || 32 | 100.00
-| 2315 |[Count Asterisks](src/main/java/g2301_2400/s2315_count_asterisks/Solution.java)| Easy || 1 | 100.00
+| 2318 |[Number of Distinct Roll Sequences](src/main/java/g2301_2400/s2318_number_of_distinct_roll_sequences/Solution.java)| Hard | Dynamic_Programming, Memoization | 254 | 91.67
+| 2317 |[Maximum XOR After Operations](src/main/java/g2301_2400/s2317_maximum_xor_after_operations/Solution.java)| Medium | Array, Math, Bit_Manipulation | 1 | 100.00
+| 2316 |[Count Unreachable Pairs of Nodes in an Undirected Graph](src/main/java/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Union_Find, Graph | 32 | 100.00
+| 2315 |[Count Asterisks](src/main/java/g2301_2400/s2315_count_asterisks/Solution.java)| Easy | String | 1 | 100.00
 | 2312 |[Selling Pieces of Wood](src/main/java/g2301_2400/s2312_selling_pieces_of_wood/Solution.java)| Hard | Backtracking | 78 | 63.64
 | 2311 |[Longest Binary Subsequence Less Than or Equal to K](src/main/java/g2301_2400/s2311_longest_binary_subsequence_less_than_or_equal_to_k/Solution.java)| Medium | String, Dynamic_Programming, Greedy, Memoization | 1 | 100.00
 | 2310 |[Sum of Numbers With Units Digit K](src/main/java/g2301_2400/s2310_sum_of_numbers_with_units_digit_k/Solution.java)| Medium | Math | 1 | 66.67

src/main/java/g2301_2400/s2315_count_asterisks/Solution.java

@@ -1,6 +1,6 @@
 package g2301_2400.s2315_count_asterisks;
 
-// #Easy #2022_06_26_Time_1_ms_(100.00%)_Space_42.2_MB_(57.14%)
+// #Easy #String #2022_06_26_Time_1_ms_(100.00%)_Space_42.2_MB_(57.14%)
 
 public class Solution {
     public int countAsterisks(String s) {

src/main/java/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/Solution.java

@@ -1,6 +1,7 @@
 package g2301_2400.s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph;
 
-// #Medium #2022_06_26_Time_32_ms_(100.00%)_Space_108.9_MB_(100.00%)
+// #Medium #Depth_First_Search #Breadth_First_Search #Union_Find #Graph
+// #2022_06_26_Time_32_ms_(100.00%)_Space_108.9_MB_(100.00%)
 
 import java.util.HashMap;
 

src/main/java/g2301_2400/s2317_maximum_xor_after_operations/Solution.java

@@ -1,6 +1,7 @@
 package g2301_2400.s2317_maximum_xor_after_operations;
 
-// #Medium #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) {

src/main/java/g2301_2400/s2318_number_of_distinct_roll_sequences/Solution.java

@@ -1,6 +1,6 @@
 package g2301_2400.s2318_number_of_distinct_roll_sequences;
 
-// #Hard #2022_06_26_Time_254_ms_(91.67%)_Space_51.6_MB_(58.33%)
+// #Hard #Dynamic_Programming #Memoization #2022_06_26_Time_254_ms_(91.67%)_Space_51.6_MB_(58.33%)
 
 public class Solution {
     private int[][][] memo = new int[10001][7][7];