Added tasks 3556-3563

Author: javadev

README.md

@@ -2088,6 +2088,14 @@
 
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|--------
+| 3563 |[Lexicographically Smallest String After Adjacent Removals](src/main/kotlin/g3501_3600/s3563_lexicographically_smallest_string_after_adjacent_removals)| Hard | String, Dynamic_Programming | 186 | 100.00
+| 3562 |[Maximum Profit from Trading Stocks with Discounts](src/main/kotlin/g3501_3600/s3562_maximum_profit_from_trading_stocks_with_discounts)| Hard | Array, Dynamic_Programming, Depth_First_Search, Tree | 40 | 100.00
+| 3561 |[Resulting String After Adjacent Removals](src/main/kotlin/g3501_3600/s3561_resulting_string_after_adjacent_removals)| Medium | String, Stack, Simulation | 43 | 100.00
+| 3560 |[Find Minimum Log Transportation Cost](src/main/kotlin/g3501_3600/s3560_find_minimum_log_transportation_cost)| Easy | Math | 0 | 100.00
+| 3559 |[Number of Ways to Assign Edge Weights II](src/main/kotlin/g3501_3600/s3559_number_of_ways_to_assign_edge_weights_ii)| Hard | Array, Dynamic_Programming, Math, Depth_First_Search, Tree | 197 | 100.00
+| 3558 |[Number of Ways to Assign Edge Weights I](src/main/kotlin/g3501_3600/s3558_number_of_ways_to_assign_edge_weights_i)| Medium | Math, Depth_First_Search, Tree | 21 | 100.00
+| 3557 |[Find Maximum Number of Non Intersecting Substrings](src/main/kotlin/g3501_3600/s3557_find_maximum_number_of_non_intersecting_substrings)| Medium | String, Hash_Table, Dynamic_Programming, Greedy | 28 | 70.59
+| 3556 |[Sum of Largest Prime Substrings](src/main/kotlin/g3501_3600/s3556_sum_of_largest_prime_substrings)| Medium | String, Hash_Table, Math, Sorting, Number_Theory | 25 | 100.00
 | 3554 |[Find Category Recommendation Pairs](src/main/kotlin/g3501_3600/s3554_find_category_recommendation_pairs)| Hard | Database | 623 | 82.76
 | 3553 |[Minimum Weighted Subgraph With the Required Paths II](src/main/kotlin/g3501_3600/s3553_minimum_weighted_subgraph_with_the_required_paths_ii)| Hard | Array, Depth_First_Search, Tree | 142 | 100.00
 | 3552 |[Grid Teleportation Traversal](src/main/kotlin/g3501_3600/s3552_grid_teleportation_traversal)| Medium | Array, Hash_Table, Breadth_First_Search, Matrix | 147 | 100.00

src/main/kotlin/g3501_3600/s3556_sum_of_largest_prime_substrings/readme.md

