Updated tags

javadev · javadev · commit f445e1508d03 · 2025-03-06T12:04:32.000+02:00
diff --git a/src/main/kotlin/g3401_3500/s3467_transform_array_by_parity/Solution.kt b/src/main/kotlin/g3401_3500/s3467_transform_array_by_parity/Solution.kt
@@ -1,6 +1,6 @@
 package g3401_3500.s3467_transform_array_by_parity
 
-// #Easy #2025_03_06_Time_1_ms_(100.00%)_Space_38.10_MB_(100.00%)
+// #Easy #Array #Sorting #Counting #2025_03_06_Time_1_ms_(100.00%)_Space_45.41_MB_(5.41%)
 
 class Solution {
     fun transformArray(nums: IntArray): IntArray {
diff --git a/src/main/kotlin/g3401_3500/s3468_find_the_number_of_copy_arrays/Solution.kt b/src/main/kotlin/g3401_3500/s3468_find_the_number_of_copy_arrays/Solution.kt
@@ -1,6 +1,6 @@
 package g3401_3500.s3468_find_the_number_of_copy_arrays
 
-// #Medium #2025_03_02_Time_4_ms_(100.00%)_Space_112.45_MB_(100.00%)
+// #Medium #Array #Math #2025_03_06_Time_3_ms_(100.00%)_Space_111.85_MB_(22.73%)
 
 import kotlin.math.max
 import kotlin.math.min
diff --git a/src/main/kotlin/g3401_3500/s3469_find_minimum_cost_to_remove_array_elements/Solution.kt b/src/main/kotlin/g3401_3500/s3469_find_minimum_cost_to_remove_array_elements/Solution.kt
@@ -1,6 +1,6 @@
 package g3401_3500.s3469_find_minimum_cost_to_remove_array_elements
 
-// #Medium #2025_03_06_Time_51_ms_(100.00%)_Space_46.26_MB_(100.00%)
+// #Medium #Array #Dynamic_Programming #2025_03_06_Time_27_ms_(100.00%)_Space_49.13_MB_(93.33%)
 
 import kotlin.math.max
 import kotlin.math.min
diff --git a/src/main/kotlin/g3401_3500/s3470_permutations_iv/Solution.kt b/src/main/kotlin/g3401_3500/s3470_permutations_iv/Solution.kt
@@ -1,6 +1,7 @@
 package g3401_3500.s3470_permutations_iv
 
-// #Hard #2025_03_02_Time_63_ms_(100.00%)_Space_38.70_MB_(100.00%)
+// #Hard #Array #Math #Enumeration #Combinatorics
+// #2025_03_06_Time_21_ms_(25.81%)_Space_47.38_MB_(6.45%)
 
 class Solution {
     private fun helper(a: Int, b: Int): Long {
diff --git a/src/main/kotlin/g3401_3500/s3471_find_the_largest_almost_missing_integer/Solution.kt b/src/main/kotlin/g3401_3500/s3471_find_the_largest_almost_missing_integer/Solution.kt
@@ -1,6 +1,6 @@
 package g3401_3500.s3471_find_the_largest_almost_missing_integer
 
-// #Easy #2025_03_02_Time_10_ms_(100.00%)_Space_37.57_MB_(100.00%)
+// #Easy #Array #Hash_Table #2025_03_06_Time_6_ms_(86.49%)_Space_46.27_MB_(5.41%)
 
 class Solution {
     fun largestInteger(nums: IntArray, k: Int): Int {
diff --git a/src/main/kotlin/g3401_3500/s3472_longest_palindromic_subsequence_after_at_most_k_operations/Solution.kt b/src/main/kotlin/g3401_3500/s3472_longest_palindromic_subsequence_after_at_most_k_operations/Solution.kt
@@ -1,6 +1,6 @@
 package g3401_3500.s3472_longest_palindromic_subsequence_after_at_most_k_operations
 
-// #Medium #2025_03_02_Time_137_ms_(100.00%)_Space_99.18_MB_(100.00%)
+// #Medium #String #Dynamic_Programming #2025_03_06_Time_142_ms_(55.00%)_Space_116.30_MB_(10.00%)
 
 import kotlin.math.abs
 import kotlin.math.max
diff --git a/src/main/kotlin/g3401_3500/s3473_sum_of_k_subarrays_with_length_at_least_m/Solution.kt b/src/main/kotlin/g3401_3500/s3473_sum_of_k_subarrays_with_length_at_least_m/Solution.kt
@@ -1,6 +1,7 @@
 package g3401_3500.s3473_sum_of_k_subarrays_with_length_at_least_m
 
-// #Medium #2025_03_02_Time_305_ms_(100.00%)_Space_76.92_MB_(100.00%)
+// #Medium #Array #Dynamic_Programming #Prefix_Sum
+// #2025_03_06_Time_227_ms_(24.47%)_Space_99.61_MB_(48.94%)
 
 import kotlin.math.max
 
diff --git a/src/main/kotlin/g3401_3500/s3474_lexicographically_smallest_generated_string/Solution.kt b/src/main/kotlin/g3401_3500/s3474_lexicographically_smallest_generated_string/Solution.kt
@@ -1,6 +1,6 @@
 package g3401_3500.s3474_lexicographically_smallest_generated_string
 
-// #Hard #2025_03_02_Time_41_ms_(100.00%)_Space_39.75_MB_(100.00%)
+// #Hard #String #Greedy #String_Matching #2025_03_06_Time_30_ms_(100.00%)_Space_46.67_MB_(20.00%)
 
 class Solution {
     fun generateString(str1: String, str2: String): String {
