diff --git a/README.md b/README.md index 518477fb..5cfd70d4 100755 --- a/README.md +++ b/README.md @@ -10,9 +10,9 @@ ![](./website/static/wechat-qr-code.png)

-GitHub All Releases +GitHub All Releases - + @@ -23,7 +23,7 @@

-GitHub +GitHub @@ -126,2365 +126,2426 @@ | | Easy | Medium | Hard | Total | |:--------:|:--------:|:--------:|:--------:|:--------:| -|Optimizing|33|76|41|150| -|Accepted|**291**|**479**|**139**|**909**| -|Total|582|1251|513|2346| -|Perfection Rate|88.7%|84.1%|70.5%|83.5%| -|Completion Rate|50.0%|38.3%|27.1%|38.7%| +|Optimizing|31|78|41|150| +|Accepted|**287**|**483**|**140**|**910**| +|Total|592|1285|530|2407| +|Perfection Rate|89.2%|83.9%|70.7%|83.5%| +|Completion Rate|48.5%|37.6%|26.4%|37.8%| |------------|----------------------------|----------------------------|----------------------------|----------------------------| ## 二. 目录 -以下已经收录了 783 道题的题解，还有 11 道题在尝试优化到 beats 100% +以下已经收录了 786 道题的题解，还有 11 道题在尝试优化到 beats 100% | No. | Title | Solution | Acceptance | Difficulty | Frequency | |:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:| -|0001|Two Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum)|48.9%|Easy|| -|0002|Add Two Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers)|39.1%|Medium|| -|0003|Longest Substring Without Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)|33.5%|Medium|| -|0004|Median of Two Sorted Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays)|34.6%|Hard|| -|0005|Longest Palindromic Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0005.Longest-Palindromic-Substring)|32.2%|Medium|| -|0006|Zigzag Conversion|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0006.Zigzag-Conversion)|42.2%|Medium|| -|0007|Reverse Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer)|26.9%|Medium|| +|0001|Two Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum)|49.1%|Easy|| +|0002|Add Two Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers)|39.5%|Medium|| +|0003|Longest Substring Without Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)|33.7%|Medium|| +|0004|Median of Two Sorted Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays)|34.9%|Hard|| +|0005|Longest Palindromic Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0005.Longest-Palindromic-Substring)|32.3%|Medium|| +|0006|Zigzag Conversion|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0006.Zigzag-Conversion)|42.7%|Medium|| +|0007|Reverse Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer)|27.1%|Medium|| |0008|String to Integer (atoi)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0008.String-to-Integer-atoi)|16.6%|Medium|| -|0009|Palindrome Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number)|52.6%|Easy|| +|0009|Palindrome Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number)|52.8%|Easy|| |0010|Regular Expression Matching||28.3%|Hard|| -|0011|Container With Most Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water)|54.1%|Medium|| -|0012|Integer to Roman|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0012.Integer-to-Roman)|59.9%|Medium|| -|0013|Roman to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0013.Roman-to-Integer)|57.9%|Easy|| -|0014|Longest Common Prefix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0014.Longest-Common-Prefix)|40.1%|Easy|| -|0015|3Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum)|31.6%|Medium|| -|0016|3Sum Closest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest)|46.5%|Medium|| -|0017|Letter Combinations of a Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number)|54.8%|Medium|| -|0018|4Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum)|37.1%|Medium|| -|0019|Remove Nth Node From End of List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List)|38.8%|Medium|| +|0011|Container With Most Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water)|54.2%|Medium|| +|0012|Integer to Roman|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0012.Integer-to-Roman)|60.3%|Medium|| +|0013|Roman to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0013.Roman-to-Integer)|58.3%|Easy|| +|0014|Longest Common Prefix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0014.Longest-Common-Prefix)|40.5%|Easy|| +|0015|3Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum)|32.0%|Medium|| +|0016|3Sum Closest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest)|46.3%|Medium|| +|0017|Letter Combinations of a Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number)|55.2%|Medium|| +|0018|4Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum)|36.7%|Medium|| +|0019|Remove Nth Node From End of List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List)|39.2%|Medium|| |0020|Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses)|40.8%|Easy|| -|0021|Merge Two Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists)|61.1%|Easy|| -|0022|Generate Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses)|70.9%|Medium|| -|0023|Merge k Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists)|47.7%|Hard|| -|0024|Swap Nodes in Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs)|59.5%|Medium|| -|0025|Reverse Nodes in k-Group|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group)|52.2%|Hard|| -|0026|Remove Duplicates from Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array)|49.6%|Easy|| -|0027|Remove Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element)|51.6%|Easy|| -|0028|Implement strStr()|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Implement-strStr)|36.7%|Easy|| -|0029|Divide Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0029.Divide-Two-Integers)|17.5%|Medium|| -|0030|Substring with Concatenation of All Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)|28.5%|Hard|| -|0031|Next Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0031.Next-Permutation)|36.7%|Medium|| -|0032|Longest Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0032.Longest-Valid-Parentheses)|32.4%|Hard|| -|0033|Search in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array)|38.2%|Medium|| -|0034|Find First and Last Position of Element in Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array)|40.5%|Medium|| -|0035|Search Insert Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0035.Search-Insert-Position)|42.2%|Easy|| -|0036|Valid Sudoku|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku)|55.9%|Medium|| -|0037|Sudoku Solver|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver)|55.4%|Hard|| -|0038|Count and Say||49.2%|Medium|| -|0039|Combination Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum)|66.5%|Medium|| -|0040|Combination Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II)|52.8%|Medium|| -|0041|First Missing Positive|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive)|36.3%|Hard|| -|0042|Trapping Rain Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)|57.4%|Hard|| -|0043|Multiply Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0043.Multiply-Strings)|38.2%|Medium|| -|0044|Wildcard Matching||26.7%|Hard|| -|0045|Jump Game II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0045.Jump-Game-II)|37.9%|Medium|| -|0046|Permutations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations)|73.5%|Medium|| -|0047|Permutations II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II)|56.0%|Medium|| -|0048|Rotate Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image)|67.8%|Medium|| -|0049|Group Anagrams|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams)|65.0%|Medium|| -|0050|Pow(x, n)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Powx-n)|32.6%|Medium|| -|0051|N-Queens|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens)|61.3%|Hard|| -|0052|N-Queens II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II)|70.1%|Hard|| -|0053|Maximum Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)|49.7%|Medium|| -|0054|Spiral Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)|42.5%|Medium|| -|0055|Jump Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0055.Jump-Game)|38.2%|Medium|| -|0056|Merge Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals)|45.4%|Medium|| -|0057|Insert Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval)|37.7%|Medium|| -|0058|Length of Last Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0058.Length-of-Last-Word)|38.8%|Easy|| -|0059|Spiral Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II)|65.7%|Medium|| -|0060|Permutation Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence)|42.9%|Hard|| -|0061|Rotate List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List)|35.3%|Medium|| -|0062|Unique Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths)|60.8%|Medium|| -|0063|Unique Paths II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II)|38.7%|Medium|| -|0064|Minimum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum)|60.0%|Medium|| -|0065|Valid Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0065.Valid-Number)|18.4%|Hard|| -|0066|Plus One|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0066.Plus-One)|43.1%|Easy|| -|0067|Add Binary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0067.Add-Binary)|50.9%|Easy|| -|0068|Text Justification||35.9%|Hard|| -|0069|Sqrt(x)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx)|36.8%|Easy|| -|0070|Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs)|51.4%|Easy|| -|0071|Simplify Path|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path)|39.0%|Medium|| -|0072|Edit Distance||51.7%|Hard|| -|0073|Set Matrix Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0073.Set-Matrix-Zeroes)|49.1%|Medium|| -|0074|Search a 2D Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0074.Search-a-2D-Matrix)|45.6%|Medium|| -|0075|Sort Colors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors)|55.9%|Medium|| -|0076|Minimum Window Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)|39.5%|Hard|| -|0077|Combinations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations)|65.0%|Medium|| -|0078|Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)|72.6%|Medium|| -|0079|Word Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search)|39.9%|Medium|| -|0080|Remove Duplicates from Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II)|51.0%|Medium|| +|0021|Merge Two Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists)|61.5%|Easy|| +|0022|Generate Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses)|71.5%|Medium|| +|0023|Merge k Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists)|48.1%|Hard|| +|0024|Swap Nodes in Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs)|60.0%|Medium|| +|0025|Reverse Nodes in k-Group|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group)|52.9%|Hard|| +|0026|Remove Duplicates from Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array)|50.0%|Easy|| +|0027|Remove Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element)|51.9%|Easy|| +|0028|Find the Index of the First Occurrence in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Find-the-Index-of-the-First-Occurrence-in-a-String)|37.2%|Medium|| +|0029|Divide Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0029.Divide-Two-Integers)|17.4%|Medium|| +|0030|Substring with Concatenation of All Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)|30.8%|Hard|| +|0031|Next Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0031.Next-Permutation)|36.9%|Medium|| +|0032|Longest Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0032.Longest-Valid-Parentheses)|32.6%|Hard|| +|0033|Search in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array)|38.5%|Medium|| +|0034|Find First and Last Position of Element in Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array)|41.3%|Medium|| +|0035|Search Insert Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0035.Search-Insert-Position)|42.1%|Easy|| +|0036|Valid Sudoku|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku)|56.4%|Medium|| +|0037|Sudoku Solver|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver)|56.2%|Hard|| +|0038|Count and Say||49.6%|Medium|| +|0039|Combination Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum)|67.1%|Medium|| +|0040|Combination Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II)|53.1%|Medium|| +|0041|First Missing Positive|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive)|36.4%|Hard|| +|0042|Trapping Rain Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)|57.9%|Hard|| +|0043|Multiply Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0043.Multiply-Strings)|38.5%|Medium|| +|0044|Wildcard Matching||26.8%|Hard|| +|0045|Jump Game II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0045.Jump-Game-II)|38.3%|Medium|| +|0046|Permutations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations)|74.2%|Medium|| +|0047|Permutations II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II)|56.4%|Medium|| +|0048|Rotate Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image)|69.4%|Medium|| +|0049|Group Anagrams|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams)|65.6%|Medium|| +|0050|Pow(x, n)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Powx-n)|32.7%|Medium|| +|0051|N-Queens|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens)|62.3%|Hard|| +|0052|N-Queens II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II)|70.5%|Hard|| +|0053|Maximum Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)|49.9%|Medium|| +|0054|Spiral Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)|43.1%|Medium|| +|0055|Jump Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0055.Jump-Game)|38.3%|Medium|| +|0056|Merge Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals)|45.7%|Medium|| +|0057|Insert Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval)|37.8%|Medium|| +|0058|Length of Last Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0058.Length-of-Last-Word)|39.7%|Easy|| +|0059|Spiral Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II)|66.2%|Medium|| +|0060|Permutation Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence)|43.4%|Hard|| +|0061|Rotate List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List)|35.6%|Medium|| +|0062|Unique Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths)|61.9%|Medium|| +|0063|Unique Paths II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II)|39.0%|Medium|| +|0064|Minimum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum)|60.4%|Medium|| +|0065|Valid Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0065.Valid-Number)|18.5%|Hard|| +|0066|Plus One|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0066.Plus-One)|43.3%|Easy|| +|0067|Add Binary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0067.Add-Binary)|51.1%|Easy|| +|0068|Text Justification||36.3%|Hard|| +|0069|Sqrt(x)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrtx)|36.9%|Easy|| +|0070|Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs)|51.6%|Easy|| +|0071|Simplify Path|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path)|39.1%|Medium|| +|0072|Edit Distance||52.3%|Hard|| +|0073|Set Matrix Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0073.Set-Matrix-Zeroes)|49.6%|Medium|| +|0074|Search a 2D Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0074.Search-a-2D-Matrix)|46.4%|Medium|| +|0075|Sort Colors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors)|56.6%|Medium|| +|0076|Minimum Window Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)|39.8%|Hard|| +|0077|Combinations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations)|65.6%|Medium|| +|0078|Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)|73.3%|Medium|| +|0079|Word Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search)|40.0%|Medium|| +|0080|Remove Duplicates from Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II)|51.3%|Medium|| |0081|Search in Rotated Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0081.Search-in-Rotated-Sorted-Array-II)|35.7%|Medium|| -|0082|Remove Duplicates from Sorted List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II)|44.9%|Medium|| -|0083|Remove Duplicates from Sorted List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List)|49.5%|Easy|| -|0084|Largest Rectangle in Histogram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram)|41.4%|Hard|| -|0085|Maximal Rectangle||43.4%|Hard|| -|0086|Partition List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List)|50.6%|Medium|| -|0087|Scramble String||35.8%|Hard|| -|0088|Merge Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array)|45.1%|Easy|| -|0089|Gray Code|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code)|55.8%|Medium|| -|0090|Subsets II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II)|54.3%|Medium|| -|0091|Decode Ways|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways)|30.8%|Medium|| -|0092|Reverse Linked List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II)|45.1%|Medium|| -|0093|Restore IP Addresses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses)|42.6%|Medium|| -|0094|Binary Tree Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal)|71.6%|Easy|| -|0095|Unique Binary Search Trees II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II)|50.5%|Medium|| -|0096|Unique Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees)|58.8%|Medium|| -|0097|Interleaving String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0097.Interleaving-String)|36.8%|Medium|| -|0098|Validate Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree)|30.9%|Medium|| -|0099|Recover Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree)|49.5%|Medium|| -|0100|Same Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree)|55.9%|Easy|| -|0101|Symmetric Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)|52.2%|Easy|| -|0102|Binary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal)|62.4%|Medium|| -|0103|Binary Tree Zigzag Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal)|54.4%|Medium|| -|0104|Maximum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree)|72.5%|Easy|| -|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal)|59.7%|Medium|| -|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal)|56.4%|Medium|| -|0107|Binary Tree Level Order Traversal II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II)|59.5%|Medium|| -|0108|Convert Sorted Array to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree)|67.0%|Easy|| -|0109|Convert Sorted List to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree)|56.4%|Medium|| -|0110|Balanced Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree)|47.5%|Easy|| -|0111|Minimum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)|43.0%|Easy|| -|0112|Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum)|46.1%|Easy|| -|0113|Path Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II)|54.8%|Medium|| -|0114|Flatten Binary Tree to Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List)|58.8%|Medium|| -|0115|Distinct Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0115.Distinct-Subsequences)|42.9%|Hard|| -|0116|Populating Next Right Pointers in Each Node|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node)|58.3%|Medium|| -|0117|Populating Next Right Pointers in Each Node II||48.9%|Medium|| -|0118|Pascal's Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0118.Pascals-Triangle)|67.4%|Easy|| -|0119|Pascal's Triangle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0119.Pascals-Triangle-II)|58.6%|Easy|| -|0120|Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle)|53.1%|Medium|| -|0121|Best Time to Buy and Sell Stock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock)|54.3%|Easy|| -|0122|Best Time to Buy and Sell Stock II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II)|62.6%|Medium|| -|0123|Best Time to Buy and Sell Stock III||43.9%|Hard|| -|0124|Binary Tree Maximum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum)|38.0%|Hard|| -|0125|Valid Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome)|42.6%|Easy|| -|0126|Word Ladder II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)|27.1%|Hard|| -|0127|Word Ladder|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder)|36.0%|Hard|| -|0128|Longest Consecutive Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence)|49.1%|Medium|| -|0129|Sum Root to Leaf Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers)|57.8%|Medium|| -|0130|Surrounded Regions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions)|34.9%|Medium|| -|0131|Palindrome Partitioning|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning)|60.9%|Medium|| -|0132|Palindrome Partitioning II||33.4%|Hard|| -|0133|Clone Graph||49.2%|Medium|| -|0134|Gas Station||44.7%|Medium|| -|0135|Candy|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0135.Candy)|40.2%|Hard|| -|0136|Single Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number)|69.7%|Easy|| -|0137|Single Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II)|57.1%|Medium|| -|0138|Copy List with Random Pointer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0138.Copy-List-with-Random-Pointer)|49.2%|Medium|| -|0139|Word Break||45.0%|Medium|| -|0140|Word Break II||43.1%|Hard|| -|0141|Linked List Cycle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle)|46.4%|Easy|| -|0142|Linked List Cycle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II)|45.2%|Medium|| -|0143|Reorder List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List)|49.4%|Medium|| -|0144|Binary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal)|63.5%|Easy|| -|0145|Binary Tree Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal)|65.3%|Easy|| -|0146|LRU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0146.LRU-Cache)|40.3%|Medium|| -|0147|Insertion Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List)|49.4%|Medium|| -|0148|Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List)|53.0%|Medium|| -|0149|Max Points on a Line||21.1%|Hard|| -|0150|Evaluate Reverse Polish Notation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation)|43.5%|Medium|| -|0151|Reverse Words in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0151.Reverse-Words-in-a-String)|29.3%|Medium|| -|0152|Maximum Product Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray)|34.7%|Medium|| -|0153|Find Minimum in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array)|48.2%|Medium|| +|0082|Remove Duplicates from Sorted List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II)|45.2%|Medium|| +|0083|Remove Duplicates from Sorted List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List)|49.7%|Easy|| +|0084|Largest Rectangle in Histogram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram)|41.8%|Hard|| +|0085|Maximal Rectangle||43.8%|Hard|| +|0086|Partition List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List)|51.0%|Medium|| +|0087|Scramble String||36.0%|Hard|| +|0088|Merge Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array)|45.4%|Easy|| +|0089|Gray Code|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code)|56.2%|Medium|| +|0090|Subsets II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II)|54.9%|Medium|| +|0091|Decode Ways|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways)|31.2%|Medium|| +|0092|Reverse Linked List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II)|45.3%|Medium|| +|0093|Restore IP Addresses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses)|43.0%|Medium|| +|0094|Binary Tree Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal)|72.6%|Easy|| +|0095|Unique Binary Search Trees II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II)|51.1%|Medium|| +|0096|Unique Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees)|59.1%|Medium|| +|0097|Interleaving String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0097.Interleaving-String)|37.0%|Medium|| +|0098|Validate Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree)|31.6%|Medium|| +|0099|Recover Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree)|49.9%|Medium|| +|0100|Same Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree)|56.2%|Easy|| +|0101|Symmetric Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)|52.6%|Easy|| +|0102|Binary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal)|62.9%|Medium|| +|0103|Binary Tree Zigzag Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal)|54.8%|Medium|| +|0104|Maximum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree)|72.9%|Easy|| +|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal)|60.3%|Medium|| +|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal)|57.0%|Medium|| +|0107|Binary Tree Level Order Traversal II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II)|60.0%|Medium|| +|0108|Convert Sorted Array to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree)|68.6%|Easy|| +|0109|Convert Sorted List to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree)|56.9%|Medium|| +|0110|Balanced Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree)|47.9%|Easy|| +|0111|Minimum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)|43.3%|Easy|| +|0112|Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum)|46.5%|Easy|| +|0113|Path Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II)|55.2%|Medium|| +|0114|Flatten Binary Tree to Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List)|60.7%|Medium|| +|0115|Distinct Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0115.Distinct-Subsequences)|43.3%|Hard|| +|0116|Populating Next Right Pointers in Each Node|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0116.Populating-Next-Right-Pointers-in-Each-Node)|58.9%|Medium|| +|0117|Populating Next Right Pointers in Each Node II||49.3%|Medium|| +|0118|Pascal's Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0118.Pascals-Triangle)|68.4%|Easy|| +|0119|Pascal's Triangle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0119.Pascals-Triangle-II)|59.2%|Easy|| +|0120|Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle)|53.6%|Medium|| +|0121|Best Time to Buy and Sell Stock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock)|54.4%|Easy|| +|0122|Best Time to Buy and Sell Stock II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II)|63.0%|Medium|| +|0123|Best Time to Buy and Sell Stock III||44.5%|Hard|| +|0124|Binary Tree Maximum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum)|38.2%|Hard|| +|0125|Valid Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome)|43.2%|Easy|| +|0126|Word Ladder II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)|27.6%|Hard|| +|0127|Word Ladder|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder)|36.4%|Hard|| +|0128|Longest Consecutive Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence)|49.0%|Medium|| +|0129|Sum Root to Leaf Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers)|58.3%|Medium|| +|0130|Surrounded Regions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions)|35.5%|Medium|| +|0131|Palindrome Partitioning|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning)|61.8%|Medium|| +|0132|Palindrome Partitioning II||33.5%|Hard|| +|0133|Clone Graph||50.0%|Medium|| +|0134|Gas Station||44.9%|Medium|| +|0135|Candy|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0135.Candy)|40.5%|Hard|| +|0136|Single Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number)|69.9%|Easy|| +|0137|Single Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II)|57.5%|Medium|| +|0138|Copy List with Random Pointer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0138.Copy-List-with-Random-Pointer)|50.0%|Medium|| +|0139|Word Break||45.2%|Medium|| +|0140|Word Break II||43.8%|Hard|| +|0141|Linked List Cycle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle)|46.7%|Easy|| +|0142|Linked List Cycle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II)|45.8%|Medium|| +|0143|Reorder List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List)|50.3%|Medium|| +|0144|Binary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal)|64.2%|Easy|| +|0145|Binary Tree Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal)|66.1%|Easy|| +|0146|LRU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0146.LRU-Cache)|40.5%|Medium|| +|0147|Insertion Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List)|49.8%|Medium|| +|0148|Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List)|53.6%|Medium|| +|0149|Max Points on a Line||21.5%|Hard|| +|0150|Evaluate Reverse Polish Notation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation)|44.0%|Medium|| +|0151|Reverse Words in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0151.Reverse-Words-in-a-String)|29.8%|Medium|| +|0152|Maximum Product Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray)|34.9%|Medium|| +|0153|Find Minimum in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array)|48.4%|Medium|| |0154|Find Minimum in Rotated Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II)|43.3%|Hard|| -|0155|Min Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack)|51.0%|Medium|| -|0156|Binary Tree Upside Down||61.2%|Medium|| -|0157|Read N Characters Given Read4||40.6%|Easy|| -|0158|Read N Characters Given read4 II - Call Multiple Times||41.2%|Hard|| -|0159|Longest Substring with At Most Two Distinct Characters||53.0%|Medium|| -|0160|Intersection of Two Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists)|52.1%|Easy|| -|0161|One Edit Distance||34.0%|Medium|| -|0162|Find Peak Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0162.Find-Peak-Element)|46.1%|Medium|| -|0163|Missing Ranges||31.6%|Easy|| -|0164|Maximum Gap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap)|42.0%|Hard|| -|0165|Compare Version Numbers||34.9%|Medium|| -|0166|Fraction to Recurring Decimal||23.8%|Medium|| -|0167|Two Sum II - Input Array Is Sorted|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II-Input-Array-Is-Sorted)|59.8%|Medium|| -|0168|Excel Sheet Column Title|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0168.Excel-Sheet-Column-Title)|34.3%|Easy|| -|0169|Majority Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element)|63.4%|Easy|| -|0170|Two Sum III - Data structure design||37.0%|Easy|| -|0171|Excel Sheet Column Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0171.Excel-Sheet-Column-Number)|61.0%|Easy|| -|0172|Factorial Trailing Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes)|41.2%|Medium|| -|0173|Binary Search Tree Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator)|68.1%|Medium|| -|0174|Dungeon Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0174.Dungeon-Game)|36.9%|Hard|| -|0175|Combine Two Tables||71.4%|Easy|| -|0176|Second Highest Salary||35.8%|Medium|| -|0177|Nth Highest Salary||36.6%|Medium|| -|0178|Rank Scores||58.5%|Medium|| -|0179|Largest Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number)|33.4%|Medium|| -|0180|Consecutive Numbers||46.1%|Medium|| -|0181|Employees Earning More Than Their Managers||67.3%|Easy|| -|0182|Duplicate Emails||69.7%|Easy|| -|0183|Customers Who Never Order||65.6%|Easy|| -|0184|Department Highest Salary||48.2%|Medium|| -|0185|Department Top Three Salaries||48.5%|Hard|| -|0186|Reverse Words in a String II||51.7%|Medium|| -|0187|Repeated DNA Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences)|45.4%|Medium|| -|0188|Best Time to Buy and Sell Stock IV||34.7%|Hard|| -|0189|Rotate Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0189.Rotate-Array)|38.9%|Medium|| -|0190|Reverse Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits)|50.4%|Easy|| -|0191|Number of 1 Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits)|63.1%|Easy|| +|0155|Min Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack)|51.4%|Medium|| +|0156|Binary Tree Upside Down||61.4%|Medium|| +|0157|Read N Characters Given Read4||40.7%|Easy|| +|0158|Read N Characters Given read4 II - Call Multiple Times||41.3%|Hard|| +|0159|Longest Substring with At Most Two Distinct Characters||53.2%|Medium|| +|0160|Intersection of Two Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists)|52.7%|Easy|| +|0161|One Edit Distance||34.1%|Medium|| +|0162|Find Peak Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0162.Find-Peak-Element)|46.2%|Medium|| +|0163|Missing Ranges||31.8%|Easy|| +|0164|Maximum Gap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap)|42.3%|Hard|| +|0165|Compare Version Numbers||35.2%|Medium|| +|0166|Fraction to Recurring Decimal||23.9%|Medium|| +|0167|Two Sum II - Input Array Is Sorted|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II-Input-Array-Is-Sorted)|59.9%|Medium|| +|0168|Excel Sheet Column Title|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0168.Excel-Sheet-Column-Title)|34.5%|Easy|| +|0169|Majority Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element)|63.7%|Easy|| +|0170|Two Sum III - Data structure design||37.2%|Easy|| +|0171|Excel Sheet Column Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0171.Excel-Sheet-Column-Number)|61.2%|Easy|| +|0172|Factorial Trailing Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes)|41.5%|Medium|| +|0173|Binary Search Tree Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator)|68.6%|Medium|| +|0174|Dungeon Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0174.Dungeon-Game)|37.1%|Hard|| +|0175|Combine Two Tables||72.2%|Easy|| +|0176|Second Highest Salary||36.2%|Medium|| +|0177|Nth Highest Salary||37.1%|Medium|| +|0178|Rank Scores||59.3%|Medium|| +|0179|Largest Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number)|33.7%|Medium|| +|0180|Consecutive Numbers||46.5%|Medium|| +|0181|Employees Earning More Than Their Managers||68.0%|Easy|| +|0182|Duplicate Emails||70.2%|Easy|| +|0183|Customers Who Never Order||66.9%|Easy|| +|0184|Department Highest Salary||49.0%|Medium|| +|0185|Department Top Three Salaries||49.4%|Hard|| +|0186|Reverse Words in a String II||52.1%|Medium|| +|0187|Repeated DNA Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences)|45.8%|Medium|| +|0188|Best Time to Buy and Sell Stock IV||37.3%|Hard|| +|0189|Rotate Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0189.Rotate-Array)|39.0%|Medium|| +|0190|Reverse Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits)|51.4%|Easy|| +|0191|Number of 1 Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits)|64.0%|Easy|| |0192|Word Frequency||25.6%|Medium|| -|0193|Valid Phone Numbers||25.8%|Easy|| +|0193|Valid Phone Numbers||25.9%|Easy|| |0194|Transpose File||25.2%|Medium|| -|0195|Tenth Line||32.8%|Easy|| -|0196|Delete Duplicate Emails||55.5%|Easy|| -|0197|Rising Temperature||43.5%|Easy|| -|0198|House Robber|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0198.House-Robber)|47.9%|Medium|| -|0199|Binary Tree Right Side View|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View)|60.7%|Medium|| -|0200|Number of Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands)|54.8%|Medium|| -|0201|Bitwise AND of Numbers Range|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0201.Bitwise-AND-of-Numbers-Range)|42.0%|Medium|| -|0202|Happy Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number)|53.8%|Easy|| -|0203|Remove Linked List Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0203.Remove-Linked-List-Elements)|44.1%|Easy|| -|0204|Count Primes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0204.Count-Primes)|33.0%|Medium|| -|0205|Isomorphic Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0205.Isomorphic-Strings)|42.3%|Easy|| -|0206|Reverse Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List)|71.3%|Easy|| -|0207|Course Schedule|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule)|45.2%|Medium|| -|0208|Implement Trie (Prefix Tree)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0208.Implement-Trie-Prefix-Tree)|59.5%|Medium|| -|0209|Minimum Size Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum)|44.0%|Medium|| -|0210|Course Schedule II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II)|47.2%|Medium|| -|0211|Design Add and Search Words Data Structure|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Design-Add-and-Search-Words-Data-Structure)|43.7%|Medium|| -|0212|Word Search II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II)|37.4%|Hard|| -|0213|House Robber II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II)|40.3%|Medium|| -|0214|Shortest Palindrome||32.0%|Hard|| -|0215|Kth Largest Element in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array)|65.0%|Medium|| -|0216|Combination Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III)|66.5%|Medium|| -|0217|Contains Duplicate|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate)|61.1%|Easy|| -|0218|The Skyline Problem|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem)|39.1%|Hard|| -|0219|Contains Duplicate II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II)|40.8%|Easy|| -|0220|Contains Duplicate III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III)|21.7%|Medium|| -|0221|Maximal Square||43.9%|Medium|| -|0222|Count Complete Tree Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes)|56.4%|Medium|| -|0223|Rectangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0223.Rectangle-Area)|40.4%|Medium|| -|0224|Basic Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator)|40.8%|Hard|| -|0225|Implement Stack using Queues|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues)|56.3%|Easy|| -|0226|Invert Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree)|72.4%|Easy|| -|0227|Basic Calculator II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0227.Basic-Calculator-II)|41.9%|Medium|| -|0228|Summary Ranges|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0228.Summary-Ranges)|46.5%|Easy|| -|0229|Majority Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II)|43.1%|Medium|| -|0230|Kth Smallest Element in a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST)|68.4%|Medium|| -|0231|Power of Two|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two)|45.2%|Easy|| -|0232|Implement Queue using Stacks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks)|59.7%|Easy|| -|0233|Number of Digit One||33.9%|Hard|| -|0234|Palindrome Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List)|47.6%|Easy|| -|0235|Lowest Common Ancestor of a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree)|58.2%|Easy|| -|0236|Lowest Common Ancestor of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree)|56.3%|Medium|| -|0237|Delete Node in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List)|72.9%|Easy|| -|0238|Product of Array Except Self||64.3%|Medium|| -|0239|Sliding Window Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum)|46.4%|Hard|| -|0240|Search a 2D Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0240.Search-a-2D-Matrix-II)|49.0%|Medium|| -|0241|Different Ways to Add Parentheses||62.4%|Medium|| -|0242|Valid Anagram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)|61.9%|Easy|| -|0243|Shortest Word Distance||64.7%|Easy|| -|0244|Shortest Word Distance II||60.3%|Medium|| +|0195|Tenth Line||32.9%|Easy|| +|0196|Delete Duplicate Emails||57.3%|Easy|| +|0197|Rising Temperature||44.1%|Easy|| +|0198|House Robber|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0198.House-Robber)|48.4%|Medium|| +|0199|Binary Tree Right Side View|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View)|61.0%|Medium|| +|0200|Number of Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands)|55.8%|Medium|| +|0201|Bitwise AND of Numbers Range|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0201.Bitwise-AND-of-Numbers-Range)|42.1%|Medium|| +|0202|Happy Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number)|54.1%|Easy|| +|0203|Remove Linked List Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0203.Remove-Linked-List-Elements)|44.4%|Easy|| +|0204|Count Primes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0204.Count-Primes)|33.1%|Medium|| +|0205|Isomorphic Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0205.Isomorphic-Strings)|42.5%|Easy|| +|0206|Reverse Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List)|71.9%|Easy|| +|0207|Course Schedule|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule)|45.3%|Medium|| +|0208|Implement Trie (Prefix Tree)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0208.Implement-Trie-Prefix-Tree)|60.2%|Medium|| +|0209|Minimum Size Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum)|44.2%|Medium|| +|0210|Course Schedule II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II)|47.6%|Medium|| +|0211|Design Add and Search Words Data Structure|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Design-Add-and-Search-Words-Data-Structure)|43.6%|Medium|| +|0212|Word Search II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II)|37.1%|Hard|| +|0213|House Robber II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II)|40.5%|Medium|| +|0214|Shortest Palindrome||32.1%|Hard|| +|0215|Kth Largest Element in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array)|65.5%|Medium|| +|0216|Combination Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III)|66.9%|Medium|| +|0217|Contains Duplicate|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate)|61.2%|Easy|| +|0218|The Skyline Problem|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem)|39.3%|Hard|| +|0219|Contains Duplicate II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II)|40.9%|Easy|| +|0220|Contains Duplicate III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III)|21.8%|Hard|| +|0221|Maximal Square||44.3%|Medium|| +|0222|Count Complete Tree Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes)|57.0%|Medium|| +|0223|Rectangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0223.Rectangle-Area)|40.7%|Medium|| +|0224|Basic Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator)|41.0%|Hard|| +|0225|Implement Stack using Queues|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues)|57.0%|Easy|| +|0226|Invert Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree)|72.9%|Easy|| +|0227|Basic Calculator II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0227.Basic-Calculator-II)|42.1%|Medium|| +|0228|Summary Ranges|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0228.Summary-Ranges)|46.7%|Easy|| +|0229|Majority Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II)|43.6%|Medium|| +|0230|Kth Smallest Element in a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST)|69.0%|Medium|| +|0231|Power of Two|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two)|45.5%|Easy|| +|0232|Implement Queue using Stacks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks)|60.5%|Easy|| +|0233|Number of Digit One||34.1%|Hard|| +|0234|Palindrome Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List)|49.1%|Easy|| +|0235|Lowest Common Ancestor of a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree)|59.7%|Medium|| +|0236|Lowest Common Ancestor of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree)|57.6%|Medium|| +|0237|Delete Node in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List)|73.6%|Medium|| +|0238|Product of Array Except Self||64.5%|Medium|| +|0239|Sliding Window Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum)|46.6%|Hard|| +|0240|Search a 2D Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0240.Search-a-2D-Matrix-II)|50.3%|Medium|| +|0241|Different Ways to Add Parentheses||62.9%|Medium|| +|0242|Valid Anagram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)|62.6%|Easy|| +|0243|Shortest Word Distance||64.8%|Easy|| +|0244|Shortest Word Distance II||60.5%|Medium|| |0245|Shortest Word Distance III||57.4%|Medium|| |0246|Strobogrammatic Number||47.6%|Easy|| -|0247|Strobogrammatic Number II||51.2%|Medium|| -|0248|Strobogrammatic Number III||41.6%|Hard|| -|0249|Group Shifted Strings||63.9%|Medium|| -|0250|Count Univalue Subtrees||55.0%|Medium|| -|0251|Flatten 2D Vector||48.3%|Medium|| -|0252|Meeting Rooms||56.9%|Easy|| -|0253|Meeting Rooms II||50.0%|Medium|| +|0247|Strobogrammatic Number II||51.4%|Medium|| +|0248|Strobogrammatic Number III||41.7%|Hard|| +|0249|Group Shifted Strings||64.1%|Medium|| +|0250|Count Univalue Subtrees||55.1%|Medium|| +|0251|Flatten 2D Vector||48.8%|Medium|| +|0252|Meeting Rooms||57.0%|Easy|| +|0253|Meeting Rooms II||50.3%|Medium|| |0254|Factor Combinations||48.8%|Medium|| -|0255|Verify Preorder Sequence in Binary Search Tree||47.8%|Medium|| -|0256|Paint House||60.0%|Medium|| -|0257|Binary Tree Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths)|59.5%|Easy|| -|0258|Add Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0258.Add-Digits)|62.9%|Easy|| -|0259|3Sum Smaller||50.5%|Medium|| -|0260|Single Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III)|67.3%|Medium|| -|0261|Graph Valid Tree||46.3%|Medium|| -|0262|Trips and Users||38.2%|Hard|| -|0263|Ugly Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number)|41.8%|Easy|| -|0264|Ugly Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0264.Ugly-Number-II)|45.7%|Medium|| -|0265|Paint House II||51.7%|Hard|| -|0266|Palindrome Permutation||65.6%|Easy|| -|0267|Palindrome Permutation II||40.1%|Medium|| -|0268|Missing Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number)|60.9%|Easy|| -|0269|Alien Dictionary||35.1%|Hard|| -|0270|Closest Binary Search Tree Value||54.2%|Easy|| -|0271|Encode and Decode Strings||39.6%|Medium|| -|0272|Closest Binary Search Tree Value II||57.8%|Hard|| -|0273|Integer to English Words||29.7%|Hard|| -|0274|H-Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index)|37.9%|Medium|| -|0275|H-Index II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0275.H-Index-II)|37.2%|Medium|| -|0276|Paint Fence||43.5%|Medium|| +|0255|Verify Preorder Sequence in Binary Search Tree||47.9%|Medium|| +|0256|Paint House||60.3%|Medium|| +|0257|Binary Tree Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths)|60.1%|Easy|| +|0258|Add Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0258.Add-Digits)|63.2%|Easy|| +|0259|3Sum Smaller||50.6%|Medium|| +|0260|Single Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III)|67.4%|Medium|| +|0261|Graph Valid Tree||46.6%|Medium|| +|0262|Trips and Users||38.4%|Hard|| +|0263|Ugly Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number)|41.7%|Easy|| +|0264|Ugly Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0264.Ugly-Number-II)|46.0%|Medium|| +|0265|Paint House II||52.0%|Hard|| +|0266|Palindrome Permutation||65.7%|Easy|| +|0267|Palindrome Permutation II||40.3%|Medium|| +|0268|Missing Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number)|61.2%|Easy|| +|0269|Alien Dictionary||35.2%|Hard|| +|0270|Closest Binary Search Tree Value||54.4%|Easy|| +|0271|Encode and Decode Strings||40.7%|Medium|| +|0272|Closest Binary Search Tree Value II||58.0%|Hard|| +|0273|Integer to English Words||29.8%|Hard|| +|0274|H-Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index)|38.0%|Medium|| +|0275|H-Index II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0275.H-Index-II)|37.3%|Medium|| +|0276|Paint Fence||43.8%|Medium|| |0277|Find the Celebrity||46.9%|Medium|| -|0278|First Bad Version|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0278.First-Bad-Version)|42.4%|Easy|| -|0279|Perfect Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0279.Perfect-Squares)|52.1%|Medium|| -|0280|Wiggle Sort||66.2%|Medium|| -|0281|Zigzag Iterator||61.9%|Medium|| +|0278|First Bad Version|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0278.First-Bad-Version)|42.7%|Easy|| +|0279|Perfect Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0279.Perfect-Squares)|52.2%|Medium|| +|0280|Wiggle Sort||66.3%|Medium|| +|0281|Zigzag Iterator||62.2%|Medium|| |0282|Expression Add Operators||39.2%|Hard|| -|0283|Move Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes)|61.0%|Easy|| -|0284|Peeking Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0284.Peeking-Iterator)|57.9%|Medium|| -|0285|Inorder Successor in BST||47.7%|Medium|| -|0286|Walls and Gates||59.8%|Medium|| -|0287|Find the Duplicate Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number)|59.0%|Medium|| -|0288|Unique Word Abbreviation||25.0%|Medium|| -|0289|Game of Life||65.9%|Medium|| +|0283|Move Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes)|61.2%|Easy|| +|0284|Peeking Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0284.Peeking-Iterator)|58.0%|Medium|| +|0285|Inorder Successor in BST||48.1%|Medium|| +|0286|Walls and Gates||60.0%|Medium|| +|0287|Find the Duplicate Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number)|59.1%|Medium|| +|0288|Unique Word Abbreviation||25.1%|Medium|| +|0289|Game of Life||66.3%|Medium|| |0290|Word Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0290.Word-Pattern)|40.3%|Easy|| -|0291|Word Pattern II||46.7%|Medium|| -|0292|Nim Game||55.6%|Easy|| +|0291|Word Pattern II||46.8%|Medium|| +|0292|Nim Game||55.8%|Easy|| |0293|Flip Game||62.8%|Easy|| |0294|Flip Game II||51.7%|Medium|| -|0295|Find Median from Data Stream||50.7%|Hard|| +|0295|Find Median from Data Stream||51.0%|Hard|| |0296|Best Meeting Point||59.5%|Hard|| -|0297|Serialize and Deserialize Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0297.Serialize-and-Deserialize-Binary-Tree)|54.3%|Hard|| -|0298|Binary Tree Longest Consecutive Sequence||51.6%|Medium|| -|0299|Bulls and Cows|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0299.Bulls-and-Cows)|47.9%|Medium|| -|0300|Longest Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence)|50.2%|Medium|| +|0297|Serialize and Deserialize Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0297.Serialize-and-Deserialize-Binary-Tree)|54.7%|Hard|| +|0298|Binary Tree Longest Consecutive Sequence||52.3%|Medium|| +|0299|Bulls and Cows|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0299.Bulls-and-Cows)|48.3%|Medium|| +|0300|Longest Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence)|51.3%|Medium|| |0301|Remove Invalid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0301.Remove-Invalid-Parentheses)|47.0%|Hard|| -|0302|Smallest Rectangle Enclosing Black Pixels||57.7%|Hard|| -|0303|Range Sum Query - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0303.Range-Sum-Query-Immutable)|56.8%|Easy|| -|0304|Range Sum Query 2D - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0304.Range-Sum-Query-2D-Immutable)|51.4%|Medium|| +|0302|Smallest Rectangle Enclosing Black Pixels||58.0%|Hard|| +|0303|Range Sum Query - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0303.Range-Sum-Query-Immutable)|57.5%|Easy|| +|0304|Range Sum Query 2D - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0304.Range-Sum-Query-2D-Immutable)|51.8%|Medium|| |0305|Number of Islands II||39.5%|Hard|| -|0306|Additive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number)|30.7%|Medium|| -|0307|Range Sum Query - Mutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query-Mutable)|39.0%|Medium|| -|0308|Range Sum Query 2D - Mutable||41.7%|Hard|| -|0309|Best Time to Buy and Sell Stock with Cooldown|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown)|53.4%|Medium|| -|0310|Minimum Height Trees||38.3%|Medium|| -|0311|Sparse Matrix Multiplication||66.7%|Medium|| -|0312|Burst Balloons||56.7%|Hard|| -|0313|Super Ugly Number||45.9%|Medium|| -|0314|Binary Tree Vertical Order Traversal||51.6%|Medium|| -|0315|Count of Smaller Numbers After Self|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0315.Count-of-Smaller-Numbers-After-Self)|42.1%|Hard|| -|0316|Remove Duplicate Letters||44.2%|Medium|| -|0317|Shortest Distance from All Buildings||43.2%|Hard|| +|0306|Additive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number)|30.8%|Medium|| +|0307|Range Sum Query - Mutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query-Mutable)|40.6%|Medium|| +|0308|Range Sum Query 2D - Mutable||41.9%|Hard|| +|0309|Best Time to Buy and Sell Stock with Cooldown|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown)|54.1%|Medium|| +|0310|Minimum Height Trees||38.4%|Medium|| +|0311|Sparse Matrix Multiplication||66.9%|Medium|| +|0312|Burst Balloons||56.9%|Hard|| +|0313|Super Ugly Number||45.8%|Medium|| +|0314|Binary Tree Vertical Order Traversal||51.9%|Medium|| +|0315|Count of Smaller Numbers After Self|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0315.Count-of-Smaller-Numbers-After-Self)|42.9%|Hard|| +|0316|Remove Duplicate Letters||44.3%|Medium|| +|0317|Shortest Distance from All Buildings||43.1%|Hard|| |0318|Maximum Product of Word Lengths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0318.Maximum-Product-of-Word-Lengths)|60.2%|Medium|| -|0319|Bulb Switcher|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0319.Bulb-Switcher)|47.6%|Medium|| -|0320|Generalized Abbreviation||56.8%|Medium|| -|0321|Create Maximum Number||28.6%|Hard|| -|0322|Coin Change|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change)|41.0%|Medium|| -|0323|Number of Connected Components in an Undirected Graph||61.6%|Medium|| -|0324|Wiggle Sort II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II)|32.5%|Medium|| +|0319|Bulb Switcher|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0319.Bulb-Switcher)|47.8%|Medium|| +|0320|Generalized Abbreviation||57.1%|Medium|| +|0321|Create Maximum Number||28.7%|Hard|| +|0322|Coin Change|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change)|41.3%|Medium|| +|0323|Number of Connected Components in an Undirected Graph||61.8%|Medium|| +|0324|Wiggle Sort II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II)|32.8%|Medium|| |0325|Maximum Size Subarray Sum Equals k||49.3%|Medium|| -|0326|Power of Three|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0326.Power-of-Three)|43.7%|Easy|| -|0327|Count of Range Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum)|36.1%|Hard|| -|0328|Odd Even Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List)|59.8%|Medium|| -|0329|Longest Increasing Path in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0329.Longest-Increasing-Path-in-a-Matrix)|51.6%|Hard|| -|0330|Patching Array||39.8%|Hard|| -|0331|Verify Preorder Serialization of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree)|43.9%|Medium|| -|0332|Reconstruct Itinerary||40.5%|Hard|| -|0333|Largest BST Subtree||41.7%|Medium|| -|0334|Increasing Triplet Subsequence||41.6%|Medium|| +|0326|Power of Three|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0326.Power-of-Three)|45.1%|Easy|| +|0327|Count of Range Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum)|36.0%|Hard|| +|0328|Odd Even Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List)|60.0%|Medium|| +|0329|Longest Increasing Path in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0329.Longest-Increasing-Path-in-a-Matrix)|51.9%|Hard|| +|0330|Patching Array||39.9%|Hard|| +|0331|Verify Preorder Serialization of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree)|44.1%|Medium|| +|0332|Reconstruct Itinerary||40.7%|Hard|| +|0333|Largest BST Subtree||42.1%|Medium|| +|0334|Increasing Triplet Subsequence||41.7%|Medium|| |0335|Self Crossing||29.2%|Hard|| -|0336|Palindrome Pairs||35.4%|Hard|| -|0337|House Robber III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0337.House-Robber-III)|53.7%|Medium|| -|0338|Counting Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits)|74.7%|Easy|| -|0339|Nested List Weight Sum||81.7%|Medium|| -|0340|Longest Substring with At Most K Distinct Characters||47.6%|Medium|| -|0341|Flatten Nested List Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0341.Flatten-Nested-List-Iterator)|61.1%|Medium|| -|0342|Power of Four|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four)|44.5%|Easy|| -|0343|Integer Break|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break)|54.7%|Medium|| -|0344|Reverse String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)|75.5%|Easy|| -|0345|Reverse Vowels of a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String)|47.3%|Easy|| -|0346|Moving Average from Data Stream||76.7%|Easy|| -|0347|Top K Frequent Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements)|65.0%|Medium|| -|0348|Design Tic-Tac-Toe||57.4%|Medium|| -|0349|Intersection of Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)|69.6%|Easy|| -|0350|Intersection of Two Arrays II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II)|55.3%|Easy|| -|0351|Android Unlock Patterns||51.2%|Medium|| -|0352|Data Stream as Disjoint Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0352.Data-Stream-as-Disjoint-Intervals)|51.1%|Hard|| -|0353|Design Snake Game||38.6%|Medium|| -|0354|Russian Doll Envelopes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes)|38.7%|Hard|| -|0355|Design Twitter||35.5%|Medium|| -|0356|Line Reflection||34.5%|Medium|| -|0357|Count Numbers with Unique Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits)|51.0%|Medium|| -|0358|Rearrange String k Distance Apart||37.3%|Hard|| -|0359|Logger Rate Limiter||75.3%|Easy|| -|0360|Sort Transformed Array||54.4%|Medium|| -|0361|Bomb Enemy||50.5%|Medium|| -|0362|Design Hit Counter||67.8%|Medium|| -|0363|Max Sum of Rectangle No Larger Than K||40.2%|Hard|| -|0364|Nested List Weight Sum II||68.6%|Medium|| -|0365|Water and Jug Problem||35.6%|Medium|| -|0366|Find Leaves of Binary Tree||79.4%|Medium|| +|0336|Palindrome Pairs||35.2%|Hard|| +|0337|House Robber III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0337.House-Robber-III)|53.8%|Medium|| +|0338|Counting Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits)|75.0%|Easy|| +|0339|Nested List Weight Sum||81.8%|Medium|| +|0340|Longest Substring with At Most K Distinct Characters||47.7%|Medium|| +|0341|Flatten Nested List Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0341.Flatten-Nested-List-Iterator)|61.3%|Medium|| +|0342|Power of Four|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four)|45.5%|Easy|| +|0343|Integer Break|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break)|55.1%|Medium|| +|0344|Reverse String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)|75.9%|Easy|| +|0345|Reverse Vowels of a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String)|47.5%|Easy|| +|0346|Moving Average from Data Stream||76.9%|Easy|| +|0347|Top K Frequent Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements)|64.9%|Medium|| +|0348|Design Tic-Tac-Toe||57.5%|Medium|| +|0349|Intersection of Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)|70.0%|Easy|| +|0350|Intersection of Two Arrays II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II)|55.4%|Easy|| +|0351|Android Unlock Patterns||51.3%|Medium|| +|0352|Data Stream as Disjoint Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0352.Data-Stream-as-Disjoint-Intervals)|51.3%|Hard|| +|0353|Design Snake Game||38.8%|Medium|| +|0354|Russian Doll Envelopes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes)|38.4%|Hard|| +|0355|Design Twitter||36.2%|Medium|| +|0356|Line Reflection||34.6%|Medium|| +|0357|Count Numbers with Unique Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits)|51.3%|Medium|| +|0358|Rearrange String k Distance Apart||37.4%|Hard|| +|0359|Logger Rate Limiter||75.4%|Easy|| +|0360|Sort Transformed Array||54.5%|Medium|| +|0361|Bomb Enemy||50.7%|Medium|| +|0362|Design Hit Counter||68.2%|Medium|| +|0363|Max Sum of Rectangle No Larger Than K||44.2%|Hard|| +|0364|Nested List Weight Sum II||67.8%|Medium|| +|0365|Water and Jug Problem||36.3%|Medium|| +|0366|Find Leaves of Binary Tree||80.0%|Medium|| |0367|Valid Perfect Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0367.Valid-Perfect-Square)|43.2%|Easy|| -|0368|Largest Divisible Subset|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0368.Largest-Divisible-Subset)|40.9%|Medium|| -|0369|Plus One Linked List||60.7%|Medium|| -|0370|Range Addition||70.2%|Medium|| +|0368|Largest Divisible Subset|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0368.Largest-Divisible-Subset)|41.1%|Medium|| +|0369|Plus One Linked List||60.9%|Medium|| +|0370|Range Addition||70.5%|Medium|| |0371|Sum of Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0371.Sum-of-Two-Integers)|50.6%|Medium|| -|0372|Super Pow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow)|37.5%|Medium|| -|0373|Find K Pairs with Smallest Sums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums)|38.5%|Medium|| -|0374|Guess Number Higher or Lower|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0374.Guess-Number-Higher-or-Lower)|49.9%|Easy|| -|0375|Guess Number Higher or Lower II||45.9%|Medium|| -|0376|Wiggle Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0376.Wiggle-Subsequence)|48.0%|Medium|| -|0377|Combination Sum IV|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0377.Combination-Sum-IV)|49.9%|Medium|| -|0378|Kth Smallest Element in a Sorted Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix)|60.1%|Medium|| -|0379|Design Phone Directory||50.6%|Medium|| -|0380|Insert Delete GetRandom O(1)||51.7%|Medium|| +|0372|Super Pow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow)|37.4%|Medium|| +|0373|Find K Pairs with Smallest Sums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums)|38.4%|Medium|| +|0374|Guess Number Higher or Lower|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0374.Guess-Number-Higher-or-Lower)|50.2%|Easy|| +|0375|Guess Number Higher or Lower II||46.2%|Medium|| +|0376|Wiggle Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0376.Wiggle-Subsequence)|48.1%|Medium|| +|0377|Combination Sum IV|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0377.Combination-Sum-IV)|51.9%|Medium|| +|0378|Kth Smallest Element in a Sorted Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix)|61.5%|Medium|| +|0379|Design Phone Directory||50.8%|Medium|| +|0380|Insert Delete GetRandom O(1)||51.9%|Medium|| |0381|Insert Delete GetRandom O(1) - Duplicates allowed||35.6%|Hard|| -|0382|Linked List Random Node|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0382.Linked-List-Random-Node)|59.2%|Medium|| -|0383|Ransom Note|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0383.Ransom-Note)|56.3%|Easy|| -|0384|Shuffle an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0384.Shuffle-an-Array)|57.3%|Medium|| -|0385|Mini Parser|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser)|36.2%|Medium|| -|0386|Lexicographical Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0386.Lexicographical-Numbers)|59.7%|Medium|| -|0387|First Unique Character in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0387.First-Unique-Character-in-a-String)|57.6%|Easy|| -|0388|Longest Absolute File Path||46.3%|Medium|| +|0382|Linked List Random Node|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0382.Linked-List-Random-Node)|59.4%|Medium|| +|0383|Ransom Note|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0383.Ransom-Note)|57.7%|Easy|| +|0384|Shuffle an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0384.Shuffle-an-Array)|57.5%|Medium|| +|0385|Mini Parser|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser)|36.3%|Medium|| +|0386|Lexicographical Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0386.Lexicographical-Numbers)|60.1%|Medium|| +|0387|First Unique Character in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0387.First-Unique-Character-in-a-String)|58.7%|Easy|| +|0388|Longest Absolute File Path||46.4%|Medium|| |0389|Find the Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0389.Find-the-Difference)|60.5%|Easy|| -|0390|Elimination Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0390.Elimination-Game)|46.4%|Medium|| -|0391|Perfect Rectangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0391.Perfect-Rectangle)|32.3%|Hard|| -|0392|Is Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence)|50.5%|Easy|| -|0393|UTF-8 Validation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation)|39.3%|Medium|| -|0394|Decode String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String)|56.8%|Medium|| +|0390|Elimination Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0390.Elimination-Game)|46.5%|Medium|| +|0391|Perfect Rectangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0391.Perfect-Rectangle)|32.4%|Hard|| +|0392|Is Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence)|49.8%|Easy|| +|0393|UTF-8 Validation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation)|39.4%|Medium|| +|0394|Decode String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String)|57.2%|Medium|| |0395|Longest Substring with At Least K Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0395.Longest-Substring-with-At-Least-K-Repeating-Characters)|44.8%|Medium|| -|0396|Rotate Function||39.8%|Medium|| -|0397|Integer Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement)|34.9%|Medium|| -|0398|Random Pick Index||63.2%|Medium|| -|0399|Evaluate Division|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division)|59.0%|Medium|| -|0400|Nth Digit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0400.Nth-Digit)|33.8%|Medium|| -|0401|Binary Watch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch)|51.0%|Easy|| +|0396|Rotate Function|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0396.Rotate-Function)|40.1%|Medium|| +|0397|Integer Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement)|35.0%|Medium|| +|0398|Random Pick Index||63.1%|Medium|| +|0399|Evaluate Division|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division)|59.3%|Medium|| +|0400|Nth Digit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0400.Nth-Digit)|33.9%|Medium|| +|0401|Binary Watch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch)|51.3%|Easy|| |0402|Remove K Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0402.Remove-K-Digits)|30.5%|Medium|| |0403|Frog Jump||43.1%|Hard|| -|0404|Sum of Left Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves)|55.7%|Easy|| -|0405|Convert a Number to Hexadecimal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal)|45.9%|Easy|| -|0406|Queue Reconstruction by Height||72.5%|Medium|| -|0407|Trapping Rain Water II||47.3%|Hard|| +|0404|Sum of Left Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves)|56.0%|Easy|| +|0405|Convert a Number to Hexadecimal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal)|46.0%|Easy|| +|0406|Queue Reconstruction by Height||72.7%|Medium|| +|0407|Trapping Rain Water II||47.4%|Hard|| |0408|Valid Word Abbreviation||34.8%|Easy|| -|0409|Longest Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0409.Longest-Palindrome)|54.2%|Easy|| -|0410|Split Array Largest Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0410.Split-Array-Largest-Sum)|52.7%|Hard|| +|0409|Longest Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0409.Longest-Palindrome)|54.5%|Easy|| +|0410|Split Array Largest Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0410.Split-Array-Largest-Sum)|53.0%|Hard|| |0411|Minimum Unique Word Abbreviation||39.2%|Hard|| -|0412|Fizz Buzz|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0412.Fizz-Buzz)|67.5%|Easy|| -|0413|Arithmetic Slices|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0413.Arithmetic-Slices)|64.8%|Medium|| -|0414|Third Maximum Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0414.Third-Maximum-Number)|32.1%|Easy|| -|0415|Add Strings||52.4%|Easy|| +|0412|Fizz Buzz|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0412.Fizz-Buzz)|68.2%|Easy|| +|0413|Arithmetic Slices|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0413.Arithmetic-Slices)|65.0%|Medium|| +|0414|Third Maximum Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0414.Third-Maximum-Number)|32.3%|Easy|| +|0415|Add Strings||52.5%|Easy|| |0416|Partition Equal Subset Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0416.Partition-Equal-Subset-Sum)|46.7%|Medium|| -|0417|Pacific Atlantic Water Flow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0417.Pacific-Atlantic-Water-Flow)|50.7%|Medium|| -|0418|Sentence Screen Fitting||35.5%|Medium|| -|0419|Battleships in a Board||74.2%|Medium|| +|0417|Pacific Atlantic Water Flow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0417.Pacific-Atlantic-Water-Flow)|53.6%|Medium|| +|0418|Sentence Screen Fitting||35.6%|Medium|| +|0419|Battleships in a Board|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0419.Battleships-in-a-Board)|74.4%|Medium|| |0420|Strong Password Checker||14.2%|Hard|| -|0421|Maximum XOR of Two Numbers in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array)|54.5%|Medium|| -|0422|Valid Word Square||38.7%|Easy|| +|0421|Maximum XOR of Two Numbers in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array)|54.6%|Medium|| +|0422|Valid Word Square||38.8%|Easy|| |0423|Reconstruct Original Digits from English|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0423.Reconstruct-Original-Digits-from-English)|51.3%|Medium|| -|0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|51.2%|Medium|| -|0425|Word Squares||52.5%|Hard|| -|0426|Convert Binary Search Tree to Sorted Doubly Linked List||64.5%|Medium|| -|0427|Construct Quad Tree||65.9%|Medium|| -|0428|Serialize and Deserialize N-ary Tree||64.8%|Hard|| -|0429|N-ary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0429.N-ary-Tree-Level-Order-Traversal)|69.2%|Medium|| -|0430|Flatten a Multilevel Doubly Linked List||59.1%|Medium|| -|0431|Encode N-ary Tree to Binary Tree||78.2%|Hard|| -|0432|All O`one Data Structure||36.5%|Hard|| -|0433|Minimum Genetic Mutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation)|47.5%|Medium|| +|0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|51.3%|Medium|| +|0425|Word Squares||52.6%|Hard|| +|0426|Convert Binary Search Tree to Sorted Doubly Linked List||64.6%|Medium|| +|0427|Construct Quad Tree||66.2%|Medium|| +|0428|Serialize and Deserialize N-ary Tree||65.1%|Hard|| +|0429|N-ary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0429.N-ary-Tree-Level-Order-Traversal)|70.5%|Medium|| +|0430|Flatten a Multilevel Doubly Linked List||59.3%|Medium|| +|0431|Encode N-ary Tree to Binary Tree||78.5%|Hard|| +|0432|All O`one Data Structure||36.6%|Hard|| +|0433|Minimum Genetic Mutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation)|47.8%|Medium|| |0434|Number of Segments in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0434.Number-of-Segments-in-a-String)|37.8%|Easy|| -|0435|Non-overlapping Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0435.Non-overlapping-Intervals)|49.0%|Medium|| -|0436|Find Right Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval)|50.0%|Medium|| -|0437|Path Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0437.Path-Sum-III)|49.8%|Medium|| -|0438|Find All Anagrams in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String)|48.7%|Medium|| -|0439|Ternary Expression Parser||58.0%|Medium|| -|0440|K-th Smallest in Lexicographical Order||30.6%|Hard|| -|0441|Arranging Coins|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins)|45.7%|Easy|| -|0442|Find All Duplicates in an Array||72.9%|Medium|| -|0443|String Compression||48.0%|Medium|| -|0444|Sequence Reconstruction||25.8%|Medium|| -|0445|Add Two Numbers II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II)|59.0%|Medium|| -|0446|Arithmetic Slices II - Subsequence||39.6%|Hard|| -|0447|Number of Boomerangs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs)|54.5%|Medium|| -|0448|Find All Numbers Disappeared in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array)|59.3%|Easy|| -|0449|Serialize and Deserialize BST||56.5%|Medium|| -|0450|Delete Node in a BST||49.5%|Medium|| -|0451|Sort Characters By Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency)|68.2%|Medium|| +|0435|Non-overlapping Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0435.Non-overlapping-Intervals)|49.5%|Medium|| +|0436|Find Right Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval)|50.2%|Medium|| +|0437|Path Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0437.Path-Sum-III)|49.2%|Medium|| +|0438|Find All Anagrams in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String)|48.8%|Medium|| +|0439|Ternary Expression Parser||58.1%|Medium|| +|0440|K-th Smallest in Lexicographical Order||30.7%|Hard|| +|0441|Arranging Coins|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins)|45.9%|Easy|| +|0442|Find All Duplicates in an Array||73.2%|Medium|| +|0443|String Compression||48.3%|Medium|| +|0444|Sequence Reconstruction||26.1%|Medium|| +|0445|Add Two Numbers II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II)|59.2%|Medium|| +|0446|Arithmetic Slices II - Subsequence||39.7%|Hard|| +|0447|Number of Boomerangs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs)|54.6%|Medium|| +|0448|Find All Numbers Disappeared in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array)|59.5%|Easy|| +|0449|Serialize and Deserialize BST||56.6%|Medium|| +|0450|Delete Node in a BST||49.8%|Medium|| +|0451|Sort Characters By Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency)|68.4%|Medium|| |0452|Minimum Number of Arrows to Burst Balloons||53.1%|Medium|| -|0453|Minimum Moves to Equal Array Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0453.Minimum-Moves-to-Equal-Array-Elements)|55.0%|Medium|| -|0454|4Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II)|57.2%|Medium|| -|0455|Assign Cookies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0455.Assign-Cookies)|50.7%|Easy|| +|0453|Minimum Moves to Equal Array Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0453.Minimum-Moves-to-Equal-Array-Elements)|55.3%|Medium|| +|0454|4Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II)|57.3%|Medium|| +|0455|Assign Cookies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0455.Assign-Cookies)|50.6%|Easy|| |0456|132 Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0456.132-Pattern)|32.4%|Medium|| -|0457|Circular Array Loop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0457.Circular-Array-Loop)|31.9%|Medium|| -|0458|Poor Pigs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0458.Poor-Pigs)|55.8%|Hard|| +|0457|Circular Array Loop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0457.Circular-Array-Loop)|32.0%|Medium|| +|0458|Poor Pigs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0458.Poor-Pigs)|65.8%|Hard|| |0459|Repeated Substring Pattern||43.7%|Easy|| -|0460|LFU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0460.LFU-Cache)|39.9%|Hard|| +|0460|LFU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0460.LFU-Cache)|40.2%|Hard|| |0461|Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance)|74.7%|Easy|| -|0462|Minimum Moves to Equal Array Elements II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II)|60.0%|Medium|| -|0463|Island Perimeter|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0463.Island-Perimeter)|69.2%|Easy|| +|0462|Minimum Moves to Equal Array Elements II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0462.Minimum-Moves-to-Equal-Array-Elements-II)|60.1%|Medium|| +|0463|Island Perimeter|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0463.Island-Perimeter)|69.3%|Easy|| |0464|Can I Win||29.8%|Medium|| -|0465|Optimal Account Balancing||49.1%|Hard|| +|0465|Optimal Account Balancing||49.2%|Hard|| |0466|Count The Repetitions||29.2%|Hard|| -|0467|Unique Substrings in Wraparound String||37.9%|Medium|| -|0468|Validate IP Address||26.3%|Medium|| -|0469|Convex Polygon||38.3%|Medium|| +|0467|Unique Substrings in Wraparound String||38.1%|Medium|| +|0468|Validate IP Address||26.5%|Medium|| +|0469|Convex Polygon||38.4%|Medium|| |0470|Implement Rand10() Using Rand7()|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0470.Implement-Rand10-Using-Rand7)|46.7%|Medium|| -|0471|Encode String with Shortest Length||50.8%|Hard|| -|0472|Concatenated Words||44.0%|Hard|| -|0473|Matchsticks to Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0473.Matchsticks-to-Square)|40.7%|Medium|| -|0474|Ones and Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes)|46.6%|Medium|| -|0475|Heaters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0475.Heaters)|35.7%|Medium|| -|0476|Number Complement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0476.Number-Complement)|66.9%|Easy|| +|0471|Encode String with Shortest Length||50.7%|Hard|| +|0472|Concatenated Words||44.9%|Hard|| +|0473|Matchsticks to Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0473.Matchsticks-to-Square)|40.6%|Medium|| +|0474|Ones and Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes)|46.7%|Medium|| +|0475|Heaters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0475.Heaters)|35.9%|Medium|| +|0476|Number Complement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0476.Number-Complement)|67.0%|Easy|| |0477|Total Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0477.Total-Hamming-Distance)|52.1%|Medium|| -|0478|Generate Random Point in a Circle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0478.Generate-Random-Point-in-a-Circle)|39.5%|Medium|| -|0479|Largest Palindrome Product||31.3%|Hard|| -|0480|Sliding Window Median|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median)|41.2%|Hard|| -|0481|Magical String||49.9%|Medium|| -|0482|License Key Formatting||43.0%|Easy|| -|0483|Smallest Good Base|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0483.Smallest-Good-Base)|38.1%|Hard|| -|0484|Find Permutation||65.6%|Medium|| -|0485|Max Consecutive Ones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0485.Max-Consecutive-Ones)|55.5%|Easy|| -|0486|Predict the Winner||50.6%|Medium|| -|0487|Max Consecutive Ones II||49.1%|Medium|| -|0488|Zuma Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0488.Zuma-Game)|35.4%|Hard|| -|0489|Robot Room Cleaner||76.3%|Hard|| -|0490|The Maze||55.1%|Medium|| -|0491|Increasing Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences)|51.4%|Medium|| -|0492|Construct the Rectangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0492.Construct-the-Rectangle)|53.1%|Easy|| -|0493|Reverse Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs)|30.5%|Hard|| -|0494|Target Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0494.Target-Sum)|45.4%|Medium|| -|0495|Teemo Attacking|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0495.Teemo-Attacking)|56.9%|Easy|| -|0496|Next Greater Element I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I)|70.8%|Easy|| +|0478|Generate Random Point in a Circle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0478.Generate-Random-Point-in-a-Circle)|39.6%|Medium|| +|0479|Largest Palindrome Product||31.6%|Hard|| +|0480|Sliding Window Median|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median)|41.3%|Hard|| +|0481|Magical String||50.2%|Medium|| +|0482|License Key Formatting||43.1%|Easy|| +|0483|Smallest Good Base|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0483.Smallest-Good-Base)|38.3%|Hard|| +|0484|Find Permutation||67.1%|Medium|| +|0485|Max Consecutive Ones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0485.Max-Consecutive-Ones)|55.8%|Easy|| +|0486|Predict the Winner||50.7%|Medium|| +|0487|Max Consecutive Ones II||49.2%|Medium|| +|0488|Zuma Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0488.Zuma-Game)|35.2%|Hard|| +|0489|Robot Room Cleaner||76.4%|Hard|| +|0490|The Maze||55.3%|Medium|| +|0491|Increasing Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences)|51.8%|Medium|| +|0492|Construct the Rectangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0492.Construct-the-Rectangle)|53.4%|Easy|| +|0493|Reverse Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs)|30.7%|Hard|| +|0494|Target Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0494.Target-Sum)|45.5%|Medium|| +|0495|Teemo Attacking|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0495.Teemo-Attacking)|57.0%|Easy|| +|0496|Next Greater Element I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I)|71.1%|Easy|| |0497|Random Point in Non-overlapping Rectangles|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles)|39.2%|Medium|| -|0498|Diagonal Traverse|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0498.Diagonal-Traverse)|57.4%|Medium|| -|0499|The Maze III||46.3%|Hard|| -|0500|Keyboard Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0500.Keyboard-Row)|68.5%|Easy|| -|0501|Find Mode in Binary Search Tree||47.9%|Easy|| -|0502|IPO||44.5%|Hard|| -|0503|Next Greater Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II)|62.6%|Medium|| -|0504|Base 7|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0504.Base-7)|47.7%|Easy|| -|0505|The Maze II||51.7%|Medium|| -|0506|Relative Ranks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0506.Relative-Ranks)|57.7%|Easy|| -|0507|Perfect Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0507.Perfect-Number)|37.6%|Easy|| -|0508|Most Frequent Subtree Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum)|63.5%|Medium|| +|0498|Diagonal Traverse|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0498.Diagonal-Traverse)|57.7%|Medium|| +|0499|The Maze III||46.7%|Hard|| +|0500|Keyboard Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0500.Keyboard-Row)|68.8%|Easy|| +|0501|Find Mode in Binary Search Tree||48.3%|Easy|| +|0502|IPO||44.7%|Hard|| +|0503|Next Greater Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II)|62.9%|Medium|| +|0504|Base 7|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0504.Base-7)|47.8%|Easy|| +|0505|The Maze II||52.3%|Medium|| +|0506|Relative Ranks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0506.Relative-Ranks)|58.4%|Easy|| +|0507|Perfect Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0507.Perfect-Number)|37.7%|Easy|| +|0508|Most Frequent Subtree Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum)|64.0%|Medium|| |0509|Fibonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0509.Fibonacci-Number)|69.1%|Easy|| -|0510|Inorder Successor in BST II||61.3%|Medium|| -|0511|Game Play Analysis I||79.8%|Easy|| -|0512|Game Play Analysis II||54.4%|Easy|| -|0513|Find Bottom Left Tree Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0513.Find-Bottom-Left-Tree-Value)|65.8%|Medium|| -|0514|Freedom Trail||46.5%|Hard|| +|0510|Inorder Successor in BST II||61.2%|Medium|| +|0511|Game Play Analysis I||79.3%|Easy|| +|0512|Game Play Analysis II||54.3%|Easy|| +|0513|Find Bottom Left Tree Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0513.Find-Bottom-Left-Tree-Value)|66.2%|Medium|| +|0514|Freedom Trail||46.7%|Hard|| |0515|Find Largest Value in Each Tree Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row)|64.6%|Medium|| -|0516|Longest Palindromic Subsequence||60.1%|Medium|| +|0516|Longest Palindromic Subsequence||60.4%|Medium|| |0517|Super Washing Machines||39.7%|Hard|| -|0518|Coin Change 2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0518.Coin-Change-2)|58.6%|Medium|| -|0519|Random Flip Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0519.Random-Flip-Matrix)|39.5%|Medium|| +|0518|Coin Change II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0518.Coin-Change-II)|59.4%|Medium|| +|0519|Random Flip Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0519.Random-Flip-Matrix)|39.7%|Medium|| |0520|Detect Capital|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0520.Detect-Capital)|55.7%|Easy|| -|0521|Longest Uncommon Subsequence I||60.2%|Easy|| -|0522|Longest Uncommon Subsequence II||40.2%|Medium|| -|0523|Continuous Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0523.Continuous-Subarray-Sum)|27.5%|Medium|| -|0524|Longest Word in Dictionary through Deleting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting)|51.0%|Medium|| -|0525|Contiguous Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0525.Contiguous-Array)|46.6%|Medium|| -|0526|Beautiful Arrangement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement)|64.5%|Medium|| +|0521|Longest Uncommon Subsequence I||60.3%|Easy|| +|0522|Longest Uncommon Subsequence II||40.3%|Medium|| +|0523|Continuous Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0523.Continuous-Subarray-Sum)|27.6%|Medium|| +|0524|Longest Word in Dictionary through Deleting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting)|51.1%|Medium|| +|0525|Contiguous Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0525.Contiguous-Array)|46.7%|Medium|| +|0526|Beautiful Arrangement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement)|64.6%|Medium|| |0527|Word Abbreviation||60.0%|Hard|| |0528|Random Pick with Weight|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0528.Random-Pick-with-Weight)|46.2%|Medium|| -|0529|Minesweeper|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0529.Minesweeper)|65.1%|Medium|| -|0530|Minimum Absolute Difference in BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0530.Minimum-Absolute-Difference-in-BST)|56.5%|Easy|| -|0531|Lonely Pixel I||60.7%|Medium|| -|0532|K-diff Pairs in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array)|40.4%|Medium|| +|0529|Minesweeper|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0529.Minesweeper)|65.3%|Medium|| +|0530|Minimum Absolute Difference in BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0530.Minimum-Absolute-Difference-in-BST)|56.6%|Easy|| +|0531|Lonely Pixel I||60.8%|Medium|| +|0532|K-diff Pairs in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array)|40.6%|Medium|| |0533|Lonely Pixel II||48.3%|Medium|| -|0534|Game Play Analysis III||82.4%|Medium|| -|0535|Encode and Decode TinyURL|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0535.Encode-and-Decode-TinyURL)|85.6%|Medium|| -|0536|Construct Binary Tree from String||55.9%|Medium|| -|0537|Complex Number Multiplication|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0537.Complex-Number-Multiplication)|71.2%|Medium|| -|0538|Convert BST to Greater Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0538.Convert-BST-to-Greater-Tree)|66.8%|Medium|| -|0539|Minimum Time Difference||55.9%|Medium|| +|0534|Game Play Analysis III||82.6%|Medium|| +|0535|Encode and Decode TinyURL|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0535.Encode-and-Decode-TinyURL)|85.7%|Medium|| +|0536|Construct Binary Tree from String||56.1%|Medium|| +|0537|Complex Number Multiplication|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0537.Complex-Number-Multiplication)|71.3%|Medium|| +|0538|Convert BST to Greater Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0538.Convert-BST-to-Greater-Tree)|67.1%|Medium|| +|0539|Minimum Time Difference||56.2%|Medium|| |0540|Single Element in a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0540.Single-Element-in-a-Sorted-Array)|58.6%|Medium|| -|0541|Reverse String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II)|50.2%|Easy|| +|0541|Reverse String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II)|50.3%|Easy|| |0542|01 Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix)|44.0%|Medium|| -|0543|Diameter of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0543.Diameter-of-Binary-Tree)|55.1%|Easy|| -|0544|Output Contest Matches||76.6%|Medium|| -|0545|Boundary of Binary Tree||43.8%|Medium|| +|0543|Diameter of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0543.Diameter-of-Binary-Tree)|55.7%|Easy|| +|0544|Output Contest Matches||76.7%|Medium|| +|0545|Boundary of Binary Tree||44.1%|Medium|| |0546|Remove Boxes||47.5%|Hard|| -|0547|Number of Provinces|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Number-of-Provinces)|62.8%|Medium|| +|0547|Number of Provinces|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Number-of-Provinces)|63.1%|Medium|| |0548|Split Array with Equal Sum||50.0%|Hard|| -|0549|Binary Tree Longest Consecutive Sequence II||48.8%|Medium|| -|0550|Game Play Analysis IV||44.0%|Medium|| -|0551|Student Attendance Record I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0551.Student-Attendance-Record-I)|47.9%|Easy|| -|0552|Student Attendance Record II||40.8%|Hard|| -|0553|Optimal Division||59.4%|Medium|| -|0554|Brick Wall|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0554.Brick-Wall)|52.8%|Medium|| +|0549|Binary Tree Longest Consecutive Sequence II||49.4%|Medium|| +|0550|Game Play Analysis IV||44.1%|Medium|| +|0551|Student Attendance Record I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0551.Student-Attendance-Record-I)|48.0%|Easy|| +|0552|Student Attendance Record II||41.1%|Hard|| +|0553|Optimal Division||59.6%|Medium|| +|0554|Brick Wall|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0554.Brick-Wall)|53.0%|Medium|| |0555|Split Concatenated Strings||43.4%|Medium|| |0556|Next Greater Element III||34.0%|Medium|| -|0557|Reverse Words in a String III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III)|79.6%|Easy|| -|0558|Logical OR of Two Binary Grids Represented as Quad-Trees||47.7%|Medium|| -|0559|Maximum Depth of N-ary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0559.Maximum-Depth-of-N-ary-Tree)|71.3%|Easy|| -|0560|Subarray Sum Equals K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0560.Subarray-Sum-Equals-K)|44.2%|Medium|| -|0561|Array Partition|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0561.Array-Partition)|76.1%|Easy|| -|0562|Longest Line of Consecutive One in Matrix||49.5%|Medium|| -|0563|Binary Tree Tilt|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt)|58.9%|Easy|| -|0564|Find the Closest Palindrome||21.6%|Hard|| -|0565|Array Nesting||56.4%|Medium|| +|0557|Reverse Words in a String III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III)|80.0%|Easy|| +|0558|Logical OR of Two Binary Grids Represented as Quad-Trees||47.9%|Medium|| +|0559|Maximum Depth of N-ary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0559.Maximum-Depth-of-N-ary-Tree)|71.5%|Easy|| +|0560|Subarray Sum Equals K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0560.Subarray-Sum-Equals-K)|44.1%|Medium|| +|0561|Array Partition|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0561.Array-Partition)|76.4%|Easy|| +|0562|Longest Line of Consecutive One in Matrix||49.9%|Medium|| +|0563|Binary Tree Tilt|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt)|59.2%|Easy|| +|0564|Find the Closest Palindrome||21.8%|Hard|| +|0565|Array Nesting||56.5%|Medium|| |0566|Reshape the Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0566.Reshape-the-Matrix)|62.6%|Easy|| -|0567|Permutation in String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String)|44.2%|Medium|| -|0568|Maximum Vacation Days||44.6%|Hard|| -|0569|Median Employee Salary||67.6%|Hard|| +|0567|Permutation in String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String)|44.0%|Medium|| +|0568|Maximum Vacation Days||44.7%|Hard|| +|0569|Median Employee Salary||67.9%|Hard|| |0570|Managers with at Least 5 Direct Reports||67.2%|Medium|| -|0571|Find Median Given Frequency of Numbers||44.5%|Hard|| -|0572|Subtree of Another Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0572.Subtree-of-Another-Tree)|45.6%|Easy|| -|0573|Squirrel Simulation||54.8%|Medium|| -|0574|Winning Candidate||59.1%|Medium|| -|0575|Distribute Candies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0575.Distribute-Candies)|65.8%|Easy|| +|0571|Find Median Given Frequency of Numbers||44.7%|Hard|| +|0572|Subtree of Another Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0572.Subtree-of-Another-Tree)|45.8%|Easy|| +|0573|Squirrel Simulation||54.9%|Medium|| +|0574|Winning Candidate||59.4%|Medium|| +|0575|Distribute Candies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0575.Distribute-Candies)|66.0%|Easy|| |0576|Out of Boundary Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0576.Out-of-Boundary-Paths)|44.3%|Medium|| -|0577|Employee Bonus||75.0%|Easy|| -|0578|Get Highest Answer Rate Question||42.2%|Medium|| -|0579|Find Cumulative Salary of an Employee||44.1%|Hard|| -|0580|Count Student Number in Departments||57.6%|Medium|| -|0581|Shortest Unsorted Continuous Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0581.Shortest-Unsorted-Continuous-Subarray)|36.1%|Medium|| -|0582|Kill Process||67.6%|Medium|| -|0583|Delete Operation for Two Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0583.Delete-Operation-for-Two-Strings)|58.6%|Medium|| -|0584|Find Customer Referee||77.1%|Easy|| -|0585|Investments in 2016||54.1%|Medium|| -|0586|Customer Placing the Largest Number of Orders||73.5%|Easy|| -|0587|Erect the Fence||43.3%|Hard|| -|0588|Design In-Memory File System||48.5%|Hard|| +|0577|Employee Bonus||75.2%|Easy|| +|0578|Get Highest Answer Rate Question||41.9%|Medium|| +|0579|Find Cumulative Salary of an Employee||44.7%|Hard|| +|0580|Count Student Number in Departments||58.0%|Medium|| +|0581|Shortest Unsorted Continuous Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0581.Shortest-Unsorted-Continuous-Subarray)|36.2%|Medium|| +|0582|Kill Process||67.8%|Medium|| +|0583|Delete Operation for Two Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0583.Delete-Operation-for-Two-Strings)|59.0%|Medium|| +|0584|Find Customer Referee||77.5%|Easy|| +|0585|Investments in 2016||53.7%|Medium|| +|0586|Customer Placing the Largest Number of Orders||72.9%|Easy|| +|0587|Erect the Fence||43.1%|Hard|| +|0588|Design In-Memory File System||48.7%|Hard|| |0589|N-ary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0589.N-ary-Tree-Preorder-Traversal)|76.4%|Easy|| -|0590|N-ary Tree Postorder Traversal||76.6%|Easy|| -|0591|Tag Validator||36.9%|Hard|| -|0592|Fraction Addition and Subtraction||51.9%|Medium|| -|0593|Valid Square||44.0%|Medium|| -|0594|Longest Harmonious Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0594.Longest-Harmonious-Subsequence)|52.9%|Easy|| -|0595|Big Countries||74.9%|Easy|| -|0596|Classes More Than 5 Students||44.6%|Easy|| -|0597|Friend Requests I: Overall Acceptance Rate||42.7%|Easy|| +|0590|N-ary Tree Postorder Traversal||77.0%|Easy|| +|0591|Tag Validator||37.0%|Hard|| +|0592|Fraction Addition and Subtraction||52.0%|Medium|| +|0593|Valid Square||44.1%|Medium|| +|0594|Longest Harmonious Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0594.Longest-Harmonious-Subsequence)|53.0%|Easy|| +|0595|Big Countries||74.3%|Easy|| +|0596|Classes More Than 5 Students||45.8%|Easy|| +|0597|Friend Requests I: Overall Acceptance Rate||42.9%|Easy|| |0598|Range Addition II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0598.Range-Addition-II)|54.9%|Easy|| |0599|Minimum Index Sum of Two Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists)|52.6%|Easy|| |0600|Non-negative Integers without Consecutive Ones||38.9%|Hard|| -|0601|Human Traffic of Stadium||50.0%|Hard|| -|0602|Friend Requests II: Who Has the Most Friends||61.1%|Medium|| -|0603|Consecutive Available Seats||68.0%|Easy|| +|0601|Human Traffic of Stadium||50.4%|Hard|| +|0602|Friend Requests II: Who Has the Most Friends||61.2%|Medium|| +|0603|Consecutive Available Seats||68.2%|Easy|| |0604|Design Compressed String Iterator||39.3%|Easy|| -|0605|Can Place Flowers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0605.Can-Place-Flowers)|33.1%|Easy|| -|0606|Construct String from Binary Tree||58.1%|Easy|| -|0607|Sales Person||71.1%|Easy|| -|0608|Tree Node||74.2%|Medium|| -|0609|Find Duplicate File in System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0609.Find-Duplicate-File-in-System)|63.9%|Medium|| -|0610|Triangle Judgement||70.9%|Easy|| -|0611|Valid Triangle Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0611.Valid-Triangle-Number)|50.0%|Medium|| -|0612|Shortest Distance in a Plane||63.2%|Medium|| -|0613|Shortest Distance in a Line||81.3%|Easy|| -|0614|Second Degree Follower||36.2%|Medium|| -|0615|Average Salary: Departments VS Company||56.9%|Hard|| -|0616|Add Bold Tag in String||48.4%|Medium|| -|0617|Merge Two Binary Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0617.Merge-Two-Binary-Trees)|78.2%|Easy|| -|0618|Students Report By Geography||63.8%|Hard|| -|0619|Biggest Single Number||48.1%|Easy|| -|0620|Not Boring Movies||72.9%|Easy|| -|0621|Task Scheduler||55.0%|Medium|| -|0622|Design Circular Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0622.Design-Circular-Queue)|48.9%|Medium|| -|0623|Add One Row to Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0623.Add-One-Row-to-Tree)|54.1%|Medium|| -|0624|Maximum Distance in Arrays||41.6%|Medium|| -|0625|Minimum Factorization||33.3%|Medium|| -|0626|Exchange Seats||70.0%|Medium|| -|0627|Swap Salary||81.4%|Easy|| -|0628|Maximum Product of Three Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)|46.6%|Easy|| -|0629|K Inverse Pairs Array||43.2%|Hard|| +|0605|Can Place Flowers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0605.Can-Place-Flowers)|33.0%|Easy|| +|0606|Construct String from Binary Tree||63.4%|Easy|| +|0607|Sales Person||71.9%|Easy|| +|0608|Tree Node||75.1%|Medium|| +|0609|Find Duplicate File in System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0609.Find-Duplicate-File-in-System)|64.0%|Medium|| +|0610|Triangle Judgement||71.0%|Easy|| +|0611|Valid Triangle Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0611.Valid-Triangle-Number)|50.2%|Medium|| +|0612|Shortest Distance in a Plane||63.4%|Medium|| +|0613|Shortest Distance in a Line||81.4%|Easy|| +|0614|Second Degree Follower||36.7%|Medium|| +|0615|Average Salary: Departments VS Company||57.2%|Hard|| +|0616|Add Bold Tag in String||48.6%|Medium|| +|0617|Merge Two Binary Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0617.Merge-Two-Binary-Trees)|78.4%|Easy|| +|0618|Students Report By Geography||64.0%|Hard|| +|0619|Biggest Single Number||48.5%|Easy|| +|0620|Not Boring Movies||73.2%|Easy|| +|0621|Task Scheduler||55.4%|Medium|| +|0622|Design Circular Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0622.Design-Circular-Queue)|49.0%|Medium|| +|0623|Add One Row to Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0623.Add-One-Row-to-Tree)|54.3%|Medium|| +|0624|Maximum Distance in Arrays||41.7%|Medium|| +|0625|Minimum Factorization||33.4%|Medium|| +|0626|Exchange Seats||70.3%|Medium|| +|0627|Swap Salary||82.4%|Easy|| +|0628|Maximum Product of Three Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)|46.5%|Easy|| +|0629|K Inverse Pairs Array||43.1%|Hard|| |0630|Course Schedule III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0630.Course-Schedule-III)|40.2%|Hard|| -|0631|Design Excel Sum Formula||42.9%|Hard|| -|0632|Smallest Range Covering Elements from K Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists)|59.5%|Hard|| +|0631|Design Excel Sum Formula||43.1%|Hard|| +|0632|Smallest Range Covering Elements from K Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists)|60.0%|Hard|| |0633|Sum of Square Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0633.Sum-of-Square-Numbers)|34.7%|Medium|| -|0634|Find the Derangement of An Array||41.5%|Medium|| -|0635|Design Log Storage System||62.6%|Medium|| -|0636|Exclusive Time of Functions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions)|60.7%|Medium|| -|0637|Average of Levels in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree)|69.1%|Easy|| -|0638|Shopping Offers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers)|54.9%|Medium|| +|0634|Find the Derangement of An Array||41.7%|Medium|| +|0635|Design Log Storage System||62.7%|Medium|| +|0636|Exclusive Time of Functions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions)|60.9%|Medium|| +|0637|Average of Levels in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree)|71.5%|Easy|| +|0638|Shopping Offers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers)|54.6%|Medium|| |0639|Decode Ways II||30.4%|Hard|| |0640|Solve the Equation||43.3%|Medium|| -|0641|Design Circular Deque||57.5%|Medium|| -|0642|Design Search Autocomplete System||48.5%|Hard|| -|0643|Maximum Average Subarray I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0643.Maximum-Average-Subarray-I)|43.7%|Easy|| -|0644|Maximum Average Subarray II||35.5%|Hard|| -|0645|Set Mismatch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0645.Set-Mismatch)|41.3%|Easy|| -|0646|Maximum Length of Pair Chain||56.1%|Medium|| -|0647|Palindromic Substrings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0647.Palindromic-Substrings)|65.9%|Medium|| +|0641|Design Circular Deque||57.6%|Medium|| +|0642|Design Search Autocomplete System||48.6%|Hard|| +|0643|Maximum Average Subarray I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0643.Maximum-Average-Subarray-I)|43.9%|Easy|| +|0644|Maximum Average Subarray II||35.6%|Hard|| +|0645|Set Mismatch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0645.Set-Mismatch)|41.4%|Easy|| +|0646|Maximum Length of Pair Chain||56.3%|Medium|| +|0647|Palindromic Substrings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0647.Palindromic-Substrings)|66.1%|Medium|| |0648|Replace Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words)|62.5%|Medium|| -|0649|Dota2 Senate||40.2%|Medium|| -|0650|2 Keys Keyboard||52.8%|Medium|| -|0651|4 Keys Keyboard||54.2%|Medium|| -|0652|Find Duplicate Subtrees||56.2%|Medium|| -|0653|Two Sum IV - Input is a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0653.Two-Sum-IV-Input-is-a-BST)|59.1%|Easy|| -|0654|Maximum Binary Tree||84.0%|Medium|| -|0655|Print Binary Tree||60.7%|Medium|| -|0656|Coin Path||31.4%|Hard|| +|0649|Dota2 Senate||40.3%|Medium|| +|0650|2 Keys Keyboard||53.0%|Medium|| +|0651|4 Keys Keyboard||54.3%|Medium|| +|0652|Find Duplicate Subtrees||56.4%|Medium|| +|0653|Two Sum IV - Input is a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0653.Two-Sum-IV-Input-is-a-BST)|59.4%|Easy|| +|0654|Maximum Binary Tree||84.3%|Medium|| +|0655|Print Binary Tree||61.1%|Medium|| +|0656|Coin Path||31.5%|Hard|| |0657|Robot Return to Origin||75.2%|Easy|| -|0658|Find K Closest Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements)|44.8%|Medium|| -|0659|Split Array into Consecutive Subsequences||45.9%|Medium|| -|0660|Remove 9||56.6%|Hard|| -|0661|Image Smoother|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0661.Image-Smoother)|54.7%|Easy|| -|0662|Maximum Width of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree)|40.3%|Medium|| +|0658|Find K Closest Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements)|45.1%|Medium|| +|0659|Split Array into Consecutive Subsequences||50.6%|Medium|| +|0660|Remove 9||56.8%|Hard|| +|0661|Image Smoother|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0661.Image-Smoother)|54.8%|Easy|| +|0662|Maximum Width of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree)|40.5%|Medium|| |0663|Equal Tree Partition||41.3%|Medium|| -|0664|Strange Printer||46.6%|Hard|| -|0665|Non-decreasing Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0665.Non-decreasing-Array)|23.9%|Medium|| -|0666|Path Sum IV||58.8%|Medium|| -|0667|Beautiful Arrangement II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0667.Beautiful-Arrangement-II)|59.5%|Medium|| -|0668|Kth Smallest Number in Multiplication Table|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table)|51.3%|Hard|| -|0669|Trim a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0669.Trim-a-Binary-Search-Tree)|66.3%|Medium|| -|0670|Maximum Swap||47.7%|Medium|| -|0671|Second Minimum Node In a Binary Tree||43.9%|Easy|| -|0672|Bulb Switcher II||50.7%|Medium|| -|0673|Number of Longest Increasing Subsequence||41.5%|Medium|| -|0674|Longest Continuous Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0674.Longest-Continuous-Increasing-Subsequence)|48.7%|Easy|| -|0675|Cut Off Trees for Golf Event||34.9%|Hard|| -|0676|Implement Magic Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary)|56.7%|Medium|| +|0664|Strange Printer||46.7%|Hard|| +|0665|Non-decreasing Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0665.Non-decreasing-Array)|24.0%|Medium|| +|0666|Path Sum IV||58.9%|Medium|| +|0667|Beautiful Arrangement II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0667.Beautiful-Arrangement-II)|59.6%|Medium|| +|0668|Kth Smallest Number in Multiplication Table|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table)|51.4%|Hard|| +|0669|Trim a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0669.Trim-a-Binary-Search-Tree)|66.4%|Medium|| +|0670|Maximum Swap||47.8%|Medium|| +|0671|Second Minimum Node In a Binary Tree||44.0%|Easy|| +|0672|Bulb Switcher II||50.8%|Medium|| +|0673|Number of Longest Increasing Subsequence||41.9%|Medium|| +|0674|Longest Continuous Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0674.Longest-Continuous-Increasing-Subsequence)|48.9%|Easy|| +|0675|Cut Off Trees for Golf Event||34.6%|Hard|| +|0676|Implement Magic Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary)|56.8%|Medium|| |0677|Map Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0677.Map-Sum-Pairs)|57.0%|Medium|| -|0678|Valid Parenthesis String||33.6%|Medium|| -|0679|24 Game||49.0%|Hard|| +|0678|Valid Parenthesis String||33.8%|Medium|| +|0679|24 Game||49.1%|Hard|| |0680|Valid Palindrome II||39.4%|Easy|| |0681|Next Closest Time||46.4%|Medium|| -|0682|Baseball Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game)|73.4%|Easy|| -|0683|K Empty Slots||36.8%|Hard|| -|0684|Redundant Connection|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection)|61.6%|Medium|| +|0682|Baseball Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game)|73.5%|Easy|| +|0683|K Empty Slots||36.9%|Hard|| +|0684|Redundant Connection|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection)|61.9%|Medium|| |0685|Redundant Connection II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II)|34.0%|Hard|| -|0686|Repeated String Match||33.8%|Medium|| -|0687|Longest Univalue Path||39.7%|Medium|| -|0688|Knight Probability in Chessboard||51.8%|Medium|| -|0689|Maximum Sum of 3 Non-Overlapping Subarrays||48.6%|Hard|| -|0690|Employee Importance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0690.Employee-Importance)|64.6%|Medium|| -|0691|Stickers to Spell Word||46.6%|Hard|| -|0692|Top K Frequent Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0692.Top-K-Frequent-Words)|54.8%|Medium|| -|0693|Binary Number with Alternating Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits)|61.1%|Easy|| -|0694|Number of Distinct Islands||60.3%|Medium|| -|0695|Max Area of Island|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0695.Max-Area-of-Island)|71.3%|Medium|| -|0696|Count Binary Substrings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0696.Count-Binary-Substrings)|65.2%|Easy|| -|0697|Degree of an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0697.Degree-of-an-Array)|55.7%|Easy|| -|0698|Partition to K Equal Sum Subsets||42.3%|Medium|| -|0699|Falling Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares)|44.1%|Hard|| -|0700|Search in a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0700.Search-in-a-Binary-Search-Tree)|76.8%|Easy|| -|0701|Insert into a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0701.Insert-into-a-Binary-Search-Tree)|74.8%|Medium|| -|0702|Search in a Sorted Array of Unknown Size||71.1%|Medium|| -|0703|Kth Largest Element in a Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0703.Kth-Largest-Element-in-a-Stream)|55.1%|Easy|| -|0704|Binary Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0704.Binary-Search)|55.2%|Easy|| -|0705|Design HashSet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet)|66.1%|Easy|| +|0686|Repeated String Match||34.0%|Medium|| +|0687|Longest Univalue Path||39.9%|Medium|| +|0688|Knight Probability in Chessboard||51.9%|Medium|| +|0689|Maximum Sum of 3 Non-Overlapping Subarrays||48.7%|Hard|| +|0690|Employee Importance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0690.Employee-Importance)|64.9%|Medium|| +|0691|Stickers to Spell Word||46.4%|Hard|| +|0692|Top K Frequent Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0692.Top-K-Frequent-Words)|55.0%|Medium|| +|0693|Binary Number with Alternating Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits)|61.2%|Easy|| +|0694|Number of Distinct Islands||60.5%|Medium|| +|0695|Max Area of Island|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0695.Max-Area-of-Island)|71.5%|Medium|| +|0696|Count Binary Substrings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0696.Count-Binary-Substrings)|65.4%|Easy|| +|0697|Degree of an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0697.Degree-of-an-Array)|55.8%|Easy|| +|0698|Partition to K Equal Sum Subsets||41.4%|Medium|| +|0699|Falling Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares)|44.3%|Hard|| +|0700|Search in a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0700.Search-in-a-Binary-Search-Tree)|77.0%|Easy|| +|0701|Insert into a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0701.Insert-into-a-Binary-Search-Tree)|74.7%|Medium|| +|0702|Search in a Sorted Array of Unknown Size||71.3%|Medium|| +|0703|Kth Largest Element in a Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0703.Kth-Largest-Element-in-a-Stream)|55.4%|Easy|| +|0704|Binary Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0704.Binary-Search)|55.1%|Easy|| +|0705|Design HashSet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet)|66.0%|Easy|| |0706|Design HashMap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap)|65.2%|Easy|| -|0707|Design Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List)|27.2%|Medium|| -|0708|Insert into a Sorted Circular Linked List||34.5%|Medium|| -|0709|To Lower Case|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0709.To-Lower-Case)|81.6%|Easy|| -|0710|Random Pick with Blacklist|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist)|33.6%|Hard|| -|0711|Number of Distinct Islands II||51.6%|Hard|| -|0712|Minimum ASCII Delete Sum for Two Strings||61.9%|Medium|| -|0713|Subarray Product Less Than K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K)|44.4%|Medium|| -|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee)|63.2%|Medium|| -|0715|Range Module|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module)|44.2%|Hard|| -|0716|Max Stack||45.4%|Hard|| -|0717|1-bit and 2-bit Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters)|46.1%|Easy|| +|0707|Design Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List)|27.4%|Medium|| +|0708|Insert into a Sorted Circular Linked List||34.4%|Medium|| +|0709|To Lower Case|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0709.To-Lower-Case)|81.8%|Easy|| +|0710|Random Pick with Blacklist|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist)|33.5%|Hard|| +|0711|Number of Distinct Islands II||51.7%|Hard|| +|0712|Minimum ASCII Delete Sum for Two Strings||62.0%|Medium|| +|0713|Subarray Product Less Than K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K)|44.7%|Medium|| +|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee)|63.9%|Medium|| +|0715|Range Module|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module)|44.4%|Hard|| +|0716|Max Stack||45.2%|Hard|| +|0717|1-bit and 2-bit Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters)|46.0%|Easy|| |0718|Maximum Length of Repeated Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0718.Maximum-Length-of-Repeated-Subarray)|51.4%|Medium|| -|0719|Find K-th Smallest Pair Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0719.Find-K-th-Smallest-Pair-Distance)|35.5%|Hard|| -|0720|Longest Word in Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0720.Longest-Word-in-Dictionary)|51.5%|Medium|| -|0721|Accounts Merge|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge)|56.1%|Medium|| -|0722|Remove Comments||37.6%|Medium|| -|0723|Candy Crush||75.6%|Medium|| -|0724|Find Pivot Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0724.Find-Pivot-Index)|52.7%|Easy|| -|0725|Split Linked List in Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts)|57.0%|Medium|| -|0726|Number of Atoms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms)|51.9%|Hard|| -|0727|Minimum Window Subsequence||42.8%|Hard|| -|0728|Self Dividing Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0728.Self-Dividing-Numbers)|77.2%|Easy|| -|0729|My Calendar I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0729.My-Calendar-I)|55.5%|Medium|| -|0730|Count Different Palindromic Subsequences||44.4%|Hard|| -|0731|My Calendar II||53.8%|Medium|| -|0732|My Calendar III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III)|67.0%|Hard|| -|0733|Flood Fill|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill)|59.2%|Easy|| +|0719|Find K-th Smallest Pair Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0719.Find-K-th-Smallest-Pair-Distance)|36.0%|Hard|| +|0720|Longest Word in Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0720.Longest-Word-in-Dictionary)|51.6%|Medium|| +|0721|Accounts Merge|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge)|56.3%|Medium|| +|0722|Remove Comments||37.8%|Medium|| +|0723|Candy Crush||76.0%|Medium|| +|0724|Find Pivot Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0724.Find-Pivot-Index)|53.1%|Easy|| +|0725|Split Linked List in Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts)|57.1%|Medium|| +|0726|Number of Atoms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms)|52.1%|Hard|| +|0727|Minimum Window Subsequence||42.9%|Hard|| +|0728|Self Dividing Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0728.Self-Dividing-Numbers)|77.4%|Easy|| +|0729|My Calendar I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0729.My-Calendar-I)|57.2%|Medium|| +|0730|Count Different Palindromic Subsequences||44.3%|Hard|| +|0731|My Calendar II||54.2%|Medium|| +|0732|My Calendar III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III)|67.3%|Hard|| +|0733|Flood Fill|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill)|59.9%|Easy|| |0734|Sentence Similarity||43.0%|Easy|| |0735|Asteroid Collision|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision)|44.4%|Medium|| -|0736|Parse Lisp Expression||51.4%|Hard|| -|0737|Sentence Similarity II||48.5%|Medium|| -|0738|Monotone Increasing Digits||46.9%|Medium|| -|0739|Daily Temperatures|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures)|67.5%|Medium|| -|0740|Delete and Earn||57.5%|Medium|| +|0736|Parse Lisp Expression||51.5%|Hard|| +|0737|Sentence Similarity II||48.6%|Medium|| +|0738|Monotone Increasing Digits||47.0%|Medium|| +|0739|Daily Temperatures|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures)|67.6%|Medium|| +|0740|Delete and Earn||57.4%|Medium|| |0741|Cherry Pickup||36.3%|Hard|| |0742|Closest Leaf in a Binary Tree||45.8%|Medium|| -|0743|Network Delay Time||50.8%|Medium|| -|0744|Find Smallest Letter Greater Than Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target)|44.8%|Easy|| +|0743|Network Delay Time||51.2%|Medium|| +|0744|Find Smallest Letter Greater Than Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target)|44.6%|Easy|| |0745|Prefix and Suffix Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0745.Prefix-and-Suffix-Search)|41.4%|Hard|| -|0746|Min Cost Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs)|61.4%|Easy|| -|0747|Largest Number At Least Twice of Others|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0747.Largest-Number-At-Least-Twice-of-Others)|45.7%|Easy|| -|0748|Shortest Completing Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word)|59.0%|Easy|| -|0749|Contain Virus||50.5%|Hard|| -|0750|Number Of Corner Rectangles||67.6%|Medium|| -|0751|IP to CIDR||54.8%|Medium|| -|0752|Open the Lock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0752.Open-the-Lock)|55.4%|Medium|| -|0753|Cracking the Safe|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0753.Cracking-the-Safe)|55.0%|Hard|| -|0754|Reach a Number||42.1%|Medium|| -|0755|Pour Water||45.8%|Medium|| -|0756|Pyramid Transition Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix)|54.0%|Medium|| -|0757|Set Intersection Size At Least Two||43.4%|Hard|| +|0746|Min Cost Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs)|62.0%|Easy|| +|0747|Largest Number At Least Twice of Others|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0747.Largest-Number-At-Least-Twice-of-Others)|46.0%|Easy|| +|0748|Shortest Completing Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word)|59.1%|Easy|| +|0749|Contain Virus||50.6%|Hard|| +|0750|Number Of Corner Rectangles||67.5%|Medium|| +|0751|IP to CIDR||54.7%|Medium|| +|0752|Open the Lock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0752.Open-the-Lock)|55.5%|Medium|| +|0753|Cracking the Safe|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0753.Cracking-the-Safe)|55.3%|Hard|| +|0754|Reach a Number||42.4%|Medium|| +|0755|Pour Water||46.0%|Medium|| +|0756|Pyramid Transition Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix)|53.6%|Medium|| +|0757|Set Intersection Size At Least Two||43.6%|Hard|| |0758|Bold Words in String||50.5%|Medium|| -|0759|Employee Free Time||71.4%|Hard|| +|0759|Employee Free Time||71.6%|Hard|| |0760|Find Anagram Mappings||82.8%|Easy|| -|0761|Special Binary String||60.0%|Hard|| -|0762|Prime Number of Set Bits in Binary Representation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation)|67.2%|Easy|| -|0763|Partition Labels|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels)|79.7%|Medium|| +|0761|Special Binary String||60.2%|Hard|| +|0762|Prime Number of Set Bits in Binary Representation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation)|67.5%|Easy|| +|0763|Partition Labels|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels)|79.8%|Medium|| |0764|Largest Plus Sign||48.5%|Medium|| -|0765|Couples Holding Hands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0765.Couples-Holding-Hands)|56.7%|Hard|| +|0765|Couples Holding Hands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0765.Couples-Holding-Hands)|56.8%|Hard|| |0766|Toeplitz Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0766.Toeplitz-Matrix)|68.1%|Easy|| -|0767|Reorganize String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String)|52.5%|Medium|| -|0768|Max Chunks To Make Sorted II||52.3%|Hard|| -|0769|Max Chunks To Make Sorted||57.9%|Medium|| -|0770|Basic Calculator IV||55.9%|Hard|| -|0771|Jewels and Stones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0771.Jewels-and-Stones)|87.8%|Easy|| -|0772|Basic Calculator III||48.0%|Hard|| -|0773|Sliding Puzzle||63.4%|Hard|| -|0774|Minimize Max Distance to Gas Station||50.8%|Hard|| -|0775|Global and Local Inversions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0775.Global-and-Local-Inversions)|44.5%|Medium|| +|0767|Reorganize String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String)|52.7%|Medium|| +|0768|Max Chunks To Make Sorted II||52.5%|Hard|| +|0769|Max Chunks To Make Sorted||58.0%|Medium|| +|0770|Basic Calculator IV||56.0%|Hard|| +|0771|Jewels and Stones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0771.Jewels-and-Stones)|87.9%|Easy|| +|0772|Basic Calculator III||48.3%|Hard|| +|0773|Sliding Puzzle||63.6%|Hard|| +|0774|Minimize Max Distance to Gas Station||51.2%|Hard|| +|0775|Global and Local Inversions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0775.Global-and-Local-Inversions)|44.1%|Medium|| |0776|Split BST||58.6%|Medium|| -|0777|Swap Adjacent in LR String||36.9%|Medium|| -|0778|Swim in Rising Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water)|59.3%|Hard|| -|0779|K-th Symbol in Grammar||40.2%|Medium|| -|0780|Reaching Points||31.9%|Hard|| -|0781|Rabbits in Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest)|55.4%|Medium|| -|0782|Transform to Chessboard||51.9%|Hard|| -|0783|Minimum Distance Between BST Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0783.Minimum-Distance-Between-BST-Nodes)|56.5%|Easy|| -|0784|Letter Case Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation)|73.0%|Medium|| -|0785|Is Graph Bipartite?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0785.Is-Graph-Bipartite)|52.2%|Medium|| -|0786|K-th Smallest Prime Fraction|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction)|49.6%|Medium|| +|0777|Swap Adjacent in LR String||37.0%|Medium|| +|0778|Swim in Rising Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water)|59.4%|Hard|| +|0779|K-th Symbol in Grammar||40.5%|Medium|| +|0780|Reaching Points||32.2%|Hard|| +|0781|Rabbits in Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest)|55.3%|Medium|| +|0782|Transform to Chessboard||51.8%|Hard|| +|0783|Minimum Distance Between BST Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0783.Minimum-Distance-Between-BST-Nodes)|56.7%|Easy|| +|0784|Letter Case Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation)|73.3%|Medium|| +|0785|Is Graph Bipartite?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0785.Is-Graph-Bipartite)|52.4%|Medium|| +|0786|K-th Smallest Prime Fraction|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction)|50.4%|Medium|| |0787|Cheapest Flights Within K Stops||35.9%|Medium|| |0788|Rotated Digits||57.0%|Medium|| -|0789|Escape The Ghosts||60.3%|Medium|| -|0790|Domino and Tromino Tiling||48.2%|Medium|| +|0789|Escape The Ghosts||60.5%|Medium|| +|0790|Domino and Tromino Tiling||48.3%|Medium|| |0791|Custom Sort String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0791.Custom-Sort-String)|69.4%|Medium|| -|0792|Number of Matching Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0792.Number-of-Matching-Subsequences)|51.9%|Medium|| -|0793|Preimage Size of Factorial Zeroes Function|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function)|42.2%|Hard|| -|0794|Valid Tic-Tac-Toe State|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0794.Valid-Tic-Tac-Toe-State)|35.2%|Medium|| -|0795|Number of Subarrays with Bounded Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum)|52.5%|Medium|| -|0796|Rotate String||53.1%|Easy|| -|0797|All Paths From Source to Target||81.2%|Medium|| -|0798|Smallest Rotation with Highest Score||48.9%|Hard|| +|0792|Number of Matching Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0792.Number-of-Matching-Subsequences)|52.0%|Medium|| +|0793|Preimage Size of Factorial Zeroes Function|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function)|42.4%|Hard|| +|0794|Valid Tic-Tac-Toe State|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0794.Valid-Tic-Tac-Toe-State)|35.3%|Medium|| +|0795|Number of Subarrays with Bounded Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0795.Number-of-Subarrays-with-Bounded-Maximum)|52.6%|Medium|| +|0796|Rotate String||53.7%|Easy|| +|0797|All Paths From Source to Target||81.3%|Medium|| +|0798|Smallest Rotation with Highest Score||49.3%|Hard|| |0799|Champagne Tower||51.2%|Medium|| -|0800|Similar RGB Color||63.9%|Easy|| -|0801|Minimum Swaps To Make Sequences Increasing||39.1%|Hard|| -|0802|Find Eventual Safe States|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0802.Find-Eventual-Safe-States)|53.6%|Medium|| +|0800|Similar RGB Color||64.0%|Easy|| +|0801|Minimum Swaps To Make Sequences Increasing||39.2%|Hard|| +|0802|Find Eventual Safe States|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0802.Find-Eventual-Safe-States)|54.2%|Medium|| |0803|Bricks Falling When Hit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0803.Bricks-Falling-When-Hit)|34.1%|Hard|| -|0804|Unique Morse Code Words||80.2%|Easy|| -|0805|Split Array With Same Average||26.1%|Hard|| -|0806|Number of Lines To Write String||66.0%|Easy|| -|0807|Max Increase to Keep City Skyline|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0807.Max-Increase-to-Keep-City-Skyline)|85.7%|Medium|| -|0808|Soup Servings||42.7%|Medium|| +|0804|Unique Morse Code Words||82.6%|Easy|| +|0805|Split Array With Same Average||26.0%|Hard|| +|0806|Number of Lines To Write String||66.1%|Easy|| +|0807|Max Increase to Keep City Skyline|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0807.Max-Increase-to-Keep-City-Skyline)|85.9%|Medium|| +|0808|Soup Servings||43.0%|Medium|| |0809|Expressive Words||46.3%|Medium|| -|0810|Chalkboard XOR Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0810.Chalkboard-XOR-Game)|54.2%|Hard|| -|0811|Subdomain Visit Count|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count)|74.6%|Medium|| -|0812|Largest Triangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0812.Largest-Triangle-Area)|59.6%|Easy|| -|0813|Largest Sum of Averages||52.7%|Medium|| -|0814|Binary Tree Pruning||70.9%|Medium|| -|0815|Bus Routes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0815.Bus-Routes)|45.4%|Hard|| +|0810|Chalkboard XOR Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0810.Chalkboard-XOR-Game)|54.7%|Hard|| +|0811|Subdomain Visit Count|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count)|74.9%|Medium|| +|0812|Largest Triangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0812.Largest-Triangle-Area)|59.7%|Easy|| +|0813|Largest Sum of Averages||52.8%|Medium|| +|0814|Binary Tree Pruning||72.7%|Medium|| +|0815|Bus Routes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0815.Bus-Routes)|45.7%|Hard|| |0816|Ambiguous Coordinates|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0816.Ambiguous-Coordinates)|56.0%|Medium|| |0817|Linked List Components|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0817.Linked-List-Components)|58.1%|Medium|| -|0818|Race Car||43.4%|Hard|| -|0819|Most Common Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0819.Most-Common-Word)|45.1%|Easy|| +|0818|Race Car||43.6%|Hard|| +|0819|Most Common Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0819.Most-Common-Word)|45.0%|Easy|| |0820|Short Encoding of Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0820.Short-Encoding-of-Words)|60.7%|Medium|| -|0821|Shortest Distance to a Character|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0821.Shortest-Distance-to-a-Character)|71.1%|Easy|| -|0822|Card Flipping Game||45.1%|Medium|| -|0823|Binary Trees With Factors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0823.Binary-Trees-With-Factors)|43.7%|Medium|| -|0824|Goat Latin||67.7%|Easy|| -|0825|Friends Of Appropriate Ages|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0825.Friends-Of-Appropriate-Ages)|46.1%|Medium|| -|0826|Most Profit Assigning Work|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work)|43.3%|Medium|| +|0821|Shortest Distance to a Character|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0821.Shortest-Distance-to-a-Character)|71.2%|Easy|| +|0822|Card Flipping Game||45.3%|Medium|| +|0823|Binary Trees With Factors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0823.Binary-Trees-With-Factors)|50.1%|Medium|| +|0824|Goat Latin||67.8%|Easy|| +|0825|Friends Of Appropriate Ages|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0825.Friends-Of-Appropriate-Ages)|46.2%|Medium|| +|0826|Most Profit Assigning Work|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work)|43.8%|Medium|| |0827|Making A Large Island||44.7%|Hard|| -|0828|Count Unique Characters of All Substrings of a Given String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String)|50.3%|Hard|| -|0829|Consecutive Numbers Sum||41.2%|Hard|| -|0830|Positions of Large Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0830.Positions-of-Large-Groups)|51.5%|Easy|| -|0831|Masking Personal Information||46.3%|Medium|| -|0832|Flipping an Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0832.Flipping-an-Image)|80.0%|Easy|| -|0833|Find And Replace in String||54.2%|Medium|| -|0834|Sum of Distances in Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree)|53.5%|Hard|| +|0828|Count Unique Characters of All Substrings of a Given String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String)|51.2%|Hard|| +|0829|Consecutive Numbers Sum||41.4%|Hard|| +|0830|Positions of Large Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0830.Positions-of-Large-Groups)|51.7%|Easy|| +|0831|Masking Personal Information||46.6%|Medium|| +|0832|Flipping an Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0832.Flipping-an-Image)|80.2%|Easy|| +|0833|Find And Replace in String||54.1%|Medium|| +|0834|Sum of Distances in Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree)|53.9%|Hard|| |0835|Image Overlap||61.1%|Medium|| -|0836|Rectangle Overlap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap)|43.2%|Easy|| -|0837|New 21 Game||36.1%|Medium|| -|0838|Push Dominoes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes)|52.5%|Medium|| -|0839|Similar String Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups)|46.7%|Hard|| -|0840|Magic Squares In Grid||38.4%|Medium|| -|0841|Keys and Rooms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0841.Keys-and-Rooms)|69.7%|Medium|| -|0842|Split Array into Fibonacci Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)|38.0%|Medium|| -|0843|Guess the Word||42.6%|Hard|| +|0836|Rectangle Overlap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap)|43.3%|Easy|| +|0837|New 21 Game||36.2%|Medium|| +|0838|Push Dominoes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes)|52.6%|Medium|| +|0839|Similar String Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups)|47.1%|Hard|| +|0840|Magic Squares In Grid||38.5%|Medium|| +|0841|Keys and Rooms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0841.Keys-and-Rooms)|69.9%|Medium|| +|0842|Split Array into Fibonacci Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)|38.1%|Medium|| +|0843|Guess the Word||42.2%|Hard|| |0844|Backspace String Compare|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare)|48.0%|Easy|| -|0845|Longest Mountain in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array)|40.0%|Medium|| -|0846|Hand of Straights|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0846.Hand-of-Straights)|56.3%|Medium|| +|0845|Longest Mountain in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array)|40.1%|Medium|| +|0846|Hand of Straights|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0846.Hand-of-Straights)|56.4%|Medium|| |0847|Shortest Path Visiting All Nodes||61.3%|Hard|| |0848|Shifting Letters||45.4%|Medium|| |0849|Maximize Distance to Closest Person||47.5%|Medium|| |0850|Rectangle Area II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0850.Rectangle-Area-II)|53.5%|Hard|| -|0851|Loud and Rich|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0851.Loud-and-Rich)|57.3%|Medium|| -|0852|Peak Index in a Mountain Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array)|69.8%|Medium|| -|0853|Car Fleet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet)|49.1%|Medium|| +|0851|Loud and Rich|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0851.Loud-and-Rich)|57.8%|Medium|| +|0852|Peak Index in a Mountain Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array)|69.6%|Medium|| +|0853|Car Fleet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet)|49.7%|Medium|| |0854|K-Similar Strings||39.5%|Hard|| -|0855|Exam Room||43.6%|Medium|| -|0856|Score of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses)|65.3%|Medium|| -|0857|Minimum Cost to Hire K Workers||51.8%|Hard|| -|0858|Mirror Reflection||59.5%|Medium|| +|0855|Exam Room||43.5%|Medium|| +|0856|Score of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses)|65.2%|Medium|| +|0857|Minimum Cost to Hire K Workers||51.9%|Hard|| +|0858|Mirror Reflection||63.2%|Medium|| |0859|Buddy Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0859.Buddy-Strings)|28.9%|Easy|| |0860|Lemonade Change||52.7%|Easy|| -|0861|Score After Flipping Matrix||74.9%|Medium|| +|0861|Score After Flipping Matrix||75.0%|Medium|| |0862|Shortest Subarray with Sum at Least K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K)|26.1%|Hard|| -|0863|All Nodes Distance K in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree)|61.6%|Medium|| -|0864|Shortest Path to Get All Keys|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys)|45.1%|Hard|| -|0865|Smallest Subtree with all the Deepest Nodes||68.2%|Medium|| -|0866|Prime Palindrome||25.9%|Medium|| -|0867|Transpose Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix)|63.8%|Easy|| -|0868|Binary Gap||61.8%|Easy|| -|0869|Reordered Power of 2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0869.Reordered-Power-of-2)|61.1%|Medium|| +|0863|All Nodes Distance K in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree)|62.0%|Medium|| +|0864|Shortest Path to Get All Keys|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys)|45.4%|Hard|| +|0865|Smallest Subtree with all the Deepest Nodes||68.4%|Medium|| +|0866|Prime Palindrome||25.8%|Medium|| +|0867|Transpose Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix)|63.5%|Easy|| +|0868|Binary Gap||61.9%|Easy|| +|0869|Reordered Power of 2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0869.Reordered-Power-of-2)|64.2%|Medium|| |0870|Advantage Shuffle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0870.Advantage-Shuffle)|51.5%|Medium|| -|0871|Minimum Number of Refueling Stops||35.9%|Hard|| +|0871|Minimum Number of Refueling Stops||39.9%|Hard|| |0872|Leaf-Similar Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0872.Leaf-Similar-Trees)|65.1%|Easy|| |0873|Length of Longest Fibonacci Subsequence||48.6%|Medium|| -|0874|Walking Robot Simulation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0874.Walking-Robot-Simulation)|38.0%|Medium|| -|0875|Koko Eating Bananas|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0875.Koko-Eating-Bananas)|53.6%|Medium|| -|0876|Middle of the Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List)|73.3%|Easy|| -|0877|Stone Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0877.Stone-Game)|69.4%|Medium|| -|0878|Nth Magical Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number)|35.9%|Hard|| +|0874|Walking Robot Simulation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0874.Walking-Robot-Simulation)|38.3%|Medium|| +|0875|Koko Eating Bananas|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0875.Koko-Eating-Bananas)|52.8%|Medium|| +|0876|Middle of the Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List)|73.6%|Easy|| +|0877|Stone Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0877.Stone-Game)|69.6%|Medium|| +|0878|Nth Magical Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number)|35.8%|Hard|| |0879|Profitable Schemes||40.5%|Hard|| |0880|Decoded String at Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0880.Decoded-String-at-Index)|28.3%|Medium|| |0881|Boats to Save People|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People)|52.6%|Medium|| -|0882|Reachable Nodes In Subdivided Graph||50.2%|Hard|| -|0883|Projection Area of 3D Shapes||70.3%|Easy|| -|0884|Uncommon Words from Two Sentences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences)|65.7%|Easy|| -|0885|Spiral Matrix III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III)|72.7%|Medium|| -|0886|Possible Bipartition||47.9%|Medium|| +|0882|Reachable Nodes In Subdivided Graph||50.3%|Hard|| +|0883|Projection Area of 3D Shapes||70.5%|Easy|| +|0884|Uncommon Words from Two Sentences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences)|65.8%|Easy|| +|0885|Spiral Matrix III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III)|72.9%|Medium|| +|0886|Possible Bipartition||48.2%|Medium|| |0887|Super Egg Drop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop)|27.2%|Hard|| |0888|Fair Candy Swap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0888.Fair-Candy-Swap)|60.4%|Easy|| -|0889|Construct Binary Tree from Preorder and Postorder Traversal||70.4%|Medium|| -|0890|Find and Replace Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0890.Find-and-Replace-Pattern)|75.6%|Medium|| -|0891|Sum of Subsequence Widths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths)|36.1%|Hard|| -|0892|Surface Area of 3D Shapes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0892.Surface-Area-of-3D-Shapes)|62.5%|Easy|| -|0893|Groups of Special-Equivalent Strings||70.6%|Medium|| -|0894|All Possible Full Binary Trees||79.8%|Medium|| -|0895|Maximum Frequency Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack)|66.6%|Hard|| -|0896|Monotonic Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0896.Monotonic-Array)|58.3%|Easy|| -|0897|Increasing Order Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0897.Increasing-Order-Search-Tree)|78.3%|Easy|| -|0898|Bitwise ORs of Subarrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays)|36.4%|Medium|| -|0899|Orderly Queue||58.7%|Hard|| -|0900|RLE Iterator||59.1%|Medium|| -|0901|Online Stock Span|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0901.Online-Stock-Span)|63.5%|Medium|| -|0902|Numbers At Most N Given Digit Set||41.0%|Hard|| -|0903|Valid Permutations for DI Sequence||57.3%|Hard|| +|0889|Construct Binary Tree from Preorder and Postorder Traversal||70.6%|Medium|| +|0890|Find and Replace Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0890.Find-and-Replace-Pattern)|78.0%|Medium|| +|0891|Sum of Subsequence Widths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths)|36.3%|Hard|| +|0892|Surface Area of 3D Shapes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0892.Surface-Area-of-3D-Shapes)|62.8%|Easy|| +|0893|Groups of Special-Equivalent Strings||70.8%|Medium|| +|0894|All Possible Full Binary Trees||79.9%|Medium|| +|0895|Maximum Frequency Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack)|66.7%|Hard|| +|0896|Monotonic Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0896.Monotonic-Array)|58.2%|Easy|| +|0897|Increasing Order Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0897.Increasing-Order-Search-Tree)|78.4%|Easy|| +|0898|Bitwise ORs of Subarrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays)|36.6%|Medium|| +|0899|Orderly Queue||58.9%|Hard|| +|0900|RLE Iterator||59.4%|Medium|| +|0901|Online Stock Span|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0901.Online-Stock-Span)|63.8%|Medium|| +|0902|Numbers At Most N Given Digit Set||41.3%|Hard|| +|0903|Valid Permutations for DI Sequence||57.8%|Hard|| |0904|Fruit Into Baskets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0904.Fruit-Into-Baskets)|42.6%|Medium|| |0905|Sort Array By Parity||75.7%|Easy|| |0906|Super Palindromes||39.3%|Hard|| -|0907|Sum of Subarray Minimums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums)|34.1%|Medium|| -|0908|Smallest Range I||67.5%|Easy|| -|0909|Snakes and Ladders|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0909.Snakes-and-Ladders)|40.7%|Medium|| -|0910|Smallest Range II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0910.Smallest-Range-II)|33.4%|Medium|| -|0911|Online Election|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election)|51.8%|Medium|| -|0912|Sort an Array||61.1%|Medium|| -|0913|Cat and Mouse||35.6%|Hard|| -|0914|X of a Kind in a Deck of Cards|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0914.X-of-a-Kind-in-a-Deck-of-Cards)|32.6%|Easy|| -|0915|Partition Array into Disjoint Intervals||48.5%|Medium|| -|0916|Word Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0916.Word-Subsets)|52.4%|Medium|| -|0917|Reverse Only Letters||61.2%|Easy|| -|0918|Maximum Sum Circular Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0918.Maximum-Sum-Circular-Subarray)|37.6%|Medium|| -|0919|Complete Binary Tree Inserter||64.5%|Medium|| -|0920|Number of Music Playlists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0920.Number-of-Music-Playlists)|50.4%|Hard|| -|0921|Minimum Add to Make Parentheses Valid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid)|76.7%|Medium|| +|0907|Sum of Subarray Minimums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums)|34.2%|Medium|| +|0908|Smallest Range I||67.6%|Easy|| +|0909|Snakes and Ladders|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0909.Snakes-and-Ladders)|40.8%|Medium|| +|0910|Smallest Range II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0910.Smallest-Range-II)|34.0%|Medium|| +|0911|Online Election|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election)|51.9%|Medium|| +|0912|Sort an Array||60.7%|Medium|| +|0913|Cat and Mouse||35.4%|Hard|| +|0914|X of a Kind in a Deck of Cards|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0914.X-of-a-Kind-in-a-Deck-of-Cards)|32.4%|Easy|| +|0915|Partition Array into Disjoint Intervals||48.6%|Medium|| +|0916|Word Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0916.Word-Subsets)|54.3%|Medium|| +|0917|Reverse Only Letters||61.3%|Easy|| +|0918|Maximum Sum Circular Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0918.Maximum-Sum-Circular-Subarray)|37.9%|Medium|| +|0919|Complete Binary Tree Inserter||64.8%|Medium|| +|0920|Number of Music Playlists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0920.Number-of-Music-Playlists)|50.5%|Hard|| +|0921|Minimum Add to Make Parentheses Valid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid)|76.5%|Medium|| |0922|Sort Array By Parity II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0922.Sort-Array-By-Parity-II)|70.7%|Easy|| |0923|3Sum With Multiplicity|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0923.3Sum-With-Multiplicity)|45.5%|Medium|| |0924|Minimize Malware Spread|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0924.Minimize-Malware-Spread)|42.0%|Hard|| -|0925|Long Pressed Name|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name)|34.3%|Easy|| -|0926|Flip String to Monotone Increasing||59.3%|Medium|| +|0925|Long Pressed Name|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name)|34.0%|Easy|| +|0926|Flip String to Monotone Increasing||59.5%|Medium|| |0927|Three Equal Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0927.Three-Equal-Parts)|39.5%|Hard|| -|0928|Minimize Malware Spread II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II)|42.3%|Hard|| +|0928|Minimize Malware Spread II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II)|42.5%|Hard|| |0929|Unique Email Addresses||67.2%|Easy|| -|0930|Binary Subarrays With Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum)|49.7%|Medium|| -|0931|Minimum Falling Path Sum||68.0%|Medium|| -|0932|Beautiful Array||64.9%|Medium|| +|0930|Binary Subarrays With Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum)|50.4%|Medium|| +|0931|Minimum Falling Path Sum||68.3%|Medium|| +|0932|Beautiful Array||65.0%|Medium|| |0933|Number of Recent Calls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0933.Number-of-Recent-Calls)|73.1%|Easy|| -|0934|Shortest Bridge||53.4%|Medium|| -|0935|Knight Dialer||49.4%|Medium|| -|0936|Stamping The Sequence||53.8%|Hard|| -|0937|Reorder Data in Log Files||56.2%|Medium|| -|0938|Range Sum of BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0938.Range-Sum-of-BST)|85.2%|Easy|| -|0939|Minimum Area Rectangle||53.5%|Medium|| -|0940|Distinct Subsequences II||44.3%|Hard|| +|0934|Shortest Bridge||53.7%|Medium|| +|0935|Knight Dialer||49.8%|Medium|| +|0936|Stamping The Sequence||63.4%|Hard|| +|0937|Reorder Data in Log Files||56.4%|Medium|| +|0938|Range Sum of BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0938.Range-Sum-of-BST)|85.3%|Easy|| +|0939|Minimum Area Rectangle||53.4%|Medium|| +|0940|Distinct Subsequences II||44.2%|Hard|| |0941|Valid Mountain Array||33.6%|Easy|| -|0942|DI String Match|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match)|76.2%|Easy|| -|0943|Find the Shortest Superstring||45.2%|Hard|| -|0944|Delete Columns to Make Sorted||69.9%|Easy|| -|0945|Minimum Increment to Make Array Unique||49.4%|Medium|| +|0942|DI String Match|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match)|76.4%|Easy|| +|0943|Find the Shortest Superstring||45.0%|Hard|| +|0944|Delete Columns to Make Sorted||69.7%|Easy|| +|0945|Minimum Increment to Make Array Unique||49.5%|Medium|| |0946|Validate Stack Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences)|67.6%|Medium|| -|0947|Most Stones Removed with Same Row or Column|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column)|56.5%|Medium|| +|0947|Most Stones Removed with Same Row or Column|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column)|56.8%|Medium|| |0948|Bag of Tokens||46.3%|Medium|| -|0949|Largest Time for Given Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0949.Largest-Time-for-Given-Digits)|35.4%|Medium|| -|0950|Reveal Cards In Increasing Order||77.4%|Medium|| -|0951|Flip Equivalent Binary Trees||66.7%|Medium|| -|0952|Largest Component Size by Common Factor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor)|40.2%|Hard|| +|0949|Largest Time for Given Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0949.Largest-Time-for-Given-Digits)|35.3%|Medium|| +|0950|Reveal Cards In Increasing Order||77.5%|Medium|| +|0951|Flip Equivalent Binary Trees||66.8%|Medium|| +|0952|Largest Component Size by Common Factor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor)|40.3%|Hard|| |0953|Verifying an Alien Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0953.Verifying-an-Alien-Dictionary)|52.6%|Easy|| |0954|Array of Doubled Pairs||38.8%|Medium|| -|0955|Delete Columns to Make Sorted II||34.4%|Medium|| +|0955|Delete Columns to Make Sorted II||34.5%|Medium|| |0956|Tallest Billboard||39.8%|Hard|| -|0957|Prison Cells After N Days||39.3%|Medium|| -|0958|Check Completeness of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0958.Check-Completeness-of-a-Binary-Tree)|53.7%|Medium|| -|0959|Regions Cut By Slashes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes)|69.0%|Medium|| -|0960|Delete Columns to Make Sorted III||56.8%|Hard|| -|0961|N-Repeated Element in Size 2N Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0961.N-Repeated-Element-in-Size-2N-Array)|75.6%|Easy|| -|0962|Maximum Width Ramp||48.6%|Medium|| -|0963|Minimum Area Rectangle II||54.6%|Medium|| -|0964|Least Operators to Express Number||47.6%|Hard|| -|0965|Univalued Binary Tree||69.1%|Easy|| +|0957|Prison Cells After N Days||39.2%|Medium|| +|0958|Check Completeness of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0958.Check-Completeness-of-a-Binary-Tree)|53.8%|Medium|| +|0959|Regions Cut By Slashes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes)|68.9%|Medium|| +|0960|Delete Columns to Make Sorted III||57.1%|Hard|| +|0961|N-Repeated Element in Size 2N Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0961.N-Repeated-Element-in-Size-2N-Array)|75.7%|Easy|| +|0962|Maximum Width Ramp||48.8%|Medium|| +|0963|Minimum Area Rectangle II||54.7%|Medium|| +|0964|Least Operators to Express Number||47.8%|Hard|| +|0965|Univalued Binary Tree||69.2%|Easy|| |0966|Vowel Spellchecker|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0966.Vowel-Spellchecker)|51.5%|Medium|| -|0967|Numbers With Same Consecutive Differences||47.7%|Medium|| +|0967|Numbers With Same Consecutive Differences||56.8%|Medium|| |0968|Binary Tree Cameras|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0968.Binary-Tree-Cameras)|46.8%|Hard|| -|0969|Pancake Sorting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting)|69.9%|Medium|| +|0969|Pancake Sorting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting)|70.0%|Medium|| |0970|Powerful Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0970.Powerful-Integers)|43.6%|Medium|| |0971|Flip Binary Tree To Match Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal)|49.9%|Medium|| -|0972|Equal Rational Numbers||42.9%|Hard|| +|0972|Equal Rational Numbers||43.0%|Hard|| |0973|K Closest Points to Origin|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0973.K-Closest-Points-to-Origin)|65.9%|Medium|| -|0974|Subarray Sums Divisible by K||53.2%|Medium|| +|0974|Subarray Sums Divisible by K||53.4%|Medium|| |0975|Odd Even Jump||38.9%|Hard|| -|0976|Largest Perimeter Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle)|53.5%|Easy|| -|0977|Squares of a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array)|71.7%|Easy|| -|0978|Longest Turbulent Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray)|47.5%|Medium|| -|0979|Distribute Coins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree)|71.9%|Medium|| -|0980|Unique Paths III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III)|79.5%|Hard|| -|0981|Time Based Key-Value Store|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store)|52.5%|Medium|| -|0982|Triples with Bitwise AND Equal To Zero||57.6%|Hard|| -|0983|Minimum Cost For Tickets||64.3%|Medium|| -|0984|String Without AAA or BBB|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB)|42.7%|Medium|| -|0985|Sum of Even Numbers After Queries|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0985.Sum-of-Even-Numbers-After-Queries)|61.1%|Medium|| +|0976|Largest Perimeter Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle)|52.6%|Easy|| +|0977|Squares of a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array)|71.8%|Easy|| +|0978|Longest Turbulent Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray)|47.6%|Medium|| +|0979|Distribute Coins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree)|72.0%|Medium|| +|0980|Unique Paths III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III)|79.6%|Hard|| +|0981|Time Based Key-Value Store|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store)|52.3%|Medium|| +|0982|Triples with Bitwise AND Equal To Zero||57.7%|Hard|| +|0983|Minimum Cost For Tickets||64.4%|Medium|| +|0984|String Without AAA or BBB|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB)|42.9%|Medium|| +|0985|Sum of Even Numbers After Queries|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0985.Sum-of-Even-Numbers-After-Queries)|61.2%|Medium|| |0986|Interval List Intersections|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections)|71.3%|Medium|| -|0987|Vertical Order Traversal of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree)|42.0%|Hard|| -|0988|Smallest String Starting From Leaf||49.1%|Medium|| -|0989|Add to Array-Form of Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0989.Add-to-Array-Form-of-Integer)|45.6%|Easy|| -|0990|Satisfiability of Equality Equations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations)|50.4%|Medium|| +|0987|Vertical Order Traversal of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree)|44.5%|Hard|| +|0988|Smallest String Starting From Leaf||49.4%|Medium|| +|0989|Add to Array-Form of Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0989.Add-to-Array-Form-of-Integer)|45.5%|Easy|| +|0990|Satisfiability of Equality Equations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations)|50.7%|Medium|| |0991|Broken Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0991.Broken-Calculator)|54.1%|Medium|| -|0992|Subarrays with K Different Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers)|53.6%|Hard|| +|0992|Subarrays with K Different Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers)|54.0%|Hard|| |0993|Cousins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree)|54.0%|Easy|| -|0994|Rotting Oranges||52.0%|Medium|| +|0994|Rotting Oranges||52.3%|Medium|| |0995|Minimum Number of K Consecutive Bit Flips|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips)|51.1%|Hard|| |0996|Number of Squareful Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays)|49.1%|Hard|| -|0997|Find the Town Judge|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0997.Find-the-Town-Judge)|49.6%|Easy|| -|0998|Maximum Binary Tree II||65.9%|Medium|| -|0999|Available Captures for Rook|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0999.Available-Captures-for-Rook)|67.6%|Easy|| -|1000|Minimum Cost to Merge Stones||42.1%|Hard|| +|0997|Find the Town Judge|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0997.Find-the-Town-Judge)|49.4%|Easy|| +|0998|Maximum Binary Tree II||66.2%|Medium|| +|0999|Available Captures for Rook|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0999.Available-Captures-for-Rook)|67.7%|Easy|| +|1000|Minimum Cost to Merge Stones||42.2%|Hard|| |1001|Grid Illumination||36.3%|Hard|| |1002|Find Common Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1002.Find-Common-Characters)|68.4%|Easy|| -|1003|Check If Word Is Valid After Substitutions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions)|58.0%|Medium|| -|1004|Max Consecutive Ones III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III)|63.3%|Medium|| +|1003|Check If Word Is Valid After Substitutions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions)|58.1%|Medium|| +|1004|Max Consecutive Ones III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III)|63.5%|Medium|| |1005|Maximize Sum Of Array After K Negations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations)|51.2%|Easy|| |1006|Clumsy Factorial|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1006.Clumsy-Factorial)|54.8%|Medium|| |1007|Minimum Domino Rotations For Equal Row||52.5%|Medium|| -|1008|Construct Binary Search Tree from Preorder Traversal||80.6%|Medium|| -|1009|Complement of Base 10 Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1009.Complement-of-Base-10-Integer)|62.2%|Easy|| -|1010|Pairs of Songs With Total Durations Divisible by 60|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60)|53.3%|Medium|| -|1011|Capacity To Ship Packages Within D Days|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days)|64.0%|Medium|| -|1012|Numbers With Repeated Digits||38.3%|Hard|| -|1013|Partition Array Into Three Parts With Equal Sum||44.0%|Easy|| -|1014|Best Sightseeing Pair||59.3%|Medium|| -|1015|Smallest Integer Divisible by K||47.0%|Medium|| +|1008|Construct Binary Search Tree from Preorder Traversal||80.8%|Medium|| +|1009|Complement of Base 10 Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1009.Complement-of-Base-10-Integer)|62.0%|Easy|| +|1010|Pairs of Songs With Total Durations Divisible by 60|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60)|53.1%|Medium|| +|1011|Capacity To Ship Packages Within D Days|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days)|64.3%|Medium|| +|1012|Numbers With Repeated Digits||40.4%|Hard|| +|1013|Partition Array Into Three Parts With Equal Sum||43.7%|Easy|| +|1014|Best Sightseeing Pair||59.5%|Medium|| +|1015|Smallest Integer Divisible by K||47.1%|Medium|| |1016|Binary String With Substrings Representing 1 To N||57.7%|Medium|| -|1017|Convert to Base -2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1017.Convert-to-Base-2)|60.8%|Medium|| +|1017|Convert to Base -2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1017.Convert-to-Base-2)|60.9%|Medium|| |1018|Binary Prefix Divisible By 5|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1018.Binary-Prefix-Divisible-By-5)|47.5%|Easy|| -|1019|Next Greater Node In Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List)|59.7%|Medium|| -|1020|Number of Enclaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1020.Number-of-Enclaves)|63.9%|Medium|| -|1021|Remove Outermost Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses)|80.0%|Easy|| -|1022|Sum of Root To Leaf Binary Numbers||73.8%|Easy|| -|1023|Camelcase Matching||59.7%|Medium|| -|1024|Video Stitching||50.2%|Medium|| -|1025|Divisor Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game)|66.8%|Easy|| -|1026|Maximum Difference Between Node and Ancestor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor)|73.3%|Medium|| -|1027|Longest Arithmetic Subsequence||47.8%|Medium|| +|1019|Next Greater Node In Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List)|59.8%|Medium|| +|1020|Number of Enclaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1020.Number-of-Enclaves)|64.4%|Medium|| +|1021|Remove Outermost Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses)|80.1%|Easy|| +|1022|Sum of Root To Leaf Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1022.Sum-of-Root-To-Leaf-Binary-Numbers)|73.8%|Easy|| +|1023|Camelcase Matching||59.9%|Medium|| +|1024|Video Stitching||50.4%|Medium|| +|1025|Divisor Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game)|67.0%|Easy|| +|1026|Maximum Difference Between Node and Ancestor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor)|73.4%|Medium|| +|1027|Longest Arithmetic Subsequence||47.4%|Medium|| |1028|Recover a Tree From Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal)|72.7%|Hard|| -|1029|Two City Scheduling||63.9%|Medium|| -|1030|Matrix Cells in Distance Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order)|69.3%|Easy|| +|1029|Two City Scheduling||64.1%|Medium|| +|1030|Matrix Cells in Distance Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order)|69.2%|Easy|| |1031|Maximum Sum of Two Non-Overlapping Subarrays||59.4%|Medium|| -|1032|Stream of Characters||51.4%|Hard|| -|1033|Moving Stones Until Consecutive||45.3%|Medium|| +|1032|Stream of Characters||51.5%|Hard|| +|1033|Moving Stones Until Consecutive||45.5%|Medium|| |1034|Coloring A Border|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1034.Coloring-A-Border)|48.9%|Medium|| -|1035|Uncrossed Lines||58.4%|Medium|| -|1036|Escape a Large Maze||34.2%|Hard|| +|1035|Uncrossed Lines||58.6%|Medium|| +|1036|Escape a Large Maze||34.1%|Hard|| |1037|Valid Boomerang|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1037.Valid-Boomerang)|37.5%|Easy|| -|1038|Binary Search Tree to Greater Sum Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree)|85.0%|Medium|| -|1039|Minimum Score Triangulation of Polygon||53.5%|Medium|| -|1040|Moving Stones Until Consecutive II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II)|55.6%|Medium|| -|1041|Robot Bounded In Circle||55.4%|Medium|| -|1042|Flower Planting With No Adjacent||50.1%|Medium|| -|1043|Partition Array for Maximum Sum||70.9%|Medium|| -|1044|Longest Duplicate Substring||30.9%|Hard|| +|1038|Binary Search Tree to Greater Sum Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree)|85.3%|Medium|| +|1039|Minimum Score Triangulation of Polygon||54.2%|Medium|| +|1040|Moving Stones Until Consecutive II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II)|55.7%|Medium|| +|1041|Robot Bounded In Circle||55.3%|Medium|| +|1042|Flower Planting With No Adjacent||50.3%|Medium|| +|1043|Partition Array for Maximum Sum||71.0%|Medium|| +|1044|Longest Duplicate Substring||30.7%|Hard|| |1045|Customers Who Bought All Products||67.6%|Medium|| -|1046|Last Stone Weight||64.5%|Easy|| -|1047|Remove All Adjacent Duplicates In String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String)|70.8%|Easy|| -|1048|Longest String Chain|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1048.Longest-String-Chain)|59.3%|Medium|| -|1049|Last Stone Weight II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II)|51.8%|Medium|| -|1050|Actors and Directors Who Cooperated At Least Three Times||72.8%|Easy|| -|1051|Height Checker|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1051.Height-Checker)|74.7%|Easy|| -|1052|Grumpy Bookstore Owner|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner)|56.8%|Medium|| -|1053|Previous Permutation With One Swap||51.2%|Medium|| -|1054|Distant Barcodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1054.Distant-Barcodes)|45.4%|Medium|| -|1055|Shortest Way to Form String||58.6%|Medium|| +|1046|Last Stone Weight||64.7%|Easy|| +|1047|Remove All Adjacent Duplicates In String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String)|70.6%|Easy|| +|1048|Longest String Chain|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1048.Longest-String-Chain)|59.2%|Medium|| +|1049|Last Stone Weight II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II)|52.1%|Medium|| +|1050|Actors and Directors Who Cooperated At Least Three Times||72.7%|Easy|| +|1051|Height Checker|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1051.Height-Checker)|74.9%|Easy|| +|1052|Grumpy Bookstore Owner|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner)|56.9%|Medium|| +|1053|Previous Permutation With One Swap||50.9%|Medium|| +|1054|Distant Barcodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1054.Distant-Barcodes)|45.6%|Medium|| +|1055|Shortest Way to Form String||58.9%|Medium|| |1056|Confusing Number||46.0%|Easy|| -|1057|Campus Bikes||57.9%|Medium|| -|1058|Minimize Rounding Error to Meet Target||44.8%|Medium|| -|1059|All Paths from Source Lead to Destination||41.4%|Medium|| -|1060|Missing Element in Sorted Array||54.8%|Medium|| -|1061|Lexicographically Smallest Equivalent String||69.9%|Medium|| +|1057|Campus Bikes||57.8%|Medium|| +|1058|Minimize Rounding Error to Meet Target||44.9%|Medium|| +|1059|All Paths from Source Lead to Destination||41.0%|Medium|| +|1060|Missing Element in Sorted Array||54.6%|Medium|| +|1061|Lexicographically Smallest Equivalent String||70.2%|Medium|| |1062|Longest Repeating Substring||59.1%|Medium|| -|1063|Number of Valid Subarrays||73.9%|Hard|| +|1063|Number of Valid Subarrays||74.0%|Hard|| |1064|Fixed Point||63.6%|Easy|| -|1065|Index Pairs of a String||62.8%|Easy|| +|1065|Index Pairs of a String||63.0%|Easy|| |1066|Campus Bikes II||54.6%|Medium|| -|1067|Digit Count in Range||43.7%|Hard|| +|1067|Digit Count in Range||44.4%|Hard|| |1068|Product Sales Analysis I||80.7%|Easy|| -|1069|Product Sales Analysis II||82.2%|Easy|| -|1070|Product Sales Analysis III||49.4%|Medium|| -|1071|Greatest Common Divisor of Strings||51.2%|Easy|| +|1069|Product Sales Analysis II||82.1%|Easy|| +|1070|Product Sales Analysis III||49.3%|Medium|| +|1071|Greatest Common Divisor of Strings||51.0%|Easy|| |1072|Flip Columns For Maximum Number of Equal Rows||63.3%|Medium|| |1073|Adding Two Negabinary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers)|36.2%|Medium|| |1074|Number of Submatrices That Sum to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target)|69.8%|Hard|| -|1075|Project Employees I||67.1%|Easy|| -|1076|Project Employees II||51.2%|Easy|| -|1077|Project Employees III||78.6%|Medium|| -|1078|Occurrences After Bigram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1078.Occurrences-After-Bigram)|64.1%|Easy|| -|1079|Letter Tile Possibilities|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities)|76.2%|Medium|| -|1080|Insufficient Nodes in Root to Leaf Paths||52.4%|Medium|| -|1081|Smallest Subsequence of Distinct Characters||57.2%|Medium|| -|1082|Sales Analysis I||75.3%|Easy|| +|1075|Project Employees I||67.2%|Easy|| +|1076|Project Employees II||51.1%|Easy|| +|1077|Project Employees III||78.7%|Medium|| +|1078|Occurrences After Bigram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1078.Occurrences-After-Bigram)|64.0%|Easy|| +|1079|Letter Tile Possibilities|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities)|76.1%|Medium|| +|1080|Insufficient Nodes in Root to Leaf Paths||52.6%|Medium|| +|1081|Smallest Subsequence of Distinct Characters||57.4%|Medium|| +|1082|Sales Analysis I||75.4%|Easy|| |1083|Sales Analysis II||50.5%|Easy|| -|1084|Sales Analysis III||53.5%|Easy|| +|1084|Sales Analysis III||52.7%|Easy|| |1085|Sum of Digits in the Minimum Number||75.8%|Easy|| |1086|High Five||75.3%|Easy|| -|1087|Brace Expansion||66.0%|Medium|| +|1087|Brace Expansion||66.1%|Medium|| |1088|Confusing Number II||46.6%|Hard|| -|1089|Duplicate Zeros|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1089.Duplicate-Zeros)|51.4%|Easy|| -|1090|Largest Values From Labels||60.7%|Medium|| +|1089|Duplicate Zeros|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1089.Duplicate-Zeros)|51.5%|Easy|| +|1090|Largest Values From Labels||60.9%|Medium|| |1091|Shortest Path in Binary Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1091.Shortest-Path-in-Binary-Matrix)|44.5%|Medium|| -|1092|Shortest Common Supersequence||57.1%|Hard|| -|1093|Statistics from a Large Sample|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1093.Statistics-from-a-Large-Sample)|45.2%|Medium|| -|1094|Car Pooling||57.7%|Medium|| +|1092|Shortest Common Supersequence||57.6%|Hard|| +|1093|Statistics from a Large Sample|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1093.Statistics-from-a-Large-Sample)|44.9%|Medium|| +|1094|Car Pooling||57.5%|Medium|| |1095|Find in Mountain Array||35.8%|Hard|| -|1096|Brace Expansion II||63.3%|Hard|| -|1097|Game Play Analysis V||55.3%|Hard|| +|1096|Brace Expansion II||63.4%|Hard|| +|1097|Game Play Analysis V||55.2%|Hard|| |1098|Unpopular Books||45.2%|Medium|| -|1099|Two Sum Less Than K||60.5%|Easy|| +|1099|Two Sum Less Than K||60.4%|Easy|| |1100|Find K-Length Substrings With No Repeated Characters||74.7%|Medium|| -|1101|The Earliest Moment When Everyone Become Friends||64.4%|Medium|| -|1102|Path With Maximum Minimum Value||53.2%|Medium|| -|1103|Distribute Candies to People||63.8%|Easy|| -|1104|Path In Zigzag Labelled Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree)|74.7%|Medium|| -|1105|Filling Bookcase Shelves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1105.Filling-Bookcase-Shelves)|58.3%|Medium|| -|1106|Parsing A Boolean Expression||58.8%|Hard|| +|1101|The Earliest Moment When Everyone Become Friends||64.7%|Medium|| +|1102|Path With Maximum Minimum Value||53.3%|Medium|| +|1103|Distribute Candies to People||63.9%|Easy|| +|1104|Path In Zigzag Labelled Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1104.Path-In-Zigzag-Labelled-Binary-Tree)|74.8%|Medium|| +|1105|Filling Bookcase Shelves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1105.Filling-Bookcase-Shelves)|58.6%|Medium|| +|1106|Parsing A Boolean Expression||58.4%|Hard|| |1107|New Users Daily Count||45.7%|Medium|| -|1108|Defanging an IP Address|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1108.Defanging-an-IP-Address)|89.2%|Easy|| -|1109|Corporate Flight Bookings||59.5%|Medium|| +|1108|Defanging an IP Address|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1108.Defanging-an-IP-Address)|89.3%|Easy|| +|1109|Corporate Flight Bookings||60.0%|Medium|| |1110|Delete Nodes And Return Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1110.Delete-Nodes-And-Return-Forest)|69.3%|Medium|| -|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings)|73.3%|Medium|| +|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings)|73.2%|Medium|| |1112|Highest Grade For Each Student||73.9%|Medium|| |1113|Reported Posts||66.2%|Easy|| -|1114|Print in Order||68.2%|Easy|| -|1115|Print FooBar Alternately||61.2%|Medium|| -|1116|Print Zero Even Odd||59.7%|Medium|| -|1117|Building H2O||55.4%|Medium|| +|1114|Print in Order||68.1%|Easy|| +|1115|Print FooBar Alternately||61.4%|Medium|| +|1116|Print Zero Even Odd||59.9%|Medium|| +|1117|Building H2O||55.3%|Medium|| |1118|Number of Days in a Month||56.6%|Easy|| -|1119|Remove Vowels from a String||90.8%|Easy|| -|1120|Maximum Average Subtree||65.3%|Medium|| -|1121|Divide Array Into Increasing Sequences||59.9%|Hard|| -|1122|Relative Sort Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array)|68.3%|Easy|| -|1123|Lowest Common Ancestor of Deepest Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves)|70.4%|Medium|| -|1124|Longest Well-Performing Interval||34.4%|Medium|| -|1125|Smallest Sufficient Team||47.3%|Hard|| -|1126|Active Businesses||67.8%|Medium|| -|1127|User Purchase Platform||51.2%|Hard|| -|1128|Number of Equivalent Domino Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1128.Number-of-Equivalent-Domino-Pairs)|46.5%|Easy|| -|1129|Shortest Path with Alternating Colors||42.5%|Medium|| +|1119|Remove Vowels from a String||90.7%|Easy|| +|1120|Maximum Average Subtree||65.4%|Medium|| +|1121|Divide Array Into Increasing Sequences||60.0%|Hard|| +|1122|Relative Sort Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array)|68.4%|Easy|| +|1123|Lowest Common Ancestor of Deepest Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves)|70.5%|Medium|| +|1124|Longest Well-Performing Interval||34.5%|Medium|| +|1125|Smallest Sufficient Team||47.1%|Hard|| +|1126|Active Businesses||67.9%|Medium|| +|1127|User Purchase Platform||51.3%|Hard|| +|1128|Number of Equivalent Domino Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1128.Number-of-Equivalent-Domino-Pairs)|46.8%|Easy|| +|1129|Shortest Path with Alternating Colors||42.6%|Medium|| |1130|Minimum Cost Tree From Leaf Values||68.5%|Medium|| -|1131|Maximum of Absolute Value Expression||49.6%|Medium|| -|1132|Reported Posts II||33.7%|Medium|| -|1133|Largest Unique Number||67.4%|Easy|| -|1134|Armstrong Number||78.2%|Easy|| -|1135|Connecting Cities With Minimum Cost||60.9%|Medium|| +|1131|Maximum of Absolute Value Expression||49.5%|Medium|| +|1132|Reported Posts II||33.6%|Medium|| +|1133|Largest Unique Number||67.5%|Easy|| +|1134|Armstrong Number||78.1%|Easy|| +|1135|Connecting Cities With Minimum Cost||61.1%|Medium|| |1136|Parallel Courses||61.9%|Medium|| -|1137|N-th Tribonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number)|63.2%|Easy|| +|1137|N-th Tribonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number)|63.3%|Easy|| |1138|Alphabet Board Path||52.3%|Medium|| |1139|Largest 1-Bordered Square||49.8%|Medium|| |1140|Stone Game II||64.8%|Medium|| -|1141|User Activity for the Past 30 Days I||50.6%|Easy|| -|1142|User Activity for the Past 30 Days II||35.9%|Easy|| -|1143|Longest Common Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1143.Longest-Common-Subsequence)|59.0%|Medium|| -|1144|Decrease Elements To Make Array Zigzag||47.0%|Medium|| +|1141|User Activity for the Past 30 Days I||50.3%|Easy|| +|1142|User Activity for the Past 30 Days II||36.0%|Easy|| +|1143|Longest Common Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1143.Longest-Common-Subsequence)|58.8%|Medium|| +|1144|Decrease Elements To Make Array Zigzag||47.1%|Medium|| |1145|Binary Tree Coloring Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game)|51.4%|Medium|| -|1146|Snapshot Array||37.2%|Medium|| +|1146|Snapshot Array||37.3%|Medium|| |1147|Longest Chunked Palindrome Decomposition||60.0%|Hard|| -|1148|Article Views I||76.9%|Easy|| +|1148|Article Views I||77.0%|Easy|| |1149|Article Views II||47.7%|Medium|| -|1150|Check If a Number Is Majority Element in a Sorted Array||56.7%|Easy|| -|1151|Minimum Swaps to Group All 1's Together||60.6%|Medium|| +|1150|Check If a Number Is Majority Element in a Sorted Array||56.8%|Easy|| +|1151|Minimum Swaps to Group All 1's Together||60.8%|Medium|| |1152|Analyze User Website Visit Pattern||43.5%|Medium|| |1153|String Transforms Into Another String||35.4%|Hard|| -|1154|Day of the Year|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year)|50.6%|Easy|| -|1155|Number of Dice Rolls With Target Sum||48.0%|Medium|| -|1156|Swap For Longest Repeated Character Substring||45.8%|Medium|| -|1157|Online Majority Element In Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray)|42.2%|Hard|| -|1158|Market Analysis I||65.3%|Medium|| -|1159|Market Analysis II||58.4%|Hard|| +|1154|Day of the Year|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year)|50.5%|Easy|| +|1155|Number of Dice Rolls With Target Sum||48.1%|Medium|| +|1156|Swap For Longest Repeated Character Substring||45.6%|Medium|| +|1157|Online Majority Element In Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray)|42.1%|Hard|| +|1158|Market Analysis I||64.2%|Medium|| +|1159|Market Analysis II||58.6%|Hard|| |1160|Find Words That Can Be Formed by Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters)|67.8%|Easy|| -|1161|Maximum Level Sum of a Binary Tree||66.4%|Medium|| -|1162|As Far from Land as Possible||48.3%|Medium|| -|1163|Last Substring in Lexicographical Order||35.4%|Hard|| +|1161|Maximum Level Sum of a Binary Tree||66.2%|Medium|| +|1162|As Far from Land as Possible||48.5%|Medium|| +|1163|Last Substring in Lexicographical Order||35.2%|Hard|| |1164|Product Price at a Given Date||68.5%|Medium|| |1165|Single-Row Keyboard||85.7%|Easy|| -|1166|Design File System||61.9%|Medium|| -|1167|Minimum Cost to Connect Sticks||67.4%|Medium|| -|1168|Optimize Water Distribution in a Village||64.2%|Hard|| -|1169|Invalid Transactions||30.1%|Medium|| -|1170|Compare Strings by Frequency of the Smallest Character|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character)|61.2%|Medium|| -|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List)|42.8%|Medium|| -|1172|Dinner Plate Stacks||33.9%|Hard|| -|1173|Immediate Food Delivery I||83.3%|Easy|| -|1174|Immediate Food Delivery II||63.8%|Medium|| -|1175|Prime Arrangements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1175.Prime-Arrangements)|53.2%|Easy|| -|1176|Diet Plan Performance||52.6%|Easy|| -|1177|Can Make Palindrome from Substring||37.6%|Medium|| -|1178|Number of Valid Words for Each Puzzle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle)|46.7%|Hard|| -|1179|Reformat Department Table||82.5%|Easy|| -|1180|Count Substrings with Only One Distinct Letter||78.9%|Easy|| -|1181|Before and After Puzzle||45.0%|Medium|| +|1166|Design File System||61.8%|Medium|| +|1167|Minimum Cost to Connect Sticks||67.6%|Medium|| +|1168|Optimize Water Distribution in a Village||64.3%|Hard|| +|1169|Invalid Transactions||30.5%|Medium|| +|1170|Compare Strings by Frequency of the Smallest Character|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character)|61.3%|Medium|| +|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List)|42.9%|Medium|| +|1172|Dinner Plate Stacks||33.8%|Hard|| +|1173|Immediate Food Delivery I||83.4%|Easy|| +|1174|Immediate Food Delivery II||63.7%|Medium|| +|1175|Prime Arrangements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1175.Prime-Arrangements)|53.4%|Easy|| +|1176|Diet Plan Performance||52.4%|Easy|| +|1177|Can Make Palindrome from Substring||37.8%|Medium|| +|1178|Number of Valid Words for Each Puzzle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1178.Number-of-Valid-Words-for-Each-Puzzle)|46.6%|Hard|| +|1179|Reformat Department Table||82.6%|Easy|| +|1180|Count Substrings with Only One Distinct Letter||79.0%|Easy|| +|1181|Before and After Puzzle||45.1%|Medium|| |1182|Shortest Distance to Target Color||55.5%|Medium|| -|1183|Maximum Number of Ones||60.5%|Hard|| +|1183|Maximum Number of Ones||60.7%|Hard|| |1184|Distance Between Bus Stops|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1184.Distance-Between-Bus-Stops)|54.1%|Easy|| -|1185|Day of the Week|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week)|58.1%|Easy|| -|1186|Maximum Subarray Sum with One Deletion||41.1%|Medium|| -|1187|Make Array Strictly Increasing||45.0%|Hard|| +|1185|Day of the Week|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week)|57.9%|Easy|| +|1186|Maximum Subarray Sum with One Deletion||41.2%|Medium|| +|1187|Make Array Strictly Increasing||45.1%|Hard|| |1188|Design Bounded Blocking Queue||72.9%|Medium|| -|1189|Maximum Number of Balloons|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons)|62.4%|Easy|| -|1190|Reverse Substrings Between Each Pair of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses)|65.8%|Medium|| -|1191|K-Concatenation Maximum Sum||24.1%|Medium|| -|1192|Critical Connections in a Network||54.4%|Hard|| -|1193|Monthly Transactions I||67.4%|Medium|| +|1189|Maximum Number of Balloons|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons)|62.3%|Easy|| +|1190|Reverse Substrings Between Each Pair of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses)|65.9%|Medium|| +|1191|K-Concatenation Maximum Sum||24.0%|Medium|| +|1192|Critical Connections in a Network||54.5%|Hard|| +|1193|Monthly Transactions I||67.5%|Medium|| |1194|Tournament Winners||51.9%|Hard|| -|1195|Fizz Buzz Multithreaded||72.4%|Medium|| -|1196|How Many Apples Can You Put into the Basket||67.3%|Easy|| +|1195|Fizz Buzz Multithreaded||72.3%|Medium|| +|1196|How Many Apples Can You Put into the Basket||67.1%|Easy|| |1197|Minimum Knight Moves||39.9%|Medium|| |1198|Find Smallest Common Element in All Rows||76.1%|Medium|| -|1199|Minimum Time to Build Blocks||40.5%|Hard|| +|1199|Minimum Time to Build Blocks||40.7%|Hard|| |1200|Minimum Absolute Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1200.Minimum-Absolute-Difference)|69.8%|Easy|| -|1201|Ugly Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III)|28.5%|Medium|| -|1202|Smallest String With Swaps|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1202.Smallest-String-With-Swaps)|57.3%|Medium|| -|1203|Sort Items by Groups Respecting Dependencies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies)|49.9%|Hard|| -|1204|Last Person to Fit in the Bus||73.8%|Medium|| -|1205|Monthly Transactions II||44.4%|Medium|| -|1206|Design Skiplist||60.1%|Hard|| -|1207|Unique Number of Occurrences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences)|71.7%|Easy|| -|1208|Get Equal Substrings Within Budget|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1208.Get-Equal-Substrings-Within-Budget)|47.0%|Medium|| -|1209|Remove All Adjacent Duplicates in String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II)|56.1%|Medium|| -|1210|Minimum Moves to Reach Target with Rotations||48.4%|Hard|| -|1211|Queries Quality and Percentage||71.3%|Easy|| -|1212|Team Scores in Football Tournament||57.5%|Medium|| +|1201|Ugly Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III)|28.6%|Medium|| +|1202|Smallest String With Swaps|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1202.Smallest-String-With-Swaps)|57.4%|Medium|| +|1203|Sort Items by Groups Respecting Dependencies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies)|50.2%|Hard|| +|1204|Last Person to Fit in the Bus||74.1%|Medium|| +|1205|Monthly Transactions II||43.9%|Medium|| +|1206|Design Skiplist||60.5%|Hard|| +|1207|Unique Number of Occurrences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences)|71.1%|Easy|| +|1208|Get Equal Substrings Within Budget|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1208.Get-Equal-Substrings-Within-Budget)|47.3%|Medium|| +|1209|Remove All Adjacent Duplicates in String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II)|56.0%|Medium|| +|1210|Minimum Moves to Reach Target with Rotations||48.8%|Hard|| +|1211|Queries Quality and Percentage||71.7%|Easy|| +|1212|Team Scores in Football Tournament||57.6%|Medium|| |1213|Intersection of Three Sorted Arrays||80.0%|Easy|| -|1214|Two Sum BSTs||66.4%|Medium|| -|1215|Stepping Numbers||45.6%|Medium|| -|1216|Valid Palindrome III||50.5%|Hard|| -|1217|Minimum Cost to Move Chips to The Same Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position)|72.5%|Easy|| -|1218|Longest Arithmetic Subsequence of Given Difference||51.9%|Medium|| -|1219|Path with Maximum Gold||65.1%|Medium|| -|1220|Count Vowels Permutation||56.2%|Hard|| -|1221|Split a String in Balanced Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1221.Split-a-String-in-Balanced-Strings)|84.5%|Easy|| -|1222|Queens That Can Attack the King||71.4%|Medium|| -|1223|Dice Roll Simulation||48.1%|Hard|| -|1224|Maximum Equal Frequency||36.6%|Hard|| -|1225|Report Contiguous Dates||63.7%|Hard|| -|1226|The Dining Philosophers||57.0%|Medium|| -|1227|Airplane Seat Assignment Probability||64.5%|Medium|| -|1228|Missing Number In Arithmetic Progression||51.2%|Easy|| -|1229|Meeting Scheduler||55.3%|Medium|| -|1230|Toss Strange Coins||53.1%|Medium|| -|1231|Divide Chocolate||56.6%|Hard|| -|1232|Check If It Is a Straight Line|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1232.Check-If-It-Is-a-Straight-Line)|41.5%|Easy|| -|1233|Remove Sub-Folders from the Filesystem||65.2%|Medium|| -|1234|Replace the Substring for Balanced String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1234.Replace-the-Substring-for-Balanced-String)|36.6%|Medium|| +|1214|Two Sum BSTs||66.3%|Medium|| +|1215|Stepping Numbers||45.7%|Medium|| +|1216|Valid Palindrome III||50.3%|Hard|| +|1217|Minimum Cost to Move Chips to The Same Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position)|72.3%|Easy|| +|1218|Longest Arithmetic Subsequence of Given Difference||51.8%|Medium|| +|1219|Path with Maximum Gold||64.8%|Medium|| +|1220|Count Vowels Permutation||60.8%|Hard|| +|1221|Split a String in Balanced Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1221.Split-a-String-in-Balanced-Strings)|84.6%|Easy|| +|1222|Queens That Can Attack the King||71.6%|Medium|| +|1223|Dice Roll Simulation||48.3%|Hard|| +|1224|Maximum Equal Frequency||36.8%|Hard|| +|1225|Report Contiguous Dates||63.5%|Hard|| +|1226|The Dining Philosophers||56.9%|Medium|| +|1227|Airplane Seat Assignment Probability||64.8%|Medium|| +|1228|Missing Number In Arithmetic Progression||51.3%|Easy|| +|1229|Meeting Scheduler||55.4%|Medium|| +|1230|Toss Strange Coins||53.3%|Medium|| +|1231|Divide Chocolate||56.8%|Hard|| +|1232|Check If It Is a Straight Line|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1232.Check-If-It-Is-a-Straight-Line)|41.3%|Easy|| +|1233|Remove Sub-Folders from the Filesystem||65.4%|Medium|| +|1234|Replace the Substring for Balanced String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1234.Replace-the-Substring-for-Balanced-String)|36.7%|Medium|| |1235|Maximum Profit in Job Scheduling|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1235.Maximum-Profit-in-Job-Scheduling)|51.0%|Hard|| -|1236|Web Crawler||65.9%|Medium|| +|1236|Web Crawler||66.1%|Medium|| |1237|Find Positive Integer Solution for a Given Equation||69.3%|Medium|| -|1238|Circular Permutation in Binary Representation||68.5%|Medium|| -|1239|Maximum Length of a Concatenated String with Unique Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters)|50.6%|Medium|| -|1240|Tiling a Rectangle with the Fewest Squares||53.8%|Hard|| -|1241|Number of Comments per Post||67.9%|Easy|| +|1238|Circular Permutation in Binary Representation||68.7%|Medium|| +|1239|Maximum Length of a Concatenated String with Unique Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters)|50.5%|Medium|| +|1240|Tiling a Rectangle with the Fewest Squares||53.9%|Hard|| +|1241|Number of Comments per Post||68.0%|Easy|| |1242|Web Crawler Multithreaded||48.9%|Medium|| -|1243|Array Transformation||50.5%|Easy|| -|1244|Design A Leaderboard||68.2%|Medium|| -|1245|Tree Diameter||61.9%|Medium|| -|1246|Palindrome Removal||45.8%|Hard|| +|1243|Array Transformation||50.7%|Easy|| +|1244|Design A Leaderboard||68.5%|Medium|| +|1245|Tree Diameter||61.7%|Medium|| +|1246|Palindrome Removal||45.9%|Hard|| |1247|Minimum Swaps to Make Strings Equal||63.7%|Medium|| -|1248|Count Number of Nice Subarrays||59.0%|Medium|| +|1248|Count Number of Nice Subarrays||59.2%|Medium|| |1249|Minimum Remove to Make Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses)|65.6%|Medium|| -|1250|Check If It Is a Good Array||58.4%|Hard|| -|1251|Average Selling Price||83.4%|Easy|| +|1250|Check If It Is a Good Array||58.6%|Hard|| +|1251|Average Selling Price||83.5%|Easy|| |1252|Cells with Odd Values in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix)|78.5%|Easy|| -|1253|Reconstruct a 2-Row Binary Matrix||43.6%|Medium|| -|1254|Number of Closed Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1254.Number-of-Closed-Islands)|63.8%|Medium|| -|1255|Maximum Score Words Formed by Letters||72.4%|Hard|| +|1253|Reconstruct a 2-Row Binary Matrix||43.7%|Medium|| +|1254|Number of Closed Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1254.Number-of-Closed-Islands)|64.1%|Medium|| +|1255|Maximum Score Words Formed by Letters||72.5%|Hard|| |1256|Encode Number||69.8%|Medium|| -|1257|Smallest Common Region||63.8%|Medium|| -|1258|Synonymous Sentences||56.8%|Medium|| +|1257|Smallest Common Region||64.0%|Medium|| +|1258|Synonymous Sentences||56.6%|Medium|| |1259|Handshakes That Don't Cross||56.2%|Hard|| -|1260|Shift 2D Grid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1260.Shift-2D-Grid)|68.1%|Easy|| -|1261|Find Elements in a Contaminated Binary Tree||75.7%|Medium|| +|1260|Shift 2D Grid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1260.Shift-2D-Grid)|68.0%|Easy|| +|1261|Find Elements in a Contaminated Binary Tree||76.0%|Medium|| |1262|Greatest Sum Divisible by Three||50.9%|Medium|| -|1263|Minimum Moves to Move a Box to Their Target Location||48.8%|Hard|| -|1264|Page Recommendations||67.8%|Medium|| +|1263|Minimum Moves to Move a Box to Their Target Location||49.0%|Hard|| +|1264|Page Recommendations||68.0%|Medium|| |1265|Print Immutable Linked List in Reverse||94.3%|Medium|| -|1266|Minimum Time Visiting All Points|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1266.Minimum-Time-Visiting-All-Points)|79.1%|Easy|| -|1267|Count Servers that Communicate||58.9%|Medium|| -|1268|Search Suggestions System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1268.Search-Suggestions-System)|67.0%|Medium|| +|1266|Minimum Time Visiting All Points|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1266.Minimum-Time-Visiting-All-Points)|79.2%|Easy|| +|1267|Count Servers that Communicate||59.0%|Medium|| +|1268|Search Suggestions System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1268.Search-Suggestions-System)|66.7%|Medium|| |1269|Number of Ways to Stay in the Same Place After Some Steps||43.5%|Hard|| |1270|All People Report to the Given Manager||88.0%|Medium|| -|1271|Hexspeak||56.7%|Easy|| -|1272|Remove Interval||61.7%|Medium|| -|1273|Delete Tree Nodes||61.1%|Medium|| -|1274|Number of Ships in a Rectangle||68.9%|Hard|| -|1275|Find Winner on a Tic Tac Toe Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1275.Find-Winner-on-a-Tic-Tac-Toe-Game)|54.5%|Easy|| +|1271|Hexspeak||56.8%|Easy|| +|1272|Remove Interval||61.8%|Medium|| +|1273|Delete Tree Nodes||61.2%|Medium|| +|1274|Number of Ships in a Rectangle||69.2%|Hard|| +|1275|Find Winner on a Tic Tac Toe Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1275.Find-Winner-on-a-Tic-Tac-Toe-Game)|54.4%|Easy|| |1276|Number of Burgers with No Waste of Ingredients||50.6%|Medium|| -|1277|Count Square Submatrices with All Ones||74.3%|Medium|| +|1277|Count Square Submatrices with All Ones||74.4%|Medium|| |1278|Palindrome Partitioning III||60.7%|Hard|| -|1279|Traffic Light Controlled Intersection||74.7%|Easy|| -|1280|Students and Examinations||74.5%|Easy|| +|1279|Traffic Light Controlled Intersection||74.6%|Easy|| +|1280|Students and Examinations||74.7%|Easy|| |1281|Subtract the Product and Sum of Digits of an Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer)|86.6%|Easy|| -|1282|Group the People Given the Group Size They Belong To||85.4%|Medium|| -|1283|Find the Smallest Divisor Given a Threshold|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold)|54.6%|Medium|| +|1282|Group the People Given the Group Size They Belong To||85.6%|Medium|| +|1283|Find the Smallest Divisor Given a Threshold|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold)|55.0%|Medium|| |1284|Minimum Number of Flips to Convert Binary Matrix to Zero Matrix||72.0%|Hard|| |1285|Find the Start and End Number of Continuous Ranges||88.4%|Medium|| -|1286|Iterator for Combination||73.4%|Medium|| +|1286|Iterator for Combination||73.5%|Medium|| |1287|Element Appearing More Than 25% In Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1287.Element-Appearing-More-Than-25-In-Sorted-Array)|59.5%|Easy|| -|1288|Remove Covered Intervals||57.4%|Medium|| -|1289|Minimum Falling Path Sum II||60.3%|Hard|| +|1288|Remove Covered Intervals||57.3%|Medium|| +|1289|Minimum Falling Path Sum II||59.8%|Hard|| |1290|Convert Binary Number in a Linked List to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer)|82.6%|Easy|| |1291|Sequential Digits||61.1%|Medium|| -|1292|Maximum Side Length of a Square with Sum Less than or Equal to Threshold||52.9%|Medium|| +|1292|Maximum Side Length of a Square with Sum Less than or Equal to Threshold||53.0%|Medium|| |1293|Shortest Path in a Grid with Obstacles Elimination|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination)|43.6%|Hard|| -|1294|Weather Type in Each Country||67.8%|Easy|| +|1294|Weather Type in Each Country||68.0%|Easy|| |1295|Find Numbers with Even Number of Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits)|77.0%|Easy|| -|1296|Divide Array in Sets of K Consecutive Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers)|56.5%|Medium|| +|1296|Divide Array in Sets of K Consecutive Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers)|56.6%|Medium|| |1297|Maximum Number of Occurrences of a Substring||52.2%|Medium|| |1298|Maximum Candies You Can Get from Boxes||61.1%|Hard|| |1299|Replace Elements with Greatest Element on Right Side|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side)|74.6%|Easy|| |1300|Sum of Mutated Array Closest to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target)|43.1%|Medium|| |1301|Number of Paths with Max Score||38.8%|Hard|| -|1302|Deepest Leaves Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1302.Deepest-Leaves-Sum)|87.1%|Medium|| -|1303|Find the Team Size||91.0%|Easy|| +|1302|Deepest Leaves Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1302.Deepest-Leaves-Sum)|87.0%|Medium|| +|1303|Find the Team Size||90.9%|Easy|| |1304|Find N Unique Integers Sum up to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero)|77.1%|Easy|| |1305|All Elements in Two Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees)|79.7%|Medium|| -|1306|Jump Game III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1306.Jump-Game-III)|62.9%|Medium|| -|1307|Verbal Arithmetic Puzzle||34.3%|Hard|| -|1308|Running Total for Different Genders||88.3%|Medium|| -|1309|Decrypt String from Alphabet to Integer Mapping||79.1%|Easy|| -|1310|XOR Queries of a Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1310.XOR-Queries-of-a-Subarray)|71.7%|Medium|| -|1311|Get Watched Videos by Your Friends||45.4%|Medium|| -|1312|Minimum Insertion Steps to Make a String Palindrome||64.8%|Hard|| +|1306|Jump Game III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1306.Jump-Game-III)|63.0%|Medium|| +|1307|Verbal Arithmetic Puzzle||34.1%|Hard|| +|1308|Running Total for Different Genders||88.4%|Medium|| +|1309|Decrypt String from Alphabet to Integer Mapping||79.3%|Easy|| +|1310|XOR Queries of a Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1310.XOR-Queries-of-a-Subarray)|72.0%|Medium|| +|1311|Get Watched Videos by Your Friends||45.6%|Medium|| +|1312|Minimum Insertion Steps to Make a String Palindrome||65.4%|Hard|| |1313|Decompress Run-Length Encoded List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1313.Decompress-Run-Length-Encoded-List)|85.9%|Easy|| |1314|Matrix Block Sum||75.4%|Medium|| -|1315|Sum of Nodes with Even-Valued Grandparent||85.4%|Medium|| -|1316|Distinct Echo Substrings||49.7%|Hard|| -|1317|Convert Integer to the Sum of Two No-Zero Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers)|56.6%|Easy|| -|1318|Minimum Flips to Make a OR b Equal to c||65.7%|Medium|| -|1319|Number of Operations to Make Network Connected|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1319.Number-of-Operations-to-Make-Network-Connected)|58.1%|Medium|| -|1320|Minimum Distance to Type a Word Using Two Fingers||60.0%|Hard|| -|1321|Restaurant Growth||72.4%|Medium|| -|1322|Ads Performance||60.6%|Easy|| -|1323|Maximum 69 Number||79.0%|Easy|| -|1324|Print Words Vertically||59.8%|Medium|| +|1315|Sum of Nodes with Even-Valued Grandparent||85.5%|Medium|| +|1316|Distinct Echo Substrings||49.8%|Hard|| +|1317|Convert Integer to the Sum of Two No-Zero Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers)|56.4%|Easy|| +|1318|Minimum Flips to Make a OR b Equal to c||65.9%|Medium|| +|1319|Number of Operations to Make Network Connected|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1319.Number-of-Operations-to-Make-Network-Connected)|58.2%|Medium|| +|1320|Minimum Distance to Type a Word Using Two Fingers||59.9%|Hard|| +|1321|Restaurant Growth||72.2%|Medium|| +|1322|Ads Performance||60.7%|Easy|| +|1323|Maximum 69 Number||79.1%|Easy|| +|1324|Print Words Vertically||59.9%|Medium|| |1325|Delete Leaves With a Given Value||74.8%|Medium|| |1326|Minimum Number of Taps to Open to Water a Garden||47.8%|Hard|| -|1327|List the Products Ordered in a Period||77.2%|Easy|| -|1328|Break a Palindrome||52.2%|Medium|| -|1329|Sort the Matrix Diagonally|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1329.Sort-the-Matrix-Diagonally)|81.4%|Medium|| -|1330|Reverse Subarray To Maximize Array Value||39.4%|Hard|| -|1331|Rank Transform of an Array||58.6%|Easy|| -|1332|Remove Palindromic Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1332.Remove-Palindromic-Subsequences)|75.9%|Easy|| -|1333|Filter Restaurants by Vegan-Friendly, Price and Distance||59.1%|Medium|| -|1334|Find the City With the Smallest Number of Neighbors at a Threshold Distance||52.1%|Medium|| -|1335|Minimum Difficulty of a Job Schedule||56.0%|Hard|| -|1336|Number of Transactions per Visit||51.1%|Hard|| -|1337|The K Weakest Rows in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix)|73.7%|Easy|| -|1338|Reduce Array Size to The Half||68.3%|Medium|| -|1339|Maximum Product of Splitted Binary Tree||43.0%|Medium|| -|1340|Jump Game V||62.5%|Hard|| -|1341|Movie Rating||58.3%|Medium|| -|1342|Number of Steps to Reduce a Number to Zero||85.9%|Easy|| -|1343|Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold||67.9%|Medium|| +|1327|List the Products Ordered in a Period||77.1%|Easy|| +|1328|Break a Palindrome||52.0%|Medium|| +|1329|Sort the Matrix Diagonally|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1329.Sort-the-Matrix-Diagonally)|83.7%|Medium|| +|1330|Reverse Subarray To Maximize Array Value||39.8%|Hard|| +|1331|Rank Transform of an Array||58.8%|Easy|| +|1332|Remove Palindromic Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1332.Remove-Palindromic-Subsequences)|76.0%|Easy|| +|1333|Filter Restaurants by Vegan-Friendly, Price and Distance||59.3%|Medium|| +|1334|Find the City With the Smallest Number of Neighbors at a Threshold Distance||52.6%|Medium|| +|1335|Minimum Difficulty of a Job Schedule||55.9%|Hard|| +|1336|Number of Transactions per Visit||51.3%|Hard|| +|1337|The K Weakest Rows in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1337.The-K-Weakest-Rows-in-a-Matrix)|73.3%|Easy|| +|1338|Reduce Array Size to The Half||69.9%|Medium|| +|1339|Maximum Product of Splitted Binary Tree||43.1%|Medium|| +|1340|Jump Game V||62.6%|Hard|| +|1341|Movie Rating||58.4%|Medium|| +|1342|Number of Steps to Reduce a Number to Zero||85.7%|Easy|| +|1343|Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold||67.8%|Medium|| |1344|Angle Between Hands of a Clock||63.4%|Medium|| -|1345|Jump Game IV||44.2%|Hard|| -|1346|Check If N and Its Double Exist||35.8%|Easy|| -|1347|Minimum Number of Steps to Make Two Strings Anagram||76.7%|Medium|| -|1348|Tweet Counts Per Frequency||43.3%|Medium|| -|1349|Maximum Students Taking Exam||47.3%|Hard|| +|1345|Jump Game IV||44.1%|Hard|| +|1346|Check If N and Its Double Exist||35.9%|Easy|| +|1347|Minimum Number of Steps to Make Two Strings Anagram||76.9%|Medium|| +|1348|Tweet Counts Per Frequency||43.4%|Medium|| +|1349|Maximum Students Taking Exam||48.0%|Hard|| |1350|Students With Invalid Departments||90.5%|Easy|| |1351|Count Negative Numbers in a Sorted Matrix||75.2%|Easy|| -|1352|Product of the Last K Numbers||48.7%|Medium|| -|1353|Maximum Number of Events That Can Be Attended|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended)|33.3%|Medium|| +|1352|Product of the Last K Numbers||49.1%|Medium|| +|1353|Maximum Number of Events That Can Be Attended|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended)|33.0%|Medium|| |1354|Construct Target Array With Multiple Sums||36.3%|Hard|| -|1355|Activity Participants||74.5%|Medium|| -|1356|Sort Integers by The Number of 1 Bits||71.6%|Easy|| -|1357|Apply Discount Every n Orders||69.3%|Medium|| -|1358|Number of Substrings Containing All Three Characters||62.4%|Medium|| -|1359|Count All Valid Pickup and Delivery Options||63.2%|Hard|| -|1360|Number of Days Between Two Dates||47.0%|Easy|| -|1361|Validate Binary Tree Nodes||40.8%|Medium|| -|1362|Closest Divisors||59.5%|Medium|| -|1363|Largest Multiple of Three||33.8%|Hard|| +|1355|Activity Participants||74.4%|Medium|| +|1356|Sort Integers by The Number of 1 Bits||71.8%|Easy|| +|1357|Apply Discount Every n Orders||69.7%|Medium|| +|1358|Number of Substrings Containing All Three Characters||62.6%|Medium|| +|1359|Count All Valid Pickup and Delivery Options||63.0%|Hard|| +|1360|Number of Days Between Two Dates||47.3%|Easy|| +|1361|Validate Binary Tree Nodes||40.5%|Medium|| +|1362|Closest Divisors||59.6%|Medium|| +|1363|Largest Multiple of Three||33.6%|Hard|| |1364|Number of Trusted Contacts of a Customer||78.7%|Medium|| -|1365|How Many Numbers Are Smaller Than the Current Number||86.5%|Easy|| +|1365|How Many Numbers Are Smaller Than the Current Number||86.6%|Easy|| |1366|Rank Teams by Votes||58.6%|Medium|| -|1367|Linked List in Binary Tree||43.2%|Medium|| -|1368|Minimum Cost to Make at Least One Valid Path in a Grid||61.1%|Hard|| -|1369|Get the Second Most Recent Activity||69.5%|Hard|| -|1370|Increasing Decreasing String||77.7%|Easy|| -|1371|Find the Longest Substring Containing Vowels in Even Counts||62.8%|Medium|| -|1372|Longest ZigZag Path in a Binary Tree||59.2%|Medium|| +|1367|Linked List in Binary Tree||43.3%|Medium|| +|1368|Minimum Cost to Make at Least One Valid Path in a Grid||61.2%|Hard|| +|1369|Get the Second Most Recent Activity||69.6%|Hard|| +|1370|Increasing Decreasing String||77.6%|Easy|| +|1371|Find the Longest Substring Containing Vowels in Even Counts||63.0%|Medium|| +|1372|Longest ZigZag Path in a Binary Tree||59.6%|Medium|| |1373|Maximum Sum BST in Binary Tree||39.0%|Hard|| -|1374|Generate a String With Characters That Have Odd Counts||77.4%|Easy|| -|1375|Number of Times Binary String Is Prefix-Aligned||65.7%|Medium|| +|1374|Generate a String With Characters That Have Odd Counts||77.5%|Easy|| +|1375|Number of Times Binary String Is Prefix-Aligned||65.8%|Medium|| |1376|Time Needed to Inform All Employees||58.4%|Medium|| -|1377|Frog Position After T Seconds||36.2%|Hard|| -|1378|Replace Employee ID With The Unique Identifier||91.3%|Easy|| -|1379|Find a Corresponding Node of a Binary Tree in a Clone of That Tree||87.3%|Easy|| -|1380|Lucky Numbers in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1380.Lucky-Numbers-in-a-Matrix)|70.8%|Easy|| -|1381|Design a Stack With Increment Operation||77.3%|Medium|| -|1382|Balance a Binary Search Tree||80.4%|Medium|| -|1383|Maximum Performance of a Team|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1383.Maximum-Performance-of-a-Team)|41.6%|Hard|| -|1384|Total Sales Amount by Year||66.8%|Hard|| -|1385|Find the Distance Value Between Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1385.Find-the-Distance-Value-Between-Two-Arrays)|65.4%|Easy|| -|1386|Cinema Seat Allocation||40.3%|Medium|| -|1387|Sort Integers by The Power Value||69.7%|Medium|| -|1388|Pizza With 3n Slices||49.6%|Hard|| +|1377|Frog Position After T Seconds||36.1%|Hard|| +|1378|Replace Employee ID With The Unique Identifier||91.4%|Easy|| +|1379|Find a Corresponding Node of a Binary Tree in a Clone of That Tree||87.1%|Easy|| +|1380|Lucky Numbers in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1380.Lucky-Numbers-in-a-Matrix)|70.5%|Easy|| +|1381|Design a Stack With Increment Operation||77.4%|Medium|| +|1382|Balance a Binary Search Tree||80.6%|Medium|| +|1383|Maximum Performance of a Team|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1383.Maximum-Performance-of-a-Team)|43.3%|Hard|| +|1384|Total Sales Amount by Year||67.4%|Hard|| +|1385|Find the Distance Value Between Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1385.Find-the-Distance-Value-Between-Two-Arrays)|65.3%|Easy|| +|1386|Cinema Seat Allocation||40.7%|Medium|| +|1387|Sort Integers by The Power Value||69.8%|Medium|| +|1388|Pizza With 3n Slices||50.1%|Hard|| |1389|Create Target Array in the Given Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1389.Create-Target-Array-in-the-Given-Order)|85.7%|Easy|| -|1390|Four Divisors||40.9%|Medium|| +|1390|Four Divisors||41.2%|Medium|| |1391|Check if There is a Valid Path in a Grid||46.9%|Medium|| -|1392|Longest Happy Prefix||44.8%|Hard|| -|1393|Capital Gain/Loss||90.8%|Medium|| -|1394|Find Lucky Integer in an Array||63.6%|Easy|| -|1395|Count Number of Teams||68.9%|Medium|| +|1392|Longest Happy Prefix||44.9%|Hard|| +|1393|Capital Gain/Loss||91.0%|Medium|| +|1394|Find Lucky Integer in an Array||63.5%|Easy|| +|1395|Count Number of Teams||68.4%|Medium|| |1396|Design Underground System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1396.Design-Underground-System)|73.6%|Medium|| |1397|Find All Good Strings||42.1%|Hard|| -|1398|Customers Who Bought Products A and B but Not C||78.0%|Medium|| -|1399|Count Largest Group||67.0%|Easy|| -|1400|Construct K Palindrome Strings||63.6%|Medium|| -|1401|Circle and Rectangle Overlapping||44.0%|Medium|| -|1402|Reducing Dishes||72.3%|Hard|| +|1398|Customers Who Bought Products A and B but Not C||77.8%|Medium|| +|1399|Count Largest Group||67.1%|Easy|| +|1400|Construct K Palindrome Strings||63.4%|Medium|| +|1401|Circle and Rectangle Overlapping||44.1%|Medium|| +|1402|Reducing Dishes||72.1%|Hard|| |1403|Minimum Subsequence in Non-Increasing Order||72.2%|Easy|| -|1404|Number of Steps to Reduce a Number in Binary Representation to One||51.4%|Medium|| -|1405|Longest Happy String||57.0%|Medium|| -|1406|Stone Game III||60.1%|Hard|| -|1407|Top Travellers||75.2%|Easy|| -|1408|String Matching in an Array||63.9%|Easy|| -|1409|Queries on a Permutation With Key||83.1%|Medium|| -|1410|HTML Entity Parser||52.4%|Medium|| -|1411|Number of Ways to Paint N × 3 Grid||62.1%|Hard|| -|1412|Find the Quiet Students in All Exams||62.9%|Hard|| +|1404|Number of Steps to Reduce a Number in Binary Representation to One||51.7%|Medium|| +|1405|Longest Happy String||57.2%|Medium|| +|1406|Stone Game III||59.9%|Hard|| +|1407|Top Travellers||70.8%|Easy|| +|1408|String Matching in an Array||63.8%|Easy|| +|1409|Queries on a Permutation With Key||83.2%|Medium|| +|1410|HTML Entity Parser||52.2%|Medium|| +|1411|Number of Ways to Paint N × 3 Grid||62.2%|Hard|| +|1412|Find the Quiet Students in All Exams||63.1%|Hard|| |1413|Minimum Value to Get Positive Step by Step Sum||68.6%|Easy|| -|1414|Find the Minimum Number of Fibonacci Numbers Whose Sum Is K||65.3%|Medium|| -|1415|The k-th Lexicographical String of All Happy Strings of Length n||71.7%|Medium|| -|1416|Restore The Array||38.1%|Hard|| -|1417|Reformat The String||56.1%|Easy|| -|1418|Display Table of Food Orders in a Restaurant||73.1%|Medium|| -|1419|Minimum Number of Frogs Croaking||49.8%|Medium|| -|1420|Build Array Where You Can Find The Maximum Exactly K Comparisons||64.1%|Hard|| -|1421|NPV Queries||83.9%|Easy|| +|1414|Find the Minimum Number of Fibonacci Numbers Whose Sum Is K||65.4%|Medium|| +|1415|The k-th Lexicographical String of All Happy Strings of Length n||71.9%|Medium|| +|1416|Restore The Array||38.2%|Hard|| +|1417|Reformat The String||56.0%|Easy|| +|1418|Display Table of Food Orders in a Restaurant||73.6%|Medium|| +|1419|Minimum Number of Frogs Croaking||49.9%|Medium|| +|1420|Build Array Where You Can Find The Maximum Exactly K Comparisons||63.8%|Hard|| +|1421|NPV Queries||84.0%|Easy|| |1422|Maximum Score After Splitting a String||57.8%|Easy|| -|1423|Maximum Points You Can Obtain from Cards|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards)|52.4%|Medium|| -|1424|Diagonal Traverse II||50.1%|Medium|| -|1425|Constrained Subsequence Sum||46.9%|Hard|| +|1423|Maximum Points You Can Obtain from Cards|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1423.Maximum-Points-You-Can-Obtain-from-Cards)|52.3%|Medium|| +|1424|Diagonal Traverse II||50.2%|Medium|| +|1425|Constrained Subsequence Sum||47.3%|Hard|| |1426|Counting Elements||59.5%|Easy|| -|1427|Perform String Shifts||54.1%|Easy|| -|1428|Leftmost Column with at Least a One||52.8%|Medium|| -|1429|First Unique Number||52.5%|Medium|| -|1430|Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree||46.0%|Medium|| -|1431|Kids With the Greatest Number of Candies||87.7%|Easy|| -|1432|Max Difference You Can Get From Changing an Integer||43.1%|Medium|| -|1433|Check If a String Can Break Another String||68.6%|Medium|| -|1434|Number of Ways to Wear Different Hats to Each Other||42.5%|Hard|| -|1435|Create a Session Bar Chart||78.1%|Easy|| +|1427|Perform String Shifts||54.2%|Easy|| +|1428|Leftmost Column with at Least a One||52.9%|Medium|| +|1429|First Unique Number||52.6%|Medium|| +|1430|Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree||46.1%|Medium|| +|1431|Kids With the Greatest Number of Candies||87.6%|Easy|| +|1432|Max Difference You Can Get From Changing an Integer||43.0%|Medium|| +|1433|Check If a String Can Break Another String||68.7%|Medium|| +|1434|Number of Ways to Wear Different Hats to Each Other||42.7%|Hard|| +|1435|Create a Session Bar Chart||78.2%|Easy|| |1436|Destination City||77.7%|Easy|| -|1437|Check If All 1's Are at Least Length K Places Away|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away)|59.5%|Easy|| -|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit)|47.3%|Medium|| +|1437|Check If All 1's Are at Least Length K Places Away|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away)|59.3%|Easy|| +|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit)|47.8%|Medium|| |1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows)|61.4%|Hard|| -|1440|Evaluate Boolean Expression||76.0%|Medium|| -|1441|Build an Array With Stack Operations||71.2%|Easy|| -|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR)|75.2%|Medium|| -|1443|Minimum Time to Collect All Apples in a Tree||55.8%|Medium|| +|1440|Evaluate Boolean Expression||76.3%|Medium|| +|1441|Build an Array With Stack Operations||71.2%|Medium|| +|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR)|75.5%|Medium|| +|1443|Minimum Time to Collect All Apples in a Tree||55.9%|Medium|| |1444|Number of Ways of Cutting a Pizza||55.4%|Hard|| |1445|Apples & Oranges||91.5%|Medium|| |1446|Consecutive Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1446.Consecutive-Characters)|61.8%|Easy|| -|1447|Simplified Fractions||64.4%|Medium|| -|1448|Count Good Nodes in Binary Tree||73.0%|Medium|| -|1449|Form Largest Integer With Digits That Add up to Target||46.8%|Hard|| -|1450|Number of Students Doing Homework at a Given Time||76.2%|Easy|| -|1451|Rearrange Words in a Sentence||62.2%|Medium|| +|1447|Simplified Fractions||64.5%|Medium|| +|1448|Count Good Nodes in Binary Tree||74.7%|Medium|| +|1449|Form Largest Integer With Digits That Add up to Target||47.1%|Hard|| +|1450|Number of Students Doing Homework at a Given Time||76.0%|Easy|| +|1451|Rearrange Words in a Sentence||62.3%|Medium|| |1452|People Whose List of Favorite Companies Is Not a Subset of Another List||56.8%|Medium|| -|1453|Maximum Number of Darts Inside of a Circular Dartboard||36.6%|Hard|| +|1453|Maximum Number of Darts Inside of a Circular Dartboard||36.7%|Hard|| |1454|Active Users||38.3%|Medium|| -|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence)|64.4%|Easy|| -|1456|Maximum Number of Vowels in a Substring of Given Length||57.7%|Medium|| -|1457|Pseudo-Palindromic Paths in a Binary Tree||66.8%|Medium|| -|1458|Max Dot Product of Two Subsequences||45.7%|Hard|| -|1459|Rectangles Area||69.4%|Medium|| +|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence)|64.3%|Easy|| +|1456|Maximum Number of Vowels in a Substring of Given Length||57.8%|Medium|| +|1457|Pseudo-Palindromic Paths in a Binary Tree||66.5%|Medium|| +|1458|Max Dot Product of Two Subsequences||46.0%|Hard|| +|1459|Rectangles Area||69.8%|Medium|| |1460|Make Two Arrays Equal by Reversing Sub-arrays||72.3%|Easy|| |1461|Check If a String Contains All Binary Codes of Size K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K)|56.8%|Medium|| -|1462|Course Schedule IV||48.4%|Medium|| -|1463|Cherry Pickup II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1463.Cherry-Pickup-II)|70.5%|Hard|| -|1464|Maximum Product of Two Elements in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1464.Maximum-Product-of-Two-Elements-in-an-Array)|78.9%|Easy|| +|1462|Course Schedule IV||48.6%|Medium|| +|1463|Cherry Pickup II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1463.Cherry-Pickup-II)|70.3%|Hard|| +|1464|Maximum Product of Two Elements in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1464.Maximum-Product-of-Two-Elements-in-an-Array)|79.2%|Easy|| |1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts)|40.8%|Medium|| -|1466|Reorder Routes to Make All Paths Lead to the City Zero||61.4%|Medium|| -|1467|Probability of a Two Boxes Having The Same Number of Distinct Balls||61.0%|Hard|| -|1468|Calculate Salaries||81.9%|Medium|| -|1469|Find All The Lonely Nodes||81.7%|Easy|| -|1470|Shuffle the Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1470.Shuffle-the-Array)|88.4%|Easy|| -|1471|The k Strongest Values in an Array||59.9%|Medium|| -|1472|Design Browser History||75.4%|Medium|| -|1473|Paint House III||62.3%|Hard|| -|1474|Delete N Nodes After M Nodes of a Linked List||73.6%|Easy|| +|1466|Reorder Routes to Make All Paths Lead to the City Zero||61.7%|Medium|| +|1467|Probability of a Two Boxes Having The Same Number of Distinct Balls||60.8%|Hard|| +|1468|Calculate Salaries||81.8%|Medium|| +|1469|Find All The Lonely Nodes||81.6%|Easy|| +|1470|Shuffle the Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1470.Shuffle-the-Array)|88.5%|Easy|| +|1471|The k Strongest Values in an Array||60.0%|Medium|| +|1472|Design Browser History||75.7%|Medium|| +|1473|Paint House III||62.1%|Hard|| +|1474|Delete N Nodes After M Nodes of a Linked List||73.8%|Easy|| |1475|Final Prices With a Special Discount in a Shop||75.3%|Easy|| -|1476|Subrectangle Queries||88.3%|Medium|| +|1476|Subrectangle Queries||88.5%|Medium|| |1477|Find Two Non-overlapping Sub-arrays Each With Target Sum||37.0%|Medium|| -|1478|Allocate Mailboxes||55.3%|Hard|| -|1479|Sales by Day of the Week||82.5%|Hard|| -|1480|Running Sum of 1d Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1480.Running-Sum-of-1d-Array)|90.4%|Easy|| -|1481|Least Number of Unique Integers after K Removals||59.5%|Medium|| -|1482|Minimum Number of Days to Make m Bouquets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets)|56.7%|Medium|| -|1483|Kth Ancestor of a Tree Node||33.6%|Hard|| -|1484|Group Sold Products By The Date||84.3%|Easy|| -|1485|Clone Binary Tree With Random Pointer||79.6%|Medium|| +|1478|Allocate Mailboxes||55.2%|Hard|| +|1479|Sales by Day of the Week||82.3%|Hard|| +|1480|Running Sum of 1d Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1480.Running-Sum-of-1d-Array)|90.1%|Easy|| +|1481|Least Number of Unique Integers after K Removals||58.1%|Medium|| +|1482|Minimum Number of Days to Make m Bouquets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets)|56.8%|Medium|| +|1483|Kth Ancestor of a Tree Node||33.7%|Hard|| +|1484|Group Sold Products By The Date||84.4%|Easy|| +|1485|Clone Binary Tree With Random Pointer||79.5%|Medium|| |1486|XOR Operation in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1486.XOR-Operation-in-an-Array)|84.1%|Easy|| -|1487|Making File Names Unique||35.4%|Medium|| -|1488|Avoid Flood in The City||25.8%|Medium|| -|1489|Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree||53.2%|Hard|| -|1490|Clone N-ary Tree||83.7%|Medium|| -|1491|Average Salary Excluding the Minimum and Maximum Salary||63.9%|Easy|| -|1492|The kth Factor of n||62.1%|Medium|| -|1493|Longest Subarray of 1's After Deleting One Element||60.1%|Medium|| -|1494|Parallel Courses II||31.5%|Hard|| -|1495|Friendly Movies Streamed Last Month||50.2%|Easy|| +|1487|Making File Names Unique||35.5%|Medium|| +|1488|Avoid Flood in The City||26.0%|Medium|| +|1489|Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree||53.1%|Hard|| +|1490|Clone N-ary Tree||83.6%|Medium|| +|1491|Average Salary Excluding the Minimum and Maximum Salary||63.5%|Easy|| +|1492|The kth Factor of n||62.3%|Medium|| +|1493|Longest Subarray of 1's After Deleting One Element||60.0%|Medium|| +|1494|Parallel Courses II||31.3%|Hard|| +|1495|Friendly Movies Streamed Last Month||50.0%|Easy|| |1496|Path Crossing||55.8%|Easy|| -|1497|Check If Array Pairs Are Divisible by k||40.0%|Medium|| -|1498|Number of Subsequences That Satisfy the Given Sum Condition||38.9%|Medium|| +|1497|Check If Array Pairs Are Divisible by k||39.9%|Medium|| +|1498|Number of Subsequences That Satisfy the Given Sum Condition||38.6%|Medium|| |1499|Max Value of Equation||46.6%|Hard|| -|1500|Design a File Sharing System||44.8%|Medium|| +|1500|Design a File Sharing System||44.7%|Medium|| |1501|Countries You Can Safely Invest In||58.1%|Medium|| -|1502|Can Make Arithmetic Progression From Sequence||69.0%|Easy|| -|1503|Last Moment Before All Ants Fall Out of a Plank||55.0%|Medium|| -|1504|Count Submatrices With All Ones||58.2%|Medium|| -|1505|Minimum Possible Integer After at Most K Adjacent Swaps On Digits||37.8%|Hard|| -|1506|Find Root of N-Ary Tree||77.8%|Medium|| -|1507|Reformat Date||62.2%|Easy|| -|1508|Range Sum of Sorted Subarray Sums||59.3%|Medium|| -|1509|Minimum Difference Between Largest and Smallest Value in Three Moves||55.0%|Medium|| -|1510|Stone Game IV||60.7%|Hard|| -|1511|Customer Order Frequency||73.4%|Easy|| +|1502|Can Make Arithmetic Progression From Sequence||68.5%|Easy|| +|1503|Last Moment Before All Ants Fall Out of a Plank||55.2%|Medium|| +|1504|Count Submatrices With All Ones||58.0%|Medium|| +|1505|Minimum Possible Integer After at Most K Adjacent Swaps On Digits||38.0%|Hard|| +|1506|Find Root of N-Ary Tree||77.7%|Medium|| +|1507|Reformat Date||62.4%|Easy|| +|1508|Range Sum of Sorted Subarray Sums||59.5%|Medium|| +|1509|Minimum Difference Between Largest and Smallest Value in Three Moves||54.8%|Medium|| +|1510|Stone Game IV||60.6%|Hard|| +|1511|Customer Order Frequency||73.1%|Easy|| |1512|Number of Good Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1512.Number-of-Good-Pairs)|88.1%|Easy|| -|1513|Number of Substrings With Only 1s||44.8%|Medium|| -|1514|Path with Maximum Probability||47.6%|Medium|| -|1515|Best Position for a Service Centre||38.3%|Hard|| -|1516|Move Sub-Tree of N-Ary Tree||64.3%|Hard|| -|1517|Find Users With Valid E-Mails||59.0%|Easy|| +|1513|Number of Substrings With Only 1s||45.0%|Medium|| +|1514|Path with Maximum Probability||48.0%|Medium|| +|1515|Best Position for a Service Centre||38.4%|Hard|| +|1516|Move Sub-Tree of N-Ary Tree||63.9%|Hard|| +|1517|Find Users With Valid E-Mails||57.7%|Easy|| |1518|Water Bottles|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1518.Water-Bottles)|60.4%|Easy|| -|1519|Number of Nodes in the Sub-Tree With the Same Label||40.4%|Medium|| -|1520|Maximum Number of Non-Overlapping Substrings||37.6%|Hard|| -|1521|Find a Value of a Mysterious Function Closest to Target||43.6%|Hard|| -|1522|Diameter of N-Ary Tree||73.2%|Medium|| +|1519|Number of Nodes in the Sub-Tree With the Same Label||40.7%|Medium|| +|1520|Maximum Number of Non-Overlapping Substrings||37.8%|Hard|| +|1521|Find a Value of a Mysterious Function Closest to Target||43.5%|Hard|| +|1522|Diameter of N-Ary Tree||73.3%|Medium|| |1523|Count Odd Numbers in an Interval Range||46.6%|Easy|| -|1524|Number of Sub-arrays With Odd Sum||43.5%|Medium|| -|1525|Number of Good Ways to Split a String||69.8%|Medium|| -|1526|Minimum Number of Increments on Subarrays to Form a Target Array||68.3%|Hard|| -|1527|Patients With a Condition||44.0%|Easy|| -|1528|Shuffle String||85.8%|Easy|| +|1524|Number of Sub-arrays With Odd Sum||43.6%|Medium|| +|1525|Number of Good Ways to Split a String||69.6%|Medium|| +|1526|Minimum Number of Increments on Subarrays to Form a Target Array||68.5%|Hard|| +|1527|Patients With a Condition||43.3%|Easy|| +|1528|Shuffle String||85.7%|Easy|| |1529|Minimum Suffix Flips||72.4%|Medium|| |1530|Number of Good Leaf Nodes Pairs||60.2%|Medium|| -|1531|String Compression II||38.4%|Hard|| -|1532|The Most Recent Three Orders||70.9%|Medium|| +|1531|String Compression II||38.3%|Hard|| +|1532|The Most Recent Three Orders||71.0%|Medium|| |1533|Find the Index of the Large Integer||50.5%|Medium|| -|1534|Count Good Triplets||80.7%|Easy|| -|1535|Find the Winner of an Array Game||48.8%|Medium|| -|1536|Minimum Swaps to Arrange a Binary Grid||46.2%|Medium|| +|1534|Count Good Triplets||80.8%|Easy|| +|1535|Find the Winner of an Array Game||48.7%|Medium|| +|1536|Minimum Swaps to Arrange a Binary Grid||46.3%|Medium|| |1537|Get the Maximum Score||39.2%|Hard|| |1538|Guess the Majority in a Hidden Array||63.0%|Medium|| -|1539|Kth Missing Positive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1539.Kth-Missing-Positive-Number)|55.7%|Easy|| -|1540|Can Convert String in K Moves||32.8%|Medium|| -|1541|Minimum Insertions to Balance a Parentheses String||49.6%|Medium|| -|1542|Find Longest Awesome Substring||41.3%|Hard|| -|1543|Fix Product Name Format||62.7%|Easy|| -|1544|Make The String Great||56.7%|Easy|| +|1539|Kth Missing Positive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1539.Kth-Missing-Positive-Number)|55.8%|Easy|| +|1540|Can Convert String in K Moves||33.0%|Medium|| +|1541|Minimum Insertions to Balance a Parentheses String||49.7%|Medium|| +|1542|Find Longest Awesome Substring||41.5%|Hard|| +|1543|Fix Product Name Format||62.6%|Easy|| +|1544|Make The String Great||56.8%|Easy|| |1545|Find Kth Bit in Nth Binary String||58.2%|Medium|| -|1546|Maximum Number of Non-Overlapping Subarrays With Sum Equals Target||47.0%|Medium|| -|1547|Minimum Cost to Cut a Stick||56.1%|Hard|| +|1546|Maximum Number of Non-Overlapping Subarrays With Sum Equals Target||47.2%|Medium|| +|1547|Minimum Cost to Cut a Stick||56.4%|Hard|| |1548|The Most Similar Path in a Graph||56.9%|Hard|| -|1549|The Most Recent Orders for Each Product||67.5%|Medium|| -|1550|Three Consecutive Odds||63.9%|Easy|| +|1549|The Most Recent Orders for Each Product||67.8%|Medium|| +|1550|Three Consecutive Odds||63.8%|Easy|| |1551|Minimum Operations to Make Array Equal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1551.Minimum-Operations-to-Make-Array-Equal)|81.0%|Medium|| -|1552|Magnetic Force Between Two Balls||56.1%|Medium|| -|1553|Minimum Number of Days to Eat N Oranges||33.5%|Hard|| -|1554|Strings Differ by One Character||45.7%|Medium|| -|1555|Bank Account Summary||53.2%|Medium|| -|1556|Thousand Separator||55.5%|Easy|| -|1557|Minimum Number of Vertices to Reach All Nodes||79.3%|Medium|| -|1558|Minimum Numbers of Function Calls to Make Target Array||64.2%|Medium|| +|1552|Magnetic Force Between Two Balls||56.6%|Medium|| +|1553|Minimum Number of Days to Eat N Oranges||34.0%|Hard|| +|1554|Strings Differ by One Character||44.2%|Medium|| +|1555|Bank Account Summary||53.0%|Medium|| +|1556|Thousand Separator||55.2%|Easy|| +|1557|Minimum Number of Vertices to Reach All Nodes||79.5%|Medium|| +|1558|Minimum Numbers of Function Calls to Make Target Array||64.3%|Medium|| |1559|Detect Cycles in 2D Grid||48.1%|Medium|| |1560|Most Visited Sector in a Circular Track||58.4%|Easy|| |1561|Maximum Number of Coins You Can Get||78.5%|Medium|| -|1562|Find Latest Group of Size M||41.6%|Medium|| +|1562|Find Latest Group of Size M||42.3%|Medium|| |1563|Stone Game V||40.7%|Hard|| -|1564|Put Boxes Into the Warehouse I||67.0%|Medium|| -|1565|Unique Orders and Customers Per Month||83.5%|Easy|| -|1566|Detect Pattern of Length M Repeated K or More Times||43.5%|Easy|| -|1567|Maximum Length of Subarray With Positive Product||43.4%|Medium|| -|1568|Minimum Number of Days to Disconnect Island||47.9%|Hard|| -|1569|Number of Ways to Reorder Array to Get Same BST||48.8%|Hard|| +|1564|Put Boxes Into the Warehouse I||67.2%|Medium|| +|1565|Unique Orders and Customers Per Month||83.6%|Easy|| +|1566|Detect Pattern of Length M Repeated K or More Times||43.6%|Easy|| +|1567|Maximum Length of Subarray With Positive Product||43.5%|Medium|| +|1568|Minimum Number of Days to Disconnect Island||47.3%|Hard|| +|1569|Number of Ways to Reorder Array to Get Same BST||48.5%|Hard|| |1570|Dot Product of Two Sparse Vectors||90.3%|Medium|| -|1571|Warehouse Manager||90.1%|Easy|| -|1572|Matrix Diagonal Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1572.Matrix-Diagonal-Sum)|79.5%|Easy|| -|1573|Number of Ways to Split a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1573.Number-of-Ways-to-Split-a-String)|32.2%|Medium|| -|1574|Shortest Subarray to be Removed to Make Array Sorted||36.1%|Medium|| -|1575|Count All Possible Routes||57.3%|Hard|| -|1576|Replace All ?'s to Avoid Consecutive Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters)|49.4%|Easy|| -|1577|Number of Ways Where Square of Number Is Equal to Product of Two Numbers||39.6%|Medium|| +|1571|Warehouse Manager||90.2%|Easy|| +|1572|Matrix Diagonal Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1572.Matrix-Diagonal-Sum)|79.6%|Easy|| +|1573|Number of Ways to Split a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1573.Number-of-Ways-to-Split-a-String)|32.3%|Medium|| +|1574|Shortest Subarray to be Removed to Make Array Sorted||36.4%|Medium|| +|1575|Count All Possible Routes||56.9%|Hard|| +|1576|Replace All ?'s to Avoid Consecutive Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters)|49.3%|Easy|| +|1577|Number of Ways Where Square of Number Is Equal to Product of Two Numbers||39.7%|Medium|| |1578|Minimum Time to Make Rope Colorful||61.2%|Medium|| -|1579|Remove Max Number of Edges to Keep Graph Fully Traversable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable)|52.1%|Hard|| -|1580|Put Boxes Into the Warehouse II||63.6%|Medium|| -|1581|Customer Who Visited but Did Not Make Any Transactions||90.0%|Easy|| -|1582|Special Positions in a Binary Matrix||65.3%|Easy|| -|1583|Count Unhappy Friends||58.6%|Medium|| -|1584|Min Cost to Connect All Points||64.4%|Medium|| +|1579|Remove Max Number of Edges to Keep Graph Fully Traversable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable)|52.3%|Hard|| +|1580|Put Boxes Into the Warehouse II||63.5%|Medium|| +|1581|Customer Who Visited but Did Not Make Any Transactions||89.6%|Easy|| +|1582|Special Positions in a Binary Matrix||65.4%|Easy|| +|1583|Count Unhappy Friends||59.2%|Medium|| +|1584|Min Cost to Connect All Points||64.5%|Medium|| |1585|Check If String Is Transformable With Substring Sort Operations||48.4%|Hard|| -|1586|Binary Search Tree Iterator II||70.7%|Medium|| -|1587|Bank Account Summary II||90.2%|Easy|| +|1586|Binary Search Tree Iterator II||70.8%|Medium|| +|1587|Bank Account Summary II||90.5%|Easy|| |1588|Sum of All Odd Length Subarrays||83.6%|Easy|| |1589|Maximum Sum Obtained of Any Permutation||36.8%|Medium|| -|1590|Make Sum Divisible by P||28.1%|Medium|| -|1591|Strange Printer II||57.4%|Hard|| +|1590|Make Sum Divisible by P||28.2%|Medium|| +|1591|Strange Printer II||57.8%|Hard|| |1592|Rearrange Spaces Between Words||43.9%|Easy|| -|1593|Split a String Into the Max Number of Unique Substrings||54.9%|Medium|| -|1594|Maximum Non Negative Product in a Matrix||33.2%|Medium|| -|1595|Minimum Cost to Connect Two Groups of Points||46.1%|Hard|| -|1596|The Most Frequently Ordered Products for Each Customer||84.8%|Medium|| -|1597|Build Binary Expression Tree From Infix Expression||61.2%|Hard|| +|1593|Split a String Into the Max Number of Unique Substrings||55.0%|Medium|| +|1594|Maximum Non Negative Product in a Matrix||33.1%|Medium|| +|1595|Minimum Cost to Connect Two Groups of Points||46.3%|Hard|| +|1596|The Most Frequently Ordered Products for Each Customer||85.1%|Medium|| +|1597|Build Binary Expression Tree From Infix Expression||61.9%|Hard|| |1598|Crawler Log Folder||64.2%|Easy|| |1599|Maximum Profit of Operating a Centennial Wheel||43.8%|Medium|| -|1600|Throne Inheritance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1600.Throne-Inheritance)|63.6%|Medium|| -|1601|Maximum Number of Achievable Transfer Requests||51.0%|Hard|| +|1600|Throne Inheritance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1600.Throne-Inheritance)|63.8%|Medium|| +|1601|Maximum Number of Achievable Transfer Requests||51.2%|Hard|| |1602|Find Nearest Right Node in Binary Tree||75.3%|Medium|| -|1603|Design Parking System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1603.Design-Parking-System)|87.8%|Easy|| -|1604|Alert Using Same Key-Card Three or More Times in a One Hour Period||47.2%|Medium|| +|1603|Design Parking System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1603.Design-Parking-System)|87.9%|Easy|| +|1604|Alert Using Same Key-Card Three or More Times in a One Hour Period||47.3%|Medium|| |1605|Find Valid Matrix Given Row and Column Sums||78.1%|Medium|| -|1606|Find Servers That Handled Most Number of Requests||41.7%|Hard|| -|1607|Sellers With No Sales||55.1%|Easy|| -|1608|Special Array With X Elements Greater Than or Equal X|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X)|60.4%|Easy|| -|1609|Even Odd Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1609.Even-Odd-Tree)|53.3%|Medium|| +|1606|Find Servers That Handled Most Number of Requests||42.5%|Hard|| +|1607|Sellers With No Sales||55.3%|Easy|| +|1608|Special Array With X Elements Greater Than or Equal X|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X)|60.2%|Easy|| +|1609|Even Odd Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1609.Even-Odd-Tree)|53.5%|Medium|| |1610|Maximum Number of Visible Points||37.3%|Hard|| -|1611|Minimum One Bit Operations to Make Integers Zero||62.8%|Hard|| +|1611|Minimum One Bit Operations to Make Integers Zero||63.0%|Hard|| |1612|Check If Two Expression Trees are Equivalent||69.8%|Medium|| -|1613|Find the Missing IDs||75.9%|Medium|| +|1613|Find the Missing IDs||75.8%|Medium|| |1614|Maximum Nesting Depth of the Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses)|82.6%|Easy|| -|1615|Maximal Network Rank||57.6%|Medium|| -|1616|Split Two Strings to Make Palindrome||31.4%|Medium|| -|1617|Count Subtrees With Max Distance Between Cities||65.8%|Hard|| -|1618|Maximum Font to Fit a Sentence in a Screen||58.8%|Medium|| +|1615|Maximal Network Rank||57.9%|Medium|| +|1616|Split Two Strings to Make Palindrome||31.3%|Medium|| +|1617|Count Subtrees With Max Distance Between Cities||65.7%|Hard|| +|1618|Maximum Font to Fit a Sentence in a Screen||58.9%|Medium|| |1619|Mean of Array After Removing Some Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements)|64.5%|Easy|| -|1620|Coordinate With Maximum Network Quality||37.1%|Medium|| -|1621|Number of Sets of K Non-Overlapping Line Segments||42.4%|Medium|| -|1622|Fancy Sequence||15.7%|Hard|| -|1623|All Valid Triplets That Can Represent a Country||88.1%|Easy|| -|1624|Largest Substring Between Two Equal Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters)|59.3%|Easy|| -|1625|Lexicographically Smallest String After Applying Operations||65.8%|Medium|| -|1626|Best Team With No Conflicts||41.0%|Medium|| -|1627|Graph Connectivity With Threshold||45.2%|Hard|| -|1628|Design an Expression Tree With Evaluate Function||82.1%|Medium|| -|1629|Slowest Key|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1629.Slowest-Key)|59.5%|Easy|| -|1630|Arithmetic Subarrays||79.4%|Medium|| -|1631|Path With Minimum Effort|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1631.Path-With-Minimum-Effort)|55.2%|Medium|| +|1620|Coordinate With Maximum Network Quality||37.2%|Medium|| +|1621|Number of Sets of K Non-Overlapping Line Segments||42.3%|Medium|| +|1622|Fancy Sequence||15.8%|Hard|| +|1623|All Valid Triplets That Can Represent a Country||88.2%|Easy|| +|1624|Largest Substring Between Two Equal Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1624.Largest-Substring-Between-Two-Equal-Characters)|59.0%|Easy|| +|1625|Lexicographically Smallest String After Applying Operations||66.0%|Medium|| +|1626|Best Team With No Conflicts||41.1%|Medium|| +|1627|Graph Connectivity With Threshold||45.3%|Hard|| +|1628|Design an Expression Tree With Evaluate Function||82.5%|Medium|| +|1629|Slowest Key|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1629.Slowest-Key)|59.4%|Easy|| +|1630|Arithmetic Subarrays||79.7%|Medium|| +|1631|Path With Minimum Effort|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1631.Path-With-Minimum-Effort)|55.3%|Medium|| |1632|Rank Transform of a Matrix||40.8%|Hard|| -|1633|Percentage of Users Attended a Contest||69.0%|Easy|| -|1634|Add Two Polynomials Represented as Linked Lists||53.7%|Medium|| -|1635|Hopper Company Queries I||53.2%|Hard|| +|1633|Percentage of Users Attended a Contest||69.2%|Easy|| +|1634|Add Two Polynomials Represented as Linked Lists||53.5%|Medium|| +|1635|Hopper Company Queries I||53.0%|Hard|| |1636|Sort Array by Increasing Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1636.Sort-Array-by-Increasing-Frequency)|68.4%|Easy|| |1637|Widest Vertical Area Between Two Points Containing No Points||84.1%|Medium|| -|1638|Count Substrings That Differ by One Character||71.7%|Medium|| -|1639|Number of Ways to Form a Target String Given a Dictionary||42.6%|Hard|| +|1638|Count Substrings That Differ by One Character||71.6%|Medium|| +|1639|Number of Ways to Form a Target String Given a Dictionary||42.8%|Hard|| |1640|Check Array Formation Through Concatenation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1640.Check-Array-Formation-Through-Concatenation)|56.0%|Easy|| -|1641|Count Sorted Vowel Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1641.Count-Sorted-Vowel-Strings)|77.6%|Medium|| +|1641|Count Sorted Vowel Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1641.Count-Sorted-Vowel-Strings)|77.4%|Medium|| |1642|Furthest Building You Can Reach|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1642.Furthest-Building-You-Can-Reach)|48.2%|Medium|| -|1643|Kth Smallest Instructions||46.0%|Hard|| -|1644|Lowest Common Ancestor of a Binary Tree II||59.0%|Medium|| +|1643|Kth Smallest Instructions||46.2%|Hard|| +|1644|Lowest Common Ancestor of a Binary Tree II||59.2%|Medium|| |1645|Hopper Company Queries II||38.8%|Hard|| -|1646|Get Maximum in Generated Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1646.Get-Maximum-in-Generated-Array)|50.5%|Easy|| -|1647|Minimum Deletions to Make Character Frequencies Unique|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique)|59.4%|Medium|| -|1648|Sell Diminishing-Valued Colored Balls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls)|30.9%|Medium|| +|1646|Get Maximum in Generated Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1646.Get-Maximum-in-Generated-Array)|50.3%|Easy|| +|1647|Minimum Deletions to Make Character Frequencies Unique|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique)|59.3%|Medium|| +|1648|Sell Diminishing-Valued Colored Balls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls)|30.7%|Medium|| |1649|Create Sorted Array through Instructions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1649.Create-Sorted-Array-through-Instructions)|37.2%|Hard|| -|1650|Lowest Common Ancestor of a Binary Tree III||77.4%|Medium|| -|1651|Hopper Company Queries III||67.6%|Hard|| +|1650|Lowest Common Ancestor of a Binary Tree III||77.3%|Medium|| +|1651|Hopper Company Queries III||67.9%|Hard|| |1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|61.0%|Easy|| -|1653|Minimum Deletions to Make String Balanced|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced)|58.0%|Medium|| -|1654|Minimum Jumps to Reach Home|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1654.Minimum-Jumps-to-Reach-Home)|28.0%|Medium|| +|1653|Minimum Deletions to Make String Balanced|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced)|58.3%|Medium|| +|1654|Minimum Jumps to Reach Home|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1654.Minimum-Jumps-to-Reach-Home)|28.4%|Medium|| |1655|Distribute Repeating Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1655.Distribute-Repeating-Integers)|39.9%|Hard|| -|1656|Design an Ordered Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1656.Design-an-Ordered-Stream)|84.2%|Easy|| -|1657|Determine if Two Strings Are Close|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1657.Determine-if-Two-Strings-Are-Close)|54.4%|Medium|| -|1658|Minimum Operations to Reduce X to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero)|37.7%|Medium|| -|1659|Maximize Grid Happiness|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1659.Maximize-Grid-Happiness)|38.1%|Hard|| -|1660|Correct a Binary Tree||72.5%|Medium|| -|1661|Average Time of Process per Machine||79.7%|Easy|| -|1662|Check If Two String Arrays are Equivalent|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent)|81.9%|Easy|| +|1656|Design an Ordered Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1656.Design-an-Ordered-Stream)|84.8%|Easy|| +|1657|Determine if Two Strings Are Close|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1657.Determine-if-Two-Strings-Are-Close)|54.3%|Medium|| +|1658|Minimum Operations to Reduce X to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero)|37.6%|Medium|| +|1659|Maximize Grid Happiness|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1659.Maximize-Grid-Happiness)|38.3%|Hard|| +|1660|Correct a Binary Tree||72.4%|Medium|| +|1661|Average Time of Process per Machine||79.4%|Easy|| +|1662|Check If Two String Arrays are Equivalent|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent)|81.8%|Easy|| |1663|Smallest String With A Given Numeric Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value)|67.1%|Medium|| -|1664|Ways to Make a Fair Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1664.Ways-to-Make-a-Fair-Array)|63.5%|Medium|| -|1665|Minimum Initial Energy to Finish Tasks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks)|55.9%|Hard|| -|1666|Change the Root of a Binary Tree||68.9%|Medium|| -|1667|Fix Names in a Table||65.4%|Easy|| -|1668|Maximum Repeating Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1668.Maximum-Repeating-Substring)|39.7%|Easy|| -|1669|Merge In Between Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1669.Merge-In-Between-Linked-Lists)|74.5%|Medium|| -|1670|Design Front Middle Back Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1670.Design-Front-Middle-Back-Queue)|56.1%|Medium|| -|1671|Minimum Number of Removals to Make Mountain Array||42.8%|Hard|| -|1672|Richest Customer Wealth|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1672.Richest-Customer-Wealth)|88.9%|Easy|| -|1673|Find the Most Competitive Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1673.Find-the-Most-Competitive-Subsequence)|48.9%|Medium|| -|1674|Minimum Moves to Make Array Complementary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary)|38.5%|Medium|| -|1675|Minimize Deviation in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1675.Minimize-Deviation-in-Array)|52.3%|Hard|| -|1676|Lowest Common Ancestor of a Binary Tree IV||79.6%|Medium|| -|1677|Product's Worth Over Invoices||40.0%|Easy|| -|1678|Goal Parser Interpretation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1678.Goal-Parser-Interpretation)|85.9%|Easy|| -|1679|Max Number of K-Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1679.Max-Number-of-K-Sum-Pairs)|57.5%|Medium|| -|1680|Concatenation of Consecutive Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers)|52.5%|Medium|| -|1681|Minimum Incompatibility|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1681.Minimum-Incompatibility)|37.3%|Hard|| -|1682|Longest Palindromic Subsequence II||50.5%|Medium|| +|1664|Ways to Make a Fair Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1664.Ways-to-Make-a-Fair-Array)|63.6%|Medium|| +|1665|Minimum Initial Energy to Finish Tasks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks)|56.0%|Hard|| +|1666|Change the Root of a Binary Tree||69.1%|Medium|| +|1667|Fix Names in a Table||66.5%|Easy|| +|1668|Maximum Repeating Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1668.Maximum-Repeating-Substring)|39.6%|Easy|| +|1669|Merge In Between Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1669.Merge-In-Between-Linked-Lists)|74.6%|Medium|| +|1670|Design Front Middle Back Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1670.Design-Front-Middle-Back-Queue)|56.2%|Medium|| +|1671|Minimum Number of Removals to Make Mountain Array||42.6%|Hard|| +|1672|Richest Customer Wealth|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1672.Richest-Customer-Wealth)|88.6%|Easy|| +|1673|Find the Most Competitive Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1673.Find-the-Most-Competitive-Subsequence)|49.2%|Medium|| +|1674|Minimum Moves to Make Array Complementary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary)|38.4%|Medium|| +|1675|Minimize Deviation in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1675.Minimize-Deviation-in-Array)|52.2%|Hard|| +|1676|Lowest Common Ancestor of a Binary Tree IV||79.4%|Medium|| +|1677|Product's Worth Over Invoices||39.6%|Easy|| +|1678|Goal Parser Interpretation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1678.Goal-Parser-Interpretation)|86.0%|Easy|| +|1679|Max Number of K-Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1679.Max-Number-of-K-Sum-Pairs)|57.4%|Medium|| +|1680|Concatenation of Consecutive Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers)|52.4%|Medium|| +|1681|Minimum Incompatibility|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1681.Minimum-Incompatibility)|37.5%|Hard|| +|1682|Longest Palindromic Subsequence II||50.2%|Medium|| |1683|Invalid Tweets||91.1%|Easy|| |1684|Count the Number of Consistent Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1684.Count-the-Number-of-Consistent-Strings)|81.8%|Easy|| -|1685|Sum of Absolute Differences in a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array)|65.6%|Medium|| -|1686|Stone Game VI||54.1%|Medium|| -|1687|Delivering Boxes from Storage to Ports||38.2%|Hard|| -|1688|Count of Matches in Tournament|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1688.Count-of-Matches-in-Tournament)|83.0%|Easy|| -|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers)|90.0%|Medium|| +|1685|Sum of Absolute Differences in a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array)|65.5%|Medium|| +|1686|Stone Game VI||54.3%|Medium|| +|1687|Delivering Boxes from Storage to Ports||38.5%|Hard|| +|1688|Count of Matches in Tournament|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1688.Count-of-Matches-in-Tournament)|83.1%|Easy|| +|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers)|89.8%|Medium|| |1690|Stone Game VII|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1690.Stone-Game-VII)|58.8%|Medium|| -|1691|Maximum Height by Stacking Cuboids|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1691.Maximum-Height-by-Stacking-Cuboids)|54.4%|Hard|| -|1692|Count Ways to Distribute Candies||61.7%|Hard|| -|1693|Daily Leads and Partners||91.5%|Easy|| -|1694|Reformat Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1694.Reformat-Phone-Number)|64.9%|Easy|| +|1691|Maximum Height by Stacking Cuboids|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1691.Maximum-Height-by-Stacking-Cuboids)|54.3%|Hard|| +|1692|Count Ways to Distribute Candies||61.9%|Hard|| +|1693|Daily Leads and Partners||90.7%|Easy|| +|1694|Reformat Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1694.Reformat-Phone-Number)|64.8%|Easy|| |1695|Maximum Erasure Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1695.Maximum-Erasure-Value)|57.8%|Medium|| -|1696|Jump Game VI|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1696.Jump-Game-VI)|46.4%|Medium|| -|1697|Checking Existence of Edge Length Limited Paths||49.6%|Hard|| -|1698|Number of Distinct Substrings in a String||61.1%|Medium|| +|1696|Jump Game VI|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1696.Jump-Game-VI)|46.3%|Medium|| +|1697|Checking Existence of Edge Length Limited Paths||50.0%|Hard|| +|1698|Number of Distinct Substrings in a String||62.0%|Medium|| |1699|Number of Calls Between Two Persons||85.8%|Medium|| |1700|Number of Students Unable to Eat Lunch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch)|67.7%|Easy|| -|1701|Average Waiting Time||62.0%|Medium|| -|1702|Maximum Binary String After Change||45.7%|Medium|| -|1703|Minimum Adjacent Swaps for K Consecutive Ones||41.6%|Hard|| -|1704|Determine if String Halves Are Alike|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1704.Determine-if-String-Halves-Are-Alike)|77.7%|Easy|| -|1705|Maximum Number of Eaten Apples|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1705.Maximum-Number-of-Eaten-Apples)|37.0%|Medium|| -|1706|Where Will the Ball Fall||66.3%|Medium|| -|1707|Maximum XOR With an Element From Array||44.0%|Hard|| -|1708|Largest Subarray Length K||63.9%|Easy|| -|1709|Biggest Window Between Visits||77.4%|Medium|| -|1710|Maximum Units on a Truck|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1710.Maximum-Units-on-a-Truck)|74.4%|Easy|| -|1711|Count Good Meals||28.6%|Medium|| -|1712|Ways to Split Array Into Three Subarrays||32.2%|Medium|| -|1713|Minimum Operations to Make a Subsequence||49.1%|Hard|| -|1714|Sum Of Special Evenly-Spaced Elements In Array||50.9%|Hard|| +|1701|Average Waiting Time||62.2%|Medium|| +|1702|Maximum Binary String After Change||45.9%|Medium|| +|1703|Minimum Adjacent Swaps for K Consecutive Ones||41.4%|Hard|| +|1704|Determine if String Halves Are Alike|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1704.Determine-if-String-Halves-Are-Alike)|77.6%|Easy|| +|1705|Maximum Number of Eaten Apples|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1705.Maximum-Number-of-Eaten-Apples)|37.5%|Medium|| +|1706|Where Will the Ball Fall||66.0%|Medium|| +|1707|Maximum XOR With an Element From Array||44.2%|Hard|| +|1708|Largest Subarray Length K||63.6%|Easy|| +|1709|Biggest Window Between Visits||77.7%|Medium|| +|1710|Maximum Units on a Truck|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1710.Maximum-Units-on-a-Truck)|74.2%|Easy|| +|1711|Count Good Meals||28.8%|Medium|| +|1712|Ways to Split Array Into Three Subarrays||32.4%|Medium|| +|1713|Minimum Operations to Make a Subsequence||49.2%|Hard|| +|1714|Sum Of Special Evenly-Spaced Elements In Array||50.5%|Hard|| |1715|Count Apples and Oranges||78.0%|Medium|| -|1716|Calculate Money in Leetcode Bank|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1716.Calculate-Money-in-Leetcode-Bank)|64.9%|Easy|| -|1717|Maximum Score From Removing Substrings||45.7%|Medium|| -|1718|Construct the Lexicographically Largest Valid Sequence||51.8%|Medium|| -|1719|Number Of Ways To Reconstruct A Tree||42.4%|Hard|| +|1716|Calculate Money in Leetcode Bank|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1716.Calculate-Money-in-Leetcode-Bank)|65.0%|Easy|| +|1717|Maximum Score From Removing Substrings||45.9%|Medium|| +|1718|Construct the Lexicographically Largest Valid Sequence||51.6%|Medium|| +|1719|Number Of Ways To Reconstruct A Tree||42.5%|Hard|| |1720|Decode XORed Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1720.Decode-XORed-Array)|85.9%|Easy|| -|1721|Swapping Nodes in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1721.Swapping-Nodes-in-a-Linked-List)|68.0%|Medium|| -|1722|Minimize Hamming Distance After Swap Operations||48.3%|Medium|| -|1723|Find Minimum Time to Finish All Jobs||42.6%|Hard|| -|1724|Checking Existence of Edge Length Limited Paths II||51.6%|Hard|| -|1725|Number Of Rectangles That Can Form The Largest Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square)|78.8%|Easy|| -|1726|Tuple with Same Product||60.6%|Medium|| -|1727|Largest Submatrix With Rearrangements||60.7%|Medium|| -|1728|Cat and Mouse II||41.2%|Hard|| -|1729|Find Followers Count||72.1%|Easy|| -|1730|Shortest Path to Get Food||54.2%|Medium|| -|1731|The Number of Employees Which Report to Each Employee||49.8%|Easy|| -|1732|Find the Highest Altitude|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1732.Find-the-Highest-Altitude)|78.8%|Easy|| -|1733|Minimum Number of People to Teach||41.0%|Medium|| -|1734|Decode XORed Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1734.Decode-XORed-Permutation)|61.5%|Medium|| -|1735|Count Ways to Make Array With Product||49.6%|Hard|| -|1736|Latest Time by Replacing Hidden Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits)|42.0%|Easy|| -|1737|Change Minimum Characters to Satisfy One of Three Conditions||34.9%|Medium|| -|1738|Find Kth Largest XOR Coordinate Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value)|61.9%|Medium|| -|1739|Building Boxes||51.3%|Hard|| -|1740|Find Distance in a Binary Tree||68.9%|Medium|| -|1741|Find Total Time Spent by Each Employee||91.9%|Easy|| +|1721|Swapping Nodes in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1721.Swapping-Nodes-in-a-Linked-List)|67.9%|Medium|| +|1722|Minimize Hamming Distance After Swap Operations||48.5%|Medium|| +|1723|Find Minimum Time to Finish All Jobs||42.9%|Hard|| +|1724|Checking Existence of Edge Length Limited Paths II||51.5%|Hard|| +|1725|Number Of Rectangles That Can Form The Largest Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square)|78.7%|Easy|| +|1726|Tuple with Same Product||60.7%|Medium|| +|1727|Largest Submatrix With Rearrangements||60.8%|Medium|| +|1728|Cat and Mouse II||40.7%|Hard|| +|1729|Find Followers Count||71.8%|Easy|| +|1730|Shortest Path to Get Food||53.9%|Medium|| +|1731|The Number of Employees Which Report to Each Employee||50.1%|Easy|| +|1732|Find the Highest Altitude|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1732.Find-the-Highest-Altitude)|78.7%|Easy|| +|1733|Minimum Number of People to Teach||41.3%|Medium|| +|1734|Decode XORed Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1734.Decode-XORed-Permutation)|62.0%|Medium|| +|1735|Count Ways to Make Array With Product||48.9%|Hard|| +|1736|Latest Time by Replacing Hidden Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1736.Latest-Time-by-Replacing-Hidden-Digits)|42.1%|Easy|| +|1737|Change Minimum Characters to Satisfy One of Three Conditions||35.2%|Medium|| +|1738|Find Kth Largest XOR Coordinate Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value)|61.8%|Medium|| +|1739|Building Boxes||51.4%|Hard|| +|1740|Find Distance in a Binary Tree||68.7%|Medium|| +|1741|Find Total Time Spent by Each Employee||92.2%|Easy|| |1742|Maximum Number of Balls in a Box|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1742.Maximum-Number-of-Balls-in-a-Box)|73.8%|Easy|| -|1743|Restore the Array From Adjacent Pairs||68.4%|Medium|| -|1744|Can You Eat Your Favorite Candy on Your Favorite Day?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day)|32.6%|Medium|| -|1745|Palindrome Partitioning IV||47.5%|Hard|| -|1746|Maximum Subarray Sum After One Operation||62.0%|Medium|| -|1747|Leetflex Banned Accounts||68.0%|Medium|| -|1748|Sum of Unique Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1748.Sum-of-Unique-Elements)|75.6%|Easy|| -|1749|Maximum Absolute Sum of Any Subarray||57.7%|Medium|| -|1750|Minimum Length of String After Deleting Similar Ends||43.4%|Medium|| -|1751|Maximum Number of Events That Can Be Attended II||55.3%|Hard|| -|1752|Check if Array Is Sorted and Rotated|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated)|48.8%|Easy|| -|1753|Maximum Score From Removing Stones||65.8%|Medium|| -|1754|Largest Merge Of Two Strings||44.6%|Medium|| +|1743|Restore the Array From Adjacent Pairs||68.6%|Medium|| +|1744|Can You Eat Your Favorite Candy on Your Favorite Day?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day)|32.7%|Medium|| +|1745|Palindrome Partitioning IV||46.6%|Hard|| +|1746|Maximum Subarray Sum After One Operation||62.2%|Medium|| +|1747|Leetflex Banned Accounts||68.1%|Medium|| +|1748|Sum of Unique Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1748.Sum-of-Unique-Elements)|75.5%|Easy|| +|1749|Maximum Absolute Sum of Any Subarray||58.1%|Medium|| +|1750|Minimum Length of String After Deleting Similar Ends||43.5%|Medium|| +|1751|Maximum Number of Events That Can Be Attended II||55.5%|Hard|| +|1752|Check if Array Is Sorted and Rotated|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1752.Check-if-Array-Is-Sorted-and-Rotated)|49.1%|Easy|| +|1753|Maximum Score From Removing Stones||65.9%|Medium|| +|1754|Largest Merge Of Two Strings||44.8%|Medium|| |1755|Closest Subsequence Sum||36.5%|Hard|| -|1756|Design Most Recently Used Queue||78.6%|Medium|| +|1756|Design Most Recently Used Queue||78.7%|Medium|| |1757|Recyclable and Low Fat Products||94.0%|Easy|| -|1758|Minimum Changes To Make Alternating Binary String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String)|58.8%|Easy|| -|1759|Count Number of Homogenous Substrings||47.2%|Medium|| -|1760|Minimum Limit of Balls in a Bag||59.4%|Medium|| -|1761|Minimum Degree of a Connected Trio in a Graph||41.6%|Hard|| -|1762|Buildings With an Ocean View||79.5%|Medium|| -|1763|Longest Nice Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1763.Longest-Nice-Substring)|61.9%|Easy|| -|1764|Form Array by Concatenating Subarrays of Another Array||53.0%|Medium|| -|1765|Map of Highest Peak||60.2%|Medium|| +|1758|Minimum Changes To Make Alternating Binary String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1758.Minimum-Changes-To-Make-Alternating-Binary-String)|58.5%|Easy|| +|1759|Count Number of Homogenous Substrings||47.5%|Medium|| +|1760|Minimum Limit of Balls in a Bag||60.1%|Medium|| +|1761|Minimum Degree of a Connected Trio in a Graph||41.8%|Hard|| +|1762|Buildings With an Ocean View||79.3%|Medium|| +|1763|Longest Nice Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1763.Longest-Nice-Substring)|61.7%|Easy|| +|1764|Form Array by Concatenating Subarrays of Another Array||52.8%|Medium|| +|1765|Map of Highest Peak||60.4%|Medium|| |1766|Tree of Coprimes||38.4%|Hard|| -|1767|Find the Subtasks That Did Not Execute||84.2%|Hard|| -|1768|Merge Strings Alternately||75.8%|Easy|| +|1767|Find the Subtasks That Did Not Execute||84.3%|Hard|| +|1768|Merge Strings Alternately||75.9%|Easy|| |1769|Minimum Number of Operations to Move All Balls to Each Box||85.6%|Medium|| -|1770|Maximum Score from Performing Multiplication Operations||34.9%|Medium|| -|1771|Maximize Palindrome Length From Subsequences||34.9%|Hard|| -|1772|Sort Features by Popularity||65.4%|Medium|| -|1773|Count Items Matching a Rule||84.4%|Easy|| -|1774|Closest Dessert Cost||46.4%|Medium|| -|1775|Equal Sum Arrays With Minimum Number of Operations||52.2%|Medium|| -|1776|Car Fleet II||53.0%|Hard|| -|1777|Product's Price for Each Store||85.6%|Easy|| -|1778|Shortest Path in a Hidden Grid||40.7%|Medium|| -|1779|Find Nearest Point That Has the Same X or Y Coordinate||67.5%|Easy|| -|1780|Check if Number is a Sum of Powers of Three||65.1%|Medium|| -|1781|Sum of Beauty of All Substrings||60.1%|Medium|| +|1770|Maximum Score from Performing Multiplication Operations||34.6%|Medium|| +|1771|Maximize Palindrome Length From Subsequences||35.1%|Hard|| +|1772|Sort Features by Popularity||65.3%|Medium|| +|1773|Count Items Matching a Rule||84.3%|Easy|| +|1774|Closest Dessert Cost||46.7%|Medium|| +|1775|Equal Sum Arrays With Minimum Number of Operations||52.3%|Medium|| +|1776|Car Fleet II||53.2%|Hard|| +|1777|Product's Price for Each Store||85.4%|Easy|| +|1778|Shortest Path in a Hidden Grid||40.3%|Medium|| +|1779|Find Nearest Point That Has the Same X or Y Coordinate||67.4%|Easy|| +|1780|Check if Number is a Sum of Powers of Three||65.2%|Medium|| +|1781|Sum of Beauty of All Substrings||60.3%|Medium|| |1782|Count Pairs Of Nodes||37.9%|Hard|| -|1783|Grand Slam Titles||88.9%|Medium|| -|1784|Check if Binary String Has at Most One Segment of Ones||40.7%|Easy|| -|1785|Minimum Elements to Add to Form a Given Sum||42.0%|Medium|| -|1786|Number of Restricted Paths From First to Last Node||39.3%|Medium|| -|1787|Make the XOR of All Segments Equal to Zero||39.5%|Hard|| -|1788|Maximize the Beauty of the Garden||67.5%|Hard|| -|1789|Primary Department for Each Employee||79.7%|Easy|| -|1790|Check if One String Swap Can Make Strings Equal||45.6%|Easy|| -|1791|Find Center of Star Graph|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1791.Find-Center-of-Star-Graph)|83.5%|Easy|| -|1792|Maximum Average Pass Ratio||51.5%|Medium|| -|1793|Maximum Score of a Good Subarray||52.5%|Hard|| +|1783|Grand Slam Titles||89.0%|Medium|| +|1784|Check if Binary String Has at Most One Segment of Ones||40.5%|Easy|| +|1785|Minimum Elements to Add to Form a Given Sum||42.2%|Medium|| +|1786|Number of Restricted Paths From First to Last Node||39.0%|Medium|| +|1787|Make the XOR of All Segments Equal to Zero||39.7%|Hard|| +|1788|Maximize the Beauty of the Garden||66.8%|Hard|| +|1789|Primary Department for Each Employee||79.9%|Easy|| +|1790|Check if One String Swap Can Make Strings Equal||45.5%|Easy|| +|1791|Find Center of Star Graph|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1791.Find-Center-of-Star-Graph)|83.6%|Easy|| +|1792|Maximum Average Pass Ratio||51.9%|Medium|| +|1793|Maximum Score of a Good Subarray||52.9%|Hard|| |1794|Count Pairs of Equal Substrings With Minimum Difference||65.3%|Medium|| -|1795|Rearrange Products Table||90.7%|Easy|| +|1795|Rearrange Products Table||90.8%|Easy|| |1796|Second Largest Digit in a String||49.0%|Easy|| -|1797|Design Authentication Manager||55.3%|Medium|| -|1798|Maximum Number of Consecutive Values You Can Make||53.2%|Medium|| -|1799|Maximize Score After N Operations||46.0%|Hard|| -|1800|Maximum Ascending Subarray Sum||64.0%|Easy|| -|1801|Number of Orders in the Backlog||46.5%|Medium|| -|1802|Maximum Value at a Given Index in a Bounded Array||31.2%|Medium|| +|1797|Design Authentication Manager||55.9%|Medium|| +|1798|Maximum Number of Consecutive Values You Can Make||53.8%|Medium|| +|1799|Maximize Score After N Operations||45.9%|Hard|| +|1800|Maximum Ascending Subarray Sum||63.9%|Easy|| +|1801|Number of Orders in the Backlog||46.6%|Medium|| +|1802|Maximum Value at a Given Index in a Bounded Array||31.7%|Medium|| |1803|Count Pairs With XOR in a Range||46.4%|Hard|| -|1804|Implement Trie II (Prefix Tree)||59.9%|Medium|| -|1805|Number of Different Integers in a String||36.0%|Easy|| -|1806|Minimum Number of Operations to Reinitialize a Permutation||71.1%|Medium|| +|1804|Implement Trie II (Prefix Tree)||59.7%|Medium|| +|1805|Number of Different Integers in a String||36.1%|Easy|| +|1806|Minimum Number of Operations to Reinitialize a Permutation||71.3%|Medium|| |1807|Evaluate the Bracket Pairs of a String||66.6%|Medium|| -|1808|Maximize Number of Nice Divisors||30.8%|Hard|| -|1809|Ad-Free Sessions||59.8%|Easy|| -|1810|Minimum Path Cost in a Hidden Grid||53.4%|Medium|| -|1811|Find Interview Candidates||64.8%|Medium|| -|1812|Determine Color of a Chessboard Square||77.7%|Easy|| -|1813|Sentence Similarity III||32.8%|Medium|| -|1814|Count Nice Pairs in an Array||40.9%|Medium|| -|1815|Maximum Number of Groups Getting Fresh Donuts||39.9%|Hard|| -|1816|Truncate Sentence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1816.Truncate-Sentence)|81.5%|Easy|| +|1808|Maximize Number of Nice Divisors||31.0%|Hard|| +|1809|Ad-Free Sessions||59.9%|Easy|| +|1810|Minimum Path Cost in a Hidden Grid||53.2%|Medium|| +|1811|Find Interview Candidates||65.2%|Medium|| +|1812|Determine Color of a Chessboard Square||77.4%|Easy|| +|1813|Sentence Similarity III||33.0%|Medium|| +|1814|Count Nice Pairs in an Array||41.7%|Medium|| +|1815|Maximum Number of Groups Getting Fresh Donuts||40.0%|Hard|| +|1816|Truncate Sentence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1816.Truncate-Sentence)|81.7%|Easy|| |1817|Finding the Users Active Minutes||80.7%|Medium|| -|1818|Minimum Absolute Sum Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1818.Minimum-Absolute-Sum-Difference)|29.9%|Medium|| -|1819|Number of Different Subsequences GCDs||37.4%|Hard|| -|1820|Maximum Number of Accepted Invitations||48.5%|Medium|| -|1821|Find Customers With Positive Revenue this Year||89.6%|Easy|| -|1822|Sign of the Product of an Array||67.0%|Easy|| -|1823|Find the Winner of the Circular Game||77.0%|Medium|| -|1824|Minimum Sideway Jumps||49.6%|Medium|| -|1825|Finding MK Average||34.3%|Hard|| -|1826|Faulty Sensor||49.2%|Easy|| +|1818|Minimum Absolute Sum Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1818.Minimum-Absolute-Sum-Difference)|30.1%|Medium|| +|1819|Number of Different Subsequences GCDs||37.7%|Hard|| +|1820|Maximum Number of Accepted Invitations||49.2%|Medium|| +|1821|Find Customers With Positive Revenue this Year||89.4%|Easy|| +|1822|Sign of the Product of an Array||66.5%|Easy|| +|1823|Find the Winner of the Circular Game||77.2%|Medium|| +|1824|Minimum Sideway Jumps||49.7%|Medium|| +|1825|Finding MK Average||35.0%|Hard|| +|1826|Faulty Sensor||49.3%|Easy|| |1827|Minimum Operations to Make the Array Increasing||78.2%|Easy|| -|1828|Queries on Number of Points Inside a Circle||86.5%|Medium|| -|1829|Maximum XOR for Each Query||76.6%|Medium|| -|1830|Minimum Number of Operations to Make String Sorted||48.3%|Hard|| -|1831|Maximum Transaction Each Day||83.4%|Medium|| -|1832|Check if the Sentence Is Pangram||81.3%|Easy|| -|1833|Maximum Ice Cream Bars||65.1%|Medium|| -|1834|Single-Threaded CPU||41.6%|Medium|| -|1835|Find XOR Sum of All Pairs Bitwise AND||59.5%|Hard|| -|1836|Remove Duplicates From an Unsorted Linked List||69.2%|Medium|| -|1837|Sum of Digits in Base K||76.5%|Easy|| -|1838|Frequency of the Most Frequent Element||37.8%|Medium|| -|1839|Longest Substring Of All Vowels in Order||48.2%|Medium|| +|1828|Queries on Number of Points Inside a Circle||86.4%|Medium|| +|1829|Maximum XOR for Each Query||76.7%|Medium|| +|1830|Minimum Number of Operations to Make String Sorted||49.3%|Hard|| +|1831|Maximum Transaction Each Day||84.1%|Medium|| +|1832|Check if the Sentence Is Pangram||81.1%|Easy|| +|1833|Maximum Ice Cream Bars||65.3%|Medium|| +|1834|Single-Threaded CPU||41.8%|Medium|| +|1835|Find XOR Sum of All Pairs Bitwise AND||59.8%|Hard|| +|1836|Remove Duplicates From an Unsorted Linked List||69.4%|Medium|| +|1837|Sum of Digits in Base K||76.7%|Easy|| +|1838|Frequency of the Most Frequent Element||37.9%|Medium|| +|1839|Longest Substring Of All Vowels in Order||48.4%|Medium|| |1840|Maximum Building Height||35.2%|Hard|| -|1841|League Statistics||57.3%|Medium|| -|1842|Next Palindrome Using Same Digits||53.3%|Hard|| -|1843|Suspicious Bank Accounts||47.9%|Medium|| +|1841|League Statistics||57.4%|Medium|| +|1842|Next Palindrome Using Same Digits||53.9%|Hard|| +|1843|Suspicious Bank Accounts||48.2%|Medium|| |1844|Replace All Digits with Characters||79.8%|Easy|| -|1845|Seat Reservation Manager||63.0%|Medium|| -|1846|Maximum Element After Decreasing and Rearranging|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging)|58.5%|Medium|| -|1847|Closest Room||34.4%|Hard|| -|1848|Minimum Distance to the Target Element||59.3%|Easy|| -|1849|Splitting a String Into Descending Consecutive Values||31.8%|Medium|| -|1850|Minimum Adjacent Swaps to Reach the Kth Smallest Number||71.8%|Medium|| -|1851|Minimum Interval to Include Each Query||46.6%|Hard|| -|1852|Distinct Numbers in Each Subarray||72.1%|Medium|| -|1853|Convert Date Format||87.7%|Easy|| -|1854|Maximum Population Year||59.3%|Easy|| -|1855|Maximum Distance Between a Pair of Values||52.1%|Medium|| -|1856|Maximum Subarray Min-Product||36.9%|Medium|| -|1857|Largest Color Value in a Directed Graph||40.0%|Hard|| -|1858|Longest Word With All Prefixes||65.7%|Medium|| +|1845|Seat Reservation Manager||63.8%|Medium|| +|1846|Maximum Element After Decreasing and Rearranging|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1846.Maximum-Element-After-Decreasing-and-Rearranging)|58.9%|Medium|| +|1847|Closest Room||34.8%|Hard|| +|1848|Minimum Distance to the Target Element||58.9%|Easy|| +|1849|Splitting a String Into Descending Consecutive Values||31.9%|Medium|| +|1850|Minimum Adjacent Swaps to Reach the Kth Smallest Number||72.0%|Medium|| +|1851|Minimum Interval to Include Each Query||47.2%|Hard|| +|1852|Distinct Numbers in Each Subarray||71.5%|Medium|| +|1853|Convert Date Format||87.8%|Easy|| +|1854|Maximum Population Year||59.5%|Easy|| +|1855|Maximum Distance Between a Pair of Values||52.4%|Medium|| +|1856|Maximum Subarray Min-Product||37.6%|Medium|| +|1857|Largest Color Value in a Directed Graph||40.3%|Hard|| +|1858|Longest Word With All Prefixes||66.2%|Medium|| |1859|Sorting the Sentence||84.4%|Easy|| -|1860|Incremental Memory Leak||71.3%|Medium|| +|1860|Incremental Memory Leak||71.4%|Medium|| |1861|Rotating the Box||64.9%|Medium|| |1862|Sum of Floored Pairs||28.1%|Hard|| -|1863|Sum of All Subset XOR Totals||78.8%|Easy|| -|1864|Minimum Number of Swaps to Make the Binary String Alternating||39.6%|Medium|| -|1865|Finding Pairs With a Certain Sum||49.9%|Medium|| -|1866|Number of Ways to Rearrange Sticks With K Sticks Visible||55.5%|Hard|| -|1867|Orders With Maximum Quantity Above Average||75.4%|Medium|| +|1863|Sum of All Subset XOR Totals||78.9%|Easy|| +|1864|Minimum Number of Swaps to Make the Binary String Alternating||41.0%|Medium|| +|1865|Finding Pairs With a Certain Sum||50.1%|Medium|| +|1866|Number of Ways to Rearrange Sticks With K Sticks Visible||55.3%|Hard|| +|1867|Orders With Maximum Quantity Above Average||75.7%|Medium|| |1868|Product of Two Run-Length Encoded Arrays||57.8%|Medium|| |1869|Longer Contiguous Segments of Ones than Zeros||60.3%|Easy|| -|1870|Minimum Speed to Arrive on Time||36.8%|Medium|| +|1870|Minimum Speed to Arrive on Time||37.2%|Medium|| |1871|Jump Game VII||25.2%|Medium|| |1872|Stone Game VIII||52.2%|Hard|| -|1873|Calculate Special Bonus||71.0%|Easy|| -|1874|Minimize Product Sum of Two Arrays||90.7%|Medium|| -|1875|Group Employees of the Same Salary||75.7%|Medium|| -|1876|Substrings of Size Three with Distinct Characters||69.9%|Easy|| -|1877|Minimize Maximum Pair Sum in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array)|80.6%|Medium|| -|1878|Get Biggest Three Rhombus Sums in a Grid||46.0%|Medium|| -|1879|Minimum XOR Sum of Two Arrays||43.6%|Hard|| -|1880|Check if Word Equals Summation of Two Words||73.5%|Easy|| -|1881|Maximum Value after Insertion||36.1%|Medium|| -|1882|Process Tasks Using Servers||38.7%|Medium|| +|1873|Calculate Special Bonus||66.4%|Easy|| +|1874|Minimize Product Sum of Two Arrays||90.4%|Medium|| +|1875|Group Employees of the Same Salary||75.8%|Medium|| +|1876|Substrings of Size Three with Distinct Characters||70.1%|Easy|| +|1877|Minimize Maximum Pair Sum in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1877.Minimize-Maximum-Pair-Sum-in-Array)|80.4%|Medium|| +|1878|Get Biggest Three Rhombus Sums in a Grid||46.3%|Medium|| +|1879|Minimum XOR Sum of Two Arrays||44.2%|Hard|| +|1880|Check if Word Equals Summation of Two Words||73.6%|Easy|| +|1881|Maximum Value after Insertion||36.3%|Medium|| +|1882|Process Tasks Using Servers||39.2%|Medium|| |1883|Minimum Skips to Arrive at Meeting On Time||38.7%|Hard|| |1884|Egg Drop With 2 Eggs and N Floors||70.3%|Medium|| -|1885|Count Pairs in Two Arrays||58.5%|Medium|| -|1886|Determine Whether Matrix Can Be Obtained By Rotation||55.4%|Easy|| -|1887|Reduction Operations to Make the Array Elements Equal||62.0%|Medium|| -|1888|Minimum Number of Flips to Make the Binary String Alternating||37.3%|Medium|| +|1885|Count Pairs in Two Arrays||58.8%|Medium|| +|1886|Determine Whether Matrix Can Be Obtained By Rotation||55.5%|Easy|| +|1887|Reduction Operations to Make the Array Elements Equal||62.2%|Medium|| +|1888|Minimum Number of Flips to Make the Binary String Alternating||37.6%|Medium|| |1889|Minimum Space Wasted From Packaging||30.5%|Hard|| |1890|The Latest Login in 2020||81.9%|Easy|| |1891|Cutting Ribbons||48.1%|Medium|| |1892|Page Recommendations II||44.7%|Hard|| |1893|Check if All the Integers in a Range Are Covered||50.9%|Easy|| -|1894|Find the Student that Will Replace the Chalk||42.8%|Medium|| -|1895|Largest Magic Square||51.7%|Medium|| -|1896|Minimum Cost to Change the Final Value of Expression||54.0%|Hard|| +|1894|Find the Student that Will Replace the Chalk||43.3%|Medium|| +|1895|Largest Magic Square||51.8%|Medium|| +|1896|Minimum Cost to Change the Final Value of Expression||54.6%|Hard|| |1897|Redistribute Characters to Make All Strings Equal||60.0%|Easy|| -|1898|Maximum Number of Removable Characters||38.4%|Medium|| -|1899|Merge Triplets to Form Target Triplet||62.8%|Medium|| -|1900|The Earliest and Latest Rounds Where Players Compete||51.8%|Hard|| -|1901|Find a Peak Element II||53.6%|Medium|| -|1902|Depth of BST Given Insertion Order||44.9%|Medium|| -|1903|Largest Odd Number in String||56.3%|Easy|| -|1904|The Number of Full Rounds You Have Played||46.2%|Medium|| -|1905|Count Sub Islands||67.4%|Medium|| -|1906|Minimum Absolute Difference Queries||43.8%|Medium|| -|1907|Count Salary Categories||64.5%|Medium|| -|1908|Game of Nim||57.8%|Medium|| -|1909|Remove One Element to Make the Array Strictly Increasing||26.5%|Easy|| -|1910|Remove All Occurrences of a Substring||72.8%|Medium|| +|1898|Maximum Number of Removable Characters||39.0%|Medium|| +|1899|Merge Triplets to Form Target Triplet||63.9%|Medium|| +|1900|The Earliest and Latest Rounds Where Players Compete||51.6%|Hard|| +|1901|Find a Peak Element II||53.4%|Medium|| +|1902|Depth of BST Given Insertion Order||45.4%|Medium|| +|1903|Largest Odd Number in String||55.8%|Easy|| +|1904|The Number of Full Rounds You Have Played||45.9%|Medium|| +|1905|Count Sub Islands||68.0%|Medium|| +|1906|Minimum Absolute Difference Queries||43.9%|Medium|| +|1907|Count Salary Categories||64.6%|Medium|| +|1908|Game of Nim||57.5%|Medium|| +|1909|Remove One Element to Make the Array Strictly Increasing||26.1%|Easy|| +|1910|Remove All Occurrences of a Substring||73.6%|Medium|| |1911|Maximum Alternating Subsequence Sum||59.1%|Medium|| -|1912|Design Movie Rental System||41.3%|Hard|| -|1913|Maximum Product Difference Between Two Pairs||81.3%|Easy|| -|1914|Cyclically Rotating a Grid||47.6%|Medium|| -|1915|Number of Wonderful Substrings||44.2%|Medium|| -|1916|Count Ways to Build Rooms in an Ant Colony||48.3%|Hard|| -|1917|Leetcodify Friends Recommendations||29.8%|Hard|| -|1918|Kth Smallest Subarray Sum||52.8%|Medium|| -|1919|Leetcodify Similar Friends||43.3%|Hard|| +|1912|Design Movie Rental System||41.4%|Hard|| +|1913|Maximum Product Difference Between Two Pairs||81.4%|Easy|| +|1914|Cyclically Rotating a Grid||47.9%|Medium|| +|1915|Number of Wonderful Substrings||44.6%|Medium|| +|1916|Count Ways to Build Rooms in an Ant Colony||48.4%|Hard|| +|1917|Leetcodify Friends Recommendations||29.5%|Hard|| +|1918|Kth Smallest Subarray Sum||52.9%|Medium|| +|1919|Leetcodify Similar Friends||43.4%|Hard|| |1920|Build Array from Permutation||91.5%|Easy|| |1921|Eliminate Maximum Number of Monsters||37.8%|Medium|| |1922|Count Good Numbers||38.3%|Medium|| -|1923|Longest Common Subpath||28.2%|Hard|| -|1924|Erect the Fence II||54.3%|Hard|| -|1925|Count Square Sum Triples||67.7%|Easy|| -|1926|Nearest Exit from Entrance in Maze||42.3%|Medium|| -|1927|Sum Game||47.0%|Medium|| +|1923|Longest Common Subpath||28.1%|Hard|| +|1924|Erect the Fence II||53.7%|Hard|| +|1925|Count Square Sum Triples||67.9%|Easy|| +|1926|Nearest Exit from Entrance in Maze||42.9%|Medium|| +|1927|Sum Game||47.1%|Medium|| |1928|Minimum Cost to Reach Destination in Time||37.7%|Hard|| |1929|Concatenation of Array||91.5%|Easy|| -|1930|Unique Length-3 Palindromic Subsequences||51.4%|Medium|| -|1931|Painting a Grid With Three Different Colors||57.2%|Hard|| -|1932|Merge BSTs to Create Single BST||35.3%|Hard|| -|1933|Check if String Is Decomposable Into Value-Equal Substrings||50.5%|Easy|| -|1934|Confirmation Rate||77.3%|Medium|| -|1935|Maximum Number of Words You Can Type||71.3%|Easy|| -|1936|Add Minimum Number of Rungs||42.6%|Medium|| -|1937|Maximum Number of Points with Cost||35.9%|Medium|| -|1938|Maximum Genetic Difference Query||39.2%|Hard|| -|1939|Users That Actively Request Confirmation Messages||61.5%|Easy|| -|1940|Longest Common Subsequence Between Sorted Arrays||79.3%|Medium|| -|1941|Check if All Characters Have Equal Number of Occurrences||77.0%|Easy|| -|1942|The Number of the Smallest Unoccupied Chair||39.6%|Medium|| -|1943|Describe the Painting||47.3%|Medium|| -|1944|Number of Visible People in a Queue||69.8%|Hard|| -|1945|Sum of Digits of String After Convert||61.2%|Easy|| -|1946|Largest Number After Mutating Substring||34.3%|Medium|| -|1947|Maximum Compatibility Score Sum||60.4%|Medium|| -|1948|Delete Duplicate Folders in System||58.7%|Hard|| -|1949|Strong Friendship||58.9%|Medium|| -|1950|Maximum of Minimum Values in All Subarrays||49.8%|Medium|| -|1951|All the Pairs With the Maximum Number of Common Followers||72.7%|Medium|| -|1952|Three Divisors||56.6%|Easy|| -|1953|Maximum Number of Weeks for Which You Can Work||38.2%|Medium|| -|1954|Minimum Garden Perimeter to Collect Enough Apples||52.7%|Medium|| -|1955|Count Number of Special Subsequences||50.9%|Hard|| -|1956|Minimum Time For K Virus Variants to Spread||45.8%|Hard|| -|1957|Delete Characters to Make Fancy String||56.8%|Easy|| -|1958|Check if Move is Legal||43.9%|Medium|| -|1959|Minimum Total Space Wasted With K Resizing Operations||41.7%|Medium|| -|1960|Maximum Product of the Length of Two Palindromic Substrings||29.4%|Hard|| -|1961|Check If String Is a Prefix of Array||54.4%|Easy|| -|1962|Remove Stones to Minimize the Total||57.7%|Medium|| -|1963|Minimum Number of Swaps to Make the String Balanced||67.9%|Medium|| -|1964|Find the Longest Valid Obstacle Course at Each Position||46.2%|Hard|| -|1965|Employees With Missing Information||81.4%|Easy|| -|1966|Binary Searchable Numbers in an Unsorted Array||66.1%|Medium|| +|1930|Unique Length-3 Palindromic Subsequences||51.7%|Medium|| +|1931|Painting a Grid With Three Different Colors||57.1%|Hard|| +|1932|Merge BSTs to Create Single BST||35.0%|Hard|| +|1933|Check if String Is Decomposable Into Value-Equal Substrings||50.4%|Easy|| +|1934|Confirmation Rate||77.6%|Medium|| +|1935|Maximum Number of Words You Can Type||71.0%|Easy|| +|1936|Add Minimum Number of Rungs||42.7%|Medium|| +|1937|Maximum Number of Points with Cost||36.1%|Medium|| +|1938|Maximum Genetic Difference Query||39.8%|Hard|| +|1939|Users That Actively Request Confirmation Messages||61.7%|Easy|| +|1940|Longest Common Subsequence Between Sorted Arrays||79.4%|Medium|| +|1941|Check if All Characters Have Equal Number of Occurrences||76.8%|Easy|| +|1942|The Number of the Smallest Unoccupied Chair||39.9%|Medium|| +|1943|Describe the Painting||47.5%|Medium|| +|1944|Number of Visible People in a Queue||69.9%|Hard|| +|1945|Sum of Digits of String After Convert||61.1%|Easy|| +|1946|Largest Number After Mutating Substring||34.4%|Medium|| +|1947|Maximum Compatibility Score Sum||60.7%|Medium|| +|1948|Delete Duplicate Folders in System||58.8%|Hard|| +|1949|Strong Friendship||58.8%|Medium|| +|1950|Maximum of Minimum Values in All Subarrays||49.9%|Medium|| +|1951|All the Pairs With the Maximum Number of Common Followers||73.2%|Medium|| +|1952|Three Divisors||56.8%|Easy|| +|1953|Maximum Number of Weeks for Which You Can Work||38.8%|Medium|| +|1954|Minimum Garden Perimeter to Collect Enough Apples||52.9%|Medium|| +|1955|Count Number of Special Subsequences||51.2%|Hard|| +|1956|Minimum Time For K Virus Variants to Spread||46.6%|Hard|| +|1957|Delete Characters to Make Fancy String||56.5%|Easy|| +|1958|Check if Move is Legal||44.1%|Medium|| +|1959|Minimum Total Space Wasted With K Resizing Operations||41.8%|Medium|| +|1960|Maximum Product of the Length of Two Palindromic Substrings||29.5%|Hard|| +|1961|Check If String Is a Prefix of Array||54.3%|Easy|| +|1962|Remove Stones to Minimize the Total||58.3%|Medium|| +|1963|Minimum Number of Swaps to Make the String Balanced||68.2%|Medium|| +|1964|Find the Longest Valid Obstacle Course at Each Position||46.6%|Hard|| +|1965|Employees With Missing Information||81.2%|Easy|| +|1966|Binary Searchable Numbers in an Unsorted Array||65.6%|Medium|| |1967|Number of Strings That Appear as Substrings in Word||79.9%|Easy|| -|1968|Array With Elements Not Equal to Average of Neighbors||49.0%|Medium|| -|1969|Minimum Non-Zero Product of the Array Elements||33.2%|Medium|| -|1970|Last Day Where You Can Still Cross||49.4%|Hard|| +|1968|Array With Elements Not Equal to Average of Neighbors||49.3%|Medium|| +|1969|Minimum Non-Zero Product of the Array Elements||33.4%|Medium|| +|1970|Last Day Where You Can Still Cross||49.0%|Hard|| |1971|Find if Path Exists in Graph||50.5%|Easy|| -|1972|First and Last Call On the Same Day||54.3%|Hard|| -|1973|Count Nodes Equal to Sum of Descendants||75.2%|Medium|| +|1972|First and Last Call On the Same Day||54.6%|Hard|| +|1973|Count Nodes Equal to Sum of Descendants||75.3%|Medium|| |1974|Minimum Time to Type Word Using Special Typewriter||71.5%|Easy|| -|1975|Maximum Matrix Sum||45.3%|Medium|| +|1975|Maximum Matrix Sum||45.6%|Medium|| |1976|Number of Ways to Arrive at Destination||32.6%|Medium|| -|1977|Number of Ways to Separate Numbers||21.9%|Hard|| -|1978|Employees Whose Manager Left the Company||50.3%|Easy|| -|1979|Find Greatest Common Divisor of Array||77.4%|Easy|| -|1980|Find Unique Binary String||63.7%|Medium|| -|1981|Minimize the Difference Between Target and Chosen Elements||32.4%|Medium|| -|1982|Find Array Given Subset Sums||48.8%|Hard|| -|1983|Widest Pair of Indices With Equal Range Sum||54.5%|Medium|| +|1977|Number of Ways to Separate Numbers||21.4%|Hard|| +|1978|Employees Whose Manager Left the Company||50.4%|Easy|| +|1979|Find Greatest Common Divisor of Array||77.1%|Easy|| +|1980|Find Unique Binary String||64.0%|Medium|| +|1981|Minimize the Difference Between Target and Chosen Elements||32.5%|Medium|| +|1982|Find Array Given Subset Sums||49.0%|Hard|| +|1983|Widest Pair of Indices With Equal Range Sum||53.6%|Medium|| |1984|Minimum Difference Between Highest and Lowest of K Scores|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores)|53.4%|Easy|| -|1985|Find the Kth Largest Integer in the Array||44.7%|Medium|| -|1986|Minimum Number of Work Sessions to Finish the Tasks||32.6%|Medium|| -|1987|Number of Unique Good Subsequences||52.3%|Hard|| -|1988|Find Cutoff Score for Each School||69.6%|Medium|| -|1989|Maximum Number of People That Can Be Caught in Tag||53.8%|Medium|| -|1990|Count the Number of Experiments||50.9%|Medium|| -|1991|Find the Middle Index in Array||67.0%|Easy|| -|1992|Find All Groups of Farmland||68.0%|Medium|| -|1993|Operations on Tree||42.9%|Medium|| -|1994|The Number of Good Subsets||34.4%|Hard|| -|1995|Count Special Quadruplets||58.4%|Easy|| -|1996|The Number of Weak Characters in the Game||36.5%|Medium|| -|1997|First Day Where You Have Been in All the Rooms||35.6%|Medium|| +|1985|Find the Kth Largest Integer in the Array||44.6%|Medium|| +|1986|Minimum Number of Work Sessions to Finish the Tasks||33.0%|Medium|| +|1987|Number of Unique Good Subsequences||52.1%|Hard|| +|1988|Find Cutoff Score for Each School||70.1%|Medium|| +|1989|Maximum Number of People That Can Be Caught in Tag||53.7%|Medium|| +|1990|Count the Number of Experiments||51.3%|Medium|| +|1991|Find the Middle Index in Array||67.1%|Easy|| +|1992|Find All Groups of Farmland||68.4%|Medium|| +|1993|Operations on Tree||43.4%|Medium|| +|1994|The Number of Good Subsets||34.0%|Hard|| +|1995|Count Special Quadruplets||58.6%|Easy|| +|1996|The Number of Weak Characters in the Game||43.9%|Medium|| +|1997|First Day Where You Have Been in All the Rooms||35.9%|Medium|| |1998|GCD Sort of an Array||45.5%|Hard|| -|1999|Smallest Greater Multiple Made of Two Digits||50.7%|Medium|| -|2000|Reverse Prefix of Word||77.7%|Easy|| -|2001|Number of Pairs of Interchangeable Rectangles||43.9%|Medium|| -|2002|Maximum Product of the Length of Two Palindromic Subsequences||53.1%|Medium|| -|2003|Smallest Missing Genetic Value in Each Subtree||43.1%|Hard|| -|2004|The Number of Seniors and Juniors to Join the Company||38.4%|Hard|| -|2005|Subtree Removal Game with Fibonacci Tree||63.9%|Hard|| -|2006|Count Number of Pairs With Absolute Difference K||82.2%|Easy|| +|1999|Smallest Greater Multiple Made of Two Digits||49.9%|Medium|| +|2000|Reverse Prefix of Word||77.6%|Easy|| +|2001|Number of Pairs of Interchangeable Rectangles||44.3%|Medium|| +|2002|Maximum Product of the Length of Two Palindromic Subsequences||53.3%|Medium|| +|2003|Smallest Missing Genetic Value in Each Subtree||43.8%|Hard|| +|2004|The Number of Seniors and Juniors to Join the Company||38.3%|Hard|| +|2005|Subtree Removal Game with Fibonacci Tree||63.3%|Hard|| +|2006|Count Number of Pairs With Absolute Difference K||82.3%|Easy|| |2007|Find Original Array From Doubled Array||38.4%|Medium|| -|2008|Maximum Earnings From Taxi||42.8%|Medium|| +|2008|Maximum Earnings From Taxi||42.9%|Medium|| |2009|Minimum Number of Operations to Make Array Continuous||45.6%|Hard|| -|2010|The Number of Seniors and Juniors to Join the Company II||57.3%|Hard|| -|2011|Final Value of Variable After Performing Operations||89.1%|Easy|| -|2012|Sum of Beauty in the Array||46.3%|Medium|| -|2013|Detect Squares||49.2%|Medium|| -|2014|Longest Subsequence Repeated k Times||55.3%|Hard|| -|2015|Average Height of Buildings in Each Segment||59.6%|Medium|| -|2016|Maximum Difference Between Increasing Elements||53.8%|Easy|| -|2017|Grid Game||42.1%|Medium|| -|2018|Check if Word Can Be Placed In Crossword||48.6%|Medium|| +|2010|The Number of Seniors and Juniors to Join the Company II||57.9%|Hard|| +|2011|Final Value of Variable After Performing Operations||88.9%|Easy|| +|2012|Sum of Beauty in the Array||46.5%|Medium|| +|2013|Detect Squares||49.8%|Medium|| +|2014|Longest Subsequence Repeated k Times||55.2%|Hard|| +|2015|Average Height of Buildings in Each Segment||59.5%|Medium|| +|2016|Maximum Difference Between Increasing Elements||53.5%|Easy|| +|2017|Grid Game||42.5%|Medium|| +|2018|Check if Word Can Be Placed In Crossword||49.3%|Medium|| |2019|The Score of Students Solving Math Expression||33.4%|Hard|| -|2020|Number of Accounts That Did Not Stream||72.6%|Medium|| -|2021|Brightest Position on Street||63.1%|Medium|| -|2022|Convert 1D Array Into 2D Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2022.Convert-1D-Array-Into-2D-Array)|58.6%|Easy|| -|2023|Number of Pairs of Strings With Concatenation Equal to Target||72.9%|Medium|| -|2024|Maximize the Confusion of an Exam||58.5%|Medium|| -|2025|Maximum Number of Ways to Partition an Array||31.9%|Hard|| +|2020|Number of Accounts That Did Not Stream||72.8%|Medium|| +|2021|Brightest Position on Street||63.4%|Medium|| +|2022|Convert 1D Array Into 2D Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2022.Convert-1D-Array-Into-2D-Array)|58.4%|Easy|| +|2023|Number of Pairs of Strings With Concatenation Equal to Target||72.8%|Medium|| +|2024|Maximize the Confusion of an Exam||59.0%|Medium|| +|2025|Maximum Number of Ways to Partition an Array||32.0%|Hard|| |2026|Low-Quality Problems||85.6%|Easy|| |2027|Minimum Moves to Convert String||53.6%|Easy|| -|2028|Find Missing Observations||42.9%|Medium|| -|2029|Stone Game IX||25.5%|Medium|| -|2030|Smallest K-Length Subsequence With Occurrences of a Letter||39.1%|Hard|| +|2028|Find Missing Observations||43.2%|Medium|| +|2029|Stone Game IX||25.9%|Medium|| +|2030|Smallest K-Length Subsequence With Occurrences of a Letter||38.8%|Hard|| |2031|Count Subarrays With More Ones Than Zeros||52.4%|Medium|| |2032|Two Out of Three||72.7%|Easy|| -|2033|Minimum Operations to Make a Uni-Value Grid||51.6%|Medium|| -|2034|Stock Price Fluctuation||48.9%|Medium|| -|2035|Partition Array Into Two Arrays to Minimize Sum Difference||18.9%|Hard|| -|2036|Maximum Alternating Subarray Sum||40.9%|Medium|| -|2037|Minimum Number of Moves to Seat Everyone|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone)|82.5%|Easy|| -|2038|Remove Colored Pieces if Both Neighbors are the Same Color|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color)|57.3%|Medium|| -|2039|The Time When the Network Becomes Idle||49.6%|Medium|| -|2040|Kth Smallest Product of Two Sorted Arrays||29.6%|Hard|| -|2041|Accepted Candidates From the Interviews||78.4%|Medium|| -|2042|Check if Numbers Are Ascending in a Sentence||66.7%|Easy|| -|2043|Simple Bank System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2043.Simple-Bank-System)|65.6%|Medium|| -|2044|Count Number of Maximum Bitwise-OR Subsets||74.4%|Medium|| -|2045|Second Minimum Time to Reach Destination||37.9%|Hard|| -|2046|Sort Linked List Already Sorted Using Absolute Values||68.4%|Medium|| -|2047|Number of Valid Words in a Sentence||29.6%|Easy|| -|2048|Next Greater Numerically Balanced Number||46.8%|Medium|| -|2049|Count Nodes With the Highest Score||46.8%|Medium|| -|2050|Parallel Courses III||59.6%|Hard|| -|2051|The Category of Each Member in the Store||73.7%|Medium|| -|2052|Minimum Cost to Separate Sentence Into Rows||51.5%|Medium|| -|2053|Kth Distinct String in an Array||72.4%|Easy|| -|2054|Two Best Non-Overlapping Events||44.1%|Medium|| +|2033|Minimum Operations to Make a Uni-Value Grid||51.9%|Medium|| +|2034|Stock Price Fluctuation||49.3%|Medium|| +|2035|Partition Array Into Two Arrays to Minimize Sum Difference||18.0%|Hard|| +|2036|Maximum Alternating Subarray Sum||41.4%|Medium|| +|2037|Minimum Number of Moves to Seat Everyone|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2037.Minimum-Number-of-Moves-to-Seat-Everyone)|82.3%|Easy|| +|2038|Remove Colored Pieces if Both Neighbors are the Same Color|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color)|57.7%|Medium|| +|2039|The Time When the Network Becomes Idle||50.5%|Medium|| +|2040|Kth Smallest Product of Two Sorted Arrays||29.1%|Hard|| +|2041|Accepted Candidates From the Interviews||79.1%|Medium|| +|2042|Check if Numbers Are Ascending in a Sentence||66.0%|Easy|| +|2043|Simple Bank System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2043.Simple-Bank-System)|65.9%|Medium|| +|2044|Count Number of Maximum Bitwise-OR Subsets||74.6%|Medium|| +|2045|Second Minimum Time to Reach Destination||38.1%|Hard|| +|2046|Sort Linked List Already Sorted Using Absolute Values||68.7%|Medium|| +|2047|Number of Valid Words in a Sentence||29.5%|Easy|| +|2048|Next Greater Numerically Balanced Number||47.0%|Medium|| +|2049|Count Nodes With the Highest Score||47.0%|Medium|| +|2050|Parallel Courses III||59.4%|Hard|| +|2051|The Category of Each Member in the Store||74.0%|Medium|| +|2052|Minimum Cost to Separate Sentence Into Rows||51.0%|Medium|| +|2053|Kth Distinct String in an Array||71.8%|Easy|| +|2054|Two Best Non-Overlapping Events||44.4%|Medium|| |2055|Plates Between Candles||44.8%|Medium|| -|2056|Number of Valid Move Combinations On Chessboard||58.9%|Hard|| -|2057|Smallest Index With Equal Value||72.1%|Easy|| -|2058|Find the Minimum and Maximum Number of Nodes Between Critical Points||57.4%|Medium|| +|2056|Number of Valid Move Combinations On Chessboard||59.3%|Hard|| +|2057|Smallest Index With Equal Value||71.5%|Easy|| +|2058|Find the Minimum and Maximum Number of Nodes Between Critical Points||57.2%|Medium|| |2059|Minimum Operations to Convert Number||47.1%|Medium|| -|2060|Check if an Original String Exists Given Two Encoded Strings||40.5%|Hard|| -|2061|Number of Spaces Cleaning Robot Cleaned||55.0%|Medium|| -|2062|Count Vowel Substrings of a String||66.2%|Easy|| -|2063|Vowels of All Substrings||54.7%|Medium|| -|2064|Minimized Maximum of Products Distributed to Any Store||49.5%|Medium|| -|2065|Maximum Path Quality of a Graph||57.9%|Hard|| -|2066|Account Balance||85.4%|Medium|| -|2067|Number of Equal Count Substrings||51.0%|Medium|| -|2068|Check Whether Two Strings are Almost Equivalent||65.5%|Easy|| -|2069|Walking Robot Simulation II||22.2%|Medium|| -|2070|Most Beautiful Item for Each Query||49.0%|Medium|| -|2071|Maximum Number of Tasks You Can Assign||36.0%|Hard|| -|2072|The Winner University||73.1%|Easy|| +|2060|Check if an Original String Exists Given Two Encoded Strings||40.6%|Hard|| +|2061|Number of Spaces Cleaning Robot Cleaned||54.7%|Medium|| +|2062|Count Vowel Substrings of a String||65.9%|Easy|| +|2063|Vowels of All Substrings||55.0%|Medium|| +|2064|Minimized Maximum of Products Distributed to Any Store||49.8%|Medium|| +|2065|Maximum Path Quality of a Graph||57.6%|Hard|| +|2066|Account Balance||85.5%|Medium|| +|2067|Number of Equal Count Substrings||50.4%|Medium|| +|2068|Check Whether Two Strings are Almost Equivalent||65.1%|Easy|| +|2069|Walking Robot Simulation II||22.9%|Medium|| +|2070|Most Beautiful Item for Each Query||49.2%|Medium|| +|2071|Maximum Number of Tasks You Can Assign||35.3%|Hard|| +|2072|The Winner University||72.6%|Easy|| |2073|Time Needed to Buy Tickets||62.1%|Easy|| -|2074|Reverse Nodes in Even Length Groups||50.9%|Medium|| -|2075|Decode the Slanted Ciphertext||50.0%|Medium|| -|2076|Process Restricted Friend Requests||53.6%|Hard|| -|2077|Paths in Maze That Lead to Same Room||56.6%|Medium|| -|2078|Two Furthest Houses With Different Colors||67.9%|Easy|| -|2079|Watering Plants||80.4%|Medium|| -|2080|Range Frequency Queries||37.2%|Medium|| -|2081|Sum of k-Mirror Numbers||41.3%|Hard|| -|2082|The Number of Rich Customers||80.9%|Easy|| +|2074|Reverse Nodes in Even Length Groups||50.8%|Medium|| +|2075|Decode the Slanted Ciphertext||49.9%|Medium|| +|2076|Process Restricted Friend Requests||53.4%|Hard|| +|2077|Paths in Maze That Lead to Same Room||56.3%|Medium|| +|2078|Two Furthest Houses With Different Colors||67.4%|Easy|| +|2079|Watering Plants||80.2%|Medium|| +|2080|Range Frequency Queries||37.7%|Medium|| +|2081|Sum of k-Mirror Numbers||42.0%|Hard|| +|2082|The Number of Rich Customers||80.7%|Easy|| |2083|Substrings That Begin and End With the Same Letter||68.2%|Medium|| -|2084|Drop Type 1 Orders for Customers With Type 0 Orders||91.5%|Medium|| +|2084|Drop Type 1 Orders for Customers With Type 0 Orders||91.8%|Medium|| |2085|Count Common Words With One Occurrence||69.8%|Easy|| -|2086|Minimum Number of Buckets Required to Collect Rainwater from Houses||45.1%|Medium|| -|2087|Minimum Cost Homecoming of a Robot in a Grid||50.7%|Medium|| -|2088|Count Fertile Pyramids in a Land||63.3%|Hard|| -|2089|Find Target Indices After Sorting Array||77.5%|Easy|| -|2090|K Radius Subarray Averages||41.9%|Medium|| -|2091|Removing Minimum and Maximum From Array||57.4%|Medium|| -|2092|Find All People With Secret||34.0%|Hard|| -|2093|Minimum Cost to Reach City With Discounts||56.9%|Medium|| -|2094|Finding 3-Digit Even Numbers||57.0%|Easy|| -|2095|Delete the Middle Node of a Linked List||55.9%|Medium|| -|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another)|48.6%|Medium|| -|2097|Valid Arrangement of Pairs||40.5%|Hard|| -|2098|Subsequence of Size K With the Largest Even Sum||38.1%|Medium|| -|2099|Find Subsequence of Length K With the Largest Sum||43.2%|Easy|| -|2100|Find Good Days to Rob the Bank||48.1%|Medium|| +|2086|Minimum Number of Buckets Required to Collect Rainwater from Houses||45.0%|Medium|| +|2087|Minimum Cost Homecoming of a Robot in a Grid||51.0%|Medium|| +|2088|Count Fertile Pyramids in a Land||63.9%|Hard|| +|2089|Find Target Indices After Sorting Array||77.2%|Easy|| +|2090|K Radius Subarray Averages||42.0%|Medium|| +|2091|Removing Minimum and Maximum From Array||56.9%|Medium|| +|2092|Find All People With Secret||34.1%|Hard|| +|2093|Minimum Cost to Reach City With Discounts||56.0%|Medium|| +|2094|Finding 3-Digit Even Numbers||57.4%|Easy|| +|2095|Delete the Middle Node of a Linked List||55.7%|Medium|| +|2096|Step-By-Step Directions From a Binary Tree Node to Another|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another)|48.8%|Medium|| +|2097|Valid Arrangement of Pairs||40.9%|Hard|| +|2098|Subsequence of Size K With the Largest Even Sum||38.6%|Medium|| +|2099|Find Subsequence of Length K With the Largest Sum||42.7%|Easy|| +|2100|Find Good Days to Rob the Bank||49.0%|Medium|| |2101|Detonate the Maximum Bombs||40.6%|Medium|| -|2102|Sequentially Ordinal Rank Tracker||64.7%|Hard|| +|2102|Sequentially Ordinal Rank Tracker||65.5%|Hard|| |2103|Rings and Rods||81.5%|Easy|| -|2104|Sum of Subarray Ranges||60.3%|Medium|| -|2105|Watering Plants II||50.6%|Medium|| -|2106|Maximum Fruits Harvested After at Most K Steps||35.1%|Hard|| -|2107|Number of Unique Flavors After Sharing K Candies||58.0%|Medium|| -|2108|Find First Palindromic String in the Array||78.8%|Easy|| -|2109|Adding Spaces to a String||56.0%|Medium|| -|2110|Number of Smooth Descent Periods of a Stock||56.4%|Medium|| -|2111|Minimum Operations to Make the Array K-Increasing||37.1%|Hard|| -|2112|The Airport With the Most Traffic||70.9%|Medium|| -|2113|Elements in Array After Removing and Replacing Elements||73.3%|Medium|| -|2114|Maximum Number of Words Found in Sentences||88.5%|Easy|| -|2115|Find All Possible Recipes from Given Supplies||47.2%|Medium|| -|2116|Check if a Parentheses String Can Be Valid||31.2%|Medium|| -|2117|Abbreviating the Product of a Range||28.2%|Hard|| -|2118|Build the Equation||57.9%|Hard|| -|2119|A Number After a Double Reversal||76.2%|Easy|| -|2120|Execution of All Suffix Instructions Staying in a Grid||83.5%|Medium|| -|2121|Intervals Between Identical Elements||42.6%|Medium|| +|2104|Sum of Subarray Ranges||60.2%|Medium|| +|2105|Watering Plants II||50.1%|Medium|| +|2106|Maximum Fruits Harvested After at Most K Steps||34.8%|Hard|| +|2107|Number of Unique Flavors After Sharing K Candies||57.3%|Medium|| +|2108|Find First Palindromic String in the Array||78.6%|Easy|| +|2109|Adding Spaces to a String||56.2%|Medium|| +|2110|Number of Smooth Descent Periods of a Stock||57.0%|Medium|| +|2111|Minimum Operations to Make the Array K-Increasing||37.5%|Hard|| +|2112|The Airport With the Most Traffic||71.1%|Medium|| +|2113|Elements in Array After Removing and Replacing Elements||73.2%|Medium|| +|2114|Maximum Number of Words Found in Sentences||88.4%|Easy|| +|2115|Find All Possible Recipes from Given Supplies||47.7%|Medium|| +|2116|Check if a Parentheses String Can Be Valid||31.3%|Medium|| +|2117|Abbreviating the Product of a Range||28.0%|Hard|| +|2118|Build the Equation||57.3%|Hard|| +|2119|A Number After a Double Reversal||75.7%|Easy|| +|2120|Execution of All Suffix Instructions Staying in a Grid||83.6%|Medium|| +|2121|Intervals Between Identical Elements||42.9%|Medium|| |2122|Recover the Original Array||37.6%|Hard|| -|2123|Minimum Operations to Remove Adjacent Ones in Matrix||40.2%|Hard|| -|2124|Check if All A's Appears Before All B's||72.1%|Easy|| -|2125|Number of Laser Beams in a Bank||83.1%|Medium|| -|2126|Destroying Asteroids||49.0%|Medium|| -|2127|Maximum Employees to Be Invited to a Meeting||30.9%|Hard|| -|2128|Remove All Ones With Row and Column Flips||76.2%|Medium|| +|2123|Minimum Operations to Remove Adjacent Ones in Matrix||40.4%|Hard|| +|2124|Check if All A's Appears Before All B's||71.6%|Easy|| +|2125|Number of Laser Beams in a Bank||82.7%|Medium|| +|2126|Destroying Asteroids||49.2%|Medium|| +|2127|Maximum Employees to Be Invited to a Meeting||32.2%|Hard|| +|2128|Remove All Ones With Row and Column Flips||76.3%|Medium|| |2129|Capitalize the Title||60.1%|Easy|| |2130|Maximum Twin Sum of a Linked List||81.9%|Medium|| -|2131|Longest Palindrome by Concatenating Two Letter Words||40.2%|Medium|| -|2132|Stamping the Grid||30.4%|Hard|| -|2133|Check if Every Row and Column Contains All Numbers||52.6%|Easy|| -|2134|Minimum Swaps to Group All 1's Together II||48.9%|Medium|| -|2135|Count Words Obtained After Adding a Letter||41.7%|Medium|| -|2136|Earliest Possible Day of Full Bloom||67.8%|Hard|| -|2137|Pour Water Between Buckets to Make Water Levels Equal||67.3%|Medium|| -|2138|Divide a String Into Groups of Size k||65.4%|Easy|| -|2139|Minimum Moves to Reach Target Score||48.4%|Medium|| -|2140|Solving Questions With Brainpower||45.1%|Medium|| -|2141|Maximum Running Time of N Computers||38.4%|Hard|| -|2142|The Number of Passengers in Each Bus I||50.5%|Medium|| -|2143|Choose Numbers From Two Arrays in Range||51.9%|Hard|| -|2144|Minimum Cost of Buying Candies With Discount||60.9%|Easy|| -|2145|Count the Hidden Sequences||35.8%|Medium|| -|2146|K Highest Ranked Items Within a Price Range||40.8%|Medium|| -|2147|Number of Ways to Divide a Long Corridor||39.9%|Hard|| -|2148|Count Elements With Strictly Smaller and Greater Elements||60.2%|Easy|| -|2149|Rearrange Array Elements by Sign||81.7%|Medium|| -|2150|Find All Lonely Numbers in the Array||60.5%|Medium|| -|2151|Maximum Good People Based on Statements||47.3%|Hard|| -|2152|Minimum Number of Lines to Cover Points||46.4%|Medium|| -|2153|The Number of Passengers in Each Bus II||51.7%|Hard|| +|2131|Longest Palindrome by Concatenating Two Letter Words||41.1%|Medium|| +|2132|Stamping the Grid||30.6%|Hard|| +|2133|Check if Every Row and Column Contains All Numbers||52.7%|Easy|| +|2134|Minimum Swaps to Group All 1's Together II||49.6%|Medium|| +|2135|Count Words Obtained After Adding a Letter||42.5%|Medium|| +|2136|Earliest Possible Day of Full Bloom||68.2%|Hard|| +|2137|Pour Water Between Buckets to Make Water Levels Equal||67.4%|Medium|| +|2138|Divide a String Into Groups of Size k||65.2%|Easy|| +|2139|Minimum Moves to Reach Target Score||48.5%|Medium|| +|2140|Solving Questions With Brainpower||45.6%|Medium|| +|2141|Maximum Running Time of N Computers||38.6%|Hard|| +|2142|The Number of Passengers in Each Bus I||50.9%|Medium|| +|2143|Choose Numbers From Two Arrays in Range||51.6%|Hard|| +|2144|Minimum Cost of Buying Candies With Discount||60.7%|Easy|| +|2145|Count the Hidden Sequences||36.1%|Medium|| +|2146|K Highest Ranked Items Within a Price Range||41.0%|Medium|| +|2147|Number of Ways to Divide a Long Corridor||40.1%|Hard|| +|2148|Count Elements With Strictly Smaller and Greater Elements||60.1%|Easy|| +|2149|Rearrange Array Elements by Sign||81.3%|Medium|| +|2150|Find All Lonely Numbers in the Array||60.6%|Medium|| +|2151|Maximum Good People Based on Statements||47.6%|Hard|| +|2152|Minimum Number of Lines to Cover Points||46.8%|Medium|| +|2153|The Number of Passengers in Each Bus II||51.6%|Hard|| |2154|Keep Multiplying Found Values by Two||73.5%|Easy|| -|2155|All Divisions With the Highest Score of a Binary Array||62.9%|Medium|| -|2156|Find Substring With Given Hash Value||21.5%|Hard|| +|2155|All Divisions With the Highest Score of a Binary Array||63.3%|Medium|| +|2156|Find Substring With Given Hash Value||21.8%|Hard|| |2157|Groups of Strings||24.9%|Hard|| -|2158|Amount of New Area Painted Each Day||57.5%|Hard|| -|2159|Order Two Columns Independently||64.1%|Medium|| -|2160|Minimum Sum of Four Digit Number After Splitting Digits||88.2%|Easy|| -|2161|Partition Array According to Given Pivot||83.8%|Medium|| -|2162|Minimum Cost to Set Cooking Time||37.3%|Medium|| -|2163|Minimum Difference in Sums After Removal of Elements||45.8%|Hard|| -|2164|Sort Even and Odd Indices Independently|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2164.Sort-Even-and-Odd-Indices-Independently)|67.0%|Easy|| -|2165|Smallest Value of the Rearranged Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2165.Smallest-Value-of-the-Rearranged-Number)|50.9%|Medium|| -|2166|Design Bitset|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2166.Design-Bitset)|31.0%|Medium|| -|2167|Minimum Time to Remove All Cars Containing Illegal Goods|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods)|39.5%|Hard|| -|2168|Unique Substrings With Equal Digit Frequency||58.9%|Medium|| +|2158|Amount of New Area Painted Each Day||56.5%|Hard|| +|2159|Order Two Columns Independently||63.8%|Medium|| +|2160|Minimum Sum of Four Digit Number After Splitting Digits||88.3%|Easy|| +|2161|Partition Array According to Given Pivot||84.0%|Medium|| +|2162|Minimum Cost to Set Cooking Time||38.7%|Medium|| +|2163|Minimum Difference in Sums After Removal of Elements||46.6%|Hard|| +|2164|Sort Even and Odd Indices Independently|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2164.Sort-Even-and-Odd-Indices-Independently)|66.7%|Easy|| +|2165|Smallest Value of the Rearranged Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2165.Smallest-Value-of-the-Rearranged-Number)|51.0%|Medium|| +|2166|Design Bitset|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2166.Design-Bitset)|31.2%|Medium|| +|2167|Minimum Time to Remove All Cars Containing Illegal Goods|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods)|39.9%|Hard|| +|2168|Unique Substrings With Equal Digit Frequency||59.6%|Medium|| |2169|Count Operations to Obtain Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2169.Count-Operations-to-Obtain-Zero)|75.6%|Easy|| -|2170|Minimum Operations to Make the Array Alternating|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating)|33.1%|Medium|| -|2171|Removing Minimum Number of Magic Beans|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans)|41.6%|Medium|| -|2172|Maximum AND Sum of Array||43.8%|Hard|| -|2173|Longest Winning Streak||56.9%|Hard|| -|2174|Remove All Ones With Row and Column Flips II||70.0%|Medium|| -|2175|The Change in Global Rankings||67.0%|Medium|| +|2170|Minimum Operations to Make the Array Alternating|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2170.Minimum-Operations-to-Make-the-Array-Alternating)|33.2%|Medium|| +|2171|Removing Minimum Number of Magic Beans|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2171.Removing-Minimum-Number-of-Magic-Beans)|41.7%|Medium|| +|2172|Maximum AND Sum of Array||46.0%|Hard|| +|2173|Longest Winning Streak||58.9%|Hard|| +|2174|Remove All Ones With Row and Column Flips II||69.0%|Medium|| +|2175|The Change in Global Rankings||68.6%|Medium|| |2176|Count Equal and Divisible Pairs in an Array||80.3%|Easy|| -|2177|Find Three Consecutive Integers That Sum to a Given Number||62.7%|Medium|| -|2178|Maximum Split of Positive Even Integers||58.4%|Medium|| -|2179|Count Good Triplets in an Array||35.2%|Hard|| +|2177|Find Three Consecutive Integers That Sum to a Given Number||63.1%|Medium|| +|2178|Maximum Split of Positive Even Integers||59.0%|Medium|| +|2179|Count Good Triplets in an Array||35.9%|Hard|| |2180|Count Integers With Even Digit Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2180.Count-Integers-With-Even-Digit-Sum)|64.4%|Easy|| -|2181|Merge Nodes in Between Zeros|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2181.Merge-Nodes-in-Between-Zeros)|86.8%|Medium|| -|2182|Construct String With Repeat Limit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2182.Construct-String-With-Repeat-Limit)|51.4%|Medium|| -|2183|Count Array Pairs Divisible by K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2183.Count-Array-Pairs-Divisible-by-K)|27.3%|Hard|| -|2184|Number of Ways to Build Sturdy Brick Wall||54.4%|Medium|| -|2185|Counting Words With a Given Prefix||77.3%|Easy|| -|2186|Minimum Number of Steps to Make Two Strings Anagram II||71.3%|Medium|| -|2187|Minimum Time to Complete Trips||30.9%|Medium|| -|2188|Minimum Time to Finish the Race||41.0%|Hard|| -|2189|Number of Ways to Build House of Cards||64.0%|Medium|| -|2190|Most Frequent Number Following Key In an Array||60.5%|Easy|| -|2191|Sort the Jumbled Numbers||44.4%|Medium|| -|2192|All Ancestors of a Node in a Directed Acyclic Graph||49.1%|Medium|| -|2193|Minimum Number of Moves to Make Palindrome||45.3%|Hard|| +|2181|Merge Nodes in Between Zeros|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2181.Merge-Nodes-in-Between-Zeros)|87.1%|Medium|| +|2182|Construct String With Repeat Limit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2182.Construct-String-With-Repeat-Limit)|51.7%|Medium|| +|2183|Count Array Pairs Divisible by K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/2183.Count-Array-Pairs-Divisible-by-K)|27.9%|Hard|| +|2184|Number of Ways to Build Sturdy Brick Wall||53.1%|Medium|| +|2185|Counting Words With a Given Prefix||77.1%|Easy|| +|2186|Minimum Number of Steps to Make Two Strings Anagram II||71.8%|Medium|| +|2187|Minimum Time to Complete Trips||31.5%|Medium|| +|2188|Minimum Time to Finish the Race||42.0%|Hard|| +|2189|Number of Ways to Build House of Cards||63.3%|Medium|| +|2190|Most Frequent Number Following Key In an Array||60.4%|Easy|| +|2191|Sort the Jumbled Numbers||44.9%|Medium|| +|2192|All Ancestors of a Node in a Directed Acyclic Graph||50.1%|Medium|| +|2193|Minimum Number of Moves to Make Palindrome||48.3%|Hard|| |2194|Cells in a Range on an Excel Sheet||85.7%|Easy|| -|2195|Append K Integers With Minimal Sum||23.7%|Medium|| -|2196|Create Binary Tree From Descriptions||71.2%|Medium|| -|2197|Replace Non-Coprime Numbers in Array||36.4%|Hard|| -|2198|Number of Single Divisor Triplets||55.5%|Medium|| -|2199|Finding the Topic of Each Post||46.6%|Hard|| -|2200|Find All K-Distant Indices in an Array||64.1%|Easy|| -|2201|Count Artifacts That Can Be Extracted||54.4%|Medium|| -|2202|Maximize the Topmost Element After K Moves||22.4%|Medium|| +|2195|Append K Integers With Minimal Sum||24.6%|Medium|| +|2196|Create Binary Tree From Descriptions||71.8%|Medium|| +|2197|Replace Non-Coprime Numbers in Array||36.8%|Hard|| +|2198|Number of Single Divisor Triplets||55.6%|Medium|| +|2199|Finding the Topic of Each Post||48.5%|Hard|| +|2200|Find All K-Distant Indices in an Array||64.3%|Easy|| +|2201|Count Artifacts That Can Be Extracted||54.7%|Medium|| +|2202|Maximize the Topmost Element After K Moves||22.6%|Medium|| |2203|Minimum Weighted Subgraph With the Required Paths||35.7%|Hard|| -|2204|Distance to a Cycle in Undirected Graph||70.4%|Hard|| -|2205|The Number of Users That Are Eligible for Discount||50.0%|Easy|| -|2206|Divide Array Into Equal Pairs||75.8%|Easy|| -|2207|Maximize Number of Subsequences in a String||32.1%|Medium|| -|2208|Minimum Operations to Halve Array Sum||44.5%|Medium|| -|2209|Minimum White Tiles After Covering With Carpets||33.1%|Hard|| -|2210|Count Hills and Valleys in an Array||57.1%|Easy|| -|2211|Count Collisions on a Road||41.2%|Medium|| -|2212|Maximum Points in an Archery Competition||48.0%|Medium|| -|2213|Longest Substring of One Repeating Character||30.2%|Hard|| -|2214|Minimum Health to Beat Game||56.4%|Medium|| -|2215|Find the Difference of Two Arrays||69.4%|Easy|| -|2216|Minimum Deletions to Make Array Beautiful||45.6%|Medium|| +|2204|Distance to a Cycle in Undirected Graph||71.3%|Hard|| +|2205|The Number of Users That Are Eligible for Discount||50.5%|Easy|| +|2206|Divide Array Into Equal Pairs||75.0%|Easy|| +|2207|Maximize Number of Subsequences in a String||32.4%|Medium|| +|2208|Minimum Operations to Halve Array Sum||44.8%|Medium|| +|2209|Minimum White Tiles After Covering With Carpets||33.5%|Hard|| +|2210|Count Hills and Valleys in an Array||57.5%|Easy|| +|2211|Count Collisions on a Road||41.3%|Medium|| +|2212|Maximum Points in an Archery Competition||48.5%|Medium|| +|2213|Longest Substring of One Repeating Character||30.8%|Hard|| +|2214|Minimum Health to Beat Game||57.9%|Medium|| +|2215|Find the Difference of Two Arrays||69.2%|Easy|| +|2216|Minimum Deletions to Make Array Beautiful||45.8%|Medium|| |2217|Find Palindrome With Fixed Length||34.4%|Medium|| |2218|Maximum Value of K Coins From Piles||49.0%|Hard|| -|2219|Maximum Sum Score of Array||61.4%|Medium|| +|2219|Maximum Sum Score of Array||61.0%|Medium|| |2220|Minimum Bit Flips to Convert Number||81.9%|Easy|| -|2221|Find Triangular Sum of an Array||79.1%|Medium|| -|2222|Number of Ways to Select Buildings||47.6%|Medium|| -|2223|Sum of Scores of Built Strings||34.8%|Hard|| -|2224|Minimum Number of Operations to Convert Time||64.1%|Easy|| -|2225|Find Players With Zero or One Losses||68.7%|Medium|| -|2226|Maximum Candies Allocated to K Children||35.3%|Medium|| -|2227|Encrypt and Decrypt Strings||38.5%|Hard|| +|2221|Find Triangular Sum of an Array||79.3%|Medium|| +|2222|Number of Ways to Select Buildings||49.4%|Medium|| +|2223|Sum of Scores of Built Strings||35.8%|Hard|| +|2224|Minimum Number of Operations to Convert Time||64.8%|Easy|| +|2225|Find Players With Zero or One Losses||69.5%|Medium|| +|2226|Maximum Candies Allocated to K Children||35.7%|Medium|| +|2227|Encrypt and Decrypt Strings||38.8%|Hard|| |2228|Users With Two Purchases Within Seven Days||44.7%|Medium|| -|2229|Check if an Array Is Consecutive||61.5%|Easy|| -|2230|The Users That Are Eligible for Discount||50.8%|Easy|| -|2231|Largest Number After Digit Swaps by Parity||59.4%|Easy|| -|2232|Minimize Result by Adding Parentheses to Expression||63.9%|Medium|| -|2233|Maximum Product After K Increments||40.7%|Medium|| -|2234|Maximum Total Beauty of the Gardens||27.0%|Hard|| -|2235|Add Two Integers||91.6%|Easy|| -|2236|Root Equals Sum of Children||89.1%|Easy|| -|2237|Count Positions on Street With Required Brightness||69.3%|Medium|| -|2238|Number of Times a Driver Was a Passenger||77.0%|Medium|| -|2239|Find Closest Number to Zero||46.0%|Easy|| -|2240|Number of Ways to Buy Pens and Pencils||56.3%|Medium|| -|2241|Design an ATM Machine||37.9%|Medium|| -|2242|Maximum Score of a Node Sequence||35.5%|Hard|| -|2243|Calculate Digit Sum of a String||66.5%|Easy|| -|2244|Minimum Rounds to Complete All Tasks||55.5%|Medium|| -|2245|Maximum Trailing Zeros in a Cornered Path||34.7%|Medium|| -|2246|Longest Path With Different Adjacent Characters||43.8%|Hard|| +|2229|Check if an Array Is Consecutive||61.6%|Easy|| +|2230|The Users That Are Eligible for Discount||50.9%|Easy|| +|2231|Largest Number After Digit Swaps by Parity||60.0%|Easy|| +|2232|Minimize Result by Adding Parentheses to Expression||64.2%|Medium|| +|2233|Maximum Product After K Increments||41.2%|Medium|| +|2234|Maximum Total Beauty of the Gardens||27.8%|Hard|| +|2235|Add Two Integers||90.8%|Easy|| +|2236|Root Equals Sum of Children||88.1%|Easy|| +|2237|Count Positions on Street With Required Brightness||68.4%|Medium|| +|2238|Number of Times a Driver Was a Passenger||76.3%|Medium|| +|2239|Find Closest Number to Zero||45.9%|Easy|| +|2240|Number of Ways to Buy Pens and Pencils||56.7%|Medium|| +|2241|Design an ATM Machine||38.4%|Medium|| +|2242|Maximum Score of a Node Sequence||36.9%|Hard|| +|2243|Calculate Digit Sum of a String||66.9%|Easy|| +|2244|Minimum Rounds to Complete All Tasks||56.6%|Medium|| +|2245|Maximum Trailing Zeros in a Cornered Path||35.1%|Medium|| +|2246|Longest Path With Different Adjacent Characters||44.4%|Hard|| |2247|Maximum Cost of Trip With K Highways||50.4%|Hard|| |2248|Intersection of Multiple Arrays||69.8%|Easy|| -|2249|Count Lattice Points Inside a Circle||50.4%|Medium|| -|2250|Count Number of Rectangles Containing Each Point||33.0%|Medium|| -|2251|Number of Flowers in Full Bloom||51.7%|Hard|| -|2252|Dynamic Pivoting of a Table||56.7%|Hard|| -|2253|Dynamic Unpivoting of a Table||65.4%|Hard|| -|2254|Design Video Sharing Platform||64.0%|Hard|| +|2249|Count Lattice Points Inside a Circle||50.6%|Medium|| +|2250|Count Number of Rectangles Containing Each Point||33.7%|Medium|| +|2251|Number of Flowers in Full Bloom||51.9%|Hard|| +|2252|Dynamic Pivoting of a Table||58.8%|Hard|| +|2253|Dynamic Unpivoting of a Table||66.6%|Hard|| +|2254|Design Video Sharing Platform||64.7%|Hard|| |2255|Count Prefixes of a Given String||73.2%|Easy|| -|2256|Minimum Average Difference||35.5%|Medium|| -|2257|Count Unguarded Cells in the Grid||51.9%|Medium|| +|2256|Minimum Average Difference||35.8%|Medium|| +|2257|Count Unguarded Cells in the Grid||52.0%|Medium|| |2258|Escape the Spreading Fire||34.7%|Hard|| -|2259|Remove Digit From Number to Maximize Result||47.2%|Easy|| -|2260|Minimum Consecutive Cards to Pick Up||52.8%|Medium|| -|2261|K Divisible Elements Subarrays||46.1%|Medium|| -|2262|Total Appeal of A String||55.5%|Hard|| -|2263|Make Array Non-decreasing or Non-increasing||65.6%|Hard|| -|2264|Largest 3-Same-Digit Number in String||58.9%|Easy|| -|2265|Count Nodes Equal to Average of Subtree||85.6%|Medium|| -|2266|Count Number of Texts||47.7%|Medium|| -|2267|Check if There Is a Valid Parentheses String Path||37.5%|Hard|| -|2268|Minimum Number of Keypresses||77.8%|Medium|| -|2269|Find the K-Beauty of a Number||57.4%|Easy|| -|2270|Number of Ways to Split Array||43.3%|Medium|| -|2271|Maximum White Tiles Covered by a Carpet||31.0%|Medium|| -|2272|Substring With Largest Variance||34.5%|Hard|| -|2273|Find Resultant Array After Removing Anagrams||57.3%|Easy|| +|2259|Remove Digit From Number to Maximize Result||46.9%|Easy|| +|2260|Minimum Consecutive Cards to Pick Up||52.1%|Medium|| +|2261|K Divisible Elements Subarrays||46.9%|Medium|| +|2262|Total Appeal of A String||57.5%|Hard|| +|2263|Make Array Non-decreasing or Non-increasing||67.4%|Hard|| +|2264|Largest 3-Same-Digit Number in String||58.8%|Easy|| +|2265|Count Nodes Equal to Average of Subtree||85.7%|Medium|| +|2266|Count Number of Texts||47.6%|Medium|| +|2267|Check if There Is a Valid Parentheses String Path||37.8%|Hard|| +|2268|Minimum Number of Keypresses||75.8%|Medium|| +|2269|Find the K-Beauty of a Number||57.0%|Easy|| +|2270|Number of Ways to Split Array||43.7%|Medium|| +|2271|Maximum White Tiles Covered by a Carpet||32.0%|Medium|| +|2272|Substring With Largest Variance||36.9%|Hard|| +|2273|Find Resultant Array After Removing Anagrams||57.8%|Easy|| |2274|Maximum Consecutive Floors Without Special Floors||52.2%|Medium|| -|2275|Largest Combination With Bitwise AND Greater Than Zero||71.6%|Medium|| -|2276|Count Integers in Intervals||31.5%|Hard|| -|2277|Closest Node to Path in Tree||65.4%|Hard|| -|2278|Percentage of Letter in String||73.4%|Easy|| -|2279|Maximum Bags With Full Capacity of Rocks||62.1%|Medium|| -|2280|Minimum Lines to Represent a Line Chart||22.9%|Medium|| -|2281|Sum of Total Strength of Wizards||24.5%|Hard|| -|2282|Number of People That Can Be Seen in a Grid||50.8%|Medium|| -|2283|Check if Number Has Equal Digit Count and Digit Value||74.4%|Easy|| -|2284|Sender With Largest Word Count||55.1%|Medium|| -|2285|Maximum Total Importance of Roads||60.0%|Medium|| -|2286|Booking Concert Tickets in Groups||14.9%|Hard|| -|2287|Rearrange Characters to Make Target String||57.6%|Easy|| -|2288|Apply Discount to Prices||26.4%|Medium|| -|2289|Steps to Make Array Non-decreasing||20.5%|Medium|| -|2290|Minimum Obstacle Removal to Reach Corner||48.9%|Hard|| -|2291|Maximum Profit From Trading Stocks||48.7%|Medium|| -|2292|Products With Three or More Orders in Two Consecutive Years||38.6%|Medium|| -|2293|Min Max Game||63.9%|Easy|| -|2294|Partition Array Such That Maximum Difference Is K||71.5%|Medium|| -|2295|Replace Elements in an Array||57.1%|Medium|| -|2296|Design a Text Editor||37.1%|Hard|| -|2297|Jump Game VIII||60.8%|Medium|| -|2298|Tasks Count in the Weekend||88.5%|Medium|| -|2299|Strong Password Checker II||56.6%|Easy|| -|2300|Successful Pairs of Spells and Potions||30.4%|Medium|| -|2301|Match Substring After Replacement||38.9%|Hard|| -|2302|Count Subarrays With Score Less Than K||50.9%|Hard|| -|2303|Calculate Amount Paid in Taxes||62.5%|Easy|| -|2304|Minimum Path Cost in a Grid||64.2%|Medium|| +|2275|Largest Combination With Bitwise AND Greater Than Zero||72.3%|Medium|| +|2276|Count Integers in Intervals||33.0%|Hard|| +|2277|Closest Node to Path in Tree||64.5%|Hard|| +|2278|Percentage of Letter in String||73.8%|Easy|| +|2279|Maximum Bags With Full Capacity of Rocks||62.3%|Medium|| +|2280|Minimum Lines to Represent a Line Chart||23.2%|Medium|| +|2281|Sum of Total Strength of Wizards||27.1%|Hard|| +|2282|Number of People That Can Be Seen in a Grid||49.7%|Medium|| +|2283|Check if Number Has Equal Digit Count and Digit Value||73.8%|Easy|| +|2284|Sender With Largest Word Count||55.6%|Medium|| +|2285|Maximum Total Importance of Roads||60.5%|Medium|| +|2286|Booking Concert Tickets in Groups||15.3%|Hard|| +|2287|Rearrange Characters to Make Target String||57.7%|Easy|| +|2288|Apply Discount to Prices||26.9%|Medium|| +|2289|Steps to Make Array Non-decreasing||21.4%|Medium|| +|2290|Minimum Obstacle Removal to Reach Corner||49.5%|Hard|| +|2291|Maximum Profit From Trading Stocks||46.9%|Medium|| +|2292|Products With Three or More Orders in Two Consecutive Years||39.5%|Medium|| +|2293|Min Max Game||64.2%|Easy|| +|2294|Partition Array Such That Maximum Difference Is K||72.1%|Medium|| +|2295|Replace Elements in an Array||57.5%|Medium|| +|2296|Design a Text Editor||38.7%|Hard|| +|2297|Jump Game VIII||57.2%|Medium|| +|2298|Tasks Count in the Weekend||89.1%|Medium|| +|2299|Strong Password Checker II||56.7%|Easy|| +|2300|Successful Pairs of Spells and Potions||31.1%|Medium|| +|2301|Match Substring After Replacement||39.1%|Hard|| +|2302|Count Subarrays With Score Less Than K||51.4%|Hard|| +|2303|Calculate Amount Paid in Taxes||62.8%|Easy|| +|2304|Minimum Path Cost in a Grid||65.1%|Medium|| |2305|Fair Distribution of Cookies||63.3%|Medium|| -|2306|Naming a Company||33.4%|Hard|| -|2307|Check for Contradictions in Equations||39.9%|Hard|| -|2308|Arrange Table by Gender||78.2%|Medium|| -|2309|Greatest English Letter in Upper and Lower Case||69.8%|Easy|| -|2310|Sum of Numbers With Units Digit K||24.9%|Medium|| -|2311|Longest Binary Subsequence Less Than or Equal to K||34.8%|Medium|| -|2312|Selling Pieces of Wood||47.3%|Hard|| -|2313|Minimum Flips in Binary Tree to Get Result||70.5%|Hard|| -|2314|The First Day of the Maximum Recorded Degree in Each City||77.7%|Medium|| -|2315|Count Asterisks||81.3%|Easy|| -|2316|Count Unreachable Pairs of Nodes in an Undirected Graph||38.0%|Medium|| -|2317|Maximum XOR After Operations||76.5%|Medium|| -|2318|Number of Distinct Roll Sequences||55.8%|Hard|| -|2319|Check if Matrix Is X-Matrix||67.3%|Easy|| -|2320|Count Number of Ways to Place Houses||38.8%|Medium|| -|2321|Maximum Score Of Spliced Array||54.1%|Hard|| -|2322|Minimum Score After Removals on a Tree||48.8%|Hard|| -|2323|Find Minimum Time to Finish All Jobs II||77.2%|Medium|| -|2324|Product Sales Analysis IV||82.6%|Medium|| -|2325|Decode the Message||84.0%|Easy|| -|2326|Spiral Matrix IV||74.3%|Medium|| -|2327|Number of People Aware of a Secret||44.1%|Medium|| -|2328|Number of Increasing Paths in a Grid||47.1%|Hard|| -|2329|Product Sales Analysis V||76.4%|Easy|| -|2330|Valid Palindrome IV||79.5%|Medium|| -|2331|Evaluate Boolean Binary Tree||78.9%|Easy|| -|2332|The Latest Time to Catch a Bus||21.6%|Medium|| -|2333|Minimum Sum of Squared Difference||23.7%|Medium|| -|2334|Subarray With Elements Greater Than Varying Threshold||38.3%|Hard|| -|2335|Minimum Amount of Time to Fill Cups||54.5%|Easy|| -|2336|Smallest Number in Infinite Set||71.1%|Medium|| -|2337|Move Pieces to Obtain a String||48.5%|Medium|| -|2338|Count the Number of Ideal Arrays||24.3%|Hard|| -|2339|All the Matches of the League||91.2%|Easy|| -|2340|Minimum Adjacent Swaps to Make a Valid Array||78.8%|Medium|| -|2341|Maximum Number of Pairs in Array||77.8%|Easy|| -|2342|Max Sum of a Pair With Equal Sum of Digits||52.4%|Medium|| -|2343|Query Kth Smallest Trimmed Number||39.4%|Medium|| -|2344|Minimum Deletions to Make Array Divisible||56.8%|Hard|| -|2345|Finding the Number of Visible Mountains||56.7%|Medium|| -|2346|Compute the Rank as a Percentage||47.8%|Medium|| +|2306|Naming a Company||34.0%|Hard|| +|2307|Check for Contradictions in Equations||39.6%|Hard|| +|2308|Arrange Table by Gender||78.9%|Medium|| +|2309|Greatest English Letter in Upper and Lower Case||68.8%|Easy|| +|2310|Sum of Numbers With Units Digit K||25.3%|Medium|| +|2311|Longest Binary Subsequence Less Than or Equal to K||35.7%|Medium|| +|2312|Selling Pieces of Wood||47.9%|Hard|| +|2313|Minimum Flips in Binary Tree to Get Result||68.8%|Hard|| +|2314|The First Day of the Maximum Recorded Degree in Each City||76.3%|Medium|| +|2315|Count Asterisks||81.9%|Easy|| +|2316|Count Unreachable Pairs of Nodes in an Undirected Graph||38.4%|Medium|| +|2317|Maximum XOR After Operations||77.5%|Medium|| +|2318|Number of Distinct Roll Sequences||56.5%|Hard|| +|2319|Check if Matrix Is X-Matrix||67.5%|Easy|| +|2320|Count Number of Ways to Place Houses||39.5%|Medium|| +|2321|Maximum Score Of Spliced Array||54.7%|Hard|| +|2322|Minimum Score After Removals on a Tree||50.2%|Hard|| +|2323|Find Minimum Time to Finish All Jobs II||76.4%|Medium|| +|2324|Product Sales Analysis IV||84.0%|Medium|| +|2325|Decode the Message||84.4%|Easy|| +|2326|Spiral Matrix IV||74.7%|Medium|| +|2327|Number of People Aware of a Secret||44.3%|Medium|| +|2328|Number of Increasing Paths in a Grid||47.6%|Hard|| +|2329|Product Sales Analysis V||70.7%|Easy|| +|2330|Valid Palindrome IV||76.6%|Medium|| +|2331|Evaluate Boolean Binary Tree||79.2%|Easy|| +|2332|The Latest Time to Catch a Bus||22.4%|Medium|| +|2333|Minimum Sum of Squared Difference||24.7%|Medium|| +|2334|Subarray With Elements Greater Than Varying Threshold||39.0%|Hard|| +|2335|Minimum Amount of Time to Fill Cups||55.1%|Easy|| +|2336|Smallest Number in Infinite Set||71.4%|Medium|| +|2337|Move Pieces to Obtain a String||48.0%|Medium|| +|2338|Count the Number of Ideal Arrays||24.9%|Hard|| +|2339|All the Matches of the League||89.6%|Easy|| +|2340|Minimum Adjacent Swaps to Make a Valid Array||75.8%|Medium|| +|2341|Maximum Number of Pairs in Array||77.1%|Easy|| +|2342|Max Sum of a Pair With Equal Sum of Digits||52.6%|Medium|| +|2343|Query Kth Smallest Trimmed Number||40.5%|Medium|| +|2344|Minimum Deletions to Make Array Divisible||56.9%|Hard|| +|2345|Finding the Number of Visible Mountains||44.8%|Medium|| +|2346|Compute the Rank as a Percentage||33.9%|Medium|| +|2347|Best Poker Hand||61.1%|Easy|| +|2348|Number of Zero-Filled Subarrays||56.6%|Medium|| +|2349|Design a Number Container System||46.5%|Medium|| +|2350|Shortest Impossible Sequence of Rolls||67.7%|Hard|| +|2351|First Letter to Appear Twice||77.2%|Easy|| +|2352|Equal Row and Column Pairs||71.1%|Medium|| +|2353|Design a Food Rating System||34.0%|Medium|| +|2354|Number of Excellent Pairs||45.9%|Hard|| +|2355|Maximum Number of Books You Can Take||48.4%|Hard|| +|2356|Number of Unique Subjects Taught by Each Teacher||93.7%|Easy|| +|2357|Make Array Zero by Subtracting Equal Amounts||72.1%|Easy|| +|2358|Maximum Number of Groups Entering a Competition||67.2%|Medium|| +|2359|Find Closest Node to Given Two Nodes||33.3%|Medium|| +|2360|Longest Cycle in a Graph||38.1%|Hard|| +|2361|Minimum Costs Using the Train Line||81.3%|Hard|| +|2362|Generate the Invoice||90.2%|Hard|| +|2363|Merge Similar Items||74.9%|Easy|| +|2364|Count Number of Bad Pairs||40.2%|Medium|| +|2365|Task Scheduler II||45.6%|Medium|| +|2366|Minimum Replacements to Sort the Array||38.6%|Hard|| +|2367|Number of Arithmetic Triplets||84.2%|Easy|| +|2368|Reachable Nodes With Restrictions||56.6%|Medium|| +|2369|Check if There is a Valid Partition For The Array||39.6%|Medium|| +|2370|Longest Ideal Subsequence||37.6%|Medium|| +|2371|Minimize Maximum Value in a Grid||71.5%|Hard|| +|2372|Calculate the Influence of Each Salesperson||91.6%|Medium|| +|2373|Largest Local Values in a Matrix||83.9%|Easy|| +|2374|Node With Highest Edge Score||45.6%|Medium|| +|2375|Construct Smallest Number From DI String||73.3%|Medium|| +|2376|Count Special Integers||35.7%|Hard|| +|2377|Sort the Olympic Table||80.9%|Easy|| +|2378|Choose Edges to Maximize Score in a Tree||64.8%|Medium|| +|2379|Minimum Recolors to Get K Consecutive Black Blocks||56.0%|Easy|| +|2380|Time Needed to Rearrange a Binary String||47.4%|Medium|| +|2381|Shifting Letters II||32.9%|Medium|| +|2382|Maximum Segment Sum After Removals||47.2%|Hard|| +|2383|Minimum Hours of Training to Win a Competition||40.6%|Easy|| +|2384|Largest Palindromic Number||29.7%|Medium|| +|2385|Amount of Time for Binary Tree to Be Infected||55.9%|Medium|| +|2386|Find the K-Sum of an Array||33.5%|Hard|| +|2387|Median of a Row Wise Sorted Matrix||68.7%|Medium|| +|2388|Change Null Values in a Table to the Previous Value||91.0%|Medium|| +|2389|Longest Subsequence With Limited Sum||63.2%|Easy|| +|2390|Removing Stars From a String||61.9%|Medium|| +|2391|Minimum Amount of Time to Collect Garbage||85.8%|Medium|| +|2392|Build a Matrix With Conditions||57.9%|Hard|| +|2393|Count Strictly Increasing Subarrays||79.2%|Medium|| +|2394|Employees With Deductions||66.8%|Medium|| +|2395|Find Subarrays With Equal Sum||63.3%|Easy|| +|2396|Strictly Palindromic Number||87.5%|Medium|| +|2397|Maximum Rows Covered by Columns||51.3%|Medium|| +|2398|Maximum Number of Robots Within Budget||30.3%|Hard|| +|2399|Check Distances Between Same Letters||70.9%|Easy|| +|2400|Number of Ways to Reach a Position After Exactly k Steps||30.7%|Medium|| +|2401|Longest Nice Subarray||46.4%|Medium|| +|2402|Meeting Rooms III||31.2%|Hard|| +|2403|Minimum Time to Kill All Monsters||51.9%|Hard|| +|2404|Most Frequent Even Element||49.3%|Easy|| +|2405|Optimal Partition of String||69.0%|Medium|| +|2406|Divide Intervals Into Minimum Number of Groups||32.4%|Medium|| +|2407|Longest Increasing Subsequence II||7.0%|Hard|| |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------| ------------------------------------------------------------------