Revert "📜 Update README table (🛠️ from Github Actions)"

This reverts commit 787dd32.

Author: Ahmad-A0

README.md

@@ -189,7 +189,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 
 <sub>Problem</sub> | <sub>C</sub> | <sub>C++</sub> | <sub>C#</sub> | <sub>GO</sub> | <sub>Java</sub> | <sub>JS</sub> | <sub>Kotlin</sub> | <sub>Python</sub> | <sub>Ruby</sub> | <sub>Rust</sub> | <sub>Scala</sub> | <sub>Swift</sub> | <sub>TS</sub>
 ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
-<sub>[94 - Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-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'>[✔️](javascript%2F94-Binary-Tree-Inorder-Traversal.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F94-Binary-Tree-Inorder-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'>[✔️](typescript%2F94-Binary-Tree-Inorder-Traversal.ts)</div></sub>
+<sub>[94 - Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-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'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F94-Binary-Tree-Inorder-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>[226 - Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)</sub> | <sub><div align='center'>[✔️](c%2F226-Invert-Binary-Tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F226-Invert-Binary-Tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F226-Invert-Binary-Tree.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F226-Invert-Binary-Tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F226-Invert-Binary-Tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F226-Invert-Binary-Tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F226-Invert-Binary-Tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F226-Invert-Binary-Tree.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F226-Invert-Binary-Tree.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F226-Invert-Binary-Tree.ts)</div></sub>
 <sub>[104 - Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)</sub> | <sub><div align='center'>[✔️](c%2F104-Maximum-Depth-Of-Binary-Tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F104-Maximum-Depth-Of-Binary-Tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F104-Maximum-Depth-of-Binary-Tree.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F104-Maximum-Depth-of-Binary-Tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F104-Maximum-Depth-of-Binary-Tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F104-Maximum-Depth-of-Binary-Tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F104-Maximum-Depth-Of-Binary-Tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F104-Maximum-Depth-of-Binary-Tree.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F104-Maximum-Depth-of-Binary-Tree.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F104-Maximum-Depth-of-Binary-Tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F104-Maximum-Depth-of-Binary-Tree.ts)</div></sub>
 <sub>[543 - Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)</sub> | <sub><div align='center'>[✔️](c%2F543-Diameter-Of-Binary-Tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F543-Diameter-Of-Binary-Tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F543-Diameter-of-Binary-Tree.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F543-Diameter-of-Binary-Tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F543-Diameter-of-Binary-Tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F543-Diameter-Of-Binary-Tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F543-Diameter-of-Binary-Tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F543-Diameter-of-Binary-Tree.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F543-Diameter-of-Binary-Tree.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F543-Diameter-of-Binary-Tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F543-Diameter-of-Binary-Tree.ts)</div></sub>