Skip to content

Commit 14daefb

Browse files
committed
πŸ“œ Update README table (πŸ› οΈ from Github Actions)
1 parent d051358 commit 14daefb

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
@@ -248,7 +248,7 @@ If you would like to have collaborator permissions on the repo to merge your own
248248
<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>
249249
<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>
250250
<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>
251-
<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>
251+
<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>
252252
<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>
253253
<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>
254254
<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>

0 commit comments

Comments
Β (0)