diff --git a/README.md b/README.md index a6b4d862..791972c8 100755 --- a/README.md +++ b/README.md @@ -125,23 +125,23 @@ | | Easy | Medium | Hard | Total | |:--------:|:--------:|:--------:|:--------:|:--------:| -|Optimizing|36|43|16|95| -|Accepted|**272**|**343**|**103**|**718**| -|Total|466|943|378|1787| -|Perfection Rate|86.8%|87.5%|84.5%|86.8%| -|Completion Rate|58.4%|36.4%|27.2%|40.2%| +|Optimizing|36|42|16|94| +|Accepted|**272**|**346**|**103**|**721**| +|Total|466|943|379|1788| +|Perfection Rate|86.8%|87.9%|84.5%|87.0%| +|Completion Rate|58.4%|36.7%|27.2%|40.3%| |------------|----------------------------|----------------------------|----------------------------|----------------------------| ## 二. 目录 -以下已经收录了 623 道题的题解，还有 12 道题在尝试优化到 beats 100% +以下已经收录了 627 道题的题解，还有 12 道题在尝试优化到 beats 100% | No. | Title | Solution | Acceptance | Difficulty | Frequency | |:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:| |0001|Two Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum)|46.5%|Easy|| |0002|Add Two Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers)|35.5%|Medium|| |0003|Longest Substring Without Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)|31.5%|Medium|| -|0004|Median of Two Sorted Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays)|31.1%|Hard|| +|0004|Median of Two Sorted Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays)|31.2%|Hard|| |0005|Longest Palindromic Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0005.Longest-Palindromic-Substring)|30.5%|Medium|| |0006|ZigZag Conversion|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0006.ZigZag-Conversion)|38.0%|Medium|| |0007|Reverse Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer)|25.9%|Easy|| @@ -149,28 +149,28 @@ |0009|Palindrome Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number)|49.8%|Easy|| |0010|Regular Expression Matching||27.4%|Hard|| |0011|Container With Most Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water)|52.8%|Medium|| -|0012|Integer to Roman|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0012.Integer-to-Roman)|56.6%|Medium|| +|0012|Integer to Roman|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0012.Integer-to-Roman)|57.0%|Medium|| |0013|Roman to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0013.Roman-to-Integer)|56.9%|Easy|| |0014|Longest Common Prefix||36.1%|Easy|| |0015|3Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum)|28.1%|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)|49.2%|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)|49.3%|Medium|| |0018|4Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum)|34.9%|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)|35.8%|Medium|| |0020|Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses)|39.9%|Easy|| -|0021|Merge Two Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists)|56.1%|Easy|| +|0021|Merge Two Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists)|56.2%|Easy|| |0022|Generate Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses)|65.4%|Medium|| |0023|Merge k Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists)|42.8%|Hard|| |0024|Swap Nodes in Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs)|53.2%|Medium|| |0025|Reverse Nodes in k-Group|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group)|45.0%|Hard|| |0026|Remove Duplicates from Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array)|46.6%|Easy|| |0027|Remove Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element)|49.3%|Easy|| -|0028|Implement strStr()|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Implement-strStr())|35.2%|Easy|| +|0028|Implement strStr()|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Implement-strStr())|35.3%|Easy|| |0029|Divide Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0029.Divide-Two-Integers)|16.9%|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)|26.2%|Hard|| |0031|Next Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0031.Next-Permutation)|33.8%|Medium|| |0032|Longest Valid Parentheses||29.3%|Hard|| -|0033|Search in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array)|35.9%|Medium|| +|0033|Search in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array)|36.0%|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)|37.3%|Medium|| |0035|Search Insert Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0035.Search-Insert-Position)|42.8%|Easy|| |0036|Valid Sudoku|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku)|50.7%|Medium|| @@ -180,9 +180,9 @@ |0040|Combination Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II)|50.2%|Medium|| |0041|First Missing Positive|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive)|33.8%|Hard|| |0042|Trapping Rain Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)|51.3%|Hard|| -|0043|Multiply Strings||35.0%|Medium|| +|0043|Multiply Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0043.Multiply-Strings)|35.0%|Medium|| |0044|Wildcard Matching||25.4%|Hard|| -|0045|Jump Game II||31.4%|Medium|| +|0045|Jump Game II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0045.Jump-Game-II)|31.4%|Medium|| |0046|Permutations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations)|66.7%|Medium|| |0047|Permutations II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II)|49.5%|Medium|| |0048|Rotate Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image)|60.1%|Medium|| @@ -191,10 +191,10 @@ |0051|N-Queens|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens)|49.8%|Hard|| |0052|N-Queens II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II)|60.3%|Hard|| |0053|Maximum Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)|47.8%|Easy|| -|0054|Spiral Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)|36.1%|Medium|| +|0054|Spiral Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)|36.2%|Medium|| |0055|Jump Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0055.Jump-Game)|35.2%|Medium|| |0056|Merge Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals)|41.1%|Medium|| -|0057|Insert Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval)|35.1%|Medium|| +|0057|Insert Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval)|35.2%|Medium|| |0058|Length of Last Word||33.5%|Easy|| |0059|Spiral Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II)|57.9%|Medium|| |0060|Permutation Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence)|39.4%|Hard|| @@ -209,13 +209,13 @@ |0069|Sqrt(x)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrt(x))|35.1%|Easy|| |0070|Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs)|48.7%|Easy|| |0071|Simplify Path|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path)|34.7%|Medium|| -|0072|Edit Distance||46.8%|Hard|| -|0073|Set Matrix Zeroes||44.4%|Medium|| +|0072|Edit Distance||46.9%|Hard|| +|0073|Set Matrix Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0073.Set-Matrix-Zeroes)|44.4%|Medium|| |0074|Search a 2D Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0074.Search-a-2D-Matrix)|37.9%|Medium|| |0075|Sort Colors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors)|49.5%|Medium|| |0076|Minimum Window Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)|36.0%|Hard|| |0077|Combinations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations)|57.6%|Medium|| -|0078|Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)|65.2%|Medium|| +|0078|Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)|65.3%|Medium|| |0079|Word Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search)|36.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)|46.2%|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)|33.6%|Medium|| @@ -229,7 +229,7 @@ |0089|Gray Code|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code)|50.5%|Medium|| |0090|Subsets II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II)|48.9%|Medium|| |0091|Decode Ways|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways)|26.7%|Medium|| -|0092|Reverse Linked List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II)|40.6%|Medium|| +|0092|Reverse Linked List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II)|40.7%|Medium|| |0093|Restore IP Addresses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses)|37.7%|Medium|| |0094|Binary Tree Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal)|66.0%|Medium|| |0095|Unique Binary Search Trees II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II)|42.7%|Medium|| @@ -253,12 +253,12 @@ |0113|Path Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II)|49.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)|52.1%|Medium|| |0115|Distinct Subsequences||39.8%|Hard|| -|0116|Populating Next Right Pointers in Each Node||49.2%|Medium|| +|0116|Populating Next Right Pointers in Each Node||49.3%|Medium|| |0117|Populating Next Right Pointers in Each Node II||42.2%|Medium|| |0118|Pascal's Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0118.Pascal's-Triangle)|55.0%|Easy|| |0119|Pascal's Triangle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0119.Pascal's-Triangle-II)|52.3%|Easy|| |0120|Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle)|45.9%|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)|51.6%|Easy|| +|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)|51.7%|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)|58.6%|Easy|| |0123|Best Time to Buy and Sell Stock III||40.0%|Hard|| |0124|Binary Tree Maximum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum)|35.5%|Hard|| @@ -278,7 +278,7 @@ |0138|Copy List with Random Pointer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0138.Copy-List-with-Random-Pointer)|41.0%|Medium|| |0139|Word Break||41.8%|Medium|| |0140|Word Break II||34.8%|Hard|| -|0141|Linked List Cycle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle)|42.9%|Easy|| +|0141|Linked List Cycle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle)|43.0%|Easy|| |0142|Linked List Cycle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II)|39.8%|Medium|| |0143|Reorder List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List)|40.7%|Medium|| |0144|Binary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal)|57.6%|Medium|| @@ -300,7 +300,7 @@ |0160|Intersection of Two Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists)|44.1%|Easy|| |0161|One Edit Distance||33.1%|Medium|| |0162|Find Peak Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0162.Find-Peak-Element)|44.0%|Medium|| -|0163|Missing Ranges||27.0%|Easy|| +|0163|Missing Ranges||27.1%|Easy|| |0164|Maximum Gap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap)|36.9%|Hard|| |0165|Compare Version Numbers||30.5%|Medium|| |0166|Fraction to Recurring Decimal||22.3%|Medium|| @@ -318,7 +318,7 @@ |0178|Rank Scores||50.4%|Medium|| |0179|Largest Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number)|30.7%|Medium|| |0180|Consecutive Numbers||42.3%|Medium|| -|0181|Employees Earning More Than Their Managers||60.5%|Easy|| +|0181|Employees Earning More Than Their Managers||60.6%|Easy|| |0182|Duplicate Emails||64.7%|Easy|| |0183|Customers Who Never Order||57.0%|Easy|| |0184|Department Highest Salary||40.3%|Medium|| @@ -326,7 +326,7 @@ |0186|Reverse Words in a String II||45.7%|Medium|| |0187|Repeated DNA Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences)|41.5%|Medium|| |0188|Best Time to Buy and Sell Stock IV||29.8%|Hard|| -|0189|Rotate Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0189.Rotate-Array)|36.6%|Medium|| +|0189|Rotate Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0189.Rotate-Array)|36.7%|Medium|| |0190|Reverse Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits)|42.3%|Easy|| |0191|Number of 1 Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits)|53.9%|Easy|| |0192|Word Frequency||25.6%|Medium|| @@ -352,7 +352,7 @@ |0212|Word Search II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II)|37.2%|Hard|| |0213|House Robber II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II)|37.6%|Medium|| |0214|Shortest Palindrome||30.7%|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)|58.5%|Medium|| +|0215|Kth Largest Element in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array)|58.6%|Medium|| |0216|Combination Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III)|60.4%|Medium|| |0217|Contains Duplicate|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate)|56.7%|Easy|| |0218|The Skyline Problem|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem)|36.4%|Hard|| @@ -364,7 +364,7 @@ |0224|Basic Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator)|38.2%|Hard|| |0225|Implement Stack using Queues|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues)|47.6%|Easy|| |0226|Invert Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree)|67.1%|Easy|| -|0227|Basic Calculator II||38.6%|Medium|| +|0227|Basic Calculator II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0227.Basic-Calculator-II)|38.6%|Medium|| |0228|Summary Ranges|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0228.Summary-Ranges)|42.5%|Easy|| |0229|Majority Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II)|38.8%|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)|62.7%|Medium|| @@ -374,21 +374,21 @@ |0234|Palindrome Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List)|40.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)|51.9%|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)|48.9%|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)|67.0%|Easy|| +|0237|Delete Node in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List)|67.1%|Easy|| |0238|Product of Array Except Self||61.5%|Medium|| |0239|Sliding Window Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum)|44.7%|Hard|| |0240|Search a 2D Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0240.Search-a-2D-Matrix-II)|45.2%|Medium|| -|0241|Different Ways to Add Parentheses||57.3%|Medium|| -|0242|Valid Anagram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)|58.6%|Easy|| +|0241|Different Ways to Add Parentheses||57.4%|Medium|| +|0242|Valid Anagram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)|58.7%|Easy|| |0243|Shortest Word Distance||62.0%|Easy|| -|0244|Shortest Word Distance II||54.1%|Medium|| +|0244|Shortest Word Distance II||54.2%|Medium|| |0245|Shortest Word Distance III||56.0%|Medium|| |0246|Strobogrammatic Number||46.3%|Easy|| |0247|Strobogrammatic Number II||48.6%|Medium|| -|0248|Strobogrammatic Number III||40.2%|Hard|| +|0248|Strobogrammatic Number III||40.3%|Hard|| |0249|Group Shifted Strings||58.2%|Medium|| |0250|Count Univalue Subtrees||53.4%|Medium|| -|0251|Flatten 2D Vector||46.4%|Medium|| +|0251|Flatten 2D Vector||46.3%|Medium|| |0252|Meeting Rooms||55.4%|Easy|| |0253|Meeting Rooms II||46.9%|Medium|| |0254|Factor Combinations||47.4%|Medium|| @@ -398,7 +398,7 @@ |0258|Add Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0258.Add-Digits)|58.5%|Easy|| |0259|3Sum Smaller||49.0%|Medium|| |0260|Single Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III)|65.4%|Medium|| -|0261|Graph Valid Tree||43.2%|Medium|| +|0261|Graph Valid Tree||43.3%|Medium|| |0262|Trips and Users||35.1%|Hard|| |0263|Ugly Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number)|41.7%|Easy|| |0264|Ugly Number II||42.9%|Medium|| @@ -415,7 +415,7 @@ |0275|H-Index II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0275.H-Index-II)|36.3%|Medium|| |0276|Paint Fence||39.1%|Medium|| |0277|Find the Celebrity||43.8%|Medium|| -|0278|First Bad Version||37.5%|Easy|| +|0278|First Bad Version||37.6%|Easy|| |0279|Perfect Squares||49.0%|Medium|| |0280|Wiggle Sort||64.7%|Medium|| |0281|Zigzag Iterator||59.5%|Medium|| @@ -459,7 +459,7 @@ |0319|Bulb Switcher||45.4%|Medium|| |0320|Generalized Abbreviation||53.8%|Medium|| |0321|Create Maximum Number||27.6%|Hard|| -|0322|Coin Change|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change)|37.3%|Medium|| +|0322|Coin Change|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change)|37.4%|Medium|| |0323|Number of Connected Components in an Undirected Graph||57.9%|Medium|| |0324|Wiggle Sort II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II)|30.7%|Medium|| |0325|Maximum Size Subarray Sum Equals k||47.4%|Medium|| @@ -483,7 +483,7 @@ |0343|Integer Break|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break)|51.2%|Medium|| |0344|Reverse String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)|70.4%|Easy|| |0345|Reverse Vowels of a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String)|45.1%|Easy|| -|0346|Moving Average from Data Stream||73.3%|Easy|| +|0346|Moving Average from Data Stream||73.4%|Easy|| |0347|Top K Frequent Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements)|62.5%|Medium|| |0348|Design Tic-Tac-Toe||55.6%|Medium|| |0349|Intersection of Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)|64.9%|Easy|| @@ -493,7 +493,7 @@ |0353|Design Snake Game||35.9%|Medium|| |0354|Russian Doll Envelopes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes)|36.4%|Hard|| |0355|Design Twitter||31.5%|Medium|| -|0356|Line Reflection||32.9%|Medium|| +|0356|Line Reflection||33.0%|Medium|| |0357|Count Numbers with Unique Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits)|48.9%|Medium|| |0358|Rearrange String k Distance Apart||35.7%|Hard|| |0359|Logger Rate Limiter||72.3%|Easy|| @@ -513,7 +513,7 @@ |0373|Find K Pairs with Smallest Sums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums)|37.8%|Medium|| |0374|Guess Number Higher or Lower||44.7%|Easy|| |0375|Guess Number Higher or Lower II||42.2%|Medium|| -|0376|Wiggle Subsequence||40.2%|Medium|| +|0376|Wiggle Subsequence||40.3%|Medium|| |0377|Combination Sum IV||46.1%|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)|56.2%|Medium|| |0379|Design Phone Directory||48.3%|Medium|| @@ -523,7 +523,7 @@ |0383|Ransom Note||53.3%|Easy|| |0384|Shuffle an Array||54.0%|Medium|| |0385|Mini Parser|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser)|34.5%|Medium|| -|0386|Lexicographical Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0386.Lexicographical-Numbers)|54.2%|Medium|| +|0386|Lexicographical Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0386.Lexicographical-Numbers)|54.3%|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)|53.8%|Easy|| |0388|Longest Absolute File Path||42.9%|Medium|| |0389|Find the Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0389.Find-the-Difference)|57.8%|Easy|| @@ -531,7 +531,7 @@ |0391|Perfect Rectangle||31.1%|Hard|| |0392|Is Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence)|49.5%|Easy|| |0393|UTF-8 Validation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation)|38.1%|Medium|| -|0394|Decode String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String)|52.7%|Medium|| +|0394|Decode String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String)|52.8%|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)|43.6%|Medium|| |0396|Rotate Function||36.8%|Medium|| |0397|Integer Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement)|33.5%|Medium|| @@ -542,8 +542,8 @@ |0402|Remove K Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0402.Remove-K-Digits)|28.7%|Medium|| |0403|Frog Jump||41.5%|Hard|| |0404|Sum of Left Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves)|52.3%|Easy|| -|0405|Convert a Number to Hexadecimal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal)|44.4%|Easy|| -|0406|Queue Reconstruction by Height||68.4%|Medium|| +|0405|Convert a Number to Hexadecimal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal)|44.5%|Easy|| +|0406|Queue Reconstruction by Height||68.5%|Medium|| |0407|Trapping Rain Water II||44.3%|Hard|| |0408|Valid Word Abbreviation||31.4%|Easy|| |0409|Longest Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0409.Longest-Palindrome)|52.2%|Easy|| @@ -566,11 +566,11 @@ |0426|Convert Binary Search Tree to Sorted Doubly Linked List||61.3%|Medium|| |0427|Construct Quad Tree||62.7%|Medium|| |0428|Serialize and Deserialize N-ary Tree||61.6%|Hard|| -|0429|N-ary Tree Level Order Traversal||66.7%|Medium|| +|0429|N-ary Tree Level Order Traversal||66.8%|Medium|| |0430|Flatten a Multilevel Doubly Linked List||56.9%|Medium|| |0431|Encode N-ary Tree to Binary Tree||74.6%|Hard|| |0432|All O`one Data Structure||33.2%|Hard|| -|0433|Minimum Genetic Mutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation)|43.3%|Medium|| +|0433|Minimum Genetic Mutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation)|43.4%|Medium|| |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)|43.9%|Medium|| |0436|Find Right Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval)|48.5%|Medium|| @@ -588,7 +588,7 @@ |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)|56.1%|Easy|| |0449|Serialize and Deserialize BST||54.1%|Medium|| |0450|Delete Node in a BST||45.4%|Medium|| -|0451|Sort Characters By Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency)|64.4%|Medium|| +|0451|Sort Characters By Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency)|64.5%|Medium|| |0452|Minimum Number of Arrows to Burst Balloons||49.8%|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)|50.8%|Easy|| |0454|4Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II)|54.6%|Medium|| @@ -601,14 +601,14 @@ |0461|Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance)|73.2%|Easy|| |0462|Minimum Moves to Equal Array Elements II||54.4%|Medium|| |0463|Island Perimeter|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0463.Island-Perimeter)|66.7%|Easy|| -|0464|Can I Win||29.6%|Medium|| +|0464|Can I Win||29.7%|Medium|| |0465|Optimal Account Balancing||48.3%|Hard|| |0466|Count The Repetitions||28.6%|Hard|| |0467|Unique Substrings in Wraparound String||36.1%|Medium|| |0468|Validate IP Address||25.0%|Medium|| |0469|Convex Polygon||37.5%|Medium|| |0470|Implement Rand10() Using Rand7()|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0470.Implement-Rand10()-Using-Rand7())|46.1%|Medium|| -|0471|Encode String with Shortest Length||49.3%|Hard|| +|0471|Encode String with Shortest Length||49.2%|Hard|| |0472|Concatenated Words||44.0%|Hard|| |0473|Matchsticks to Square||38.3%|Medium|| |0474|Ones and Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes)|43.7%|Medium|| @@ -624,8 +624,8 @@ |0484|Find Permutation||64.2%|Medium|| |0485|Max Consecutive Ones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0485.Max-Consecutive-Ones)|52.8%|Easy|| |0486|Predict the Winner||48.9%|Medium|| -|0487|Max Consecutive Ones II||47.9%|Medium|| -|0488|Zuma Game||38.3%|Hard|| +|0487|Max Consecutive Ones II||48.0%|Medium|| +|0488|Zuma Game||38.2%|Hard|| |0489|Robot Room Cleaner||72.6%|Hard|| |0490|The Maze||52.8%|Medium|| |0491|Increasing Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences)|47.5%|Medium|| @@ -685,7 +685,7 @@ |0545|Boundary of Binary Tree||40.0%|Medium|| |0546|Remove Boxes||44.1%|Hard|| |0547|Number of Provinces|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Number-of-Provinces)|60.5%|Medium|| -|0548|Split Array with Equal Sum||48.0%|Medium|| +|0548|Split Array with Equal Sum||48.1%|Medium|| |0549|Binary Tree Longest Consecutive Sequence II||47.3%|Medium|| |0550|Game Play Analysis IV||45.6%|Medium|| |0551|Student Attendance Record I||46.0%|Easy|| @@ -700,14 +700,14 @@ |0560|Subarray Sum Equals K||43.7%|Medium|| |0561|Array Partition I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0561.Array-Partition-I)|73.3%|Easy|| |0562|Longest Line of Consecutive One in Matrix||46.2%|Medium|| -|0563|Binary Tree Tilt|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt)|53.0%|Easy|| +|0563|Binary Tree Tilt|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt)|53.1%|Easy|| |0564|Find the Closest Palindrome||20.3%|Hard|| |0565|Array Nesting||56.0%|Medium|| |0566|Reshape the Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0566.Reshape-the-Matrix)|61.1%|Easy|| |0567|Permutation in String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String)|44.6%|Medium|| |0568|Maximum Vacation Days||41.6%|Hard|| |0569|Median Employee Salary||61.9%|Hard|| -|0570|Managers with at Least 5 Direct Reports||66.8%|Medium|| +|0570|Managers with at Least 5 Direct Reports||66.9%|Medium|| |0571|Find Median Given Frequency of Numbers||45.5%|Hard|| |0572|Subtree of Another Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0572.Subtree-of-Another-Tree)|44.5%|Easy|| |0573|Squirrel Simulation||54.1%|Medium|| @@ -717,13 +717,13 @@ |0577|Employee Bonus||71.6%|Easy|| |0578|Get Highest Answer Rate Question||41.8%|Medium|| |0579|Find Cumulative Salary of an Employee||38.5%|Hard|| -|0580|Count Student Number in Departments||51.9%|Medium|| +|0580|Count Student Number in Departments||51.8%|Medium|| |0581|Shortest Unsorted Continuous Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0581.Shortest-Unsorted-Continuous-Subarray)|32.8%|Medium|| |0582|Kill Process||63.8%|Medium|| |0583|Delete Operation for Two Strings||50.1%|Medium|| |0584|Find Customer Referee||74.1%|Easy|| |0585|Investments in 2016||57.1%|Medium|| -|0586|Customer Placing the Largest Number of Orders||75.4%|Easy|| +|0586|Customer Placing the Largest Number of Orders||75.3%|Easy|| |0587|Erect the Fence||36.5%|Hard|| |0588|Design In-Memory File System||46.6%|Hard|| |0589|N-ary Tree Preorder Traversal||73.4%|Easy|| @@ -738,7 +738,7 @@ |0598|Range Addition II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0598.Range-Addition-II)|50.1%|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)|51.8%|Easy|| |0600|Non-negative Integers without Consecutive Ones||34.7%|Hard|| -|0601|Human Traffic of Stadium||45.2%|Hard|| +|0601|Human Traffic of Stadium||45.3%|Hard|| |0602|Friend Requests II: Who Has the Most Friends||57.5%|Medium|| |0603|Consecutive Available Seats||66.1%|Easy|| |0604|Design Compressed String Iterator||38.2%|Easy|| @@ -753,16 +753,16 @@ |0613|Shortest Distance in a Line||79.7%|Easy|| |0614|Second Degree Follower||32.6%|Medium|| |0615|Average Salary: Departments VS Company||52.7%|Hard|| -|0616|Add Bold Tag in String||44.7%|Medium|| +|0616|Add Bold Tag in String||44.8%|Medium|| |0617|Merge Two Binary Trees||75.4%|Easy|| |0618|Students Report By Geography||60.1%|Hard|| -|0619|Biggest Single Number||45.0%|Easy|| +|0619|Biggest Single Number||44.9%|Easy|| |0620|Not Boring Movies||69.9%|Easy|| |0621|Task Scheduler||52.0%|Medium|| |0622|Design Circular Queue||45.8%|Medium|| |0623|Add One Row to Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0623.Add-One-Row-to-Tree)|53.1%|Medium|| |0624|Maximum Distance in Arrays||39.6%|Medium|| -|0625|Minimum Factorization||33.0%|Medium|| +|0625|Minimum Factorization||32.9%|Medium|| |0626|Exchange Seats||65.8%|Medium|| |0627|Swap Salary||77.8%|Easy|| |0628|Maximum Product of Three Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)|46.9%|Easy|| @@ -772,13 +772,13 @@ |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)|54.3%|Hard|| |0633|Sum of Square Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0633.Sum-of-Square-Numbers)|32.6%|Medium|| |0634|Find the Derangement of An Array||40.6%|Medium|| -|0635|Design Log Storage System||59.9%|Medium|| +|0635|Design Log Storage System||60.0%|Medium|| |0636|Exclusive Time of Functions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions)|54.6%|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)|66.0%|Easy|| -|0638|Shopping Offers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers)|52.9%|Medium|| +|0638|Shopping Offers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers)|53.0%|Medium|| |0639|Decode Ways II||27.6%|Hard|| |0640|Solve the Equation||42.8%|Medium|| -|0641|Design Circular Deque||56.1%|Medium|| +|0641|Design Circular Deque||56.2%|Medium|| |0642|Design Search Autocomplete System||46.3%|Hard|| |0643|Maximum Average Subarray I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0643.Maximum-Average-Subarray-I)|42.0%|Easy|| |0644|Maximum Average Subarray II||34.1%|Hard|| @@ -793,14 +793,14 @@ |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)|56.3%|Easy|| |0654|Maximum Binary Tree||81.2%|Medium|| |0655|Print Binary Tree||56.2%|Medium|| -|0656|Coin Path||29.6%|Hard|| +|0656|Coin Path||29.7%|Hard|| |0657|Robot Return to Origin||73.9%|Easy|| -|0658|Find K Closest Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements)|42.0%|Medium|| +|0658|Find K Closest Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements)|42.1%|Medium|| |0659|Split Array into Consecutive Subsequences||44.4%|Medium|| |0660|Remove 9||54.2%|Hard|| |0661|Image Smoother|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0661.Image-Smoother)|52.3%|Easy|| |0662|Maximum Width of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree)|39.8%|Medium|| -|0663|Equal Tree Partition||39.7%|Medium|| +|0663|Equal Tree Partition||39.8%|Medium|| |0664|Strange Printer||41.5%|Hard|| |0665|Non-decreasing Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0665.Non-decreasing-Array)|19.8%|Medium|| |0666|Path Sum IV||56.4%|Medium|| @@ -812,20 +812,20 @@ |0672|Bulb Switcher II||51.1%|Medium|| |0673|Number of Longest Increasing Subsequence||38.5%|Medium|| |0674|Longest Continuous Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0674.Longest-Continuous-Increasing-Subsequence)|46.0%|Easy|| -|0675|Cut Off Trees for Golf Event||35.4%|Hard|| +|0675|Cut Off Trees for Golf Event||35.3%|Hard|| |0676|Implement Magic Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary)|55.3%|Medium|| |0677|Map Sum Pairs||54.0%|Medium|| |0678|Valid Parenthesis String||31.7%|Medium|| |0679|24 Game||47.2%|Hard|| |0680|Valid Palindrome II||37.1%|Easy|| |0681|Next Closest Time||45.9%|Medium|| -|0682|Baseball Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game)|67.1%|Easy|| +|0682|Baseball Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game)|67.2%|Easy|| |0683|K Empty Slots||36.1%|Hard|| |0684|Redundant Connection|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection)|59.0%|Medium|| |0685|Redundant Connection II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II)|33.0%|Hard|| |0686|Repeated String Match||32.9%|Medium|| |0687|Longest Univalue Path||37.3%|Medium|| -|0688|Knight Probability in Chessboard||50.1%|Medium|| +|0688|Knight Probability in Chessboard||50.2%|Medium|| |0689|Maximum Sum of 3 Non-Overlapping Subarrays||47.2%|Hard|| |0690|Employee Importance||58.8%|Easy|| |0691|Stickers to Spell Word||44.8%|Hard|| @@ -833,17 +833,17 @@ |0693|Binary Number with Alternating Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits)|59.9%|Easy|| |0694|Number of Distinct Islands||57.9%|Medium|| |0695|Max Area of Island|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0695.Max-Area-of-Island)|64.9%|Medium|| -|0696|Count Binary Substrings||57.6%|Easy|| +|0696|Count Binary Substrings||57.7%|Easy|| |0697|Degree of an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0697.Degree-of-an-Array)|54.5%|Easy|| |0698|Partition to K Equal Sum Subsets||45.7%|Medium|| |0699|Falling Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares)|42.6%|Hard|| |0700|Search in a Binary Search Tree||73.4%|Easy|| |0701|Insert into a Binary Search Tree||75.5%|Medium|| |0702|Search in a Sorted Array of Unknown Size||68.9%|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)|50.7%|Easy|| +|0703|Kth Largest Element in a Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0703.Kth-Largest-Element-in-a-Stream)|50.8%|Easy|| |0704|Binary Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0704.Binary-Search)|54.1%|Easy|| |0705|Design HashSet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet)|64.6%|Easy|| -|0706|Design HashMap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap)|64.3%|Easy|| +|0706|Design HashMap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap)|64.2%|Easy|| |0707|Design Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List)|25.9%|Medium|| |0708|Insert into a Sorted Circular Linked List||32.5%|Medium|| |0709|To Lower Case||80.2%|Easy|| @@ -853,7 +853,7 @@ |0713|Subarray Product Less Than K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K)|40.5%|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)|56.2%|Medium|| |0715|Range Module|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module)|40.3%|Hard|| -|0716|Max Stack||43.1%|Easy|| +|0716|Max Stack||43.0%|Easy|| |0717|1-bit and 2-bit Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters)|47.1%|Easy|| |0718|Maximum Length of Repeated Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0718.Maximum-Length-of-Repeated-Subarray)|50.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)|32.6%|Hard|| @@ -872,7 +872,7 @@ |0732|My Calendar III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III)|62.0%|Hard|| |0733|Flood Fill|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill)|55.9%|Easy|| |0734|Sentence Similarity||42.4%|Easy|| -|0735|Asteroid Collision|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision)|43.3%|Medium|| +|0735|Asteroid Collision|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision)|43.2%|Medium|| |0736|Parse Lisp Expression||49.8%|Hard|| |0737|Sentence Similarity II||46.6%|Medium|| |0738|Monotone Increasing Digits||45.7%|Medium|| @@ -886,7 +886,7 @@ |0746|Min Cost Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs)|50.9%|Easy|| |0747|Largest Number At Least Twice of Others||43.0%|Easy|| |0748|Shortest Completing Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word)|57.5%|Easy|| -|0749|Contain Virus||48.3%|Hard|| +|0749|Contain Virus||48.2%|Hard|| |0750|Number Of Corner Rectangles||67.2%|Medium|| |0751|IP to CIDR||59.5%|Medium|| |0752|Open the Lock||52.9%|Medium|| @@ -894,7 +894,7 @@ |0754|Reach a Number||40.5%|Medium|| |0755|Pour Water||44.1%|Medium|| |0756|Pyramid Transition Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix)|55.6%|Medium|| -|0757|Set Intersection Size At Least Two||42.5%|Hard|| +|0757|Set Intersection Size At Least Two||42.6%|Hard|| |0758|Bold Words in String||47.4%|Easy|| |0759|Employee Free Time||68.3%|Hard|| |0760|Find Anagram Mappings||81.9%|Easy|| @@ -907,10 +907,10 @@ |0767|Reorganize String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String)|50.2%|Medium|| |0768|Max Chunks To Make Sorted II||49.8%|Hard|| |0769|Max Chunks To Make Sorted||55.7%|Medium|| -|0770|Basic Calculator IV||54.3%|Hard|| +|0770|Basic Calculator IV||54.2%|Hard|| |0771|Jewels and Stones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0771.Jewels-and-Stones)|86.9%|Easy|| -|0772|Basic Calculator III||43.7%|Hard|| -|0773|Sliding Puzzle||60.9%|Hard|| +|0772|Basic Calculator III||43.8%|Hard|| +|0773|Sliding Puzzle||61.0%|Hard|| |0774|Minimize Max Distance to Gas Station||48.3%|Hard|| |0775|Global and Local Inversions||42.6%|Medium|| |0776|Split BST||56.6%|Medium|| @@ -925,12 +925,12 @@ |0785|Is Graph Bipartite?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0785.Is-Graph-Bipartite?)|48.6%|Medium|| |0786|K-th Smallest Prime Fraction|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction)|42.8%|Hard|| |0787|Cheapest Flights Within K Stops||39.6%|Medium|| -|0788|Rotated Digits||57.1%|Easy|| +|0788|Rotated Digits||57.2%|Easy|| |0789|Escape The Ghosts||58.4%|Medium|| |0790|Domino and Tromino Tiling||40.2%|Medium|| |0791|Custom Sort String||65.9%|Medium|| |0792|Number of Matching Subsequences||48.2%|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)|40.7%|Hard|| +|0793|Preimage Size of Factorial Zeroes Function|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function)|40.6%|Hard|| |0794|Valid Tic-Tac-Toe State||33.7%|Medium|| |0795|Number of Subarrays with Bounded Maximum||47.7%|Medium|| |0796|Rotate String||49.2%|Easy|| @@ -964,7 +964,7 @@ |0824|Goat Latin||66.6%|Easy|| |0825|Friends Of Appropriate Ages||44.2%|Medium|| |0826|Most Profit Assigning Work|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work)|39.2%|Medium|| -|0827|Making A Large Island||47.4%|Hard|| +|0827|Making A Large Island||47.3%|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)|46.8%|Hard|| |0829|Consecutive Numbers Sum||39.3%|Hard|| |0830|Positions of Large Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0830.Positions-of-Large-Groups)|50.4%|Easy|| @@ -973,13 +973,13 @@ |0833|Find And Replace in String||51.5%|Medium|| |0834|Sum of Distances in Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree)|46.2%|Hard|| |0835|Image Overlap||61.8%|Medium|| -|0836|Rectangle Overlap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap)|44.2%|Easy|| +|0836|Rectangle Overlap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap)|44.1%|Easy|| |0837|New 21 Game||35.4%|Medium|| |0838|Push Dominoes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes)|49.9%|Medium|| |0839|Similar String Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups)|41.0%|Hard|| |0840|Magic Squares In Grid||37.9%|Medium|| |0841|Keys and Rooms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0841.Keys-and-Rooms)|65.4%|Medium|| -|0842|Split Array into Fibonacci Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)|36.9%|Medium|| +|0842|Split Array into Fibonacci Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)|37.0%|Medium|| |0843|Guess the Word||46.5%|Hard|| |0844|Backspace String Compare|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare)|47.1%|Easy|| |0845|Longest Mountain in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array)|38.6%|Medium|| @@ -1023,7 +1023,7 @@ |0883|Projection Area of 3D Shapes||68.3%|Easy|| |0884|Uncommon Words from Two Sentences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences)|64.2%|Easy|| |0885|Spiral Matrix III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III)|70.9%|Medium|| -|0886|Possible Bipartition||45.1%|Medium|| +|0886|Possible Bipartition||45.2%|Medium|| |0887|Super Egg Drop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop)|27.0%|Hard|| |0888|Fair Candy Swap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0888.Fair-Candy-Swap)|59.1%|Easy|| |0889|Construct Binary Tree from Preorder and Postorder Traversal||67.7%|Medium|| @@ -1051,7 +1051,7 @@ |0911|Online Election|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election)|51.4%|Medium|| |0912|Sort an Array||64.6%|Medium|| |0913|Cat and Mouse||34.8%|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)|34.1%|Easy|| +|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)|34.2%|Easy|| |0915|Partition Array into Disjoint Intervals||46.2%|Medium|| |0916|Word Subsets||48.1%|Medium|| |0917|Reverse Only Letters||59.0%|Easy|| @@ -1064,8 +1064,8 @@ |0924|Minimize Malware Spread|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0924.Minimize-Malware-Spread)|41.9%|Hard|| |0925|Long Pressed Name|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name)|37.8%|Easy|| |0926|Flip String to Monotone Increasing||53.3%|Medium|| -|0927|Three Equal Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0927.Three-Equal-Parts)|34.6%|Hard|| -|0928|Minimize Malware Spread II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II)|41.4%|Hard|| +|0927|Three Equal Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0927.Three-Equal-Parts)|34.7%|Hard|| +|0928|Minimize Malware Spread II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II)|41.3%|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)|44.6%|Medium|| |0931|Minimum Falling Path Sum||63.5%|Medium|| @@ -1082,7 +1082,7 @@ |0942|DI String Match|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match)|73.6%|Easy|| |0943|Find the Shortest Superstring||43.4%|Hard|| |0944|Delete Columns to Make Sorted||70.9%|Easy|| -|0945|Minimum Increment to Make Array Unique||46.7%|Medium|| +|0945|Minimum Increment to Make Array Unique||46.8%|Medium|| |0946|Validate Stack Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences)|64.4%|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)|55.4%|Medium|| |0948|Bag of Tokens||46.1%|Medium|| @@ -1099,10 +1099,10 @@ |0959|Regions Cut By Slashes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes)|67.2%|Medium|| |0960|Delete Columns to Make Sorted III||54.9%|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)|74.5%|Easy|| -|0962|Maximum Width Ramp||46.6%|Medium|| +|0962|Maximum Width Ramp||46.5%|Medium|| |0963|Minimum Area Rectangle II||51.9%|Medium|| |0964|Least Operators to Express Number||45.1%|Hard|| -|0965|Univalued Binary Tree||67.9%|Easy|| +|0965|Univalued Binary Tree||67.8%|Easy|| |0966|Vowel Spellchecker||47.9%|Medium|| |0967|Numbers With Same Consecutive Differences||44.9%|Medium|| |0968|Binary Tree Cameras|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0968.Binary-Tree-Cameras)|38.8%|Hard|| @@ -1118,9 +1118,9 @@ |0978|Longest Turbulent Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray)|46.7%|Medium|| |0979|Distribute Coins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree)|69.8%|Medium|| |0980|Unique Paths III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III)|77.1%|Hard|| -|0981|Time Based Key-Value Store|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store)|54.1%|Medium|| +|0981|Time Based Key-Value Store|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store)|54.2%|Medium|| |0982|Triples with Bitwise AND Equal To Zero||56.3%|Hard|| -|0983|Minimum Cost For Tickets||62.8%|Medium|| +|0983|Minimum Cost For Tickets||62.7%|Medium|| |0984|String Without AAA or BBB|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB)|38.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)|60.7%|Easy|| |0986|Interval List Intersections|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections)|68.4%|Medium|| @@ -1137,7 +1137,7 @@ |0997|Find the Town Judge||49.8%|Easy|| |0998|Maximum Binary Tree II||64.0%|Medium|| |0999|Available Captures for Rook|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0999.Available-Captures-for-Rook)|67.8%|Easy|| -|1000|Minimum Cost to Merge Stones||40.6%|Hard|| +|1000|Minimum Cost to Merge Stones||40.5%|Hard|| |1001|Grid Illumination||36.5%|Hard|| |1002|Find Common Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1002.Find-Common-Characters)|68.6%|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)|56.5%|Medium|| @@ -1148,7 +1148,7 @@ |1008|Construct Binary Search Tree from Preorder Traversal||78.8%|Medium|| |1009|Complement of Base 10 Integer||61.5%|Easy|| |1010|Pairs of Songs With Total Durations Divisible by 60||50.4%|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)|59.8%|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)|59.7%|Medium|| |1012|Numbers With Repeated Digits||37.8%|Hard|| |1013|Partition Array Into Three Parts With Equal Sum||48.6%|Easy|| |1014|Best Sightseeing Pair||52.9%|Medium|| @@ -1165,9 +1165,9 @@ |1025|Divisor Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game)|66.1%|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)|69.5%|Medium|| |1027|Longest Arithmetic Subsequence||49.8%|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)|70.9%|Hard|| -|1029|Two City Scheduling||58.0%|Medium|| -|1030|Matrix Cells in Distance Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order)|67.0%|Easy|| +|1028|Recover a Tree From Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal)|71.0%|Hard|| +|1029|Two City Scheduling||58.1%|Medium|| +|1030|Matrix Cells in Distance Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order)|67.1%|Easy|| |1031|Maximum Sum of Two Non-Overlapping Subarrays||58.9%|Medium|| |1032|Stream of Characters||48.6%|Hard|| |1033|Moving Stones Until Consecutive||43.2%|Easy|| @@ -1176,7 +1176,7 @@ |1036|Escape a Large Maze||34.4%|Hard|| |1037|Valid Boomerang|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1037.Valid-Boomerang)|37.8%|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)|82.4%|Medium|| -|1039|Minimum Score Triangulation of Polygon||50.1%|Medium|| +|1039|Minimum Score Triangulation of Polygon||50.2%|Medium|| |1040|Moving Stones Until Consecutive II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II)|54.1%|Medium|| |1041|Robot Bounded In Circle||55.1%|Medium|| |1042|Flower Planting With No Adjacent||48.8%|Medium|| @@ -1195,7 +1195,7 @@ |1055|Shortest Way to Form String||57.2%|Medium|| |1056|Confusing Number||47.0%|Easy|| |1057|Campus Bikes||57.7%|Medium|| -|1058|Minimize Rounding Error to Meet Target||43.2%|Medium|| +|1058|Minimize Rounding Error to Meet Target||43.3%|Medium|| |1059|All Paths from Source Lead to Destination||43.0%|Medium|| |1060|Missing Element in Sorted Array||54.8%|Medium|| |1061|Lexicographically Smallest Equivalent String||66.7%|Medium|| @@ -1208,7 +1208,7 @@ |1068|Product Sales Analysis I||82.1%|Easy|| |1069|Product Sales Analysis II||83.2%|Easy|| |1070|Product Sales Analysis III||49.9%|Medium|| -|1071|Greatest Common Divisor of Strings||51.1%|Easy|| +|1071|Greatest Common Divisor of Strings||51.2%|Easy|| |1072|Flip Columns For Maximum Number of Equal Rows||61.5%|Medium|| |1073|Adding Two Negabinary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers)|34.9%|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)|61.8%|Hard|| @@ -1233,8 +1233,8 @@ |1093|Statistics from a Large Sample|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1093.Statistics-from-a-Large-Sample)|49.4%|Medium|| |1094|Car Pooling||59.7%|Medium|| |1095|Find in Mountain Array||36.1%|Hard|| -|1096|Brace Expansion II||62.5%|Hard|| -|1097|Game Play Analysis V||56.4%|Hard|| +|1096|Brace Expansion II||62.6%|Hard|| +|1097|Game Play Analysis V||56.5%|Hard|| |1098|Unpopular Books||45.5%|Medium|| |1099|Two Sum Less Than K||60.8%|Easy|| |1100|Find K-Length Substrings With No Repeated Characters||73.1%|Medium|| @@ -1256,15 +1256,15 @@ |1116|Print Zero Even Odd||57.7%|Medium|| |1117|Building H2O||53.1%|Medium|| |1118|Number of Days in a Month||57.3%|Easy|| -|1119|Remove Vowels from a String||90.4%|Easy|| +|1119|Remove Vowels from a String||90.5%|Easy|| |1120|Maximum Average Subtree||63.6%|Medium|| |1121|Divide Array Into Increasing Sequences||58.2%|Hard|| |1122|Relative Sort Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array)|68.1%|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)|68.0%|Medium|| |1124|Longest Well-Performing Interval||33.3%|Medium|| |1125|Smallest Sufficient Team||47.1%|Hard|| -|1126|Active Businesses||68.6%|Medium|| -|1127|User Purchase Platform||50.5%|Hard|| +|1126|Active Businesses||68.5%|Medium|| +|1127|User Purchase Platform||50.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.4%|Easy|| |1129|Shortest Path with Alternating Colors||40.2%|Medium|| |1130|Minimum Cost Tree From Leaf Values||67.3%|Medium|| @@ -1280,7 +1280,7 @@ |1140|Stone Game II||64.7%|Medium|| |1141|User Activity for the Past 30 Days I||54.5%|Easy|| |1142|User Activity for the Past 30 Days II||35.3%|Easy|| -|1143|Longest Common Subsequence||58.6%|Medium|| +|1143|Longest Common Subsequence||58.7%|Medium|| |1144|Decrease Elements To Make Array Zigzag||46.2%|Medium|| |1145|Binary Tree Coloring Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game)|51.3%|Medium|| |1146|Snapshot Array||36.8%|Medium|| @@ -1288,10 +1288,10 @@ |1148|Article Views I||77.1%|Easy|| |1149|Article Views II||48.2%|Medium|| |1150|Check If a Number Is Majority Element in a Sorted Array||57.4%|Easy|| -|1151|Minimum Swaps to Group All 1's Together||58.7%|Medium|| +|1151|Minimum Swaps to Group All 1's Together||58.8%|Medium|| |1152|Analyze User Website Visit Pattern||43.2%|Medium|| |1153|String Transforms Into Another String||35.8%|Hard|| -|1154|Day of the Year|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year)|49.2%|Easy|| +|1154|Day of the Year|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year)|49.1%|Easy|| |1155|Number of Dice Rolls With Target Sum||47.6%|Medium|| |1156|Swap For Longest Repeated Character Substring||47.1%|Medium|| |1157|Online Majority Element In Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray)|39.7%|Hard|| @@ -1301,13 +1301,13 @@ |1161|Maximum Level Sum of a Binary Tree||69.4%|Medium|| |1162|As Far from Land as Possible||45.4%|Medium|| |1163|Last Substring in Lexicographical Order||36.3%|Hard|| -|1164|Product Price at a Given Date||68.6%|Medium|| +|1164|Product Price at a Given Date||68.7%|Medium|| |1165|Single-Row Keyboard||85.6%|Easy|| |1166|Design File System||58.5%|Medium|| |1167|Minimum Cost to Connect Sticks||64.5%|Medium|| |1168|Optimize Water Distribution in a Village||61.2%|Hard|| |1169|Invalid Transactions||30.9%|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)|59.8%|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)|59.9%|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)|41.5%|Medium|| |1172|Dinner Plate Stacks||37.7%|Hard|| |1173|Immediate Food Delivery I||82.5%|Easy|| @@ -1315,7 +1315,7 @@ |1175|Prime Arrangements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1175.Prime-Arrangements)|52.0%|Easy|| |1176|Diet Plan Performance||53.8%|Easy|| |1177|Can Make Palindrome from Substring||36.1%|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)|39.3%|Hard|| +|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)|39.4%|Hard|| |1179|Reformat Department Table||82.0%|Easy|| |1180|Count Substrings with Only One Distinct Letter||77.7%|Easy|| |1181|Before and After Puzzle||44.5%|Medium|| @@ -1325,7 +1325,7 @@ |1185|Day of the Week|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week)|61.3%|Easy|| |1186|Maximum Subarray Sum with One Deletion||38.8%|Medium|| |1187|Make Array Strictly Increasing||42.0%|Hard|| -|1188|Design Bounded Blocking Queue||72.9%|Medium|| +|1188|Design Bounded Blocking Queue||72.7%|Medium|| |1189|Maximum Number of Balloons|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons)|61.9%|Easy|| |1190|Reverse Substrings Between Each Pair of Parentheses||64.1%|Medium|| |1191|K-Concatenation Maximum Sum||25.2%|Medium|| @@ -1333,7 +1333,7 @@ |1193|Monthly Transactions I||69.1%|Medium|| |1194|Tournament Winners||52.4%|Hard|| |1195|Fizz Buzz Multithreaded||70.7%|Medium|| -|1196|How Many Apples Can You Put into the Basket||68.1%|Easy|| +|1196|How Many Apples Can You Put into the Basket||68.2%|Easy|| |1197|Minimum Knight Moves||37.3%|Medium|| |1198|Find Smallest Common Element in All Rows||75.3%|Medium|| |1199|Minimum Time to Build Blocks||38.6%|Hard|| @@ -1341,9 +1341,9 @@ |1201|Ugly Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III)|26.4%|Medium|| |1202|Smallest String With Swaps|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1202.Smallest-String-With-Swaps)|48.8%|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)|48.3%|Hard|| -|1204|Last Person to Fit in the Elevator||71.9%|Medium|| -|1205|Monthly Transactions II||45.6%|Medium|| -|1206|Design Skiplist||58.9%|Hard|| +|1204|Last Person to Fit in the Elevator||71.8%|Medium|| +|1205|Monthly Transactions II||45.7%|Medium|| +|1206|Design Skiplist||59.0%|Hard|| |1207|Unique Number of Occurrences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences)|71.8%|Easy|| |1208|Get Equal Substrings Within Budget|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1208.Get-Equal-Substrings-Within-Budget)|44.0%|Medium|| |1209|Remove All Adjacent Duplicates in String II||57.6%|Medium|| @@ -1356,30 +1356,30 @@ |1216|Valid Palindrome III||49.9%|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)|71.1%|Easy|| |1218|Longest Arithmetic Subsequence of Given Difference||46.7%|Medium|| -|1219|Path with Maximum Gold||65.7%|Medium|| -|1220|Count Vowels Permutation||54.1%|Hard|| +|1219|Path with Maximum Gold||65.8%|Medium|| +|1220|Count Vowels Permutation||54.0%|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.3%|Easy|| |1222|Queens That Can Attack the King||69.5%|Medium|| |1223|Dice Roll Simulation||46.7%|Hard|| |1224|Maximum Equal Frequency||35.0%|Hard|| -|1225|Report Contiguous Dates||62.9%|Hard|| -|1226|The Dining Philosophers||59.7%|Medium|| +|1225|Report Contiguous Dates||62.8%|Hard|| +|1226|The Dining Philosophers||59.8%|Medium|| |1227|Airplane Seat Assignment Probability||62.2%|Medium|| -|1228|Missing Number In Arithmetic Progression||51.3%|Easy|| +|1228|Missing Number In Arithmetic Progression||51.2%|Easy|| |1229|Meeting Scheduler||54.4%|Medium|| |1230|Toss Strange Coins||50.2%|Medium|| |1231|Divide Chocolate||53.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)|43.5%|Easy|| |1233|Remove Sub-Folders from the Filesystem||62.1%|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)|34.5%|Medium|| -|1235|Maximum Profit in Job Scheduling|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1235.Maximum-Profit-in-Job-Scheduling)|47.5%|Hard|| +|1235|Maximum Profit in Job Scheduling|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1235.Maximum-Profit-in-Job-Scheduling)|47.4%|Hard|| |1236|Web Crawler||64.7%|Medium|| -|1237|Find Positive Integer Solution for a Given Equation||69.4%|Medium|| +|1237|Find Positive Integer Solution for a Given Equation||69.5%|Medium|| |1238|Circular Permutation in Binary Representation||66.2%|Medium|| |1239|Maximum Length of a Concatenated String with Unique Characters||49.7%|Medium|| |1240|Tiling a Rectangle with the Fewest Squares||52.6%|Hard|| -|1241|Number of Comments per Post||67.9%|Easy|| -|1242|Web Crawler Multithreaded||47.6%|Medium|| +|1241|Number of Comments per Post||67.8%|Easy|| +|1242|Web Crawler Multithreaded||47.5%|Medium|| |1243|Array Transformation||50.0%|Easy|| |1244|Design A Leaderboard||66.1%|Medium|| |1245|Tree Diameter||61.1%|Medium|| @@ -1389,7 +1389,7 @@ |1249|Minimum Remove to Make Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1249.Minimum-Remove-to-Make-Valid-Parentheses)|64.2%|Medium|| |1250|Check If It Is a Good Array||56.1%|Hard|| |1251|Average Selling Price||82.6%|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.9%|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.8%|Easy|| |1253|Reconstruct a 2-Row Binary Matrix||41.6%|Medium|| |1254|Number of Closed Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1254.Number-of-Closed-Islands)|61.7%|Medium|| |1255|Maximum Score Words Formed by Letters||70.0%|Hard|| @@ -1397,27 +1397,27 @@ |1257|Smallest Common Region||61.1%|Medium|| |1258|Synonymous Sentences||63.1%|Medium|| |1259|Handshakes That Don't Cross||54.2%|Hard|| -|1260|Shift 2D Grid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1260.Shift-2D-Grid)|61.8%|Easy|| +|1260|Shift 2D Grid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1260.Shift-2D-Grid)|61.9%|Easy|| |1261|Find Elements in a Contaminated Binary Tree||74.5%|Medium|| |1262|Greatest Sum Divisible by Three||49.7%|Medium|| |1263|Minimum Moves to Move a Box to Their Target Location||43.3%|Hard|| -|1264|Page Recommendations||69.4%|Medium|| -|1265|Print Immutable Linked List in Reverse||94.2%|Medium|| +|1264|Page Recommendations||69.2%|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.4%|Easy|| |1267|Count Servers that Communicate||57.7%|Medium|| |1268|Search Suggestions System||64.7%|Medium|| |1269|Number of Ways to Stay in the Same Place After Some Steps||43.2%|Hard|| |1270|All People Report to the Given Manager||88.2%|Medium|| |1271|Hexspeak||55.4%|Easy|| -|1272|Remove Interval||58.0%|Medium|| +|1272|Remove Interval||58.1%|Medium|| |1273|Delete Tree Nodes||62.2%|Medium|| |1274|Number of Ships in a Rectangle||65.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)|52.9%|Easy|| |1276|Number of Burgers with No Waste of Ingredients||50.1%|Medium|| |1277|Count Square Submatrices with All Ones||72.8%|Medium|| |1278|Palindrome Partitioning III||60.9%|Hard|| -|1279|Traffic Light Controlled Intersection||76.0%|Easy|| -|1280|Students and Examinations||75.1%|Easy|| +|1279|Traffic Light Controlled Intersection||76.1%|Easy|| +|1280|Students and Examinations||75.0%|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)|85.6%|Easy|| |1282|Group the People Given the Group Size They Belong To||84.3%|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)|49.6%|Medium|| @@ -1426,7 +1426,7 @@ |1286|Iterator for Combination||70.9%|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)|60.1%|Easy|| |1288|Remove Covered Intervals||57.3%|Medium|| -|1289|Minimum Falling Path Sum II||62.4%|Hard|| +|1289|Minimum Falling Path Sum II||62.5%|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)|81.8%|Easy|| |1291|Sequential Digits||57.4%|Medium|| |1292|Maximum Side Length of a Square with Sum Less than or Equal to Threshold||50.8%|Medium|| @@ -1451,11 +1451,11 @@ |1311|Get Watched Videos by Your Friends||44.2%|Medium|| |1312|Minimum Insertion Steps to Make a String Palindrome||59.8%|Hard|| |1313|Decompress Run-Length Encoded List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1313.Decompress-Run-Length-Encoded-List)|85.4%|Easy|| -|1314|Matrix Block Sum||73.5%|Medium|| +|1314|Matrix Block Sum||73.6%|Medium|| |1315|Sum of Nodes with Even-Valued Grandparent||84.3%|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.7%|Easy|| -|1318|Minimum Flips to Make a OR b Equal to c||63.9%|Medium|| +|1318|Minimum Flips to Make a OR b Equal to c||64.0%|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)|55.5%|Medium|| |1320|Minimum Distance to Type a Word Using Two Fingers||61.8%|Hard|| |1321|Restaurant Growth||71.3%|Medium|| @@ -1468,21 +1468,21 @@ |1328|Break a Palindrome||46.9%|Medium|| |1329|Sort the Matrix Diagonally|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1329.Sort-the-Matrix-Diagonally)|81.8%|Medium|| |1330|Reverse Subarray To Maximize Array Value||36.7%|Hard|| -|1331|Rank Transform of an Array||57.5%|Easy|| -|1332|Remove Palindromic Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1332.Remove-Palindromic-Subsequences)|68.0%|Easy|| +|1331|Rank Transform of an Array||57.4%|Easy|| +|1332|Remove Palindromic Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1332.Remove-Palindromic-Subsequences)|68.1%|Easy|| |1333|Filter Restaurants by Vegan-Friendly, Price and Distance||57.2%|Medium|| |1334|Find the City With the Smallest Number of Neighbors at a Threshold Distance||47.1%|Medium|| -|1335|Minimum Difficulty of a Job Schedule||56.8%|Hard|| +|1335|Minimum Difficulty of a Job Schedule||56.7%|Hard|| |1336|Number of Transactions per Visit||48.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)|72.0%|Easy|| |1338|Reduce Array Size to The Half||67.7%|Medium|| |1339|Maximum Product of Splitted Binary Tree||38.3%|Medium|| -|1340|Jump Game V||59.3%|Hard|| +|1340|Jump Game V||59.2%|Hard|| |1341|Movie Rating||58.9%|Medium|| |1342|Number of Steps to Reduce a Number to Zero||85.8%|Easy|| |1343|Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold||64.8%|Medium|| |1344|Angle Between Hands of a Clock||61.3%|Medium|| -|1345|Jump Game IV||42.0%|Hard|| +|1345|Jump Game IV||41.9%|Hard|| |1346|Check If N and Its Double Exist||36.1%|Easy|| |1347|Minimum Number of Steps to Make Two Strings Anagram||75.1%|Medium|| |1348|Tweet Counts Per Frequency||36.2%|Medium|| @@ -1491,12 +1491,12 @@ |1351|Count Negative Numbers in a Sorted Matrix||75.9%|Easy|| |1352|Product of the Last K Numbers||44.7%|Medium|| |1353|Maximum Number of Events That Can Be Attended||30.5%|Medium|| -|1354|Construct Target Array With Multiple Sums||31.4%|Hard|| +|1354|Construct Target Array With Multiple Sums||31.3%|Hard|| |1355|Activity Participants||74.3%|Medium|| |1356|Sort Integers by The Number of 1 Bits||69.6%|Easy|| |1357|Apply Discount Every n Orders||66.9%|Medium|| |1358|Number of Substrings Containing All Three Characters||60.6%|Medium|| -|1359|Count All Valid Pickup and Delivery Options||56.4%|Hard|| +|1359|Count All Valid Pickup and Delivery Options||56.3%|Hard|| |1360|Number of Days Between Two Dates||46.7%|Easy|| |1361|Validate Binary Tree Nodes||43.7%|Medium|| |1362|Closest Divisors||57.7%|Medium|| @@ -1507,7 +1507,7 @@ |1367|Linked List in Binary Tree||41.1%|Medium|| |1368|Minimum Cost to Make at Least One Valid Path in a Grid||57.4%|Hard|| |1369|Get the Second Most Recent Activity||68.8%|Hard|| -|1370|Increasing Decreasing String||77.1%|Easy|| +|1370|Increasing Decreasing String||77.2%|Easy|| |1371|Find the Longest Substring Containing Vowels in Even Counts||60.9%|Medium|| |1372|Longest ZigZag Path in a Binary Tree||54.9%|Medium|| |1373|Maximum Sum BST in Binary Tree||37.3%|Hard|| @@ -1516,23 +1516,23 @@ |1376|Time Needed to Inform All Employees||56.5%|Medium|| |1377|Frog Position After T Seconds||35.2%|Hard|| |1378|Replace Employee ID With The Unique Identifier||90.1%|Easy|| -|1379|Find a Corresponding Node of a Binary Tree in a Clone of That Tree||84.7%|Medium|| +|1379|Find a Corresponding Node of a Binary Tree in a Clone of That Tree||84.6%|Medium|| |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||76.2%|Medium|| -|1382|Balance a Binary Search Tree||76.1%|Medium|| +|1382|Balance a Binary Search Tree||76.2%|Medium|| |1383|Maximum Performance of a Team||35.8%|Hard|| |1384|Total Sales Amount by Year||64.5%|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)|66.3%|Easy|| -|1386|Cinema Seat Allocation||35.8%|Medium|| +|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)|66.4%|Easy|| +|1386|Cinema Seat Allocation||35.7%|Medium|| |1387|Sort Integers by The Power Value||70.5%|Medium|| |1388|Pizza With 3n Slices||45.8%|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)|84.8%|Easy|| -|1390|Four Divisors||39.2%|Medium|| +|1390|Four Divisors||39.3%|Medium|| |1391|Check if There is a Valid Path in a Grid||44.9%|Medium|| -|1392|Longest Happy Prefix||41.9%|Hard|| +|1392|Longest Happy Prefix||42.0%|Hard|| |1393|Capital Gain/Loss||90.8%|Medium|| |1394|Find Lucky Integer in an Array||63.2%|Easy|| -|1395|Count Number of Teams||76.8%|Medium|| +|1395|Count Number of Teams||76.7%|Medium|| |1396|Design Underground System||69.7%|Medium|| |1397|Find All Good Strings||38.6%|Hard|| |1398|Customers Who Bought Products A and B but Not C||82.1%|Medium|| @@ -1541,25 +1541,25 @@ |1401|Circle and Rectangle Overlapping||42.5%|Medium|| |1402|Reducing Dishes||72.2%|Hard|| |1403|Minimum Subsequence in Non-Increasing Order||71.0%|Easy|| -|1404|Number of Steps to Reduce a Number in Binary Representation to One||49.8%|Medium|| +|1404|Number of Steps to Reduce a Number in Binary Representation to One||49.9%|Medium|| |1405|Longest Happy String||52.4%|Medium|| |1406|Stone Game III||57.5%|Hard|| -|1407|Top Travellers||83.8%|Easy|| +|1407|Top Travellers||83.9%|Easy|| |1408|String Matching in an Array||63.2%|Easy|| |1409|Queries on a Permutation With Key||81.6%|Medium|| |1410|HTML Entity Parser||54.2%|Medium|| |1411|Number of Ways to Paint N × 3 Grid||60.5%|Hard|| -|1412|Find the Quiet Students in All Exams||64.2%|Hard|| -|1413|Minimum Value to Get Positive Step by Step Sum||65.6%|Easy|| +|1412|Find the Quiet Students in All Exams||64.1%|Hard|| +|1413|Minimum Value to Get Positive Step by Step Sum||65.5%|Easy|| |1414|Find the Minimum Number of Fibonacci Numbers Whose Sum Is K||63.2%|Medium|| |1415|The k-th Lexicographical String of All Happy Strings of Length n||69.9%|Medium|| |1416|Restore The Array||36.5%|Hard|| -|1417|Reformat The String||55.1%|Easy|| +|1417|Reformat The String||55.2%|Easy|| |1418|Display Table of Food Orders in a Restaurant||69.0%|Medium|| |1419|Minimum Number of Frogs Croaking||47.5%|Medium|| |1420|Build Array Where You Can Find The Maximum Exactly K Comparisons||64.1%|Hard|| -|1421|NPV Queries||82.1%|Medium|| -|1422|Maximum Score After Splitting a String||56.1%|Easy|| +|1421|NPV Queries||82.2%|Medium|| +|1422|Maximum Score After Splitting a String||56.3%|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)|46.7%|Medium|| |1424|Diagonal Traverse II||46.1%|Medium|| |1425|Constrained Subsequence Sum||45.0%|Hard|| @@ -1572,18 +1572,18 @@ |1432|Max Difference You Can Get From Changing an Integer||42.9%|Medium|| |1433|Check If a String Can Break Another String||67.3%|Medium|| |1434|Number of Ways to Wear Different Hats to Each Other||39.4%|Hard|| -|1435|Create a Session Bar Chart||77.8%|Easy|| -|1436|Destination City||77.2%|Easy|| +|1435|Create a Session Bar Chart||77.7%|Easy|| +|1436|Destination City||77.3%|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-1's-Are-at-Least-Length-K-Places-Away)|62.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)|44.4%|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)|60.1%|Hard|| |1440|Evaluate Boolean Expression||74.9%|Medium|| -|1441|Build an Array With Stack Operations||70.3%|Easy|| +|1441|Build an Array With Stack Operations||70.4%|Easy|| |1442|Count Triplets That Can Form Two Arrays of Equal XOR||71.4%|Medium|| |1443|Minimum Time to Collect All Apples in a Tree||54.6%|Medium|| |1444|Number of Ways of Cutting a Pizza||53.8%|Hard|| |1445|Apples & Oranges||90.7%|Medium|| -|1446|Consecutive Characters||61.0%|Easy|| +|1446|Consecutive Characters||61.1%|Easy|| |1447|Simplified Fractions||62.1%|Medium|| |1448|Count Good Nodes in Binary Tree||70.9%|Medium|| |1449|Form Largest Integer With Digits That Add up to Target||44.2%|Hard|| @@ -1591,8 +1591,8 @@ |1451|Rearrange Words in a Sentence||59.6%|Medium|| |1452|People Whose List of Favorite Companies Is Not a Subset of Another List||55.0%|Medium|| |1453|Maximum Number of Darts Inside of a Circular Dartboard||35.4%|Hard|| -|1454|Active Users||38.9%|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.9%|Easy|| +|1454|Active Users||38.8%|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)|65.0%|Easy|| |1456|Maximum Number of Vowels in a Substring of Given Length||54.6%|Medium|| |1457|Pseudo-Palindromic Paths in a Binary Tree||70.5%|Medium|| |1458|Max Dot Product of Two Subsequences||43.2%|Hard|| @@ -1601,16 +1601,16 @@ |1461|Check If a String Contains All Binary Codes of Size K||47.3%|Medium|| |1462|Course Schedule IV||44.7%|Medium|| |1463|Cherry Pickup II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1463.Cherry-Pickup-II)|69.0%|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)|77.1%|Easy|| +|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)|77.2%|Easy|| |1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts||33.2%|Medium|| |1466|Reorder Routes to Make All Paths Lead to the City Zero||61.8%|Medium|| |1467|Probability of a Two Boxes Having The Same Number of Distinct Balls||60.9%|Hard|| |1468|Calculate Salaries||82.0%|Medium|| -|1469|Find All The Lonely Nodes||80.4%|Easy|| +|1469|Find All The Lonely Nodes||80.5%|Easy|| |1470|Shuffle the Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1470.Shuffle-the-Array)|88.2%|Easy|| |1471|The k Strongest Values in an Array||58.5%|Medium|| |1472|Design Browser History||71.5%|Medium|| -|1473|Paint House III||48.4%|Hard|| +|1473|Paint House III||48.5%|Hard|| |1474|Delete N Nodes After M Nodes of a Linked List||74.2%|Easy|| |1475|Final Prices With a Special Discount in a Shop||75.2%|Easy|| |1476|Subrectangle Queries||88.2%|Medium|| @@ -1627,10 +1627,10 @@ |1487|Making File Names Unique||30.7%|Medium|| |1488|Avoid Flood in The City||24.5%|Medium|| |1489|Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree||51.4%|Hard|| -|1490|Clone N-ary Tree||83.5%|Medium|| +|1490|Clone N-ary Tree||83.6%|Medium|| |1491|Average Salary Excluding the Minimum and Maximum Salary||68.5%|Easy|| |1492|The kth Factor of n||63.3%|Medium|| -|1493|Longest Subarray of 1's After Deleting One Element||57.7%|Medium|| +|1493|Longest Subarray of 1's After Deleting One Element||57.8%|Medium|| |1494|Parallel Courses II||31.2%|Hard|| |1495|Friendly Movies Streamed Last Month||51.3%|Easy|| |1496|Path Crossing||55.2%|Easy|| @@ -1638,7 +1638,7 @@ |1498|Number of Subsequences That Satisfy the Given Sum Condition||38.5%|Medium|| |1499|Max Value of Equation||45.0%|Hard|| |1500|Design a File Sharing System||46.3%|Medium|| -|1501|Countries You Can Safely Invest In||60.6%|Medium|| +|1501|Countries You Can Safely Invest In||60.7%|Medium|| |1502|Can Make Arithmetic Progression From Sequence||71.1%|Easy|| |1503|Last Moment Before All Ants Fall Out of a Plank||53.2%|Medium|| |1504|Count Submatrices With All Ones||60.8%|Medium|| @@ -1652,19 +1652,19 @@ |1512|Number of Good Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1512.Number-of-Good-Pairs)|87.7%|Easy|| |1513|Number of Substrings With Only 1s||41.9%|Medium|| |1514|Path with Maximum Probability||40.6%|Medium|| -|1515|Best Position for a Service Centre||37.6%|Hard|| -|1516|Move Sub-Tree of N-Ary Tree||63.8%|Hard|| +|1515|Best Position for a Service Centre||37.8%|Hard|| +|1516|Move Sub-Tree of N-Ary Tree||63.9%|Hard|| |1517|Find Users With Valid E-Mails||71.3%|Easy|| |1518|Water Bottles||60.5%|Easy|| -|1519|Number of Nodes in the Sub-Tree With the Same Label||37.0%|Medium|| +|1519|Number of Nodes in the Sub-Tree With the Same Label||37.1%|Medium|| |1520|Maximum Number of Non-Overlapping Substrings||36.3%|Hard|| |1521|Find a Value of a Mysterious Function Closest to Target||44.3%|Hard|| -|1522|Diameter of N-Ary Tree||68.8%|Medium|| +|1522|Diameter of N-Ary Tree||68.9%|Medium|| |1523|Count Odd Numbers in an Interval Range||54.5%|Easy|| |1524|Number of Sub-arrays With Odd Sum||39.9%|Medium|| |1525|Number of Good Ways to Split a String||66.5%|Medium|| |1526|Minimum Number of Increments on Subarrays to Form a Target Array||60.0%|Hard|| -|1527|Patients With a Condition||65.8%|Easy|| +|1527|Patients With a Condition||65.7%|Easy|| |1528|Shuffle String||85.6%|Easy|| |1529|Bulb Switcher IV||70.8%|Medium|| |1530|Number of Good Leaf Nodes Pairs||56.2%|Medium|| @@ -1692,7 +1692,7 @@ |1552|Magnetic Force Between Two Balls||48.9%|Medium|| |1553|Minimum Number of Days to Eat N Oranges||29.7%|Hard|| |1554|Strings Differ by One Character||63.5%|Medium|| -|1555|Bank Account Summary||52.9%|Medium|| +|1555|Bank Account Summary||52.8%|Medium|| |1556|Thousand Separator||57.5%|Easy|| |1557|Minimum Number of Vertices to Reach All Nodes||75.5%|Medium|| |1558|Minimum Numbers of Function Calls to Make Target Array||63.4%|Medium|| @@ -1702,44 +1702,44 @@ |1562|Find Latest Group of Size M||39.5%|Medium|| |1563|Stone Game V||39.9%|Hard|| |1564|Put Boxes Into the Warehouse I||66.0%|Medium|| -|1565|Unique Orders and Customers Per Month||83.0%|Easy|| +|1565|Unique Orders and Customers Per Month||83.1%|Easy|| |1566|Detect Pattern of Length M Repeated K or More Times||42.5%|Easy|| |1567|Maximum Length of Subarray With Positive Product||36.7%|Medium|| |1568|Minimum Number of Days to Disconnect Island||50.2%|Hard|| |1569|Number of Ways to Reorder Array to Get Same BST||50.0%|Hard|| |1570|Dot Product of Two Sparse Vectors||91.2%|Medium|| -|1571|Warehouse Manager||89.8%|Easy|| +|1571|Warehouse Manager||89.9%|Easy|| |1572|Matrix Diagonal Sum||77.8%|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)|31.2%|Medium|| |1574|Shortest Subarray to be Removed to Make Array Sorted||33.5%|Medium|| |1575|Count All Possible Routes||57.3%|Hard|| -|1576|Replace All ?'s to Avoid Consecutive Repeating Characters||48.6%|Easy|| -|1577|Number of Ways Where Square of Number Is Equal to Product of Two Numbers||37.5%|Medium|| -|1578|Minimum Deletion Cost to Avoid Repeating Letters||60.6%|Medium|| +|1576|Replace All ?'s to Avoid Consecutive Repeating Characters||48.7%|Easy|| +|1577|Number of Ways Where Square of Number Is Equal to Product of Two Numbers||37.4%|Medium|| +|1578|Minimum Deletion Cost to Avoid Repeating Letters||60.5%|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)|46.2%|Hard|| -|1580|Put Boxes Into the Warehouse II||62.3%|Medium|| +|1580|Put Boxes Into the Warehouse II||62.2%|Medium|| |1581|Customer Who Visited but Did Not Make Any Transactions||89.6%|Easy|| |1582|Special Positions in a Binary Matrix||64.4%|Easy|| |1583|Count Unhappy Friends||54.5%|Medium|| -|1584|Min Cost to Connect All Points||52.2%|Medium|| +|1584|Min Cost to Connect All Points||52.3%|Medium|| |1585|Check If String Is Transformable With Substring Sort Operations||48.3%|Hard|| |1586|Binary Search Tree Iterator II||66.6%|Medium|| |1587|Bank Account Summary II||89.8%|Easy|| |1588|Sum of All Odd Length Subarrays||81.6%|Easy|| |1589|Maximum Sum Obtained of Any Permutation||34.8%|Medium|| |1590|Make Sum Divisible by P||27.0%|Medium|| -|1591|Strange Printer II||55.0%|Hard|| +|1591|Strange Printer II||55.1%|Hard|| |1592|Rearrange Spaces Between Words||43.8%|Easy|| |1593|Split a String Into the Max Number of Unique Substrings||49.3%|Medium|| |1594|Maximum Non Negative Product in a Matrix||31.8%|Medium|| -|1595|Minimum Cost to Connect Two Groups of Points||43.3%|Hard|| +|1595|Minimum Cost to Connect Two Groups of Points||43.2%|Hard|| |1596|The Most Frequently Ordered Products for Each Customer||84.9%|Medium|| -|1597|Build Binary Expression Tree From Infix Expression||60.1%|Hard|| +|1597|Build Binary Expression Tree From Infix Expression||60.2%|Hard|| |1598|Crawler Log Folder||63.9%|Easy|| |1599|Maximum Profit of Operating a Centennial Wheel||43.7%|Medium|| |1600|Throne Inheritance||60.5%|Medium|| |1601|Maximum Number of Achievable Transfer Requests||47.8%|Hard|| -|1602|Find Nearest Right Node in Binary Tree||73.8%|Medium|| +|1602|Find Nearest Right Node in Binary Tree||73.7%|Medium|| |1603|Design Parking System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1603.Design-Parking-System)|86.3%|Easy|| |1604|Alert Using Same Key-Card Three or More Times in a One Hour Period||42.6%|Medium|| |1605|Find Valid Matrix Given Row and Column Sums||77.2%|Medium|| @@ -1748,38 +1748,38 @@ |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)|61.3%|Easy|| |1609|Even Odd Tree||52.6%|Medium|| |1610|Maximum Number of Visible Points||29.8%|Hard|| -|1611|Minimum One Bit Operations to Make Integers Zero||57.1%|Hard|| +|1611|Minimum One Bit Operations to Make Integers Zero||57.2%|Hard|| |1612|Check If Two Expression Trees are Equivalent||69.8%|Medium|| |1613|Find the Missing IDs||74.0%|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.7%|Easy|| +|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.8%|Easy|| |1615|Maximal Network Rank||52.3%|Medium|| |1616|Split Two Strings to Make Palindrome||36.2%|Medium|| -|1617|Count Subtrees With Max Distance Between Cities||63.2%|Hard|| +|1617|Count Subtrees With Max Distance Between Cities||63.1%|Hard|| |1618|Maximum Font to Fit a Sentence in a Screen||56.2%|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)|65.0%|Easy|| |1620|Coordinate With Maximum Network Quality||37.1%|Medium|| -|1621|Number of Sets of K Non-Overlapping Line Segments||41.3%|Medium|| -|1622|Fancy Sequence||15.1%|Hard|| -|1623|All Valid Triplets That Can Represent a Country||88.6%|Easy|| +|1621|Number of Sets of K Non-Overlapping Line Segments||41.2%|Medium|| +|1622|Fancy Sequence||15.0%|Hard|| +|1623|All Valid Triplets That Can Represent a Country||88.5%|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)|58.7%|Easy|| |1625|Lexicographically Smallest String After Applying Operations||64.2%|Medium|| |1626|Best Team With No Conflicts||38.1%|Medium|| |1627|Graph Connectivity With Threshold||39.1%|Hard|| |1628|Design an Expression Tree With Evaluate Function||80.5%|Medium|| -|1629|Slowest Key|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1629.Slowest-Key)|59.2%|Easy|| +|1629|Slowest Key|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1629.Slowest-Key)|59.1%|Easy|| |1630|Arithmetic Subarrays||77.5%|Medium|| |1631|Path With Minimum Effort|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1631.Path-With-Minimum-Effort)|50.1%|Medium|| |1632|Rank Transform of a Matrix||30.8%|Hard|| |1633|Percentage of Users Attended a Contest||71.0%|Easy|| |1634|Add Two Polynomials Represented as Linked Lists||55.2%|Medium|| -|1635|Hopper Company Queries I||55.6%|Hard|| +|1635|Hopper Company Queries I||55.7%|Hard|| |1636|Sort Array by Increasing Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1636.Sort-Array-by-Increasing-Frequency)|66.8%|Easy|| |1637|Widest Vertical Area Between Two Points Containing No Points||83.5%|Medium|| |1638|Count Substrings That Differ by One Character||69.5%|Medium|| |1639|Number of Ways to Form a Target String Given a Dictionary||39.7%|Hard|| -|1640|Check Array Formation Through Concatenation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1640.Check-Array-Formation-Through-Concatenation)|60.0%|Easy|| +|1640|Check Array Formation Through Concatenation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1640.Check-Array-Formation-Through-Concatenation)|59.9%|Easy|| |1641|Count Sorted Vowel Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1641.Count-Sorted-Vowel-Strings)|76.3%|Medium|| -|1642|Furthest Building You Can Reach||50.3%|Medium|| +|1642|Furthest Building You Can Reach||50.2%|Medium|| |1643|Kth Smallest Instructions||44.0%|Hard|| |1644|Lowest Common Ancestor of a Binary Tree II||56.5%|Medium|| |1645|Hopper Company Queries II||37.6%|Hard|| @@ -1788,44 +1788,44 @@ |1648|Sell Diminishing-Valued Colored Balls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls)|30.6%|Medium|| |1649|Create Sorted Array through Instructions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1649.Create-Sorted-Array-through-Instructions)|36.4%|Hard|| |1650|Lowest Common Ancestor of a Binary Tree III||76.4%|Medium|| -|1651|Hopper Company Queries III||65.7%|Hard|| -|1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|62.7%|Easy|| +|1651|Hopper Company Queries III||65.8%|Hard|| +|1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|62.5%|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)|51.4%|Medium|| |1654|Minimum Jumps to Reach Home|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1654.Minimum-Jumps-to-Reach-Home)|25.6%|Medium|| -|1655|Distribute Repeating Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1655.Distribute-Repeating-Integers)|40.0%|Hard|| -|1656|Design an Ordered Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1656.Design-an-Ordered-Stream)|82.1%|Easy|| +|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)|82.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)|55.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)|33.4%|Medium|| |1659|Maximize Grid Happiness|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1659.Maximize-Grid-Happiness)|35.6%|Hard|| -|1660|Correct a Binary Tree||77.1%|Medium|| +|1660|Correct a Binary Tree||77.2%|Medium|| |1661|Average Time of Process per Machine||79.3%|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)|82.9%|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)|64.3%|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)|62.1%|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)|66.0%|Hard|| -|1666|Change the Root of a Binary Tree||67.6%|Medium|| +|1666|Change the Root of a Binary Tree||67.5%|Medium|| |1667|Fix Names in a Table||63.2%|Easy|| |1668|Maximum Repeating Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1668.Maximum-Repeating-Substring)|38.8%|Easy|| |1669|Merge In Between Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1669.Merge-In-Between-Linked-Lists)|76.3%|Medium|| -|1670|Design Front Middle Back Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1670.Design-Front-Middle-Back-Queue)|54.4%|Medium|| +|1670|Design Front Middle Back Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1670.Design-Front-Middle-Back-Queue)|54.2%|Medium|| |1671|Minimum Number of Removals to Make Mountain Array||45.7%|Hard|| |1672|Richest Customer Wealth|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1672.Richest-Customer-Wealth)|88.2%|Easy|| |1673|Find the Most Competitive Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1673.Find-the-Most-Competitive-Subsequence)|45.4%|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)|34.9%|Medium|| -|1675|Minimize Deviation in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1675.Minimize-Deviation-in-Array)|48.4%|Hard|| +|1675|Minimize Deviation in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1675.Minimize-Deviation-in-Array)|48.3%|Hard|| |1676|Lowest Common Ancestor of a Binary Tree IV||79.2%|Medium|| -|1677|Product's Worth Over Invoices||73.4%|Easy|| +|1677|Product's Worth Over Invoices||73.5%|Easy|| |1678|Goal Parser Interpretation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1678.Goal-Parser-Interpretation)|85.4%|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)|54.0%|Medium|| |1680|Concatenation of Consecutive Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers)|52.3%|Medium|| |1681|Minimum Incompatibility|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1681.Minimum-Incompatibility)|35.6%|Hard|| -|1682|Longest Palindromic Subsequence II||51.3%|Medium|| +|1682|Longest Palindromic Subsequence II||51.4%|Medium|| |1683|Invalid Tweets||90.8%|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)|82.3%|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)|62.8%|Medium|| -|1686|Stone Game VI||49.5%|Medium|| +|1686|Stone Game VI||49.6%|Medium|| |1687|Delivering Boxes from Storage to Ports||35.0%|Hard|| -|1688|Count of Matches in Tournament|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1688.Count-of-Matches-in-Tournament)|81.6%|Easy|| +|1688|Count of Matches in Tournament|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1688.Count-of-Matches-in-Tournament)|81.5%|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)|87.2%|Medium|| |1690|Stone Game VII|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1690.Stone-Game-VII)|48.3%|Medium|| |1691|Maximum Height by Stacking Cuboids|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1691.Maximum-Height-by-Stacking-Cuboids)|50.1%|Hard|| @@ -1836,95 +1836,96 @@ |1696|Jump Game VI|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1696.Jump-Game-VI)|53.0%|Medium|| |1697|Checking Existence of Edge Length Limited Paths||54.6%|Hard|| |1698|Number of Distinct Substrings in a String||59.8%|Medium|| -|1699|Number of Calls Between Two Persons||86.6%|Medium|| +|1699|Number of Calls Between Two Persons||86.5%|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)|68.2%|Easy|| |1701|Average Waiting Time||61.4%|Medium|| -|1702|Maximum Binary String After Change||59.9%|Medium|| -|1703|Minimum Adjacent Swaps for K Consecutive Ones||39.7%|Hard|| +|1702|Maximum Binary String After Change||60.0%|Medium|| +|1703|Minimum Adjacent Swaps for K Consecutive Ones||39.8%|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.0%|Easy|| -|1705|Maximum Number of Eaten Apples||41.9%|Medium|| -|1706|Where Will the Ball Fall||60.0%|Medium|| -|1707|Maximum XOR With an Element From Array||46.9%|Hard|| -|1708|Largest Subarray Length K||62.8%|Easy|| -|1709|Biggest Window Between Visits||82.7%|Medium|| +|1705|Maximum Number of Eaten Apples||42.0%|Medium|| +|1706|Where Will the Ball Fall||59.9%|Medium|| +|1707|Maximum XOR With an Element From Array||46.8%|Hard|| +|1708|Largest Subarray Length K||62.9%|Easy|| +|1709|Biggest Window Between Visits||82.6%|Medium|| |1710|Maximum Units on a Truck|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1710.Maximum-Units-on-a-Truck)|70.3%|Easy|| |1711|Count Good Meals||26.0%|Medium|| |1712|Ways to Split Array Into Three Subarrays||29.5%|Medium|| -|1713|Minimum Operations to Make a Subsequence||45.6%|Hard|| +|1713|Minimum Operations to Make a Subsequence||45.5%|Hard|| |1714|Sum Of Special Evenly-Spaced Elements In Array||48.3%|Hard|| -|1715|Count Apples and Oranges||79.8%|Medium|| +|1715|Count Apples and Oranges||79.9%|Medium|| |1716|Calculate Money in Leetcode Bank|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1716.Calculate-Money-in-Leetcode-Bank)|66.5%|Easy|| -|1717|Maximum Score From Removing Substrings||40.3%|Medium|| +|1717|Maximum Score From Removing Substrings||40.4%|Medium|| |1718|Construct the Lexicographically Largest Valid Sequence||46.2%|Medium|| -|1719|Number Of Ways To Reconstruct A Tree||39.4%|Hard|| +|1719|Number Of Ways To Reconstruct A Tree||39.5%|Hard|| |1720|Decode XORed Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1720.Decode-XORed-Array)|85.3%|Easy|| |1721|Swapping Nodes in a Linked List||64.5%|Medium|| |1722|Minimize Hamming Distance After Swap Operations||54.5%|Medium|| -|1723|Find Minimum Time to Finish All Jobs||43.9%|Hard|| -|1724|Checking Existence of Edge Length Limited Paths II||56.7%|Hard|| +|1723|Find Minimum Time to Finish All Jobs||43.8%|Hard|| +|1724|Checking Existence of Edge Length Limited Paths II||56.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)|77.9%|Easy|| |1726|Tuple with Same Product||56.1%|Medium|| |1727|Largest Submatrix With Rearrangements||58.5%|Medium|| |1728|Cat and Mouse II||41.1%|Hard|| -|1729|Find Followers Count||71.8%|Easy|| -|1730|Shortest Path to Get Food||57.4%|Medium|| -|1731|The Number of Employees Which Report to Each Employee||49.1%|Easy|| -|1732|Find the Highest Altitude|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1732.Find-the-Highest-Altitude)|80.7%|Easy|| +|1729|Find Followers Count||71.9%|Easy|| +|1730|Shortest Path to Get Food||57.2%|Medium|| +|1731|The Number of Employees Which Report to Each Employee||49.3%|Easy|| +|1732|Find the Highest Altitude|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1732.Find-the-Highest-Altitude)|80.6%|Easy|| |1733|Minimum Number of People to Teach||37.2%|Medium|| -|1734|Decode XORed Permutation||52.4%|Medium|| -|1735|Count Ways to Make Array With Product||48.3%|Hard|| +|1734|Decode XORed Permutation||52.5%|Medium|| +|1735|Count Ways to Make Array With Product||48.4%|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)|41.1%|Easy|| |1737|Change Minimum Characters to Satisfy One of Three Conditions||29.6%|Medium|| |1738|Find Kth Largest XOR Coordinate Value||62.0%|Medium|| -|1739|Building Boxes||49.7%|Hard|| -|1740|Find Distance in a Binary Tree||69.3%|Medium|| +|1739|Building Boxes||49.6%|Hard|| +|1740|Find Distance in a Binary Tree||69.4%|Medium|| |1741|Find Total Time Spent by Each Employee||91.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)|74.7%|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)|74.6%|Easy|| |1743|Restore the Array From Adjacent Pairs||63.0%|Medium|| |1744|Can You Eat Your Favorite Candy on Your Favorite Day?||30.4%|Medium|| |1745|Palindrome Partitioning IV||49.2%|Hard|| -|1746|Maximum Subarray Sum After One Operation||63.5%|Medium|| -|1747|Leetflex Banned Accounts||70.2%|Medium|| +|1746|Maximum Subarray Sum After One Operation||63.0%|Medium|| +|1747|Leetflex Banned Accounts||70.4%|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||51.6%|Medium|| |1750|Minimum Length of String After Deleting Similar Ends||42.5%|Medium|| |1751|Maximum Number of Events That Can Be Attended II||47.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)|63.5%|Easy|| +|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)|63.3%|Easy|| |1753|Maximum Score From Removing Stones||61.2%|Medium|| -|1754|Largest Merge Of Two Strings||39.9%|Medium|| +|1754|Largest Merge Of Two Strings||40.0%|Medium|| |1755|Closest Subsequence Sum||35.7%|Hard|| |1756|Design Most Recently Used Queue||77.9%|Medium|| -|1757|Recyclable and Low Fat Products||96.1%|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.9%|Easy|| -|1759|Count Number of Homogenous Substrings||41.8%|Medium|| +|1757|Recyclable and Low Fat Products||96.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||41.9%|Medium|| |1760|Minimum Limit of Balls in a Bag||52.1%|Medium|| |1761|Minimum Degree of a Connected Trio in a Graph||37.2%|Hard|| -|1762|Buildings With an Ocean View||81.8%|Medium|| -|1763|Longest Nice Substring||61.9%|Easy|| +|1762|Buildings With an Ocean View||81.7%|Medium|| +|1763|Longest Nice Substring||61.8%|Easy|| |1764|Form Array by Concatenating Subarrays of Another Array||55.7%|Medium|| -|1765|Map of Highest Peak||54.5%|Medium|| -|1766|Tree of Coprimes||36.7%|Hard|| -|1767|Find the Subtasks That Did Not Execute||87.8%|Hard|| -|1768|Merge Strings Alternately||77.6%|Easy|| -|1769|Minimum Number of Operations to Move All Balls to Each Box||87.7%|Medium|| +|1765|Map of Highest Peak||54.4%|Medium|| +|1766|Tree of Coprimes||36.6%|Hard|| +|1767|Find the Subtasks That Did Not Execute||87.5%|Hard|| +|1768|Merge Strings Alternately||77.5%|Easy|| +|1769|Minimum Number of Operations to Move All Balls to Each Box||87.6%|Medium|| |1770|Maximum Score from Performing Multiplication Operations||28.8%|Medium|| |1771|Maximize Palindrome Length From Subsequences||34.1%|Hard|| -|1772|Sort Features by Popularity||66.2%|Medium|| -|1773|Count Items Matching a Rule||86.8%|Easy|| -|1774|Closest Dessert Cost||60.1%|Medium|| -|1775|Equal Sum Arrays With Minimum Number of Operations||50.5%|Medium|| -|1776|Car Fleet II||43.9%|Hard|| +|1772|Sort Features by Popularity||66.0%|Medium|| +|1773|Count Items Matching a Rule||86.6%|Easy|| +|1774|Closest Dessert Cost||60.0%|Medium|| +|1775|Equal Sum Arrays With Minimum Number of Operations||50.6%|Medium|| +|1776|Car Fleet II||43.8%|Hard|| |1777|Product's Price for Each Store||87.5%|Easy|| -|1778|Shortest Path in a Hidden Grid||45.1%|Medium|| -|1779|Find Nearest Point That Has the Same X or Y Coordinate||68.2%|Easy|| -|1780|Check if Number is a Sum of Powers of Three||63.0%|Medium|| -|1781|Sum of Beauty of All Substrings||46.7%|Medium|| -|1782|Count Pairs Of Nodes||29.7%|Hard|| -|1783|Grand Slam Titles||94.7%|Medium|| -|1784|Check if Binary String Has at Most One Segment of Ones||42.7%|Easy|| +|1778|Shortest Path in a Hidden Grid||44.5%|Medium|| +|1779|Find Nearest Point That Has the Same X or Y Coordinate||68.3%|Easy|| +|1780|Check if Number is a Sum of Powers of Three||63.2%|Medium|| +|1781|Sum of Beauty of All Substrings||47.3%|Medium|| +|1782|Count Pairs Of Nodes||30.4%|Hard|| +|1783|Grand Slam Titles||93.2%|Medium|| +|1784|Check if Binary String Has at Most One Segment of Ones||42.5%|Easy|| |1785|Minimum Elements to Add to Form a Given Sum||38.6%|Medium|| -|1786|Number of Restricted Paths From First to Last Node||35.3%|Medium|| -|1787|Make the XOR of All Segments Equal to Zero||33.1%|Hard|| +|1786|Number of Restricted Paths From First to Last Node||35.6%|Medium|| +|1787|Make the XOR of All Segments Equal to Zero||33.5%|Hard|| +|1788|Maximize the Beauty of the Garden||79.3%|Hard|| |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------| ------------------------------------------------------------------ diff --git a/leetcode/0008.String-to-Integer-atoi/8. String to Integer (atoi)_test.go b/leetcode/0008.String-to-Integer-atoi/8. String to Integer (atoi)_test.go deleted file mode 100644 index e69de29b..00000000 diff --git a/leetcode/0008.String-to-Integer-atoi/8. String to Integer (atoi).go b/leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi.go similarity index 100% rename from leetcode/0008.String-to-Integer-atoi/8. String to Integer (atoi).go rename to leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi.go diff --git a/leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi_test.go b/leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi_test.go new file mode 100644 index 00000000..92b769ed --- /dev/null +++ b/leetcode/0008.String-to-Integer-atoi/8. String to Integer atoi_test.go @@ -0,0 +1,62 @@ +package leetcode + +import ( + "fmt" + "testing" +) + +type question8 struct { + para8 + ans8 +} + +// para 是参数 +// one 代表第一个参数 +type para8 struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans8 struct { + one int +} + +func Test_Problem8(t *testing.T) { + + qs := []question8{ + + { + para8{"42"}, + ans8{42}, + }, + + { + para8{" -42"}, + ans8{-42}, + }, + + { + para8{"4193 with words"}, + ans8{4193}, + }, + + { + para8{"words and 987"}, + ans8{0}, + }, + + { + para8{"-91283472332"}, + ans8{-2147483648}, + }, + } + + fmt.Printf("------------------------Leetcode Problem 8------------------------\n") + + for _, q := range qs { + _, p := q.ans8, q.para8 + fmt.Printf("【input】:%v 【output】:%v\n", p.one, myAtoi(p.one)) + } + fmt.Printf("\n\n\n") +} diff --git a/leetcode/0043.Multiply-Strings/43. Multiply Strings.go b/leetcode/0043.Multiply-Strings/43. Multiply Strings.go new file mode 100644 index 00000000..88ab4b4c --- /dev/null +++ b/leetcode/0043.Multiply-Strings/43. Multiply Strings.go @@ -0,0 +1,25 @@ +package leetcode + +func multiply(num1 string, num2 string) string { + if num1 == "0" || num2 == "0" { + return "0" + } + b1, b2, tmp := []byte(num1), []byte(num2), make([]int, len(num1)+len(num2)) + for i := 0; i < len(b1); i++ { + for j := 0; j < len(b2); j++ { + tmp[i+j+1] += int(b1[i]-'0') * int(b2[j]-'0') + } + } + for i := len(tmp) - 1; i > 0; i-- { + tmp[i-1] += tmp[i] / 10 + tmp[i] = tmp[i] % 10 + } + if tmp[0] == 0 { + tmp = tmp[1:] + } + res := make([]byte, len(tmp)) + for i := 0; i < len(tmp); i++ { + res[i] = '0' + byte(tmp[i]) + } + return string(res) +} diff --git a/leetcode/0043.Multiply-Strings/43. Multiply Strings_test.go b/leetcode/0043.Multiply-Strings/43. Multiply Strings_test.go new file mode 100644 index 00000000..6017786e --- /dev/null +++ b/leetcode/0043.Multiply-Strings/43. Multiply Strings_test.go @@ -0,0 +1,48 @@ +package leetcode + +import ( + "fmt" + "testing" +) + +type question43 struct { + para43 + ans43 +} + +// para 是参数 +// one 代表第一个参数 +type para43 struct { + num1 string + num2 string +} + +// ans 是答案 +// one 代表第一个答案 +type ans43 struct { + one string +} + +func Test_Problem43(t *testing.T) { + + qs := []question43{ + + { + para43{"2", "3"}, + ans43{"6"}, + }, + + { + para43{"123", "456"}, + ans43{"56088"}, + }, + } + + fmt.Printf("------------------------Leetcode Problem 43------------------------\n") + + for _, q := range qs { + _, p := q.ans43, q.para43 + fmt.Printf("【input】:%v 【output】:%v\n", p, multiply(p.num1, p.num2)) + } + fmt.Printf("\n\n\n") +} diff --git a/leetcode/0043.Multiply-Strings/README.md b/leetcode/0043.Multiply-Strings/README.md new file mode 100644 index 00000000..46410bd3 --- /dev/null +++ b/leetcode/0043.Multiply-Strings/README.md @@ -0,0 +1,66 @@ +# [43. Multiply Strings](https://leetcode.com/problems/multiply-strings/) + + +## 题目 + +Given two non-negative integers `num1` and `num2` represented as strings, return the product of `num1` and `num2`, also represented as a string. + +**Note:** You must not use any built-in BigInteger library or convert the inputs to integer directly. + +**Example 1:** + +``` +Input: num1 = "2", num2 = "3" +Output: "6" +``` + +**Example 2:** + +``` +Input: num1 = "123", num2 = "456" +Output: "56088" +``` + +**Constraints:** + +- `1 <= num1.length, num2.length <= 200` +- `num1` and `num2` consist of digits only. +- Both `num1` and `num2` do not contain any leading zero, except the number `0` itself. + +## 题目大意 + +给定两个以字符串形式表示的非负整数 num1 和 num2，返回 num1 和 num2 的乘积，它们的乘积也表示为字符串形式。 + +## 解题思路 + +- 用数组模拟乘法。创建一个数组长度为 `len(num1) + len(num2)` 的数组用于存储乘积。对于任意 `0 ≤ i < len(num1)`，`0 ≤ j < len(num2)`，`num1[i] * num2[j]` 的结果位于 `tmp[i+j+1]`，如果 `tmp[i+j+1]≥10`，则将进位部分加到 `tmp[i+j]`。最后，将数组 `tmp` 转成字符串，如果最高位是 0 则舍弃最高位。 + +## 代码 + +```go +package leetcode + +func multiply(num1 string, num2 string) string { + if num1 == "0" || num2 == "0" { + return "0" + } + b1, b2, tmp := []byte(num1), []byte(num2), make([]int, len(num1)+len(num2)) + for i := 0; i < len(b1); i++ { + for j := 0; j < len(b2); j++ { + tmp[i+j+1] += int(b1[i]-'0') * int(b2[j]-'0') + } + } + for i := len(tmp) - 1; i > 0; i-- { + tmp[i-1] += tmp[i] / 10 + tmp[i] = tmp[i] % 10 + } + if tmp[0] == 0 { + tmp = tmp[1:] + } + res := make([]byte, len(tmp)) + for i := 0; i < len(tmp); i++ { + res[i] = '0' + byte(tmp[i]) + } + return string(res) +} +``` \ No newline at end of file diff --git a/leetcode/0045.Jump-Game-II/45. Jump Game II.go b/leetcode/0045.Jump-Game-II/45. Jump Game II.go new file mode 100644 index 00000000..2707e5db --- /dev/null +++ b/leetcode/0045.Jump-Game-II/45. Jump Game II.go @@ -0,0 +1,21 @@ +package leetcode + +func jump(nums []int) int { + if len(nums) == 1 { + return 0 + } + needChoose, canReach, step := 0, 0, 0 + for i, x := range nums { + if i+x > canReach { + canReach = i + x + if canReach >= len(nums)-1 { + return step + 1 + } + } + if i == needChoose { + needChoose = canReach + step++ + } + } + return step +} diff --git a/leetcode/0045.Jump-Game-II/45. Jump Game II_test.go b/leetcode/0045.Jump-Game-II/45. Jump Game II_test.go new file mode 100644 index 00000000..0e58e91a --- /dev/null +++ b/leetcode/0045.Jump-Game-II/45. Jump Game II_test.go @@ -0,0 +1,47 @@ +package leetcode + +import ( + "fmt" + "testing" +) + +type question45 struct { + para45 + ans45 +} + +// para 是参数 +// one 代表第一个参数 +type para45 struct { + nums []int +} + +// ans 是答案 +// one 代表第一个答案 +type ans45 struct { + one int +} + +func Test_Problem45(t *testing.T) { + + qs := []question45{ + + { + para45{[]int{2, 3, 1, 1, 4}}, + ans45{2}, + }, + + { + para45{[]int{2, 3, 0, 1, 4}}, + ans45{2}, + }, + } + + fmt.Printf("------------------------Leetcode Problem 45------------------------\n") + + for _, q := range qs { + _, p := q.ans45, q.para45 + fmt.Printf("【input】:%v 【output】:%v\n", p, jump(p.nums)) + } + fmt.Printf("\n\n\n") +} diff --git a/leetcode/0045.Jump-Game-II/README.md b/leetcode/0045.Jump-Game-II/README.md new file mode 100644 index 00000000..e5394aa2 --- /dev/null +++ b/leetcode/0045.Jump-Game-II/README.md @@ -0,0 +1,67 @@ +# [45. Jump Game II](https://leetcode.com/problems/jump-game-ii/) + + +## 题目 + +Given an array of non-negative integers `nums`, you are initially positioned at the first index of the array. + +Each element in the array represents your maximum jump length at that position. + +Your goal is to reach the last index in the minimum number of jumps. + +You can assume that you can always reach the last index. + +**Example 1:** + +``` +Input: nums = [2,3,1,1,4] +Output: 2 +Explanation: The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index. +``` + +**Example 2:** + +``` +Input: nums = [2,3,0,1,4] +Output: 2 +``` + +**Constraints:** + +- `1 <= nums.length <= 1000` +- `0 <= nums[i] <= 10^5` + +## 题目大意 + +给定一个非负整数数组，你最初位于数组的第一个位置。数组中的每个元素代表你在该位置可以跳跃的最大长度。你的目标是使用最少的跳跃次数到达数组的最后一个位置。 + +## 解题思路 + +- 要求找到最少跳跃次数，顺理成章的会想到用贪心算法解题。扫描步数数组，维护当前能够到达最大下标的位置，记为能到达的最远边界，如果扫描过程中到达了最远边界，更新边界并将跳跃次数 + 1。 +- 扫描数组的时候，其实不需要扫描最后一个元素，因为在跳到最后一个元素之前，能到达的最远边界一定大于等于最后一个元素的位置，不然就跳不到最后一个元素，到达不了终点了；如果遍历到最后一个元素，说明边界正好为最后一个位置，最终跳跃次数直接 + 1 即可，也不需要访问最后一个元素。 + +## 代码 + +```go +package leetcode + +func jump(nums []int) int { + if len(nums) == 1 { + return 0 + } + needChoose, canReach, step := 0, 0, 0 + for i, x := range nums { + if i+x > canReach { + canReach = i + x + if canReach >= len(nums)-1 { + return step + 1 + } + } + if i == needChoose { + needChoose = canReach + step++ + } + } + return step +} +``` \ No newline at end of file diff --git a/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes.go b/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes.go new file mode 100644 index 00000000..09882130 --- /dev/null +++ b/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes.go @@ -0,0 +1,54 @@ +package leetcode + +func setZeroes(matrix [][]int) { + if len(matrix) == 0 || len(matrix[0]) == 0 { + return + } + isFirstRowExistZero, isFirstColExistZero := false, false + for i := 0; i < len(matrix); i++ { + if matrix[i][0] == 0 { + isFirstColExistZero = true + break + } + } + for j := 0; j < len(matrix[0]); j++ { + if matrix[0][j] == 0 { + isFirstRowExistZero = true + break + } + } + for i := 1; i < len(matrix); i++ { + for j := 1; j < len(matrix[0]); j++ { + if matrix[i][j] == 0 { + matrix[i][0] = 0 + matrix[0][j] = 0 + } + } + } + // 处理[1:]行全部置 0 + for i := 1; i < len(matrix); i++ { + if matrix[i][0] == 0 { + for j := 1; j < len(matrix[0]); j++ { + matrix[i][j] = 0 + } + } + } + // 处理[1:]列全部置 0 + for j := 1; j < len(matrix[0]); j++ { + if matrix[0][j] == 0 { + for i := 1; i < len(matrix); i++ { + matrix[i][j] = 0 + } + } + } + if isFirstRowExistZero { + for j := 0; j < len(matrix[0]); j++ { + matrix[0][j] = 0 + } + } + if isFirstColExistZero { + for i := 0; i < len(matrix); i++ { + matrix[i][0] = 0 + } + } +} diff --git a/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes_test.go b/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes_test.go new file mode 100644 index 00000000..e4b23425 --- /dev/null +++ b/leetcode/0073.Set-Matrix-Zeroes/73. Set Matrix Zeroes_test.go @@ -0,0 +1,47 @@ +package leetcode + +import ( + "fmt" + "testing" +) + +type question73 struct { + para73 + ans73 +} + +// para 是参数 +// one 代表第一个参数 +type para73 struct { + matrix [][]int +} + +// ans 是答案 +// one 代表第一个答案 +type ans73 struct { +} + +func Test_Problem73(t *testing.T) { + + qs := []question73{ + + { + para73{[][]int{ + {0, 1, 2, 0}, + {3, 4, 5, 2}, + {1, 3, 1, 5}, + }}, + ans73{}, + }, + } + + fmt.Printf("------------------------Leetcode Problem 73------------------------\n") + + for _, q := range qs { + _, p := q.ans73, q.para73 + fmt.Printf("【input】:%v ", p) + setZeroes(p.matrix) + fmt.Printf("【output】:%v\n", p) + } + fmt.Printf("\n\n\n") +} diff --git a/leetcode/0073.Set-Matrix-Zeroes/README.md b/leetcode/0073.Set-Matrix-Zeroes/README.md new file mode 100644 index 00000000..e3f7a2b8 --- /dev/null +++ b/leetcode/0073.Set-Matrix-Zeroes/README.md @@ -0,0 +1,104 @@ +# [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) + + +## 题目 + +Given an *`m* x *n*` matrix. If an element is **0**, set its entire row and column to **0**. Do it **[in-place](https://en.wikipedia.org/wiki/In-place_algorithm)**. + +**Follow up:** + +- A straight forward solution using O(*mn*) space is probably a bad idea. +- A simple improvement uses O(*m* + *n*) space, but still not the best solution. +- Could you devise a constant space solution? + +**Example 1:** + +![https://assets.leetcode.com/uploads/2020/08/17/mat1.jpg](https://assets.leetcode.com/uploads/2020/08/17/mat1.jpg) + +``` +Input: matrix = [[1,1,1],[1,0,1],[1,1,1]] +Output: [[1,0,1],[0,0,0],[1,0,1]] +``` + +**Example 2:** + +![https://assets.leetcode.com/uploads/2020/08/17/mat2.jpg](https://assets.leetcode.com/uploads/2020/08/17/mat2.jpg) + +``` +Input: matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]] +Output: [[0,0,0,0],[0,4,5,0],[0,3,1,0]] +``` + +**Constraints:** + +- `m == matrix.length` +- `n == matrix[0].length` +- `1 <= m, n <= 200` +- `2^31 <= matrix[i][j] <= 2^31 - 1` + +## 题目大意 + +给定一个 `m x n` 的矩阵，如果一个元素为 0，则将其所在行和列的所有元素都设为 0。请使用原地算法。 + +## 解题思路 + +- 此题考查对程序的控制能力，无算法思想。题目要求采用原地的算法，所有修改即在原二维数组上进行。在二维数组中有 2 个特殊位置，一个是第一行，一个是第一列。它们的特殊性在于，它们之间只要有一个 0，它们都会变为全 0 。先用 2 个变量记录这一行和这一列中是否有 0，防止之后的修改覆盖了这 2 个地方。然后除去这一行和这一列以外的部分判断是否有 0，如果有 0，将它们所在的行第一个元素标记为 0，所在列的第一个元素标记为 0 。最后通过标记，将对应的行列置 0 即可。 + +## 代码 + +```go +package leetcode + +func setZeroes(matrix [][]int) { + if len(matrix) == 0 || len(matrix[0]) == 0 { + return + } + isFirstRowExistZero, isFirstColExistZero := false, false + for i := 0; i < len(matrix); i++ { + if matrix[i][0] == 0 { + isFirstColExistZero = true + break + } + } + for j := 0; j < len(matrix[0]); j++ { + if matrix[0][j] == 0 { + isFirstRowExistZero = true + break + } + } + for i := 1; i < len(matrix); i++ { + for j := 1; j < len(matrix[0]); j++ { + if matrix[i][j] == 0 { + matrix[i][0] = 0 + matrix[0][j] = 0 + } + } + } + // 处理[1:]行全部置 0 + for i := 1; i < len(matrix); i++ { + if matrix[i][0] == 0 { + for j := 1; j < len(matrix[0]); j++ { + matrix[i][j] = 0 + } + } + } + // 处理[1:]列全部置 0 + for j := 1; j < len(matrix[0]); j++ { + if matrix[0][j] == 0 { + for i := 1; i < len(matrix); i++ { + matrix[i][j] = 0 + } + } + } + if isFirstRowExistZero { + for j := 0; j < len(matrix[0]); j++ { + matrix[0][j] = 0 + } + } + if isFirstColExistZero { + for i := 0; i < len(matrix); i++ { + matrix[i][0] = 0 + } + } +} +``` \ No newline at end of file diff --git a/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II.go b/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II.go new file mode 100644 index 00000000..a20168b9 --- /dev/null +++ b/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II.go @@ -0,0 +1,29 @@ +package leetcode + +func calculate(s string) int { + stack, preSign, num, res := []int{}, '+', 0, 0 + for i, ch := range s { + isDigit := '0' <= ch && ch <= '9' + if isDigit { + num = num*10 + int(ch-'0') + } + if !isDigit && ch != ' ' || i == len(s)-1 { + switch preSign { + case '+': + stack = append(stack, num) + case '-': + stack = append(stack, -num) + case '*': + stack[len(stack)-1] *= num + default: + stack[len(stack)-1] /= num + } + preSign = ch + num = 0 + } + } + for _, v := range stack { + res += v + } + return res +} diff --git a/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II_test.go b/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II_test.go new file mode 100644 index 00000000..131d97ba --- /dev/null +++ b/leetcode/0227.Basic-Calculator-II/227. Basic Calculator II_test.go @@ -0,0 +1,66 @@ +package leetcode + +import ( + "fmt" + "testing" +) + +type question227 struct { + para227 + ans227 +} + +// para 是参数 +// one 代表第一个参数 +type para227 struct { + one string +} + +// ans 是答案 +// one 代表第一个答案 +type ans227 struct { + one int +} + +func Test_Problem227(t *testing.T) { + + qs := []question227{ + + { + para227{"3+2*2"}, + ans227{7}, + }, + + { + para227{"3/2"}, + ans227{1}, + }, + + { + para227{" 3+5 / 2 "}, + ans227{5}, + }, + + { + para227{"1 + 1"}, + ans227{2}, + }, + { + para227{" 2-1 + 2 "}, + ans227{3}, + }, + + { + para227{"2-5/6"}, + ans227{2}, + }, + } + + fmt.Printf("------------------------Leetcode Problem 227------------------------\n") + + for _, q := range qs { + _, p := q.ans227, q.para227 + fmt.Printf("【input】:%v 【output】:%v\n", p, calculate(p.one)) + } + fmt.Printf("\n\n\n") +} diff --git a/leetcode/0227.Basic-Calculator-II/README.md b/leetcode/0227.Basic-Calculator-II/README.md new file mode 100644 index 00000000..470a58af --- /dev/null +++ b/leetcode/0227.Basic-Calculator-II/README.md @@ -0,0 +1,80 @@ +# [227. Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) + + +## 题目 + +Given a string `s` which represents an expression, *evaluate this expression and return its value*. + +The integer division should truncate toward zero. + +**Example 1:** + +``` +Input: s = "3+2*2" +Output: 7 +``` + +**Example 2:** + +``` +Input: s = " 3/2 " +Output: 1 +``` + +**Example 3:** + +``` +Input: s = " 3+5 / 2 " +Output: 5 +``` + +**Constraints:** + +- `1 <= s.length <= 3 * 10^5` +- `s` consists of integers and operators `('+', '-', '*', '/')` separated by some number of spaces. +- `s` represents **a valid expression**. +- All the integers in the expression are non-negative integers in the range `[0, 2^31 - 1]`. +- The answer is **guaranteed** to fit in a **32-bit integer**. + +## 题目大意 + +给你一个字符串表达式 `s` ，请你实现一个基本计算器来计算并返回它的值。整数除法仅保留整数部分。 + +## 解题思路 + +- 这道题是第 224 题的加强版。第 224 题中只有加减运算和括号，这一题增加了乘除运算。由于乘除运算的优先级高于加减。所以先计算乘除运算，将算出来的结果再替换回原来的算式中。最后只剩下加减运算，于是题目降级成了第 224 题。 +- 把加减运算符号后面的数字压入栈中，遇到乘除运算，直接将它与栈顶的元素计算，并将计算后的结果放入栈顶。若读到一个运算符，或者遍历到字符串末尾，即认为是遍历到了数字末尾。处理完该数字后，更新 `preSign` 为当前遍历的字符。遍历完字符串 `s` 后，将栈中元素累加，即为该字符串表达式的值。时间复杂度 O(n)，空间复杂度 O(n)。 + +## 代码 + +```go +package leetcode + +func calculate(s string) int { + stack, preSign, num, res := []int{}, '+', 0, 0 + for i, ch := range s { + isDigit := '0' <= ch && ch <= '9' + if isDigit { + num = num*10 + int(ch-'0') + } + if !isDigit && ch != ' ' || i == len(s)-1 { + switch preSign { + case '+': + stack = append(stack, num) + case '-': + stack = append(stack, -num) + case '*': + stack[len(stack)-1] *= num + default: + stack[len(stack)-1] /= num + } + preSign = ch + num = 0 + } + } + for _, v := range stack { + res += v + } + return res +} +``` \ No newline at end of file diff --git a/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md b/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md index c4bb98d4..be6a256e 100644 --- a/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md +++ b/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md @@ -64,5 +64,5 @@ func trap(height []int) int { ----------------------------------------------