@@ -0,0 +1,106 @@
+[![](https://img.shields.io/github/stars/javadev/LeetCode-in-Kotlin?label=Stars&style=flat-square)](https://github.com/javadev/LeetCode-in-Kotlin)
+[![](https://img.shields.io/github/forks/javadev/LeetCode-in-Kotlin?label=Fork%20me%20on%20GitHub%20&style=flat-square)](https://github.com/javadev/LeetCode-in-Kotlin/fork)
+
+## 3556\. Sum of Largest Prime Substrings
+
+Medium
+
+Given a string `s`, find the sum of the **3 largest unique prime numbers** that can be formed using any of its ****substring****.
+
+Return the **sum** of the three largest unique prime numbers that can be formed. If fewer than three exist, return the sum of **all** available primes. If no prime numbers can be formed, return 0.
+
+**Note:** Each prime number should be counted only **once**, even if it appears in **multiple** substrings. Additionally, when converting a substring to an integer, any leading zeros are ignored.
+
+**Example 1:**
+
+**Input:** s = "12234"
+
+**Output:** 1469
+
+**Explanation:**
+
+*   The unique prime numbers formed from the substrings of `"12234"` are 2, 3, 23, 223, and 1223.
+*   The 3 largest primes are 1223, 223, and 23. Their sum is 1469.
+
+**Example 2:**
+
+**Input:** s = "111"
+
+**Output:** 11
+
+**Explanation:**
+
+*   The unique prime number formed from the substrings of `"111"` is 11.
+*   Since there is only one prime number, the sum is 11.
+
+**Constraints:**
+
+*   `1 <= s.length <= 10`
+*   `s` consists of only digits.
+
+## Solution
+
+```kotlin
+class Solution {
+    fun sumOfLargestPrimes(s: String): 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 num: Long = 0
+            for (j in i..<n) {
+                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
+                    }
+                }
+            }
+        }
+        var sum: Long = 0
+        if (first != -1L) {
+            sum += first
+        }
+        if (second != -1L) {
+            sum += second
+        }
+        if (third != -1L) {
+            sum += third
+        }
+        return sum
+    }
+
+    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 = 5
+        while (i * i <= num) {
+            if (num % i == 0L || num % (i + 2) == 0L) {
+                return false
+            }
+            i += 6
+        }
+        return true
+    }
+}
+```

src/main/kotlin/g3501_3600/s3557_find_maximum_number_of_non_intersecting_substrings/readme.md

@@ -0,0 +1,57 @@
+[![](https://img.shields.io/github/stars/javadev/LeetCode-in-Kotlin?label=Stars&style=flat-square)](https://github.com/javadev/LeetCode-in-Kotlin)
+[![](https://img.shields.io/github/forks/javadev/LeetCode-in-Kotlin?label=Fork%20me%20on%20GitHub%20&style=flat-square)](https://github.com/javadev/LeetCode-in-Kotlin/fork)
+
+## 3557\. Find Maximum Number of Non Intersecting Substrings
+
+Medium
+
+You are given a string `word`.
+
+Return the **maximum** number of non-intersecting ****substring**** of word that are at **least** four characters long and start and end with the same letter.
+
+**Example 1:**
+
+**Input:** word = "abcdeafdef"
+
+**Output:** 2
+
+**Explanation:**
+
+The two substrings are `"abcdea"` and `"fdef"`.
+
+**Example 2:**
+
+**Input:** word = "bcdaaaab"
+
+**Output:** 1
+
+**Explanation:**
+
+The only substring is `"aaaa"`. Note that we cannot **also** choose `"bcdaaaab"` since it intersects with the other substring.
+
+**Constraints:**
+
+*   <code>1 <= word.length <= 2 * 10<sup>5</sup></code>
+*   `word` consists only of lowercase English letters.
+
+## Solution
+
+```kotlin
+class Solution {
+    fun maxSubstrings(s: String): Int {
+        val prev = IntArray(26)
+        var r = 0
+        prev.fill(-1)
+        for (i in 0..<s.length) {
+            val j = s[i].code - 'a'.code
+            if (prev[j] != -1 && i - prev[j] + 1 >= 4) {
+                ++r
+                prev.fill(-1)
+            } else if (prev[j] == -1) {
+                prev[j] = i
+            }
+        }
+        return r
+    }
+}
+```

src/main/kotlin/g3501_3600/s3558_number_of_ways_to_assign_edge_weights_i/readme.md

@@ -0,0 +1,106 @@
+[![](https://img.shields.io/github/stars/javadev/LeetCode-in-Kotlin?label=Stars&style=flat-square)](https://github.com/javadev/LeetCode-in-Kotlin)
+[![](https://img.shields.io/github/forks/javadev/LeetCode-in-Kotlin?label=Fork%20me%20on%20GitHub%20&style=flat-square)](https://github.com/javadev/LeetCode-in-Kotlin/fork)
+
+## 3558\. Number of Ways to Assign Edge Weights I
+
+Medium
+
+There is an undirected tree with `n` nodes labeled from 1 to `n`, rooted at node 1. The tree is represented by a 2D integer array `edges` of length `n - 1`, where <code>edges[i] = [u<sub>i</sub>, v<sub>i</sub>]</code> indicates that there is an edge between nodes <code>u<sub>i</sub></code> and <code>v<sub>i</sub></code>.
+
+Initially, all edges have a weight of 0. You must assign each edge a weight of either **1** or **2**.
+
+The **cost** of a path between any two nodes `u` and `v` is the total weight of all edges in the path connecting them.
+
+Select any one node `x` at the **maximum** depth. Return the number of ways to assign edge weights in the path from node 1 to `x` such that its total cost is **odd**.
+
+Since the answer may be large, return it **modulo** <code>10<sup>9</sup> + 7</code>.
+
+**Note:** Ignore all edges **not** in the path from node 1 to `x`.
+
+**Example 1:**
+
+![](https://assets.leetcode.com/uploads/2025/03/23/screenshot-2025-03-24-at-060006.png)
+
+**Input:** edges = \[\[1,2]]
+
+**Output:** 1
+
+**Explanation:**
+
+*   The path from Node 1 to Node 2 consists of one edge (`1 → 2`).
+*   Assigning weight 1 makes the cost odd, while 2 makes it even. Thus, the number of valid assignments is 1.
+
+**Example 2:**
+
+![](https://assets.leetcode.com/uploads/2025/03/23/screenshot-2025-03-24-at-055820.png)
+
+**Input:** edges = \[\[1,2],[1,3],[3,4],[3,5]]
+
+**Output:** 2
+
+**Explanation:**
+
+*   The maximum depth is 2, with nodes 4 and 5 at the same depth. Either node can be selected for processing.
+*   For example, the path from Node 1 to Node 4 consists of two edges (`1 → 3` and `3 → 4`).
+*   Assigning weights (1,2) or (2,1) results in an odd cost. Thus, the number of valid assignments is 2.
+
+**Constraints:**
+
+*   <code>2 <= n <= 10<sup>5</sup></code>
+*   `edges.length == n - 1`
+*   <code>edges[i] == [u<sub>i</sub>, v<sub>i</sub>]</code>
+*   <code>1 <= u<sub>i</sub>, v<sub>i</sub> <= n</code>
+*   `edges` represents a valid tree.
+
+## Solution
+
+```kotlin
+class Solution {
+    fun assignEdgeWeights(edges: Array<IntArray>): Int {
+        if (pow2[0] == 0L) {
+            pow2[0] = 1
+            for (i in 1..<pow2.size) {
+                pow2[i] = (pow2[i - 1] shl 1) % mod
+            }
+        }
+        val n = edges.size + 1
+        val adj = IntArray(n + 1)
+        val degrees = IntArray(n + 1)
+        for (edge in edges) {
+            val u = edge[0]
+            val v = edge[1]
+            adj[u] += v
+            adj[v] += u
+            degrees[u]++
+            degrees[v]++
+        }
+        val que = IntArray(n)
+        var write = 0
+        var read = 0
+        for (i in 2..n) {
+            if (degrees[i] == 1) {
+                que[write++] = i
+            }
+        }
+        var distance = 0
+        while (read < write) {
+            distance++
+            var size = write - read
+            while (size-- > 0) {
+                val v = que[read++]
+                val u = adj[v]
+                adj[u] -= v
+                if (--degrees[u] == 1 && u != 1) {
+                    que[write++] = u
+                }
+            }
+        }
+        return pow2[distance - 1].toInt()
+    }
+
+    companion object {
+        private const val mod = 1e9.toInt() + 7
+        private val pow2 = LongArray(100001)
+    }
+}
+```