📜 Update README table (🛠️ from Github Actions)

README.md

@@ -215,7 +215,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0230 - Kth Smallest Element In a Bst](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)</sub> | <sub><div align='center'>[✔️](c%2F0230-kth-smallest-element-in-a-bst.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0230-kth-smallest-element-in-a-bst.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0230-kth-smallest-element-in-a-bst.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0230-kth-smallest-element-in-a-bst.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0230-kth-smallest-element-in-a-bst.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0230-kth-smallest-element-in-a-bst.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0230-kth-smallest-element-in-a-bst.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0230-kth-smallest-element-in-a-bst.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](scala%2F0230-kth-smallest-element-in-a-bst.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F0230-kth-smallest-element-in-a-bst.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0230-kth-smallest-element-in-a-bst.ts)</div></sub>
 <sub>[0105 - Construct Binary Tree From Preorder And Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)</sub> | <sub><div align='center'>[✔️](c%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0105-construct-binary-tree-from-preorder-and-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%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.ts)</div></sub>
 <sub>[0096 - Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)</sub> | <sub><div align='center'>[✔️](c%2F0096-unique-binary-search-trees.c)</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>
-<sub>[0129 - Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)</sub> | <sub><div align='center'>[✔️](c%2F0129-sum-root-to-leaf-numbers.c)</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%2F0129-sum-root-to-leaf-numbers.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0129-sum-root-to-leaf-numbers.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>[0129 - Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)</sub> | <sub><div align='center'>[✔️](c%2F0129-sum-root-to-leaf-numbers.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0129-sum-root-to-leaf-numbers.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%2F0129-sum-root-to-leaf-numbers.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0129-sum-root-to-leaf-numbers.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>[0337 - House Robber III](https://leetcode.com/problems/house-robber-iii/)</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>
 <sub>[0951 - Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/)</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>
 <sub>[1993 - Operations On Tree](https://leetcode.com/problems/operations-on-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'>❌</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>