⬅️上一页

-

下一页➡️

+

下一页➡️

diff --git a/website/content/ChapterFour/0001~0099/0043.Multiply-Strings.md b/website/content/ChapterFour/0001~0099/0043.Multiply-Strings.md new file mode 100644 index 00000000..b807342c --- /dev/null +++ b/website/content/ChapterFour/0001~0099/0043.Multiply-Strings.md @@ -0,0 +1,73 @@ +# [43. Multiply Strings](https://leetcode.com/problems/multiply-strings/) + + +## 题目 + +Given two non-negative integers `num1` and `num2` represented as strings, return the product of `num1` and `num2`, also represented as a string. + +**Note:** You must not use any built-in BigInteger library or convert the inputs to integer directly. + +**Example 1:** + +``` +Input: num1 = "2", num2 = "3" +Output: "6" +``` + +**Example 2:** + +``` +Input: num1 = "123", num2 = "456" +Output: "56088" +``` + +**Constraints:** + +- `1 <= num1.length, num2.length <= 200` +- `num1` and `num2` consist of digits only. +- Both `num1` and `num2` do not contain any leading zero, except the number `0` itself. + +## 题目大意 + +给定两个以字符串形式表示的非负整数 num1 和 num2，返回 num1 和 num2 的乘积，它们的乘积也表示为字符串形式。 + +## 解题思路 + +- 用数组模拟乘法。创建一个数组长度为 `len(num1) + len(num2)` 的数组用于存储乘积。对于任意 `0 ≤ i < len(num1)`，`0 ≤ j < len(num2)`，`num1[i] * num2[j]` 的结果位于 `tmp[i+j+1]`，如果 `tmp[i+j+1]≥10`，则将进位部分加到 `tmp[i+j]`。最后，将数组 `tmp` 转成字符串，如果最高位是 0 则舍弃最高位。 + +## 代码 + +```go +package leetcode + +func multiply(num1 string, num2 string) string { + if num1 == "0" || num2 == "0" { + return "0" + } + b1, b2, tmp := []byte(num1), []byte(num2), make([]int, len(num1)+len(num2)) + for i := 0; i < len(b1); i++ { + for j := 0; j < len(b2); j++ { + tmp[i+j+1] += int(b1[i]-'0') * int(b2[j]-'0') + } + } + for i := len(tmp) - 1; i > 0; i-- { + tmp[i-1] += tmp[i] / 10 + tmp[i] = tmp[i] % 10 + } + if tmp[0] == 0 { + tmp = tmp[1:] + } + res := make([]byte, len(tmp)) + for i := 0; i < len(tmp); i++ { + res[i] = '0' + byte(tmp[i]) + } + return string(res) +} +``` + + +---------------------------------------------- +
+

