📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

README.md

@@ -179,7 +179,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0081 - Search In Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)</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%2F0081-search-in-rotated-sorted-array-ii.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0081-search-in-rotated-sorted-array-ii.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>[0981 - Time Based Key Value Store](https://leetcode.com/problems/time-based-key-value-store/)</sub> | <sub><div align='center'>[✔️](c%2F0981-time-based-key-value-store.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0981-time-based-key-value-store.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0981-time-based-key-value-store.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0981-time-based-key-value-store.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0981-time-based-key-value-store.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0981-time-based-key-value-store.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0981-time-based-key-value-store.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0981-time-based-key-value-store.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0981-Time-Based-Key-Value-Store.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0981-time-based-key-value-store.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0981-time-based-key-value-store.ts)</div></sub>
 <sub>[0034 - Find First And Last Position of Element In Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0034-find-first-and-last-position-of-element-in-sorted-array.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0034-find-first-and-last-position-of-element-in-sorted-array.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0034-find-first-and-last-position-of-element-in-sorted-array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0034-find-first-and-last-position-of-element-in-sorted-array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0034-find-first-and-last-position-of-element-in-sorted-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0034-find-first-and-last-position-of-element-in-sorted-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'>[✔️](swift%2F0034-find-first-and-last-position-of-element-in-sorted-array.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
-<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>[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'>[✔️](java%2F1898-maximum-number-of-removable-characters.java)</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'>[✔️](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>