📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

Diff for: README.md

@@ -56,7 +56,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0535 - Encode And Decode Tinyurl](https://leetcode.com/problems/encode-and-decode-tinyurl/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0535-encode-and-decode-tinyurl.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0535-encode-and-decode-tinyurl.go)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F0535-encode-and-decode-tinyurl.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0535-encode-and-decode-tinyurl.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0535-encode-and-decode-tinyURL.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0535-Encode-and-Decode-TinyURL.Swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0535-encode-and-decode-tinyurl.ts)</div></sub>
 <sub>[0554 - Brick Wall](https://leetcode.com/problems/brick-wall/)</sub> | <sub><div align='center'>[✔️](c%2F0554-Brick-Wall.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0554-brick-wall.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%2F0554-brick-wall.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0554-brick-wall.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0554-Brick-Wall.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%2F0554-brick-wall.ts)</div></sub>
 <sub>[0122 - Best Time to Buy And Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)</sub> | <sub><div align='center'>[✔️](c%2F0122-best-time-to-buy-and-sell-stock-ii.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0122-best-time-to-buy-and-sell-stock-ii.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0122-best-time-to-buy-and-sell-stock-ii.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0122-best-time-to-buy-and-sell-stock-II.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0122-best-time-to-buy-and-sell-stock-ii.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0122-best-time-to-buy-and-sell-stock-II.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>[0560 - Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/)</sub> | <sub><div align='center'>[✔️](c%2F0560-subarray-sum-equals-k.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0560-subarray-sum-equals-k.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0560-subarray-sum-equals-k.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0560-subarray-sum-equals-k.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0560-subarray-sum-equals-k.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0560-subarray-sum-equals-k.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0560-subarray-sum-equals-k.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0560-subarray-sum-equals-k.ts)</div></sub>
+<sub>[0560 - Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/)</sub> | <sub><div align='center'>[✔️](c%2F0560-subarray-sum-equals-k.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0560-subarray-sum-equals-k.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0560-subarray-sum-equals-k.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0560-subarray-sum-equals-k.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0560-subarray-sum-equals-k.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0560-subarray-sum-equals-k.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0560-subarray-sum-equals-k.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0560-subarray-sum-equals-k.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0560-subarray-sum-equals-k.ts)</div></sub>
 <sub>[1930 - Unique Length 3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1930-unique-length-3-palindromic-subsequences.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%2F1930-unique-length-3-palindromic-subsequences.java)</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'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[1963 - Minimum Number of Swaps to Make The String Balanced](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/)</sub> | <sub><div align='center'>[✔️](c%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.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%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.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>[2001 - Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F2001-number-of-pairs-of-interchangeable-rectangles.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%2F2001-number-of-pairs-of-interchangeable-rectangles.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'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>