Updated tags

javadev · javadev · commit 9abc5aa3a329 · 2025-05-06T08:47:02.000+03:00
diff --git a/src/main/kotlin/g3501_3600/s3536_maximum_product_of_two_digits/Solution.kt b/src/main/kotlin/g3501_3600/s3536_maximum_product_of_two_digits/Solution.kt
@@ -1,6 +1,6 @@
 package g3501_3600.s3536_maximum_product_of_two_digits
 
-// #Easy #2025_05_04_Time_1_ms_(100.00%)_Space_40.93_MB_(100.00%)
+// #Easy #Math #Sorting #2025_05_04_Time_1_ms_(100.00%)_Space_40.93_MB_(100.00%)
 
 class Solution {
     fun maxProduct(n: Int): Int {
diff --git a/src/main/kotlin/g3501_3600/s3537_fill_a_special_grid/Solution.kt b/src/main/kotlin/g3501_3600/s3537_fill_a_special_grid/Solution.kt
@@ -1,6 +1,7 @@
 package g3501_3600.s3537_fill_a_special_grid
 
-// #Medium #2025_05_04_Time_2_ms_(100.00%)_Space_88.71_MB_(61.54%)
+// #Medium #Array #Matrix #Divide_and_Conquer
+// #2025_05_04_Time_2_ms_(100.00%)_Space_88.71_MB_(61.54%)
 
 import kotlin.math.pow
 
diff --git a/src/main/kotlin/g3501_3600/s3538_merge_operations_for_minimum_travel_time/Solution.kt b/src/main/kotlin/g3501_3600/s3538_merge_operations_for_minimum_travel_time/Solution.kt
@@ -1,6 +1,7 @@
 package g3501_3600.s3538_merge_operations_for_minimum_travel_time
 
-// #Hard #2025_05_04_Time_10_ms_(100.00%)_Space_46.96_MB_(100.00%)
+// #Hard #Array #Dynamic_Programming #Prefix_Sum
+// #2025_05_04_Time_10_ms_(100.00%)_Space_46.96_MB_(100.00%)
 
 import kotlin.math.min
 
diff --git a/src/main/kotlin/g3501_3600/s3539_find_sum_of_array_product_of_magical_sequences/Solution.kt b/src/main/kotlin/g3501_3600/s3539_find_sum_of_array_product_of_magical_sequences/Solution.kt
@@ -1,6 +1,7 @@
 package g3501_3600.s3539_find_sum_of_array_product_of_magical_sequences
 
-// #Hard #2025_05_04_Time_58_ms_(_%)_Space_49.73_MB_(_%)
+// #Hard #Array #Dynamic_Programming #Math #Bit_Manipulation #Bitmask #Combinatorics
+// #2025_05_04_Time_58_ms_(_%)_Space_49.73_MB_(_%)
 
 class Solution {
     fun magicalSum(m: Int, k: Int, nums: IntArray): Int {
