📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

README.md

@@ -153,7 +153,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0402 - Remove K Digits](https://leetcode.com/problems/remove-k-digits/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0402-remove-k-digits.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%2F0402-remove-k-digits.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0402-remove-k-digits.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0402-remove-k-digits.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0402-remove-k-digits.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0402-remove-k-digits.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0402-remove-k-digits.ts)</div></sub>
 <sub>[1209 - Remove All Adjacent Duplicates In String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1209-Remove-All-Adjacent-Duplicates-in-String-II.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%2F1209-remove-all-adjacent-duplicates-in-string-ii.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1209-Remove-All-Adjacent-Duplicates-in-String-II.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1209-remove-all-adjacent-duplicates-in-string-ii.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1209-remove-all-adjacent-duplicates-in-string-ii.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F1209-remove-all-adjacent-duplicates-in-string-II.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F1209-remove-all-adjacent-duplicates-in-string-II.ts)</div></sub>
 <sub>[0456 - 132 Pattern](https://leetcode.com/problems/132-pattern/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0456-132-pattern.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%2F0456-132-pattern.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0456-132-pattern.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0456-132-pattern.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0456-132-pattern.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0456-132-pattern.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0456-132-pattern.ts)</div></sub>
-<sub>[0895 - Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/)</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%2F0895-maximum-frequency-stack.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0895-maximum-frequency-stack.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0895-maximum-frequency-stack.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0895-maximum-frequency-stack.ts)</div></sub>
+<sub>[0895 - Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/)</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%2F0895-maximum-frequency-stack.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0895-maximum-frequency-stack.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0895-maximum-frequency-stack.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0895-maximum-frequency-stack.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0895-maximum-frequency-stack.ts)</div></sub>
 <sub>[0084 - Largest Rectangle In Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)</sub> | <sub><div align='center'>[✔️](c%2F0084-largest-rectangle-in-histogram.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0084-largest-rectangle-in-histogram.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0084-largest-rectangle-in-histogram.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0084-largest-rectangle-in-histogram.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0084-largest-rectangle-in-histogram.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0084-largest-rectangle-in-histogram.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0084-largest-rectangle-in-histogram.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0084-largest-rectangle-in-histogram.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0084-largest-rectangle-in-histogram.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0084-largest-rectangle-in-histogram.ts)</div></sub>
 
 ### Binary Search