⬅️上一页

+

下一页➡️

+
diff --git a/website/content/ChapterFour/0001~0099/0045.Jump-Game-II.md b/website/content/ChapterFour/0001~0099/0045.Jump-Game-II.md new file mode 100644 index 00000000..fc910ad2 --- /dev/null +++ b/website/content/ChapterFour/0001~0099/0045.Jump-Game-II.md @@ -0,0 +1,74 @@ +# [45. Jump Game II](https://leetcode.com/problems/jump-game-ii/) + + +## 题目 + +Given an array of non-negative integers `nums`, you are initially positioned at the first index of the array. + +Each element in the array represents your maximum jump length at that position. + +Your goal is to reach the last index in the minimum number of jumps. + +You can assume that you can always reach the last index. + +**Example 1:** + +``` +Input: nums = [2,3,1,1,4] +Output: 2 +Explanation: The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index. +``` + +**Example 2:** + +``` +Input: nums = [2,3,0,1,4] +Output: 2 +``` + +**Constraints:** + +- `1 <= nums.length <= 1000` +- `0 <= nums[i] <= 10^5` + +## 题目大意 + +给定一个非负整数数组，你最初位于数组的第一个位置。数组中的每个元素代表你在该位置可以跳跃的最大长度。你的目标是使用最少的跳跃次数到达数组的最后一个位置。 + +## 解题思路 + +- 要求找到最少跳跃次数，顺理成章的会想到用贪心算法解题。扫描步数数组，维护当前能够到达最大下标的位置，记为能到达的最远边界，如果扫描过程中到达了最远边界，更新边界并将跳跃次数 + 1。 +- 扫描数组的时候，其实不需要扫描最后一个元素，因为在跳到最后一个元素之前，能到达的最远边界一定大于等于最后一个元素的位置，不然就跳不到最后一个元素，到达不了终点了；如果遍历到最后一个元素，说明边界正好为最后一个位置，最终跳跃次数直接 + 1 即可，也不需要访问最后一个元素。 + +## 代码 + +```go +package leetcode + +func jump(nums []int) int { + if len(nums) == 1 { + return 0 + } + needChoose, canReach, step := 0, 0, 0 + for i, x := range nums { + if i+x > canReach { + canReach = i + x + if canReach >= len(nums)-1 { + return step + 1 + } + } + if i == needChoose { + needChoose = canReach + step++ + } + } + return step +} +``` + + +---------------------------------------------- +
+

