Updated

javadev · javadev · commit feb6da20929a · 2024-08-13T08:55:38.000+03:00
diff --git a/src/main/kotlin/g3201_3300/s3248_snake_in_matrix/Solution.kt b/src/main/kotlin/g3201_3300/s3248_snake_in_matrix/Solution.kt
@@ -1,6 +1,6 @@
 package g3201_3300.s3248_snake_in_matrix
 
-// #Easy #Array #String #Simulation #2024_08_13_Time_2_ms_(98.05%)_Space_44.4_MB_(66.96%)
+// #Easy #Array #String #Simulation #2024_08_13_Time_174_ms_(90.91%)_Space_37.5_MB_(34.09%)
 
 class Solution {
     fun finalPositionOfSnake(n: Int, commands: List<String>): Int {
diff --git a/src/main/kotlin/g3201_3300/s3249_count_the_number_of_good_nodes/Solution.kt b/src/main/kotlin/g3201_3300/s3249_count_the_number_of_good_nodes/Solution.kt
@@ -1,6 +1,6 @@
 package g3201_3300.s3249_count_the_number_of_good_nodes
 
-// #Medium #Tree #Depth_First_Search #2024_08_13_Time_34_ms_(100.00%)_Space_113.9_MB_(90.70%)
+// #Medium #Depth_First_Search #Tree #2024_08_13_Time_1190_ms_(100.00%)_Space_127.6_MB_(77.27%)
 
 class Solution {
     private var count = 0
diff --git a/src/main/kotlin/g3201_3300/s3250_find_the_count_of_monotonic_pairs_i/Solution.kt b/src/main/kotlin/g3201_3300/s3250_find_the_count_of_monotonic_pairs_i/Solution.kt
@@ -1,7 +1,7 @@
 package g3201_3300.s3250_find_the_count_of_monotonic_pairs_i
 
 // #Hard #Array #Dynamic_Programming #Math #Prefix_Sum #Combinatorics
-// #2024_08_13_Time_3_ms_(100.00%)_Space_44.7_MB_(99.34%)
+// #2024_08_13_Time_241_ms_(100.00%)_Space_39.2_MB_(100.00%)
 
 import kotlin.math.max
 import kotlin.math.min
diff --git a/src/main/kotlin/g3201_3300/s3251_find_the_count_of_monotonic_pairs_ii/Solution.kt b/src/main/kotlin/g3201_3300/s3251_find_the_count_of_monotonic_pairs_ii/Solution.kt
@@ -1,7 +1,7 @@
 package g3201_3300.s3251_find_the_count_of_monotonic_pairs_ii
 
 // #Hard #Array #Dynamic_Programming #Math #Prefix_Sum #Combinatorics
-// #2024_08_13_Time_24_ms_(100.00%)_Space_44.7_MB_(97.70%)
+// #2024_08_13_Time_291_ms_(100.00%)_Space_47_MB_(100.00%)
 
 import kotlin.math.max
 
