Updated tags

Author: javadev

src/main/kotlin/g3301_3400/s3375_minimum_operations_to_make_array_values_equal_to_k/Solution.kt

@@ -1,6 +1,6 @@
 package g3301_3400.s3375_minimum_operations_to_make_array_values_equal_to_k
 
-// #Easy #2024_12_08_Time_191_ms_(100.00%)_Space_39.9_MB_(100.00%)
+// #Easy #Array #Hash_Table #2024_12_08_Time_191_ms_(100.00%)_Space_39.9_MB_(100.00%)
 
 class Solution {
     fun minOperations(nums: IntArray, k: Int): Int {

src/main/kotlin/g3301_3400/s3376_minimum_time_to_break_locks_i/Solution.kt

@@ -1,6 +1,7 @@
 package g3301_3400.s3376_minimum_time_to_break_locks_i
 
-// #Medium #2024_12_08_Time_202_ms_(100.00%)_Space_40_MB_(100.00%)
+// #Medium #Array #Dynamic_Programming #Bit_Manipulation #Backtracking #Bitmask
+// #2024_12_08_Time_202_ms_(100.00%)_Space_40_MB_(100.00%)
 
 import kotlin.math.min
 

src/main/kotlin/g3301_3400/s3377_digit_operations_to_make_two_integers_equal/Solution.kt

@@ -1,6 +1,7 @@
 package g3301_3400.s3377_digit_operations_to_make_two_integers_equal
 
-// #Medium #2024_12_08_Time_215_ms_(100.00%)_Space_40.7_MB_(100.00%)
+// #Medium #Math #Heap_Priority_Queue #Graph #Shortest_Path #Number_Theory
+// #2024_12_08_Time_215_ms_(100.00%)_Space_40.7_MB_(100.00%)
 
 import java.util.PriorityQueue
 

src/main/kotlin/g3301_3400/s3378_count_connected_components_in_lcm_graph/Solution.kt

@@ -1,6 +1,7 @@
 package g3301_3400.s3378_count_connected_components_in_lcm_graph
 
-// #Hard #2024_12_08_Time_58_ms_(100.00%)_Space_54.4_MB_(100.00%)
+// #Hard #Array #Hash_Table #Math #Union_Find #Number_Theory
+// #2024_12_08_Time_58_ms_(100.00%)_Space_54.4_MB_(100.00%)
 
 class Solution {
     private class UnionFind(n: Int) {