Updated tags

javadev · javadev · commit 6fa1a6e0f45d · 2024-12-03T03:55:30.000+02:00
diff --git a/src/main/kotlin/g3301_3400/s3360_stone_removal_game/Solution.kt b/src/main/kotlin/g3301_3400/s3360_stone_removal_game/Solution.kt
@@ -1,6 +1,6 @@
 package g3301_3400.s3360_stone_removal_game
 
-// #Easy #2024_11_24_Time_0_ms_(100.00%)_Space_33.5_MB_(100.00%)
+// #Easy #Math #Simulation #2024_11_24_Time_0_ms_(100.00%)_Space_33.5_MB_(100.00%)
 
 class Solution {
     fun canAliceWin(n: Int): Boolean {
diff --git a/src/main/kotlin/g3301_3400/s3361_shift_distance_between_two_strings/Solution.kt b/src/main/kotlin/g3301_3400/s3361_shift_distance_between_two_strings/Solution.kt
@@ -1,6 +1,6 @@
 package g3301_3400.s3361_shift_distance_between_two_strings
 
-// #Medium #2024_11_24_Time_425_ms_(100.00%)_Space_41_MB_(100.00%)
+// #Medium #Array #String #Prefix_Sum #2024_11_24_Time_425_ms_(100.00%)_Space_41_MB_(100.00%)
 
 import kotlin.math.min
 
diff --git a/src/main/kotlin/g3301_3400/s3362_zero_array_transformation_iii/Solution.kt b/src/main/kotlin/g3301_3400/s3362_zero_array_transformation_iii/Solution.kt
@@ -1,6 +1,7 @@
 package g3301_3400.s3362_zero_array_transformation_iii
 
-// #Medium #2024_11_24_Time_217_ms_(100.00%)_Space_105.7_MB_(100.00%)
+// #Medium #Array #Sorting #Greedy #Heap_Priority_Queue #Prefix_Sum
+// #2024_11_24_Time_217_ms_(100.00%)_Space_105.7_MB_(100.00%)
 
 import java.util.PriorityQueue
 
diff --git a/src/main/kotlin/g3301_3400/s3363_find_the_maximum_number_of_fruits_collected/Solution.kt b/src/main/kotlin/g3301_3400/s3363_find_the_maximum_number_of_fruits_collected/Solution.kt
@@ -1,6 +1,6 @@
 package g3301_3400.s3363_find_the_maximum_number_of_fruits_collected
 
-// #Hard #2024_11_24_Time_53_ms_(100.00%)_Space_162_MB_(100.00%)
+// #Hard #Array #Dynamic_Programming #Matrix #2024_11_24_Time_53_ms_(100.00%)_Space_162_MB_(100.00%)
 
 import kotlin.math.max
 
diff --git a/src/main/kotlin/g3301_3400/s3364_minimum_positive_sum_subarray/Solution.kt b/src/main/kotlin/g3301_3400/s3364_minimum_positive_sum_subarray/Solution.kt
@@ -1,6 +1,6 @@
 package g3301_3400.s3364_minimum_positive_sum_subarray
 
-// #Easy #2024_11_24_Time_24_ms_(100.00%)_Space_38_MB_(100.00%)
+// #Easy #Array #Prefix_Sum #Sliding_Window #2024_11_24_Time_24_ms_(100.00%)_Space_38_MB_(100.00%)
 
 class Solution {
     fun minimumSumSubarray(nums: List<Int>, l: Int, r: Int): Int {
diff --git a/src/main/kotlin/g3301_3400/s3365_rearrange_k_substrings_to_form_target_string/Solution.kt b/src/main/kotlin/g3301_3400/s3365_rearrange_k_substrings_to_form_target_string/Solution.kt
@@ -1,6 +1,6 @@
 package g3301_3400.s3365_rearrange_k_substrings_to_form_target_string
 
-// #Medium #2024_11_24_Time_490_ms_(100.00%)_Space_50.5_MB_(100.00%)
+// #Medium #String #Hash_Table #Sorting #2024_11_24_Time_490_ms_(100.00%)_Space_50.5_MB_(100.00%)
 
 class Solution {
     fun isPossibleToRearrange(s: String, t: String, k: Int): Boolean {
diff --git a/src/main/kotlin/g3301_3400/s3366_minimum_array_sum/Solution.kt b/src/main/kotlin/g3301_3400/s3366_minimum_array_sum/Solution.kt
@@ -1,6 +1,6 @@
 package g3301_3400.s3366_minimum_array_sum
 
-// #Medium #2024_11_24_Time_59_ms_(100.00%)_Space_53.4_MB_(100.00%)
+// #Medium #Array #Dynamic_Programming #2024_11_24_Time_59_ms_(100.00%)_Space_53.4_MB_(100.00%)
 
 import kotlin.math.ceil
 import kotlin.math.min
diff --git a/src/main/kotlin/g3301_3400/s3367_maximize_sum_of_weights_after_edge_removals/Solution.kt b/src/main/kotlin/g3301_3400/s3367_maximize_sum_of_weights_after_edge_removals/Solution.kt
@@ -1,6 +1,7 @@
 package g3301_3400.s3367_maximize_sum_of_weights_after_edge_removals
 
-// #Hard #2024_11_27_Time_118_ms_(100.00%)_Space_140.5_MB_(100.00%)
+// #Hard #Dynamic_Programming #Depth_First_Search #Tree
+// #2024_11_27_Time_118_ms_(100.00%)_Space_140.5_MB_(100.00%)
 
 import java.util.PriorityQueue
 import kotlin.math.max
diff --git a/src/main/kotlin/g3301_3400/s3372_maximize_the_number_of_target_nodes_after_connecting_trees_i/Solution.kt b/src/main/kotlin/g3301_3400/s3372_maximize_the_number_of_target_nodes_after_connecting_trees_i/Solution.kt
@@ -1,6 +1,6 @@
 package g3301_3400.s3372_maximize_the_number_of_target_nodes_after_connecting_trees_i
 
-// #Medium #Tree #Depth_First_Search #Breadth_First_Search
+// #Medium #Depth_First_Search #Breadth_First_Search #Tree
 // #2024_12_03_Time_50_ms_(99.49%)_Space_75.7_MB_(5.10%)
 
 import kotlin.math.max
diff --git a/src/main/kotlin/g3301_3400/s3373_maximize_the_number_of_target_nodes_after_connecting_trees_ii/Solution.kt b/src/main/kotlin/g3301_3400/s3373_maximize_the_number_of_target_nodes_after_connecting_trees_ii/Solution.kt
@@ -1,6 +1,6 @@
 package g3301_3400.s3373_maximize_the_number_of_target_nodes_after_connecting_trees_ii
 
-// #Hard #Tree #Depth_First_Search #Breadth_First_Search
+// #Hard #Depth_First_Search #Breadth_First_Search #Tree
 // #2024_12_03_Time_26_ms_(98.75%)_Space_114.7_MB_(80.00%)
 
 import kotlin.math.max
