📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

Diff for: README.md

@@ -201,7 +201,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'>❌</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'>❌</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'>❌</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'>❌</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>[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'>❌</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>