Updated tags

javadev · javadev · commit b3e43c73af09 · 2025-04-09T12:07:46.000+03:00
diff --git a/src/main/kotlin/g3501_3600/s3507_minimum_pair_removal_to_sort_array_i/Solution.kt b/src/main/kotlin/g3501_3600/s3507_minimum_pair_removal_to_sort_array_i/Solution.kt
@@ -1,6 +1,7 @@
 package g3501_3600.s3507_minimum_pair_removal_to_sort_array_i
 
-// #Easy #2025_04_06_Time_2_ms_(100.00%)_Space_43.00_MB_(100.00%)
+// #Easy #Array #Hash_Table #Heap_Priority_Queue #Simulation #Linked_List #Ordered_Set
+// #Doubly_Linked_List #2025_04_09_Time_2_ms_(100.00%)_Space_43.35_MB_(97.44%)
 
 class Solution {
     fun minimumPairRemoval(nums: IntArray): Int {
diff --git a/src/main/kotlin/g3501_3600/s3508_implement_router/Router.kt b/src/main/kotlin/g3501_3600/s3508_implement_router/Router.kt
@@ -1,6 +1,7 @@
 package g3501_3600.s3508_implement_router
 
-// #Medium #2025_04_06_Time_267_ms_(100.00%)_Space_172.86_MB_(85.71%)
+// #Medium #Array #Hash_Table #Binary_Search #Design #Ordered_Set #Queue
+// #2025_04_09_Time_202_ms_(100.00%)_Space_172.82_MB_(95.24%)
 
 import java.util.LinkedList
 import java.util.Queue
diff --git a/src/main/kotlin/g3501_3600/s3509_maximum_product_of_subsequences_with_an_alternating_sum_equal_to_k/Solution.kt b/src/main/kotlin/g3501_3600/s3509_maximum_product_of_subsequences_with_an_alternating_sum_equal_to_k/Solution.kt
@@ -1,6 +1,7 @@
 package g3501_3600.s3509_maximum_product_of_subsequences_with_an_alternating_sum_equal_to_k
 
-// #Hard #2025_04_06_Time_91_ms_(100.00%)_Space_59.23_MB_(100.00%)
+// #Hard #Array #Hash_Table #Dynamic_Programming
+// #2025_04_09_Time_99_ms_(96.30%)_Space_59.53_MB_(92.59%)
 
 import java.util.BitSet
 import kotlin.math.max
diff --git a/src/main/kotlin/g3501_3600/s3510_minimum_pair_removal_to_sort_array_ii/Solution.kt b/src/main/kotlin/g3501_3600/s3510_minimum_pair_removal_to_sort_array_ii/Solution.kt
@@ -1,6 +1,7 @@
 package g3501_3600.s3510_minimum_pair_removal_to_sort_array_ii
 
-// #Hard #2025_04_06_Time_291_ms_(100.00%)_Space_84.49_MB_(100.00%)
+// #Hard #Array #Hash_Table #Heap_Priority_Queue #Simulation #Linked_List #Ordered_Set
+// #Doubly_Linked_List #2025_04_09_Time_284_ms_(100.00%)_Space_80.60_MB_(90.91%)
 
 class Solution {
     fun minimumPairRemoval(nums: IntArray): Int {
