_{[0560 - Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/)} | _{<div align='center'>[✔️](c%2F0560-subarray-sum-equals-k.c)</div>} | _{<div align='center'>[✔️](cpp%2F0560-subarray-sum-equals-k.cpp)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0560-subarray-sum-equals-k.go)</div>} | _{<div align='center'>[✔️](java%2F0560-subarray-sum-equals-k.java)</div>} | _{<div align='center'>[✔️](javascript%2F0560-subarray-sum-equals-k.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0560-subarray-sum-equals-k.kt)</div>} | _{<div align='center'>[✔️](python%2F0560-subarray-sum-equals-k.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](rust%2F0560-subarray-sum-equals-k.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](typescript%2F0560-subarray-sum-equals-k.ts)</div>}

_{[1930 - Unique Length 3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/)} | _{<div align='center'>[✔️](c%2F1930-unique-length-3-palindromic-subsequences.c)</div>} | _{<div align='center'>[✔️](cpp%2F1930-unique-length-3-palindromic-subsequences.cpp)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](java%2F1930-unique-length-3-palindromic-subsequences.java)</div>} | _{<div align='center'>[✔️](javascript%2F1930-unique-length-3-palindromic-subsequences.js)</div>} | _{<div align='center'>[✔️](kotlin%2F1930-unique-length-3-palindromic-subsequences.kt)</div>} | _{<div align='center'>[✔️](python%2F1930-unique-length-3-palindromic-subsequences.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](rust%2F1930-unique-length-3-palindromic-subsequences.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](typescript%2F1930-unique-length-3-palindromic-subsequences.ts)</div>}

_{[1963 - Minimum Number of Swaps to Make The String Balanced](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/)} | _{<div align='center'>[✔️](c%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.c)</div>} | _{<div align='center'>[✔️](cpp%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.cpp)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](java%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.java)</div>} | _{<div align='center'>[✔️](javascript%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.js)</div>} | _{<div align='center'>[✔️](kotlin%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.kt)</div>} | _{<div align='center'>[✔️](python%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>}

_{[2001 - Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/)} | _{<div align='center'>[✔️](c%2F2001-number-of-pairs-of-interchangeable-rectangles.c)</div>} | _{<div align='center'>[✔️](cpp%2F2001-number-of-pairs-of-interchangeable-rectangles.cpp)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](javascript%2F2001-number-of-pairs-of-interchangeable-rectangles.js)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](python%2F2001-number-of-pairs-of-interchangeable-rectangles.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](rust%2F2001-number-of-pairs-of-interchangeable-rectangles.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>}

_{[2001 - Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/)} | _{<div align='center'>[✔️](c%2F2001-number-of-pairs-of-interchangeable-rectangles.c)</div>} | _{<div align='center'>[✔️](cpp%2F2001-number-of-pairs-of-interchangeable-rectangles.cpp)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](java%2F2001-number-of-pairs-of-interchangeable-rectangles.java)</div>} | _{<div align='center'>[✔️](javascript%2F2001-number-of-pairs-of-interchangeable-rectangles.js)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](python%2F2001-number-of-pairs-of-interchangeable-rectangles.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](rust%2F2001-number-of-pairs-of-interchangeable-rectangles.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>}

_{[2002 - Maximum Product of The Length of Two Palindromic Subsequences](https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/)} | _{<div align='center'>[✔️](c%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.c)</div>} | _{<div align='center'>[✔️](cpp%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.cpp)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.go)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](kotlin%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.kt)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](rust%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.rs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>}

_{[2017 - Grid Game](https://leetcode.com/problems/grid-game/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F2017-grid-game.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F2017-grid-game.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0438 - Find All Anagrams In a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/)} | _{<div align='center'>[✔️](c%2F0438-find-all-anagrams-in-a-string.c)</div>} | _{<div align='center'>[✔️](cpp%2F0438-find-all-anagrams-in-a-string.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0438-find-all-anagrams-in-a-string.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0438-find-all-anagrams-in-a-string.go)</div>} | _{<div align='center'>[✔️](java%2F0438-find-all-anagrams-in-a-string.java)</div>} | _{<div align='center'>[✔️](javascript%2F0438-find-all-anagrams-in-a-string.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0438-find-all-anagrams-in-a-string.kt)</div>} | _{<div align='center'>[✔️](python%2F0438-find-all-anagrams-in-a-string.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>}