# [LeetCode](https://leetcode.com/problemset/algorithms/) [![License](https://img.shields.io/badge/license-Apache_2.0-blue.svg)](LICENSE.md) [![Build Status](https://travis-ci.org/fishercoder1534/Leetcode.svg?branch=master)](https://travis-ci.org/fishercoder1534/Leetcode) ![Language](https://img.shields.io/badge/language-Java%20%2F%20MySQL%20%2F%20Bash-blue.svg) _If you like this project, please leave me a star._ ★ > ["For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby."](https://www.quora.com/How-effective-is-Leetcode-for-preparing-for-technical-interviews) ## Algorithms | # | Title | Solutions | Video | Difficulty | Tag |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|------------- | 2363 |[Merge Similar Items](https://leetcode.com/problems/merge-similar-items/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2363.java) || Easy || | 2357 |[Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2357.java) || Easy || | 2352 |[Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2352.java) || Medium || | 2351 |[First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2351.java) || Easy || | 2347 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/best-poker-hand/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2347.java) || Easy || | 2341 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2341.java) || Easy || | 2335 |[Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2335.java) || Easy || | 2331 |[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2331.java) || Easy || | 2326 |[Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2326.java) || Medium || | 2325 |[Decode the Message](https://leetcode.com/problems/decode-the-message/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2325.java) || Easy || | 2319 |[Check if Matrix Is X-Matrix](https://leetcode.com/problems/check-if-matrix-is-x-matrix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2319.java) || Easy || | 2315 |[Count Asterisks](https://leetcode.com/problems/count-asterisks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2315.java) || Easy || | 2309 |[Greatest English Letter in Upper and Lower Case](https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2309.java) || Easy || | 2303 |[Calculate Amount Paid in Taxes](https://leetcode.com/problems/calculate-amount-paid-in-taxes/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2303.java) || Easy || | 2299 |[Strong Password Checker II](https://leetcode.com/problems/strong-password-checker-ii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2299.java) || Easy || | 2293 |[Min Max Game](https://leetcode.com/problems/min-max-game/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2293.java) || Easy || | 2288 |[Apply Discount to Prices](https://leetcode.com/problems/apply-discount-to-prices/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2288.java) || Medium || | 2287 |[Rearrange Characters to Make Target String](https://leetcode.com/problems/rearrange-characters-to-make-target-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2288.java) || Easy || | 2284 |[Sender With Largest Word Count](https://leetcode.com/problems/sender-with-largest-word-count/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2284.java) || Medium || | 2283 |[Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2283.java) || Easy || | 2279 |[Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2279.java) || Medium || | 2278 |[Percentage of Letter in String](https://leetcode.com/problems/percentage-of-letter-in-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2278.java) || Easy || | 2270 |[Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2270.java) || Medium || | 2269 |[Find the K-Beauty of a Number](https://leetcode.com/problems/find-the-k-beauty-of-a-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2269.java) || Easy || | 2264 |[Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2264.java) || Easy || | 2260 |[Minimum Consecutive Cards to Pick Up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2260.java) || Medium || | 2259 |[Remove Digit From Number to Maximize Result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2259.java) || Easy || | 2256 |[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2256.java) || Medium || | 2255 |[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2255.java) || Easy || | 2248 |[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2248.java) || Easy || | 2244 |[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2244.java) || Medium || | 2243 |[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2243.java) || Easy || | 2239 |[Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2239.java) || Easy || | 2236 |[Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2236.java) || Easy || | 2229 |[Check if an Array Is Consecutive](https://leetcode.com/problems/check-if-an-array-is-consecutive/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2229.java) || Easy || | 2220 |[Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2220.java) || Easy || | 2215 |[Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2215.java) || Easy || | 2210 |[Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2210.java) || Easy || | 2208 |[Minimum Operations to Halve Array Sum](https://leetcode.com/problems/minimum-operations-to-halve-array-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2208.java) || Medium || | 2206 |[Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2206.java) || Easy || | 2201 |[Count Artifacts That Can Be Extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2201.java) || Medium || | 2200 |[Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2200.java) || Easy || | 2194 |[Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2194.java) || Easy || | 2190 |[Most Frequent Number Following Key In an Array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2190.java) || Easy || | 2186 |[Minimum Number of Steps to Make Two Strings Anagram II](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2186.java) || Medium || | 2185 |[Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2185.java) || Easy || | 2182 |[Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2182.java) || Medium || | 2181 |[Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2181.java) || Medium || | 2180 |[Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2180.java) || Easy || | 2177 |[Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2177.java) || Medium || | 2176 |[Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2176.java) || Easy || | 2169 |[Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2169.java) || Easy || | 2166 |[Design Bitset](https://leetcode.com/problems/design-bitset/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2166.java) || Medium || | 2165 |[Smallest Value of the Rearranged Number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2165.java) || Medium || | 2164 |[Sort Even and Odd Indices Independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2164.java) || Easy || | 2161 |[Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2161.java) || Medium || | 2160 |[Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2160.java) || Easy || | 2156 |[Find Substring With Given Hash Value](https://leetcode.com/problems/find-substring-with-given-hash-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2156.java) || Medium || | 2155 |[All Divisions With the Highest Score of a Binary Array](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2155.java) || Medium || | 2154 |[Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2154.java) || Easy || | 2150 |[Find All Lonely Numbers in the Array](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2150.java) || Medium || | 2149 |[Rearrange Array Elements by Sign](https://leetcode.com/problems/rearrange-array-elements-by-sign/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2149.java) || Medium || | 2148 |[Count Elements With Strictly Smaller and Greater Elements](https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2148.java) || Easy || | 2144 |[Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2144.java) || Easy || | 2139 |[Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2139.java) || Medium || | 2138 |[Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2138.java) || Easy || | 2134 |[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2134.java) || Medium || | 2133 |[Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2133.java) || Easy || | 2130 |[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2130.java) || Medium || | 2129 |[Capitalize the Title](https://leetcode.com/problems/capitalize-the-title/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2129.java) || Easy || | 2126 |[Destroying Asteroids](https://leetcode.com/problems/destroying-asteroids/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2126.java) || Medium || | 2125 |[Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2125.java) || Medium || | 2124 |[Check if All A's Appears Before All B's](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2124.java) || Easy || | 2120 |[Execution of All Suffix Instructions Staying in a Grid](https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2120.java) || Medium || | 2119 |[A Number After a Double Reversal](https://leetcode.com/problems/a-number-after-a-double-reversal/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2119.java) || Easy || | 2116 |[Check if a Parentheses String Can Be Valid](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2116.java) || Medium || | 2114 |[Maximum Number of Words Found in Sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2114.java) || Easy || | 2110 |[Number of Smooth Descent Periods of a Stock](https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2110.java) || Medium || | 2109 |[Adding Spaces to a String](https://leetcode.com/problems/adding-spaces-to-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2109.java) || Medium || | 2108 |[Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2108.java) || Easy || | 2103 |[Rings and Rods](https://leetcode.com/problems/rings-and-rods/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2103.java) || Easy || | 2099 |[Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2099.java) || Easy || | 2095 |[Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2095.java) || Medium || | 2094 |[Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2094.java) || Easy || | 2091 |[Removing Minimum and Maximum From Array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2091.java) || Medium || | 2090 |[K Radius Subarray Averages](https://leetcode.com/problems/k-radius-subarray-averages/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2090.java) || Medium || | 2089 |[Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2089.java) || Easy || | 2086 |[Minimum Number of Buckets Required to Collect Rainwater from Houses](https://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2086.java) || Medium || | 2085 |[Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2085.java) || Easy || | 2080 |[Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2080.java) || Medium | Array, Binary Search | | 2079 |[Watering Plants](https://leetcode.com/problems/watering-plants/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2079.java) || Medium || | 2078 |[Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2078.java) || Easy || | 2076 |[Process Restricted Friend Requests](https://leetcode.com/problems/process-restricted-friend-requests/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2076.java) || Hard || | 2075 |[Decode the Slanted Ciphertext](https://leetcode.com/problems/decode-the-slanted-ciphertext/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2075.java) || Medium || | 2074 |[Reverse Nodes in Even Length Groups](https://leetcode.com/problems/reverse-nodes-in-even-length-groups/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2074.java) || Medium || | 2073 |[Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2073.java) || Easy || | 2070 |[Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2070.java) || Medium || | 2068 |[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2068.java) || Easy || | 2063 |[Vowels of All Substrings](https://leetcode.com/problems/vowels-of-all-substrings/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2063.java) || Medium || | 2062 |[Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2062.java) || Easy || | 2058 |[Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2058.java) || Medium || | 2057 |[Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2057.java) || Easy || | 2055 |[Plates Between Candles](https://leetcode.com/problems/plates-between-candles/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2055.java) || Medium || | 2054 |[Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2054.java) || Medium || | 2053 |[Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2053.java) || Easy || | 2050 |[Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2050.java) || Hard || | 2048 |[Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2048.java) || Medium || | 2047 |[Number of Valid Words in a Sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2047.java) || Easy || | 2044 |[Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2044.java) || Medium || | 2043 |[Simple Bank System](https://leetcode.com/problems/simple-bank-system/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2043.java) || Medium || | 2042 |[Check if Numbers Are Ascending in a Sentence](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2042.java) || Easy || | 2039 |[The Time When the Network Becomes Idle](https://leetcode.com/problems/the-time-when-the-network-becomes-idle/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2039.java) || Medium || | 2038 |[Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2038.java) || Medium || | 2037 |[Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2037.java) || Easy || | 2034 |[Stock Price Fluctuation](https://leetcode.com/problems/stock-price-fluctuation/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2034.java) || Medium || | 2033 |[Minimum Operations to Make a Uni-Value Grid](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2033.java) || Medium || | 2032 |[Two Out of Three](https://leetcode.com/problems/two-out-of-three/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2032.java) || Easy || | 2028 |[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2028.java) || Medium || | 2027 |[Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2027.java) || Easy || | 2024 |[Maximize the Confusion of an Exam](https://leetcode.com/problems/maximize-the-confusion-of-an-exam/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2024.java) || Medium || | 2023 |[Number of Pairs of Strings With Concatenation Equal to Target](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2023.java) || Medium || | 2022 |[Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2022.java) || Easy || | 2018 |[Check if Word Can Be Placed In Crossword](https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2018.java) || Medium || | 2017 |[Grid Game](https://leetcode.com/problems/grid-game/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2017.java) || Medium | Array, Matrix, Prefix Sum | | 2016 |[Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2016.java) || Easy || | 2012 |[Sum of Beauty in the Array](https://leetcode.com/problems/sum-of-beauty-in-the-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2012.java) || Medium || | 2011 |[Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2011.java) || Easy || | 2007 |[Find Original Array From Doubled Array](https://leetcode.com/problems/find-original-array-from-doubled-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2007.java) || Medium || | 2006 |[Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2006.java) || Easy || | 2001 |[Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/)| [Python3](../master/python3/2001.py), [Java](../master/src/main/java/com/fishercoder/solutions/_2001.java) || Medium || | 2000 |[Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_2000.java) || Easy || | 1996 |[The Number of Weak Characters in the Game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1996.java) || Medium || | 1995 |[Count Special Quadruplets](https://leetcode.com/problems/count-special-quadruplets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1995.java) || Easy || | 1992 |[Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1992.java) || Medium || | 1991 |[Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1991.java) || Easy || | 1985 |[Find the Kth Largest Integer in the Array](https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1985.java) || Medium || | 1984 |[Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1984.java) || Easy || | 1981 |[Minimize the Difference Between Target and Chosen Elements](https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1981.java) || Medium | DP | | 1980 |[Find Unique Binary String](https://leetcode.com/problems/find-unique-binary-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1980.java) || Medium || | 1979 |[Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1979.java) || Easy || | 1974 |[Minimum Time to Type Word Using Special Typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1974.java) || Easy || | 1971 |[Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1971.java) || Easy | BFS, DFS, Graph | | 1968 |[Array With Elements Not Equal to Average of Neighbors](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1968.java) || Medium || | 1967 |[Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1967.java) || Easy || | 1966 |[Binary Searchable Numbers in an Unsorted Array](https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1966.java) || Medium | Array, Binary Search | | 1961 |[Check If String Is a Prefix of Array](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1961.java) || Easy || | 1957 |[Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1957.java) || Easy | String | | 1952 |[Three Divisors](https://leetcode.com/problems/three-divisors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1952.java) || Easy || | 1945 |[Sum of Digits of String After Convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1945.java) || Easy || | 1941 |[Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1941.java) || Easy || | 1936 |[Add Minimum Number of Rungs](https://leetcode.com/problems/add-minimum-number-of-rungs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1936.java) || Medium || | 1935 |[Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1935.java) || Easy | String | | 1933 |[Check if String Is Decomposable Into Value-Equal Substrings](https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1933.java) || Easy | String | | 1929 |[Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1929.java) || Easy || | 1926 |[Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1926.java) || Medium | DP, DFS, BFS | | 1925 |[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1925.java) || Easy | Array, Greedy | | 1920 |[Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1920.java) || Easy || | 1913 |[Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1913.java) || Easy | Sort | | 1910 |[Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) | [:tv:](https://youtu.be/d74CJIqw268) | Medium |String| | 1909 |[Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1909.java) || Easy | Array | | 1904 |[The Number of Full Rounds You Have Played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) || Medium | String, Greedy | | 1903 |[Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1903.java) | [:tv:](https://youtu.be/IIt_ARZzclY) | Easy |Greedy| | 1897 |[Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1897.java) || Easy | String, Greedy | | 1893 |[Check if All the Integers in a Range Are Covered](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1893.java) || Easy | Array, HashTable, Prefix Sum | | 1891 |[Cutting Ribbons](https://leetcode.com/problems/cutting-ribbons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1891.java) || Medium | Array, Binary Search | | 1886 |[Determine Whether Matrix Can Be Obtained By Rotation](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1886.java) || Easy | Array | | 1880 |[Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1880.java) || Easy | String | | 1877 |[Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1877.java) || Medium | Greedy, Sort | | 1876 |[Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1876.java) || Easy | String | | 1874 |[Minimize Product Sum of Two Arrays](https://leetcode.com/problems/minimize-product-sum-of-two-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1874.java) || Medium | Array, Greedy, Sorting | | 1869 |[Longer Contiguous Segments of Ones than Zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1869.java) || Easy | Array, Two Pointers | | 1863 |[Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1863.java) || Easy | Backtracking, Recursion | | 1862 |[Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1862.java) || Hard | Math | | 1861 |[Rotating the Box](https://leetcode.com/problems/rotating-the-box/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1861.java) | [:tv:](https://youtu.be/2LRnTMOiqSI) | Medium |Array, Two Pointers| | 1860 |[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1860.java) || Medium | Math | | 1859 |[Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1859.java) || Easy | String, Sort | | 1854 |[Maximum Population Year](https://leetcode.com/problems/maximum-population-year/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1854.java) || Easy | Array | | 1848 |[Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1848.java) || Easy | Array | | 1845 |[Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1845.java) || Medium | Heap, Design | | 1844 |[Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1844.java) || Easy | String | | 1837 |[Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1837.java) || Easy | Math, Bit Manipulation | | 1836 |[Remove Duplicates From an Unsorted Linked List](https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1836.java) || Medium | HashTable, LinkedList | | 1833 |[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1833.java) || Medium | Array, Sort | | 1832 |[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1832.java) || Easy | String | | 1829 |[Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1829.java) || Medium | Bit Manipulation | | 1828 |[Queries on Number of Points Inside a Circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1828.java) | [:tv:](https://youtu.be/fU4oOBSsVMg) | Medium |Math| | 1827 |[Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1827.java) || Easy | Array, Greedy | | 1826 |[Faulty Sensor](https://leetcode.com/problems/faulty-sensor/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1826.java) || Easy | Array, Two Pointers | | 1823 |[Find the Winner of the Circular Game](https://leetcode.com/problems/find-the-winner-of-the-circular-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1823.java) || Medium | Array | | 1822 |[Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1822.java) || Easy | Math | | 1817 |[Finding the Users Active Minutes](https://leetcode.com/problems/finding-the-users-active-minutes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1817.java) || Medium | HashTable | | 1816 |[Truncate Sentence](https://leetcode.com/problems/truncate-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1816.java) || Easy | String | | 1814 |[Count Nice Pairs in an Array](https://leetcode.com/problems/count-nice-pairs-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1814.java) || Medium | Array, HashTable | | 1813 |[Sentence Similarity III](https://leetcode.com/problems/sentence-similarity-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1813.java) | [:tv:](https://youtu.be/MMMd7dMv4Ak) | Medium |String| | 1812 |[Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1812.java) || Easy | String | | 1807 |[Evaluate the Bracket Pairs of a String](https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1807.java) || Medium | HashTable, String | | 1806 |[Minimum Number of Operations to Reinitialize a Permutation](https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1806.java) || Medium | Array, Greedy | | 1805 |[Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1805.java) || Medium | String | | 1804 |[Implement Trie II (Prefix Tree)](https://leetcode.com/problems/implement-trie-ii-prefix-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1804.java) || Medium | Trie, Design | | 1800 |[Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1800.java) || Easy | Two Pointers | | 1797 |[Design Authentication Manager](https://leetcode.com/problems/design-authentication-manager/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1797.java) || Medium | HashTable, Design | | 1796 |[Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1796.java) || Easy | String | | 1792 |[Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1792.java) || Medium | Heap | | 1791 |[Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1791.java) || Medium | Graph | | 1790 |[Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1790.java) || Easy | String | | 1785 |[Minimum Elements to Add to Form a Given Sum](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1785.java) || Medium | Greedy | | 1784 |[Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1784.java) || Easy | Greedy | | 1781 |[Sum of Beauty of All Substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1781.java) || Medium | HashTable, String | | 1780 |[Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1780.java) || Medium | Math, Backtracking, Recursion | | 1779 |[Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1779.java) || Easy | Array | | 1775 |[Equal Sum Arrays With Minimum Number of Operations](https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1775.java) || Medium | Greedy | | 1774 |[Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1774.java) || Medium | Greedy | | 1773 |[Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1773.java) | [:tv:](https://youtu.be/eHk8TQIhvCk) | Easy |Array, String| | 1772 |[Sort Features by Popularity](https://leetcode.com/problems/sort-features-by-popularity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1772.java) | [:tv:](https://youtu.be/5629LqqeLAM) | Medium |HashTable, Sort| | 1769 |[Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1769.java) || Medium | Array, Greedy | | 1768 |[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1768.java) || Easy | String | | 1765 |[Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1765.java) || Medium | BFS, Graph | | 1764 |[Form Array by Concatenating Subarrays of Another Array](https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1764.java) || Medium | Array, Greedy | | 1763 |[Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1763.java) || Easy | String | | 1759 |[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) || Medium | String ,Greedy | | 1758 |[Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) || Easy | Greedy, Array | | 1756 |[Design Most Recently Used Queue](https://leetcode.com/problems/design-most-recently-used-queue/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1756.java) || Medium | Array, Design, Dequeue | | 1754 |[Largest Merge Of Two Strings](https://leetcode.com/problems/largest-merge-of-two-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) || Medium | Greedy, Suffix Array | | 1753 |[Maximum Score From Removing Stones](https://leetcode.com/problems/maximum-score-from-removing-stones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) || Medium | Math, Heap | | 1752 |[Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1752.java) || Easy | Array | | 1750 |[Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1750.java) || Medium | Two Pointers | | 1749 |[Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1749.java) || Medium | Greedy | | 1748 |[Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1748.java) || Easy | Array, HashTable | | 1746 |[Maximum Subarray Sum After One Operation](https://leetcode.com/problems/maximum-subarray-sum-after-one-operation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1746.java) || Medium | DP | | 1745 |[Palindrome Partitioning IV](https://leetcode.com/problems/palindrome-partitioning-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1745.java) || Hard | String, DP | | 1743 |[Restore the Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1743.java) || Medium | Greedy | | 1742 |[Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1742.java) || Easy | Array | | 1736 |[Latest Time by Replacing Hidden Digits](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1736.java) || Easy | String, Greedy | | 1733 |[Minimum Number of People to Teach](https://leetcode.com/problems/minimum-number-of-people-to-teach/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1733.java) || Medium | Array, Greedy | | 1732 |[Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1732.java) || Easy | Array | | 1727 |[Largest Submatrix With Rearrangements](https://leetcode.com/problems/largest-submatrix-with-rearrangements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1727.java) || Medium | Greedy, Sort | | 1726 |[Tuple with Same Product](https://leetcode.com/problems/tuple-with-same-product/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1726.java) | [:tv:](https://youtu.be/asI_UBkXI0M) | Medium |Array| | 1725 |[Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1725.java) || Easy | Greedy | | 1721 |[Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1721.java) || Medium | LinkedList | | 1720 |[Decode XORed Array](https://leetcode.com/problems/decode-xored-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1720.java) || Easy | Bit Manipulation | | 1718 |[Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1718.java) || Medium | Backtracking, Recursion | | 1717 |[Maximum Score From Removing Substrings](https://leetcode.com/problems/maximum-score-from-removing-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1717.java) | [:tv:](https://youtu.be/9wZ-TWBreTg) | Medium |Greedy| | 1716 |[Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1716.java) || Easy | Math, Greedy | | 1711 |[Count Good Meals](https://leetcode.com/problems/count-good-meals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1711.java) || Medium | Array, HashTable, Two Pointers | | 1710 |[Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1710.java) || Easy | Greedy, Sort | | 1708 |[Largest Subarray Length K](https://leetcode.com/problems/largest-subarray-length-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1708.java) || Easy | Array, Greedy | | 1705 |[Maximum Number of Eaten Apples](https://leetcode.com/problems/maximum-number-of-eaten-apples/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1705.java) || Medium | Heap, Greedy | | 1704 |[Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1704.java) || Easy | String | | 1700 |[Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1700.java) || Easy | Array | | 1695 |[Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1695.java) || Medium | Two Pointers | | 1694 |[Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1694.java) || Easy | String | | 1690 |[Stone Game VII](https://leetcode.com/problems/stone-game-vii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1690.java) || Medium | DP | | 1689 |[Partitioning Into Minimum Number Of Deci-Binary Numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1689.java) || Medium | Greedy | | 1688 |[Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1688.java) || Easy | Backtracking | | 1686 |[Stone Game VI](https://leetcode.com/problems/stone-game-vi/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1686.java) || Medium | Greedy | | 1685 |[Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1685.java) | [:tv:](https://youtu.be/WYe644djV30) | Medium |Math, Greedy| | 1684 |[Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1684.java) || Easy | String | | 1680 |[Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1680.java) || Medium | Math | | 1679 |[Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1679.java) || Medium | HashTable | | 1678 |[Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1678.java) || Easy | String | | 1676 |[Lowest Common Ancestor of a Binary Tree IV](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1676.java) || Medium | Tree, DFS, Binary Tree | | 1675 |[Minimize Deviation in Array](https://leetcode.com/problems/minimize-deviation-in-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1675.java) || Hard | Heap, Ordered Map | | 1673 |[Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1673.java) | [:tv:](https://youtu.be/GBJFxSD3B_s) | Medium |Stack, Greedy| | 1672 |[Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1672.java) || Easy | Array | | 1670 |[Design Front Middle Back Queue](https://leetcode.com/problems/design-front-middle-back-queue/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1670.java) || Medium | Linked List, Design, Dequeu | | 1669 |[Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1669.java) || Medium | LinedList | | 1668 |[Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1668.java) || Easy | String | | 1664 |[Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/)| [Javascript](./javascript/_1664.js) || Medium | Greedy | | 1663 |[Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1663.java) | [:tv:](https://youtu.be/o3MRJfsoUrw) | Medium |Greedy| | 1662 |[Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1662.java) || Easy | String | | 1658 |[Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/)| [Javascript](./javascript/_1658.js), [Java](../master/src/main/java/com/fishercoder/solutions/_1658.java) || Medium | Greedy | | 1657 |[Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1657.java) | [:tv:](https://youtu.be/-jXQK-UeChU) | Medium |Greedy| | 1656 |[Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1656.java) || Easy | Array, Design | | 1652 |[Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1652.java) || Easy | Array | | 1650 |[Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1650.java) || Medium | HashTable, Binary Tree, Tree | | 1646 |[Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1646.java) || Easy | Array | | 1644 |[Lowest Common Ancestor of a Binary Tree II](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1644.java) || Medium | Binary Tree, DFS | | 1642 |[Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1642.java) || Medium | Binary Search, Heap | | 1641 |[Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1641.java) | [:tv:](https://youtu.be/gdH4yfgfwiU) | Medium |Math, DP, Backtracking| | 1640 |[Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1640.java) || Easy | Array, Sort | | 1637 |[Widest Vertical Area Between Two Points Containing No Points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/)| [Javascript](./javascript/_1637.js), [Java](../master/src/main/java/com/fishercoder/solutions/_1637.java) | | Medium | Sort | | 1636 |[Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1636.java) || Easy | Array, Sort | | 1630 |[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1630.java) || Medium | Sort | | 1629 |[Slowest Key](https://leetcode.com/problems/slowest-key/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1629.java) || Easy | Array | | 1628 |[Design an Expression Tree With Evaluate Function](https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1628.java) || Medium | Stack, Binary Tree, Design, Math | | 1626 |[Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1626.java) || Medium | DP | | 1625 |[Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1625.java) || Medium | BFS, DFS | | 1624 |[Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1624.java) | [:tv:](https://youtu.be/rfjeFs3JuYM) | Easy |String| | 1620 |[Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1620.java) | [:tv:](https://youtu.be/TqKDnzkRsh0) | Medium |Greedy| | 1619 |[Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1619.java) | [:tv:](https://youtu.be/vyrEra_OfDo) | Easy |Array| | 1614 |[Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1614.java) || Easy | String | | 1609 |[Even Odd Tree](https://leetcode.com/problems/even-odd-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1609.java) || Medium | Tree | | 1608 |[Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1608.java) || Easy | Array | | 1604 |[Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1604.java) || Medium | String, Ordered Map | | 1603 |[Design Parking System](https://leetcode.com/problems/design-parking-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1603.java) || Easy | Design | | 1601 |[Maximum Number of Achievable Transfer Requests](https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1601.java) || Hard | Backtracking | | 1598 |[Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1598.java) || Easy | Stack | | 1592 |[Rearrange Spaces Between Words](https://leetcode.com/problems/rearrange-spaces-between-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1592.java) || Easy | String | | 1588 |[Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1588.java) || Easy | Array | | 1583 |[Count Unhappy Friends](https://leetcode.com/problems/count-unhappy-friends/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1583.java) || Medium | Array | | 1582 |[Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1582.java) || Easy | Array | | 1577 |[Number of Ways Where Square of Number Is Equal to Product of Two Numbers](https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1577.java) || Medium | HashTable, Math | | 1576 |[Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1576.java) | [:tv:](https://youtu.be/SJBDLYqrIsM) | Easy |String| | 1574 |[Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1574.java) || Medium | Array, Binary Search | | 1572 |[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1572.java) || Easy | Array | | 1570 |[Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1570.java) || Easy | Array, HashTable, Two Pointers | | 1567 |[Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1567.java) | [:tv:](https://youtu.be/bFer5PdsgpY) | Medium |Greedy| | 1566 |[Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1566.java) | [:tv:](https://youtu.be/aJAV_VgmjdE) | Easy |Array| | 1561 |[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1561.java) | [:tv:](https://youtu.be/hPe9Z3TiUrA) | Medium |Sort| | 1560 |[Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1560.java) || Easy | Array | | 1558 |[Minimum Numbers of Function Calls to Make Target Array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1558.java) || Medium | Greedy | | 1557 |[Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1557.java) | [:tv:](https://youtu.be/IfsiNU7J-6c) | Medium |Graph| | 1556 |[Thousand Separator](https://leetcode.com/problems/thousand-separator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1556.java) | [:tv:](https://youtu.be/re2BnNbg598) | Easy |String| | 1551 |[Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1551.java) | [:tv:](https://youtu.be/A-i2sxmBqAA) | Medium |Math| | 1550 |[Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1550.java) | | Easy |Array| | 1545 |[Find Kth Bit in Nth Binary String](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1545.java) | [:tv:](https://youtu.be/34QYE5HAFy4) | Medium |String| | 1544 |[Make The String Great](https://leetcode.com/problems/make-the-string-great/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1544.java) | [:tv:](https://youtu.be/Q-ycCXbUOck) | Easy |String, Stack| | 1541 |[Minimum Insertions to Balance a Parentheses String](https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1541.java) | [:tv:](https://youtu.be/PEKAlnmbBCc) | Medium |String, Stack| | 1539 |[Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1539.java) | [:tv:](https://youtu.be/p0P1JNHAB-c) | Easy |Array, HashTable| | 1535 |[Find the Winner of an Array Game](https://leetcode.com/problems/find-the-winner-of-an-array-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1535.java) | [:tv:](https://youtu.be/v6On1TQfMTU) | Medium |Array| | 1534 |[Count Good Triplets](https://leetcode.com/problems/count-good-triplets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1534.java) | | Easy |Array| | 1528 |[Shuffle String](https://leetcode.com/problems/shuffle-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1528.java) | | Easy |Sort| | 1526 |[Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1526.java) | | Hard |Segment Tree| | 1525 |[Number of Good Ways to Split a String](https://leetcode.com/problems/number-of-good-ways-to-split-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1525.java) | [:tv:](https://youtu.be/lRVpVUC5mQ4) | Medium |String, Bit Manipulation| | 1524 |[Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1524.java) | | Medium |Array, Math| | 1523 |[Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1523.java) | [:tv:](https://youtu.be/TkT-6WsmqY0) | Easy |Math| | 1518 |[Water Bottles](https://leetcode.com/problems/water-bottles/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1518.java) | | Easy |Greedy| | 1514 |[Path with Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1514.java) | | Medium |Graph| | 1512 |[Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1512.java) | | Easy |Array, HashTable, Math| | 1508 |[Range Sum of Sorted Subarray Sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1508.java) | | Medium |Array, Sort| | 1507 |[Reformat Date](https://leetcode.com/problems/reformat-date/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1507.java) | | Easy |String| | 1502 |[Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1502.java) | | Easy |Array, Sort| | 1496 |[Path Crossing](https://leetcode.com/problems/path-crossing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1496.java) | | Easy |String| | 1493 |[Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1493.java) | [:tv:](https://youtu.be/nKhteIRZ2Ok) | Medium |Array| | 1492 |[The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1492.java) | | Medium |Math| | 1491 |[Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1491.java) | | Easy |Array, Sort| | 1490 |[Clone N-ary Tree](https://leetcode.com/problems/clone-n-ary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1490.java) | [:tv:](https://youtu.be/3Wnja3Bxeos) | Medium |HashTable, Tree, DFS, BFS| | 1487 |[Making File Names Unique](https://leetcode.com/problems/making-file-names-unique/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1487.java) | | Medium |HashTable, String| | 1486 |[XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1486.java) | | Medium |Array, Bit Manipulation| | 1485 |[Clone Binary Tree With Random Pointer](https://leetcode.com/problems/clone-binary-tree-with-random-pointer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1485.java) | | Medium |HashTable, Tree, DFS, BFS| | 1482 |[Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1482.java) | | Medium |Array, Binary Search| | 1481 |[Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1481.java) | | Medium |Array, Sort| | 1480 |[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1480.java), [C++](../master/cpp/_1480.cpp) | | Easy |Array| | 1476 |[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java) | | Medium |Array| | 1475 |[Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1475.java) | | Easy |Array| | 1474 |[Delete N Nodes After M Nodes of a Linked List](https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1474.java) | | Easy |LinkedList| | 1472 |[Design Browser History](https://leetcode.com/problems/design-browser-history/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1472.java) | | Medium |Array, Design| | 1471 |[The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1471.java) | | Medium |Array, Sort| | 1470 |[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1470.java), [C++](../master/cpp/_1470.cpp) | | Easy |Array| | 1469 |[Find All The Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1469.java) | | Easy |Tree, DFS| | 1466 |[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1466.java) | | Medium |Tree, DFS| | 1464 |[Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1464.java) | | Easy |Array| | 1461 |[Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1461.java) | | Medium |String, Bit Manipulation| | 1460 |[Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1460.java) | | Easy |Array| | 1457 |[Pseudo-Palindromic Paths in a Binary Tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1457.java) | | Medium |Bit Manipulation, Tree, DFS| | 1456 |[Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1456.java) | | Medium |String, Sliding Window| | 1455 |[Check If a Word Occurs As a Prefix of Any Word in a Sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1455.java) | | Easy |String| | 1452 |[People Whose List of Favorite Companies Is Not a Subset of Another List](https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1452.java) | | Medium |String, Sort| | 1451 |[Rearrange Words in a Sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1451.java) | | Medium |String, Sort| | 1450 |[Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1450.java) | | Easy |Array| | 1448 |[Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1448.java) | | Medium |Tree, DFS| | 1447 |[Simplified Fractions](https://leetcode.com/problems/simplified-fractions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1447.java) | | Medium |Math| | 1446 |[Consecutive Characters](https://leetcode.com/problems/consecutive-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1446.java) | | Easy |String| | 1441 |[Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1441.java) | | Easy |Stack| | 1439 |[Find the Kth Smallest Sum of a Matrix With Sorted Rows](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1439.java) | | Hard |Array, Binary Search, PriorityQueue, Matrix| | 1438 |[Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1438.java) | | Medium |Array, Queue, Sliding Window, PriorityQueue, Monotonic Queue| | 1437 |[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1437.java) | | Medium |Array| | 1436 |[Destination City](https://leetcode.com/problems/destination-city/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1436.java) | | Easy |String| | 1432 |[Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1432.java) | | Medium |String| | 1431 |[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1431.java), [C++](../master/cpp/_1431.cpp) | | Easy |Array| | 1429 |[First Unique Number](https://leetcode.com/problems/first-unique-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1429.java) | | Medium |Array, HashTable, Design, Data Streams| | 1428 |[Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1428.java) | | Medium |Array| | 1427 |[Perform String Shifts](https://leetcode.com/problems/perform-string-shifts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1427.java) | | Easy |Array, Math| | 1426 |[Counting Elements](https://leetcode.com/problems/counting-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1426.java) | | Easy |Array| | 1423 |[Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1423.java) | | Medium |Array, DP, Sliding Window| | 1422 |[Maximum Score After Splitting a String](https://leetcode.com/problems/maximum-score-after-splitting-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1422.java) | | Easy |String| | 1418 |[Display Table of Food Orders in a Restaurant](https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1418.java) | | Medium |HashTable| | 1417 |[Reformat The String](https://leetcode.com/problems/reformat-the-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1417.java) | | Easy |String| | 1415 |[The k-th Lexicographical String of All Happy Strings of Length n](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1415.java) | | Medium |Backtracking| | 1413 |[Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1413.java) | | Easy |Array| | 1410 |[HTML Entity Parser](https://leetcode.com/problems/html-entity-parser/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1410.java) | | Medium |String, Stack| | 1409 |[Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1409.java) | | Medium |Array| | 1408 |[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1408.java) | | Easy |String| | 1403 |[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1403.java) | | Easy |Greedy, Sort| | 1402 |[Reducing Dishes](https://leetcode.com/problems/reducing-dishes/)| [Solution](../master/cpp/_1402.cpp) | | Hard |Dynamic Programming| | 1401 |[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1401.java) | | Medium |Geometry| | 1400 |[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1400.java) | | Medium |Greedy| | 1399 |[Count Largest Group](https://leetcode.com/problems/count-largest-group/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1399.java) | | Easy |Array| | 1396 |[Design Underground System](https://leetcode.com/problems/design-underground-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1396.java) | | Medium |Design| | 1395 |[Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1395.java) | | Medium |Array| | 1394 |[Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1394.java) | | Easy |Array| | 1392 |[Longest Happy Prefix](https://leetcode.com/problems/longest-happy-prefix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1392.java) | | Hard |String, Rolling Hash| | 1390 |[Four Divisors](https://leetcode.com/problems/four-divisors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1390.java) | | Medium |Math| | 1389 |[Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1389.java) | | Easy |Array| | 1388 |[Pizza With 3n Slices](https://leetcode.com/problems/pizza-with-3n-slices/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1388.java) | | Hard |DP| | 1387 |[Sort Integers by The Power Value](https://leetcode.com/problems/sort-integers-by-the-power-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1387.java) | | Medium |Sort, Graph| | 1386 |[Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1386.java) | | Medium |Array, Greedy| | 1385 |[Find the Distance Value Between Two Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1385.java) | | Easy |Array| | 1382 |[Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1382.java) | | Medium |Binary Search Tree| | 1381 |[Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1381.java) | | Medium |Stack, Design| | 1380 |[Lucky Numbers in a Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1380.java) | | Easy |Array| | 1379 |[Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1379.java) | | Medium |Tree| | 1377 |[Frog Position After T Seconds](https://leetcode.com/problems/frog-position-after-t-seconds/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1377.java) | | Hard |DFS, BFS| | 1376 |[Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1376.java) | | Medium |DFS| | 1375 |[Bulb Switcher III](https://leetcode.com/problems/bulb-switcher-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1375.java) | | Medium |Array| | 1374 |[Generate a String With Characters That Have Odd Counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1374.java) | | Easy |String| | 1373 |[Maximum Sum BST in Binary Tree](https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1373.java) | | Hard |DP, BST| | 1372 |[Longest ZigZag Path in a Binary Tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1372.java) | | Hard |DP, Tree| | 1371 |[Find the Longest Substring Containing Vowels in Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1371.java) | | Medium |String| | 1370 |[Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1370.java) | | Easy |String, Sort| | 1367 |[Linked List in Binary Tree](https://leetcode.com/problems/linked-list-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1367.java) | | Medium |DP, Linked List, Tree| | 1366 |[Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1366.java) | | Medium |Array, Sort| | 1365 |[How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1365.java) | | Easy |Array, HashTable| | 1362 |[Closest Divisors](https://leetcode.com/problems/closest-divisors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1362.java) | | Medium |Math| | 1361 |[Validate Binary Tree Nodes](https://leetcode.com/problems/validate-binary-tree-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1361.java) | | Medium |Graph | 1360 |[Number of Days Between Two Dates](https://leetcode.com/problems/number-of-days-between-two-dates/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1360.java) | | Easy || | 1358 |[Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1358.java) | | Medium |String| | 1357 |[Apply Discount Every n Orders](https://leetcode.com/problems/apply-discount-every-n-orders/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1357.java) | | Medium |Design| | 1356 |[Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1356.java) | | Easy |Sort, Bit Manipulation| | 1354 |[Construct Target Array With Multiple Sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1354.java) | | Hard |Greedy| | 1353 |[Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1353.java) | | Medium |Greedy, Sort, Segment Tree| | 1352 |[Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1352.java) | | Medium |Array, Design| | 1351 |[Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1351.java) | | Easy |Array, Binary Search| | 1349 |[Maximum Students Taking Exam](https://leetcode.com/problems/maximum-students-taking-exam/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1349.java) | | Hard |Dynamic Programming| | 1348 |[Tweet Counts Per Frequency](https://leetcode.com/problems/tweet-counts-per-frequency/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1348.java) | | Medium |Design| | 1347 |[Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1347.java) | | Easy |String| | 1346 |[Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1346.java) | | Easy |Array| | 1345 |[Jump Game IV](https://leetcode.com/problems/jump-game-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1345.java) | | Hard |BFS| | 1344 |[Angle Between Hands of a Clock](https://leetcode.com/problems/angle-between-hands-of-a-clock/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1344.java) | | Medium |Math| | 1343 |[Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1343.java) | | Medium |Array| | 1342 |[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1342.java) | | Easy |Bit Manipulation| | 1341 |[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1341.java) | | Easy || | 1339 |[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1339.java) | | Medium |DP, Tree| | 1338 |[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1338.java) | | Medium || | 1337 |[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1337.java) | | Easy |String| | 1333 |[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1333.java) | | Medium || | 1332 |[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1332.java) | | Easy |String| | 1331 |[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) | | Easy || | 1329 |[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1329.java) | | Medium || | 1325 |[Delete Leaves With a Given Value](https://leetcode.com/problems/delete-leaves-with-a-given-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1325.java) | | Medium |Tree| | 1324 |[Print Words Vertically](https://leetcode.com/problems/print-words-vertically/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1324.java) | | Medium |String| | 1323 |[Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1323.java) | | Easy |Math| | 1317 |[Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1317.java) | | Easy || | 1315 |[Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1315.java) | | Medium |Tree, DFS| | 1314 |[Matrix Block Sum](https://leetcode.com/problems/matrix-block-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1314.java) | | Medium |Dynamic Programming| | 1313 |[Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1313.java) | | Easy |Array| | 1305 |[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1305.java) | | Medium || | 1304 |[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1304.java) | | Easy || | 1302 |[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1302.java) | | Medium || | 1300 |[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1300.java) | | Medium |Binary Search, Sorting| | 1299 |[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1299.java) | | Easy || | 1297 |[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1297.java) | | Medium || | 1296 |[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1296.java) | | Medium || | 1295 |[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)| [Java](../master/src/main/java/com/fishercoder/solutions/_1295.java) [Javascript](../master/javascript/_1295.js) | [:tv:](https://youtu.be/HRp8mNJvLZ0) | Easy || | 1291 |[Sequential Digits](https://leetcode.com/problems/sequential-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1291.java) | | Medium || | 1290 |[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1290.java) | | Easy || | 1289 |[Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1289.java) | | Hard |Dynamic Programming| | 1287 |[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1287.java) | [:tv:](https://youtu.be/G74W8v2yVjY) | Easy || | 1286 |[Iterator for Combination](https://leetcode.com/problems/iterator-for-combination/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1286.java) | | Medium |Backtracking, Design| | 1283 |[Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1283.java) | Medium | | 1282 |[Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1282.java) | [:tv:](https://www.youtube.com/watch?v=wGgcRCpSAa8) | Medium || | 1281 |[Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1281.java) | | Easy || | 1277 |[Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1277.java) | | Medium || | 1275 |[Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1275.java) | | Easy |Array| | 1273 |[Delete Tree Nodes](https://leetcode.com/problems/delete-tree-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1273.java) | | Medium |Dynamic Programming, DFS | | 1271 |[Hexspeak](https://leetcode.com/problems/hexspeak/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1271.java) | | Easy || | 1268 |[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1268.java) | [:tv:](https://youtu.be/PLNDfB0Vg9Y) | Medium |String| | 1267 |[Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1267.java) | | Medium || | 1266 |[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1266.java) | | Easy || | 1265 |[Print Immutable Linked List in Reverse](https://leetcode.com/problems/print-immutable-linked-list-in-reverse//)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1265.java) | | Medium || | 1261 |[Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1261.java) || Medium | Tree, HashTable | | 1260 |[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1260.java) | [:tv:](https://www.youtube.com/watch?v=9hBcARSiU0s) | Easy || | 1258 |[Synonymous Sentences](https://leetcode.com/problems/synonymous-sentences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1258.java) || Medium | Backtracking | | 1257 |[Smallest Common Region](https://leetcode.com/problems/smallest-common-region/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1257.java) || Medium | Tree, HashTable, DFS, BFS | | 1252 |[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) | | Easy || | 1249 |[Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1249.java) | | Medium |String, Stack| | 1243 |[Array Transformation](https://leetcode.com/problems/array-transformation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1243.java) | [:tv:](https://www.youtube.com/watch?v=MQ2i4T1l-Gs) | Easy || | 1237 |[Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1237.java) | | Easy || | 1232 |[Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1232.java) | [:tv:](https://www.youtube.com/watch?v=_tfiTQNZCbs) | Easy || | 1228 |[Missing Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1228.java) | | Easy || | 1221 |[Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1221.java) | | Easy |Greedy| | 1219 |[Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1219.java) | | Medium |Backtracking| | 1217 |[Play with Chips](https://leetcode.com/problems/play-with-chips/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1217.java) | | Easy |Array, Math, Greedy| | 1214 |[Two Sum BSTs](https://leetcode.com/problems/two-sum-bsts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1214.java) | | Medium | Binary Search Tree| | 1213 |[Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1213.java) | [:tv:](https://www.youtube.com/watch?v=zceoOrHSHNQ) | Easy || | 1209 |[Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) || Medium | Stack | | 1207 |[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) | [:tv:](https://www.youtube.com/watch?v=_NYimlZY1PE) | Easy || | 1200 |[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1200.java) | [:tv:](https://www.youtube.com/watch?v=mH1aEjOEjcQ) | Easy || | 1198 |[Find Smallest Common Element in All Rows](https://leetcode.com/problems/find-smallest-common-element-in-all-rows/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1198.java) | [:tv:](https://www.youtube.com/watch?v=RMiofZrTmWo) | Easy || | 1196 |[How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1196.java) | [:tv:](https://www.youtube.com/watch?v=UelshlMQNJM) | Easy || | 1190 |[Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1190.java) | | Medium |Stack| | 1189 |[Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1189.java) | [:tv:](https://youtu.be/LGgMZC0vj5s) | Easy || | 1185 |[Day of the Week](https://leetcode.com/problems/day-of-the-week/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1185.java) | | Easy || | 1184 |[Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1184.java) | [:tv:](https://www.youtube.com/watch?v=RFq7yA5iyhI) | Easy || | 1182 |[Shortest Distance to Target Color](https://leetcode.com/problems/shortest-distance-to-target-color/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1182.java) || Medium | Binary Search | | 1180 |[Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1180.java) | | Easy |Math, String| | 1176 |[Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1176.java) | | Easy |Array, Sliding Window| | 1175 |[Prime Arrangements](https://leetcode.com/problems/prime-arrangements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1175.java) | | Easy |Math| | 1171 |[Remove Zero Sum Consecutive Nodes from Linked List](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1171.java) | | Medium |LinkedList| | 1165 |[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1165.java) | | Easy || | 1161 |[Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1161.java) | | Medium |Graph| | 1160 |[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java) | | Easy || | 1154 |[Day of the Year](https://leetcode.com/problems/day-of-the-year/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | | Easy || | 1152 |[Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1152.java) | [:tv:](https://youtu.be/V510Lbtrm5s) | Medium |HashTable, Sort, Array| | 1151 |[Minimum Swaps to Group All 1's Together](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1151.java) || Medium | Array, Sliding Window | | 1150 |[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1150.java) | [:tv:](https://youtu.be/-t2cdVs9cKk) | Easy || | 1146 |[Snapshot Array](https://leetcode.com/problems/snapshot-array/)| [Javascript](./javascript/_1146.js) | | Easy || | 1143 |[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1143.java) | | Medium ||String, DP | 1138 |[Alphabet Board Path](https://leetcode.com/problems/alphabet-board-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1138.java) | [:tv:](https://youtu.be/rk-aB4rEOyU) | Medium |HashTable, String| | 1137 |[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1137.java) | | Easy || | 1136 |[Parallel Courses](https://leetcode.com/problems/parallel-courses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1136.java) | | Medium || | 1134 |[Armstrong Number](https://leetcode.com/problems/armstrong-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1134.java) | [:tv:](https://www.youtube.com/watch?v=HTL7fd4HPf4) | Easy || | 1133 |[Largest Unique Number](https://leetcode.com/problems/largest-unique-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1133.java) | [:tv:](https://youtu.be/Fecpt1YZlCs) | Easy || | 1128 |[Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1128.java) | [:tv:](https://www.youtube.com/watch?v=7EpEEHAAxyw) | Easy || | 1122 |[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) | | Easy || | 1170 |[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1170.java) | | Easy || | 1119 |[Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1119.java) | [:tv:](https://www.youtube.com/watch?v=6KCBrIWEauw) | Easy || | 1118 |[Number of Days in a Month](https://leetcode.com/problems/number-of-days-in-a-month/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1118.java) | | Easy || | 1114 |[Print in Order](https://leetcode.com/problems/print-in-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1114.java) | | Easy || | 1110 |[Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1110.java) | | Medium |Tree, DFS| | 1108 |[Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1108.java) | [:tv:](https://www.youtube.com/watch?v=FP0Na-pL0qk) | Easy || | 1104 |[Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1104.java) | | Medium |Math, Tree| | 1103 |[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1103.java) | | Easy |Math| | 1100 |[Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1100.java) | | Medium |String, Sliding Window| | 1099 |[Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1099.java) | [:tv:](https://www.youtube.com/watch?v=2Uq7p7HE0TI) | Easy || | 1094 |[Car Pooling](https://leetcode.com/problems/car-pooling/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1094.java) | | Medium |Array, Sorting, Heap, Simulation, Prefix Sum| | 1090 |[Largest Values From Labels](https://leetcode.com/problems/largest-values-from-labels/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1090.java) | [:tv:](https://youtu.be/E0OkE3G95vU) | Medium |HashTable, Greedy| | 1091 |[Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1091.java) | | Medium |BFS| | 1089 |[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1089.java) | | Easy || | 1087 |[Brace Expansion](https://leetcode.com/problems/brace-expansion/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1087.java) | | Medium |Backtracking| | 1086 |[High Five](https://leetcode.com/problems/high-five/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1086.java) | [:tv:](https://www.youtube.com/watch?v=3iqC5J4l0Cc) | Easy || | 1085 |[Sum of Digits in the Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1085.java) | [:tv:](https://www.youtube.com/watch?v=GKYmPuHZpQg) | Easy || | 1079 |[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1079.java) | | Medium || | 1078 |[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1078.java) | | Easy || | 1071 |[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1071.java) | | Easy || | 1066 |[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1066.java) | | Medium |Backtracking, DP| | 1065 |[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1065.java) | | Medium || | 1062 |[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1062.java) | | Medium |String, Binary Search, DP, Rolling Hash, Suffix Array, Hash Function| | 1057 |[Campus Bikes](https://leetcode.com/problems/campus-bikes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1057.java) | | Medium ||Greedy, Sort | 1056 |[Confusing Number](https://leetcode.com/problems/confusing-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1056.java) | | Easy || | 1055 |[Fixed Point](https://leetcode.com/problems/fixed-point/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1055.java) | | Easy || | 1051 |[Height Checker](https://leetcode.com/problems/height-checker/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1051.java) | | Easy || | 1047 |[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1047.java) | | Easy || | 1046 |[Last Stone Weight](https://leetcode.com/problems/last-stone-weight/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1046.java) | [:tv:](https://youtu.be/IfElFyaEV8s) | Easy || | 1043 |[Partition Array for Maximum Sum](https://leetcode.com/problems/partition-array-for-maximum-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1043.java) | | Medium |DP| | 1038 |[Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1038.java) | | Medium |DFS, tree| | 1037 |[Valid Boomerang](https://leetcode.com/problems/valid-boomerang/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1037.java) | | Easy |Math| | 1033 |[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1033.java) | | Easy |Math| | 1030 |[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1030.java) | | Easy | | 1029 |[Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1029.java) | | Easy | | 1026 |[Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1026.java) | | Medium |Tree, DFS, Binary Tree| | 1025 |[Divisor Game](https://leetcode.com/problems/divisor-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1025.java) | | Easy |Math, DP, Brainteaser, Game Theory| | 1024 |[Video Stitching](https://leetcode.com/problems/video-stitching/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1024.java) | | Medium |Array, DP, Greedy| | 1022 |[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1022.java) | | Easy | | 1021 |[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1021.java) | | Easy | | 1020 |[Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1020.java) | | Medium |Graph, DFS, BFS, recursion| | 1019 |[Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1019.java) | | Medium |Linked List, Stack| | 1018 |[Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1018.java) | | Easy | | 1014 |[Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1014.java) | | Medium | | 1013 |[Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1013.java) | | Easy | | 1011 |[Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1011.java) | | Medium |Binary Search| | 1010 |[Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1010.java) | | Easy | | 1009 |[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1009.java) | | Easy | | 1008 |[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1008.java) | | Medium | Recursion | 1005 |[Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1005.java) | [:tv:](https://youtu.be/spiwTAuz1_4) | Easy | | 1004 |[Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1004.java) | [:tv:](https://youtu.be/nKhteIRZ2Ok) | Medium | Two Pointers, Sliding Window | 1003 |[Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1003.java) | | Medium | | 1002 |[Find Common Characters](https://leetcode.com/problems/find-common-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1002.java) | | Easy | | 999 |[Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_999.java) | | Easy | | 991 |[Broken Calculator](https://leetcode.com/problems/broken-calculator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_991.java) | | Medium |Math, Greedy | 981 |[Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_981.java) | [:tv:](https://youtu.be/eVi4gDimCoo) | Medium | | 997 |[Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_997.java) | | Easy | | 994 |[Rotting Oranges](https://leetcode.com/problems/rotting-oranges/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_994.java) | | Medium | BFS | 993 |[Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_993.java) | | Easy | Tree, BFS | 989 |[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_989.java) | | Easy | Array | 988 |[Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_988.java) | | Medium | Tree, DFS | 987 |[Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_987.java) | | Medium | Recursion | 986 |[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_986.java) | | Medium | Two Pointers | 985 |[Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_985.java) | | Easy | Array | 980 |[Unique Paths III](https://leetcode.com/problems/unique-paths-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_980.java) | | Hard | Backtracking, DFS | 979 |[Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_979.java) | | Medium | Recursion | 977 |[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_977.java) | | Easy | Array | 976 |[Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_976.java) | | Easy | Math Array | 974 |[Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_974.java) | | Medium | Array| | 973 |[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_973.java) | | Easy | Math Sort| | 970 |[Powerful Integers](https://leetcode.com/problems/powerful-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_970.java) | | Easy | Math | 966 |[Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_966.java) | | Medium | Hash Table, String | 965 |[Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_965.java) | | Easy | DFS, recursion| | 961 |[N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_961.java) | | Easy | | 958 |[Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_958.java) | | Medium |Tree | 957 |[Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_957.java) | [:tv:](https://youtu.be/mQQp6I985bw) | Medium | | 954 |[Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_954.java) | [:tv:](https://youtu.be/Q0WKzdpR74o) | Medium | | 953 |[Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_953.java) | | Easy | | 951 |[Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_951.java) | | Medium | Tree, DFS, recursion| | 950 |[Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_950.java) | | Medium | | 946 |[Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_946.java) | | Medium |Stack | 944 |[Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_944.java) | | Easy | | 942 |[DI String Match](https://leetcode.com/problems/di-string-match/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_942.java) | | Easy | | 941 |[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_941.java) | | Easy | | 938 |[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_938.java) | | Medium | BST, recursion, DFS | 937 |[Reorder Log Files](https://leetcode.com/problems/reorder-log-files/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_937.java) | | Easy | | 936 |[Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_936.java) | | Hard | String, Greedy | 935 |[Knight Dialer](https://leetcode.com/problems/knight-dialer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_935.java) | | Medium | | 933 |[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_933.java) | | Easy | | 931 |[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_931.java) | | Medium |Dynamic Programming | 929 |[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_929.java) | | Easy | | 925 |[Long Pressed Name](https://leetcode.com/problems/long-pressed-name/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_925.java) | | Easy | | 923 |[3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_923.java) | | Medium |Two Pointers | 922 |[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_922.java) | | Easy | | 921 |[Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_921.java) | | Medium |Stack, Greedy | 918 |[Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_918.java) | | Medium |Array, DP, Monotonic Queue | 917 |[Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_917.java) | | Easy | | 914 |[X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_914.java) | | Easy | | 912 |[Sort an Array](https://leetcode.com/problems/sort-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_912.java) | | Easy | | 908 |[Smallest Range I](https://leetcode.com/problems/smallest-range-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_908.java) | | Easy | | 901 |[Online Stock Span](https://leetcode.com/problems/online-stock-span/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_901.java) | | Medium | Stack | 904 |[Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_904.java) | [:tv:](https://youtu.be/GVecnelW8mA) | Medium | Two Pointers | 900 |[RLE Iterator](https://leetcode.com/problems/rle-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_900.java) | | Medium | | 897 |[Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_897.java) | | Easy | DFS, recursion | 896 |[Monotonic Array](https://leetcode.com/problems/monotonic-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_896.java) | | Easy | | 895 |[Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_895.java) | HashTable, Stack | Hard | | 893 |[Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_893.java) | [:tv:](https://youtu.be/tbtXPKkA2Zw) | Easy | | 892 |[Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_892.java) | Array, Math, Geometry, Matrix | Easy | | 890 |[Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_890.java) | | Medium | | 888 |[Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_888.java) | | Easy | | 885 |[Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_885.java) | [:tv:](https://www.youtube.com/watch?v=0qep3f9cqVs) | Medium | | 884 |[Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_884.java) | | Easy | | 883 |[Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_883.java) | | Easy |Math | 881 |[Boats to Save People](https://leetcode.com/problems/boats-to-save-people/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_881.java) | | Medium |Two Pointers, Greedy | 880 |[Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_880.java) | | Medium |Stack | 877 |[Stone Game](https://leetcode.com/problems/stone-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_877.java) | | Medium | Math, DP, Minimax | 876 |[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_876.java) | | Easy | | 872 |[Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_872.java) | | Easy | DFS, recursion | 870 |[Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_870.java) | | Medium |Array, Greedy | 868 |[Binary Gap](https://leetcode.com/problems/binary-gap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_868.java) | | Easy | | 867 |[Transpose Matrix](https://leetcode.com/problems/transpose-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_867.java) | | Easy | | 861 |[Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_861.java) | | Medium | Greedy | 860 |[Lemonade Change](https://leetcode.com/problems/lemonade-change/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_860.java) | | Easy | | 859 |[Buddy Strings](https://leetcode.com/problems/buddy-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_859.java) | | Easy | | 856 |[Score of Parentheses](https://leetcode.com/problems/score-of-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_856.java) | | Medium | Stack, String | 852 |[Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_852.java) | | Easy | | 849 |[Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_849.java) | | Easy | | 848 |[Shifting Letters](https://leetcode.com/problems/shifting-letters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_848.java) | | Medium | Array, String | 844 |[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_844.java) | | Easy | | 841 |[Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_841.java) | | Easy |DFS, Graph | 840 |[Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_840.java) | | Easy | | 838 |[Push Dominoes](https://leetcode.com/problems/push-dominoes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_838.java) | [:tv:](https://youtu.be/0_XmKkgHSdI) | Medium | Two Pointers, DP | 836 |[Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_836.java) | [:tv:](https://youtu.be/o6hHUk4DOW0) | Easy | | 832 |[Flipping an Image](https://leetcode.com/problems/flipping-an-image/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_832.java) | | Easy | | 830 |[Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_830.java) | | Easy | | 824 |[Goat Latin](https://leetcode.com/problems/goat-latin/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_824.java) | | Easy | | 823 |[Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_823.java) | | Medium | | 821 |[Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_821.java) | | Easy | | 820 |[Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_820.java) | | Medium | | 819 |[Most Common Word](https://leetcode.com/problems/most-common-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_819.java) | | Easy | HashMap | 816 |[Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_816.java) | | Medium | String | 814 |[Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_814.java) | | Medium | recursion, DFS | 812 |[Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_812.java) | | Easy | Array, Math, Geometry | 811 |[Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_811.java) | | Easy | HashMap | 809 |[Expressive Words](https://leetcode.com/problems/expressive-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_809.java) | | Medium | | 807 |[Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_807.java) | | Medium | | 806 |[Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_806.java) | | Easy | | 804 |[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_804.java) | | Easy | | 800 |[Similar RGB Color](https://leetcode.com/problems/similar-rgb-color/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_800.java) | | Easy | | 799 |[Champagne Tower](https://leetcode.com/problems/champagne-tower/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_799.java) | | Medium | | 796 |[Rotate String](https://leetcode.com/problems/rotate-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_796.java) | | Easy | | 792 |[Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_792.java) | | Medium |HashTable, String, Trie, Sorting | 791 |[Custom Sort String](https://leetcode.com/problems/custom-sort-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_791.java) | | Medium | | 789 |[Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_789.java) | | Medium | Math| | 788 |[Rotated Digits](https://leetcode.com/problems/rotated-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_788.java) | | Easy | | 785 |[Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_785.java) | | Medium | | 784 |[Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_784.java) | | Easy | | 783 |[Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_783.java) | | Easy | | 781 |[Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_781.java) | [:tv:](https://youtu.be/leiSa1i-QrI) | Medium | HashTable, Math | 779 |[K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_779.java) | | Medium | | 776 |[Split BST](https://leetcode.com/problems/split-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_776.java) | | Medium | Recursion | 775 |[Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_775.java) | | Medium | Array, Math | 771 |[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_771.java) | | Easy | | 769 |[Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_769.java) | | Medium | Array | 767 |[Reorganize String](https://leetcode.com/problems/reorganize-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_767.java) | | Medium | | 766 |[Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_766.java) | | Easy | | 765 |[Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_765.java) | | Hard | | 764 |[Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_764.java) | | Medium | DP | 763 |[Partition Labels](https://leetcode.com/problems/partition-labels/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_763.java) | | Medium | | 762 |[Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_762.java) | | Easy | | 760 |[Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_760.java) | | Easy | | 758 |[Bold Words in String](https://leetcode.com/problems/bold-words-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_758.java) | | Easy | | 757 |[Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_757.java) | | Hard | | 756 |[Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_756.java) | | Medium | Backtracking | 755 |[Pour Water](https://leetcode.com/problems/pour-water/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_755.java) || Medium | Array | 754 |[Reach a Number](https://leetcode.com/problems/reach-a-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_754.java) || Medium | Math | 750 |[Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_750.java) | | Medium | | 748 |[Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_748.java) | | Easy | | 747 |[Largest Number Greater Than Twice of Others](https://leetcode.com/problems/largest-number-greater-than-twice-of-others/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_747.java) | | Easy | | 746 |[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_746.java) | | Easy | | 744 |[Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_744.java) | | Easy | | 743 |[Network Delay Time](https://leetcode.com/problems/network-delay-time/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_743.java) || Medium | Graph, Djikstra | | 742 |[Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_742.java) | | Medium |Tree | 740 |[Delete and Earn](https://leetcode.com/problems/delete-and-earn/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_740.java) | | Medium | | 739 |[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_739.java) | | Medium | | 738 |[Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_738.java) | | Medium | | 737 |[Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_737.java) | | Medium | Union Find | 735 |[Asteroid Collision](https://leetcode.com/problems/asteroid-collision/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_735.java) | | Medium | Stack | 734 |[Sentence Similarity](https://leetcode.com/problems/sentence-similarity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_734.java) | | Easy | HashTable | 733 |[Flood Fill](https://leetcode.com/problem**__**s/flood-fill/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_733.java) | | Easy | BFS, DFS | 729 |[My Calendar I](https://leetcode.com/problems/my-calendar-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_729.java) || Medium | | 728 |[Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_728.java) | | Easy | | 727 |[Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_727.java) | | Hard | DP | 725 |[Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_725.java) | | Medium | LinkedList | 724 |[Find Pivot Index](https://leetcode.com/problems/find-pivot-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_724.java) | | Easy | Array | 723 |[Candy Crush](https://leetcode.com/problems/candy-crush/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_723.java) | | Medium | Array, Two Pointers | 721 |[Accounts Merge](https://leetcode.com/problems/accounts-merge/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_721.java) | | Medium | DFS, Union Find | 720 |[Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_720.java) | | Easy | Trie | 719 |[Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_719.java) | | Hard | Binary Search | 718 |[Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_718.java) | | Medium | DP | 717 |[1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_717.java) | | Easy | | 716 |[Max Stack](https://leetcode.com/problems/max-stack/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_716.java) | | Hard | Design | 714 |[Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_714.java) | | Medium | DP | 713 |[Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_713.java) || Medium | | 712 |[Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_712.java) | | Medium | DP | 709 |[To Lower Case](https://leetcode.com/problems/to-lower-case/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_709.java) | | Easy | String | 706 |[Design HashMap](https://leetcode.com/problems/design-hashmap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_706.java) | | Easy | Design | 705 |[Design HashSet](https://leetcode.com/problems/design-hashset/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_705.java) | | Easy | Design | 704 |[Binary Search](https://leetcode.com/problems/binary-search/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_704.java) | | Easy | Binary Search | 703 |[Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_703.java) | | Easy | | 701 |[Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_701.java) | | Medium | DFS, recursion | 700 |[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_700.java) | | Easy | recusion, dfs | 699 |[Falling Squares](https://leetcode.com/problems/falling-squares/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_699.java) || Hard | Segment Tree | 698 |[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_698.java), [C++](../master/cpp/_698.cpp) | | Medium | Backtracking + DP | 697 |[Degree of an Array](https://leetcode.com/problems/degree-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_697.java) || Easy | | 696 |[Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_696.java) | | Easy | | 695 |[Max Area of Island](https://leetcode.com/problems/max-area-of-island/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_695.java) | | Medium | DFS, FBS, Union Find, Matrix | 694 |[Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_694.java) | | Medium | DFS | 693 |[Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_693.java) | | Easy | | 692 |[Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_692.java) | | Medium | | 691 |[Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_691.java) | | Hard | DP | 690 |[Employee Importance](https://leetcode.com/problems/employee-importance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_690.java) | | Easy | DFS | 689 |[Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_689.java) | | Hard | DP | 688 |[Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_688.java) | | Medium | DP | 687 |[Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_687.java) | | Easy | DFS | 686 |[Repeated String Match](https://leetcode.com/problems/repeated-string-match/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_686.java) | | Easy | | 685 |[Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_685.java) | | Hard | Union Find | 684 |[Redundant Connection](https://leetcode.com/problems/redundant-connection/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_684.java) | | Medium | Union Find | 683 |[K Empty Slots](https://leetcode.com/problems/k-empty-slots/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_683.java) | | Hard | | 682 |[Baseball Game](https://leetcode.com/problems/baseball-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_682.java) | | Easy | | 681 |[Next Closest Time](https://leetcode.com/problems/parents-closest-time/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_681.java) | | Medium | | 680 |[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_680.java) | | Easy | String | 679 |[24 Game](https://leetcode.com/problems/24-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_679.java) | | Hard | Recursion | 678 |[Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_678.java) | | Medium | Recursion, Greedy | 677 |[Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_677.java) | | Medium | HashMap, Trie | 676 |[Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_676.java) | | Medium | | 675 |[Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_675.java) | | Hard | BFS | 674 |[Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_674.java) | | Easy | | 673 |[Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_673.java) | | Medium | DP | 672 |[Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_672.java) | | Medium | Math | 671 |[Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_671.java) | | Easy | Tree, DFS | 670 |[Maximum Swap](https://leetcode.com/problems/maximum-swap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_670.java) | | Medium | String | 669 |[Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_669.java) | | Easy | Tree, DFS | 668 |[Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_668.java) | | Hard | Binary Search | 667 |[Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_667.java) | | Medium | Array | 666 |[Path Sum IV](https://leetcode.com/problems/path-sum-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_666.java) | | Medium | Tree, DFS | 665 |[Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_665.java) | | Easy | | 664 |[Strange Printer](https://leetcode.com/problems/strange-printer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_664.java) | | Hard | DP | 663 |[Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_663.java) | | Medium | Tree | 662 |[Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_662.java) | | Medium | BFS, DFS | 661 |[Image Smoother](https://leetcode.com/problems/image-smoother/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_661.java) | | Easy | Array | 660 |[Remove 9](https://leetcode.com/problems/remove-9/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_660.java) | | Hard | Math | 659 |[Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_659.java) | | Medium | HashMap | 658 |[Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_658.java) | | Medium | | 657 |[Judge Route Circle](https://leetcode.com/problems/judge-route-circle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_657.java) | | Easy | | 656 |[Coin Path](https://leetcode.com/problems/coin-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_656.java) | | Hard | DP | 655 |[Print Binary Tree](https://leetcode.com/problems/print-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_655.java) | | Medium | Recursion | 654 |[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_654.java) | | Medium | Tree | 653 |[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_653.java) | | Easy | Tree | 652 |[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_652.java) | | Medium | Tree | 651 |[4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_651.java) | | Medium | DP | 650 |[2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_650.java) | | Medium | DP | 649 |[Dota2 Senate](https://leetcode.com/problems/dota2-senate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_649.java) | | Medium | Greedy | 648 |[Replace Words](https://leetcode.com/problems/replace-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_648.java) | | Medium | Trie | 647 |[Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_647.java) | | Medium | DP | 646 |[Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_646.java) | | Medium | DP, Greedy | 645 |[Set Mismatch](https://leetcode.com/problems/set-mismatch/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_645.java) | | Easy | | 644 |[Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_644.java) | | Hard | Binary Search | 643 |[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_643.java) | | Easy | | 642 |[Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_642.java) | | Hard | Design | 640 |[Solve the Equation](https://leetcode.com/problems/solve-the-equation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_640.java) | | Medium | | 639 |[Decode Ways II](https://leetcode.com/problems/decode-ways-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_639.java) | | Hard | DP | 638 |[Shopping Offers](https://leetcode.com/problems/shopping-offers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_638.java) | | Medium | DP, DFS | 637 |[Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_637.java) | | Easy | | 636 |[Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_636.java) | | Medium | Stack | 635 |[Design Log Storage System](https://leetcode.com/problems/design-log-storage-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_635.java) | | Medium | Design | 634 |[Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_634.java) | | Medium | Math | 633 |[Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_633.java) | | Easy | Binary Search | 632 |[Smallest Range](https://leetcode.com/problems/smallest-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_632.java) | | Hard | Heap | 631 |[Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_631.java) | | Hard | Design, Topological Sort | 630 |[Course Schedule III](https://leetcode.com/problems/course-schedule-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_630.java) | | Hard | Heap, Greedy | 629 |[K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_629.java) | | Hard | DP | 628 |[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_628.java) | | Easy | | 625 |[Minimum Factorization](https://leetcode.com/problems/minimum-factorization/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_625.java) | | Medium | | 624 |[Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_624.java) | | Easy | Sort, Array | 623 |[Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_623.java) | | Medium | Tree | 622 |[Design Circular Queue](https://leetcode.com/problems/design-circular-queue/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_622.java) | | Medium | Design, Queue | 621 |[Task Scheduler](https://leetcode.com/problems/task-scheduler/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_621.java) | | Medium | Greedy, Queue | 617 |[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_617.java) | | Easy | Tree, Recursion | 616 |[Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_616.java) | | Medium | String | 611 |[Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_611.java) | | Medium | Binary Search | 609 |[Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_609.java) | | Medium | HashMap | 606 |[Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_606.java) | | Easy | Tree, Recursion | 605 |[Can Place Flowers](https://leetcode.com/problems/can-place-flowers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_605.java) | | Easy | Array | 604 |[Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_604.java) | | Easy |Design, String | 600 |[Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_600.java) | | Hard | Bit Manipulation, DP | 599 |[Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_599.java) | | Easy | HashMap | 598 |[Range Addition II](https://leetcode.com/problems/range-addition-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_598.java) | | Easy | | 594 |[Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_594.java) | | Easy | Array, HashMap | 593 |[Valid Square](https://leetcode.com/problems/valid-square/)| [Java](../master/src/main/java/com/fishercoder/solutions/_593.java), [Javascript](./javascript/_593.js) | | Medium | Math | 592 |[Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_592.java) | | Medium | Math | 591 |[Tag Validator](https://leetcode.com/problems/tag-validator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_591.java) | | Hard | Stack, String | 590 |[N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_590.java) | | Easy | DFS, recursion | 589 |[N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_589.java) | | Easy | DFS, recursion | 588 |[Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_588.java) | | Hard | Trie, Design | 587 |[Erect the Fence](https://leetcode.com/problems/erect-the-fence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_587.java) | | Hard | Geometry | 583 |[Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_583.java) | | Medium | DP | 582 |[Kill Process](https://leetcode.com/problems/kill-process/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_582.java) | | Medium | Stack | 581 |[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_581.java) | | Easy | Array, Sort | 576 |[Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_576.java) | | Hard | DP, DFS | 575 |[Distribute Candies](https://leetcode.com/problems/distribute-candies/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_575.java) | | Easy | Array | 573 |[Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_573.java) | | Medium | Math | 572 |[Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_572.java) | | Easy | Tree | 568 |[Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_568.java) | | Hard | DP | 567 |[Permutation in String](https://leetcode.com/problems/permutation-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_567.java) | | Medium | Sliding Windows, Two Pointers | 566 |[Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_566.java) | | Easy | | 565 |[Array Nesting](https://leetcode.com/problems/array-nesting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_565.java) | | Medium | | 563 |[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_563.java) | | Easy | Tree Recursion | 562 |[Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_562.java) | | Medium | Matrix DP | 561 |[Array Partition I](https://leetcode.com/problems/array-partition-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_561.java) | | Easy | Array | 560 |[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_560.java) || Medium | Array, HashMap | 559 |[Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_559.java) | | Easy | DFS, recursion | 557 |[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_557.java) | | Easy | String | 556 |[Next Greater Element III](https://leetcode.com/problems/parents-greater-element-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_556.java) | | Medium | String | 555 |[Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_555.java) | | Medium | String | 554 |[Brick Wall](https://leetcode.com/problems/brick-wall/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_554.java) | | Medium | HashMap | 553 |[Optimal Division](https://leetcode.com/problems/optimal-division/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_553.java) | | Medium | String, Math | 552 |[Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_552.java) | | Hard | DP | 551 |[Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_551.java) | | Easy | String | 549 |[Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_549.java) | | Medium | Tree | 548 |[Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_548.java) | | Medium | Array | 547 |[Friend Circles](https://leetcode.com/problems/friend-circles/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_547.java) | | Medium | Union Find | 546 |[Remove Boxes](https://leetcode.com/problems/remove-boxes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_546.java) | | Hard | DFS, DP | 545 |[Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_545.java) | | Medium | Recursion | 544 |[Output Contest Matches](https://leetcode.com/problems/output-a824-matches/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_544.java) | | Medium | Recursion | 543 |[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_543.java) | | Easy | Tree/DFS/Recursion | 542 |[01 Matrix](https://leetcode.com/problems/01-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_542.java) | | Medium | BFS | 541 |[Reverse String II](https://leetcode.com/problems/reverse-string-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_541.java) | | Easy | String | 540 |[Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_540.java) | | Medium |Array, Binary Search | 539 |[Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_539.java) | | Medium | String | 538 |[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_538.java) | | Easy | Tree | 537 |[Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_537.java) | | Medium | Math, String | 536 |[Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_536.java) | | Medium | Recursion, Stack | 535 |[Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_535.java) | | Medium | Design | 533 |[Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_533.java) | | Medium | HashMap | 532 |[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_532.java) | | Easy | HashMap | 531 |[Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_531.java) | | Medium | | 530 |[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_530.java) | | Easy | DFS | 529 |[Minesweeper](https://leetcode.com/problems/minesweeper/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_529.java) | | Medium | BFS | 528 |[Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_528.java) | | Medium | Math, Binary Search, Prefix Sum, Randomized | 527 |[Word Abbreviation](https://leetcode.com/problems/word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_527.java) | | Hard | | 526 |[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_526.java) | | Medium | Backtracking | 525 |[Contiguous Array](https://leetcode.com/problems/contiguous-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_525.java) | | Medium | HashMap | 524 |[Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_524.java) | | Medium | Sort | 523 |[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_523.java) | | Medium | DP | 522 |[Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_522.java) | | Medium | | 521 |[Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_521.java) | | Easy | | 520 |[Detect Capital](https://leetcode.com/problems/detect-capital/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_520.java) | | Easy | | 518 |[Coin Change 2](https://leetcode.com/problems/coin-change-2/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_518.java) | | Medium | Array, DP | 517 |[Super Washing Machines](https://leetcode.com/problems/super-washing-machines/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_517.java) | | Hard | DP | 516 |[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_516.java) | | Medium | DP | 515 |[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_515.java) | | Medium | BFS | 514 |[Freedom Trail](https://leetcode.com/problems/freedom-trail/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_514.java) | | Hard | DP | 513 |[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_513.java) || Medium | BFS | 509 |[Fibonacci Number](https://leetcode.com/problems/fibonacci-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_509.java) | [:tv:](https://www.youtube.com/watch?v=WPBTYmvcHXs) | Easy | Array | 508 |[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_508.java) || Medium | DFS, Tree | 507 |[Perfect Number](https://leetcode.com/problems/perfect-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_507.java) | | Easy | Math | 506 |[Relative Ranks](https://leetcode.com/problems/relative-ranks/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_506.java) | | Easy | | 505 |[The Maze II](https://leetcode.com/problems/the-maze-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_505.java) | | Medium | BFS | 504 |[Base 7](https://leetcode.com/problems/base-7/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_504.java) | | Easy | | 503 |[Next Greater Element II](https://leetcode.com/problems/parents-greater-element-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_503.java) | | Medium | Stack | 502 |[IPO](https://leetcode.com/problems/ipo/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_502.java) | | Hard | Heap, Greedy | 501 |[Find Mode in Binary Tree](https://leetcode.com/problems/find-mode-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_501.java) | | Easy | Binary Tree | 500 |[Keyboard Row](https://leetcode.com/problems/keyboard-row/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_500.java) | | Easy | | 499 |[The Maze III](https://leetcode.com/problems/the-maze-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_499.java) | | Hard | BFS | 496 |[Next Greater Element I](https://leetcode.com/problems/parents-greater-element-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_496.java) | | Easy | | 498 |[Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_498.java) | | Medium | | 495 |[Teemo Attacking](https://leetcode.com/problems/teemo-attacking/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_495.java) | | Medium | Array | 494 |[Target Sum](https://leetcode.com/problems/target-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_494.java) | | Medium | | 493 |[Reverse Pairs](https://leetcode.com/problems/reverse-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_493.java) | | Hard | Recursion | 492 |[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_492.java) | | Easy | Array | 491 |[Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_491.java) | | Medium | Backtracking, DFS | 490 |[The Maze](https://leetcode.com/problems/the-maze/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_490.java) | | Medium | BFS | 488 |[Zuma Game](https://leetcode.com/problems/zuma-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_488.java) | | Hard | DFS, Backtracking | 487 |[Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_487.java) | [:tv:](https://youtu.be/nKhteIRZ2Ok) | Medium | Array, Sliding Window | 486 |[Predict the Winner](https://leetcode.com/problems/predict-the-winner/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_486.java) | | Medium | DP | 485 |[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/)| [Java](../master/src/main/java/com/fishercoder/solutions/_485.java) [Javascript](../master/javascript/_485.js) | [:tv:](https://youtu.be/nKhteIRZ2Ok) | Easy | Array | 484 |[Find Permutation](https://leetcode.com/problems/find-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_484.java) | | Medium | Array, String, Greedy | 483 |[Smallest Good Base](https://leetcode.com/problems/smallest-good-base/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_483.java) | | Hard | Binary Search, Math | 482 |[License Key Formatting](https://leetcode.com/problems/license-key-formatting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_482.java) | | Medium | | 481 |[Magical String](https://leetcode.com/problems/magical-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_481.java) || Medium | | 480 |[Sliding Window Median](https://leetcode.com/problems/sliding-window-median/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_480.java) | | Hard | Heap | 479 |[Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_479.java) | | Easy | | 477 |[Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_477.java) | | Medium | Bit Manipulation | 478 |[Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_478.java) | | Medium | Math, Random, Rejection Sampling | 476 |[Number Complement](https://leetcode.com/problems/number-complement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_476.java) | | Easy | Bit Manipulation | 475 |[Heaters](https://leetcode.com/problems/heaters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_475.java) | | Easy | Array Binary Search | 474 |[Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_474.java) | | Medium | DP | 473 |[Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_473.java) | | Medium | Backtracking, DFS | 472 |[Concatenated Words](https://leetcode.com/problems/concatenated-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_472.java) | | Hard | Trie, DP, DFS | 471 |[Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_471.java) | | Hard | DP | 469 |[Convex Polygon](https://leetcode.com/problems/convex-polygon/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_469.java) | | Medium | Math | 468 |[Validate IP Address](https://leetcode.com/problems/validate-ip-address/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_468.java) | | Medium | String | 467 |[Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_467.java) || Medium | DP | 466 |[Count The Repetitions](https://leetcode.com/problems/count-the-repetitions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_466.java) | | Hard | DP | 465 |[Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_465.java) | | Hard | DP | 464 |[Can I Win](https://leetcode.com/problems/can-i-win/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_464.java) | | Medium | DP | 463 |[Island Perimeter](https://leetcode.com/problems/island-perimeter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_463.java) | | Easy | | 462 |[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_462.java) || Medium | | 461 |[Hamming Distance](https://leetcode.com/problems/hamming-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_461.java), [C++](../master/cpp/_461.cpp) | | Easy | | 460 |[LFU Cache](https://leetcode.com/problems/lfu-cache/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_460.java) | | Hard | Design, LinkedHashMap, HashMap | 459 |[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_459.java) | | Easy | String, KMP | 458 |[Poor Pigs](https://leetcode.com/problems/poor-pigs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_458.java) | | Easy | Math | 457 |[Circular Array Loop](https://leetcode.com/problems/circular-array-loop/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_457.java) | | Medium | | 456 |[132 Pattern](https://leetcode.com/problems/132-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_456.java) | | Medium | Stack | 455 |[Assign Cookies](https://leetcode.com/problems/assign-cookies/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_455.java) | | Easy | | 454 |[4Sum II](https://leetcode.com/problems/4sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_454.java) | | Medium | HashMap | 453 |[Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_453.java) | | Easy | | 452 |[Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_452.java) | | Medium | Array, Greedy | 451 |[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_451.java) | | Medium | HashMap | 450 |[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_450.java) | | Medium | Tree, Recursion | 449 |[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_449.java) | | Medium | BFS | 448 |[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_448.java) | | Easy | Array, HashMap | 447 |[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_447.java) | | Easy | HashMap | 446 |[Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_446.java) | | Hard | DP | 445 |[Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_445.java) | | Medium | Stack, LinkedList | 444 |[Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_444.java) | | Medium | Topological Sort, Graph | 443 |[String Compression](https://leetcode.com/problems/string-compression/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_443.java) | | Easy | | 442 |[Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_442.java) | | Medium | Array | 441 |[Arranging Coins](https://leetcode.com/problems/arrange-coins/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_441.java) | | Easy | | 440 |[K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_440.java) | | Hard | | 439 |[Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_439.java) | | Medium | Stack | 438 |[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_438.java) | | Easy | Sliding Window | 437 |[Path Sum III](https://leetcode.com/problems/path-sum-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_437.java) | | Easy | DFS, recursion | 436 |[Find Right Interval](https://leetcode.com/problems/find-right-interval/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_436.java) | | Medium | Binary Search | 435 |[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_435.java) | | Medium | Greedy | 434 |[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_434.java) | | Easy | | 432 |[All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_432.java) | | Hard | Design | 430 |[Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_430.java) | | Medium |LinkedList, DFS, Doubly-Linked List | 429 |[N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_429.java) | | Easy | BFS, Tree | 425 |[Word Squares](https://leetcode.com/problems/word-squares/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_425.java) | | Hard | Trie, Backtracking, Recursion | 424 |[Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_424.java) | | Medium | Sliding Window | 423 |[Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_423.java) | | Medium | Math | 422 |[Valid Word Square](https://leetcode.com/problems/valid-word-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_422.java) | | Easy | | 421 |[Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_421.java) | | Medium | Bit Manipulation, Trie | 420 |[Strong Password Checker](https://leetcode.com/problems/strong-password-checker/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_420.java) | | Hard | | 419 |[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_419.java) | | Medium | DFS | 418 |[Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_418.java) | | Medium | | 417 |[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_417.java) | | Medium | DFS | 416 |[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_416.java), [C++](../master/cpp/_416.cpp) | | Medium | DP | 415 |[Add Strings](https://leetcode.com/problems/add-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_415.java) | | Easy | | 414 |[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_414.java) | | Easy | | 413 |[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_413.java) | | Medium | DP | 412 |[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_412.java) | | Easy | | 411 |[Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_411.java) | | Hard | NP-Hard, Backtracking, Trie, Recursion | 410 |[Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_410.java) | | Hard | Binary Search, DP | 409 |[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_409.java) | | Easy | | 408 |[Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_408.java) | | Easy | | 407 |[Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_407.java) | | Hard | Heap | 406 |[Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_406.java) | | Medium | LinkedList, PriorityQueue | 405 |[Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_405.java) | | Easy | | 404 |[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_404.java) | | Easy | | 403 |[Frog Jump](https://leetcode.com/problems/frog-jump/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_403.java) | | Hard | DP | 402 |[Remove K Digits](https://leetcode.com/problems/remove-k-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_402.java) | | Medium | Greedy, Stack | 401 |[Binary Watch](https://leetcode.com/problems/binary-watch/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_401.java) | | Easy | | 400 |[Nth Digit](https://leetcode.com/problems/nth-digit/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_400.java) | | Easy | | 399 |[Evaluate Division](https://leetcode.com/problems/evaluate-division/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_399.java) | | Medium | Graph, DFS, Backtracking | 398 |[Random Pick Index](https://leetcode.com/problems/random-pick-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_398.java) | | Medium | Reservoir Sampling | 397 |[Integer Replacement](https://leetcode.com/problems/integer-replacement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_397.java) | | Easy | BFS | 396 |[Rotate Function](https://leetcode.com/problems/rotate-function/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_396.java) | | Easy | | 395 |[Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_395.java) | | Medium | Recursion | 394 |[Decode String](https://leetcode.com/problems/decode-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_394.java) | | Medium | Stack Depth-first-search | 393 |[UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_393.java) | | Medium | Bit Manipulation | 392 |[Is Subsequence](https://leetcode.com/problems/is-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_392.java) | | Medium | Array, String | 391 |[Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_391.java) | | Hard | | 390 |[Elimination Game](https://leetcode.com/problems/elimination-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_390.java) | | Medium | | 389 |[Find the Difference](https://leetcode.com/problems/find-the-difference/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_389.java) | || Easy | | 388 |[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_388.java) | | Medium | Stack | 387 |[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_387.java) | | Easy | HashMap | 386 |[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_386.java) | | Medium | | 385 |[Mini Parser](https://leetcode.com/problems/mini-parser/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_385.java) | | Medium | Stack | 384 |[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_384.java) | | Medium | | 383 |[Ransom Note](https://leetcode.com/problems/ransom-note/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_383.java) | | Easy | String | 382 |[Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_382.java) | | Medium | Reservoir Sampling | 381 |[Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_381.java) || Hard | | 380 |[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_380.java) | | Medium | Design, HashMap | 379 |[Design Phone Directory](https://leetcode.com/problems/design-phone-directory/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_379.java) | | Medium | | 378 |[Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_378.java) | | Medium | Binary Search | 377 |[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_377.java) | | Medium | DP | 376 |[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_376.java) | | Medium | DP, Greedy | 375 |[Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_375.java) | | Medium | DP | 374 |[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_374.java) | | Easy | Binary Search | 373 |[Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_373.java) | | Medium | Heap | 372 |[Super Pow](https://leetcode.com/problems/super-pow/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_372.java) | | Medium | Math | 371 |[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_371.java) | | Easy | | 370 |[Range Addition](https://leetcode.com/problems/range-addition/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_370.java) | | Medium |Array | 369 |[Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_369.java) | | Medium | Linked List | 368 |[Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_368.java) | | Medium | DP | 367 |[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_367.java) | | Medium | | 366 |[Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_366.java) | | Medium | DFS | 365 |[Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_365.java) | | Medium | Math | 364 |[Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_364.java) | | Medium | DFS | 363 |[Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_363.java) | | Hard | DP | 362 |[Design Hit Counter](https://leetcode.com/problems/design-hit-counter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_362.java) | | Medium | Design | 361 |[Bomb Enemy](https://leetcode.com/problems/bomb-enemy/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_361.java) | | Medium | | 360 |[Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_360.java) | | Medium | Two Pointers, Math | 359 |[Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_359.java) | | Easy | HashMap | 358 |[Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_358.java) | | Hard | HashMap, Heap, Greedy | 357 |[Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_357.java) | | Medium | DP, Math | 356 |[Line Reflection](https://leetcode.com/problems/line-reflection/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_356.java) | | Medium | HashSet | 355 |[Design Twitter](https://leetcode.com/problems/design-twitter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_355.java) | | Medium | Design, HashMap, Heap | 354 |[Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_354.java) | | Hard | DP, Binary Search | 353 |[Design Snake Game](https://leetcode.com/problems/design-snake-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_353.java) | | Medium | | 352 |[Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_352.java) | | Hard | TreeMap | 351 |[Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_351.java) | | Medium | | 350 |[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_350.java) | [:tv:](https://youtu.be/lKuK69-hMcc) | Easy | HashMap, Binary Search | 349 |[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_349.java) | [:tv:](https://youtu.be/XxStWmfXJRs) | Easy | Two Pointers, Binary Search | 348 |[Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_348.java) | | Medium | Design | 347 |[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_347.java) | | Medium | HashTable, Heap, Bucket Sort | 346 |[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_346.java) | | Easy | Queue | 345 |[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_345.java) | | Easy | String | 344 |[Reverse String](https://leetcode.com/problems/reverse-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_344.java) | [:tv:](https://youtu.be/P68JPXtFyYg) | Easy | String | 343 |[Integer Break](https://leetcode.com/problems/integer-break/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_343.java) | | Medium | Math | 342 |[Power of Four](https://leetcode.com/problems/power-of-four/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_342.java) | | Easy | Math | 341 |[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_341.java) | | Medium | Stack | 340 |[Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_340.java) | | Hard | Sliding Window | 339 |[Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_339.java) | | Easy | DFS | 338 |[Counting Bits](https://leetcode.com/problems/counting-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_338.java) | | Medium | | 337 |[House Robber III](https://leetcode.com/problems/house-robber-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_337.java) | | Medium | DP | 336 |[Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_336.java) | | Hard | | 335 |[Self Crossing](https://leetcode.com/problems/self-crossing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_335.java) | | Hard | Math | 334 |[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_334.java) | | Medium | | 333 |[Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_333.java) | | Medium | Tree | 332 |[Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_332.java) | | Medium | Graph, DFS | 331 |[Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_331.java) | | Medium | Stack | 330 |[Patching Array](https://leetcode.com/problems/patching-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_330.java) | | Hard | Greedy | 329 |[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_329.java) | | Hard | DFS, DP | 328 |[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_328.java) | | Medium | Linked List | 327 |[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_327.java) | | Hard | BST, Divide and Conquer | 326 |[Power of Three](https://leetcode.com/problems/power-of-three/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_326.java) | | Easy | Math | 325 |[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_325.java) | | Medium | HashTable | 324 |[Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_324.java) | | Medium | Sort | 323 |[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_323.java) | | Medium | | 322 |[Coin Change](https://leetcode.com/problems/coin-change/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_322.java) | | Medium | DP | 321 |[Create Maximum Number](https://leetcode.com/problems/create-maximum-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_321.java) | | Hard | 320 |[Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_320.java) | | Medium | Backtracking, Bit Manipulation | 319 |[Bulb Switcher](https://leetcode.com/problems/bulb-switcher/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_319.java) | | Medium | Brainteaser | 318 |[Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_318.java) | | Medium | | 317 |[Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_317.java) | | Hard | | 316 |[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_316.java) | | Hard | Stack, Recursion, Greedy | 315 |[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_315.java) | | Hard | Tree | 314 |[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_314.java) | | Medium | HashMap, BFS | 313 |[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_313.java) | | Medium | | 312 |[Burst Balloons](https://leetcode.com/problems/burst-balloons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_312.java) | | Hard | DP | 311 |[Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_311.java) | | Medium | | 310 |[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_310.java) | | Medium | | 309 |[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-cooldown/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_309.java) | | Medium | DP | 308 |[Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_308.java) | | Hard | Tree | 307 |[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_307.java) | | Medium | Tree | 306 |[Additive Number](https://leetcode.com/problems/additive-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_306.java) | | Medium | | 305 |[Number of Islands II](https://leetcode.com/problems/number-of-islands-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_305.java) | | Hard | Union Find | 304 |[Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_304.java) | | Medium | | 303 |[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_303.java) | | Easy | | 302 |[Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_302.java) | | Hard | DFS, BFS | 301 |[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_301.java) | | Hard | BFS | 300 |[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_300.java) | | Medium | DP | 299 |[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_299.java) | | Easy | | 298 |[Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_298.java) | | Medium | Tree | 297 |[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_297.java) | | Hard | BFS | 296 |[Best Meeting Point](https://leetcode.com/problems/best-meeting-point/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_296.java) | | Hard | | 295 |[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_295.java) | | Hard | Heap | 294 |[Flip Game II](https://leetcode.com/problems/flip-game-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_294.java) | | Medium | Backtracking | 293 |[Flip Game](https://leetcode.com/problems/flip-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_293.java) | | Easy | | 292 |[Nim Game](https://leetcode.com/problems/nim-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_292.java) | | Easy | | 291 |[Word Pattern II](https://leetcode.com/problems/word-pattern-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_291.java) | | Hard | Recursion, Backtracking | 290 |[Word Pattern](https://leetcode.com/problems/word-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_290.java) | | Easy | HashMap | 289 |[Game of Life](https://leetcode.com/problems/game-of-life/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_289.java) | [:tv:](https://youtu.be/YZ-W5DrKPQ0) | Medium | | 288 |[Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_288.java) | | Easy | | 287 |[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_287.java) | | Medium | | 286 |[Walls and Gates](https://leetcode.com/problems/walls-and-gates/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_286.java) | | Medium | BFS | 285 |[Inorder Successor In BST](https://leetcode.com/problems/inorder-successor-in-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_285.java) | | Medium | Tree | 284 |[Peeking Iterator](https://leetcode.com/problems/peeking-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_284.java) | | Medium | Design | 283 |[Move Zeroes](https://leetcode.com/problems/move-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_283.java) | [:tv:](https://youtu.be/39VJV4KVyi8) | Easy | | 282 |[Expression Add Operators](https://leetcode.com/problems/expression-add-operators/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_282.java) | | Hard | | 281 |[Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_281.java) | | Medium | | 280 |[Wiggle Sort](https://leetcode.com/problems/wiggle-sort/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_280.java) | | Medium | | 279 |[Perfect Squares](https://leetcode.com/problems/perfect-squares/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_279.java) | | Medium | | 278 |[First Bad Version](https://leetcode.com/problems/first-bad-version/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_278.java) | [:tv:](https://youtu.be/E15djRphPj0) | Easy | Binary Search | 277 |[Find the Celebrity](https://leetcode.com/problems/find-the-celebrity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_277.java) | | Medium | | 276 |[Paint Fence](https://leetcode.com/problems/paint-fence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_276.java) | | Easy | DP | 275 |[H-Index II](https://leetcode.com/problems/h-index-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_275.java) | | Medium | Binary Search | 274 |[H-Index](https://leetcode.com/problems/h-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_274.java) | | Medium | | 273 |[Integer to English Words](https://leetcode.com/problems/integer-to-english-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_273.java) | | Hard | Math, String | 272 |[Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_272.java) | | Hard | Stack | 271 |[Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_271.java) | | |Medium| | 270 |[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_270.java) | | |Easy| DFS | 269 |[Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_269.java) | | |Hard| Topological Sort | 268 |[Missing Number](https://leetcode.com/problems/missing-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_268.java) | | |Easy| Bit Manipulation | 267 |[Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_267.java) | | Medium | | 266 |[Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_266.java) | | Easy | | 265 |[Paint House II](https://leetcode.com/problems/paint-house-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_265.java) | | Hard | DP | 264 |[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_264.java) | | Medium | DP | 263 |[Ugly Number](https://leetcode.com/problems/ugly-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_263.java) | | Easy | | 261 |[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_261.java) | | Medium | | 260 |[Single Number III](https://leetcode.com/problems/single-number-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_260.java) | | Medium | | 259 |[3Sum Smaller](https://leetcode.com/problems/3sum-smaller/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_259.java) | | Medium | | 258 |[Add Digits](https://leetcode.com/problems/add-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_258.java) | | Easy | | 257 |[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_257.java) | || DFS/Recursion | 256 |[Paint House](https://leetcode.com/problems/paint-house/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_256.java) | | Medium | DP | 255 |[Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_255.java) | | Medium | Tree | 254 |[Factor Combinations](https://leetcode.com/problems/factor-combinations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_254.java) | | Medium | Backtracking | 253 |[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_253.java) | | Medium | Heap | 252 |[Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_252.java) | | Easy | 251 |[Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_251.java) | | Medium | | 250 |[Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_250.java) | | Medium | DFS | 249 |[Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_249.java) | || | 248 |[Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_248.java) | | Hard | Recursion, DFS | 247 |[Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_247.java) | | Medium | Recursion | 246 |[Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_246.java) | | Easy | 245 |[Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_245.java) | | Medium | | 244 |[Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_244.java) | | Medium | HashMap | 243 |[Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_243.java) | | Easy | 242 |[Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_242.java) | | Easy | 241 |[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_241.java) | | Medium | Divide and Conquer | 240 |[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_240.java) | | Medium | Binary Search | 239 |[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_239.java) | | Hard | Heap | 238 |[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_238.java) | | Medium | Array | 237 |[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_237.java) | [:tv:](https://youtu.be/sW8ZaOTtvgI) | Easy | LinkedList | 236 |[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_236.java) | | Medium | DFS | 235 |[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_235.java) | | Easy | DFS | 234 |[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_234.java) | [:tv:](https://youtu.be/bOGh_3MTrdE) | Easy | Linked List | 233 |[Number of Digit One](https://leetcode.com/problems/number-of-digit-one/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_233.java) | | Hard | Math | 232 |[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_232.java) | | Medium | Stack, Design | 231 |[Power of Two](https://leetcode.com/problems/power-of-two/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_231.java) | | Easy | | 230 |[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_230.java) | | Medium | Tree | 229 |[Majority Element II](https://leetcode.com/problems/majority-element-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_229.java) | | Medium | | 228 |[Summary Ranges](https://leetcode.com/problems/summary-ranges/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_228.java) | | Medium | Array | 227 |[Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_227.java) | | Medium | String | 226 |[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_226.java) | | Easy | DFS, recursion | 225 |[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_225.java) | | Easy | Stack, Queue | 224 |[Basic Calculator](https://leetcode.com/problems/basic-calculator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_224.java) | | Hard | | 223 |[Rectangle Area](https://leetcode.com/problems/rectangle-area/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_223.java) | | Easy | | 222 |[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_222.java) | | Medium | Recursion | 221 |[Maximal Square](https://leetcode.com/problems/maximal-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_221.java) | | Medium | Recursion | 220 |[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_220.java) | [:tv:](https://youtu.be/Cu7g9ovYHNI) | Medium | TreeSet | 219 |[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_219.java) | [:tv:](https://youtu.be/SFMCxqSeM94) | Easy | HashMap | 218 |[The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_218.java) | | Hard | TreeMap, Design | 217 |[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_217.java) | [:tv:](https://youtu.be/SFMCxqSeM94) | Easy | HashSet | 216 |[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_216.java) | | Medium | Backtracking | 215 |[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_215.java) | | Medium | Heap | 214 |[Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_214.java) | | Hard | KMP | 213 |[House Robber II](https://leetcode.com/problems/house-robber-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_213.java) | | Medium | DP | 212 |[Word Search II](https://leetcode.com/problems/word-search-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/WordSearchII.java) | | Hard | Trie | 211 |[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_211.java) | | Medium | Trie | 210 |[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_210.java) | | Medium | | 209 |[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_209.java) | | Medium | | 208 |[Implement Trie](https://leetcode.com/problems/implement-trie-prefix-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_208.java) | [:tv:](https://youtu.be/Br7Wt4V5o1c) | Medium | Trie | 207 |[Course Schedule](https://leetcode.com/problems/course-schedule/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_207.java) | | Medium | | 206 |[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_206.java) | [:tv:](https://youtu.be/N_Y12-5oa-w) | Easy | Linked List | 205 |[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_205.java) | | Easy | 204 |[Count Primes](https://leetcode.com/problems/count-primes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_204.java) | | Easy | The Sieve of Eratosthenes | 203 |[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_203.java) | | Easy | 202 |[Happy Number](https://leetcode.com/problems/happy-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_202.java) | | Easy | 201 |[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_201.java) | | Medium | Bit Manipulation | 200 |[Number of Islands](https://leetcode.com/problems/number-of-islands/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_200.java) | | Medium | Union Find, DFS | 199 |[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_199.java) | | Medium | BFS | 198 |[House Robber](https://leetcode.com/problems/house-robber/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_198.java) | | Easy | DP | 191 |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_191.java) | | Easy | Bit Manipulation | 190 |[Reverse Bits](https://leetcode.com/problems/reverse-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_190.java) | | Easy | Bit Manipulation | 189 |[Rotate Array](https://leetcode.com/problems/rotate-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_189.java) | [:tv:](https://youtu.be/lTHTR_jsqAQ) | Easy | 188 |[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_188.java) | | Hard | DP | 187 |[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_187.java) | | Medium | 186 |[Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_186.java) | | Medium | 179 |[Largest Number](https://leetcode.com/problems/largest-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_179.java) | | Medium | | 174 |[Dungeon Game](https://leetcode.com/problems/dungeon-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_174.java) | | Hard | DP | 173 |[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/)| [Solution](../../blmaster/MEDIUM/src/medium/_173.java) | | Medium | Stack, Design | 172 |[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_172.java) | | Easy | 171 |[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_171.java) | | Easy | 170 |[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_170.java) | | Easy | 169 |[Majority Element](https://leetcode.com/problems/majority-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_169.java) | [:tv:](https://youtu.be/M1IL4hz0QrE) | Easy | | 168 |[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_168.java) | | Easy | | 167 |[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)| [Java](../master/src/main/java/com/fishercoder/solutions/_167.java), [Javascript](../master/javascript/_167.js) | | Easy | Binary Search | 166 |[Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_166.java) | | Medium | HashMap | 165 |[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_165.java) | | Easy | | 164 |[Maximum Gap](https://leetcode.com/problems/maximum-gap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_164.java) | | Hard | | 163 |[Missing Ranges](https://leetcode.com/problems/missing-ranges/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_163.java) | || | 162 |[Find Peak Element](https://leetcode.com/problems/find-peak-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_162.java) | | Binary Search | | 161 |[One Edit Distance](https://leetcode.com/problems/one-edit-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_161.java) | || | 160 |[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_160.java) | | Easy | Linked List | 159 |[Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_159.java) | | Hard | String, Sliding Window | 158 |[Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_158.java) | | Hard | | 157 |[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_157.java) | | Easy | | 156 |[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_156.java) | | Medium | Tree, Recursion | 155 |[Min Stack](https://leetcode.com/problems/min-stack/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_155.java) | | Easy | Stack | 154 |[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_154.java) | | Hard | Array, Binary Search | 153 |[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_153.java) | | Medium | Array, Binary Search | 152 |[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_152.java) | | Medium | Array | 151 |[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_151.java) | | Medium | String | 150 |[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_150.java) | | Medium | 149 |[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_149.java) | | Hard | | 148 |[Sort List](https://leetcode.com/problems/sort-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_148.java) || Medium | Linked List, Sorting | 147 |[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_147.java) || Medium | Linked List | 146 |[LRU Cache](https://leetcode.com/problems/lru-cache/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_146.java) | | Hard | Doubly Linked List, LinkedHashMap | 145 |[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_145.java) | [:tv:](https://youtu.be/B6XTLPpsW7k) | Easy | Binary Tree | 144 |[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_144.java) | [:tv:](https://youtu.be/367McfIeBDM) and [:tv:](https://youtu.be/vMHaqhiTn7Y) | Medium | Binary Tree | 143 |[Reorder List](https://leetcode.com/problems/reorder-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_143.java) | | Medium | | 142 |[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_142.java) | | Medium | Linked List | 141 |[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_141.java) | [:tv:](https://youtu.be/agkyC-rbgKM) | Easy | Linked List | 140 |[Word Break II](https://leetcode.com/problems/word-break-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_140.java) | | Hard | Backtracking/DFS | 139 |[Word Break](https://leetcode.com/problems/word-break/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_139.java) | [:tv:](https://youtu.be/iWenZCZEBIA) | Medium | DP, Pruning | 138 |[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_138.java) | | Medium | LinkedList, HashMap | 137 |[Single Number II](https://leetcode.com/problems/single-number-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_137.java) | | Medium | Bit Manipulation | 136 |[Single Number](https://leetcode.com/problems/single-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_136.java) | [:tv:](https://youtu.be/gJ8VcJ8f_Vk) | Easy | Bit Manipulation | 135 |[Candy](https://leetcode.com/problems/candy/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_135.java) | | Hard | Greedy | 134 |[Gas Station](https://leetcode.com/problems/gas-station/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_134.java) | | Medium | Greedy | 133 |[Clone Graph](https://leetcode.com/problems/clone-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_133.java) | | Medium | HashMap, BFS, Graph | 132 |[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_132.java) | | Hard | | 131 |[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_131.java) | | Medium | | 130 |[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_130.java) | | Medium | | 129 |[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_129.java) | | Medium | DFS | 128 |[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_128.java) | | Hard | Union Find | 127 |[Word Ladder](https://leetcode.com/problems/word-ladder/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_127.java) | | Hard | BFS | 126 |[Word Ladder II](https://leetcode.com/problems/word-ladder-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_126.java) | | Hard | BFS | 125 |[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_125.java) | | Easy | Two Pointers | 124 |[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_124.java) | | Hard | Tree, DFS | 123 |[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_123.java) | | Hard | DP | 122 |[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_122.java) | | Easy | Greedy | 121 |[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_121.java) | | Easy | | 120 |[Triangle](https://leetcode.com/problems/triangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_120.java) | | Medium | DP | 119 |[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_119.java) | [:tv:](https://www.youtube.com/watch?v=iVhmR1bzKoo) | Easy | | 118 |[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_118.java) | [:tv:](https://www.youtube.com/watch?v=TXd5lfP3Gac) | Easy | | 117 |[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-parents-right-pointers-in-each-node-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_117.java) | | Medium | BFS | 116 |[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-parents-right-pointers-in-each-node/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_116.java) | | Medium | BFS | 115 |[Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_115.java) | | Hard | DP | 114 |[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_114.java) | | Medium | Tree | 113 |[Path Sum II](https://leetcode.com/problems/path-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_113.java) | | Medium | DFS, Backtracking | 112 |[Path Sum](https://leetcode.com/problems/path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_112.java) | | Easy | DFS | 111 |[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_111.java) | | Easy | BFS, DFS | 110 |[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_110.java) | | Easy | DFS | 109 |[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_109.java) | | Medium | DFS, Recursion | 108 |[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_108.java) | [:tv:](https://youtu.be/VVSnM5DGvjg) | Easy | Tree | 107 |[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_107.java) | | Easy | BFS | 106 |[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_106.java) | | Medium | Recursion, Tree | 105 |[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_105.java) | | Medium | Recursion, Tree | 104 |[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_104.java) | [:tv:](https://youtu.be/dvmoHr5cN80) | Easy | DFS | 103 |[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_103.java) | | Medium | BFS,DFS | 102 |[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_102.java) | [:tv:](https://youtu.be/sFDNL6r5aDM) | Medium | BFS | 101 |[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_101.java) | [:tv:](https://www.youtube.com/watch?v=F85boSPtfKg) | Easy | DFS | 100 |[Same Tree](https://leetcode.com/problems/same-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_100.java) | [:tv:](https://www.youtube.com/watch?v=2Pe6e0KbgFI) | Easy | DFS | 99 |[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_99.java) | | Hard | | 98 |[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_98.java) | [:tv:](https://youtu.be/kR5AxWHa9nc) | Medium | DFS/Recursion | 97 |[Interleaving String](https://leetcode.com/problems/interleaving-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_97.java) | | Hard | DP | 96 |[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_96.java) | | Medium | Recursion, DP | 95 |[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_95.java) | | Medium | Recursion | 94 |[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_94.java) | [:tv:](https://youtu.be/o_T8MswDI_Y) [:tv:](https://youtu.be/QxFOR8sQuB4) | Medium | Binary Tree | 93 |[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_93.java) | | Medium | Backtracking | 92 |[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_92.java) | | Medium | 91 |[Decode Ways](https://leetcode.com/problems/decode-ways/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_91.java) | | Medium | DP | 90 |[Subsets II](https://leetcode.com/problems/subsets-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_90.java) || Medium | Backtracking | 89 |[Gray Code](https://leetcode.com/problems/gray-code/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_89.java) || Medium | Bit Manipulation | 88 |[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_88.java) || Easy | | 87 |[Scramble String](https://leetcode.com/problems/scramble-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_87.java) || Hard | Recursion | 86 |[Partition List](https://leetcode.com/problems/partition-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_86.java) || Medium | Linked List | 85 |[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_85.java) || Hard | DP | 84 |[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_84.java) || Hard | Array, Stack | 83 |[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_83.java) || Easy | Linked List | 82 |[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_82.java) || Medium | Linked List | 81 |[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_81.java) || Medium | Binary Search | 80 |[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_80.java) || Medium | | 79 |[Word Search](https://leetcode.com/problems/word-search/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_79.java) | | Medium | Backtracking, DFS | 78 |[Subsets](https://leetcode.com/problems/subsets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_78.java) || Medium | Backtracking | 77 |[Combinations](https://leetcode.com/problems/combinations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_77.java) || Medium | Backtracking | 76 |[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_76.java) || Hard | Two Pointers | 75 |[Sort Colors](https://leetcode.com/problems/sort-colors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_75.java) || Medium | Two Pointers | 74 |[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_74.java) || Medium | Binary Search | 73 |[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_73.java) || Medium | | 72 |[Edit Distance](https://leetcode.com/problems/edit-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_72.java) || Hard | | 71 |[Simplify Path](https://leetcode.com/problems/simplify-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_71.java) || Medium | Stack | 70 |[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_70.java) | [:tv:](https://youtu.be/ZMNRb9TYiQM) | Easy | DP | 69 |[Sqrt(x)](https://leetcode.com/problems/sqrtx/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_69.java) || Easy | | 68 |[Text Justification](https://leetcode.com/problems/text-justification/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_68.java) || Hard | | 67 |[Add Binary](https://leetcode.com/problems/add-binary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_67.java) || Easy | | 66 |[Plus One](https://leetcode.com/problems/plus-one/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_66.java) | [:tv:](https://youtu.be/HKjt0f1N0GA) | Easy | | 65 |[Valid Number](https://leetcode.com/problems/valid-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_65.java) || Hard | | 64 |[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_64.java) || Medium | DP | 63 |[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_63.java) || Medium | DP | 62 |[Unique Paths](https://leetcode.com/problems/unique-paths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_62.java) || Medium | DP | 61 |[Rotate List](https://leetcode.com/problems/rotate-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_61.java) || Medium | Linked List | 60 |[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_60.java) || Medium | Math, Backtracking | 59 |[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_59.java) | [:tv:](https://www.youtube.com/watch?v=Sv9DK2C4rtc) | Medium | | 58 |[Length of Last Word](https://leetcode.com/problems/length-of-last-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_58.java) || Easy | | 57 |[Insert Intervals](https://leetcode.com/problems/insert-interval/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_57.java) || Hard | Array, Sort | 56 |[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_56.java) || Medium | Array, Sort | 55 |[Jump Game](https://leetcode.com/problems/jump-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_55.java) || Medium | Greedy | 54 |[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_54.java) | [:tv:](https://www.youtube.com/watch?v=uYgoo8BdUAA) | Medium | Array | 53 |[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_53.java) || Easy | Array | 52 |[N-Queens II](https://leetcode.com/problems/n-queens-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_52.java) || Hard | Backtracking | 51 |[N-Queens](https://leetcode.com/problems/n-queens/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_51.java) || Hard | | 50 |[Pow(x, n)](https://leetcode.com/problems/powx-n/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_50.java) || Medium | | 49 |[Group Anagrams](https://leetcode.com/problems/group-anagrams/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_49.java) || Medium | HashMap | 48 |[Rotate Image](https://leetcode.com/problems/rotate-image/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_48.java) | [:tv:](https://youtu.be/gCciKhaK2v8) | Medium | Array | 47 |[Permutations II](https://leetcode.com/problems/permutations-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_47.java) || Medium | Backtracking | 46 |[Permutations](https://leetcode.com/problems/permutations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_46.java) | | Medium | Backtracking | 45 |[Jump Game II](https://leetcode.com/problems/jump-game-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_45.java) || Hard | Array, Greedy | 44 |[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_44.java) || Hard | Backtracking, DP, Greedy, String | 43 |[Multiply Strings](https://leetcode.com/problems/multiply-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_43.java) || Medium | Array, String | 42 |[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_42.java) || Hard | | 41 |[First Missing Positive](https://leetcode.com/problems/first-missing-positive/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_41.java) || Hard | Array | 40 |[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_40.java) || Medium | Backtracking | 39 |[Combination Sum](https://leetcode.com/problems/combination-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_39.java) || Medium | Backtracking | 38 |[Count and Say](https://leetcode.com/problems/count-and-say/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_38.java) || Easy | Recursion, LinkedList | 37 |[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_37.java) || Hard | | 36 |[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) || Medium | | 35 |[Search Insert Position](https://leetcode.com/problems/search-insert-position/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_35.java) || Easy | Array | 34 |[Search for a Range](https://leetcode.com/problems/search-for-a-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_34.java) || Medium | Array, Binary Search | 33 |[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_33.java) || Medium | Binary Search | 32 |[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_32.java) || Hard | Stack, DP | 31 |[Next Permutation](https://leetcode.com/problems/parents-permutation)| [Java](../master/src/main/java/com/fishercoder/solutions/_31.java), [C++](../master/cpp/_31.cpp) || Medium | Array | 30 |[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_30.java) || Hard | HashMap | 29 |[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_29.java) || Medium | | 28 |[Implement strStr()](https://leetcode.com/problems/implement-strstr/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_28.java) || Easy | String | 27 |[Remove Element](https://leetcode.com/problems/remove-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_27.java) | | Easy | | 26 |[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_26.java) | [:tv:](https://youtu.be/nRKZC2JF7LU) | Easy | Array | 25 |[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_25.java) | | Hard | Recursion, LinkedList | 24 |[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_24.java) || Medium | Recursion, LinkedList | 23 |[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_23.java) | [:tv:](https://www.youtube.com/watch?v=Llse1tImXQA) | Hard |Heap | 22 |[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_22.java) || Medium | Backtracking | 21 |[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_21.java) | [:tv:](https://youtu.be/N8WTaSSivEI) | Easy | Recursion | 20 |[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_20.java) | [:tv:](https://www.youtube.com/watch?v=eBbg5pnq5Zg) | Easy |Stack | 19 |[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_19.java) | [:tv:](https://youtu.be/Kka8VgyFZfc) | Medium | Linked List | 18 |[4 Sum](https://leetcode.com/problems/4sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_18.java) || Medium | Two Pointers | 17 |[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_17.java) || Medium | Backtracking | 16 |[3Sum Closest](https://leetcode.com/problems/3sum-closest/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_16.java) || Medium | Two Pointers | 15 |[3Sum](https://leetcode.com/problems/3sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_15.java), [C++](../master/cpp/_15.cpp) | [:tv:](https://www.youtube.com/watch?v=jeim_j8VdiM) | Medium |Two Pointers, Binary Search | 14 |[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_14.java) | [:tv:](https://www.youtube.com/watch?v=K1ps6d7YCy4) | Easy | 13 |[Roman to Integer](https://leetcode.com/problems/roman-to-integer)| [Solution](../master/src/main/java/com/fishercoder/solutions/_13.java) | | Easy | Math, String | 12 |[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_12.java) || Medium | Math, String | 11 |[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_11.java) || Medium | | 10 |[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)| [Java](../master/src/main/java/com/fishercoder/solutions/_10.java), [Javascript](../master/javascript/_10.js) || Hard | DP | 9 |[Palindrome Number](https://leetcode.com/problems/palindrome-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_9.java), [C++](../master/cpp/_9.cpp) | | Easy | 8 |[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_8.java) | | Medium | 7 |[Reverse Integer](https://leetcode.com/problems/reverse-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_7.java), [C++](../master/cpp/_7.cpp) | [:tv:](https://youtu.be/tm1Yrb_SfBM) | Easy | | 6 |[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_6.java) | | Easy | | 5 |[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_5.java) | | Medium | | 4 |[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_4.java), [C++](../master/cpp/_4.cpp) | | Hard | Divide and Conquer | 3 |[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_3.java), [C++](../master/cpp/_3.cpp) | | Medium | HashMap, Sliding Window | 2 |[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_2.java) | | Medium | LinkedList | 1 |[Two Sum](https://leetcode.com/problems/two-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_1.java), [C++](../master/cpp/_1.cpp), [Javascript](../master/javascript/_1.js) | [:tv:](https://www.youtube.com/watch?v=kPXOr6pW8KM&t=) | Easy | HashMap ## Database | # | Title | Solutions | Video | Difficulty | Tag |-----|----------------|---------------|---------------|---------------|------------- |1757|[Recyclable and Low Fat Products](https://leetcode.com/problems/recyclable-and-low-fat-products/)|[Solution](../master/database/_1757.sql) || Easy | |1729|[Find Followers Count](https://leetcode.com/problems/find-followers-count/)|[Solution](../master/database/_1729.sql) || Easy | |1709|[Biggest Window Between Visits](https://leetcode.com/problems/biggest-window-between-visits/)|[Solution](../master/database/_1709.sql) || Medium | |1693|[Daily Leads and Partners](https://leetcode.com/problems/daily-leads-and-partners/)|[Solution](../master/database/_1693.sql) || Easy | |1683|[Invalid Tweets](https://leetcode.com/problems/invalid-tweets/)|[Solution](../master/database/_1683.sql) || Easy | |1677|[Product's Worth Over Invoices](https://leetcode.com/problems/products-worth-over-invoices/)|[Solution](../master/database/_1677.sql) || Easy | |1667|[Fix Names in a Table](https://leetcode.com/problems/fix-names-in-a-table/)|[Solution](../master/database/_1667.sql) || Easy | |1661|[Average Time of Process per Machine](https://leetcode.com/problems/average-time-of-process-per-machine/)|[Solution](../master/database/_1661.sql) || Easy | |1633|[Percentage of Users Attended a Contest](https://leetcode.com/problems/percentage-of-users-attended-a-contest/)|[Solution](../master/database/_1633.sql) || Easy | |1623|[All Valid Triplets That Can Represent a Country](https://leetcode.com/problems/all-valid-triplets-that-can-represent-a-country/)|[Solution](../master/database/_1623.sql) || Easy | |1607|[Sellers With No Sales](https://leetcode.com/problems/sellers-with-no-sales/)|[Solution](../master/database/_1607.sql) || Easy | |1596|[The Most Frequently Ordered Products for Each Customer](https://leetcode.com/problems/the-most-frequently-ordered-products-for-each-customer/)|[Solution](../master/database/_1596.sql) || Medium | |1571|[Warehouse Manager](https://leetcode.com/problems/warehouse-manager/)|[Solution](../master/database/_1571.sql) || Easy | |1587|[Bank Account Summary II](https://leetcode.com/problems/bank-account-summary-ii/)|[Solution](../master/database/_1587.sql) || Easy | |1581|[Customer Who Visited but Did Not Make Any Transactions](https://leetcode.com/problems/customer-who-visited-but-did-not-make-any-transactions/)|[Solution](../master/database/_1581.sql) || Easy | |1565|[Unique Orders and Customers Per Month](https://leetcode.com/problems/unique-orders-and-customers-per-month/)|[Solution](../master/database/_1565.sql) || Easy | |1543|[Fix Product Name Format](https://leetcode.com/problems/fix-product-name-format/)|[Solution](../master/database/_1543.sql) || Easy | |1527|[Patients With a Condition](https://leetcode.com/problems/patients-with-a-condition/)|[Solution](../master/database/_1527.sql) || Easy | |1517|[Find Users With Valid E-Mails](https://leetcode.com/problems/find-users-with-valid-e-mails/)|[Solution](../master/database/_1517.sql) || Easy | |1511|[Customer Order Frequency](https://leetcode.com/problems/customer-order-frequency/)|[Solution](../master/database/_1511.sql) || Easy | |1495|[Friendly Movies Streamed Last Month](https://leetcode.com/problems/friendly-movies-streamed-last-month/)|[Solution](../master/database/_1495.sql) || Easy | |1435|[Create a Session Bar Chart](https://leetcode.com/problems/create-a-session-bar-chart/)|[Solution](../master/database/_1435.sql) || Easy | |1484|[Group Sold Products By The Date](https://leetcode.com/problems/group-sold-products-by-the-date/)|[Solution](../master/database/_1484.sql) || Easy | |1445|[Apples & Oranges](https://leetcode.com/problems/apples-oranges/)|[Solution](../master/database/_1445.sql) || Medium | |1407|[Top Travellers](https://leetcode.com/problems/top-travellers/)|[Solution](../master/database/_1407.sql) || Easy | |1393|[Capital Gain/Loss](https://leetcode.com/problems/capital-gainloss/)|[Solution](../master/database/_1393.sql) || Easy | |1384|[Total Sales Amount by Year](https://leetcode.com/problems/total-sales-amount-by-year/)|[Solution](../master/database/_1384.sql) || Hard | |1378|[Replace Employee ID With The Unique Identifier](https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier/)|[Solution](../master/database/_1378.sql) || Easy | |1371|[The Number of Employees Which Report to Each Employee](https://leetcode.com/problems/the-number-of-employees-which-report-to-each-employee/)|[Solution](../master/database/_1371.sql) || Easy | |1369|[Get the Second Most Recent Activity](https://leetcode.com/problems/get-the-second-most-recent-activity/)|[Solution](../master/database/_1369.sql) || Hard | |1364|[Number of Trusted Contacts of a Customer](https://leetcode.com/problems/number-of-trusted-contacts-of-a-customer/)|[Solution](../master/database/_1364.sql) || Medium | |1355|[Activity Participants](https://leetcode.com/problems/activity-participants/)|[Solution](../master/database/_1355.sql) || Medium | |1350|[Students With Invalid Departments](https://leetcode.com/problems/students-with-invalid-departments/)|[Solution](../master/database/_1350.sql) || Easy | |1341|[Movie Rating](https://leetcode.com/problems/movie-rating/)|[Solution](../master/database/_1341.sql) || Medium | |1327|[List the Products Ordered in a Period](https://leetcode.com/problems/list-the-products-ordered-in-a-period/)|[Solution](../master/database/_1327.sql) || Easy | |1322|[Ads Performance](https://leetcode.com/problems/ads-performance/)|[Solution](../master/database/_1322.sql) || Easy | |1308|[Running Total for Different Genders](https://leetcode.com/problems/running-total-for-different-genders/)|[Solution](../master/database/_1308.sql) || Medium | |1303|[Find the Team Size](https://leetcode.com/problems/find-the-team-size/)|[Solution](../master/database/_1303.sql) || Easy | |1294|[Weather Type in Each Country](https://leetcode.com/problems/weather-type-in-each-country/)|[Solution](../master/database/_1294.sql) | | Easy | |1285|[Find the Start and End Number of Continuous Ranges](https://leetcode.com/problems/find-the-start-and-end-number-of-continuous-ranges/)|[Solution](../master/database/_1285.sql) || Medium | |1280|[Students and Examinations](https://leetcode.com/problems/students-and-examinations/)|[Solution](../master/database/_1280.sql) | [:tv:](https://www.youtube.com/watch?v=ThbkV4Fs7iE)| Easy | |1270|[All People Report to the Given Manager](https://leetcode.com/problems/all-people-report-to-the-given-manager/)|[Solution](../master/database/_1270.sql) || Medium | |1251|[Average Selling Price](https://leetcode.com/problems/average-selling-price/)|[Solution](../master/database/_1251.sql) | | Easy | |1241|[Number of Comments per Post](https://leetcode.com/problems/number-of-comments-per-post/)|[Solution](../master/database/_1241.sql) | | Easy | |1211|[Queries Quality and Percentage](https://leetcode.com/problems/queries-quality-and-percentage/)|[Solution](../master/database/_1211.sql) | | Easy | |1179|[Reformat Department Table](https://leetcode.com/problems/reformat-department-table/)|[Solution](../master/database/_1179.sql) | | Easy | |1173|[Immediate Food Delivery I](https://leetcode.com/problems/immediate-food-delivery-i/)|[Solution](../master/database/_1173.sql) | | Easy | |1148|[Article Views I](https://leetcode.com/problems/article-views-i/)|[Solution](../master/database/_1148.sql) | | Easy | |1142|[User Activity for the Past 30 Days II](https://leetcode.com/problems/user-activity-for-the-past-30-days-ii/)|[Solution](../master/database/_1142.sql) | | Easy | |1141|[User Activity for the Past 30 Days I](https://leetcode.com/problems/user-activity-for-the-past-30-days-i/)|[Solution](../master/database/_1141.sql) | | Easy | |1113|[Reported Posts](https://leetcode.com/problems/reported-posts/)|[Solution](../master/database/_1113.sql) | | Easy | |1084|[Sales Analysis III](https://leetcode.com/problems/sales-analysis-iii/)|[Solution](../master/database/_1084.sql) | | Easy | |1083|[Sales Analysis II](https://leetcode.com/problems/sales-analysis-ii/)|[Solution](../master/database/_1083.sql) | | Easy | |1082|[Sales Analysis I](https://leetcode.com/problems/sales-analysis-i/)|[Solution](../master/database/_1082.sql) | | Easy | |1076|[Project Employees II](https://leetcode.com/problems/project-employees-ii/)|[Solution](../master/database/_1076.sql) | | Easy | |1075|[Project Employees I](https://leetcode.com/problems/project-employees-i/)|[Solution](../master/database/_1075.sql) | | Easy | |1069|[Product Sales Analysis II](https://leetcode.com/problems/product-sales-analysis-ii/)|[Solution](../master/database/_1069.sql) | | Easy | |1068|[Product Sales Analysis I](https://leetcode.com/problems/product-sales-analysis-i/)|[Solution](../master/database/_1068.sql) | | Easy | |1050|[Actors and Directors Who Cooperated At Least Three Times](https://leetcode.com/problems/actors-and-directors-who-cooperated-at-least-three-times/)|[Solution](../master/database/_1050.sql) || Easy | |627|[Swap Salary](https://leetcode.com/problems/swap-salary/)|[Solution](../master/database/_627.sql) | | Easy | |626|[Exchange Seats](https://leetcode.com/problems/exchange-seats/)|[Solution](../master/database/_626.sql) | | Medium | |620|[Not Boring Movies](https://leetcode.com/problems/not-boring-movies/)|[Solution](../master/database/_620.sql) | | Easy | |619|[Biggest Single Number](https://leetcode.com/problems/biggest-single-number/)|[Solution](../master/database/_619.sql) | | Easy | |618|[Students Report By Geography](https://leetcode.com/problems/students-report-by-geography/)|[Solution](../master/database/_618.sql) | | Hard | Session Variables |615|[Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company/)|[Solution](../master/database/_615.sql) | | Hard| |614|[Second Degree Follower](https://leetcode.com/problems/second-degree-follower/)|[Solution](../master/database/_614.sql) | | Medium | Inner Join |613|[Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line/)|[Solution](../master/database/_613.sql) || Easy| |612|[Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane/)|[Solution](../master/database/_612.sql) || Medium| |610|[Triangle Judgement](https://leetcode.com/problems/triangle-judgement/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_610.java) | | Easy | |608|[Tree Node](https://leetcode.com/problems/tree-node/)|[Solution](../master/database/_608.sql) | | Medium | Union |607|[Sales Person](https://leetcode.com/problems/sales-person/)|[Solution](../master/database/_607.sql) | | Easy | |603|[Consecutive Available Seats](https://leetcode.com/problems/sales-person/)|[Solution](../master/database/_603.sql) | | Easy | |602|[Friend Requests II: Who Has the Most Friends](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends/)|[Solution](../master/database/_602.sql) | | Medium | |601|[Human Traffic of Stadium](https://leetcode.com/problems/human-traffic-of-stadium/)|[Solution](../master/database/_601.sql) | | Hard | |597|[Friend Requests I: Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate/)|[Solution](../master/database/_597.sql) | | Easy | |596|[Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students/)|[Solution](../master/database/_596.sql) || Easy | |595|[Big Countries](https://leetcode.com/problems/big-countries/)|[Solution](../master/database/_595.sql) | | Easy | |586|[Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders/)|[Solution](../master/database/_586.sql) | | Easy| |585|[Investments in 2016](https://leetcode.com/problems/investments-in-2016/)|[Solution](../master/database/_585.java) || Medium| |584|[Find Customer Referee](https://leetcode.com/problems/find-customer-referee/)|[Solution](../master/database/_584.java) || Easy| |580|[Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments/)|[Solution](../master/database/_580.sql) | |Medium | Left Join |578|[Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question/)|[Solution](../master/database/_578.sql) || Medium | |577|[Employee Bonus](https://leetcode.com/problems/employee-bonus/)|[Solution](../master/database/_577.sql) || Easy | |574|[Winning Candidate](https://leetcode.com/problems/winning-candidate/)|[Solution](../master/database/_574.sql) || Medium | |571|[Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers/)|[Solution](../master/database/_571.sql) || Hard | |570|[Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports/)|[Solution](../master/database/_570.sql) || Medium | |569|[Median Employee Salary](https://leetcode.com/problems/median-employee-salary/)|[Solution](../master/database/_569.sql) || Hard | |534|[Game Play Analysis III](https://leetcode.com/problems/game-play-analysis-iii/)|[Solution](../master/database/_534.sql)|| Easy| |512|[Game Play Analysis II](https://leetcode.com/problems/game-play-analysis-ii/)|[Solution](../master/database/_512.sql)|| Easy| |511|[Game Play Analysis I](https://leetcode.com/problems/game-play-analysis-i/)|[Solution](../master/database/_511.sql)|| Easy| |262|[Trips and Users](https://leetcode.com/problems/trips-and-users/)|[Solution](../master/database/_262.sql)||Hard| Inner Join |197|[Rising Temperature](https://leetcode.com/problems/rising-temperature/)|[Solution](../master/database/_197.sql)| | Easy| |196|[Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails/)|[Solution](../master/database/_196.sql)| |Easy| |185|[Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries)|[Solution](../master/database/_185.sql)| | Hard| |184|[Department Highest Salary](https://leetcode.com/problems/department-highest-salary)|[Solution](../master/database/_184.sql)| | Medium| |183|[Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order/)|[Solution](../master/database/_183.sql)| | Easy| |182|[Duplicate Emails](https://leetcode.com/problems/duplicate-emails/)|[Solution](../master/database/_182.sql)| | Easy| |181|[Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers/)|[Solution](../master/database/_181.sql)| | Easy| |180|[Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers)|[Solution](../master/database/_180.sql)| | Medium| |178|[Rank Scores](https://leetcode.com/problems/rank-scores/)|[Solution](../master/database/_178.sql)| | Medium| |177|[Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary/)|[Solution](../master/database/_177.sql)| | Medium| |176|[Second Highest Salary](https://leetcode.com/problems/second-highest-salary/)|[Solution](../master/database/_176.sql)| | Easy| |175|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables/)|[Solution](../master/database/_175.sql)| | Easy| ## Shell | # | Title | Solutions | Video | Difficulty | Tag |-----|----------------|---------------|---------------|---------------|------------- |195|[Tenth Line](https://leetcode.com/problems/tenth-line/)|[Solution](../master/shell/TenthLine.sh)| | Easy| |194|[Transpose File](https://leetcode.com/problems/transpose-file/)|[Solution](../master/shell/TransposeFile.sh)| | Medium| |193|[Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers/)|[Solution](../master/shell/ValidPhoneNumbers.sh)| | Easy| |192|[Word Frequency](https://leetcode.com/problems/word-frequency/)|[Solution](../master/shell/_192.sh)| | Medium| ## Contributing Your ideas/fixes/algorithms are more than welcome! 0. Please make sure your PR builds after submitting! Check out here: https://travis-ci.org/github/fishercoder1534/Leetcode/pull_requests and look for your PR build. 1. Fork this repo 2. Clone your forked repo (`git clone https://github.com/YOUR_GITHUB_USERNAME/Leetcode.git`) onto your local machine 3. `cd` into your cloned directory, create your feature branch (`git checkout -b my-awesome-fix`) 4. `git add` your desired changes to this repo 5. Commit your changes (`git commit -m 'Added some awesome features/fixes'`) 6. Push to the branch (`git push origin my-awesome-feature`) 7. Open your forked repo on Github website, create a new Pull Request to this repo! ## Best way to open this project 1. Install IntelliJ on your machine, either CE or UE. 2. git clone this repo to your local disk 3. import this project as a new project (does need to be imported as a gradle project) 4. If you run into "Could not determine Java version using executable ..." error, use local gradle distribution: "/usr/local/Cellar/gradle/4.8.1/libexec/" instead of the default one. More details, see [this question on Stackoverflow](https://stackoverflow.com/questions/52195643/cannot-find-symbol-intellij-gradle/52196069#52196069).