_{[0122 - Best Time to Buy And Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)} | _{<divalign='center'>[✔️](c%2F0122-best-time-to-buy-and-sell-stock-ii.c)</div>} | _{<divalign='center'>[✔️](cpp%2F0122-best-time-to-buy-and-sell-stock-ii.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](go%2F0122-best-time-to-buy-and-sell-stock-ii.go)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](javascript%2F0122-best-time-to-buy-and-sell-stock-ii.js)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

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

_{[1930 - Unique Length 3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F1930-unique-length-3-palindromic-subsequences.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F1930-unique-length-3-palindromic-subsequences.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[1963 - Minimum Number of Swaps to Make The String Balanced](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](javascript%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.js)</div>} | _{<divalign='center'>[✔️](kotlin%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</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'>❌</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/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F2001-number-of-pairs-of-interchangeable-rectangles.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](javascript%2F2001-number-of-pairs-of-interchangeable-rectangles.js)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='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/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='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>}