Updated tags

Author: javadev

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

@@ -1,43 +1,66 @@
 package g3501_3600.s3556_sum_of_largest_prime_substrings
 
-// #Medium #2025_05_25_Time_25_ms_(100.00%)_Space_43.67_MB_(100.00%)
+// #Medium #String #Hash_Table #Math #Sorting #Number_Theory
+// #2025_05_25_Time_25_ms_(100.00%)_Space_43.67_MB_(100.00%)
 
 class Solution {
     fun sumOfLargestPrimes(s: String): Long {
-        val primeSet: MutableSet<Long> = HashSet<Long>()
+        val set: MutableSet<Long> = HashSet()
         val n = s.length
+        var first: Long = -1
+        var second: Long = -1
+        var third: Long = -1
         for (i in 0..<n) {
-            var temp: Long = 0
+            var num: Long = 0
             for (j in i..<n) {
-                temp = temp * 10 + (s[j].code - '0'.code)
-                if (isPrime(temp)) {
-                    primeSet.add(temp)
+                num = num * 10 + (s[j].code - '0'.code)
+                if (i != j && s[i] == '0') {
+                    break
+                }
+                if (isPrime(num) && !set.contains(num)) {
+                    set.add(num)
+                    if (num > first) {
+                        third = second
+                        second = first
+                        first = num
+                    } else if (num > second) {
+                        third = second
+                        second = num
+                    } else if (num > third) {
+                        third = num
+                    }
                 }
             }
         }
-        val primes: MutableList<Long> = ArrayList<Long>(primeSet)
-        primes.sort()
-        val m = primes.size
-        if (m < 3) {
-            var sum: Long = 0
-            for (p in primes) {
-                sum += p
-            }
-            return sum
+        var sum: Long = 0
+        if (first != -1L) {
+            sum += first
+        }
+        if (second != -1L) {
+            sum += second
+        }
+        if (third != -1L) {
+            sum += third
         }
-        return primes[m - 1] + primes[m - 2] + primes[m - 3]
+        return sum
     }
 
-    private fun isPrime(n: Long): Boolean {
-        if (n < 2) {
+    fun isPrime(num: Long): Boolean {
+        if (num <= 1) {
+            return false
+        }
+        if (num == 2L || num == 3L) {
+            return true
+        }
+        if (num % 2 == 0L || num % 3 == 0L) {
             return false
         }
-        var i: Long = 2
-        while (i * i <= n) {
-            if (n % i == 0L) {
+        var i: Long = 5
+        while (i * i <= num) {
+            if (num % i == 0L || num % (i + 2) == 0L) {
                 return false
             }
-            ++i
+            i += 6
         }
         return true
     }

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

@@ -1,6 +1,6 @@
 package g3501_3600.s3558_number_of_ways_to_assign_edge_weights_i
 
-// #Medium #2025_05_25_Time_160_ms_(100.00%)_Space_149.66_MB_(100.00%)
+// #Medium #Math #Depth_First_Search #Tree #2025_05_27_Time_21_ms_(100.00%)_Space_135.14_MB_(45.45%)
 
 class Solution {
     fun assignEdgeWeights(edges: Array<IntArray>): Int {

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

@@ -1,6 +1,7 @@
 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%)
+// #Hard #Array #Dynamic_Programming #Math #Depth_First_Search #Tree
+// #2025_05_25_Time_197_ms_(100.00%)_Space_158.27_MB_(100.00%)
 
 import kotlin.math.ceil
 import kotlin.math.ln

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_40.46_MB_(100.00%)
+// #Easy #Math #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_43_ms_(100.00%)_Space_50.83_MB_(68.75%)
+// #Medium #String #Stack #Simulation #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,6 +1,7 @@
 package g3501_3600.s3562_maximum_profit_from_trading_stocks_with_discounts
 
-// #Hard #2025_05_25_Time_40_ms_(100.00%)_Space_49.77_MB_(100.00%)
+// #Hard #Array #Dynamic_Programming #Depth_First_Search #Tree
+// #2025_05_25_Time_40_ms_(100.00%)_Space_49.77_MB_(100.00%)
 
 import kotlin.math.max
 

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

@@ -1,6 +1,6 @@
 package g3501_3600.s3563_lexicographically_smallest_string_after_adjacent_removals
 
-// #Hard #2025_05_25_Time_186_ms_(100.00%)_Space_49.04_MB_(100.00%)
+// #Hard #String #Dynamic_Programming #2025_05_25_Time_186_ms_(100.00%)_Space_49.04_MB_(100.00%)
 
 import kotlin.math.abs