📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

README.md

@@ -182,7 +182,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[1898 - Maximum Number of Removable Characters](https://leetcode.com/problems/maximum-number-of-removable-characters/)</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%2F1898-maximum-number-of-removable-characters.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1898-maximum-number-of-removable-characters.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>[0116 - Populating Next Right Pointers In Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0116-populating-next-right-pointers-in-each-node.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0116-populating-next-right-pointers-in-each-node.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0116-populating-next-right-pointers-in-each-node.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0116-populating-next-right-pointers-in-each-node.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0116-populating-next-right-pointers-in-each-node.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>[1268 - Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)</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%2F1268-search-suggestions-system.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1268-search-suggestions-system.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1268-search-suggestions-system.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>[0410 - Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-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%2F0410-split-array-largest-sum.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0410-split-array-largest-sum.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0410-split-array-largest-sum.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>[0410 - Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-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'>[✔️](java%2F0410-split-array-largest-sum.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0410-split-array-largest-sum.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0410-split-array-largest-sum.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0410-split-array-largest-sum.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>[0004 - Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)</sub> | <sub><div align='center'>[✔️](c%2F0004-median-of-two-sorted-arrays.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0004-median-of-two-sorted-arrays.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0004-median-of-two-sorted-arrays.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0004-median-of-two-sorted-arrays.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0004-median-of-two-sorted-arrays.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0004-median-of-two-sorted-arrays.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0004-median-of-two-sorted-arrays.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0004-median-of-two-sorted-arrays.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0004-median-of-two-sorted-arrays.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0004-median-of-two-sorted-arrays.ts)</div></sub>
 
 ### Linked List
@@ -224,7 +224,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>Problem</sub> | <sub>C</sub> | <sub>C++</sub> | <sub>C#</sub> | <sub>Dart</sub> | <sub>GO</sub> | <sub>Java</sub> | <sub>JS</sub> | <sub>Kotlin</sub> | <sub>Python</sub> | <sub>Ruby</sub> | <sub>Rust</sub> | <sub>Scala</sub> | <sub>Swift</sub> | <sub>TS</sub>
 ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
 <sub>[0094 - Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)</sub> | <sub><div align='center'>[✔️](c%2F0094-binary-tree-inorder-traversal.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0094-binary-tree-inorder-traversal.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0094-binary-tree-inorder-traversal.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0094-binary-tree-inorder-traversal.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0094-binary-tree-inorder-traversal.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0094-binary-tree-inorder-traversal.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0094-binary-tree-inorder-traversal.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0094-binary-tree-inorder-traversal.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0094-binary-tree-inorder-traversal.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0094-binary-tree-inorder-traversal.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0094-binary-tree-inorder-traversal.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0094-binary-tree-inorder-traversal.ts)</div></sub>
-<sub>[0144 - Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0144-binary-tree-preorder-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%2F0144-binary-tree-preorder-traversal.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0144-binary-tree-preorder-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%2F0144-binary-tree-preorder-traversal.ts)</div></sub>
+<sub>[0144 - Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0144-binary-tree-preorder-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'>[✔️](java%2F0144-binary-tree-preorder-traversal.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0144-binary-tree-preorder-traversal.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0144-binary-tree-preorder-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%2F0144-binary-tree-preorder-traversal.ts)</div></sub>
 <sub>[0145 - Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0145-binary-tree-postorder-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'>[✔️](java%2F0145-binary-tree-postorder-traversal.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0145-binary-tree-postorder-traversal.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0145-binary-tree-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'>[✔️](typescript%2F0145-binary-tree-postorder-traversal.ts)</div></sub>
 <sub>[0226 - Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0226-invert-binary-tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0226-invert-binary-tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0226-invert-binary-tree.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0226-invert-binary-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0226-invert-binary-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0226-invert-binary-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0226-invert-binary-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0226-invert-binary-tree.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0226-invert-binary-tree.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0226-invert-binary-tree.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0226-invert-binary-tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0226-invert-binary-tree.ts)</div></sub>
 <sub>[0104 - Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0104-maximum-depth-of-binary-tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0104-maximum-depth-of-binary-tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0104-maximum-depth-of-binary-tree.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0104-maximum-depth-of-binary-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0104-maximum-depth-of-binary-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0104-maximum-depth-of-binary-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0104-maximum-depth-of-binary-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0104-maximum-depth-of-binary-tree.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0104-maximum-depth-of-binary-tree.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0104-maximum-depth-of-binary-tree.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0104-maximum-depth-of-binary-tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0104-maximum-depth-of-binary-tree.ts)</div></sub>