📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

README.md

@@ -241,8 +241,8 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0450 - Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0450-delete-node-in-a-bst.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%2F0450-delete-node-in-a-bst.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0450-delete-node-in-a-bst.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0450-delete-node-in-a-bst.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0450-delete-node-in-a-bst.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0450-delete-node-in-a-bst.ts)</div></sub>
 <sub>[0102 - Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)</sub> | <sub><div align='center'>[✔️](c%2F0102-binary-tree-level-order-traversal.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0102-binary-tree-level-order-traversal.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0102-binary-tree-level-order-traversal.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0102-binary-tree-level-order-traversal.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0102-binary-tree-level-order-traversal.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0102-binary-tree-level-order-traversal.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0102-binary-tree-level-order-traversal.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0102-binary-tree-level-order-traversal.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0102-binary-tree-level-order-traversal.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0102-binary-tree-level-order-traversal.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0102-binary-tree-level-order-traversal.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0102-binary-tree-level-order-traversal.ts)</div></sub>
 <sub>[0199 - Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)</sub> | <sub><div align='center'>[✔️](c%2F0199-binary-tree-right-side-view.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0199-binary-tree-right-side-view.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0199-binary-tree-right-side-view.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0199-binary-tree-right-side-view.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0199-binary-tree-right-side-view.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0199-binary-tree-right-side-view.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0199-binary-tree-right-side-view.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0199-binary-tree-right-side-view.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0199-binary-tree-right-side-view.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0199-binary-tree-right-side-view.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0199-binary-tree-right-side-view.ts)</div></sub>
-<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>[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'>[✔️](java%2F0783-minimum-distance-between-bst-nodes.java)</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'>[✔️](java%2F0101-symmetric-tree.java)</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'>[✔️](kotlin%2F1443-minimum-time-to-collect-all-apples-in-a-tree.kt)</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'>[✔️](java%2F0103-binary-tree-zigzag-level-order-traversal.java)</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'>[✔️](java%2F0427-construct-quad-tree.java)</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>