Merge branch 'neetcode-gh:main' into patch-1

Author: pobch

README.md

@@ -355,7 +355,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[1143 - Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1143-Longest-Common-Subsequence.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F1143-Longest-Common-Subsequence.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F1143-Longest-Common-Subsequence.go)</div></sub> | <sub><div align='center'>[✔️](java%2F1143-Longest-Common-Subsequence.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1143-Longest-Common-Subsequence.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1143-Longest-Common-Subsequence.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1143-longest-common-subsequence.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F1143-Longest-Common-Subsequence.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F1143-Longest-Common-Subsequence.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F1143-Longest-Common-Subsequence.ts)</div></sub>
 <sub>[0309 - Best Time to Buy And Sell Stock With Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/)</sub> | <sub><div align='center'>[✔️](c%2F0309-best-time-to-buy-and-sell-stock-with-cooldown.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0309-best-time-to-buy-and-sell-stock-with-cooldown.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0309-best-time-to-buy-and-sell-stock-with-cooldown.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0309-best-time-to-buy-and-sell-stock-with-cooldown.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0309-best-time-to-buy-and-sell-stock-with-cooldown.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0309-best-time-to-buy-and-sell-stock-with-cooldown.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0309-best-time-to-buy-and-sell-stock-with-cooldown.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0309-best-time-to-buy-and-sell-stock-with-cooldown.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0309-best-time-to-buy-and-sell-stock-with-cooldown.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0309-best-time-to-buy-and-sell-stock-with-cooldown.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0309-best-time-to-buy-and-sell-stock-with-cooldown.ts)</div></sub>
 <sub>[0518 - Coin Change II](https://leetcode.com/problems/coin-change-ii/)</sub> | <sub><div align='center'>[✔️](c%2F0518-coin-change-ii.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0518-coin-change-ii.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0518-coin-change-ii.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0518-coin-change-ii.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0518-coin-change-ii.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0518-coin-change-ii.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0518-coin-change-ii.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0518-coin-change-ii.ts)</div></sub>
-<sub>[0494 - Target Sum](https://leetcode.com/problems/target-sum/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0494-target-sum.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0494-target-sum.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0494-target-sum.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0494-target-sum.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0494-target-sum.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0494-target-sum.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0494-target-sum.ts)</div></sub>
+<sub>[0494 - Target Sum](https://leetcode.com/problems/target-sum/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0494-target-sum.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0494-target-sum.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0494-target-sum.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0494-target-sum.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0494-target-sum.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0494-target-sum.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0494-target-sum.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0494-target-sum.ts)</div></sub>
 <sub>[0097 - Interleaving String](https://leetcode.com/problems/interleaving-string/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0097-interleaving-string.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0097-interleaving-string.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0097-interleaving-string.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0097-interleaving-string.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0097-interleaving-string.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0097-interleaving-string.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0097-interleaving-string.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](scala%2F0097-interleaving-string.scala)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0097-interleaving-string.ts)</div></sub>
 <sub>[0877 - Stone Game](https://leetcode.com/problems/stone-game/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0064 - Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0064-minimum-path-sum.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0064-minimum-path-sum.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0064-minimum-path-sum.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0064-minimum-path-sum.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
@@ -382,7 +382,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0846 - Hand of Straights](https://leetcode.com/problems/hand-of-straights/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0846-hand-of-straights.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0846-hand-of-straights.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0846-hand-of-straights.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0846-hand-of-straights.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0846-hand-of-straights.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0846-hand-of-straights.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0846-hand-of-straights.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0846-hand-of-straights.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0846-hand-of-straights.ts)</div></sub>
 <sub>[1423 - Maximum Points You Can Obtain From Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](csharp%2F1423-Maximum-Points-You-Can-Obtain-from-Cards.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1423-maximum-points-you-can-obtain-from-cards.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[1899 - Merge Triplets to Form Target Triplet](https://leetcode.com/problems/merge-triplets-to-form-target-triplet/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1899-merge-triplets-to-form-target-triplet.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F1899-Merge-Triplets-to-Form-Target-Triplet.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F1899-merge-triplets-to-form-target-triplet.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1899-merge-triplets-to-form-target-triplet.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1899-merge-triplets-to-form-target-triplet.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1899-merge-triplets-to-form-target-triplet.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F1899-merge-triplets-to-form-target-triplet.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F1899-Merge-Triplets-To-Form-Target-Triplet.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F1899-Merge-Triplets-to-Form-Target-Triplet.ts)</div></sub>
-<sub>[0763 - Partition Labels](https://leetcode.com/problems/partition-labels/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0763-partition-labels.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0763-partition-labels.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0763-partition-labels.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0763-partition-labels.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0763-partition-labels.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0763-partition-labels.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0763-partition-labels.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[0763 - Partition Labels](https://leetcode.com/problems/partition-labels/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0763-partition-labels.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0763-partition-labels.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0763-partition-labels.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0763-partition-labels.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0763-partition-labels.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0763-partition-labels.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0763-partition-labels.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0763-partition-labels.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0678 - Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/)</sub> | <sub><div align='center'>[✔️](c%2F0678-valid-parenthesis-string.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0678-valid-parenthesis-string.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0678-valid-parenthesis-string.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0678-valid-parenthesis-string.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0678-valid-parenthesis-string.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0678-valid-parenthesis-string.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0678-valid-parenthesis-string.ts)</div></sub>
 <sub>[1921 - Eliminate Maximum Number of Monsters](https://leetcode.com/problems/eliminate-maximum-number-of-monsters/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[1029 - Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F1029-two-city-scheduling.go)</div></sub> | <sub><div align='center'>[✔️](java%2F1029-two-city-scheduling.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1029-two-city-scheduling.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F1029-two-city-scheduling.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F1029-two-city-scheduling.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F1029-two-city-scheduling.ts)</div></sub>

kotlin/0494-target-sum.kt

@@ -0,0 +1,18 @@
+class Solution {
+    fun findTargetSumWays(nums: IntArray, target: Int): Int {
+        val memo = HashMap<String, Int>()
+
+        fun dfs(i: Int, sum: Int): Int {
+            if (i == nums.size)
+                return if (sum == target) 1 else 0
+            val key = "$i:$sum"
+            if (key in memo)
+                return memo[key]!!
+            memo[key] = dfs(i + 1, sum + nums[i]) + 
+                dfs(i + 1, sum - nums[i])
+            return memo[key]!!
+        }
+
+        return dfs(0, 0)
+    }
+}

kotlin/0649-dota2-senate.kt

@@ -0,0 +1,22 @@
+class Solution {
+    fun predictPartyVictory(senate: String): String {
+        val rQ = LinkedList<Int>()
+        val dQ = LinkedList<Int>()
+        val n = senate.length
+
+        for (i in senate.indices) {
+            if (senate[i] == 'R') rQ.addLast(i)
+            else dQ.addLast(i)
+        }
+
+        while (rQ.isNotEmpty() && dQ.isNotEmpty()) {
+            val r = rQ.removeFirst()
+            val d = dQ.removeFirst()
+
+            if (r < d) rQ.addLast(r + n)
+            else dQ.addLast(d + n)
+        }
+
+        return if (rQ.isEmpty()) "Dire" else "Radiant"
+    }
+}

kotlin/0763-partition-labels.kt

@@ -0,0 +1,33 @@
+class Solution {
+    fun partitionLabels(s: String): List<Int> {
+        if (s.length == 1) return listOf(1)
+        val lastIndexOfChar = mutableMapOf<Char, Int>().apply {
+            s.forEachIndexed { index, char -> this[char] = index }
+        }
+        val partitions = mutableListOf<Int>()
+        var l = 0
+        while (l in s.indices) {
+            // keep moving l to find the first char that has a last occurrence greater than l
+            while (l == lastIndexOfChar[s[l]]) {
+                // if l is at the one-and-only occurrence of the char s[l], make a partition and move l
+                partitions.add(1)
+                l++
+                if (l > s.lastIndex) return partitions
+            }
+
+            var r = lastIndexOfChar.getValue(s[l])
+            var j = l + 1
+            while (j <= r) {
+                if (lastIndexOfChar.getValue(s[j]) <= r){
+                    j++
+                    continue
+                }
+                r = lastIndexOfChar.getValue(s[j])
+                j++
+            }
+            partitions.add((r - l) + 1)
+            l = r + 1
+        }
+        return partitions
+    }
+}

kotlin/1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.kt

@@ -1,7 +1,47 @@
-package kotlin
+/*
+* DFS Solution
+*/
+class Solution {
+    fun minReorder(n: Int, connections: Array<IntArray>): Int {
+
+        val neighbors = ArrayList<ArrayList<Int>>().apply {
+            for (i in 0 until n)
+                this.add(ArrayList<Int>())
+            for ((u,v) in connections) {
+                this.get(u).apply { this.add(v) }
+                this.get(v).apply { this.add(u) }
+            }
+        }
+
+        val edges = HashSet<String>().apply {
+            for ((u,v) in connections)
+                this.add("$u:$v")
+        }
 
-import java.util.LinkedList
+        var changes = 0
+        val visited = BooleanArray(n)
+
+        fun dfs(n: Int) {
+            for (nei in neighbors[n]) {
+                if (visited[nei] == true)
+                    continue
+                if ("$nei:$n" !in edges)
+                    changes++
+                visited[nei] = true
+                dfs(nei)
+            }
+        }
+
+        visited[0] = true
+        dfs(0)
+
+        return changes
+    }
+}
 
+/*
+* BFS Solution
+*/
 class Solution {
     fun minReorder(n: Int, connections: Array<IntArray>): Int {
         // node -> (adjacentNode,isArtificialEdge)