📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

Diff for: README.md

@@ -250,7 +250,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <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>
 <sub>[0106 - Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)</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%2F0106-construct-binary-tree-from-inorder-and-postorder-traversal.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0106-construct-binary-tree-from-inorder-and-postorder-traversal.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0106-construct-binary-tree-from-inorder-and-postorder-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>[0662 - Maximum Width of Binary Tree ](https://leetcode.com/problems/maximum-width-of-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%2F0662-maximum-width-of-binary-tree.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0662-maximum-width-of-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>
-<sub>[1376 - Time Needed to Inform All Employees ](https://leetcode.com/problems/time-needed-to-inform-all-employees/)</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%2F1376-time-needed-to-inform-all-employees.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>[1376 - Time Needed to Inform All Employees ](https://leetcode.com/problems/time-needed-to-inform-all-employees/)</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%2F1376-time-needed-to-inform-all-employees.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1376-time-needed-to-inform-all-employees.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>[1448 - Count Good Nodes In Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/)</sub> | <sub><div align='center'>[✔️](c%2F1448-Count-Good-Nodes-in-Binary-Tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F1448-Count-Good-Nodes-In-Binary-Tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F1448-Count-Good-Nodes-in-Binary-Tree.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F1448-count-good-nodes-in-binary-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F1448-Count-Good-Nodes-in-Binary-Tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1448-Count-Good-Nodes-in-Binary-Tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1448-Count-Good-Nodes-In-Binary-Tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1448-count-good-nodes-in-binary-tree.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F1448-count-good-nodes-in-binary-tree.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F1448-count-good-nodes-in-binary-tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F1448-Count-Good-Nodes-in-Binary-Tree.ts)</div></sub>
 <sub>[0098 - Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0098-validate-binary-search-tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0098-validate-binary-search-tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0098-validate-binary-search-tree.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0098-validate-binary-search-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0098-validate-binary-search-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0098-validate-binary-search-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0098-validate-binary-search-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0098-validate-binary-search-tree.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0098-validate-binary-search-tree.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0098-validate-binary-search-tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0098-validate-binary-search-tree.ts)</div></sub>
 <sub>[0230 - Kth Smallest Element In a Bst](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)</sub> | <sub><div align='center'>[✔️](c%2F0230-kth-smallest-element-in-a-bst.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0230-kth-smallest-element-in-a-bst.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0230-kth-smallest-element-in-a-bst.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0230-kth-smallest-element-in-a-bst.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0230-kth-smallest-element-in-a-bst.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0230-kth-smallest-element-in-a-bst.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0230-kth-smallest-element-in-a-bst.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0230-kth-smallest-element-in-a-bst.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0230-kth-smallest-element-in-a-bst.rs)</div></sub> | <sub><div align='center'>[✔️](scala%2F0230-kth-smallest-element-in-a-bst.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F0230-kth-smallest-element-in-a-bst.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0230-kth-smallest-element-in-a-bst.ts)</div></sub>