📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

README.md

@@ -307,7 +307,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0079 - Word Search](https://leetcode.com/problems/word-search/)</sub> | <sub><div align='center'>[✔️](c%2F0079-word-search.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0079-word-search.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0079-word-search.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0079-word-search.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0079-word-search.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0079-word-search.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0079-word-search.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0079-word-search.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0079-word-search.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0079-word-search.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0079-word-search.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0131 - Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0131-palindrome-partitioning.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0131-palindrome-partitioning.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0131-palindrome-partitioning.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0131-palindrome-partitioning.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0131-palindrome-partitioning.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0131-palindrome-partitioning.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0131-palindrome-partitioning.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0131-palindrome-partitioning.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0131-palindrome-partitioning.ts)</div></sub>
 <sub>[0093 - Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)</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'>[✔️](go%2F0093-restore-ip-addresses.go)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F0093-restore-ip-addresses.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0093-restore-ip-addresses.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0093-restore-ip-addresses.ts)</div></sub>
-<sub>[0017 - Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0017-letter-combinations-of-a-phone-number.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0017-letter-combinations-of-a-phone-number.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0017-letter-combinations-of-a-phone-number.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0017-letter-combinations-of-a-phone-number.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0017-letter-combinations-of-a-phone-number.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0017-letter-combinations-of-a-phone-number.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0017-letter-combinations-of-a-phone-number.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0017-letter-combinations-of-a-phone-number.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0017-letter-combinations-of-a-phone-number.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0017-letter-combinations-of-a-phone-number.ts)</div></sub>
+<sub>[0017 - Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0017-letter-combinations-of-a-phone-number.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0017-letter-combinations-of-a-phone-number.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0017-letter-combinations-of-a-phone-number.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0017-letter-combinations-of-a-phone-number.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0017-letter-combinations-of-a-phone-number.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0017-letter-combinations-of-a-phone-number.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0017-letter-combinations-of-a-phone-number.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0017-letter-combinations-of-a-phone-number.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0017-letter-combinations-of-a-phone-number.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0017-letter-combinations-of-a-phone-number.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0017-letter-combinations-of-a-phone-number.ts)</div></sub>
 <sub>[0473 - Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0473-matchsticks-to-square.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'>[✔️](javascript%2F0473-matchsticks-to-square.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0473-matchsticks-to-square.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>[1849 - Splitting a String Into Descending Consecutive Values](https://leetcode.com/problems/splitting-a-string-into-descending-consecutive-values/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1849-splitting-a-string-into-descending-consecutive-values.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'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F1849-splitting-a-string-into-descending-consecutive-values.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>[1980 - Find Unique Binary String](https://leetcode.com/problems/find-unique-binary-string/)</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'>[✔️](kotlin%2F1980-find-unique-binary-string.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1980-find-unique-binary-string.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>
@@ -367,7 +367,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0332 - Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0332-reconstruct-itinerary.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0332-reconstruct-itinerary.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0332-reconstruct-itinerary.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0332-reconstruct-itinerary.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0332-reconstruct-itinerary.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0332-reconstruct-itinerary.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0332-reconstruct-itinerary.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>[1584 - Min Cost to Connect All Points](https://leetcode.com/problems/min-cost-to-connect-all-points/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1584-Min-Cost-To-Connect-All-Points.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F1584-Min-Cost-to-Connect-All-Points.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F1584-min-cost-to-connect-all-points.go)</div></sub> | <sub><div align='center'>[✔️](java%2F1584-Min-Cost-to-Connect-All-Points.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1584-Min-Cost-to-Connect-all-Points.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1584-min-cost-to-connect-all-points.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1584-min-cost-to-connect-all-points.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F1584-Min-Cost-to-Connect-All-Points.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F1584-Min-Cost-to-Connect-All-Points.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0743 - Network Delay Time](https://leetcode.com/problems/network-delay-time/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0743-network-delay-time.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0743-network-delay-time.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0743-network-delay-time.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0743-network-delay-time.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0743-network-delay-time.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0743-network-delay-time.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0743-network-delay-time.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>[1514 - Path with Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability/)</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%2F1514-path-with-maximum-probability.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1514-Path-With-Maximum-Probability.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1514-path-with-maximum-probability.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1514-path-with-maximum-probability.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>[1514 - Path with Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1514-path-with-maximum-probability.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%2F1514-path-with-maximum-probability.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F1514-Path-With-Maximum-Probability.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1514-path-with-maximum-probability.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1514-path-with-maximum-probability.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>[0778 - Swim In Rising Water](https://leetcode.com/problems/swim-in-rising-water/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0778-swim-in-rising-water.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0778-swim-in-rising-water.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0778-swim-in-rising-water.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0778-swim-in-rising-water.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0778-swim-in-rising-water.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0778-swim-in-rising-water.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0778-swim-in-rising-water.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0778-swim-in-rising-water.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0269 - Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0269-alien-dictionary.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0269-alien-dictionary.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0269-alien-dictionary.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0269-alien-dictionary.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0269-alien-dictionary.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>[0787 - Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0787-cheapest-flights-within-k-stops.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0787-cheapest-flights-within-k-stops.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0787-cheapest-flights-within-k-stops.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0787-cheapest-flights-within-k-stops.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0787-cheapest-flights-within-k-stops.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0787-cheapest-flights-within-k-stops.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0787-cheapest-flights-within-k-stops.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%2F0787-cheapest-flights-within-k-stops.ts)</div></sub>