Skip to content

Commit 1e7505a

Browse files
committed
πŸ“œ Update README table (πŸ› οΈ from Github Actions)
1 parent 04d4418 commit 1e7505a

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

β€ŽREADME.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -347,7 +347,7 @@ If you would like to have collaborator permissions on the repo to merge your own
347347
<sub>[1462 - Course Schedule IV](https://leetcode.com/problems/course-schedule-iv/)</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%2F1462-course-schedule-iv.kt)</div></sub> | <sub><div align='center'>[βœ”οΈ](python%2F1462-course-schedule-iv.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>
348348
<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>
349349
<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'>[βœ”οΈ](javascript%2F0934-shortest-bridge.js)</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>
350-
<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>
350+
<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'>[βœ”οΈ](cpp%2F1091-shortest-path-in-binary-matrix.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%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>
351351
<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>
352352
<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>
353353
<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'>[βœ”οΈ](kotlin%2F0261-graph-valid-tree.kt)</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>

0 commit comments

Comments
Β (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy