Added tags for tasks 3652, 3653, 3655

Author: javadev

src/main/kotlin/g3601_3700/s3652_best_time_to_buy_and_sell_stock_using_strategy/Solution.kt

@@ -1,6 +1,7 @@
 package g3601_3700.s3652_best_time_to_buy_and_sell_stock_using_strategy
 
-// #Medium #Weekly_Contest_463 #2025_08_17_Time_5_ms_(94.85%)_Space_57.60_MB_(83.20%)
+// #Medium #Array #Prefix_Sum #Sliding_Window #Weekly_Contest_463
+// #2025_08_20_Time_6_ms_(100.00%)_Space_78.91_MB_(64.71%)
 
 import kotlin.math.max
 

src/main/kotlin/g3601_3700/s3653_xor_after_range_multiplication_queries_i/Solution.kt

@@ -1,6 +1,7 @@
 package g3601_3700.s3653_xor_after_range_multiplication_queries_i
 
-// #Medium #Weekly_Contest_463 #2025_08_17_Time_18_ms_(100.00%)_Space_45.66_MB_(56.67%)
+// #Medium #Array #Simulation #Divide_and_Conquer #Weekly_Contest_463
+// #2025_08_20_Time_26_ms_(100.00%)_Space_72.10_MB_(44.44%)
 
 class Solution {
     private fun modPow(a0: Long, e0: Long): Long {

src/main/kotlin/g3601_3700/s3654_minimum_sum_after_divisible_sum_deletions/Solution.kt

@@ -1,9 +1,9 @@
 package g3601_3700.s3654_minimum_sum_after_divisible_sum_deletions
 
-import kotlin.math.min
-
 // #Medium #Weekly_Contest_463 #2025_08_17_Time_17_ms_(98.16%)_Space_60.80_MB_(48.62%)
 
+import kotlin.math.min
+
 class Solution {
     fun minArraySum(nums: IntArray, k: Int): Long {
         val dp = LongArray(k)

src/main/kotlin/g3601_3700/s3655_xor_after_range_multiplication_queries_ii/Solution.kt

@@ -1,10 +1,9 @@
 package g3601_3700.s3655_xor_after_range_multiplication_queries_ii
 
-// #Hard #Weekly_Contest_463 #2025_08_17_Time_14_ms_(100.00%)_Space_131.67_MB_(10.65%)
+// #Hard #Array #Divide_and_Conquer #Weekly_Contest_463
+// #2025_08_20_Time_26_ms_(100.00%)_Space_137.89_MB_(50.00%)
 
 class Solution {
-    private val MOD = 1_000_000_007L
-
     private fun inv(a: Int): Int {
         var b = a.toLong()
         var r = 1L
@@ -24,7 +23,6 @@ class Solution {
         val b = kotlin.math.sqrt(n.toDouble()).toInt() + 1
         val byK = arrayOfNulls<Array<ArrayList<IntArray>?>>(b + 1)
         val big = ArrayList<IntArray>()
-
         for (q in queries) {
             val l = q[0]
             val r = q[1]
@@ -44,7 +42,6 @@ class Solution {
                 big.add(intArrayOf(l, r, k, v))
             }
         }
-
         for (k in 1..b) {
             val arr = byK[k] ?: continue
             for (res in 0 until k) {
@@ -89,4 +86,8 @@ class Solution {
         }
         return ans
     }
+
+    companion object {
+        private const val MOD = 1_000_000_007L
+    }
 }