Skip to content

Commit 47f9ae2

Browse files
committed
πŸ“œ Update README table (πŸ› οΈ from Github Actions)
1 parent fd0b7d7 commit 47f9ae2

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

Diff for: β€ŽREADME.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -241,7 +241,7 @@ If you would like to have collaborator permissions on the repo to merge your own
241241
<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'>❌</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'>❌</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>
242242
<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'>❌</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>
243243
<sub>[0652 - Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/)</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%2F0652-find-duplicate-subtrees.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>
244-
<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'>❌</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>
244+
<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>
245245
<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'>❌</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>
246246
<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>
247247
<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'>❌</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>
@@ -483,7 +483,7 @@ If you would like to have collaborator permissions on the repo to merge your own
483483
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
484484
<sub>[1071 - Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)</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'>[βœ”οΈ](go%2F1071-greatest-common-divisor-of-strings.go)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](javascript%2F1071-greatest-common-divisor-of-strings.js)</div></sub> | <sub><div align='center'>[βœ”οΈ](kotlin%2F1071-greatest-common-divisor-of-strings.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](rust%2F1071-greatest-common-divisor-of-strings.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](typescript%2F1071-greatest-common-divisor-of-strings.ts)</div></sub>
485485
<sub>[1523 - Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/)</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%2F1523-count-odd-numbers-in-an-interval-range.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>
486-
<sub>[1572 - Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)</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%2F1572-matrix-diagonal-sum.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>
486+
<sub>[1572 - Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)</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%2F1572-matrix-diagonal-sum.js)</div></sub> | <sub><div align='center'>[βœ”οΈ](kotlin%2F1572-matrix-diagonal-sum.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>
487487
<sub>[0149 - Maximum Points on a Line](https://leetcode.com/problems/max-points-on-a-line/)</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%2F0149-max-points-on-a-line.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](python%2F0149-max-points-on-a-line.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](rust%2F0149-max-points-on-a-line.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](typescript%2F0149-max-points-on-a-line.ts)</div></sub>
488488
<sub>[0048 - Rotate Image](https://leetcode.com/problems/rotate-image/)</sub> | <sub><div align='center'>[βœ”οΈ](c%2F0048-rotate-image.c)</div></sub> | <sub><div align='center'>[βœ”οΈ](cpp%2F0048-rotate-image.cpp)</div></sub> | <sub><div align='center'>[βœ”οΈ](csharp%2F0048-rotate-image.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](go%2F0048-rotate-image.go)</div></sub> | <sub><div align='center'>[βœ”οΈ](java%2F0048-rotate-image.java)</div></sub> | <sub><div align='center'>[βœ”οΈ](javascript%2F0048-rotate-image.js)</div></sub> | <sub><div align='center'>[βœ”οΈ](kotlin%2F0048-rotate-image.kt)</div></sub> | <sub><div align='center'>[βœ”οΈ](python%2F0048-rotate-image.py)</div></sub> | <sub><div align='center'>[βœ”οΈ](ruby%2F0048-rotate-image.rb)</div></sub> | <sub><div align='center'>[βœ”οΈ](rust%2F0048-rotate-image.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](swift%2F0048-rotate-image.swift)</div></sub> | <sub><div align='center'>[βœ”οΈ](typescript%2F0048-rotate-image.ts)</div></sub>
489489
<sub>[0054 - Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](cpp%2F0054-spiral-matrix.cpp)</div></sub> | <sub><div align='center'>[βœ”οΈ](csharp%2F0054-spiral-matrix.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](go%2F0054-spiral-matrix.go)</div></sub> | <sub><div align='center'>[βœ”οΈ](java%2F0054-spiral-matrix.java)</div></sub> | <sub><div align='center'>[βœ”οΈ](javascript%2F0054-spiral-matrix.js)</div></sub> | <sub><div align='center'>[βœ”οΈ](kotlin%2F0054-spiral-matrix.kt)</div></sub> | <sub><div align='center'>[βœ”οΈ](python%2F0054-spiral-matrix.py)</div></sub> | <sub><div align='center'>[βœ”οΈ](ruby%2F0054-spiral-matrix.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%2F0054-spiral-matrix.ts)</div></sub>

0 commit comments

Comments
Β (0)