⬅️上一页

+

下一页➡️

+
diff --git a/website/content/ChapterFour/0001~0099/0046.Permutations.md b/website/content/ChapterFour/0001~0099/0046.Permutations.md index 28369b77..54fceeeb 100755 --- a/website/content/ChapterFour/0001~0099/0046.Permutations.md +++ b/website/content/ChapterFour/0001~0099/0046.Permutations.md @@ -68,6 +68,6 @@ func generatePermutation(nums []int, index int, p []int, res *[][]int, used *[]b ----------------------------------------------
-

⬅️上一页

+

⬅️上一页

下一页➡️

diff --git a/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md b/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md index 4b175500..750f72c7 100644 --- a/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md +++ b/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md @@ -120,5 +120,5 @@ func simplifyPath1(path string) string { ----------------------------------------------

⬅️上一页

-

下一页➡️

+

下一页➡️

diff --git a/website/content/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md b/website/content/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md new file mode 100644 index 00000000..faa39f42 --- /dev/null +++ b/website/content/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md @@ -0,0 +1,111 @@ +# [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) + + +## 题目 + +Given an *`m* x *n*` matrix. If an element is **0**, set its entire row and column to **0**. Do it **[in-place](https://en.wikipedia.org/wiki/In-place_algorithm)**. + +**Follow up:** + +- A straight forward solution using O(*mn*) space is probably a bad idea. +- A simple improvement uses O(*m* + *n*) space, but still not the best solution. +- Could you devise a constant space solution? + +**Example 1:** + +![https://assets.leetcode.com/uploads/2020/08/17/mat1.jpg](https://assets.leetcode.com/uploads/2020/08/17/mat1.jpg) + +``` +Input: matrix = [[1,1,1],[1,0,1],[1,1,1]] +Output: [[1,0,1],[0,0,0],[1,0,1]] +``` + +**Example 2:** + +![https://assets.leetcode.com/uploads/2020/08/17/mat2.jpg](https://assets.leetcode.com/uploads/2020/08/17/mat2.jpg) + +``` +Input: matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]] +Output: [[0,0,0,0],[0,4,5,0],[0,3,1,0]] +``` + +**Constraints:** + +- `m == matrix.length` +- `n == matrix[0].length` +- `1 <= m, n <= 200` +- `2^31 <= matrix[i][j] <= 2^31 - 1` + +## 题目大意 + +给定一个 `m x n` 的矩阵，如果一个元素为 0，则将其所在行和列的所有元素都设为 0。请使用原地算法。 + +## 解题思路 + +- 此题考查对程序的控制能力，无算法思想。题目要求采用原地的算法，所有修改即在原二维数组上进行。在二维数组中有 2 个特殊位置，一个是第一行，一个是第一列。它们的特殊性在于，它们之间只要有一个 0，它们都会变为全 0 。先用 2 个变量记录这一行和这一列中是否有 0，防止之后的修改覆盖了这 2 个地方。然后除去这一行和这一列以外的部分判断是否有 0，如果有 0，将它们所在的行第一个元素标记为 0，所在列的第一个元素标记为 0 。最后通过标记，将对应的行列置 0 即可。 + +## 代码 + +```go +package leetcode + +func setZeroes(matrix [][]int) { + if len(matrix) == 0 || len(matrix[0]) == 0 { + return + } + isFirstRowExistZero, isFirstColExistZero := false, false + for i := 0; i < len(matrix); i++ { + if matrix[i][0] == 0 { + isFirstColExistZero = true + break + } + } + for j := 0; j < len(matrix[0]); j++ { + if matrix[0][j] == 0 { + isFirstRowExistZero = true + break + } + } + for i := 1; i < len(matrix); i++ { + for j := 1; j < len(matrix[0]); j++ { + if matrix[i][j] == 0 { + matrix[i][0] = 0 + matrix[0][j] = 0 + } + } + } + // 处理[1:]行全部置 0 + for i := 1; i < len(matrix); i++ { + if matrix[i][0] == 0 { + for j := 1; j < len(matrix[0]); j++ { + matrix[i][j] = 0 + } + } + } + // 处理[1:]列全部置 0 + for j := 1; j < len(matrix[0]); j++ { + if matrix[0][j] == 0 { + for i := 1; i < len(matrix); i++ { + matrix[i][j] = 0 + } + } + } + if isFirstRowExistZero { + for j := 0; j < len(matrix[0]); j++ { + matrix[0][j] = 0 + } + } + if isFirstColExistZero { + for i := 0; i < len(matrix); i++ { + matrix[i][0] = 0 + } + } +} +``` + + +---------------------------------------------- +
+

⬅️上一页

+

下一页➡️

+
diff --git a/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md b/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md index 326c9043..df5886ea 100755 --- a/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md +++ b/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md @@ -74,6 +74,6 @@ func searchMatrix(matrix [][]int, target int) bool { ----------------------------------------------
-

⬅️上一页

+

⬅️上一页

下一页➡️

diff --git a/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md b/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md index 771e047b..d9f53c25 100644 --- a/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md +++ b/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md @@ -79,5 +79,5 @@ func invertTree(root *TreeNode) *TreeNode { ----------------------------------------------

⬅️上一页

-

下一页➡️

+

下一页➡️

diff --git a/website/content/ChapterFour/0200~0299/0227.Basic-Calculator-II.md b/website/content/ChapterFour/0200~0299/0227.Basic-Calculator-II.md new file mode 100644 index 00000000..d4002444 --- /dev/null +++ b/website/content/ChapterFour/0200~0299/0227.Basic-Calculator-II.md @@ -0,0 +1,87 @@ +# [227. Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) + + +## 题目 + +Given a string `s` which represents an expression, *evaluate this expression and return its value*. + +The integer division should truncate toward zero. + +**Example 1:** + +``` +Input: s = "3+2*2" +Output: 7 +``` + +**Example 2:** + +``` +Input: s = " 3/2 " +Output: 1 +``` + +**Example 3:** + +``` +Input: s = " 3+5 / 2 " +Output: 5 +``` + +**Constraints:** + +- `1 <= s.length <= 3 * 10^5` +- `s` consists of integers and operators `('+', '-', '*', '/')` separated by some number of spaces. +- `s` represents **a valid expression**. +- All the integers in the expression are non-negative integers in the range `[0, 2^31 - 1]`. +- The answer is **guaranteed** to fit in a **32-bit integer**. + +## 题目大意 + +给你一个字符串表达式 `s` ，请你实现一个基本计算器来计算并返回它的值。整数除法仅保留整数部分。 + +## 解题思路 + +- 这道题是第 224 题的加强版。第 224 题中只有加减运算和括号，这一题增加了乘除运算。由于乘除运算的优先级高于加减。所以先计算乘除运算，将算出来的结果再替换回原来的算式中。最后只剩下加减运算，于是题目降级成了第 224 题。 +- 把加减运算符号后面的数字压入栈中，遇到乘除运算，直接将它与栈顶的元素计算，并将计算后的结果放入栈顶。若读到一个运算符，或者遍历到字符串末尾，即认为是遍历到了数字末尾。处理完该数字后，更新 `preSign` 为当前遍历的字符。遍历完字符串 `s` 后，将栈中元素累加，即为该字符串表达式的值。时间复杂度 O(n)，空间复杂度 O(n)。 + +## 代码 + +```go +package leetcode + +func calculate(s string) int { + stack, preSign, num, res := []int{}, '+', 0, 0 + for i, ch := range s { + isDigit := '0' <= ch && ch <= '9' + if isDigit { + num = num*10 + int(ch-'0') + } + if !isDigit && ch != ' ' || i == len(s)-1 { + switch preSign { + case '+': + stack = append(stack, num) + case '-': + stack = append(stack, -num) + case '*': + stack[len(stack)-1] *= num + default: + stack[len(stack)-1] /= num + } + preSign = ch + num = 0 + } + } + for _, v := range stack { + res += v + } + return res +} +``` + + +---------------------------------------------- +
+

⬅️上一页

+

下一页➡️

+
diff --git a/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md b/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md index 30f9cb26..974e066f 100644 --- a/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md +++ b/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md @@ -110,6 +110,6 @@ func summaryRanges(nums []int) (ans []string) { ----------------------------------------------
-

⬅️上一页

+

⬅️上一页

下一页➡️

diff --git a/website/content/ChapterTwo/Array.md b/website/content/ChapterTwo/Array.md index fe0bfa08..c446057c 100644 --- a/website/content/ChapterTwo/Array.md +++ b/website/content/ChapterTwo/Array.md @@ -9,7 +9,7 @@ weight: 1 | No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance | |:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: | |0001|Two Sum|[Go]({{< relref "/ChapterFour/0001~0099/0001.Two-Sum.md" >}})|Easy| O(n)| O(n)||46.5%| -|0004|Median of Two Sorted Arrays|[Go]({{< relref "/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md" >}})|Hard||||31.1%| +|0004|Median of Two Sorted Arrays|[Go]({{< relref "/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md" >}})|Hard||||31.2%| |0011|Container With Most Water|[Go]({{< relref "/ChapterFour/0001~0099/0011.Container-With-Most-Water.md" >}})|Medium| O(n)| O(1)||52.8%| |0015|3Sum|[Go]({{< relref "/ChapterFour/0001~0099/0015.3Sum.md" >}})|Medium| O(n^2)| O(n)|❤️|28.1%| |0016|3Sum Closest|[Go]({{< relref "/ChapterFour/0001~0099/0016.3Sum-Closest.md" >}})|Medium| O(n^2)| O(1)|❤️|46.3%| @@ -17,27 +17,29 @@ weight: 1 |0026|Remove Duplicates from Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md" >}})|Easy| O(n)| O(1)||46.6%| |0027|Remove Element|[Go]({{< relref "/ChapterFour/0001~0099/0027.Remove-Element.md" >}})|Easy| O(n)| O(1)||49.3%| |0031|Next Permutation|[Go]({{< relref "/ChapterFour/0001~0099/0031.Next-Permutation.md" >}})|Medium||||33.8%| -|0033|Search in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md" >}})|Medium||||35.9%| +|0033|Search in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md" >}})|Medium||||36.0%| |0034|Find First and Last Position of Element in Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md" >}})|Medium||||37.3%| |0035|Search Insert Position|[Go]({{< relref "/ChapterFour/0001~0099/0035.Search-Insert-Position.md" >}})|Easy||||42.8%| |0039|Combination Sum|[Go]({{< relref "/ChapterFour/0001~0099/0039.Combination-Sum.md" >}})|Medium| O(n log n)| O(n)||59.4%| |0040|Combination Sum II|[Go]({{< relref "/ChapterFour/0001~0099/0040.Combination-Sum-II.md" >}})|Medium| O(n log n)| O(n)||50.2%| |0041|First Missing Positive|[Go]({{< relref "/ChapterFour/0001~0099/0041.First-Missing-Positive.md" >}})|Hard| O(n)| O(n)||33.8%| |0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|51.3%| +|0045|Jump Game II|[Go]({{< relref "/ChapterFour/0001~0099/0045.Jump-Game-II.md" >}})|Medium||||31.4%| |0048|Rotate Image|[Go]({{< relref "/ChapterFour/0001~0099/0048.Rotate-Image.md" >}})|Medium| O(n)| O(1)||60.1%| |0053|Maximum Subarray|[Go]({{< relref "/ChapterFour/0001~0099/0053.Maximum-Subarray.md" >}})|Easy| O(n)| O(n)||47.8%| -|0054|Spiral Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0054.Spiral-Matrix.md" >}})|Medium| O(n)| O(n^2)||36.1%| +|0054|Spiral Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0054.Spiral-Matrix.md" >}})|Medium| O(n)| O(n^2)||36.2%| |0055|Jump Game|[Go]({{< relref "/ChapterFour/0001~0099/0055.Jump-Game.md" >}})|Medium||||35.2%| |0056|Merge Intervals|[Go]({{< relref "/ChapterFour/0001~0099/0056.Merge-Intervals.md" >}})|Medium| O(n log n)| O(1)||41.1%| -|0057|Insert Interval|[Go]({{< relref "/ChapterFour/0001~0099/0057.Insert-Interval.md" >}})|Medium| O(n)| O(1)||35.1%| +|0057|Insert Interval|[Go]({{< relref "/ChapterFour/0001~0099/0057.Insert-Interval.md" >}})|Medium| O(n)| O(1)||35.2%| |0059|Spiral Matrix II|[Go]({{< relref "/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md" >}})|Medium| O(n)| O(n^2)||57.9%| |0062|Unique Paths|[Go]({{< relref "/ChapterFour/0001~0099/0062.Unique-Paths.md" >}})|Medium| O(n^2)| O(n^2)||56.1%| |0063|Unique Paths II|[Go]({{< relref "/ChapterFour/0001~0099/0063.Unique-Paths-II.md" >}})|Medium| O(n^2)| O(n^2)||35.3%| |0064|Minimum Path Sum|[Go]({{< relref "/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md" >}})|Medium| O(n^2)| O(n^2)||56.3%| |0066|Plus One|[Go]({{< relref "/ChapterFour/0001~0099/0066.Plus-One.md" >}})|Easy||||42.3%| +|0073|Set Matrix Zeroes|[Go]({{< relref "/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes.md" >}})|Medium||||44.4%| |0074|Search a 2D Matrix|[Go]({{< relref "/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md" >}})|Medium||||37.9%| |0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|49.5%| -|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|65.2%| +|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|65.3%| |0079|Word Search|[Go]({{< relref "/ChapterFour/0001~0099/0079.Word-Search.md" >}})|Medium| O(n^2)| O(n^2)|❤️|36.9%| |0080|Remove Duplicates from Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md" >}})|Medium| O(n)| O(1||46.2%| |0081|Search in Rotated Sorted Array II|[Go]({{< relref "/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md" >}})|Medium||||33.6%| @@ -49,7 +51,7 @@ weight: 1 |0118|Pascal's Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0118.Pascals-Triangle.md" >}})|Easy||||55.0%| |0119|Pascal's Triangle II|[Go]({{< relref "/ChapterFour/0100~0199/0119.Pascals-Triangle-II.md" >}})|Easy||||52.3%| |0120|Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0120.Triangle.md" >}})|Medium| O(n^2)| O(n)||45.9%| -|0121|Best Time to Buy and Sell Stock|[Go]({{< relref "/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})|Easy| O(n)| O(1)||51.6%| +|0121|Best Time to Buy and Sell Stock|[Go]({{< relref "/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})|Easy| O(n)| O(1)||51.7%| |0122|Best Time to Buy and Sell Stock II|[Go]({{< relref "/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md" >}})|Easy| O(n)| O(1)||58.6%| |0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|23.8%| |0128|Longest Consecutive Sequence|[Go]({{< relref "/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md" >}})|Hard||||46.3%| @@ -59,7 +61,7 @@ weight: 1 |0162|Find Peak Element|[Go]({{< relref "/ChapterFour/0100~0199/0162.Find-Peak-Element.md" >}})|Medium||||44.0%| |0167|Two Sum II - Input array is sorted|[Go]({{< relref "/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted.md" >}})|Easy| O(n)| O(1)||55.7%| |0169|Majority Element|[Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}})|Easy||||60.1%| -|0189|Rotate Array|[Go]({{< relref "/ChapterFour/0100~0199/0189.Rotate-Array.md" >}})|Medium||||36.6%| +|0189|Rotate Array|[Go]({{< relref "/ChapterFour/0100~0199/0189.Rotate-Array.md" >}})|Medium||||36.7%| |0209|Minimum Size Subarray Sum|[Go]({{< relref "/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md" >}})|Medium| O(n)| O(1)||39.6%| |0216|Combination Sum III|[Go]({{< relref "/ChapterFour/0200~0299/0216.Combination-Sum-III.md" >}})|Medium| O(n)| O(1)|❤️|60.4%| |0217|Contains Duplicate|[Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}})|Easy| O(n)| O(n)||56.7%| @@ -102,7 +104,7 @@ weight: 1 |0891|Sum of Subsequence Widths|[Go]({{< relref "/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md" >}})|Hard| O(n log n)| O(1)||33.1%| |0896|Monotonic Array|[Go]({{< relref "/ChapterFour/0800~0899/0896.Monotonic-Array.md" >}})|Easy||||58.0%| |0907|Sum of Subarray Minimums|[Go]({{< relref "/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md" >}})|Medium| O(n)| O(n)|❤️|33.1%| -|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||34.1%| +|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||34.2%| |0918|Maximum Sum Circular Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md" >}})|Medium||||34.2%| |0922|Sort Array By Parity II|[Go]({{< relref "/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md" >}})|Easy| O(n)| O(1)||70.6%| |0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium| O(n)| O(1)|❤️|68.7%| @@ -112,7 +114,7 @@ weight: 1 |0989|Add to Array-Form of Integer|[Go]({{< relref "/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md" >}})|Easy||||44.9%| |0999|Available Captures for Rook|[Go]({{< relref "/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md" >}})|Easy||||67.8%| |1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.6%| -|1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||59.8%| +|1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||59.7%| |1018|Binary Prefix Divisible By 5|[Go]({{< relref "/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md" >}})|Easy||||47.8%| |1040|Moving Stones Until Consecutive II|[Go]({{< relref "/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md" >}})|Medium||||54.1%| |1051|Height Checker|[Go]({{< relref "/ChapterFour/1000~1099/1051.Height-Checker.md" >}})|Easy||||72.1%| @@ -123,7 +125,7 @@ weight: 1 |1128|Number of Equivalent Domino Pairs|[Go]({{< relref "/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md" >}})|Easy||||46.4%| |1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||39.7%| |1160|Find Words That Can Be Formed by Characters|[Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})|Easy||||67.9%| -|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||59.8%| +|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||59.9%| |1184|Distance Between Bus Stops|[Go]({{< relref "/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md" >}})|Easy||||54.0%| |1185|Day of the Week|[Go]({{< relref "/ChapterFour/1100~1199/1185.Day-of-the-Week.md" >}})|Easy||||61.3%| |1200|Minimum Absolute Difference|[Go]({{< relref "/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md" >}})|Easy||||67.0%| @@ -131,8 +133,8 @@ weight: 1 |1208|Get Equal Substrings Within Budget|[Go]({{< relref "/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md" >}})|Medium||||44.0%| |1217|Minimum Cost to Move Chips to The Same Position|[Go]({{< relref "/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md" >}})|Easy||||71.1%| |1232|Check If It Is a Straight Line|[Go]({{< relref "/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md" >}})|Easy||||43.5%| -|1252|Cells with Odd Values in a Matrix|[Go]({{< relref "/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md" >}})|Easy||||78.9%| -|1260|Shift 2D Grid|[Go]({{< relref "/ChapterFour/1200~1299/1260.Shift-2D-Grid.md" >}})|Easy||||61.8%| +|1252|Cells with Odd Values in a Matrix|[Go]({{< relref "/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md" >}})|Easy||||78.8%| +|1260|Shift 2D Grid|[Go]({{< relref "/ChapterFour/1200~1299/1260.Shift-2D-Grid.md" >}})|Easy||||61.9%| |1266|Minimum Time Visiting All Points|[Go]({{< relref "/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md" >}})|Easy||||79.4%| |1275|Find Winner on a Tic Tac Toe Game|[Go]({{< relref "/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md" >}})|Easy||||52.9%| |1287|Element Appearing More Than 25% In Sorted Array|[Go]({{< relref "/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md" >}})|Easy||||60.1%| @@ -144,35 +146,34 @@ weight: 1 |1329|Sort the Matrix Diagonally|[Go]({{< relref "/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md" >}})|Medium||||81.8%| |1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||72.0%| |1380|Lucky Numbers in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md" >}})|Easy||||70.5%| -|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||66.3%| +|1385|Find the Distance Value Between Two Arrays|[Go]({{< relref "/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md" >}})|Easy||||66.4%| |1389|Create Target Array in the Given Order|[Go]({{< relref "/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md" >}})|Easy||||84.8%| |1423|Maximum Points You Can Obtain from Cards|[Go]({{< relref "/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md" >}})|Medium||||46.7%| |1437|Check If All 1's Are at Least Length K Places Away|[Go]({{< relref "/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md" >}})|Easy||||62.3%| |1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit|[Go]({{< relref "/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit.md" >}})|Medium||||44.4%| -|1464|Maximum Product of Two Elements in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})|Easy||||77.1%| +|1464|Maximum Product of Two Elements in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md" >}})|Easy||||77.2%| |1470|Shuffle the Array|[Go]({{< relref "/ChapterFour/1400~1499/1470.Shuffle-the-Array.md" >}})|Easy||||88.2%| |1480|Running Sum of 1d Array|[Go]({{< relref "/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md" >}})|Easy||||88.9%| |1512|Number of Good Pairs|[Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}})|Easy||||87.7%| |1539|Kth Missing Positive Number|[Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}})|Easy||||55.0%| |1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||61.3%| |1619|Mean of Array After Removing Some Elements|[Go]({{< relref "/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md" >}})|Easy||||65.0%| -|1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||59.2%| +|1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||59.1%| |1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||66.8%| -|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||60.0%| +|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||59.9%| |1646|Get Maximum in Generated Array|[Go]({{< relref "/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md" >}})|Easy||||53.3%| -|1652|Defuse the Bomb|[Go]({{< relref "/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md" >}})|Easy||||62.7%| -|1656|Design an Ordered Stream|[Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}})|Easy||||82.1%| +|1652|Defuse the Bomb|[Go]({{< relref "/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md" >}})|Easy||||62.5%| +|1656|Design an Ordered Stream|[Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}})|Easy||||82.2%| |1672|Richest Customer Wealth|[Go]({{< relref "/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md" >}})|Easy||||88.2%| |1700|Number of Students Unable to Eat Lunch|[Go]({{< relref "/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})|Easy||||68.2%| -|1732|Find the Highest Altitude|[Go]({{< relref "/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md" >}})|Easy||||80.7%| -|1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||74.7%| +|1732|Find the Highest Altitude|[Go]({{< relref "/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md" >}})|Easy||||80.6%| +|1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||74.6%| |1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||75.5%| -|1752|Check if Array Is Sorted and Rotated|[Go]({{< relref "/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md" >}})|Easy||||63.5%| -|1758|Minimum Changes To Make Alternating Binary String|[Go]({{< relref "/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md" >}})|Easy||||58.9%| +|1752|Check if Array Is Sorted and Rotated|[Go]({{< relref "/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md" >}})|Easy||||63.3%| +|1758|Minimum Changes To Make Alternating Binary String|[Go]({{< relref "/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String.md" >}})|Easy||||58.8%| |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------| - ----------------------------------------------

