Updated tags

Author: javadev

src/main/kotlin/g3501_3600/s3512_minimum_operations_to_make_array_sum_divisible_by_k/Solution.kt

@@ -1,6 +1,6 @@
 package g3501_3600.s3512_minimum_operations_to_make_array_sum_divisible_by_k
 
-// #Easy #2025_04_13_Time_1_ms_(100.00%)_Space_50.22_MB_(100.00%)
+// #Easy #Array #Math #2025_04_13_Time_1_ms_(100.00%)_Space_50.22_MB_(100.00%)
 
 class Solution {
     fun minOperations(nums: IntArray, k: Int): Int {

src/main/kotlin/g3501_3600/s3513_number_of_unique_xor_triplets_i/Solution.kt

@@ -1,6 +1,6 @@
 package g3501_3600.s3513_number_of_unique_xor_triplets_i
 
-// #Medium #2025_04_13_Time_1_ms_(100.00%)_Space_89.00_MB_(100.00%)
+// #Medium #Array #Math #Bit_Manipulation #2025_04_13_Time_1_ms_(100.00%)_Space_89.00_MB_(100.00%)
 
 class Solution {
     fun uniqueXorTriplets(nums: IntArray): Int {

src/main/kotlin/g3501_3600/s3514_number_of_unique_xor_triplets_ii/Solution.kt

@@ -1,6 +1,7 @@
 package g3501_3600.s3514_number_of_unique_xor_triplets_ii
 
-// #Medium #2025_04_13_Time_778_ms_(100.00%)_Space_61.80_MB_(100.00%)
+// #Medium #Array #Math #Bit_Manipulation #Enumeration
+// #2025_04_13_Time_778_ms_(100.00%)_Space_61.80_MB_(100.00%)
 
 import java.util.BitSet
 

src/main/kotlin/g3501_3600/s3515_shortest_path_in_a_weighted_tree/Solution.kt

@@ -1,6 +1,7 @@
 package g3501_3600.s3515_shortest_path_in_a_weighted_tree
 
-// #Hard #2025_04_13_Time_72_ms_(100.00%)_Space_188.48_MB_(100.00%)
+// #Hard #Array #Depth_First_Search #Tree #Segment_Tree #Binary_Indexed_Tree
+// #2025_04_13_Time_72_ms_(100.00%)_Space_188.48_MB_(100.00%)
 
 class Solution {
     private lateinit var `in`: IntArray