📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

Diff for: README.md

@@ -300,7 +300,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0210 - Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0210-course-schedule-ii.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0210-course-schedule-ii.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0210-course-schedule-ii.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0210-course-schedule-ii.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0210-course-schedule-ii.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0210-course-schedule-ii.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0210-course-schedule-ii.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%2F0210-course-schedule-ii.ts)</div></sub>
 <sub>[1958 - Check if Move Is Legal](https://leetcode.com/problems/check-if-move-is-legal/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1958-check-if-move-is-legal.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F1958-check-if-move-is-legal.go)</div></sub> | <sub><div align='center'>[✔️](java%2F1958-check-if-move-is-legal.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1958-check-if-move-is-legal.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1958-check-if-move-is-legal.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1958-check-if-move-is-legal.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>[0934 - Shortest Bridge](https://leetcode.com/problems/shortest-bridge/)</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%2F0934-shortest-bridge.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>[1091 - Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)</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%2F1091-shortest-path-in-binary-matrix.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1091-shortest-path-in-binary-matrix.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>[1091 - Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)</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%2F1091-shortest-path-in-binary-matrix.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1091-shortest-path-in-binary-matrix.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1091-shortest-path-in-binary-matrix.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>[0684 - Redundant Connection](https://leetcode.com/problems/redundant-connection/)</sub> | <sub><div align='center'>[✔️](c%2F0684-redundant-connection.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0684-redundant-connection.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0684-redundant-connection.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0684-redundant-connection.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0684-redundant-connection.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0684-redundant-connection.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0684-redundant-connection.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0684-redundant-connection.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0684-redundant-connection.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0684-redundant-connection.ts)</div></sub>
 <sub>[0323 - Number of Connected Components In An Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0323-number-of-connected-components-in-an-undirected-graph.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0323-number-of-connected-components-in-an-undirected-graph.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0323-number-of-connected-components-in-an-undirected-graph.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0323-number-of-connected-components-in-an-undirected-graph.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0323-number-of-connected-components-in-an-undirected-graph.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0323-number-of-connected-components-in-an-undirected-graph.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0323-number-of-connected-components-in-an-undirected-graph.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'>[✔️](swift%2F0323-number-of-connected-components-in-an-undirected-graph.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0261 - Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0261-graph-valid-tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0261-graph-valid-tree.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0261-graph-valid-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0261-graph-valid-tree.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0261-graph-valid-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'>[✔️](swift%2F0261-graph-valid-tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0261-graph-valid-tree.ts)</div></sub>