⬅️上一页

diff --git a/website/content/ChapterTwo/Backtracking.md b/website/content/ChapterTwo/Backtracking.md index 33615321..ac012361 100644 --- a/website/content/ChapterTwo/Backtracking.md +++ b/website/content/ChapterTwo/Backtracking.md @@ -100,7 +100,7 @@ func updateMatrix_BFS(matrix [][]int) [][]int { | No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance | |:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: | -|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium| O(log n)| O(1)||49.2%| +|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium| O(log n)| O(1)||49.3%| |0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium| O(log n)| O(1)||65.4%| |0037|Sudoku Solver|[Go]({{< relref "/ChapterFour/0001~0099/0037.Sudoku-Solver.md" >}})|Hard| O(n^2)| O(n^2)|❤️|46.7%| |0039|Combination Sum|[Go]({{< relref "/ChapterFour/0001~0099/0039.Combination-Sum.md" >}})|Medium| O(n log n)| O(n)||59.4%| @@ -111,7 +111,7 @@ func updateMatrix_BFS(matrix [][]int) [][]int { |0052|N-Queens II|[Go]({{< relref "/ChapterFour/0001~0099/0052.N-Queens-II.md" >}})|Hard| O(n!)| O(n)|❤️|60.3%| |0060|Permutation Sequence|[Go]({{< relref "/ChapterFour/0001~0099/0060.Permutation-Sequence.md" >}})|Hard| O(n log n)| O(1)||39.4%| |0077|Combinations|[Go]({{< relref "/ChapterFour/0001~0099/0077.Combinations.md" >}})|Medium| O(n)| O(n)|❤️|57.6%| -|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|65.2%| +|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|65.3%| |0079|Word Search|[Go]({{< relref "/ChapterFour/0001~0099/0079.Word-Search.md" >}})|Medium| O(n^2)| O(n^2)|❤️|36.9%| |0089|Gray Code|[Go]({{< relref "/ChapterFour/0001~0099/0089.Gray-Code.md" >}})|Medium| O(n)| O(1)||50.5%| |0090|Subsets II|[Go]({{< relref "/ChapterFour/0001~0099/0090.Subsets-II.md" >}})|Medium| O(n^2)| O(n)|❤️|48.9%| @@ -126,15 +126,15 @@ func updateMatrix_BFS(matrix [][]int) [][]int { |0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||48.5%| |0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium| O(n^2)| O(1)|❤️|61.9%| |0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium| O(n)| O(n)||68.6%| -|0842|Split Array into Fibonacci Sequence|[Go]({{< relref "/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md" >}})|Medium| O(n^2)| O(1)|❤️|36.9%| +|0842|Split Array into Fibonacci Sequence|[Go]({{< relref "/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md" >}})|Medium| O(n^2)| O(1)|❤️|37.0%| |0980|Unique Paths III|[Go]({{< relref "/ChapterFour/0900~0999/0980.Unique-Paths-III.md" >}})|Hard| O(n log n)| O(n)||77.1%| |0996|Number of Squareful Arrays|[Go]({{< relref "/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md" >}})|Hard| O(n log n)| O(n) ||48.5%| |1079|Letter Tile Possibilities|[Go]({{< relref "/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md" >}})|Medium| O(n^2)| O(1)|❤️|75.9%| |1641|Count Sorted Vowel Strings|[Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}})|Medium||||76.3%| -|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||40.0%| +|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||39.9%| |1659|Maximize Grid Happiness|[Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}})|Hard||||35.6%| |1681|Minimum Incompatibility|[Go]({{< relref "/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md" >}})|Hard||||35.6%| -|1688|Count of Matches in Tournament|[Go]({{< relref "/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md" >}})|Easy||||81.6%| +|1688|Count of Matches in Tournament|[Go]({{< relref "/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md" >}})|Easy||||81.5%| |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------| diff --git a/website/content/ChapterTwo/Binary_Search.md b/website/content/ChapterTwo/Binary_Search.md index 05c218bd..a9fd2452 100644 --- a/website/content/ChapterTwo/Binary_Search.md +++ b/website/content/ChapterTwo/Binary_Search.md @@ -131,9 +131,9 @@ func peakIndexInMountainArray(A []int) int { | No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance | |:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: | -|0004|Median of Two Sorted Arrays|[Go]({{< relref "/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md" >}})|Hard||||31.1%| +|0004|Median of Two Sorted Arrays|[Go]({{< relref "/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md" >}})|Hard||||31.2%| |0029|Divide Two Integers|[Go]({{< relref "/ChapterFour/0001~0099/0029.Divide-Two-Integers.md" >}})|Medium||||16.9%| -|0033|Search in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md" >}})|Medium||||35.9%| +|0033|Search in Rotated Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md" >}})|Medium||||36.0%| |0034|Find First and Last Position of Element in Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md" >}})|Medium||||37.3%| |0035|Search Insert Position|[Go]({{< relref "/ChapterFour/0001~0099/0035.Search-Insert-Position.md" >}})|Easy||||42.8%| |0050|Pow(x, n)|[Go]({{< relref "/ChapterFour/0001~0099/0050.Powx-n.md" >}})|Medium| O(log n)| O(1)||31.0%| @@ -169,7 +169,7 @@ func peakIndexInMountainArray(A []int) int { |0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard||||26.9%| |0497|Random Point in Non-overlapping Rectangles|[Go]({{< relref "/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md" >}})|Medium||||39.1%| |0528|Random Pick with Weight|[Go]({{< relref "/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md" >}})|Medium||||44.7%| -|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||42.0%| +|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||42.1%| |0668|Kth Smallest Number in Multiplication Table|[Go]({{< relref "/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md" >}})|Hard||||47.8%| |0704|Binary Search|[Go]({{< relref "/ChapterFour/0700~0799/0704.Binary-Search.md" >}})|Easy||||54.1%| |0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||32.9%| @@ -178,21 +178,21 @@ func peakIndexInMountainArray(A []int) int { |0744|Find Smallest Letter Greater Than Target|[Go]({{< relref "/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md" >}})|Easy||||45.6%| |0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||54.7%| |0786|K-th Smallest Prime Fraction|[Go]({{< relref "/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md" >}})|Hard||||42.8%| -|0793|Preimage Size of Factorial Zeroes Function|[Go]({{< relref "/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md" >}})|Hard||||40.7%| +|0793|Preimage Size of Factorial Zeroes Function|[Go]({{< relref "/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md" >}})|Hard||||40.6%| |0852|Peak Index in a Mountain Array|[Go]({{< relref "/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md" >}})|Easy||||71.7%| |0862|Shortest Subarray with Sum at Least K|[Go]({{< relref "/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md" >}})|Hard||||25.2%| |0875|Koko Eating Bananas|[Go]({{< relref "/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md" >}})|Medium||||53.5%| |0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||28.8%| |0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||27.0%| |0911|Online Election|[Go]({{< relref "/ChapterFour/0900~0999/0911.Online-Election.md" >}})|Medium||||51.4%| -|0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||34.6%| -|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||54.1%| -|1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||59.8%| +|0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||34.7%| +|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||54.2%| +|1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||59.7%| |1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go]({{< relref "/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md" >}})|Medium||||72.6%| |1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||39.7%| -|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||59.8%| +|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||59.9%| |1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||26.4%| -|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||47.5%| +|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||47.4%| |1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||49.6%| |1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.0%| |1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||72.0%| diff --git a/website/content/ChapterTwo/Bit_Manipulation.md b/website/content/ChapterTwo/Bit_Manipulation.md index ab6beb39..c5e22d3e 100644 --- a/website/content/ChapterTwo/Bit_Manipulation.md +++ b/website/content/ChapterTwo/Bit_Manipulation.md @@ -44,7 +44,7 @@ X & ~X = 0 | No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance | |:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: | -|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|65.2%| +|0078|Subsets|[Go]({{< relref "/ChapterFour/0001~0099/0078.Subsets.md" >}})|Medium| O(n^2)| O(n)|❤️|65.3%| |0136|Single Number|[Go]({{< relref "/ChapterFour/0100~0199/0136.Single-Number.md" >}})|Easy| O(n)| O(1)||66.6%| |0137|Single Number II|[Go]({{< relref "/ChapterFour/0100~0199/0137.Single-Number-II.md" >}})|Medium| O(n)| O(1)|❤️|53.9%| |0169|Majority Element|[Go]({{< relref "/ChapterFour/0100~0199/0169.Majority-Element.md" >}})|Easy| O(n)| O(1)|❤️|60.1%| @@ -63,7 +63,7 @@ X & ~X = 0 |0393|UTF-8 Validation|[Go]({{< relref "/ChapterFour/0300~0399/0393.UTF-8-Validation.md" >}})|Medium| O(n)| O(1)||38.1%| |0397|Integer Replacement|[Go]({{< relref "/ChapterFour/0300~0399/0397.Integer-Replacement.md" >}})|Medium| O(n)| O(1)||33.5%| |0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||48.5%| -|0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy| O(n)| O(1)||44.4%| +|0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy| O(n)| O(1)||44.5%| |0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium| O(n)| O(1)|❤️|54.1%| |0461|Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0461.Hamming-Distance.md" >}})|Easy| O(n)| O(1)||73.2%| |0476|Number Complement|[Go]({{< relref "/ChapterFour/0400~0499/0476.Number-Complement.md" >}})|Easy| O(n)| O(1)||65.2%| @@ -73,7 +73,7 @@ X & ~X = 0 |0762|Prime Number of Set Bits in Binary Representation|[Go]({{< relref "/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md" >}})|Easy| O(n)| O(1)||64.4%| |0784|Letter Case Permutation|[Go]({{< relref "/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md" >}})|Medium| O(n)| O(1)||68.6%| |0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium| O(n)| O(1)||34.3%| -|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||39.3%| +|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||39.4%| |1290|Convert Binary Number in a Linked List to Integer|[Go]({{< relref "/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}})|Easy||||81.8%| |1720|Decode XORed Array|[Go]({{< relref "/ChapterFour/1700~1799/1720.Decode-XORed-Array.md" >}})|Easy||||85.3%| |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------| diff --git a/website/content/ChapterTwo/Depth_First_Search.md b/website/content/ChapterTwo/Depth_First_Search.md index 0a7bd387..1333603d 100644 --- a/website/content/ChapterTwo/Depth_First_Search.md +++ b/website/content/ChapterTwo/Depth_First_Search.md @@ -9,7 +9,7 @@ weight: 9 | No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance | |:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: | -|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium||||49.2%| +|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium||||49.3%| |0098|Validate Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||28.8%| |0099|Recover Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md" >}})|Hard| O(n)| O(1)||42.5%| |0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy| O(n)| O(1)||54.2%| @@ -36,7 +36,7 @@ weight: 9 |0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy| O(n)| O(1)||53.7%| |0329|Longest Increasing Path in a Matrix|[Go]({{< relref "/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md" >}})|Hard||||45.0%| |0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||51.9%| -|0394|Decode String|[Go]({{< relref "/ChapterFour/0300~0399/0394.Decode-String.md" >}})|Medium| O(n)| O(n)||52.7%| +|0394|Decode String|[Go]({{< relref "/ChapterFour/0300~0399/0394.Decode-String.md" >}})|Medium| O(n)| O(n)||52.8%| |0491|Increasing Subsequences|[Go]({{< relref "/ChapterFour/0400~0499/0491.Increasing-Subsequences.md" >}})|Medium||||47.5%| |0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.7%| |0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||62.7%| @@ -46,8 +46,8 @@ weight: 9 |0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||59.5%| |0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium| O(n)| O(1)||41.0%| |0547|Number of Provinces|[Go]({{< relref "/ChapterFour/0500~0599/0547.Number-of-Provinces.md" >}})|Medium||||60.5%| -|0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||53.0%| -|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||52.9%| +|0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||53.1%| +|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||53.0%| |0685|Redundant Connection II|[Go]({{< relref "/ChapterFour/0600~0699/0685.Redundant-Connection-II.md" >}})|Hard||||33.0%| |0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||64.9%| |0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium||||51.9%| @@ -65,7 +65,7 @@ weight: 9 |0872|Leaf-Similar Trees|[Go]({{< relref "/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md" >}})|Easy||||64.5%| |0897|Increasing Order Search Tree|[Go]({{< relref "/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md" >}})|Easy||||74.6%| |0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard||||41.9%| -|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||41.4%| +|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard||||41.3%| |0947|Most Stones Removed with Same Row or Column|[Go]({{< relref "/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})|Medium||||55.4%| |0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium||||67.2%| |0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||38.8%| @@ -74,7 +74,7 @@ weight: 9 |0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||38.9%| |1020|Number of Enclaves|[Go]({{< relref "/ChapterFour/1000~1099/1020.Number-of-Enclaves.md" >}})|Medium||||59.1%| |1026|Maximum Difference Between Node and Ancestor|[Go]({{< relref "/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})|Medium||||69.5%| -|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||70.9%| +|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||71.0%| |1038|Binary Search Tree to Greater Sum Tree|[Go]({{< relref "/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md" >}})|Medium||||82.4%| |1110|Delete Nodes And Return Forest|[Go]({{< relref "/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md" >}})|Medium||||67.8%| |1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||68.0%| diff --git a/website/content/ChapterTwo/Dynamic_Programming.md b/website/content/ChapterTwo/Dynamic_Programming.md index e161b46f..4e2e0f82 100644 --- a/website/content/ChapterTwo/Dynamic_Programming.md +++ b/website/content/ChapterTwo/Dynamic_Programming.md @@ -20,7 +20,7 @@ weight: 7 |0095|Unique Binary Search Trees II|[Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}})|Medium||||42.7%| |0096|Unique Binary Search Trees|[Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}})|Medium| O(n)| O(n)||54.5%| |0120|Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0120.Triangle.md" >}})|Medium| O(n^2)| O(n)||45.9%| -|0121|Best Time to Buy and Sell Stock|[Go]({{< relref "/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})|Easy| O(n)| O(1)||51.6%| +|0121|Best Time to Buy and Sell Stock|[Go]({{< relref "/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md" >}})|Easy| O(n)| O(1)||51.7%| |0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium||||52.2%| |0152|Maximum Product Subarray|[Go]({{< relref "/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md" >}})|Medium| O(n)| O(1)||32.8%| |0174|Dungeon Game|[Go]({{< relref "/ChapterFour/0100~0199/0174.Dungeon-Game.md" >}})|Hard||||33.3%| @@ -30,7 +30,7 @@ weight: 7 |0303|Range Sum Query - Immutable|[Go]({{< relref "/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable.md" >}})|Easy||||47.8%| |0304|Range Sum Query 2D - Immutable|[Go]({{< relref "/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable.md" >}})|Medium||||40.6%| |0309|Best Time to Buy and Sell Stock with Cooldown|[Go]({{< relref "/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md" >}})|Medium| O(n)| O(n)||48.2%| -|0322|Coin Change|[Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}})|Medium| O(n)| O(n)||37.3%| +|0322|Coin Change|[Go]({{< relref "/ChapterFour/0300~0399/0322.Coin-Change.md" >}})|Medium| O(n)| O(n)||37.4%| |0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||51.9%| |0338|Counting Bits|[Go]({{< relref "/ChapterFour/0300~0399/0338.Counting-Bits.md" >}})|Medium| O(n)| O(n)||70.4%| |0343|Integer Break|[Go]({{< relref "/ChapterFour/0300~0399/0343.Integer-Break.md" >}})|Medium| O(n^2)| O(n)||51.2%| @@ -42,7 +42,7 @@ weight: 7 |0416|Partition Equal Subset Sum|[Go]({{< relref "/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md" >}})|Medium| O(n^2)| O(n)||44.9%| |0474|Ones and Zeroes|[Go]({{< relref "/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md" >}})|Medium||||43.7%| |0494|Target Sum|[Go]({{< relref "/ChapterFour/0400~0499/0494.Target-Sum.md" >}})|Medium||||45.7%| -|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||52.9%| +|0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||53.0%| |0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go]({{< relref "/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})|Medium| O(n)| O(1)||56.2%| |0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||50.4%| |0746|Min Cost Climbing Stairs|[Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}})|Easy| O(n)| O(1)||50.9%| @@ -56,12 +56,12 @@ weight: 7 |1049|Last Stone Weight II|[Go]({{< relref "/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md" >}})|Medium||||45.4%| |1074|Number of Submatrices That Sum to Target|[Go]({{< relref "/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md" >}})|Hard||||61.8%| |1105|Filling Bookcase Shelves|[Go]({{< relref "/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md" >}})|Medium||||57.5%| -|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||47.5%| +|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||47.4%| |1423|Maximum Points You Can Obtain from Cards|[Go]({{< relref "/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards.md" >}})|Medium||||46.7%| |1463|Cherry Pickup II|[Go]({{< relref "/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md" >}})|Hard||||69.0%| |1641|Count Sorted Vowel Strings|[Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}})|Medium||||76.3%| |1654|Minimum Jumps to Reach Home|[Go]({{< relref "/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md" >}})|Medium||||25.6%| -|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||40.0%| +|1655|Distribute Repeating Integers|[Go]({{< relref "/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md" >}})|Hard||||39.9%| |1659|Maximize Grid Happiness|[Go]({{< relref "/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md" >}})|Hard||||35.6%| |1664|Ways to Make a Fair Array|[Go]({{< relref "/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md" >}})|Medium||||62.1%| |1690|Stone Game VII|[Go]({{< relref "/ChapterFour/1600~1699/1690.Stone-Game-VII.md" >}})|Medium||||48.3%| diff --git a/website/content/ChapterTwo/Hash_Table.md b/website/content/ChapterTwo/Hash_Table.md index b5133123..c5717899 100644 --- a/website/content/ChapterTwo/Hash_Table.md +++ b/website/content/ChapterTwo/Hash_Table.md @@ -26,7 +26,7 @@ weight: 13 |0205|Isomorphic Strings|[Go]({{< relref "/ChapterFour/0200~0299/0205.Isomorphic-Strings.md" >}})|Easy| O(log n)| O(n)||40.5%| |0217|Contains Duplicate|[Go]({{< relref "/ChapterFour/0200~0299/0217.Contains-Duplicate.md" >}})|Easy| O(n)| O(n)||56.7%| |0219|Contains Duplicate II|[Go]({{< relref "/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md" >}})|Easy| O(n)| O(n)||38.7%| -|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy| O(n)| O(n) ||58.6%| +|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy| O(n)| O(n) ||58.7%| |0274|H-Index|[Go]({{< relref "/ChapterFour/0200~0299/0274.H-Index.md" >}})|Medium| O(n)| O(n) ||36.4%| |0290|Word Pattern|[Go]({{< relref "/ChapterFour/0200~0299/0290.Word-Pattern.md" >}})|Easy| O(n)| O(n) ||38.4%| |0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium| O(n)| O(n) ||62.5%| @@ -37,7 +37,7 @@ weight: 13 |0409|Longest Palindrome|[Go]({{< relref "/ChapterFour/0400~0499/0409.Longest-Palindrome.md" >}})|Easy||||52.2%| |0438|Find All Anagrams in a String|[Go]({{< relref "/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md" >}})|Medium| O(n)| O(1) ||45.0%| |0447|Number of Boomerangs|[Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}})|Medium| O(n)| O(1) ||52.5%| -|0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium| O(n log n)| O(1) ||64.4%| +|0451|Sort Characters By Frequency|[Go]({{< relref "/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md" >}})|Medium| O(n log n)| O(1) ||64.5%| |0454|4Sum II|[Go]({{< relref "/ChapterFour/0400~0499/0454.4Sum-II.md" >}})|Medium| O(n^2)| O(n) ||54.6%| |0463|Island Perimeter|[Go]({{< relref "/ChapterFour/0400~0499/0463.Island-Perimeter.md" >}})|Easy||||66.7%| |0500|Keyboard Row|[Go]({{< relref "/ChapterFour/0500~0599/0500.Keyboard-Row.md" >}})|Easy||||65.7%| @@ -50,7 +50,7 @@ weight: 13 |0648|Replace Words|[Go]({{< relref "/ChapterFour/0600~0699/0648.Replace-Words.md" >}})|Medium| O(n)| O(n) ||58.7%| |0676|Implement Magic Dictionary|[Go]({{< relref "/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md" >}})|Medium| O(n)| O(n) ||55.3%| |0705|Design HashSet|[Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}})|Easy||||64.6%| -|0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||64.3%| +|0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||64.2%| |0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||32.9%| |0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||50.4%| |0720|Longest Word in Dictionary|[Go]({{< relref "/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md" >}})|Easy| O(n)| O(n) ||49.3%| @@ -66,18 +66,18 @@ weight: 13 |0953|Verifying an Alien Dictionary|[Go]({{< relref "/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md" >}})|Easy||||52.0%| |0961|N-Repeated Element in Size 2N Array|[Go]({{< relref "/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md" >}})|Easy||||74.5%| |0970|Powerful Integers|[Go]({{< relref "/ChapterFour/0900~0999/0970.Powerful-Integers.md" >}})|Medium||||40.0%| -|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||54.1%| +|0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||54.2%| |0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||38.9%| |0992|Subarrays with K Different Integers|[Go]({{< relref "/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md" >}})|Hard| O(n)| O(n) |❤️|50.7%| |1002|Find Common Characters|[Go]({{< relref "/ChapterFour/1000~1099/1002.Find-Common-Characters.md" >}})|Easy||||68.6%| |1078|Occurrences After Bigram|[Go]({{< relref "/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md" >}})|Easy||||64.9%| |1160|Find Words That Can Be Formed by Characters|[Go]({{< relref "/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md" >}})|Easy||||67.9%| -|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||39.3%| +|1178|Number of Valid Words for Each Puzzle|[Go]({{< relref "/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle.md" >}})|Hard||||39.4%| |1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||61.9%| |1207|Unique Number of Occurrences|[Go]({{< relref "/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md" >}})|Easy||||71.8%| |1512|Number of Good Pairs|[Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}})|Easy||||87.7%| |1539|Kth Missing Positive Number|[Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}})|Easy||||55.0%| -|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||60.0%| +|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||59.9%| |1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||54.0%| |1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||75.5%| |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------| diff --git a/website/content/ChapterTwo/Linked_List.md b/website/content/ChapterTwo/Linked_List.md index f245b3ac..2ce67d56 100644 --- a/website/content/ChapterTwo/Linked_List.md +++ b/website/content/ChapterTwo/Linked_List.md @@ -25,7 +25,7 @@ weight: 4 |:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: | |0002|Add Two Numbers|[Go]({{< relref "/ChapterFour/0001~0099/0002.Add-Two-Numbers.md" >}})|Medium| O(n)| O(1)||35.5%| |0019|Remove Nth Node From End of List|[Go]({{< relref "/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md" >}})|Medium| O(n)| O(1)||35.8%| -|0021|Merge Two Sorted Lists|[Go]({{< relref "/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md" >}})|Easy| O(log n)| O(1)||56.1%| +|0021|Merge Two Sorted Lists|[Go]({{< relref "/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md" >}})|Easy| O(log n)| O(1)||56.2%| |0023|Merge k Sorted Lists|[Go]({{< relref "/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md" >}})|Hard| O(log n)| O(1)|❤️|42.8%| |0024|Swap Nodes in Pairs|[Go]({{< relref "/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md" >}})|Medium| O(n)| O(1)||53.2%| |0025|Reverse Nodes in k-Group|[Go]({{< relref "/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md" >}})|Hard| O(log n)| O(1)|❤️|45.0%| @@ -33,10 +33,10 @@ weight: 4 |0082|Remove Duplicates from Sorted List II|[Go]({{< relref "/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md" >}})|Medium| O(n)| O(1)||39.3%| |0083|Remove Duplicates from Sorted List|[Go]({{< relref "/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md" >}})|Easy| O(n)| O(1)||46.6%| |0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|43.5%| -|0092|Reverse Linked List II|[Go]({{< relref "/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md" >}})|Medium| O(n)| O(1)|❤️|40.6%| +|0092|Reverse Linked List II|[Go]({{< relref "/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md" >}})|Medium| O(n)| O(1)|❤️|40.7%| |0109|Convert Sorted List to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md" >}})|Medium| O(log n)| O(n)||50.3%| |0138|Copy List with Random Pointer|[Go]({{< relref "/ChapterFour/0100~0199/0138.Copy-List-with-Random-Pointer.md" >}})|Medium||||41.0%| -|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy| O(n)| O(1)|❤️|42.9%| +|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy| O(n)| O(1)|❤️|43.0%| |0142|Linked List Cycle II|[Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}})|Medium| O(n)| O(1)|❤️|39.8%| |0143|Reorder List|[Go]({{< relref "/ChapterFour/0100~0199/0143.Reorder-List.md" >}})|Medium| O(n)| O(1)|❤️|40.7%| |0147|Insertion Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0147.Insertion-Sort-List.md" >}})|Medium| O(n)| O(1)|❤️|44.5%| @@ -45,7 +45,7 @@ weight: 4 |0203|Remove Linked List Elements|[Go]({{< relref "/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md" >}})|Easy| O(n)| O(1)||39.2%| |0206|Reverse Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0206.Reverse-Linked-List.md" >}})|Easy| O(n)| O(1)||65.4%| |0234|Palindrome Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md" >}})|Easy| O(n)| O(1)||40.6%| -|0237|Delete Node in a Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md" >}})|Easy| O(n)| O(1)||67.0%| +|0237|Delete Node in a Linked List|[Go]({{< relref "/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md" >}})|Easy| O(n)| O(1)||67.1%| |0328|Odd Even Linked List|[Go]({{< relref "/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md" >}})|Medium| O(n)| O(1)||57.1%| |0445|Add Two Numbers II|[Go]({{< relref "/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md" >}})|Medium| O(n)| O(n)||56.4%| |0707|Design Linked List|[Go]({{< relref "/ChapterFour/0700~0799/0707.Design-Linked-List.md" >}})|Medium| O(n)| O(1)||25.9%| @@ -56,7 +56,7 @@ weight: 4 |1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go]({{< relref "/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md" >}})|Medium||||41.5%| |1290|Convert Binary Number in a Linked List to Integer|[Go]({{< relref "/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md" >}})|Easy||||81.8%| |1669|Merge In Between Linked Lists|[Go]({{< relref "/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md" >}})|Medium||||76.3%| -|1670|Design Front Middle Back Queue|[Go]({{< relref "/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md" >}})|Medium||||54.4%| +|1670|Design Front Middle Back Queue|[Go]({{< relref "/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md" >}})|Medium||||54.2%| |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------| diff --git a/website/content/ChapterTwo/Math.md b/website/content/ChapterTwo/Math.md index 829e645b..ddf51e8a 100644 --- a/website/content/ChapterTwo/Math.md +++ b/website/content/ChapterTwo/Math.md @@ -13,9 +13,10 @@ weight: 12 |0007|Reverse Integer|[Go]({{< relref "/ChapterFour/0001~0099/0007.Reverse-Integer.md" >}})|Easy||||25.9%| |0008|String to Integer (atoi)|[Go]({{< relref "/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md" >}})|Medium||||15.7%| |0009|Palindrome Number|[Go]({{< relref "/ChapterFour/0001~0099/0009.Palindrome-Number.md" >}})|Easy||||49.8%| -|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||56.6%| +|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||57.0%| |0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||56.9%| |0029|Divide Two Integers|[Go]({{< relref "/ChapterFour/0001~0099/0029.Divide-Two-Integers.md" >}})|Medium||||16.9%| +|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||35.0%| |0050|Pow(x, n)|[Go]({{< relref "/ChapterFour/0001~0099/0050.Powx-n.md" >}})|Medium| O(log n)| O(1)||31.0%| |0060|Permutation Sequence|[Go]({{< relref "/ChapterFour/0001~0099/0060.Permutation-Sequence.md" >}})|Hard| O(n log n)| O(1)||39.4%| |0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||47.0%| @@ -51,15 +52,15 @@ weight: 12 |0753|Cracking the Safe|[Go]({{< relref "/ChapterFour/0700~0799/0753.Cracking-the-Safe.md" >}})|Hard||||52.4%| |0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||55.6%| |0812|Largest Triangle Area|[Go]({{< relref "/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md" >}})|Easy||||59.0%| -|0836|Rectangle Overlap|[Go]({{< relref "/ChapterFour/0800~0899/0836.Rectangle-Overlap.md" >}})|Easy||||44.2%| +|0836|Rectangle Overlap|[Go]({{< relref "/ChapterFour/0800~0899/0836.Rectangle-Overlap.md" >}})|Easy||||44.1%| |0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||28.8%| |0885|Spiral Matrix III|[Go]({{< relref "/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md" >}})|Medium| O(n^2)| O(1)||70.9%| |0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||27.0%| |0891|Sum of Subsequence Widths|[Go]({{< relref "/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md" >}})|Hard| O(n log n)| O(1)||33.1%| |0892|Surface Area of 3D Shapes|[Go]({{< relref "/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md" >}})|Easy||||59.8%| |0910|Smallest Range II|[Go]({{< relref "/ChapterFour/0900~0999/0910.Smallest-Range-II.md" >}})|Medium||||31.2%| -|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||34.1%| -|0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||34.6%| +|0914|X of a Kind in a Deck of Cards|[Go]({{< relref "/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md" >}})|Easy||||34.2%| +|0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||34.7%| |0942|DI String Match|[Go]({{< relref "/ChapterFour/0900~0999/0942.DI-String-Match.md" >}})|Easy| O(n)| O(1)||73.6%| |0949|Largest Time for Given Digits|[Go]({{< relref "/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md" >}})|Medium||||36.2%| |0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard||||36.2%| @@ -72,7 +73,7 @@ weight: 12 |1037|Valid Boomerang|[Go]({{< relref "/ChapterFour/1000~1099/1037.Valid-Boomerang.md" >}})|Easy||||37.8%| |1073|Adding Two Negabinary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md" >}})|Medium||||34.9%| |1093|Statistics from a Large Sample|[Go]({{< relref "/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md" >}})|Medium||||49.4%| -|1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||49.2%| +|1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||49.1%| |1175|Prime Arrangements|[Go]({{< relref "/ChapterFour/1100~1199/1175.Prime-Arrangements.md" >}})|Easy||||52.0%| |1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||26.4%| |1217|Minimum Cost to Move Chips to The Same Position|[Go]({{< relref "/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md" >}})|Easy||||71.1%| diff --git a/website/content/ChapterTwo/Sort.md b/website/content/ChapterTwo/Sort.md index 61997a10..89ce0b9b 100644 --- a/website/content/ChapterTwo/Sort.md +++ b/website/content/ChapterTwo/Sort.md @@ -19,14 +19,14 @@ weight: 14 | No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance | |:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: | |0056|Merge Intervals|[Go]({{< relref "/ChapterFour/0001~0099/0056.Merge-Intervals.md" >}})|Medium| O(n log n)| O(log n)||41.1%| -|0057|Insert Interval|[Go]({{< relref "/ChapterFour/0001~0099/0057.Insert-Interval.md" >}})|Medium| O(n)| O(1)||35.1%| +|0057|Insert Interval|[Go]({{< relref "/ChapterFour/0001~0099/0057.Insert-Interval.md" >}})|Medium| O(n)| O(1)||35.2%| |0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|49.5%| |0147|Insertion Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0147.Insertion-Sort-List.md" >}})|Medium| O(n^2)| O(1) |❤️|44.5%| |0148|Sort List|[Go]({{< relref "/ChapterFour/0100~0199/0148.Sort-List.md" >}})|Medium|O(n log n)| O(log n)|❤️|46.4%| |0164|Maximum Gap|[Go]({{< relref "/ChapterFour/0100~0199/0164.Maximum-Gap.md" >}})|Hard| O(n log n)| O(log n) |❤️|36.9%| |0179|Largest Number|[Go]({{< relref "/ChapterFour/0100~0199/0179.Largest-Number.md" >}})|Medium| O(n log n)| O(log n) |❤️|30.7%| |0220|Contains Duplicate III|[Go]({{< relref "/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md" >}})|Medium| O(n log n)| O(1) |❤️|21.3%| -|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy| O(n)| O(n) ||58.6%| +|0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy| O(n)| O(n) ||58.7%| |0274|H-Index|[Go]({{< relref "/ChapterFour/0200~0299/0274.H-Index.md" >}})|Medium| O(n)| O(n) ||36.4%| |0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard||||42.5%| |0324|Wiggle Sort II|[Go]({{< relref "/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md" >}})|Medium| O(n)| O(n)|❤️|30.7%| @@ -42,14 +42,14 @@ weight: 14 |0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium| O(n log n)| O(log n) |❤️|68.7%| |0973|K Closest Points to Origin|[Go]({{< relref "/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md" >}})|Medium| O(n log n)| O(log n) ||64.6%| |0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy| O(n log n)| O(log n) ||58.6%| -|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy| O(n^2)| O(1) ||67.0%| +|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy| O(n^2)| O(1) ||67.1%| |1054|Distant Barcodes|[Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}})|Medium| O(n log n)| O(log n) |❤️|44.3%| |1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.1%| -|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||47.5%| +|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||47.4%| |1305|All Elements in Two Binary Search Trees|[Go]({{< relref "/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}})|Medium||||77.8%| |1329|Sort the Matrix Diagonally|[Go]({{< relref "/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md" >}})|Medium||||81.8%| |1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||66.8%| -|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||60.0%| +|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||59.9%| |1647|Minimum Deletions to Make Character Frequencies Unique|[Go]({{< relref "/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md" >}})|Medium||||54.6%| |1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.6%| |1691|Maximum Height by Stacking Cuboids|[Go]({{< relref "/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids.md" >}})|Hard||||50.1%| diff --git a/website/content/ChapterTwo/Stack.md b/website/content/ChapterTwo/Stack.md index 4c8d424c..1c50f530 100644 --- a/website/content/ChapterTwo/Stack.md +++ b/website/content/ChapterTwo/Stack.md @@ -30,18 +30,19 @@ weight: 5 |0173|Binary Search Tree Iterator|[Go]({{< relref "/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md" >}})|Medium| O(n)| O(1)||60.3%| |0224|Basic Calculator|[Go]({{< relref "/ChapterFour/0200~0299/0224.Basic-Calculator.md" >}})|Hard| O(n)| O(n)||38.2%| |0225|Implement Stack using Queues|[Go]({{< relref "/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md" >}})|Easy| O(n)| O(n)||47.6%| +|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||38.6%| |0232|Implement Queue using Stacks|[Go]({{< relref "/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md" >}})|Easy| O(n)| O(n)||52.4%| |0331|Verify Preorder Serialization of a Binary Tree|[Go]({{< relref "/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})|Medium| O(n)| O(1)||41.0%| |0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||34.5%| -|0394|Decode String|[Go]({{< relref "/ChapterFour/0300~0399/0394.Decode-String.md" >}})|Medium| O(n)| O(n)||52.7%| +|0394|Decode String|[Go]({{< relref "/ChapterFour/0300~0399/0394.Decode-String.md" >}})|Medium| O(n)| O(n)||52.8%| |0402|Remove K Digits|[Go]({{< relref "/ChapterFour/0400~0499/0402.Remove-K-Digits.md" >}})|Medium| O(n)| O(1)||28.7%| |0456|132 Pattern|[Go]({{< relref "/ChapterFour/0400~0499/0456.132-Pattern.md" >}})|Medium| O(n)| O(n)||30.6%| |0496|Next Greater Element I|[Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}})|Easy| O(n)| O(n)||65.7%| |0503|Next Greater Element II|[Go]({{< relref "/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md" >}})|Medium| O(n)| O(n)||58.5%| |0636|Exclusive Time of Functions|[Go]({{< relref "/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md" >}})|Medium| O(n)| O(n)||54.6%| -|0682|Baseball Game|[Go]({{< relref "/ChapterFour/0600~0699/0682.Baseball-Game.md" >}})|Easy| O(n)| O(n)||67.1%| +|0682|Baseball Game|[Go]({{< relref "/ChapterFour/0600~0699/0682.Baseball-Game.md" >}})|Easy| O(n)| O(n)||67.2%| |0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard| O(n)| O(n) |❤️|51.0%| -|0735|Asteroid Collision|[Go]({{< relref "/ChapterFour/0700~0799/0735.Asteroid-Collision.md" >}})|Medium| O(n)| O(n) ||43.3%| +|0735|Asteroid Collision|[Go]({{< relref "/ChapterFour/0700~0799/0735.Asteroid-Collision.md" >}})|Medium| O(n)| O(n) ||43.2%| |0739|Daily Temperatures|[Go]({{< relref "/ChapterFour/0700~0799/0739.Daily-Temperatures.md" >}})|Medium| O(n)| O(n) ||64.7%| |0844|Backspace String Compare|[Go]({{< relref "/ChapterFour/0800~0899/0844.Backspace-String-Compare.md" >}})|Easy| O(n)| O(n) ||47.1%| |0856|Score of Parentheses|[Go]({{< relref "/ChapterFour/0800~0899/0856.Score-of-Parentheses.md" >}})|Medium| O(n)| O(n)||64.8%| diff --git a/website/content/ChapterTwo/String.md b/website/content/ChapterTwo/String.md index 7b6f03af..ff5e8483 100644 --- a/website/content/ChapterTwo/String.md +++ b/website/content/ChapterTwo/String.md @@ -13,13 +13,14 @@ weight: 2 |0005|Longest Palindromic Substring|[Go]({{< relref "/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md" >}})|Medium||||30.5%| |0006|ZigZag Conversion|[Go]({{< relref "/ChapterFour/0001~0099/0006.ZigZag-Conversion.md" >}})|Medium||||38.0%| |0008|String to Integer (atoi)|[Go]({{< relref "/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md" >}})|Medium||||15.7%| -|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||56.6%| +|0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||57.0%| |0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||56.9%| -|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium| O(log n)| O(1)||49.2%| +|0017|Letter Combinations of a Phone Number|[Go]({{< relref "/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md" >}})|Medium| O(log n)| O(1)||49.3%| |0020|Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0020.Valid-Parentheses.md" >}})|Easy| O(log n)| O(1)||39.9%| |0022|Generate Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0022.Generate-Parentheses.md" >}})|Medium| O(log n)| O(1)||65.4%| -|0028|Implement strStr()|[Go]({{< relref "/ChapterFour/0001~0099/0028.Implement-strStr.md" >}})|Easy| O(n)| O(1)||35.2%| +|0028|Implement strStr()|[Go]({{< relref "/ChapterFour/0001~0099/0028.Implement-strStr.md" >}})|Easy| O(n)| O(1)||35.3%| |0030|Substring with Concatenation of All Words|[Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}})|Hard| O(n)| O(n)|❤️|26.2%| +|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||35.0%| |0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium| O(n log n)| O(n)||59.4%| |0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||47.0%| |0071|Simplify Path|[Go]({{< relref "/ChapterFour/0001~0099/0071.Simplify-Path.md" >}})|Medium| O(n)| O(n)||34.7%| @@ -29,6 +30,7 @@ weight: 2 |0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||38.3%| |0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|23.8%| |0151|Reverse Words in a String|[Go]({{< relref "/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md" >}})|Medium||||23.8%| +|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||38.6%| |0344|Reverse String|[Go]({{< relref "/ChapterFour/0300~0399/0344.Reverse-String.md" >}})|Easy| O(n)| O(1)||70.4%| |0345|Reverse Vowels of a String|[Go]({{< relref "/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md" >}})|Easy| O(n)| O(1)||45.1%| |0385|Mini Parser|[Go]({{< relref "/ChapterFour/0300~0399/0385.Mini-Parser.md" >}})|Medium||||34.5%| @@ -39,20 +41,20 @@ weight: 2 |0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||54.3%| |0767|Reorganize String|[Go]({{< relref "/ChapterFour/0700~0799/0767.Reorganize-String.md" >}})|Medium| O(n log n)| O(log n) |❤️|50.2%| |0819|Most Common Word|[Go]({{< relref "/ChapterFour/0800~0899/0819.Most-Common-Word.md" >}})|Easy||||45.5%| -|0842|Split Array into Fibonacci Sequence|[Go]({{< relref "/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md" >}})|Medium| O(n^2)| O(1)|❤️|36.9%| +|0842|Split Array into Fibonacci Sequence|[Go]({{< relref "/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md" >}})|Medium| O(n^2)| O(1)|❤️|37.0%| |0856|Score of Parentheses|[Go]({{< relref "/ChapterFour/0800~0899/0856.Score-of-Parentheses.md" >}})|Medium| O(n)| O(n)||64.8%| |0925|Long Pressed Name|[Go]({{< relref "/ChapterFour/0900~0999/0925.Long-Pressed-Name.md" >}})|Easy| O(n)| O(1)||37.8%| |1003|Check If Word Is Valid After Substitutions|[Go]({{< relref "/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})|Medium| O(n)| O(1)||56.5%| |1108|Defanging an IP Address|[Go]({{< relref "/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md" >}})|Easy||||88.4%| -|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||59.8%| +|1170|Compare Strings by Frequency of the Smallest Character|[Go]({{< relref "/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md" >}})|Medium||||59.9%| |1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||61.9%| |1221|Split a String in Balanced Strings|[Go]({{< relref "/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md" >}})|Easy||||84.3%| |1234|Replace the Substring for Balanced String|[Go]({{< relref "/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md" >}})|Medium||||34.5%| |1249|Minimum Remove to Make Valid Parentheses|[Go]({{< relref "/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})|Medium||||64.2%| -|1332|Remove Palindromic Subsequences|[Go]({{< relref "/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md" >}})|Easy||||68.0%| -|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go]({{< relref "/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md" >}})|Easy||||64.9%| +|1332|Remove Palindromic Subsequences|[Go]({{< relref "/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences.md" >}})|Easy||||68.1%| +|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go]({{< relref "/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md" >}})|Easy||||65.0%| |1573|Number of Ways to Split a String|[Go]({{< relref "/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md" >}})|Medium||||31.2%| -|1614|Maximum Nesting Depth of the Parentheses|[Go]({{< relref "/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md" >}})|Easy||||82.7%| +|1614|Maximum Nesting Depth of the Parentheses|[Go]({{< relref "/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md" >}})|Easy||||82.8%| |1624|Largest Substring Between Two Equal Characters|[Go]({{< relref "/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters.md" >}})|Easy||||58.7%| |1653|Minimum Deletions to Make String Balanced|[Go]({{< relref "/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})|Medium||||51.4%| |1662|Check If Two String Arrays are Equivalent|[Go]({{< relref "/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md" >}})|Easy||||82.9%| diff --git a/website/content/ChapterTwo/Tree.md b/website/content/ChapterTwo/Tree.md index f7da7fe4..af5fb6b8 100644 --- a/website/content/ChapterTwo/Tree.md +++ b/website/content/ChapterTwo/Tree.md @@ -47,7 +47,7 @@ weight: 6 |0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||62.7%| |0515|Find Largest Value in Each Tree Row|[Go]({{< relref "/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}})|Medium| O(n)| O(n)||62.3%| |0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||59.5%| -|0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||53.0%| +|0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||53.1%| |0572|Subtree of Another Tree|[Go]({{< relref "/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md" >}})|Easy||||44.5%| |0623|Add One Row to Tree|[Go]({{< relref "/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md" >}})|Medium||||53.1%| |0637|Average of Levels in Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md" >}})|Easy| O(n)| O(n)||66.0%| @@ -65,7 +65,7 @@ weight: 6 |0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||38.9%| |0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy| O(n)| O(1)||52.3%| |1026|Maximum Difference Between Node and Ancestor|[Go]({{< relref "/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})|Medium||||69.5%| -|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||70.9%| +|1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||71.0%| |1038|Binary Search Tree to Greater Sum Tree|[Go]({{< relref "/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md" >}})|Medium||||82.4%| |1110|Delete Nodes And Return Forest|[Go]({{< relref "/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md" >}})|Medium||||67.8%| |1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||68.0%| diff --git a/website/content/ChapterTwo/Two_Pointers.md b/website/content/ChapterTwo/Two_Pointers.md index 42e10760..95b78c21 100644 --- a/website/content/ChapterTwo/Two_Pointers.md +++ b/website/content/ChapterTwo/Two_Pointers.md @@ -40,7 +40,7 @@ weight: 3 |0019|Remove Nth Node From End of List|[Go]({{< relref "/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md" >}})|Medium| O(n)| O(1)||35.8%| |0026|Remove Duplicates from Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md" >}})|Easy| O(n)| O(1)||46.6%| |0027|Remove Element|[Go]({{< relref "/ChapterFour/0001~0099/0027.Remove-Element.md" >}})|Easy| O(n)| O(1)||49.3%| -|0028|Implement strStr()|[Go]({{< relref "/ChapterFour/0001~0099/0028.Implement-strStr.md" >}})|Easy| O(n)| O(1)||35.2%| +|0028|Implement strStr()|[Go]({{< relref "/ChapterFour/0001~0099/0028.Implement-strStr.md" >}})|Easy| O(n)| O(1)||35.3%| |0030|Substring with Concatenation of All Words|[Go]({{< relref "/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md" >}})|Hard| O(n)| O(n)|❤️|26.2%| |0042|Trapping Rain Water|[Go]({{< relref "/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md" >}})|Hard| O(n)| O(1)|❤️|51.3%| |0061|Rotate List|[Go]({{< relref "/ChapterFour/0001~0099/0061.Rotate-List.md" >}})|Medium| O(n)| O(1)||31.8%| @@ -50,7 +50,7 @@ weight: 3 |0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|43.5%| |0088|Merge Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md" >}})|Easy| O(n)| O(1)|❤️|40.8%| |0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||38.3%| -|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy| O(n)| O(1)|❤️|42.9%| +|0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy| O(n)| O(1)|❤️|43.0%| |0142|Linked List Cycle II|[Go]({{< relref "/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md" >}})|Medium| O(n)| O(1)|❤️|39.8%| |0167|Two Sum II - Input array is sorted|[Go]({{< relref "/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted.md" >}})|Easy| O(n)| O(1)||55.7%| |0209|Minimum Size Subarray Sum|[Go]({{< relref "/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md" >}})|Medium| O(n)| O(1)||39.6%| diff --git a/website/content/ChapterTwo/Union_Find.md b/website/content/ChapterTwo/Union_Find.md index 8a82773e..a37327bb 100644 --- a/website/content/ChapterTwo/Union_Find.md +++ b/website/content/ChapterTwo/Union_Find.md @@ -32,7 +32,7 @@ weight: 16 |0803|Bricks Falling When Hit|[Go]({{< relref "/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md" >}})|Hard| O(n^2)| O(n)|❤️|31.5%| |0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard| O(n^2)| O(n)||41.0%| |0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard| O(m\*n)| O(n)||41.9%| -|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard| O(m\*n)| O(n)|❤️|41.4%| +|0928|Minimize Malware Spread II|[Go]({{< relref "/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md" >}})|Hard| O(m\*n)| O(n)|❤️|41.3%| |0947|Most Stones Removed with Same Row or Column|[Go]({{< relref "/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})|Medium| O(n)| O(n)||55.4%| |0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard| O(n)| O(n)|❤️|36.2%| |0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium| O(n^2)| O(n^2)|❤️|67.2%|