📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

README.md

@@ -226,14 +226,14 @@ If you would like to have collaborator permissions on the repo to merge your own
 ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
 <sub>[0208 - Implement Trie Prefix Tree](https://leetcode.com/problems/implement-trie-prefix-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0208-implement-trie-prefix-tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0208-implement-trie-prefix-tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0208-implement-trie-prefix-tree.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F0208-implement-trie-prefix-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0208-implement-trie-prefix-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0208-implement-trie-prefix-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0208-implement-trie-prefix-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0208-implement-trie-prefix-tree.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0208-implement-trie-prefix-tree.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0208-implement-trie-prefix-tree.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0208-implement-trie-prefix-tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0208-implement-trie-prefix-tree.ts)</div></sub>
 <sub>[0211 - Design Add And Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0211-design-add-and-search-words-data-structure.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0211-design-add-and-search-words-data-structure.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F0211-design-add-and-search-words-data-structure.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0211-design-add-and-search-words-data-structure.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0211-design-add-and-search-words-data-structure.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0211-design-add-and-search-words-data-structure.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0211-design-add-and-search-words-data-structure.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0211-design-add-and-search-words-data-structure.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0211-design-add-and-search-words-data-structure.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0211-design-add-and-search-words-data-structure.ts)</div></sub>
-<sub>[0212 - Word Search II](https://leetcode.com/problems/word-search-ii/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0212-word-search-ii.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0212-word-search-ii.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0212-word-search-ii.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0212-word-search-ii.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0212-word-search-ii.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0212-word-search-ii.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0212-word-search-ii.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0212-word-search-ii.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[0212 - Word Search II](https://leetcode.com/problems/word-search-ii/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0212-word-search-ii.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0212-word-search-ii.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F0212-word-search-ii.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0212-word-search-ii.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0212-word-search-ii.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0212-word-search-ii.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0212-word-search-ii.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0212-word-search-ii.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0212-word-search-ii.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
 
 ### Heap / Priority Queue
 
 <sub>Problem</sub> | <sub>C</sub> | <sub>C++</sub> | <sub>C#</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>[0703 - Kth Largest Element In a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)</sub> | <sub><div align='center'>[✔️](c%2F0703-kth-largest-element-in-a-stream.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0703-kth-largest-element-in-a-stream.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0703-kth-largest-element-in-a-stream.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0703-kth-largest-element-in-a-stream.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0703-kth-largest-element-in-a-stream.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0703-kth-largest-element-in-a-stream.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0703-kth-largest-element-in-a-stream.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0703-kth-largest-element-in-a-stream.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0703-kth-largest-element-in-a-stream.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
-<sub>[1046 - Last Stone Weight](https://leetcode.com/problems/last-stone-weight/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1046-Last-Stone-Weight.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F1046-Last-Stone-Weight.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F1046-Last-Stone-Weight.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1046-Last-Stone-Weight.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1046-Last-Stone-Weight.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1046-Last-Stone-Weight.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F1046-Last-Stone-Weight.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%2F1046-Last-Stone-Weight.ts)</div></sub>
+<sub>[0703 - Kth Largest Element In a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)</sub> | <sub><div align='center'>[✔️](c%2F0703-kth-largest-element-in-a-stream.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0703-kth-largest-element-in-a-stream.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0703-kth-largest-element-in-a-stream.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F0703-kth-largest-element-in-a-stream.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0703-kth-largest-element-in-a-stream.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0703-kth-largest-element-in-a-stream.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0703-kth-largest-element-in-a-stream.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0703-kth-largest-element-in-a-stream.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0703-kth-largest-element-in-a-stream.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0703-kth-largest-element-in-a-stream.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[1046 - Last Stone Weight](https://leetcode.com/problems/last-stone-weight/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1046-Last-Stone-Weight.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F1046-Last-Stone-Weight.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F1046-last-stone-weight.go)</div></sub> | <sub><div align='center'>[✔️](java%2F1046-Last-Stone-Weight.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1046-Last-Stone-Weight.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1046-Last-Stone-Weight.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1046-Last-Stone-Weight.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F1046-Last-Stone-Weight.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%2F1046-Last-Stone-Weight.ts)</div></sub>
 <sub>[0973 - K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0973-k-closest-points-to-origin.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0973-k-closest-points-to-origin.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0973-k-closest-points-to-origin.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0973-k-closest-points-to-origin.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0973-k-closest-points-to-origin.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0973-k-closest-points-to-origin.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>[0215 - Kth Largest Element In An Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0215-kth-largest-element-in-an-array.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0215-kth-largest-element-in-an-array.cs)</div></sub> | <sub><div align='center'>[✔️](go%2F0215-kth-largest-element-in-an-array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0215-kth-largest-element-in-an-array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0215-kth-largest-element-in-an-array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0215-kth-largest-element-in-an-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0215-kth-largest-element-in-an-array.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%2F0215-kth-largest-element-in-an-array.ts)</div></sub>
 <sub>[0621 - Task Scheduler](https://leetcode.com/problems/task-scheduler/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0621-task-scheduler.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0621-task-scheduler.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0621-task-scheduler.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0621-task-scheduler.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0621-task-scheduler.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0621-task-scheduler.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%2F0621-task-scheduler.ts)</div></sub>