📜 Update README table (🛠️ from Github Actions)

README.md

@@ -44,7 +44,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0169 - Majority Element](https://leetcode.com/problems/majority-element/)</sub> | <sub><div align='center'>[✔️](c%2F0169-majority-element.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0169-majority-element.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0169-majority-element.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0169-majority-element.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0169-majority-element.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0169-majority-element.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0169-majority-element.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0169-majority-element.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0169-majority-element.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0169-majority-element.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0169-majority-element.ts)</div></sub>
 <sub>[0496 - Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/)</sub> | <sub><div align='center'>[✔️](c%2F0496-next-greater-element-i.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0496-next-greater-element-i.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0496-next-greater-element-i.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0496-next-greater-element-i.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0496-next-greater-element-i.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0496-next-greater-element-i.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0496-next-greater-element-i.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0496-next-greater-element-i.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0496-next-greater-element-I.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0496-next-greater-element-i.ts)</div></sub>
 <sub>[0724 - Find Pivot Index](https://leetcode.com/problems/find-pivot-index/)</sub> | <sub><div align='center'>[✔️](c%2F0724-find-pivot-index.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0724-find-pivot-index.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0724-find-pivot-index.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0724-find-pivot-index.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0724-find-pivot-index.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0724-find-pivot-index.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0724-find-pivot-index.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0724-find-pivot-index.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0724-find-pivot-index.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0724-find-pivot-index.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0724-find-pivot-index.ts)</div></sub>
-<sub>[0303 - Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)</sub> | <sub><div align='center'>[✔️](c%2F0303-range-sum-query-immutable.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'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0303-range-sum-query-immutable.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0303-range-sum-query-immutable.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>[0303 - Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)</sub> | <sub><div align='center'>[✔️](c%2F0303-range-sum-query-immutable.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0303-range-sum-query-immutable.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%2F0303-range-sum-query-immutable.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0303-range-sum-query-immutable.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>[0448 - Find All Numbers Disappeared In An Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/)</sub> | <sub><div align='center'>[✔️](c%2F0448-Find-All-Numbers-Disappeared-in-an-Array.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0448-find-all-numbers-disappeared-in-an-array.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0448-find-all-numbers-disappeared-in-an-array.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0448-find-all-numbers-disappeared-in-an-array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0448-find-all-numbers-disappeared-in-an-array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0448-find-all-numbers-disappeared-in-an-array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0448-find-all-numbers-disappeared-in-an-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0448-find-all-numbers-disappeared-in-an-array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0448-find-all-numbers-disappeared-in-an-array.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0448-find-all-numbers-disappeared-in-an-array.ts)</div></sub>
 <sub>[1189 - Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/)</sub> | <sub><div align='center'>[✔️](c%2F1189-Maximum-Number-of-Balloons.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F1189-maximum-number-of-balloons.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F1189-maximum-number-of-balloons.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F1189-maximum-number-of-balloons.go)</div></sub> | <sub><div align='center'>[✔️](java%2F1189-maximum-number-of-balloons.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1189-maximum-number-of-balloons.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1189-maximum-number-of-balloons.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1189-Maximum-Number-of-Balloons.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F1189-maximum-number-of-balloons.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F1189-maximum-number-of-balloons.ts)</div></sub>
 <sub>[0290 - Word Pattern](https://leetcode.com/problems/word-pattern/)</sub> | <sub><div align='center'>[✔️](c%2F0290-Word-Pattern.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0290-word-pattern.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0290-word-pattern.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0290-word-pattern.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0290-word-pattern.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0290-word-pattern.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0290-word-pattern.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0290-word-pattern.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0290-word-pattern.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0290-word-pattern.ts)</div></sub>
@@ -202,7 +202,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <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'>❌</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>[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'>❌</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'>❌</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>[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'>❌</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'>❌</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'>❌</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>[0235 - Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0235-lowest-common-ancestor-of-a-binary-search-tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0235-lowest-common-ancestor-of-a-binary-search-tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0235-lowest-common-ancestor-of-a-binary-search-tree.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0235-lowest-common-ancestor-of-a-binary-search-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0235-lowest-common-ancestor-of-a-binary-search-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0235-lowest-common-ancestor-of-a-binary-search-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0235-lowest-common-ancestor-of-a-binary-search-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0235-lowest-common-ancestor-of-a-binary-search-tree.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0235-lowest-common-ancestor-of-a-binary-search-tree.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](scala%2F0235-lowest-common-ancestor-of-a-binary-search-tree.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F0235-lowest-common-ancestor-of-a-binary-search-tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0235-lowest-common-ancestor-of-a-binary-search-tree.ts)</div></sub>