Don't edit README

Author: Ykhan799

README.md

@@ -63,7 +63,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <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'>[✔️](kotlin%2F0122-best-time-to-buy-and-sell-stock-ii.kt)</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'>[✔️](rust%2F0122-best-time-to-buy-and-sell-stock-ii.rs)</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'>[✔️](csharp%2F0560-subarray-sum-equals-k.cs)</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'>[✔️](c%2F1930-unique-length-3-palindromic-subsequences.c)</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'>[✔️](javascript%2F1930-unique-length-3-palindromic-subsequences.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1930-unique-length-3-palindromic-subsequences.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1930-unique-length-3-palindromic-subsequences.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F1930-unique-length-3-palindromic-subsequences.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F1930-unique-length-3-palindromic-subsequences.ts)</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'>[✔️](go%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.go)</div></sub> | <sub><div align='center'>[✔️](java%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.java)</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'>[✔️](rust%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.rs)</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'>[✔️](java%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.java)</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'>[✔️](rust%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.rs)</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'>[✔️](c%2F2001-number-of-pairs-of-interchangeable-rectangles.c)</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'>[✔️](java%2F2001-number-of-pairs-of-interchangeable-rectangles.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F2001-number-of-pairs-of-interchangeable-rectangles.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2001-number-of-pairs-of-interchangeable-rectangles.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F2001-number-of-pairs-of-interchangeable-rectangles.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F2001-number-of-pairs-of-interchangeable-rectangles.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[2002 - Maximum Product of The Length of Two Palindromic Subsequences](https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/)</sub> | <sub><div align='center'>[✔️](c%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.go)</div></sub> | <sub><div align='center'>[✔️](java%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.ts)</div></sub>
 <sub>[2017 - Grid Game](https://leetcode.com/problems/grid-game/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F2017-grid-game.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%2F2017-grid-game.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F2017-grid-game.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2017-grid-game.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F2017-grid-game.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F2017-grid-game.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>