Merge branch 'neetcode-gh:main' into main

Author: RomanGirin

README.md

@@ -226,7 +226,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0110 - Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0110-balanced-binary-tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0110-balanced-binary-tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0110-balanced-binary-tree.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0110-balanced-binary-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0110-balanced-binary-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0110-balanced-binary-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0110-balanced-binary-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0110-balanced-binary-tree.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0110-balanced-binary-tree.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0110-balanced-binary-tree.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0110-balanced-binary-tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0110-balanced-binary-tree.ts)</div></sub>
 <sub>[0100 - Same Tree](https://leetcode.com/problems/same-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0100-same-tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0100-same-tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0100-same-tree.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0100-same-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0100-same-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0100-same-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0100-same-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0100-same-tree.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0100-same-tree.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0100-same-tree.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0100-same-tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0100-same-tree.ts)</div></sub>
 <sub>[0572 - Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0572-subtree-of-another-tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0572-subtree-of-another-tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0572-subtree-of-another-tree.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0572-subtree-of-another-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0572-subtree-of-another-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0572-subtree-of-another-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0572-subtree-of-another-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0572-subtree-of-another-tree.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0572-subtree-of-another-tree.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0572-subtree-of-another-tree.rs)</div></sub> | <sub><div align='center'>[✔️](scala%2F0572-subtree-of-another-tree.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F0572-subtree-of-another-tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0572-subtree-of-another-tree.ts)</div></sub>
-<sub>[0108 - Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0108-convert-sorted-array-to-binary-search-tree.c)</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%2F0108-convert-sorted-array-to-binary-search-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0108-convert-sorted-array-to-binary-search-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0108-convert-sorted-array-to-binary-search-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0108-convert-sorted-array-to-binary-search-tree.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>[0108 - Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0108-convert-sorted-array-to-binary-search-tree.c)</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%2F0108-convert-sorted-array-to-binary-search-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0108-convert-sorted-array-to-binary-search-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0108-convert-sorted-array-to-binary-search-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0108-convert-sorted-array-to-binary-search-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0108-convert-sorted-array-to-binary-search-tree.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>
 <sub>[0617 - Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)</sub> | <sub><div align='center'>[✔️](c%2F0617-merge-two-binary-trees.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0617-merge-two-binary-trees.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](dart%2F0617-merge-two-binary-trees.dart)</div></sub> | <sub><div align='center'>[✔️](go%2F0617-merge-two-binary-trees.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0617-merge-two-binary-trees.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0617-merge-two-binary-trees.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0617-merge-two-binary-trees.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0617-merge-two-binary-trees.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>
 <sub>[0112 - Path Sum](https://leetcode.com/problems/path-sum/)</sub> | <sub><div align='center'>[✔️](c%2F0112-path-sum.c)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](csharp%2F0112-path-sum.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0112-path-sum.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0112-path-sum.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0112-path-sum.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0112-path-sum.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0112-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'>[✔️](swift%2F0112-path-sum.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0606 - Construct String From Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/)</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'>[✔️](java%2F0606-construct-string-from-binary-tree.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0606-construct-string-from-binary-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0606-construct-string-from-binary-tree.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>
@@ -238,7 +238,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0783 - Minimum Distance between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)</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'>[✔️](kotlin%2F0783-minimum-distance-between-bst-nodes.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0783-minimum-distance-between-bst-nodes.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>
 <sub>[0101 - Symmetric Tree ](https://leetcode.com/problems/symmetric-tree/)</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'>[✔️](kotlin%2F0101-symmetric-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0101-symmetric-tree.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>
 <sub>[1443 - Minimum Time to Collect All Apples in a Tree](https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree/)</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'>[✔️](rust%2F1443-minimum-time-to-collect-all-apples-in-a-tree.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
-<sub>[0103 - Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0103-binary-tree-zigzag-level-order-traversal.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'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0103-binary-tree-zigzag-level-order-traversal.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>[0103 - Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0103-binary-tree-zigzag-level-order-traversal.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'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0103-binary-tree-zigzag-level-order-traversal.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0103-binary-tree-zigzag-level-order-traversal.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>
 <sub>[0427 - Construct Quad Tree](https://leetcode.com/problems/construct-quad-tree/)</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'>[✔️](kotlin%2F0427-construct-quad-tree.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>[0652 - Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/)</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'>[✔️](kotlin%2F0652-find-duplicate-subtrees.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>[0958 - Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0958-check-completeness-of-a-binary-tree.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'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0958-check-completeness-of-a-binary-tree.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>

java/0198-house-robber.java

@@ -32,4 +32,18 @@ public int robDP(int[] nums) {
         }
         return dp[nums.length - 1];
     }
+
+    // DP with O(1) space
+    public int robDP2(int[] nums) {
+        if (nums == null || nums.length == 0) return 0;
+
+        int dp0 = 0, dp1 = 0, curr;
+
+        for (int i = 0; i < nums.length; i++) {
+            curr = Math.max(dp0 + nums[i], dp1);
+            dp0 = dp1;
+            dp1 = curr;
+        }
+        return Math.max(dp0, dp1);
+    }
 }

kotlin/0068-text-justification.kt

@@ -0,0 +1,42 @@
+//opted out of using StringBuilder, instead used Kotlins plus operator to create new Strings
+class Solution {
+    fun fullJustify(words: Array<String>, maxWidth: Int): List<String> {
+        val res = mutableListOf<String>()
+        var line = mutableListOf<String>()
+        var length = 0
+        var i = 0
+
+        while (i < words.size) {
+            if (length + line.size + words[i].length > maxWidth) {
+                val extraSpace = maxWidth - length
+                val spaces = extraSpace / maxOf(1, line.size - 1)
+                var remainder = extraSpace % maxOf(1, line.size - 1)
+
+                for (j in 0 until maxOf(1, line.lastIndex)) {
+                    line[j] += " ".repeat(spaces)
+                    if (remainder > 0) {
+                        line[j] += " "
+                        remainder--
+                    }
+                }
+
+                var whole = ""
+                for (l in line) whole += l
+                res.add(whole)
+                line.clear()
+                length = 0
+            }
+
+            line.add(words[i])
+            length += words[i].length
+            i++
+        }
+
+        var lastLine = "" + line.joinToString(" ")
+        val trailSpace = maxWidth - lastLine.length
+        lastLine += " ".repeat(trailSpace)
+        res.add(lastLine)
+
+        return res
+    }
+}

python/0103-binary-tree-zigzag-level-order-traversal.py

@@ -0,0 +1,24 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
+        if root is None:
+            return
+        result, zigzagDirection = [], 1
+        q = [root]
+        while q:
+            level, queueLength = [], len(q)
+            for i in range(queueLength):
+                node = q.pop(0)
+                level.append(node.val)
+                if node.left:
+                    q.append(node.left)
+                if node.right:
+                    q.append(node.right)
+            result.append(level[::zigzagDirection])
+            zigzagDirection *= -1
+        return result

python/0108-convert-sorted-array-to-binary-search-tree.py

@@ -0,0 +1,15 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:
+        if not nums:
+            return None
+        mid = len(nums)//2
+        root = TreeNode(nums[mid])
+        root.left = self.sortedArrayToBST(nums[:mid])
+        root.right = self.sortedArrayToBST(nums[mid+1:])
+        return root