Updated tags

javadev · javadev · commit 1b76ef8f70e3 · 2025-07-08T09:59:07.000+03:00
diff --git a/src/main/kotlin/g3601_3700/s3602_hexadecimal_and_hexatrigesimal_conversion/Solution.kt b/src/main/kotlin/g3601_3700/s3602_hexadecimal_and_hexatrigesimal_conversion/Solution.kt
@@ -1,6 +1,6 @@
 package g3601_3700.s3602_hexadecimal_and_hexatrigesimal_conversion
 
-// #Easy #2025_07_07_Time_2_ms_(100.00%)_Space_41.91_MB_(100.00%)
+// #Easy #String #Math #2025_07_07_Time_2_ms_(100.00%)_Space_41.91_MB_(100.00%)
 
 class Solution {
     fun concatHex36(n: Int): String {
diff --git a/src/main/kotlin/g3601_3700/s3603_minimum_cost_path_with_alternating_directions_ii/Solution.kt b/src/main/kotlin/g3601_3700/s3603_minimum_cost_path_with_alternating_directions_ii/Solution.kt
@@ -1,6 +1,7 @@
 package g3601_3700.s3603_minimum_cost_path_with_alternating_directions_ii
 
-// #Medium #2025_07_07_Time_12_ms_(100.00%)_Space_84.57_MB_(100.00%)
+// #Medium #Array #Dynamic_Programming #Matrix
+// #2025_07_07_Time_12_ms_(100.00%)_Space_84.57_MB_(100.00%)
 
 import kotlin.math.min
 
diff --git a/src/main/kotlin/g3601_3700/s3604_minimum_time_to_reach_destination_in_directed_graph/Solution.kt b/src/main/kotlin/g3601_3700/s3604_minimum_time_to_reach_destination_in_directed_graph/Solution.kt
@@ -1,6 +1,7 @@
 package g3601_3700.s3604_minimum_time_to_reach_destination_in_directed_graph
 
-// #Medium #2025_07_07_Time_18_ms_(100.00%)_Space_132.61_MB_(100.00%)
+// #Medium #Heap_Priority_Queue #Graph #Shortest_Path
+// #2025_07_07_Time_18_ms_(100.00%)_Space_132.61_MB_(100.00%)
 
 import kotlin.math.max
 
diff --git a/src/main/kotlin/g3601_3700/s3605_minimum_stability_factor_of_array/Solution.kt b/src/main/kotlin/g3601_3700/s3605_minimum_stability_factor_of_array/Solution.kt
@@ -1,6 +1,7 @@
 package g3601_3700.s3605_minimum_stability_factor_of_array
 
-// #Hard #2025_07_07_Time_95_ms_(100.00%)_Space_77.89_MB_(100.00%)
+// #Hard #Array #Math #Greedy #Binary_Search #Segment_Tree #Number_Theory
+// #2025_07_07_Time_95_ms_(100.00%)_Space_77.89_MB_(100.00%)
 
 class Solution {
     fun minStable(nums: IntArray, maxC: Int): Int {
diff --git a/src/main/kotlin/g3601_3700/s3606_coupon_code_validator/Solution.kt b/src/main/kotlin/g3601_3700/s3606_coupon_code_validator/Solution.kt
@@ -1,6 +1,7 @@
 package g3601_3700.s3606_coupon_code_validator
 
-// #Easy #2025_07_07_Time_32_ms_(100.00%)_Space_60.79_MB_(100.00%)
+// #Easy #Array #String #Hash_Table #Sorting
+// #2025_07_07_Time_32_ms_(100.00%)_Space_60.79_MB_(100.00%)
 
 class Solution {
     fun validateCoupons(code: Array<String>, businessLine: Array<String>, isActive: BooleanArray): List<String> {
diff --git a/src/main/kotlin/g3601_3700/s3607_power_grid_maintenance/Solution.kt b/src/main/kotlin/g3601_3700/s3607_power_grid_maintenance/Solution.kt
@@ -1,6 +1,7 @@
 package g3601_3700.s3607_power_grid_maintenance
 
-// #Medium #2025_07_07_Time_91_ms_(100.00%)_Space_165.69_MB_(93.75%)
+// #Medium #Array #Hash_Table #Depth_First_Search #Breadth_First_Search #Heap_Priority_Queue #Graph
+// #Union_Find #Ordered_Set #2025_07_07_Time_91_ms_(100.00%)_Space_165.69_MB_(93.75%)
 
 import java.util.PriorityQueue
 
diff --git a/src/main/kotlin/g3601_3700/s3608_minimum_time_for_k_connected_components/Solution.kt b/src/main/kotlin/g3601_3700/s3608_minimum_time_for_k_connected_components/Solution.kt
@@ -1,6 +1,7 @@
 package g3601_3700.s3608_minimum_time_for_k_connected_components
 
-// #Medium #2025_07_07_Time_31_ms_(100.00%)_Space_114.78_MB_(100.00%)
+// #Medium #Sorting #Binary_Search #Graph #Union_Find
+// #2025_07_07_Time_31_ms_(100.00%)_Space_114.78_MB_(100.00%)
 
 class Solution {
     fun minTime(n: Int, edges: Array<IntArray>, k: Int): Int {
diff --git a/src/main/kotlin/g3601_3700/s3609_minimum_moves_to_reach_target_in_grid/Solution.kt b/src/main/kotlin/g3601_3700/s3609_minimum_moves_to_reach_target_in_grid/Solution.kt
@@ -1,6 +1,6 @@
 package g3601_3700.s3609_minimum_moves_to_reach_target_in_grid
 
-// #Hard #2025_07_07_Time_1_ms_(100.00%)_Space_40.67_MB_(100.00%)
+// #Hard #Math #2025_07_07_Time_1_ms_(100.00%)_Space_40.67_MB_(100.00%)
 
 class Solution {
     fun minMoves(sx: Int, sy: Int, tx: Int, ty: Int): Int {
