Updated tags

Author: javadev

src/main/kotlin/g3501_3600/s3556_sum_of_largest_prime_substrings/Solution.kt

@@ -1,6 +1,6 @@
 package g3501_3600.s3556_sum_of_largest_prime_substrings
 
-// #Medium #2025_05_25_Time_21_ms_(100.00%)_Space_42.82_MB_(100.00%)
+// #Medium #2025_05_25_Time_25_ms_(100.00%)_Space_43.67_MB_(100.00%)
 
 class Solution {
     fun sumOfLargestPrimes(s: String): Long {

src/main/kotlin/g3501_3600/s3557_find_maximum_number_of_non_intersecting_substrings/Solution.kt

@@ -1,10 +1,10 @@
 package g3501_3600.s3557_find_maximum_number_of_non_intersecting_substrings
 
+// #Medium #2025_05_25_Time_57_ms_(100.00%)_Space_55.58_MB_(100.00%)
+
 import java.util.LinkedList
 import kotlin.math.max
 
-// #Medium #2025_05_25_Time_103_ms_(100.00%)_Space_54.87_MB_(100.00%)
-
 class Solution {
     fun maxSubstrings(s: String): Int {
         val last: Array<LinkedList<Int>> = Array(26) { LinkedList() }

src/main/kotlin/g3501_3600/s3558_number_of_ways_to_assign_edge_weights_i/Solution.kt

@@ -1,24 +1,25 @@
 package g3501_3600.s3558_number_of_ways_to_assign_edge_weights_i
 
-import java.util.*
+// #Medium #2025_05_25_Time_160_ms_(100.00%)_Space_149.66_MB_(100.00%)
 
-// #Medium #2025_05_25_Time_118_ms_(100.00%)_Space_122.30_MB_(100.00%)
+import java.util.LinkedList
+import java.util.Queue
 
 class Solution {
     fun assignEdgeWeights(edges: Array<IntArray>): Int {
         val n = edges.size + 1
-        val adj: MutableList<MutableList<Int?>?> = ArrayList<MutableList<Int?>?>()
+        val adj: MutableList<MutableList<Int>> = ArrayList<MutableList<Int>>()
         for (i in 0..n) {
-            adj.add(ArrayList<Int?>())
+            adj.add(ArrayList<Int>())
         }
         for (i in edges) {
-            adj.get(i[0])!!.add(i[1])
-            adj.get(i[1])!!.add(i[0])
+            adj[i[0]].add(i[1])
+            adj[i[1]].add(i[0])
         }
         val l = IntArray(n + 1)
         var max = 0
-        Arrays.fill(l, -1)
-        val q: Queue<IntArray?> = LinkedList<IntArray?>()
+        l.fill(-1)
+        val q: Queue<IntArray> = LinkedList<IntArray>()
         q.offer(intArrayOf(1, 0))
         l[1] = 0
         while (!q.isEmpty()) {
@@ -28,8 +29,8 @@ class Solution {
                 max = curr
             }
             q.remove()
-            for (next in adj.get(curr)!!) {
-                if (l[next!!] != -1) {
+            for (next in adj[curr]) {
+                if (l[next] != -1) {
                     continue
                 }
                 q.offer(intArrayOf(next, level + 1))
@@ -38,17 +39,17 @@ class Solution {
         }
         val dp: Array<IntArray> = Array<IntArray>(l[max]) { IntArray(2) }
         for (i in dp) {
-            Arrays.fill(i, -1)
+            i.fill(-1)
         }
         return solve(0, 0, dp)
     }
 
     private fun solve(ind: Int, odd: Int, dp: Array<IntArray>): Int {
         if (ind == dp.size) {
-            if (odd == 1) {
-                return 1
+            return if (odd == 1) {
+                1
             } else {
-                return 0
+                0
             }
         }
         if (dp[ind][odd] != -1) {
@@ -60,6 +61,6 @@ class Solution {
     }
 
     companion object {
-        private val MOD = 1e9.toInt() + 7
+        private const val MOD = 1e9.toInt() + 7
     }
 }

src/main/kotlin/g3501_3600/s3559_number_of_ways_to_assign_edge_weights_ii/Solution.kt

@@ -1,10 +1,10 @@
 package g3501_3600.s3559_number_of_ways_to_assign_edge_weights_ii
 
+// #Hard #2025_05_25_Time_197_ms_(100.00%)_Space_158.27_MB_(100.00%)
+
 import kotlin.math.ceil
 import kotlin.math.ln
 
-// #Hard #2025_05_25_Time_135_ms_(100.00%)_Space_119.27_MB_(100.00%)
-
 class Solution {
     private var adj: MutableList<MutableList<Int?>?>? = null
     private lateinit var level: IntArray

src/main/kotlin/g3501_3600/s3560_find_minimum_log_transportation_cost/Solution.kt

@@ -1,6 +1,6 @@
 package g3501_3600.s3560_find_minimum_log_transportation_cost
 
-// #Easy #2025_05_25_Time_0_ms_(100.00%)_Space_41.10_MB_(56.75%)
+// #Easy #2025_05_25_Time_0_ms_(100.00%)_Space_40.46_MB_(100.00%)
 
 class Solution {
     fun minCuttingCost(n: Int, m: Int, k: Int): Long {

src/main/kotlin/g3501_3600/s3561_resulting_string_after_adjacent_removals/Solution.kt

@@ -1,6 +1,6 @@
 package g3501_3600.s3561_resulting_string_after_adjacent_removals
 
-// #Medium #2025_05_25_Time_36_ms_(100.00%)_Space_46.14_MB_(64.60%)
+// #Medium #2025_05_25_Time_43_ms_(100.00%)_Space_50.83_MB_(68.75%)
 
 class Solution {
     fun resultingString(s: String): String {

src/main/kotlin/g3501_3600/s3562_maximum_profit_from_trading_stocks_with_discounts/Solution.kt

@@ -1,8 +1,8 @@
 package g3501_3600.s3562_maximum_profit_from_trading_stocks_with_discounts
 
-import kotlin.math.max
+// #Hard #2025_05_25_Time_40_ms_(100.00%)_Space_49.77_MB_(100.00%)
 
-// #Hard #2025_05_25_Time_27_ms_(100.00%)_Space_44.97_MB_(95.42%)
+import kotlin.math.max
 
 class Solution {
     private lateinit var adj: Array<ArrayList<Int>>

src/main/kotlin/g3501_3600/s3563_lexicographically_smallest_string_after_adjacent_removals/Solution.kt

@@ -1,8 +1,8 @@
 package g3501_3600.s3563_lexicographically_smallest_string_after_adjacent_removals
 
-import kotlin.math.abs
+// #Hard #2025_05_25_Time_186_ms_(100.00%)_Space_49.04_MB_(100.00%)
 
-// #Hard #2025_05_25_Time_146_ms_(98.77%)_Space_45.52_MB_(90.12%)
+import kotlin.math.abs
 
 class Solution {
     private fun checkPair(char1: Char, char2: Char): Boolean {