diff --git a/README.md b/README.md
index 62110056c..7bafcb92d 100755
--- a/README.md
+++ b/README.md
@@ -127,15 +127,15 @@
 |    |  Easy  |  Medium  |  Hard |  Total |
 |:--------:|:--------:|:--------:|:--------:|:--------:|
 |Optimizing|33|32|24|89|
-|Accepted|**285**|**388**|**115**|**788**|
-|Total|499|1003|399|1901|
+|Accepted|**285**|**389**|**115**|**789**|
+|Total|500|1006|399|1905|
 |Perfection Rate|88.4%|91.8%|79.1%|88.7%|
-|Completion Rate|57.1%|38.7%|28.8%|41.5%|
+|Completion Rate|57.0%|38.7%|28.8%|41.4%|
 |------------|----------------------------|----------------------------|----------------------------|----------------------------|
 
 ## 二. 目录
 
-以下已经收录了 699 道题的题解，还有 11 道题在尝试优化到 beats 100%
+以下已经收录了 700 道题的题解，还有 11 道题在尝试优化到 beats 100%
 
 | No.    |  Title  |  Solution  |  Acceptance |  Difficulty |  Frequency |
 |:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|
@@ -146,8 +146,8 @@
 |0005|Longest Palindromic Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0005.Longest-Palindromic-Substring)|30.9%|Medium||
 |0006|ZigZag Conversion|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0006.ZigZag-Conversion)|38.8%|Medium||
 |0007|Reverse Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer)|26.0%|Easy||
-|0008|String to Integer (atoi)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0008.String-to-Integer-(atoi))|15.8%|Medium||
-|0009|Palindrome Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number)|50.5%|Easy||
+|0008|String to Integer (atoi)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0008.String-to-Integer-(atoi))|15.9%|Medium||
+|0009|Palindrome Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number)|50.6%|Easy||
 |0010|Regular Expression Matching||27.6%|Hard||
 |0011|Container With Most Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water)|53.0%|Medium||
 |0012|Integer to Roman|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0012.Integer-to-Roman)|57.5%|Medium||
@@ -181,7 +181,7 @@
 |0040|Combination Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II)|50.9%|Medium||
 |0041|First Missing Positive|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive)|34.4%|Hard||
 |0042|Trapping Rain Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)|52.3%|Hard||
-|0043|Multiply Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0043.Multiply-Strings)|35.4%|Medium||
+|0043|Multiply Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0043.Multiply-Strings)|35.5%|Medium||
 |0044|Wildcard Matching||25.7%|Hard||
 |0045|Jump Game II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0045.Jump-Game-II)|33.1%|Medium||
 |0046|Permutations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations)|68.0%|Medium||
@@ -224,7 +224,7 @@
 |0083|Remove Duplicates from Sorted List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List)|47.0%|Easy||
 |0084|Largest Rectangle in Histogram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram)|38.0%|Hard||
 |0085|Maximal Rectangle||40.2%|Hard||
-|0086|Partition List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List)|45.3%|Medium||
+|0086|Partition List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List)|45.4%|Medium||
 |0087|Scramble String||34.9%|Hard||
 |0088|Merge Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array)|41.2%|Easy||
 |0089|Gray Code|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code)|51.2%|Medium||
@@ -239,7 +239,7 @@
 |0098|Validate Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree)|29.2%|Medium||
 |0099|Recover Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree)|43.4%|Medium||
 |0100|Same Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree)|54.5%|Easy||
-|0101|Symmetric Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)|49.0%|Easy||
+|0101|Symmetric Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)|49.1%|Easy||
 |0102|Binary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal)|57.9%|Medium||
 |0103|Binary Tree Zigzag Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal)|51.0%|Medium||
 |0104|Maximum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree)|69.0%|Easy||
@@ -249,11 +249,11 @@
 |0108|Convert Sorted Array to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree)|61.8%|Easy||
 |0109|Convert Sorted List to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree)|52.4%|Medium||
 |0110|Balanced Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree)|45.1%|Easy||
-|0111|Minimum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)|40.3%|Easy||
+|0111|Minimum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)|40.4%|Easy||
 |0112|Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum)|43.1%|Easy||
 |0113|Path Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II)|50.3%|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)|53.8%|Medium||
-|0115|Distinct Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0115.Distinct-Subsequences)|40.3%|Hard||
+|0115|Distinct Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0115.Distinct-Subsequences)|40.4%|Hard||
 |0116|Populating Next Right Pointers in Each Node||50.6%|Medium||
 |0117|Populating Next Right Pointers in Each Node II||43.0%|Medium||
 |0118|Pascal's Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0118.Pascal's-Triangle)|56.6%|Easy||
@@ -271,7 +271,7 @@
 |0130|Surrounded Regions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions)|30.4%|Medium||
 |0131|Palindrome Partitioning|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning)|53.7%|Medium||
 |0132|Palindrome Partitioning II||31.6%|Hard||
-|0133|Clone Graph||40.9%|Medium||
+|0133|Clone Graph||41.0%|Medium||
 |0134|Gas Station||42.1%|Medium||
 |0135|Candy||33.9%|Hard||
 |0136|Single Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number)|67.1%|Easy||
@@ -316,7 +316,7 @@
 |0175|Combine Two Tables||65.7%|Easy||
 |0176|Second Highest Salary||33.9%|Easy||
 |0177|Nth Highest Salary||34.0%|Medium||
-|0178|Rank Scores||52.3%|Medium||
+|0178|Rank Scores||52.4%|Medium||
 |0179|Largest Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number)|31.2%|Medium||
 |0180|Consecutive Numbers||43.2%|Medium||
 |0181|Employees Earning More Than Their Managers||62.1%|Easy||
@@ -326,7 +326,7 @@
 |0185|Department Top Three Salaries||41.2%|Hard||
 |0186|Reverse Words in a String II||46.8%|Medium||
 |0187|Repeated DNA Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences)|42.0%|Medium||
-|0188|Best Time to Buy and Sell Stock IV||30.6%|Hard||
+|0188|Best Time to Buy and Sell Stock IV||30.7%|Hard||
 |0189|Rotate Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0189.Rotate-Array)|36.9%|Medium||
 |0190|Reverse Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits)|43.5%|Easy||
 |0191|Number of 1 Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits)|55.1%|Easy||
@@ -361,7 +361,7 @@
 |0220|Contains Duplicate III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III)|21.4%|Medium||
 |0221|Maximal Square||40.2%|Medium||
 |0222|Count Complete Tree Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes)|50.6%|Medium||
-|0223|Rectangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0223.Rectangle-Area)|38.6%|Medium||
+|0223|Rectangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0223.Rectangle-Area)|38.7%|Medium||
 |0224|Basic Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator)|38.6%|Hard||
 |0225|Implement Stack using Queues|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues)|48.6%|Easy||
 |0226|Invert Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree)|68.0%|Easy||
@@ -381,7 +381,7 @@
 |0240|Search a 2D Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0240.Search-a-2D-Matrix-II)|45.9%|Medium||
 |0241|Different Ways to Add Parentheses||58.1%|Medium||
 |0242|Valid Anagram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)|59.3%|Easy||
-|0243|Shortest Word Distance||62.6%|Easy||
+|0243|Shortest Word Distance||62.7%|Easy||
 |0244|Shortest Word Distance II||55.6%|Medium||
 |0245|Shortest Word Distance III||56.4%|Medium||
 |0246|Strobogrammatic Number||46.8%|Easy||
@@ -416,9 +416,9 @@
 |0275|H-Index II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0275.H-Index-II)|36.5%|Medium||
 |0276|Paint Fence||39.6%|Medium||
 |0277|Find the Celebrity||44.6%|Medium||
-|0278|First Bad Version|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0278.First-Bad-Version)|38.3%|Easy||
+|0278|First Bad Version|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0278.First-Bad-Version)|38.4%|Easy||
 |0279|Perfect Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0279.Perfect-Squares)|49.7%|Medium||
-|0280|Wiggle Sort||65.0%|Medium||
+|0280|Wiggle Sort||65.1%|Medium||
 |0281|Zigzag Iterator||59.9%|Medium||
 |0282|Expression Add Operators||37.2%|Hard||
 |0283|Move Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes)|58.9%|Easy||
@@ -431,13 +431,13 @@
 |0290|Word Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0290.Word-Pattern)|38.6%|Easy||
 |0291|Word Pattern II||44.8%|Medium||
 |0292|Nim Game||55.2%|Easy||
-|0293|Flip Game||61.6%|Easy||
+|0293|Flip Game||61.7%|Easy||
 |0294|Flip Game II||50.9%|Medium||
 |0295|Find Median from Data Stream||48.2%|Hard||
 |0296|Best Meeting Point||58.4%|Hard||
-|0297|Serialize and Deserialize Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0297.Serialize-and-Deserialize-Binary-Tree)|50.9%|Hard||
+|0297|Serialize and Deserialize Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0297.Serialize-and-Deserialize-Binary-Tree)|51.0%|Hard||
 |0298|Binary Tree Longest Consecutive Sequence||48.6%|Medium||
-|0299|Bulls and Cows||45.1%|Medium||
+|0299|Bulls and Cows||45.2%|Medium||
 |0300|Longest Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence)|45.3%|Medium||
 |0301|Remove Invalid Parentheses||45.2%|Hard||
 |0302|Smallest Rectangle Enclosing Black Pixels||53.0%|Hard||
@@ -445,7 +445,7 @@
 |0304|Range Sum Query 2D - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0304.Range-Sum-Query-2D---Immutable)|43.8%|Medium||
 |0305|Number of Islands II||39.4%|Hard||
 |0306|Additive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number)|29.9%|Medium||
-|0307|Range Sum Query - Mutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query---Mutable)|37.6%|Medium||
+|0307|Range Sum Query - Mutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query---Mutable)|37.7%|Medium||
 |0308|Range Sum Query 2D - Mutable||38.9%|Hard||
 |0309|Best Time to Buy and Sell Stock with Cooldown|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown)|48.8%|Medium||
 |0310|Minimum Height Trees||35.2%|Medium||
@@ -478,20 +478,20 @@
 |0337|House Robber III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0337.House-Robber-III)|52.1%|Medium||
 |0338|Counting Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits)|71.0%|Easy||
 |0339|Nested List Weight Sum||77.4%|Medium||
-|0340|Longest Substring with At Most K Distinct Characters||46.0%|Medium||
+|0340|Longest Substring with At Most K Distinct Characters||46.1%|Medium||
 |0341|Flatten Nested List Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0341.Flatten-Nested-List-Iterator)|56.4%|Medium||
-|0342|Power of Four|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four)|42.0%|Easy||
+|0342|Power of Four|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four)|42.1%|Easy||
 |0343|Integer Break|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break)|51.5%|Medium||
 |0344|Reverse String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)|71.3%|Easy||
 |0345|Reverse Vowels of a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String)|45.6%|Easy||
 |0346|Moving Average from Data Stream||74.2%|Easy||
-|0347|Top K Frequent Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements)|62.9%|Medium||
+|0347|Top K Frequent Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements)|63.0%|Medium||
 |0348|Design Tic-Tac-Toe||56.3%|Medium||
 |0349|Intersection of Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)|66.1%|Easy||
 |0350|Intersection of Two Arrays II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II)|52.5%|Easy||
 |0351|Android Unlock Patterns||50.0%|Medium||
 |0352|Data Stream as Disjoint Intervals||49.1%|Hard||
-|0353|Design Snake Game||36.6%|Medium||
+|0353|Design Snake Game||36.7%|Medium||
 |0354|Russian Doll Envelopes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes)|38.3%|Hard||
 |0355|Design Twitter||32.3%|Medium||
 |0356|Line Reflection||33.4%|Medium||
@@ -500,7 +500,7 @@
 |0359|Logger Rate Limiter||73.1%|Easy||
 |0360|Sort Transformed Array||50.5%|Medium||
 |0361|Bomb Enemy||47.5%|Medium||
-|0362|Design Hit Counter||65.9%|Medium||
+|0362|Design Hit Counter||66.0%|Medium||
 |0363|Max Sum of Rectangle No Larger Than K||38.8%|Hard||
 |0364|Nested List Weight Sum II||64.7%|Medium||
 |0365|Water and Jug Problem||31.8%|Medium||
@@ -511,7 +511,7 @@
 |0370|Range Addition||64.0%|Medium||
 |0371|Sum of Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0371.Sum-of-Two-Integers)|50.6%|Medium||
 |0372|Super Pow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow)|36.9%|Medium||
-|0373|Find K Pairs with Smallest Sums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums)|38.6%|Medium||
+|0373|Find K Pairs with Smallest Sums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums)|38.7%|Medium||
 |0374|Guess Number Higher or Lower|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0374.Guess-Number-Higher-or-Lower)|45.6%|Easy||
 |0375|Guess Number Higher or Lower II||43.0%|Medium||
 |0376|Wiggle Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0376.Wiggle-Subsequence)|42.6%|Medium||
@@ -557,12 +557,12 @@
 |0416|Partition Equal Subset Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0416.Partition-Equal-Subset-Sum)|45.2%|Medium||
 |0417|Pacific Atlantic Water Flow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0417.Pacific-Atlantic-Water-Flow)|44.9%|Medium||
 |0418|Sentence Screen Fitting||34.0%|Medium||
-|0419|Battleships in a Board||71.6%|Medium||
+|0419|Battleships in a Board||71.7%|Medium||
 |0420|Strong Password Checker||13.6%|Hard||
-|0421|Maximum XOR of Two Numbers in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array)|54.6%|Medium||
+|0421|Maximum XOR of Two Numbers in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array)|54.7%|Medium||
 |0422|Valid Word Square||38.3%|Easy||
 |0423|Reconstruct Original Digits from English|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0423.Reconstruct-Original-Digits-from-English)|51.2%|Medium||
-|0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|48.8%|Medium||
+|0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|48.9%|Medium||
 |0425|Word Squares||50.7%|Hard||
 |0426|Convert Binary Search Tree to Sorted Doubly Linked List||62.1%|Medium||
 |0427|Construct Quad Tree||63.3%|Medium||
@@ -660,7 +660,7 @@
 |0519|Random Flip Matrix||38.0%|Medium||
 |0520|Detect Capital||54.1%|Easy||
 |0521|Longest Uncommon Subsequence I||59.2%|Easy||
-|0522|Longest Uncommon Subsequence II||34.3%|Medium||
+|0522|Longest Uncommon Subsequence II||34.4%|Medium||
 |0523|Continuous Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0523.Continuous-Subarray-Sum)|25.2%|Medium||
 |0524|Longest Word in Dictionary through Deleting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting)|50.3%|Medium||
 |0525|Contiguous Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0525.Contiguous-Array)|43.9%|Medium||
@@ -676,7 +676,7 @@
 |0535|Encode and Decode TinyURL|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0535.Encode-and-Decode-TinyURL)|82.7%|Medium||
 |0536|Construct Binary Tree from String||52.9%|Medium||
 |0537|Complex Number Multiplication|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0537.Complex-Number-Multiplication)|68.5%|Medium||
-|0538|Convert BST to Greater Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0538.Convert-BST-to-Greater-Tree)|60.5%|Medium||
+|0538|Convert BST to Greater Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0538.Convert-BST-to-Greater-Tree)|60.6%|Medium||
 |0539|Minimum Time Difference||52.6%|Medium||
 |0540|Single Element in a Sorted Array||58.0%|Medium||
 |0541|Reverse String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II)|49.7%|Easy||
@@ -686,7 +686,7 @@
 |0545|Boundary of Binary Tree||41.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)|61.3%|Medium||
-|0548|Split Array with Equal Sum||48.8%|Medium||
+|0548|Split Array with Equal Sum||48.9%|Medium||
 |0549|Binary Tree Longest Consecutive Sequence II||47.5%|Medium||
 |0550|Game Play Analysis IV||45.5%|Medium||
 |0551|Student Attendance Record I||46.4%|Easy||
@@ -695,12 +695,12 @@
 |0554|Brick Wall|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0554.Brick-Wall)|51.8%|Medium||
 |0555|Split Concatenated Strings||43.0%|Medium||
 |0556|Next Greater Element III||33.4%|Medium||
-|0557|Reverse Words in a String III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III)|73.0%|Easy||
+|0557|Reverse Words in a String III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III)|73.1%|Easy||
 |0558|Logical OR of Two Binary Grids Represented as Quad-Trees||45.9%|Medium||
 |0559|Maximum Depth of N-ary Tree||69.9%|Easy||
 |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.9%|Easy||
-|0562|Longest Line of Consecutive One in Matrix||46.9%|Medium||
+|0562|Longest Line of Consecutive One in Matrix||47.0%|Medium||
 |0563|Binary Tree Tilt|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt)|53.9%|Easy||
 |0564|Find the Closest Palindrome||20.4%|Hard||
 |0565|Array Nesting||56.2%|Medium||
@@ -709,7 +709,7 @@
 |0568|Maximum Vacation Days||42.0%|Hard||
 |0569|Median Employee Salary||63.2%|Hard||
 |0570|Managers with at Least 5 Direct Reports||67.1%|Medium||
-|0571|Find Median Given Frequency of Numbers||45.6%|Hard||
+|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.6%|Easy||
 |0573|Squirrel Simulation||54.3%|Medium||
 |0574|Winning Candidate||53.7%|Medium||
@@ -723,7 +723,7 @@
 |0582|Kill Process||64.4%|Medium||
 |0583|Delete Operation for Two Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0583.Delete-Operation-for-Two-Strings)|52.1%|Medium||
 |0584|Find Customer Referee||74.6%|Easy||
-|0585|Investments in 2016||57.6%|Medium||
+|0585|Investments in 2016||57.7%|Medium||
 |0586|Customer Placing the Largest Number of Orders||75.7%|Easy||
 |0587|Erect the Fence||36.6%|Hard||
 |0588|Design In-Memory File System||46.9%|Hard||
@@ -739,7 +739,7 @@
 |0598|Range Addition II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0598.Range-Addition-II)|50.5%|Easy||
 |0599|Minimum Index Sum of Two Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists)|52.3%|Easy||
 |0600|Non-negative Integers without Consecutive Ones||34.5%|Hard||
-|0601|Human Traffic of Stadium||46.6%|Hard||
+|0601|Human Traffic of Stadium||46.7%|Hard||
 |0602|Friend Requests II: Who Has the Most Friends||58.6%|Medium||
 |0603|Consecutive Available Seats||66.7%|Easy||
 |0604|Design Compressed String Iterator||38.5%|Easy||
@@ -767,15 +767,15 @@
 |0626|Exchange Seats||67.0%|Medium||
 |0627|Swap Salary||78.7%|Easy||
 |0628|Maximum Product of Three Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)|46.7%|Easy||
-|0629|K Inverse Pairs Array||33.8%|Hard||
+|0629|K Inverse Pairs Array||36.1%|Hard||
 |0630|Course Schedule III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0630.Course-Schedule-III)|34.9%|Hard||
-|0631|Design Excel Sum Formula||33.1%|Hard||
+|0631|Design Excel Sum Formula||33.2%|Hard||
 |0632|Smallest Range Covering Elements from K Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists)|55.2%|Hard||
 |0633|Sum of Square Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0633.Sum-of-Square-Numbers)|32.9%|Medium||
 |0634|Find the Derangement of An Array||40.6%|Medium||
 |0635|Design Log Storage System||60.6%|Medium||
-|0636|Exclusive Time of Functions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions)|55.9%|Medium||
-|0637|Average of Levels in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree)|66.5%|Easy||
+|0636|Exclusive Time of Functions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions)|56.0%|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.6%|Easy||
 |0638|Shopping Offers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers)|53.7%|Medium||
 |0639|Decode Ways II||27.7%|Hard||
 |0640|Solve the Equation||42.9%|Medium||
@@ -786,7 +786,7 @@
 |0645|Set Mismatch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0645.Set-Mismatch)|40.9%|Easy||
 |0646|Maximum Length of Pair Chain||53.8%|Medium||
 |0647|Palindromic Substrings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0647.Palindromic-Substrings)|63.0%|Medium||
-|0648|Replace Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words)|59.7%|Medium||
+|0648|Replace Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words)|59.8%|Medium||
 |0649|Dota2 Senate||39.5%|Medium||
 |0650|2 Keys Keyboard||50.7%|Medium||
 |0651|4 Keys Keyboard||53.3%|Medium||
@@ -796,7 +796,7 @@
 |0655|Print Binary Tree||56.8%|Medium||
 |0656|Coin Path||30.0%|Hard||
 |0657|Robot Return to Origin||74.3%|Easy||
-|0658|Find K Closest Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements)|42.7%|Medium||
+|0658|Find K Closest Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements)|42.8%|Medium||
 |0659|Split Array into Consecutive Subsequences||44.7%|Medium||
 |0660|Remove 9||54.5%|Hard||
 |0661|Image Smoother|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0661.Image-Smoother)|52.6%|Easy||
@@ -828,7 +828,7 @@
 |0687|Longest Univalue Path||37.9%|Medium||
 |0688|Knight Probability in Chessboard||50.6%|Medium||
 |0689|Maximum Sum of 3 Non-Overlapping Subarrays||47.6%|Hard||
-|0690|Employee Importance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0690.Employee-Importance)|59.7%|Easy||
+|0690|Employee Importance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0690.Employee-Importance)|59.8%|Easy||
 |0691|Stickers to Spell Word||45.8%|Hard||
 |0692|Top K Frequent Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0692.Top-K-Frequent-Words)|53.5%|Medium||
 |0693|Binary Number with Alternating Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits)|60.2%|Easy||
@@ -838,7 +838,7 @@
 |0697|Degree of an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0697.Degree-of-an-Array)|54.7%|Easy||
 |0698|Partition to K Equal Sum Subsets||45.0%|Medium||
 |0699|Falling Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares)|43.4%|Hard||
-|0700|Search in a Binary Search Tree||73.7%|Easy||
+|0700|Search in a Binary Search Tree||73.6%|Easy||
 |0701|Insert into a Binary Search Tree||75.1%|Medium||
 |0702|Search in a Sorted Array of Unknown Size||69.4%|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)|51.3%|Easy||
@@ -870,7 +870,7 @@
 |0729|My Calendar I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0729.My-Calendar-I)|54.1%|Medium||
 |0730|Count Different Palindromic Subsequences||43.5%|Hard||
 |0731|My Calendar II||51.5%|Medium||
-|0732|My Calendar III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III)|63.4%|Hard||
+|0732|My Calendar III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III)|63.5%|Hard||
 |0733|Flood Fill|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill)|56.1%|Easy||
 |0734|Sentence Similarity||42.5%|Easy||
 |0735|Asteroid Collision|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision)|43.5%|Medium||
@@ -889,7 +889,7 @@
 |0748|Shortest Completing Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word)|57.9%|Easy||
 |0749|Contain Virus||48.9%|Hard||
 |0750|Number Of Corner Rectangles||67.3%|Medium||
-|0751|IP to CIDR||58.3%|Medium||
+|0751|IP to CIDR||58.2%|Medium||
 |0752|Open the Lock||54.7%|Medium||
 |0753|Cracking the Safe|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0753.Cracking-the-Safe)|52.9%|Hard||
 |0754|Reach a Number||40.6%|Medium||
@@ -913,7 +913,7 @@
 |0772|Basic Calculator III||44.9%|Hard||
 |0773|Sliding Puzzle||61.6%|Hard||
 |0774|Minimize Max Distance to Gas Station||48.9%|Hard||
-|0775|Global and Local Inversions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0775.Global-and-Local-Inversions)|46.0%|Medium||
+|0775|Global and Local Inversions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0775.Global-and-Local-Inversions)|46.1%|Medium||
 |0776|Split BST||56.9%|Medium||
 |0777|Swap Adjacent in LR String||35.7%|Medium||
 |0778|Swim in Rising Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water)|55.3%|Hard||
@@ -948,7 +948,7 @@
 |0807|Max Increase to Keep City Skyline||84.6%|Medium||
 |0808|Soup Servings||41.5%|Medium||
 |0809|Expressive Words||46.2%|Medium||
-|0810|Chalkboard XOR Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0810.Chalkboard-XOR-Game)|51.0%|Hard||
+|0810|Chalkboard XOR Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0810.Chalkboard-XOR-Game)|50.9%|Hard||
 |0811|Subdomain Visit Count|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count)|72.2%|Easy||
 |0812|Largest Triangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0812.Largest-Triangle-Area)|59.2%|Easy||
 |0813|Largest Sum of Averages||51.5%|Medium||
@@ -966,7 +966,7 @@
 |0825|Friends Of Appropriate Ages||44.5%|Medium||
 |0826|Most Profit Assigning Work|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work)|39.5%|Medium||
 |0827|Making A Large Island||46.8%|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||
+|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.7%|Hard||
 |0829|Consecutive Numbers Sum||39.4%|Hard||
 |0830|Positions of Large Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0830.Positions-of-Large-Groups)|50.7%|Easy||
 |0831|Masking Personal Information||44.9%|Medium||
@@ -983,7 +983,7 @@
 |0842|Split Array into Fibonacci Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)|37.1%|Medium||
 |0843|Guess the Word||45.7%|Hard||
 |0844|Backspace String Compare|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare)|47.2%|Easy||
-|0845|Longest Mountain in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array)|38.9%|Medium||
+|0845|Longest Mountain in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array)|38.8%|Medium||
 |0846|Hand of Straights||55.7%|Medium||
 |0847|Shortest Path Visiting All Nodes||54.7%|Hard||
 |0848|Shifting Letters||45.2%|Medium||
@@ -1001,7 +1001,7 @@
 |0860|Lemonade Change||52.0%|Easy||
 |0861|Score After Flipping Matrix||74.0%|Medium||
 |0862|Shortest Subarray with Sum at Least K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K)|25.3%|Hard||
-|0863|All Nodes Distance K in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree)|58.6%|Medium||
+|0863|All Nodes Distance K in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree)|58.7%|Medium||
 |0864|Shortest Path to Get All Keys|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys)|42.8%|Hard||
 |0865|Smallest Subtree with all the Deepest Nodes||65.6%|Medium||
 |0866|Prime Palindrome||25.0%|Medium||
@@ -1016,7 +1016,7 @@
 |0875|Koko Eating Bananas|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0875.Koko-Eating-Bananas)|53.7%|Medium||
 |0876|Middle of the Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List)|69.4%|Easy||
 |0877|Stone Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0877.Stone-Game)|67.6%|Medium||
-|0878|Nth Magical Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number)|29.0%|Hard||
+|0878|Nth Magical Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number)|29.1%|Hard||
 |0879|Profitable Schemes||40.2%|Hard||
 |0880|Decoded String at Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0880.Decoded-String-at-Index)|28.2%|Medium||
 |0881|Boats to Save People|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People)|49.2%|Medium||
@@ -1025,7 +1025,7 @@
 |0884|Uncommon Words from Two Sentences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences)|64.4%|Easy||
 |0885|Spiral Matrix III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III)|71.3%|Medium||
 |0886|Possible Bipartition||45.7%|Medium||
-|0887|Super Egg Drop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop)|26.9%|Hard||
+|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.3%|Easy||
 |0889|Construct Binary Tree from Preorder and Postorder Traversal||68.2%|Medium||
 |0890|Find and Replace Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0890.Find-and-Replace-Pattern)|75.5%|Medium||
@@ -1047,13 +1047,13 @@
 |0906|Super Palindromes||38.8%|Hard||
 |0907|Sum of Subarray Minimums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums)|32.9%|Medium||
 |0908|Smallest Range I||66.5%|Easy||
-|0909|Snakes and Ladders||39.3%|Medium||
+|0909|Snakes and Ladders||39.4%|Medium||
 |0910|Smallest Range II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0910.Smallest-Range-II)|31.3%|Medium||
 |0911|Online Election|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election)|51.7%|Medium||
 |0912|Sort an Array||63.8%|Medium||
 |0913|Cat and Mouse||35.0%|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)|33.7%|Easy||
-|0915|Partition Array into Disjoint Intervals||47.0%|Medium||
+|0915|Partition Array into Disjoint Intervals||47.1%|Medium||
 |0916|Word Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0916.Word-Subsets)|52.7%|Medium||
 |0917|Reverse Only Letters||59.5%|Easy||
 |0918|Maximum Sum Circular Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0918.Maximum-Sum-Circular-Subarray)|34.6%|Medium||
@@ -1069,7 +1069,7 @@
 |0928|Minimize Malware Spread II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II)|41.5%|Hard||
 |0929|Unique Email Addresses||67.2%|Easy||
 |0930|Binary Subarrays With Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum)|45.6%|Medium||
-|0931|Minimum Falling Path Sum||64.4%|Medium||
+|0931|Minimum Falling Path Sum||64.5%|Medium||
 |0932|Beautiful Array||61.6%|Medium||
 |0933|Number of Recent Calls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0933.Number-of-Recent-Calls)|72.6%|Easy||
 |0934|Shortest Bridge||50.6%|Medium||
@@ -1087,7 +1087,7 @@
 |0946|Validate Stack Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences)|64.5%|Medium||
 |0947|Most Stones Removed with Same Row or Column|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column)|55.9%|Medium||
 |0948|Bag of Tokens||46.1%|Medium||
-|0949|Largest Time for Given Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0949.Largest-Time-for-Given-Digits)|36.0%|Medium||
+|0949|Largest Time for Given Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0949.Largest-Time-for-Given-Digits)|36.1%|Medium||
 |0950|Reveal Cards In Increasing Order||75.8%|Medium||
 |0951|Flip Equivalent Binary Trees||66.0%|Medium||
 |0952|Largest Component Size by Common Factor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor)|36.5%|Hard||
@@ -1102,7 +1102,7 @@
 |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.9%|Easy||
 |0962|Maximum Width Ramp||46.8%|Medium||
 |0963|Minimum Area Rectangle II||52.6%|Medium||
-|0964|Least Operators to Express Number||45.4%|Hard||
+|0964|Least Operators to Express Number||45.3%|Hard||
 |0965|Univalued Binary Tree||68.0%|Easy||
 |0966|Vowel Spellchecker|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0966.Vowel-Spellchecker)|51.8%|Medium||
 |0967|Numbers With Same Consecutive Differences||45.8%|Medium||
@@ -1160,7 +1160,7 @@
 |1019|Next Greater Node In Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List)|58.4%|Medium||
 |1020|Number of Enclaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1020.Number-of-Enclaves)|59.7%|Medium||
 |1021|Remove Outermost Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses)|79.3%|Easy||
-|1022|Sum of Root To Leaf Binary Numbers||71.8%|Easy||
+|1022|Sum of Root To Leaf Binary Numbers||71.9%|Easy||
 |1023|Camelcase Matching||57.8%|Medium||
 |1024|Video Stitching||49.0%|Medium||
 |1025|Divisor Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game)|66.2%|Easy||
@@ -1168,13 +1168,13 @@
 |1027|Longest Arithmetic Subsequence||49.2%|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)|71.3%|Hard||
 |1029|Two City Scheduling||58.5%|Medium||
-|1030|Matrix Cells in Distance Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order)|68.6%|Easy||
+|1030|Matrix Cells in Distance Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order)|68.5%|Easy||
 |1031|Maximum Sum of Two Non-Overlapping Subarrays||59.0%|Medium||
 |1032|Stream of Characters||48.7%|Hard||
 |1033|Moving Stones Until Consecutive||43.7%|Easy||
 |1034|Coloring A Border||46.0%|Medium||
 |1035|Uncrossed Lines||56.4%|Medium||
-|1036|Escape a Large Maze||34.2%|Hard||
+|1036|Escape a Large Maze||34.3%|Hard||
 |1037|Valid Boomerang|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1037.Valid-Boomerang)|37.4%|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)|83.1%|Medium||
 |1039|Minimum Score Triangulation of Polygon||50.9%|Medium||
@@ -1185,7 +1185,7 @@
 |1044|Longest Duplicate Substring||31.0%|Hard||
 |1045|Customers Who Bought All Products||67.8%|Medium||
 |1046|Last Stone Weight||62.5%|Easy||
-|1047|Remove All Adjacent Duplicates In String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String)|71.7%|Easy||
+|1047|Remove All Adjacent Duplicates In String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String)|71.6%|Easy||
 |1048|Longest String Chain|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1048.Longest-String-Chain)|56.2%|Medium||
 |1049|Last Stone Weight II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II)|47.3%|Medium||
 |1050|Actors and Directors Who Cooperated At Least Three Times||72.3%|Easy||
@@ -1211,7 +1211,7 @@
 |1070|Product Sales Analysis III||50.1%|Medium||
 |1071|Greatest Common Divisor of Strings||51.8%|Easy||
 |1072|Flip Columns For Maximum Number of Equal Rows||62.0%|Medium||
-|1073|Adding Two Negabinary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers)|34.7%|Medium||
+|1073|Adding Two Negabinary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers)|34.8%|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)|65.2%|Hard||
 |1075|Project Employees I||66.5%|Easy||
 |1076|Project Employees II||52.5%|Easy||
@@ -1220,11 +1220,11 @@
 |1079|Letter Tile Possibilities|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities)|76.1%|Medium||
 |1080|Insufficient Nodes in Root to Leaf Paths||50.4%|Medium||
 |1081|Smallest Subsequence of Distinct Characters||53.8%|Medium||
-|1082|Sales Analysis I||74.3%|Easy||
+|1082|Sales Analysis I||74.4%|Easy||
 |1083|Sales Analysis II||50.9%|Easy||
 |1084|Sales Analysis III||54.5%|Easy||
 |1085|Sum of Digits in the Minimum Number||75.4%|Easy||
-|1086|High Five||76.7%|Easy||
+|1086|High Five||76.6%|Easy||
 |1087|Brace Expansion||63.4%|Medium||
 |1088|Confusing Number II||46.0%|Hard||
 |1089|Duplicate Zeros|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1089.Duplicate-Zeros)|51.5%|Easy||
@@ -1245,10 +1245,10 @@
 |1104|Path In Zigzag Labelled Binary Tree||73.7%|Medium||
 |1105|Filling Bookcase Shelves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1105.Filling-Bookcase-Shelves)|57.6%|Medium||
 |1106|Parsing A Boolean Expression||59.5%|Hard||
-|1107|New Users Daily Count||46.0%|Medium||
+|1107|New Users Daily Count||45.9%|Medium||
 |1108|Defanging an IP Address|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1108.Defanging-an-IP-Address)|88.5%|Easy||
 |1109|Corporate Flight Bookings||54.5%|Medium||
-|1110|Delete Nodes And Return Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1110.Delete-Nodes-And-Return-Forest)|68.1%|Medium||
+|1110|Delete Nodes And Return Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1110.Delete-Nodes-And-Return-Forest)|68.2%|Medium||
 |1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings)|72.8%|Medium||
 |1112|Highest Grade For Each Student||72.7%|Medium||
 |1113|Reported Posts||66.3%|Easy||
@@ -1265,17 +1265,17 @@
 |1124|Longest Well-Performing Interval||33.4%|Medium||
 |1125|Smallest Sufficient Team||47.2%|Hard||
 |1126|Active Businesses||68.4%|Medium||
-|1127|User Purchase Platform||50.8%|Hard||
+|1127|User Purchase Platform||50.9%|Hard||
 |1128|Number of Equivalent Domino Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1128.Number-of-Equivalent-Domino-Pairs)|46.0%|Easy||
 |1129|Shortest Path with Alternating Colors||40.6%|Medium||
 |1130|Minimum Cost Tree From Leaf Values||67.5%|Medium||
 |1131|Maximum of Absolute Value Expression||51.4%|Medium||
 |1132|Reported Posts II||34.4%|Medium||
 |1133|Largest Unique Number||67.2%|Easy||
-|1134|Armstrong Number||77.7%|Easy||
+|1134|Armstrong Number||77.8%|Easy||
 |1135|Connecting Cities With Minimum Cost||60.0%|Medium||
-|1136|Parallel Courses||60.7%|Medium||
-|1137|N-th Tribonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number)|55.5%|Easy||
+|1136|Parallel Courses||60.6%|Medium||
+|1137|N-th Tribonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number)|55.6%|Easy||
 |1138|Alphabet Board Path||51.6%|Medium||
 |1139|Largest 1-Bordered Square||48.7%|Medium||
 |1140|Stone Game II||64.6%|Medium||
@@ -1283,7 +1283,7 @@
 |1142|User Activity for the Past 30 Days II||35.4%|Easy||
 |1143|Longest Common Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1143.Longest-Common-Subsequence)|58.8%|Medium||
 |1144|Decrease Elements To Make Array Zigzag||46.5%|Medium||
-|1145|Binary Tree Coloring Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game)|51.1%|Medium||
+|1145|Binary Tree Coloring Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game)|51.2%|Medium||
 |1146|Snapshot Array||37.0%|Medium||
 |1147|Longest Chunked Palindrome Decomposition||59.7%|Hard||
 |1148|Article Views I||77.1%|Easy||
@@ -1295,7 +1295,7 @@
 |1154|Day of the Year|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year)|49.6%|Easy||
 |1155|Number of Dice Rolls With Target Sum||47.7%|Medium||
 |1156|Swap For Longest Repeated Character Substring||47.2%|Medium||
-|1157|Online Majority Element In Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray)|41.1%|Hard||
+|1157|Online Majority Element In Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray)|41.2%|Hard||
 |1158|Market Analysis I||64.5%|Medium||
 |1159|Market Analysis II||56.7%|Hard||
 |1160|Find Words That Can Be Formed by Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters)|67.9%|Easy||
@@ -1320,14 +1320,14 @@
 |1179|Reformat Department Table||82.1%|Easy||
 |1180|Count Substrings with Only One Distinct Letter||78.0%|Easy||
 |1181|Before and After Puzzle||44.6%|Medium||
-|1182|Shortest Distance to Target Color||54.3%|Medium||
+|1182|Shortest Distance to Target Color||54.2%|Medium||
 |1183|Maximum Number of Ones||58.4%|Hard||
 |1184|Distance Between Bus Stops|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1184.Distance-Between-Bus-Stops)|53.9%|Easy||
 |1185|Day of the Week|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week)|60.5%|Easy||
 |1186|Maximum Subarray Sum with One Deletion||39.5%|Medium||
 |1187|Make Array Strictly Increasing||43.0%|Hard||
 |1188|Design Bounded Blocking Queue||73.2%|Medium||
-|1189|Maximum Number of Balloons|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons)|62.1%|Easy||
+|1189|Maximum Number of Balloons|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons)|62.0%|Easy||
 |1190|Reverse Substrings Between Each Pair of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses)|64.6%|Medium||
 |1191|K-Concatenation Maximum Sum||24.7%|Medium||
 |1192|Critical Connections in a Network||51.6%|Hard||
@@ -1339,26 +1339,26 @@
 |1198|Find Smallest Common Element in All Rows||76.3%|Medium||
 |1199|Minimum Time to Build Blocks||39.0%|Hard||
 |1200|Minimum Absolute Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1200.Minimum-Absolute-Difference)|67.1%|Easy||
-|1201|Ugly Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III)|26.6%|Medium||
+|1201|Ugly Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III)|26.7%|Medium||
 |1202|Smallest String With Swaps|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1202.Smallest-String-With-Swaps)|49.5%|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||
 |1205|Monthly Transactions II||45.5%|Medium||
 |1206|Design Skiplist||59.1%|Hard||
-|1207|Unique Number of Occurrences||72.2%|Easy||
-|1208|Get Equal Substrings Within Budget||44.7%|Medium||
-|1209|Remove All Adjacent Duplicates in String II||57.1%|Medium||
+|1207|Unique Number of Occurrences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences)|72.2%|Easy||
+|1208|Get Equal Substrings Within Budget|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1208.Get-Equal-Substrings-Within-Budget)|44.7%|Medium||
+|1209|Remove All Adjacent Duplicates in String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1209.Remove-All-Adjacent-Duplicates-in-String-II)|57.1%|Medium||
 |1210|Minimum Moves to Reach Target with Rotations||46.8%|Hard||
-|1211|Queries Quality and Percentage||70.4%|Easy||
-|1212|Team Scores in Football Tournament||56.7%|Medium||
+|1211|Queries Quality and Percentage||70.3%|Easy||
+|1212|Team Scores in Football Tournament||56.6%|Medium||
 |1213|Intersection of Three Sorted Arrays||79.6%|Easy||
 |1214|Two Sum BSTs||67.7%|Medium||
 |1215|Stepping Numbers||44.1%|Medium||
 |1216|Valid Palindrome III||50.3%|Hard||
-|1217|Minimum Cost to Move Chips to The Same Position||70.7%|Easy||
+|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)|70.7%|Easy||
 |1218|Longest Arithmetic Subsequence of Given Difference||47.5%|Medium||
 |1219|Path with Maximum Gold||66.1%|Medium||
 |1220|Count Vowels Permutation||54.2%|Hard||
-|1221|Split a String in Balanced Strings||84.4%|Easy||
+|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.4%|Easy||
 |1222|Queens That Can Attack the King||69.8%|Medium||
 |1223|Dice Roll Simulation||47.0%|Hard||
 |1224|Maximum Equal Frequency||35.7%|Hard||
@@ -1367,98 +1367,98 @@
 |1227|Airplane Seat Assignment Probability||62.6%|Medium||
 |1228|Missing Number In Arithmetic Progression||51.2%|Easy||
 |1229|Meeting Scheduler||54.7%|Medium||
-|1230|Toss Strange Coins||50.5%|Medium||
+|1230|Toss Strange Coins||50.4%|Medium||
 |1231|Divide Chocolate||53.8%|Hard||
-|1232|Check If It Is a Straight Line||42.8%|Easy||
+|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)|42.8%|Easy||
 |1233|Remove Sub-Folders from the Filesystem||63.1%|Medium||
-|1234|Replace the Substring for Balanced String||34.8%|Medium||
-|1235|Maximum Profit in Job Scheduling||48.2%|Hard||
+|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.8%|Medium||
+|1235|Maximum Profit in Job Scheduling|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1235.Maximum-Profit-in-Job-Scheduling)|48.2%|Hard||
 |1236|Web Crawler||64.9%|Medium||
 |1237|Find Positive Integer Solution for a Given Equation||70.4%|Medium||
 |1238|Circular Permutation in Binary Representation||67.0%|Medium||
-|1239|Maximum Length of a Concatenated String with Unique Characters||50.5%|Medium||
+|1239|Maximum Length of a Concatenated String with Unique Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters)|50.5%|Medium||
 |1240|Tiling a Rectangle with the Fewest Squares||52.8%|Hard||
 |1241|Number of Comments per Post||68.0%|Easy||
 |1242|Web Crawler Multithreaded||48.0%|Medium||
 |1243|Array Transformation||49.9%|Easy||
-|1244|Design A Leaderboard||66.9%|Medium||
+|1244|Design A Leaderboard||66.8%|Medium||
 |1245|Tree Diameter||61.6%|Medium||
 |1246|Palindrome Removal||45.8%|Hard||
-|1247|Minimum Swaps to Make Strings Equal||63.2%|Medium||
+|1247|Minimum Swaps to Make Strings Equal||63.1%|Medium||
 |1248|Count Number of Nice Subarrays||56.6%|Medium||
-|1249|Minimum Remove to Make Valid Parentheses||64.4%|Medium||
-|1250|Check If It Is a Good Array||56.9%|Hard||
+|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.4%|Medium||
+|1250|Check If It Is a Good Array||56.8%|Hard||
 |1251|Average Selling Price||83.1%|Easy||
-|1252|Cells with Odd Values in a Matrix||78.5%|Easy||
+|1252|Cells with Odd Values in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix)|78.5%|Easy||
 |1253|Reconstruct a 2-Row Binary Matrix||42.2%|Medium||
-|1254|Number of Closed Islands||62.2%|Medium||
+|1254|Number of Closed Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1254.Number-of-Closed-Islands)|62.2%|Medium||
 |1255|Maximum Score Words Formed by Letters||70.4%|Hard||
 |1256|Encode Number||68.3%|Medium||
 |1257|Smallest Common Region||61.5%|Medium||
 |1258|Synonymous Sentences||59.9%|Medium||
 |1259|Handshakes That Don't Cross||54.5%|Hard||
-|1260|Shift 2D Grid||61.9%|Easy||
-|1261|Find Elements in a Contaminated Binary Tree||75.0%|Medium||
+|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||75.1%|Medium||
 |1262|Greatest Sum Divisible by Three||50.2%|Medium||
 |1263|Minimum Moves to Move a Box to Their Target Location||45.7%|Hard||
-|1264|Page Recommendations||68.8%|Medium||
-|1265|Print Immutable Linked List in Reverse||94.2%|Medium||
-|1266|Minimum Time Visiting All Points||79.2%|Easy||
+|1264|Page Recommendations||68.9%|Medium||
+|1265|Print Immutable Linked List in Reverse||94.1%|Medium||
+|1266|Minimum Time Visiting All Points|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1266.Minimum-Time-Visiting-All-Points)|79.2%|Easy||
 |1267|Count Servers that Communicate||57.7%|Medium||
-|1268|Search Suggestions System||65.5%|Medium||
-|1269|Number of Ways to Stay in the Same Place After Some Steps||43.4%|Hard||
+|1268|Search Suggestions System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1268.Search-Suggestions-System)|65.5%|Medium||
+|1269|Number of Ways to Stay in the Same Place After Some Steps||43.3%|Hard||
 |1270|All People Report to the Given Manager||88.2%|Medium||
-|1271|Hexspeak||55.9%|Easy||
+|1271|Hexspeak||55.8%|Easy||
 |1272|Remove Interval||58.9%|Medium||
 |1273|Delete Tree Nodes||61.4%|Medium||
 |1274|Number of Ships in a Rectangle||66.0%|Hard||
-|1275|Find Winner on a Tic Tac Toe Game||53.0%|Easy||
+|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)|53.0%|Easy||
 |1276|Number of Burgers with No Waste of Ingredients||50.4%|Medium||
 |1277|Count Square Submatrices with All Ones||73.1%|Medium||
 |1278|Palindrome Partitioning III||61.4%|Hard||
 |1279|Traffic Light Controlled Intersection||76.2%|Easy||
 |1280|Students and Examinations||75.6%|Easy||
-|1281|Subtract the Product and Sum of Digits of an Integer||85.6%|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.6%|Medium||
-|1283|Find the Smallest Divisor Given a Threshold||50.6%|Medium||
+|1283|Find the Smallest Divisor Given a Threshold|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold)|50.6%|Medium||
 |1284|Minimum Number of Flips to Convert Binary Matrix to Zero Matrix||70.3%|Hard||
-|1285|Find the Start and End Number of Continuous Ranges||87.6%|Medium||
-|1286|Iterator for Combination||71.0%|Medium||
-|1287|Element Appearing More Than 25% In Sorted Array||60.0%|Easy||
+|1285|Find the Start and End Number of Continuous Ranges||87.7%|Medium||
+|1286|Iterator for Combination||71.1%|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.0%|Easy||
 |1288|Remove Covered Intervals||57.6%|Medium||
-|1289|Minimum Falling Path Sum II||62.9%|Hard||
-|1290|Convert Binary Number in a Linked List to Integer||81.7%|Easy||
+|1289|Minimum Falling Path Sum II||63.0%|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.7%|Easy||
 |1291|Sequential Digits||57.5%|Medium||
 |1292|Maximum Side Length of a Square with Sum Less than or Equal to Threshold||51.3%|Medium||
 |1293|Shortest Path in a Grid with Obstacles Elimination||43.3%|Hard||
-|1294|Weather Type in Each Country||67.0%|Easy||
-|1295|Find Numbers with Even Number of Digits||78.3%|Easy||
+|1294|Weather Type in Each Country||67.1%|Easy||
+|1295|Find Numbers with Even Number of Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits)|78.3%|Easy||
 |1296|Divide Array in Sets of K Consecutive Numbers||55.8%|Medium||
 |1297|Maximum Number of Occurrences of a Substring||51.3%|Medium||
 |1298|Maximum Candies You Can Get from Boxes||60.1%|Hard||
-|1299|Replace Elements with Greatest Element on Right Side||74.5%|Easy||
-|1300|Sum of Mutated Array Closest to Target||42.6%|Medium||
+|1299|Replace Elements with Greatest Element on Right Side|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side)|74.5%|Easy||
+|1300|Sum of Mutated Array Closest to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target)|42.6%|Medium||
 |1301|Number of Paths with Max Score||38.2%|Hard||
-|1302|Deepest Leaves Sum||85.4%|Medium||
+|1302|Deepest Leaves Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1302.Deepest-Leaves-Sum)|85.4%|Medium||
 |1303|Find the Team Size||90.0%|Easy||
-|1304|Find N Unique Integers Sum up to Zero||76.5%|Easy||
-|1305|All Elements in Two Binary Search Trees||77.9%|Medium||
-|1306|Jump Game III||61.8%|Medium||
+|1304|Find N Unique Integers Sum up to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero)|76.5%|Easy||
+|1305|All Elements in Two Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees)|77.9%|Medium||
+|1306|Jump Game III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1306.Jump-Game-III)|61.8%|Medium||
 |1307|Verbal Arithmetic Puzzle||35.9%|Hard||
 |1308|Running Total for Different Genders||88.2%|Medium||
 |1309|Decrypt String from Alphabet to Integer Mapping||77.8%|Easy||
-|1310|XOR Queries of a Subarray||69.8%|Medium||
+|1310|XOR Queries of a Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1310.XOR-Queries-of-a-Subarray)|69.8%|Medium||
 |1311|Get Watched Videos by Your Friends||44.4%|Medium||
 |1312|Minimum Insertion Steps to Make a String Palindrome||60.7%|Hard||
-|1313|Decompress Run-Length Encoded List||85.5%|Easy||
+|1313|Decompress Run-Length Encoded List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1313.Decompress-Run-Length-Encoded-List)|85.5%|Easy||
 |1314|Matrix Block Sum||73.9%|Medium||
 |1315|Sum of Nodes with Even-Valued Grandparent||84.5%|Medium||
 |1316|Distinct Echo Substrings||49.5%|Hard||
-|1317|Convert Integer to the Sum of Two No-Zero Integers||57.1%|Easy||
-|1318|Minimum Flips to Make a OR b Equal to c||64.1%|Medium||
-|1319|Number of Operations to Make Network Connected||55.6%|Medium||
+|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)|57.1%|Easy||
+|1318|Minimum Flips to Make a OR b Equal to c||64.2%|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.6%|Medium||
 |1320|Minimum Distance to Type a Word Using Two Fingers||61.6%|Hard||
-|1321|Restaurant Growth||72.3%|Medium||
+|1321|Restaurant Growth||72.2%|Medium||
 |1322|Ads Performance||58.6%|Easy||
 |1323|Maximum 69 Number||78.0%|Easy||
 |1324|Print Words Vertically||58.9%|Medium||
@@ -1466,31 +1466,31 @@
 |1326|Minimum Number of Taps to Open to Water a Garden||47.5%|Hard||
 |1327|List the Products Ordered in a Period||77.9%|Easy||
 |1328|Break a Palindrome||49.0%|Medium||
-|1329|Sort the Matrix Diagonally||81.4%|Medium||
+|1329|Sort the Matrix Diagonally|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1329.Sort-the-Matrix-Diagonally)|81.4%|Medium||
 |1330|Reverse Subarray To Maximize Array Value||37.2%|Hard||
-|1331|Rank Transform of an Array||57.2%|Easy||
-|1332|Remove Palindromic Subsequences||68.6%|Easy||
+|1331|Rank Transform of an Array||57.3%|Easy||
+|1332|Remove Palindromic Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1332.Remove-Palindromic-Subsequences)|68.6%|Easy||
 |1333|Filter Restaurants by Vegan-Friendly, Price and Distance||57.8%|Medium||
 |1334|Find the City With the Smallest Number of Neighbors at a Threshold Distance||48.1%|Medium||
 |1335|Minimum Difficulty of a Job Schedule||56.5%|Hard||
 |1336|Number of Transactions per Visit||50.2%|Hard||
-|1337|The K Weakest Rows in a Matrix||72.0%|Easy||
+|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.6%|Medium||
 |1339|Maximum Product of Splitted Binary Tree||38.6%|Medium||
 |1340|Jump Game V||60.2%|Hard||
 |1341|Movie Rating||59.1%|Medium||
 |1342|Number of Steps to Reduce a Number to Zero||85.6%|Easy||
-|1343|Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold||65.4%|Medium||
-|1344|Angle Between Hands of a Clock||61.5%|Medium||
+|1343|Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold||65.5%|Medium||
+|1344|Angle Between Hands of a Clock||61.4%|Medium||
 |1345|Jump Game IV||42.2%|Hard||
 |1346|Check If N and Its Double Exist||35.7%|Easy||
 |1347|Minimum Number of Steps to Make Two Strings Anagram||75.0%|Medium||
 |1348|Tweet Counts Per Frequency||39.2%|Medium||
 |1349|Maximum Students Taking Exam||44.9%|Hard||
-|1350|Students With Invalid Departments||90.4%|Easy||
+|1350|Students With Invalid Departments||90.3%|Easy||
 |1351|Count Negative Numbers in a Sorted Matrix||75.6%|Easy||
 |1352|Product of the Last K Numbers||45.8%|Medium||
-|1353|Maximum Number of Events That Can Be Attended||30.6%|Medium||
+|1353|Maximum Number of Events That Can Be Attended|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1353.Maximum-Number-of-Events-That-Can-Be-Attended)|30.6%|Medium||
 |1354|Construct Target Array With Multiple Sums||31.4%|Hard||
 |1355|Activity Participants||74.7%|Medium||
 |1356|Sort Integers by The Number of 1 Bits||70.6%|Easy||
@@ -1501,7 +1501,7 @@
 |1361|Validate Binary Tree Nodes||42.8%|Medium||
 |1362|Closest Divisors||58.3%|Medium||
 |1363|Largest Multiple of Three||34.4%|Hard||
-|1364|Number of Trusted Contacts of a Customer||79.3%|Medium||
+|1364|Number of Trusted Contacts of a Customer||79.2%|Medium||
 |1365|How Many Numbers Are Smaller Than the Current Number||85.9%|Easy||
 |1366|Rank Teams by Votes||55.9%|Medium||
 |1367|Linked List in Binary Tree||41.2%|Medium||
@@ -1509,7 +1509,7 @@
 |1369|Get the Second Most Recent Activity||68.9%|Hard||
 |1370|Increasing Decreasing String||77.6%|Easy||
 |1371|Find the Longest Substring Containing Vowels in Even Counts||60.6%|Medium||
-|1372|Longest ZigZag Path in a Binary Tree||55.5%|Medium||
+|1372|Longest ZigZag Path in a Binary Tree||55.6%|Medium||
 |1373|Maximum Sum BST in Binary Tree||37.1%|Hard||
 |1374|Generate a String With Characters That Have Odd Counts||76.9%|Easy||
 |1375|Bulb Switcher III||64.3%|Medium||
@@ -1517,23 +1517,23 @@
 |1377|Frog Position After T Seconds||35.8%|Hard||
 |1378|Replace Employee ID With The Unique Identifier||90.6%|Easy||
 |1379|Find a Corresponding Node of a Binary Tree in a Clone of That Tree||84.8%|Medium||
-|1380|Lucky Numbers in a Matrix||70.3%|Easy||
+|1380|Lucky Numbers in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1380.Lucky-Numbers-in-a-Matrix)|70.3%|Easy||
 |1381|Design a Stack With Increment Operation||76.6%|Medium||
-|1382|Balance a Binary Search Tree||76.9%|Medium||
-|1383|Maximum Performance of a Team||41.2%|Hard||
+|1382|Balance a Binary Search Tree||77.0%|Medium||
+|1383|Maximum Performance of a Team|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1383.Maximum-Performance-of-a-Team)|41.3%|Hard||
 |1384|Total Sales Amount by Year||65.2%|Hard||
-|1385|Find the Distance Value Between Two Arrays||66.6%|Easy||
+|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.6%|Easy||
 |1386|Cinema Seat Allocation||36.9%|Medium||
 |1387|Sort Integers by The Power Value||70.7%|Medium||
 |1388|Pizza With 3n Slices||46.7%|Hard||
-|1389|Create Target Array in the Given Order||85.1%|Easy||
+|1389|Create Target Array in the Given Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1389.Create-Target-Array-in-the-Given-Order)|85.1%|Easy||
 |1390|Four Divisors||39.8%|Medium||
 |1391|Check if There is a Valid Path in a Grid||45.5%|Medium||
 |1392|Longest Happy Prefix||42.8%|Hard||
 |1393|Capital Gain/Loss||91.2%|Medium||
 |1394|Find Lucky Integer in an Array||63.1%|Easy||
 |1395|Count Number of Teams||72.7%|Medium||
-|1396|Design Underground System||71.8%|Medium||
+|1396|Design Underground System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1396.Design-Underground-System)|71.8%|Medium||
 |1397|Find All Good Strings||39.2%|Hard||
 |1398|Customers Who Bought Products A and B but Not C||82.0%|Medium||
 |1399|Count Largest Group||65.4%|Easy||
@@ -1546,10 +1546,10 @@
 |1406|Stone Game III||58.9%|Hard||
 |1407|Top Travellers||84.1%|Easy||
 |1408|String Matching in an Array||63.7%|Easy||
-|1409|Queries on a Permutation With Key||82.0%|Medium||
+|1409|Queries on a Permutation With Key||82.1%|Medium||
 |1410|HTML Entity Parser||53.6%|Medium||
 |1411|Number of Ways to Paint N × 3 Grid||60.7%|Hard||
-|1412|Find the Quiet Students in All Exams||63.5%|Hard||
+|1412|Find the Quiet Students in All Exams||63.4%|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.0%|Medium||
 |1415|The k-th Lexicographical String of All Happy Strings of Length n||70.2%|Medium||
@@ -1560,7 +1560,7 @@
 |1420|Build Array Where You Can Find The Maximum Exactly K Comparisons||64.2%|Hard||
 |1421|NPV Queries||82.2%|Medium||
 |1422|Maximum Score After Splitting a String||57.6%|Easy||
-|1423|Maximum Points You Can Obtain from Cards||48.5%|Medium||
+|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)|48.5%|Medium||
 |1424|Diagonal Traverse II||46.9%|Medium||
 |1425|Constrained Subsequence Sum||45.1%|Hard||
 |1426|Counting Elements||59.2%|Easy||
@@ -1574,15 +1574,15 @@
 |1434|Number of Ways to Wear Different Hats to Each Other||40.1%|Hard||
 |1435|Create a Session Bar Chart||78.6%|Easy||
 |1436|Destination City||77.2%|Easy||
-|1437|Check If All 1's Are at Least Length K Places Away||61.1%|Easy||
-|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit||44.7%|Medium||
-|1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows||61.1%|Hard||
+|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)|61.1%|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.7%|Medium||
+|1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows)|61.1%|Hard||
 |1440|Evaluate Boolean Expression||75.1%|Medium||
 |1441|Build an Array With Stack Operations||70.4%|Easy||
-|1442|Count Triplets That Can Form Two Arrays of Equal XOR||72.8%|Medium||
+|1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR)|72.8%|Medium||
 |1443|Minimum Time to Collect All Apples in a Tree||54.6%|Medium||
 |1444|Number of Ways of Cutting a Pizza||54.2%|Hard||
-|1445|Apples & Oranges||91.2%|Medium||
+|1445|Apples & Oranges||91.3%|Medium||
 |1446|Consecutive Characters||61.2%|Easy||
 |1447|Simplified Fractions||62.6%|Medium||
 |1448|Count Good Nodes in Binary Tree||72.1%|Medium||
@@ -1592,38 +1592,38 @@
 |1452|People Whose List of Favorite Companies Is Not a Subset of Another List||55.5%|Medium||
 |1453|Maximum Number of Darts Inside of a Circular Dartboard||36.0%|Hard||
 |1454|Active Users||38.7%|Medium||
-|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence||64.8%|Easy||
+|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.8%|Easy||
 |1456|Maximum Number of Vowels in a Substring of Given Length||55.6%|Medium||
 |1457|Pseudo-Palindromic Paths in a Binary Tree||69.1%|Medium||
 |1458|Max Dot Product of Two Subsequences||43.7%|Hard||
-|1459|Rectangles Area||66.2%|Medium||
+|1459|Rectangles Area||66.1%|Medium||
 |1460|Make Two Arrays Equal by Reversing Sub-arrays||72.3%|Easy||
-|1461|Check If a String Contains All Binary Codes of Size K||54.2%|Medium||
+|1461|Check If a String Contains All Binary Codes of Size K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K)|54.2%|Medium||
 |1462|Course Schedule IV||46.1%|Medium||
-|1463|Cherry Pickup II||68.6%|Hard||
-|1464|Maximum Product of Two Elements in an Array||76.9%|Easy||
-|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts||36.8%|Medium||
+|1463|Cherry Pickup II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1463.Cherry-Pickup-II)|68.6%|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)|76.9%|Easy||
+|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts)|36.8%|Medium||
 |1466|Reorder Routes to Make All Paths Lead to the City Zero||62.0%|Medium||
-|1467|Probability of a Two Boxes Having The Same Number of Distinct Balls||60.6%|Hard||
+|1467|Probability of a Two Boxes Having The Same Number of Distinct Balls||60.7%|Hard||
 |1468|Calculate Salaries||82.5%|Medium||
 |1469|Find All The Lonely Nodes||80.7%|Easy||
-|1470|Shuffle the Array||88.1%|Easy||
+|1470|Shuffle the Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1470.Shuffle-the-Array)|88.1%|Easy||
 |1471|The k Strongest Values in an Array||58.9%|Medium||
 |1472|Design Browser History||72.6%|Medium||
-|1473|Paint House III||49.0%|Hard||
+|1473|Paint House III||49.1%|Hard||
 |1474|Delete N Nodes After M Nodes of a Linked List||73.5%|Easy||
 |1475|Final Prices With a Special Discount in a Shop||74.8%|Easy||
 |1476|Subrectangle Queries||87.9%|Medium||
 |1477|Find Two Non-overlapping Sub-arrays Each With Target Sum||35.5%|Medium||
 |1478|Allocate Mailboxes||54.1%|Hard||
 |1479|Sales by Day of the Week||83.0%|Hard||
-|1480|Running Sum of 1d Array||88.8%|Easy||
+|1480|Running Sum of 1d Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1480.Running-Sum-of-1d-Array)|88.8%|Easy||
 |1481|Least Number of Unique Integers after K Removals||56.1%|Medium||
-|1482|Minimum Number of Days to Make m Bouquets||52.1%|Medium||
+|1482|Minimum Number of Days to Make m Bouquets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1482.Minimum-Number-of-Days-to-Make-m-Bouquets)|52.1%|Medium||
 |1483|Kth Ancestor of a Tree Node||33.0%|Hard||
 |1484|Group Sold Products By The Date||85.0%|Easy||
 |1485|Clone Binary Tree With Random Pointer||79.6%|Medium||
-|1486|XOR Operation in an Array||83.9%|Easy||
+|1486|XOR Operation in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1486.XOR-Operation-in-an-Array)|83.9%|Easy||
 |1487|Making File Names Unique||31.8%|Medium||
 |1488|Avoid Flood in The City||24.6%|Medium||
 |1489|Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree||51.8%|Hard||
@@ -1631,13 +1631,13 @@
 |1491|Average Salary Excluding the Minimum and Maximum Salary||67.9%|Easy||
 |1492|The kth Factor of n||62.9%|Medium||
 |1493|Longest Subarray of 1's After Deleting One Element||57.7%|Medium||
-|1494|Parallel Courses II||30.8%|Hard||
-|1495|Friendly Movies Streamed Last Month||51.1%|Easy||
+|1494|Parallel Courses II||30.9%|Hard||
+|1495|Friendly Movies Streamed Last Month||51.0%|Easy||
 |1496|Path Crossing||55.1%|Easy||
-|1497|Check If Array Pairs Are Divisible by k||40.3%|Medium||
+|1497|Check If Array Pairs Are Divisible by k||40.4%|Medium||
 |1498|Number of Subsequences That Satisfy the Given Sum Condition||39.2%|Medium||
 |1499|Max Value of Equation||45.5%|Hard||
-|1500|Design a File Sharing System||46.5%|Medium||
+|1500|Design a File Sharing System||46.6%|Medium||
 |1501|Countries You Can Safely Invest In||60.0%|Medium||
 |1502|Can Make Arithmetic Progression From Sequence||70.4%|Easy||
 |1503|Last Moment Before All Ants Fall Out of a Plank||53.6%|Medium||
@@ -1649,7 +1649,7 @@
 |1509|Minimum Difference Between Largest and Smallest Value in Three Moves||55.5%|Medium||
 |1510|Stone Game IV||59.2%|Hard||
 |1511|Customer Order Frequency||74.6%|Easy||
-|1512|Number of Good Pairs||87.6%|Easy||
+|1512|Number of Good Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1512.Number-of-Good-Pairs)|87.6%|Easy||
 |1513|Number of Substrings With Only 1s||42.5%|Medium||
 |1514|Path with Maximum Probability||42.1%|Medium||
 |1515|Best Position for a Service Centre||39.3%|Hard||
@@ -1659,39 +1659,39 @@
 |1519|Number of Nodes in the Sub-Tree With the Same Label||37.8%|Medium||
 |1520|Maximum Number of Non-Overlapping Substrings||36.9%|Hard||
 |1521|Find a Value of a Mysterious Function Closest to Target||44.2%|Hard||
-|1522|Diameter of N-Ary Tree||69.9%|Medium||
+|1522|Diameter of N-Ary Tree||70.0%|Medium||
 |1523|Count Odd Numbers in an Interval Range||54.1%|Easy||
 |1524|Number of Sub-arrays With Odd Sum||40.7%|Medium||
 |1525|Number of Good Ways to Split a String||68.5%|Medium||
-|1526|Minimum Number of Increments on Subarrays to Form a Target Array||64.1%|Hard||
-|1527|Patients With a Condition||58.4%|Easy||
+|1526|Minimum Number of Increments on Subarrays to Form a Target Array||64.0%|Hard||
+|1527|Patients With a Condition||58.3%|Easy||
 |1528|Shuffle String||85.6%|Easy||
 |1529|Bulb Switcher IV||71.5%|Medium||
 |1530|Number of Good Leaf Nodes Pairs||57.4%|Medium||
 |1531|String Compression II||34.6%|Hard||
 |1532|The Most Recent Three Orders||72.2%|Medium||
-|1533|Find the Index of the Large Integer||54.1%|Medium||
+|1533|Find the Index of the Large Integer||54.2%|Medium||
 |1534|Count Good Triplets||80.3%|Easy||
 |1535|Find the Winner of an Array Game||48.1%|Medium||
 |1536|Minimum Swaps to Arrange a Binary Grid||44.1%|Medium||
 |1537|Get the Maximum Score||37.0%|Hard||
 |1538|Guess the Majority in a Hidden Array||61.0%|Medium||
-|1539|Kth Missing Positive Number||54.7%|Easy||
+|1539|Kth Missing Positive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1539.Kth-Missing-Positive-Number)|54.7%|Easy||
 |1540|Can Convert String in K Moves||31.6%|Medium||
-|1541|Minimum Insertions to Balance a Parentheses String||44.4%|Medium||
+|1541|Minimum Insertions to Balance a Parentheses String||44.5%|Medium||
 |1542|Find Longest Awesome Substring||37.1%|Hard||
 |1543|Fix Product Name Format||65.7%|Easy||
-|1544|Make The String Great||55.7%|Easy||
+|1544|Make The String Great||55.6%|Easy||
 |1545|Find Kth Bit in Nth Binary String||58.0%|Medium||
-|1546|Maximum Number of Non-Overlapping Subarrays With Sum Equals Target||44.6%|Medium||
+|1546|Maximum Number of Non-Overlapping Subarrays With Sum Equals Target||44.7%|Medium||
 |1547|Minimum Cost to Cut a Stick||53.4%|Hard||
 |1548|The Most Similar Path in a Graph||55.6%|Hard||
 |1549|The Most Recent Orders for Each Product||67.3%|Medium||
 |1550|Three Consecutive Odds||64.0%|Easy||
-|1551|Minimum Operations to Make Array Equal||80.6%|Medium||
+|1551|Minimum Operations to Make Array Equal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1551.Minimum-Operations-to-Make-Array-Equal)|80.6%|Medium||
 |1552|Magnetic Force Between Two Balls||50.4%|Medium||
-|1553|Minimum Number of Days to Eat N Oranges||30.7%|Hard||
-|1554|Strings Differ by One Character||64.6%|Medium||
+|1553|Minimum Number of Days to Eat N Oranges||30.8%|Hard||
+|1554|Strings Differ by One Character||64.7%|Medium||
 |1555|Bank Account Summary||53.2%|Medium||
 |1556|Thousand Separator||57.0%|Easy||
 |1557|Minimum Number of Vertices to Reach All Nodes||76.2%|Medium||
@@ -1700,8 +1700,8 @@
 |1560|Most Visited Sector in  a Circular Track||57.3%|Easy||
 |1561|Maximum Number of Coins You Can Get||77.1%|Medium||
 |1562|Find Latest Group of Size M||40.0%|Medium||
-|1563|Stone Game V||40.1%|Hard||
-|1564|Put Boxes Into the Warehouse I||64.2%|Medium||
+|1563|Stone Game V||40.0%|Hard||
+|1564|Put Boxes Into the Warehouse I||64.3%|Medium||
 |1565|Unique Orders and Customers Per Month||82.9%|Easy||
 |1566|Detect Pattern of Length M Repeated K or More Times||42.9%|Easy||
 |1567|Maximum Length of Subarray With Positive Product||37.6%|Medium||
@@ -1709,24 +1709,24 @@
 |1569|Number of Ways to Reorder Array to Get Same BST||50.2%|Hard||
 |1570|Dot Product of Two Sparse Vectors||91.1%|Medium||
 |1571|Warehouse Manager||89.6%|Easy||
-|1572|Matrix Diagonal Sum||77.9%|Easy||
-|1573|Number of Ways to Split a String||31.3%|Medium||
+|1572|Matrix Diagonal Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1572.Matrix-Diagonal-Sum)|77.9%|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.3%|Medium||
 |1574|Shortest Subarray to be Removed to Make Array Sorted||34.3%|Medium||
 |1575|Count All Possible Routes||57.4%|Hard||
 |1576|Replace All ?'s to Avoid Consecutive Repeating Characters||50.4%|Easy||
 |1577|Number of Ways Where Square of Number Is Equal to Product of Two Numbers||38.2%|Medium||
-|1578|Minimum Deletion Cost to Avoid Repeating Letters||60.9%|Medium||
-|1579|Remove Max Number of Edges to Keep Graph Fully Traversable||46.8%|Hard||
+|1578|Minimum Deletion Cost to Avoid Repeating Letters||61.0%|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.8%|Hard||
 |1580|Put Boxes Into the Warehouse II||63.6%|Medium||
-|1581|Customer Who Visited but Did Not Make Any Transactions||89.4%|Easy||
-|1582|Special Positions in a Binary Matrix||64.1%|Easy||
+|1581|Customer Who Visited but Did Not Make Any Transactions||89.5%|Easy||
+|1582|Special Positions in a Binary Matrix||64.2%|Easy||
 |1583|Count Unhappy Friends||55.3%|Medium||
 |1584|Min Cost to Connect All Points||55.1%|Medium||
 |1585|Check If String Is Transformable With Substring Sort Operations||48.5%|Hard||
 |1586|Binary Search Tree Iterator II||66.6%|Medium||
 |1587|Bank Account Summary II||89.9%|Easy||
 |1588|Sum of All Odd Length Subarrays||81.8%|Easy||
-|1589|Maximum Sum Obtained of Any Permutation||35.4%|Medium||
+|1589|Maximum Sum Obtained of Any Permutation||35.5%|Medium||
 |1590|Make Sum Divisible by P||27.2%|Medium||
 |1591|Strange Printer II||55.7%|Hard||
 |1592|Rearrange Spaces Between Words||43.6%|Easy||
@@ -1736,196 +1736,196 @@
 |1596|The Most Frequently Ordered Products for Each Customer||85.1%|Medium||
 |1597|Build Binary Expression Tree From Infix Expression||59.1%|Hard||
 |1598|Crawler Log Folder||63.9%|Easy||
-|1599|Maximum Profit of Operating a Centennial Wheel||43.8%|Medium||
-|1600|Throne Inheritance||61.3%|Medium||
+|1599|Maximum Profit of Operating a Centennial Wheel||43.7%|Medium||
+|1600|Throne Inheritance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1600.Throne-Inheritance)|61.4%|Medium||
 |1601|Maximum Number of Achievable Transfer Requests||48.3%|Hard||
 |1602|Find Nearest Right Node in Binary Tree||73.4%|Medium||
-|1603|Design Parking System||86.5%|Easy||
+|1603|Design Parking System|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1603.Design-Parking-System)|86.5%|Easy||
 |1604|Alert Using Same Key-Card Three or More Times in a One Hour Period||43.6%|Medium||
 |1605|Find Valid Matrix Given Row and Column Sums||77.6%|Medium||
-|1606|Find Servers That Handled Most Number of Requests||38.1%|Hard||
+|1606|Find Servers That Handled Most Number of Requests||38.2%|Hard||
 |1607|Sellers With No Sales||55.2%|Easy||
-|1608|Special Array With X Elements Greater Than or Equal X||61.4%|Easy||
+|1608|Special Array With X Elements Greater Than or Equal X|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X)|61.4%|Easy||
 |1609|Even Odd Tree||52.2%|Medium||
-|1610|Maximum Number of Visible Points||32.5%|Hard||
-|1611|Minimum One Bit Operations to Make Integers Zero||59.3%|Hard||
-|1612|Check If Two Expression Trees are Equivalent||70.1%|Medium||
-|1613|Find the Missing IDs||75.0%|Medium||
-|1614|Maximum Nesting Depth of the Parentheses||82.6%|Easy||
+|1610|Maximum Number of Visible Points||32.6%|Hard||
+|1611|Minimum One Bit Operations to Make Integers Zero||59.4%|Hard||
+|1612|Check If Two Expression Trees are Equivalent||70.0%|Medium||
+|1613|Find the Missing IDs||75.1%|Medium||
+|1614|Maximum Nesting Depth of the Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1614.Maximum-Nesting-Depth-of-the-Parentheses)|82.6%|Easy||
 |1615|Maximal Network Rank||54.0%|Medium||
 |1616|Split Two Strings to Make Palindrome||30.8%|Medium||
 |1617|Count Subtrees With Max Distance Between Cities||63.6%|Hard||
 |1618|Maximum Font to Fit a Sentence in a Screen||57.7%|Medium||
-|1619|Mean of Array After Removing Some Elements||64.4%|Easy||
+|1619|Mean of Array After Removing Some Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1619.Mean-of-Array-After-Removing-Some-Elements)|64.5%|Easy||
 |1620|Coordinate With Maximum Network Quality||37.1%|Medium||
 |1621|Number of Sets of K Non-Overlapping Line Segments||41.9%|Medium||
 |1622|Fancy Sequence||14.7%|Hard||
 |1623|All Valid Triplets That Can Represent a Country||89.0%|Easy||
-|1624|Largest Substring Between Two Equal Characters||58.6%|Easy||
-|1625|Lexicographically Smallest String After Applying Operations||65.0%|Medium||
+|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.6%|Easy||
+|1625|Lexicographically Smallest String After Applying Operations||65.1%|Medium||
 |1626|Best Team With No Conflicts||39.3%|Medium||
 |1627|Graph Connectivity With Threshold||41.1%|Hard||
 |1628|Design an Expression Tree With Evaluate Function||80.7%|Medium||
-|1629|Slowest Key||59.0%|Easy||
+|1629|Slowest Key|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1629.Slowest-Key)|59.0%|Easy||
 |1630|Arithmetic Subarrays||77.3%|Medium||
-|1631|Path With Minimum Effort||50.3%|Medium||
+|1631|Path With Minimum Effort|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1631.Path-With-Minimum-Effort)|50.3%|Medium||
 |1632|Rank Transform of a Matrix||32.1%|Hard||
 |1633|Percentage of Users Attended a Contest||70.8%|Easy||
 |1634|Add Two Polynomials Represented as Linked Lists||52.8%|Medium||
-|1635|Hopper Company Queries I||56.4%|Hard||
-|1636|Sort Array by Increasing Frequency||67.1%|Easy||
+|1635|Hopper Company Queries I||56.5%|Hard||
+|1636|Sort Array by Increasing Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1636.Sort-Array-by-Increasing-Frequency)|67.2%|Easy||
 |1637|Widest Vertical Area Between Two Points Containing No Points||83.8%|Medium||
 |1638|Count Substrings That Differ by One Character||71.2%|Medium||
 |1639|Number of Ways to Form a Target String Given a Dictionary||40.3%|Hard||
-|1640|Check Array Formation Through Concatenation||55.5%|Easy||
-|1641|Count Sorted Vowel Strings||75.0%|Medium||
-|1642|Furthest Building You Can Reach||43.4%|Medium||
-|1643|Kth Smallest Instructions||45.4%|Hard||
+|1640|Check Array Formation Through Concatenation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1640.Check-Array-Formation-Through-Concatenation)|55.5%|Easy||
+|1641|Count Sorted Vowel Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1641.Count-Sorted-Vowel-Strings)|75.0%|Medium||
+|1642|Furthest Building You Can Reach|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1642.Furthest-Building-You-Can-Reach)|43.4%|Medium||
+|1643|Kth Smallest Instructions||45.5%|Hard||
 |1644|Lowest Common Ancestor of a Binary Tree II||56.8%|Medium||
 |1645|Hopper Company Queries II||39.0%|Hard||
-|1646|Get Maximum in Generated Array||52.8%|Easy||
-|1647|Minimum Deletions to Make Character Frequencies Unique||55.7%|Medium||
-|1648|Sell Diminishing-Valued Colored Balls||31.1%|Medium||
-|1649|Create Sorted Array through Instructions||36.8%|Hard||
+|1646|Get Maximum in Generated Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1646.Get-Maximum-in-Generated-Array)|52.8%|Easy||
+|1647|Minimum Deletions to Make Character Frequencies Unique|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique)|55.7%|Medium||
+|1648|Sell Diminishing-Valued Colored Balls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls)|31.1%|Medium||
+|1649|Create Sorted Array through Instructions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1649.Create-Sorted-Array-through-Instructions)|36.8%|Hard||
 |1650|Lowest Common Ancestor of a Binary Tree III||76.8%|Medium||
 |1651|Hopper Company Queries III||67.2%|Hard||
-|1652|Defuse the Bomb||60.5%|Easy||
-|1653|Minimum Deletions to Make String Balanced||52.4%|Medium||
-|1654|Minimum Jumps to Reach Home||24.6%|Medium||
-|1655|Distribute Repeating Integers||40.2%|Hard||
-|1656|Design an Ordered Stream||82.2%|Easy||
-|1657|Determine if Two Strings Are Close||54.9%|Medium||
-|1658|Minimum Operations to Reduce X to Zero||33.3%|Medium||
-|1659|Maximize Grid Happiness||35.9%|Hard||
+|1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|60.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)|52.4%|Medium||
+|1654|Minimum Jumps to Reach Home|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1654.Minimum-Jumps-to-Reach-Home)|24.6%|Medium||
+|1655|Distribute Repeating Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1655.Distribute-Repeating-Integers)|40.2%|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)|54.9%|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.3%|Medium||
+|1659|Maximize Grid Happiness|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1659.Maximize-Grid-Happiness)|35.9%|Hard||
 |1660|Correct a Binary Tree||75.4%|Medium||
-|1661|Average Time of Process per Machine||79.6%|Easy||
-|1662|Check If Two String Arrays are Equivalent||82.1%|Easy||
-|1663|Smallest String With A Given Numeric Value||64.2%|Medium||
-|1664|Ways to Make a Fair Array||62.0%|Medium||
-|1665|Minimum Initial Energy to Finish Tasks||54.7%|Hard||
+|1661|Average Time of Process per Machine||79.7%|Easy||
+|1662|Check If Two String Arrays are Equivalent|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent)|82.1%|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.2%|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.0%|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)|54.7%|Hard||
 |1666|Change the Root of a Binary Tree||69.5%|Medium||
 |1667|Fix Names in a Table||62.3%|Easy||
-|1668|Maximum Repeating Substring||38.7%|Easy||
-|1669|Merge In Between Linked Lists||75.2%|Medium||
-|1670|Design Front Middle Back Queue||54.3%|Medium||
+|1668|Maximum Repeating Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1668.Maximum-Repeating-Substring)|38.7%|Easy||
+|1669|Merge In Between Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1669.Merge-In-Between-Linked-Lists)|75.2%|Medium||
+|1670|Design Front Middle Back Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1670.Design-Front-Middle-Back-Queue)|54.3%|Medium||
 |1671|Minimum Number of Removals to Make Mountain Array||44.3%|Hard||
-|1672|Richest Customer Wealth||88.1%|Easy||
-|1673|Find the Most Competitive Subsequence||45.8%|Medium||
-|1674|Minimum Moves to Make Array Complementary||36.3%|Medium||
-|1675|Minimize Deviation in Array||48.1%|Hard||
+|1672|Richest Customer Wealth|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1672.Richest-Customer-Wealth)|88.1%|Easy||
+|1673|Find the Most Competitive Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1673.Find-the-Most-Competitive-Subsequence)|45.8%|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)|36.3%|Medium||
+|1675|Minimize Deviation in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1675.Minimize-Deviation-in-Array)|48.1%|Hard||
 |1676|Lowest Common Ancestor of a Binary Tree IV||79.1%|Medium||
-|1677|Product's Worth Over Invoices||52.8%|Easy||
-|1678|Goal Parser Interpretation||84.9%|Easy||
-|1679|Max Number of K-Sum Pairs||53.6%|Medium||
-|1680|Concatenation of Consecutive Binary Numbers||52.2%|Medium||
-|1681|Minimum Incompatibility||35.9%|Hard||
-|1682|Longest Palindromic Subsequence II||51.2%|Medium||
+|1677|Product's Worth Over Invoices||52.7%|Easy||
+|1678|Goal Parser Interpretation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1678.Goal-Parser-Interpretation)|84.9%|Easy||
+|1679|Max Number of K-Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1679.Max-Number-of-K-Sum-Pairs)|53.6%|Medium||
+|1680|Concatenation of Consecutive Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers)|52.2%|Medium||
+|1681|Minimum Incompatibility|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1681.Minimum-Incompatibility)|35.9%|Hard||
+|1682|Longest Palindromic Subsequence II||51.1%|Medium||
 |1683|Invalid Tweets||90.9%|Easy||
-|1684|Count the Number of Consistent Strings||81.6%|Easy||
-|1685|Sum of Absolute Differences in a Sorted Array||63.4%|Medium||
+|1684|Count the Number of Consistent Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1684.Count-the-Number-of-Consistent-Strings)|81.6%|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)|63.4%|Medium||
 |1686|Stone Game VI||51.0%|Medium||
 |1687|Delivering Boxes from Storage to Ports||35.9%|Hard||
-|1688|Count of Matches in Tournament||81.8%|Easy||
-|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers||88.4%|Medium||
-|1690|Stone Game VII||58.6%|Medium||
-|1691|Maximum Height by Stacking Cuboids||51.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.8%|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)|88.3%|Medium||
+|1690|Stone Game VII|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1690.Stone-Game-VII)|58.6%|Medium||
+|1691|Maximum Height by Stacking Cuboids|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1691.Maximum-Height-by-Stacking-Cuboids)|51.0%|Hard||
 |1692|Count Ways to Distribute Candies||60.2%|Hard||
 |1693|Daily Leads and Partners||90.8%|Easy||
-|1694|Reformat Phone Number||64.7%|Easy||
-|1695|Maximum Erasure Value||52.5%|Medium||
-|1696|Jump Game VI||42.2%|Medium||
+|1694|Reformat Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1694.Reformat-Phone-Number)|64.7%|Easy||
+|1695|Maximum Erasure Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1695.Maximum-Erasure-Value)|52.5%|Medium||
+|1696|Jump Game VI|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1696.Jump-Game-VI)|42.2%|Medium||
 |1697|Checking Existence of Edge Length Limited Paths||47.9%|Hard||
 |1698|Number of Distinct Substrings in a String||60.8%|Medium||
 |1699|Number of Calls Between Two Persons||85.9%|Medium||
-|1700|Number of Students Unable to Eat Lunch||67.6%|Easy||
+|1700|Number of Students Unable to Eat Lunch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1700.Number-of-Students-Unable-to-Eat-Lunch)|67.6%|Easy||
 |1701|Average Waiting Time||60.9%|Medium||
 |1702|Maximum Binary String After Change||43.7%|Medium||
-|1703|Minimum Adjacent Swaps for K Consecutive Ones||37.4%|Hard||
-|1704|Determine if String Halves Are Alike||78.6%|Easy||
+|1703|Minimum Adjacent Swaps for K Consecutive Ones||37.5%|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)|78.6%|Easy||
 |1705|Maximum Number of Eaten Apples||34.4%|Medium||
 |1706|Where Will the Ball Fall||62.5%|Medium||
 |1707|Maximum XOR With an Element From Array||42.5%|Hard||
-|1708|Largest Subarray Length K||63.7%|Easy||
-|1709|Biggest Window Between Visits||80.8%|Medium||
-|1710|Maximum Units on a Truck||72.5%|Easy||
+|1708|Largest Subarray Length K||63.6%|Easy||
+|1709|Biggest Window Between Visits||80.9%|Medium||
+|1710|Maximum Units on a Truck|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1710.Maximum-Units-on-a-Truck)|72.5%|Easy||
 |1711|Count Good Meals||26.9%|Medium||
 |1712|Ways to Split Array Into Three Subarrays||29.1%|Medium||
-|1713|Minimum Operations to Make a Subsequence||46.0%|Hard||
-|1714|Sum Of Special Evenly-Spaced Elements In Array||48.8%|Hard||
+|1713|Minimum Operations to Make a Subsequence||45.9%|Hard||
+|1714|Sum Of Special Evenly-Spaced Elements In Array||48.9%|Hard||
 |1715|Count Apples and Oranges||78.5%|Medium||
-|1716|Calculate Money in Leetcode Bank||64.0%|Easy||
+|1716|Calculate Money in Leetcode Bank|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1716.Calculate-Money-in-Leetcode-Bank)|64.1%|Easy||
 |1717|Maximum Score From Removing Substrings||41.7%|Medium||
-|1718|Construct the Lexicographically Largest Valid Sequence||48.5%|Medium||
-|1719|Number Of Ways To Reconstruct A Tree||39.7%|Hard||
-|1720|Decode XORed Array||85.4%|Easy||
-|1721|Swapping Nodes in a Linked List||66.5%|Medium||
+|1718|Construct the Lexicographically Largest Valid Sequence||48.6%|Medium||
+|1719|Number Of Ways To Reconstruct A Tree||39.8%|Hard||
+|1720|Decode XORed Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1720.Decode-XORed-Array)|85.5%|Easy||
+|1721|Swapping Nodes in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1721.Swapping-Nodes-in-a-Linked-List)|66.5%|Medium||
 |1722|Minimize Hamming Distance After Swap Operations||46.0%|Medium||
 |1723|Find Minimum Time to Finish All Jobs||40.7%|Hard||
 |1724|Checking Existence of Edge Length Limited Paths II||56.9%|Hard||
-|1725|Number Of Rectangles That Can Form The Largest Square||78.3%|Easy||
-|1726|Tuple with Same Product||58.4%|Medium||
+|1725|Number Of Rectangles That Can Form The Largest Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square)|78.3%|Easy||
+|1726|Tuple with Same Product||58.5%|Medium||
 |1727|Largest Submatrix With Rearrangements||59.4%|Medium||
 |1728|Cat and Mouse II||41.2%|Hard||
 |1729|Find Followers Count||70.5%|Easy||
 |1730|Shortest Path to Get Food||55.1%|Medium||
 |1731|The Number of Employees Which Report to Each Employee||49.5%|Easy||
-|1732|Find the Highest Altitude||79.2%|Easy||
+|1732|Find the Highest Altitude|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1732.Find-the-Highest-Altitude)|79.2%|Easy||
 |1733|Minimum Number of People to Teach||38.4%|Medium||
-|1734|Decode XORed Permutation||56.7%|Medium||
+|1734|Decode XORed Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1734.Decode-XORed-Permutation)|56.7%|Medium||
 |1735|Count Ways to Make Array With Product||48.3%|Hard||
-|1736|Latest Time by Replacing Hidden Digits||41.4%|Easy||
+|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.4%|Easy||
 |1737|Change Minimum Characters to Satisfy One of Three Conditions||30.4%|Medium||
-|1738|Find Kth Largest XOR Coordinate Value||62.8%|Medium||
-|1739|Building Boxes||50.0%|Hard||
-|1740|Find Distance in a Binary Tree||69.0%|Medium||
-|1741|Find Total Time Spent by Each Employee||90.9%|Easy||
-|1742|Maximum Number of Balls in a Box||73.2%|Easy||
+|1738|Find Kth Largest XOR Coordinate Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1738.Find-Kth-Largest-XOR-Coordinate-Value)|62.8%|Medium||
+|1739|Building Boxes||50.2%|Hard||
+|1740|Find Distance in a Binary Tree||69.2%|Medium||
+|1741|Find Total Time Spent by Each Employee||90.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)|73.2%|Easy||
 |1743|Restore the Array From Adjacent Pairs||64.7%|Medium||
-|1744|Can You Eat Your Favorite Candy on Your Favorite Day?||31.3%|Medium||
-|1745|Palindrome Partitioning IV||49.7%|Hard||
-|1746|Maximum Subarray Sum After One Operation||62.0%|Medium||
+|1744|Can You Eat Your Favorite Candy on Your Favorite Day?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day?)|31.3%|Medium||
+|1745|Palindrome Partitioning IV||49.6%|Hard||
+|1746|Maximum Subarray Sum After One Operation||61.9%|Medium||
 |1747|Leetflex Banned Accounts||68.7%|Medium||
-|1748|Sum of Unique Elements||74.7%|Easy||
-|1749|Maximum Absolute Sum of Any Subarray||53.5%|Medium||
+|1748|Sum of Unique Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1748.Sum-of-Unique-Elements)|74.6%|Easy||
+|1749|Maximum Absolute Sum of Any Subarray||53.6%|Medium||
 |1750|Minimum Length of String After Deleting Similar Ends||42.4%|Medium||
 |1751|Maximum Number of Events That Can Be Attended II||48.9%|Hard||
-|1752|Check if Array Is Sorted and Rotated||44.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)|44.5%|Easy||
 |1753|Maximum Score From Removing Stones||62.9%|Medium||
 |1754|Largest Merge Of Two Strings||41.7%|Medium||
 |1755|Closest Subsequence Sum||34.3%|Hard||
-|1756|Design Most Recently Used Queue||78.9%|Medium||
-|1757|Recyclable and Low Fat Products||95.3%|Easy||
-|1758|Minimum Changes To Make Alternating Binary String||58.2%|Easy||
+|1756|Design Most Recently Used Queue||79.0%|Medium||
+|1757|Recyclable and Low Fat Products||95.2%|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.2%|Easy||
 |1759|Count Number of Homogenous Substrings||43.7%|Medium||
-|1760|Minimum Limit of Balls in a Bag||53.8%|Medium||
+|1760|Minimum Limit of Balls in a Bag||53.7%|Medium||
 |1761|Minimum Degree of a Connected Trio in a Graph||38.5%|Hard||
 |1762|Buildings With an Ocean View||81.5%|Medium||
-|1763|Longest Nice Substring||61.2%|Easy||
+|1763|Longest Nice Substring||61.1%|Easy||
 |1764|Form Array by Concatenating Subarrays of Another Array||53.6%|Medium||
 |1765|Map of Highest Peak||56.9%|Medium||
 |1766|Tree of Coprimes||36.6%|Hard||
-|1767|Find the Subtasks That Did Not Execute||86.0%|Hard||
+|1767|Find the Subtasks That Did Not Execute||85.9%|Hard||
 |1768|Merge Strings Alternately||74.1%|Easy||
 |1769|Minimum Number of Operations to Move All Balls to Each Box||85.9%|Medium||
 |1770|Maximum Score from Performing Multiplication Operations||30.5%|Medium||
 |1771|Maximize Palindrome Length From Subsequences||34.4%|Hard||
-|1772|Sort Features by Popularity||65.8%|Medium||
+|1772|Sort Features by Popularity||65.9%|Medium||
 |1773|Count Items Matching a Rule||84.7%|Easy||
 |1774|Closest Dessert Cost||45.3%|Medium||
-|1775|Equal Sum Arrays With Minimum Number of Operations||50.3%|Medium||
+|1775|Equal Sum Arrays With Minimum Number of Operations||50.4%|Medium||
 |1776|Car Fleet II||49.8%|Hard||
 |1777|Product's Price for Each Store||86.3%|Easy||
 |1778|Shortest Path in a Hidden Grid||44.5%|Medium||
 |1779|Find Nearest Point That Has the Same X or Y Coordinate||66.7%|Easy||
 |1780|Check if Number is a Sum of Powers of Three||63.2%|Medium||
-|1781|Sum of Beauty of All Substrings||58.4%|Medium||
-|1782|Count Pairs Of Nodes||34.4%|Hard||
-|1783|Grand Slam Titles||90.6%|Medium||
-|1784|Check if Binary String Has at Most One Segment of Ones||41.4%|Easy||
+|1781|Sum of Beauty of All Substrings||58.5%|Medium||
+|1782|Count Pairs Of Nodes||34.5%|Hard||
+|1783|Grand Slam Titles||90.7%|Medium||
+|1784|Check if Binary String Has at Most One Segment of Ones||41.3%|Easy||
 |1785|Minimum Elements to Add to Form a Given Sum||40.0%|Medium||
 |1786|Number of Restricted Paths From First to Last Node||36.5%|Medium||
 |1787|Make the XOR of All Segments Equal to Zero||37.3%|Hard||
-|1788|Maximize the Beauty of the Garden||67.4%|Hard||
+|1788|Maximize the Beauty of the Garden||67.1%|Hard||
 |1789|Primary Department for Each Employee||79.3%|Easy||
 |1790|Check if One String Swap Can Make Strings Equal||44.3%|Easy||
 |1791|Find Center of Star Graph||84.3%|Medium||
@@ -1941,62 +1941,62 @@
 |1801|Number of Orders in the Backlog||44.6%|Medium||
 |1802|Maximum Value at a Given Index in a Bounded Array||28.3%|Medium||
 |1803|Count Pairs With XOR in a Range||44.1%|Hard||
-|1804|Implement Trie II (Prefix Tree)||58.6%|Medium||
+|1804|Implement Trie II (Prefix Tree)||58.7%|Medium||
 |1805|Number of Different Integers in a String||34.8%|Easy||
-|1806|Minimum Number of Operations to Reinitialize a Permutation||70.6%|Medium||
+|1806|Minimum Number of Operations to Reinitialize a Permutation||70.7%|Medium||
 |1807|Evaluate the Bracket Pairs of a String||66.3%|Medium||
 |1808|Maximize Number of Nice Divisors||28.3%|Hard||
-|1809|Ad-Free Sessions||63.4%|Easy||
+|1809|Ad-Free Sessions||63.3%|Easy||
 |1810|Minimum Path Cost in a Hidden Grid||54.0%|Medium||
 |1811|Find Interview Candidates||67.3%|Medium||
-|1812|Determine Color of a Chessboard Square||77.3%|Easy||
+|1812|Determine Color of a Chessboard Square||77.2%|Easy||
 |1813|Sentence Similarity III||31.7%|Medium||
-|1814|Count Nice Pairs in an Array||39.2%|Medium||
+|1814|Count Nice Pairs in an Array||39.3%|Medium||
 |1815|Maximum Number of Groups Getting Fresh Donuts||39.5%|Hard||
 |1816|Truncate Sentence||79.9%|Easy||
 |1817|Finding the Users Active Minutes||78.4%|Medium||
 |1818|Minimum Absolute Sum Difference||28.5%|Medium||
 |1819|Number of Different Subsequences GCDs||34.5%|Hard||
 |1820|Maximum Number of Accepted Invitations||47.8%|Medium||
-|1821|Find Customers With Positive Revenue this Year||89.1%|Easy||
+|1821|Find Customers With Positive Revenue this Year||89.2%|Easy||
 |1822|Sign of the Product of an Array||64.0%|Easy||
 |1823|Find the Winner of the Circular Game||72.3%|Medium||
 |1824|Minimum Sideway Jumps||47.6%|Medium||
-|1825|Finding MK Average||28.3%|Hard||
-|1826|Faulty Sensor||55.0%|Easy||
+|1825|Finding MK Average||28.2%|Hard||
+|1826|Faulty Sensor||54.9%|Easy||
 |1827|Minimum Operations to Make the Array Increasing||77.7%|Easy||
 |1828|Queries on Number of Points Inside a Circle||86.6%|Medium||
 |1829|Maximum XOR for Each Query||73.7%|Medium||
 |1830|Minimum Number of Operations to Make String Sorted||46.6%|Hard||
-|1831|Maximum Transaction Each Day||84.6%|Medium||
+|1831|Maximum Transaction Each Day||84.7%|Medium||
 |1832|Check if the Sentence Is Pangram||82.4%|Easy||
 |1833|Maximum Ice Cream Bars||63.7%|Medium||
-|1834|Single-Threaded CPU||33.8%|Medium||
-|1835|Find XOR Sum of All Pairs Bitwise AND||56.5%|Hard||
-|1836|Remove Duplicates From an Unsorted Linked List||72.7%|Medium||
-|1837|Sum of Digits in Base K||74.8%|Easy||
+|1834|Single-Threaded CPU||34.0%|Medium||
+|1835|Find XOR Sum of All Pairs Bitwise AND||56.6%|Hard||
+|1836|Remove Duplicates From an Unsorted Linked List||72.6%|Medium||
+|1837|Sum of Digits in Base K||74.9%|Easy||
 |1838|Frequency of the Most Frequent Element||32.9%|Medium||
 |1839|Longest Substring Of All Vowels in Order||47.2%|Medium||
 |1840|Maximum Building Height||34.4%|Hard||
-|1841|League Statistics||61.8%|Medium||
+|1841|League Statistics||61.5%|Medium||
 |1842|Next Palindrome Using Same Digits||63.9%|Hard||
-|1843|Suspicious Bank Accounts||52.2%|Medium||
+|1843|Suspicious Bank Accounts||52.3%|Medium||
 |1844|Replace All Digits with Characters||80.1%|Easy||
 |1845|Seat Reservation Manager||55.3%|Medium||
 |1846|Maximum Element After Decreasing and Rearranging||54.6%|Medium||
 |1847|Closest Room||31.6%|Hard||
 |1848|Minimum Distance to the Target Element||59.9%|Easy||
 |1849|Splitting a String Into Descending Consecutive Values||27.5%|Medium||
-|1850|Minimum Adjacent Swaps to Reach the Kth Smallest Number||64.0%|Medium||
+|1850|Minimum Adjacent Swaps to Reach the Kth Smallest Number||64.1%|Medium||
 |1851|Minimum Interval to Include Each Query||42.3%|Hard||
 |1852|Distinct Numbers in Each Subarray||76.1%|Medium||
-|1853|Convert Date Format||89.1%|Easy||
-|1854|Maximum Population Year||57.1%|Easy||
-|1855|Maximum Distance Between a Pair of Values||46.0%|Medium||
+|1853|Convert Date Format||89.2%|Easy||
+|1854|Maximum Population Year||57.0%|Easy||
+|1855|Maximum Distance Between a Pair of Values||46.1%|Medium||
 |1856|Maximum Subarray Min-Product||33.7%|Medium||
 |1857|Largest Color Value in a Directed Graph||35.2%|Hard||
-|1858|Longest Word With All Prefixes||67.3%|Medium||
-|1859|Sorting the Sentence||82.2%|Easy||
+|1858|Longest Word With All Prefixes||67.4%|Medium||
+|1859|Sorting the Sentence||82.3%|Easy||
 |1860|Incremental Memory Leak||69.4%|Medium||
 |1861|Rotating the Box||61.8%|Medium||
 |1862|Sum of Floored Pairs||27.2%|Hard||
@@ -2004,15 +2004,15 @@
 |1864|Minimum Number of Swaps to Make the Binary String Alternating||36.2%|Medium||
 |1865|Finding Pairs With a Certain Sum||45.8%|Medium||
 |1866|Number of Ways to Rearrange Sticks With K Sticks Visible||54.0%|Hard||
-|1867|Orders With Maximum Quantity Above Average||78.5%|Medium||
-|1868|Product of Two Run-Length Encoded Arrays||60.1%|Medium||
+|1867|Orders With Maximum Quantity Above Average||78.8%|Medium||
+|1868|Product of Two Run-Length Encoded Arrays||60.0%|Medium||
 |1869|Longer Contiguous Segments of Ones than Zeros||59.5%|Easy||
 |1870|Minimum Speed to Arrive on Time||32.4%|Medium||
 |1871|Jump Game VII||24.3%|Medium||
 |1872|Stone Game VIII||50.8%|Hard||
-|1873|Calculate Special Bonus||90.7%|Easy||
-|1874|Minimize Product Sum of Two Arrays||91.1%|Medium||
-|1875|Group Employees of the Same Salary||75.6%|Medium||
+|1873|Calculate Special Bonus||90.6%|Easy||
+|1874|Minimize Product Sum of Two Arrays||90.7%|Medium||
+|1875|Group Employees of the Same Salary||75.8%|Medium||
 |1876|Substrings of Size Three with Distinct Characters||67.8%|Easy||
 |1877|Minimize Maximum Pair Sum in Array||78.6%|Medium||
 |1878|Get Biggest Three Rhombus Sums in a Grid||43.3%|Medium||
@@ -2021,25 +2021,29 @@
 |1881|Maximum Value after Insertion||33.6%|Medium||
 |1882|Process Tasks Using Servers||30.5%|Medium||
 |1883|Minimum Skips to Arrive at Meeting On Time||38.0%|Hard||
-|1884|Egg Drop With 2 Eggs and N Floors||70.1%|Medium||
+|1884|Egg Drop With 2 Eggs and N Floors||70.2%|Medium||
 |1885|Count Pairs in Two Arrays||55.3%|Medium||
-|1886|Determine Whether Matrix Can Be Obtained By Rotation||53.6%|Easy||
-|1887|Reduction Operations to Make the Array Elements Equal||59.6%|Medium||
+|1886|Determine Whether Matrix Can Be Obtained By Rotation||53.7%|Easy||
+|1887|Reduction Operations to Make the Array Elements Equal||59.7%|Medium||
 |1888|Minimum Number of Flips to Make the Binary String Alternating||33.7%|Medium||
 |1889|Minimum Space Wasted From Packaging||29.2%|Hard||
-|1890|The Latest Login in 2020||87.1%|Easy||
-|1891|Cutting Ribbons||54.0%|Medium||
-|1892|Page Recommendations II||40.5%|Hard||
-|1893|Check if All the Integers in a Range Are Covered||48.8%|Easy||
-|1894|Find the Student that Will Replace the Chalk||38.2%|Medium||
-|1895|Largest Magic Square||48.9%|Medium||
-|1896|Minimum Cost to Change the Final Value of Expression||50.3%|Hard||
-|1897|Redistribute Characters to Make All Strings Equal||58.3%|Easy||
+|1890|The Latest Login in 2020||86.9%|Easy||
+|1891|Cutting Ribbons||53.6%|Medium||
+|1892|Page Recommendations II||40.9%|Hard||
+|1893|Check if All the Integers in a Range Are Covered||49.0%|Easy||
+|1894|Find the Student that Will Replace the Chalk||38.3%|Medium||
+|1895|Largest Magic Square||49.0%|Medium||
+|1896|Minimum Cost to Change the Final Value of Expression||50.6%|Hard||
+|1897|Redistribute Characters to Make All Strings Equal||58.2%|Easy||
 |1898|Maximum Number of Removable Characters||32.0%|Medium||
-|1899|Merge Triplets to Form Target Triplet||58.5%|Medium||
-|1900|The Earliest and Latest Rounds Where Players Compete||48.4%|Hard||
-|1901|Find a Peak Element II||66.1%|Medium||
-|1902|Depth of BST Given Insertion Order||49.4%|Medium||
+|1899|Merge Triplets to Form Target Triplet||58.6%|Medium||
+|1900|The Earliest and Latest Rounds Where Players Compete||48.5%|Hard||
+|1901|Find a Peak Element II||65.9%|Medium||
+|1902|Depth of BST Given Insertion Order||49.1%|Medium||
+|1903|Largest Odd Number in String||55.3%|Easy||
+|1904|The Number of Full Rounds You Have Played||39.0%|Medium||
+|1905|Count Sub Islands||55.2%|Medium||
+|1906|Minimum Absolute Difference Queries||28.6%|Medium||
 |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|
 
 ------------------------------------------------------------------
diff --git a/ctl/models/mdrow.go b/ctl/models/mdrow.go
index a56b05f1b..8fc71e51d 100644
--- a/ctl/models/mdrow.go
+++ b/ctl/models/mdrow.go
@@ -18,17 +18,37 @@ type Mdrow struct {
 
 // GenerateMdRows define
 func GenerateMdRows(solutionIds []int, mdrows []Mdrow) {
-	//fmt.Printf("solutionIds = %v\n\n", solutionIds)
+	mdMap := map[int]Mdrow{}
+	for _, row := range mdrows {
+		mdMap[int(row.FrontendQuestionID)] = row
+	}
 	for i := 0; i < len(solutionIds); i++ {
-		//fmt.Printf("solutionIds[i] = %v id = %v - %v\n", solutionIds[i], mdrows[solutionIds[i]].FrontendQuestionID, mdrows[solutionIds[i]].QuestionTitle)
-		id := mdrows[solutionIds[i]-1].FrontendQuestionID
-		if solutionIds[i] == int(id) {
-			//fmt.Printf("id = %v i = %v solutionIds = %v\n", id, i, solutionIds[i])
-			mdrows[id-1].SolutionPath = fmt.Sprintf("[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/%v)", fmt.Sprintf("%04d.%v", id, strings.Replace(strings.TrimSpace(mdrows[id-1].QuestionTitle), " ", "-", -1)))
+		if row, ok := mdMap[solutionIds[i]]; ok {
+			mdMap[solutionIds[i]] = Mdrow{
+				FrontendQuestionID: row.FrontendQuestionID,
+				QuestionTitle:      row.QuestionTitle,
+				QuestionTitleSlug:  row.QuestionTitleSlug,
+				SolutionPath:       fmt.Sprintf("[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/%v)", fmt.Sprintf("%04d.%v", solutionIds[i], strings.Replace(strings.TrimSpace(row.QuestionTitle), " ", "-", -1))),
+				Acceptance:         row.Acceptance,
+				Difficulty:         row.Difficulty,
+				Frequency:          row.Frequency,
+			}
 		} else {
-			fmt.Printf("序号出错了 len(solutionIds) = %v len(mdrows) = %v len(solutionIds) = %v solutionIds[i] = %v id = %v - %v\n", len(solutionIds), len(mdrows), len(solutionIds), solutionIds[i], id, mdrows[solutionIds[i]-1].QuestionTitle)
+			fmt.Printf("序号不存在 len(solutionIds) = %v len(mdrows) = %v len(solutionIds) = %v solutionIds[i] = %v QuestionTitle = %v\n", len(solutionIds), len(mdrows), len(solutionIds), solutionIds[i], mdrows[solutionIds[i]-1].QuestionTitle)
+		}
+	}
+	for i := range mdrows {
+		mdrows[i] = Mdrow{
+			FrontendQuestionID: mdrows[i].FrontendQuestionID,
+			QuestionTitle:      mdrows[i].QuestionTitle,
+			QuestionTitleSlug:  mdrows[i].QuestionTitleSlug,
+			SolutionPath:       mdMap[int(mdrows[i].FrontendQuestionID)].SolutionPath,
+			Acceptance:         mdrows[i].Acceptance,
+			Difficulty:         mdrows[i].Difficulty,
+			Frequency:          mdrows[i].Frequency,
 		}
 	}
+	// fmt.Printf("mdrows = %v\n\n", mdrows)
 }
 
 // | 0001 | Two Sum  | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum)| 45.6%  | Easy | |
diff --git a/leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted.go b/leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted.go
similarity index 100%
rename from leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted.go
rename to leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted.go
diff --git a/leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go b/leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go
similarity index 100%
rename from leetcode/0167.Two-Sum-II---Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go
rename to leetcode/0167.Two-Sum-II-Input-array-is-sorted/167. Two Sum II - Input array is sorted_test.go
diff --git a/leetcode/0167.Two-Sum-II---Input-array-is-sorted/README.md b/leetcode/0167.Two-Sum-II-Input-array-is-sorted/README.md
similarity index 100%
rename from leetcode/0167.Two-Sum-II---Input-array-is-sorted/README.md
rename to leetcode/0167.Two-Sum-II-Input-array-is-sorted/README.md
diff --git a/leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable.go b/leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable.go
similarity index 100%
rename from leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable.go
rename to leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable.go
diff --git a/leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable_test.go b/leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable_test.go
similarity index 100%
rename from leetcode/0303.Range-Sum-Query---Immutable/303. Range Sum Query - Immutable_test.go
rename to leetcode/0303.Range-Sum-Query-Immutable/303. Range Sum Query - Immutable_test.go
diff --git a/leetcode/0303.Range-Sum-Query---Immutable/README.md b/leetcode/0303.Range-Sum-Query-Immutable/README.md
similarity index 100%
rename from leetcode/0303.Range-Sum-Query---Immutable/README.md
rename to leetcode/0303.Range-Sum-Query-Immutable/README.md
diff --git a/leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable.go b/leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable.go
similarity index 100%
rename from leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable.go
rename to leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable.go
diff --git a/leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable_test.go b/leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable_test.go
similarity index 100%
rename from leetcode/0307.Range-Sum-Query---Mutable/307. Range Sum Query - Mutable_test.go
rename to leetcode/0307.Range-Sum-Query-Mutable/307. Range Sum Query - Mutable_test.go
diff --git a/leetcode/0307.Range-Sum-Query---Mutable/README.md b/leetcode/0307.Range-Sum-Query-Mutable/README.md
similarity index 100%
rename from leetcode/0307.Range-Sum-Query---Mutable/README.md
rename to leetcode/0307.Range-Sum-Query-Mutable/README.md
diff --git a/leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST.go b/leetcode/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is a BST.go
similarity index 100%
rename from leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST.go
rename to leetcode/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is a BST.go
diff --git a/leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go b/leetcode/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go
similarity index 100%
rename from leetcode/0653.Two-Sum-IV---Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go
rename to leetcode/0653.Two-Sum-IV-Input-is-a-BST/653. Two Sum IV - Input is a BST_test.go
diff --git a/leetcode/0653.Two-Sum-IV---Input-is-a-BST/README.md b/leetcode/0653.Two-Sum-IV-Input-is-a-BST/README.md
similarity index 100%
rename from leetcode/0653.Two-Sum-IV---Input-is-a-BST/README.md
rename to leetcode/0653.Two-Sum-IV-Input-is-a-BST/README.md
diff --git a/leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2.go b/leetcode/1017.Convert-to-Base-2/1017. Convert to Base -2.go
similarity index 100%
rename from leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2.go
rename to leetcode/1017.Convert-to-Base-2/1017. Convert to Base -2.go
diff --git a/leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2_test.go b/leetcode/1017.Convert-to-Base-2/1017. Convert to Base -2_test.go
similarity index 100%
rename from leetcode/1017.Convert-to-Base--2/1017. Convert to Base -2_test.go
rename to leetcode/1017.Convert-to-Base-2/1017. Convert to Base -2_test.go
diff --git a/leetcode/1017.Convert-to-Base--2/README.md b/leetcode/1017.Convert-to-Base-2/README.md
similarity index 100%
rename from leetcode/1017.Convert-to-Base--2/README.md
rename to leetcode/1017.Convert-to-Base-2/README.md
diff --git a/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance.go b/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance.go
new file mode 100644
index 000000000..4ab87aff8
--- /dev/null
+++ b/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance.go	
@@ -0,0 +1,41 @@
+package leetcode
+
+type ThroneInheritance struct {
+	king  string
+	edges map[string][]string
+	dead  map[string]bool
+}
+
+func Constructor(kingName string) (t ThroneInheritance) {
+	return ThroneInheritance{kingName, map[string][]string{}, map[string]bool{}}
+}
+
+func (t *ThroneInheritance) Birth(parentName, childName string) {
+	t.edges[parentName] = append(t.edges[parentName], childName)
+}
+
+func (t *ThroneInheritance) Death(name string) {
+	t.dead[name] = true
+}
+
+func (t *ThroneInheritance) GetInheritanceOrder() (res []string) {
+	var preorder func(string)
+	preorder = func(name string) {
+		if !t.dead[name] {
+			res = append(res, name)
+		}
+		for _, childName := range t.edges[name] {
+			preorder(childName)
+		}
+	}
+	preorder(t.king)
+	return
+}
+
+/**
+ * Your ThroneInheritance object will be instantiated and called as such:
+ * obj := Constructor(kingName);
+ * obj.Birth(parentName,childName);
+ * obj.Death(name);
+ * param_3 := obj.GetInheritanceOrder();
+ */
diff --git a/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance_test.go b/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance_test.go
new file mode 100644
index 000000000..2ce13f58a
--- /dev/null
+++ b/leetcode/1600.Throne-Inheritance/1600. Throne Inheritance_test.go	
@@ -0,0 +1,29 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+func Test_Problem1600(t *testing.T) {
+	obj := Constructor("king")
+	fmt.Printf("obj = %v\n", obj)
+	obj.Birth("king", "andy")
+	fmt.Printf("obj = %v\n", obj)
+	obj.Birth("king", "bob")
+	fmt.Printf("obj = %v\n", obj)
+	obj.Birth("king", "catherine")
+	fmt.Printf("obj = %v\n", obj)
+	obj.Birth("andy", "matthew")
+	fmt.Printf("obj = %v\n", obj)
+	obj.Birth("bob", "alex")
+	fmt.Printf("obj = %v\n", obj)
+	obj.Birth("bob", "asha")
+	fmt.Printf("obj = %v\n", obj)
+	param2 := obj.GetInheritanceOrder()
+	fmt.Printf("param_2 = %v obj = %v\n", param2, obj)
+	obj.Death("bob")
+	fmt.Printf("obj = %v\n", obj)
+	param2 = obj.GetInheritanceOrder()
+	fmt.Printf("param_2 = %v obj = %v\n", param2, obj)
+}
diff --git a/leetcode/1600.Throne-Inheritance/README.md b/leetcode/1600.Throne-Inheritance/README.md
new file mode 100644
index 000000000..8e5ed385e
--- /dev/null
+++ b/leetcode/1600.Throne-Inheritance/README.md
@@ -0,0 +1,120 @@
+# [1600. Throne Inheritance](https://leetcode.com/problems/throne-inheritance/)
+
+
+## 题目
+
+A kingdom consists of a king, his children, his grandchildren, and so on. Every once in a while, someone in the family dies or a child is born.
+
+The kingdom has a well-defined order of inheritance that consists of the king as the first member. Let's define the recursive function `Successor(x, curOrder)`, which given a person `x` and the inheritance order so far, returns who should be the next person after `x` in the order of inheritance.
+
+```
+Successor(x, curOrder):
+    if x has no children or all of x's children are in curOrder:
+        if x is the king return null
+        else return Successor(x's parent, curOrder)
+    else return x's oldest child who's not in curOrder
+```
+
+For example, assume we have a kingdom that consists of the king, his children Alice and Bob (Alice is older than Bob), and finally Alice's son Jack.
+
+1. In the beginning, `curOrder` will be `["king"]`.
+2. Calling `Successor(king, curOrder)` will return Alice, so we append to `curOrder` to get `["king", "Alice"]`.
+3. Calling `Successor(Alice, curOrder)` will return Jack, so we append to `curOrder` to get `["king", "Alice", "Jack"]`.
+4. Calling `Successor(Jack, curOrder)` will return Bob, so we append to `curOrder` to get `["king", "Alice", "Jack", "Bob"]`.
+5. Calling `Successor(Bob, curOrder)` will return `null`. Thus the order of inheritance will be `["king", "Alice", "Jack", "Bob"]`.
+
+Using the above function, we can always obtain a unique order of inheritance.
+
+Implement the `ThroneInheritance` class:
+
+- `ThroneInheritance(string kingName)` Initializes an object of the `ThroneInheritance` class. The name of the king is given as part of the constructor.
+- `void birth(string parentName, string childName)` Indicates that `parentName` gave birth to `childName`.
+- `void death(string name)` Indicates the death of `name`. The death of the person doesn't affect the `Successor` function nor the current inheritance order. You can treat it as just marking the person as dead.
+- `string[] getInheritanceOrder()` Returns a list representing the current order of inheritance **excluding** dead people.
+
+**Example 1:**
+
+```
+Input
+["ThroneInheritance", "birth", "birth", "birth", "birth", "birth", "birth", "getInheritanceOrder", "death", "getInheritanceOrder"]
+[["king"], ["king", "andy"], ["king", "bob"], ["king", "catherine"], ["andy", "matthew"], ["bob", "alex"], ["bob", "asha"], [null], ["bob"], [null]]
+Output
+[null, null, null, null, null, null, null, ["king", "andy", "matthew", "bob", "alex", "asha", "catherine"], null, ["king", "andy", "matthew", "alex", "asha", "catherine"]]
+
+Explanation
+ThroneInheritance t= new ThroneInheritance("king"); // order:king
+t.birth("king", "andy"); // order: king >andy
+t.birth("king", "bob"); // order: king > andy >bob
+t.birth("king", "catherine"); // order: king > andy > bob >catherine
+t.birth("andy", "matthew"); // order: king > andy >matthew > bob > catherine
+t.birth("bob", "alex"); // order: king > andy > matthew > bob >alex > catherine
+t.birth("bob", "asha"); // order: king > andy > matthew > bob > alex >asha > catherine
+t.getInheritanceOrder(); // return ["king", "andy", "matthew", "bob", "alex", "asha", "catherine"]
+t.death("bob"); // order: king > andy > matthew >bob > alex > asha > catherine
+t.getInheritanceOrder(); // return ["king", "andy", "matthew", "alex", "asha", "catherine"]
+
+```
+
+**Constraints:**
+
+- `1 <= kingName.length, parentName.length, childName.length, name.length <= 15`
+- `kingName`, `parentName`, `childName`, and `name` consist of lowercase English letters only.
+- All arguments `childName` and `kingName` are **distinct**.
+- All `name` arguments of `death` will be passed to either the constructor or as `childName` to `birth` first.
+- For each call to `birth(parentName, childName)`, it is guaranteed that `parentName` is alive.
+- At most `105` calls will be made to `birth` and `death`.
+- At most `10` calls will be made to `getInheritanceOrder`.
+
+## 题目大意
+
+一个王国里住着国王、他的孩子们、他的孙子们等等。每一个时间点，这个家庭里有人出生也有人死亡。这个王国有一个明确规定的皇位继承顺序，第一继承人总是国王自己。我们定义递归函数 Successor(x, curOrder) ，给定一个人 x 和当前的继承顺序，该函数返回 x 的下一继承人。
+
+## 解题思路
+
+- 这道题思路不难。先将国王每个孩子按照顺序存在一个 map 中，然后每个国王的孩子还存在父子关系，同理也按顺序存在 map 中。执行 GetInheritanceOrder() 函数时，将国王的孩子按顺序遍历，如果每个孩子还有孩子，递归遍历到底。如果把继承关系看成一棵树，此题便是多叉树的先根遍历的问题。
+
+## 代码
+
+```go
+package leetcode
+
+type ThroneInheritance struct {
+	king  string
+	edges map[string][]string
+	dead  map[string]bool
+}
+
+func Constructor(kingName string) (t ThroneInheritance) {
+	return ThroneInheritance{kingName, map[string][]string{}, map[string]bool{}}
+}
+
+func (t *ThroneInheritance) Birth(parentName, childName string) {
+	t.edges[parentName] = append(t.edges[parentName], childName)
+}
+
+func (t *ThroneInheritance) Death(name string) {
+	t.dead[name] = true
+}
+
+func (t *ThroneInheritance) GetInheritanceOrder() (res []string) {
+	var preorder func(string)
+	preorder = func(name string) {
+		if !t.dead[name] {
+			res = append(res, name)
+		}
+		for _, childName := range t.edges[name] {
+			preorder(childName)
+		}
+	}
+	preorder(t.king)
+	return
+}
+
+/**
+ * Your ThroneInheritance object will be instantiated and called as such:
+ * obj := Constructor(kingName);
+ * obj.Birth(parentName,childName);
+ * obj.Death(name);
+ * param_3 := obj.GetInheritanceOrder();
+ */
+```
\ No newline at end of file
diff --git a/website/content/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md b/website/content/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md
index 594743b73..cd6aa3c0c 100644
--- a/website/content/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md
+++ b/website/content/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md
@@ -106,5 +106,5 @@ func maxNumEdgesToRemove(n int, edges [][]int) int {
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String/">⬅️上一页</a></p>
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1603.Design-Parking-System/">下一页➡️</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1600.Throne-Inheritance/">下一页➡️</a></p>
 </div>
diff --git a/website/content/ChapterFour/1600~1699/1600.Throne-Inheritance.md b/website/content/ChapterFour/1600~1699/1600.Throne-Inheritance.md
new file mode 100644
index 000000000..c20245511
--- /dev/null
+++ b/website/content/ChapterFour/1600~1699/1600.Throne-Inheritance.md
@@ -0,0 +1,127 @@
+# [1600. Throne Inheritance](https://leetcode.com/problems/throne-inheritance/)
+
+
+## 题目
+
+A kingdom consists of a king, his children, his grandchildren, and so on. Every once in a while, someone in the family dies or a child is born.
+
+The kingdom has a well-defined order of inheritance that consists of the king as the first member. Let's define the recursive function `Successor(x, curOrder)`, which given a person `x` and the inheritance order so far, returns who should be the next person after `x` in the order of inheritance.
+
+```
+Successor(x, curOrder):
+    if x has no children or all of x's children are in curOrder:
+        if x is the king return null
+        else return Successor(x's parent, curOrder)
+    else return x's oldest child who's not in curOrder
+```
+
+For example, assume we have a kingdom that consists of the king, his children Alice and Bob (Alice is older than Bob), and finally Alice's son Jack.
+
+1. In the beginning, `curOrder` will be `["king"]`.
+2. Calling `Successor(king, curOrder)` will return Alice, so we append to `curOrder` to get `["king", "Alice"]`.
+3. Calling `Successor(Alice, curOrder)` will return Jack, so we append to `curOrder` to get `["king", "Alice", "Jack"]`.
+4. Calling `Successor(Jack, curOrder)` will return Bob, so we append to `curOrder` to get `["king", "Alice", "Jack", "Bob"]`.
+5. Calling `Successor(Bob, curOrder)` will return `null`. Thus the order of inheritance will be `["king", "Alice", "Jack", "Bob"]`.
+
+Using the above function, we can always obtain a unique order of inheritance.
+
+Implement the `ThroneInheritance` class:
+
+- `ThroneInheritance(string kingName)` Initializes an object of the `ThroneInheritance` class. The name of the king is given as part of the constructor.
+- `void birth(string parentName, string childName)` Indicates that `parentName` gave birth to `childName`.
+- `void death(string name)` Indicates the death of `name`. The death of the person doesn't affect the `Successor` function nor the current inheritance order. You can treat it as just marking the person as dead.
+- `string[] getInheritanceOrder()` Returns a list representing the current order of inheritance **excluding** dead people.
+
+**Example 1:**
+
+```
+Input
+["ThroneInheritance", "birth", "birth", "birth", "birth", "birth", "birth", "getInheritanceOrder", "death", "getInheritanceOrder"]
+[["king"], ["king", "andy"], ["king", "bob"], ["king", "catherine"], ["andy", "matthew"], ["bob", "alex"], ["bob", "asha"], [null], ["bob"], [null]]
+Output
+[null, null, null, null, null, null, null, ["king", "andy", "matthew", "bob", "alex", "asha", "catherine"], null, ["king", "andy", "matthew", "alex", "asha", "catherine"]]
+
+Explanation
+ThroneInheritance t= new ThroneInheritance("king"); // order:king
+t.birth("king", "andy"); // order: king >andy
+t.birth("king", "bob"); // order: king > andy >bob
+t.birth("king", "catherine"); // order: king > andy > bob >catherine
+t.birth("andy", "matthew"); // order: king > andy >matthew > bob > catherine
+t.birth("bob", "alex"); // order: king > andy > matthew > bob >alex > catherine
+t.birth("bob", "asha"); // order: king > andy > matthew > bob > alex >asha > catherine
+t.getInheritanceOrder(); // return ["king", "andy", "matthew", "bob", "alex", "asha", "catherine"]
+t.death("bob"); // order: king > andy > matthew >bob > alex > asha > catherine
+t.getInheritanceOrder(); // return ["king", "andy", "matthew", "alex", "asha", "catherine"]
+
+```
+
+**Constraints:**
+
+- `1 <= kingName.length, parentName.length, childName.length, name.length <= 15`
+- `kingName`, `parentName`, `childName`, and `name` consist of lowercase English letters only.
+- All arguments `childName` and `kingName` are **distinct**.
+- All `name` arguments of `death` will be passed to either the constructor or as `childName` to `birth` first.
+- For each call to `birth(parentName, childName)`, it is guaranteed that `parentName` is alive.
+- At most `105` calls will be made to `birth` and `death`.
+- At most `10` calls will be made to `getInheritanceOrder`.
+
+## 题目大意
+
+一个王国里住着国王、他的孩子们、他的孙子们等等。每一个时间点，这个家庭里有人出生也有人死亡。这个王国有一个明确规定的皇位继承顺序，第一继承人总是国王自己。我们定义递归函数 Successor(x, curOrder) ，给定一个人 x 和当前的继承顺序，该函数返回 x 的下一继承人。
+
+## 解题思路
+
+- 这道题思路不难。先将国王每个孩子按照顺序存在一个 map 中，然后每个国王的孩子还存在父子关系，同理也按顺序存在 map 中。执行 GetInheritanceOrder() 函数时，将国王的孩子按顺序遍历，如果每个孩子还有孩子，递归遍历到底。如果把继承关系看成一棵树，此题便是多叉树的先根遍历的问题。
+
+## 代码
+
+```go
+package leetcode
+
+type ThroneInheritance struct {
+	king  string
+	edges map[string][]string
+	dead  map[string]bool
+}
+
+func Constructor(kingName string) (t ThroneInheritance) {
+	return ThroneInheritance{kingName, map[string][]string{}, map[string]bool{}}
+}
+
+func (t *ThroneInheritance) Birth(parentName, childName string) {
+	t.edges[parentName] = append(t.edges[parentName], childName)
+}
+
+func (t *ThroneInheritance) Death(name string) {
+	t.dead[name] = true
+}
+
+func (t *ThroneInheritance) GetInheritanceOrder() (res []string) {
+	var preorder func(string)
+	preorder = func(name string) {
+		if !t.dead[name] {
+			res = append(res, name)
+		}
+		for _, childName := range t.edges[name] {
+			preorder(childName)
+		}
+	}
+	preorder(t.king)
+	return
+}
+
+/**
+ * Your ThroneInheritance object will be instantiated and called as such:
+ * obj := Constructor(kingName);
+ * obj.Birth(parentName,childName);
+ * obj.Death(name);
+ * param_3 := obj.GetInheritanceOrder();
+ */
+```
+
+
+----------------------------------------------
+<div style="display: flex;justify-content: space-between;align-items: center;">
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1603.Design-Parking-System/">下一页➡️</a></p>
+</div>
diff --git a/website/content/ChapterFour/1600~1699/1603.Design-Parking-System.md b/website/content/ChapterFour/1600~1699/1603.Design-Parking-System.md
index 8cbb81739..274894e60 100644
--- a/website/content/ChapterFour/1600~1699/1603.Design-Parking-System.md
+++ b/website/content/ChapterFour/1600~1699/1603.Design-Parking-System.md
@@ -105,6 +105,6 @@ func (this *ParkingSystem) AddCar(carType int) bool {
 
 ----------------------------------------------
 <div style="display: flex;justify-content: space-between;align-items: center;">
-<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/">⬅️上一页</a></p>
+<p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1600.Throne-Inheritance/">⬅️上一页</a></p>
 <p><a href="https://books.halfrost.com/leetcode/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/">下一页➡️</a></p>
 </div>
diff --git a/website/content/ChapterTwo/Array.md b/website/content/ChapterTwo/Array.md
index 045265e91..76291c66b 100644
--- a/website/content/ChapterTwo/Array.md
+++ b/website/content/ChapterTwo/Array.md
@@ -87,7 +87,7 @@ weight: 1
 |0665|Non-decreasing Array|[Go]({{< relref "/ChapterFour/0600~0699/0665.Non-decreasing-Array.md" >}})|Medium||||20.9%|
 |0667|Beautiful Arrangement II|[Go]({{< relref "/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md" >}})|Medium||||58.9%|
 |0674|Longest Continuous Increasing Subsequence|[Go]({{< relref "/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md" >}})|Easy||||46.4%|
-|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||66.7%|
+|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||66.6%|
 |0697|Degree of an Array|[Go]({{< relref "/ChapterFour/0600~0699/0697.Degree-of-an-Array.md" >}})|Easy||||54.7%|
 |0713|Subarray Product Less Than K|[Go]({{< relref "/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md" >}})|Medium| O(n)| O(1)||40.8%|
 |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)||58.5%|
@@ -98,7 +98,7 @@ weight: 1
 |0729|My Calendar I|[Go]({{< relref "/ChapterFour/0700~0799/0729.My-Calendar-I.md" >}})|Medium||||54.1%|
 |0746|Min Cost Climbing Stairs|[Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}})|Easy| O(n)| O(1)||53.5%|
 |0766|Toeplitz Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md" >}})|Easy| O(n)| O(1)||65.9%|
-|0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||46.0%|
+|0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||46.1%|
 |0795|Number of Subarrays with Bounded Maximum|[Go]({{< relref "/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum.md" >}})|Medium||||51.7%|
 |0830|Positions of Large Groups|[Go]({{< relref "/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md" >}})|Easy||||50.7%|
 |0832|Flipping an Image|[Go]({{< relref "/ChapterFour/0800~0899/0832.Flipping-an-Image.md" >}})|Easy||||78.6%|
@@ -127,7 +127,7 @@ weight: 1
 |1089|Duplicate Zeros|[Go]({{< relref "/ChapterFour/1000~1099/1089.Duplicate-Zeros.md" >}})|Easy||||51.5%|
 |1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.0%|
 |1128|Number of Equivalent Domino Pairs|[Go]({{< relref "/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md" >}})|Easy||||46.0%|
-|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||41.1%|
+|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||41.2%|
 |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||||60.5%|
 |1184|Distance Between Bus Stops|[Go]({{< relref "/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md" >}})|Easy||||53.9%|
@@ -166,9 +166,9 @@ weight: 1
 |1539|Kth Missing Positive Number|[Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}})|Easy||||54.7%|
 |1572|Matrix Diagonal Sum|[Go]({{< relref "/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md" >}})|Easy||||77.9%|
 |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.4%|
-|1619|Mean of Array After Removing Some Elements|[Go]({{< relref "/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md" >}})|Easy||||64.4%|
+|1619|Mean of Array After Removing Some Elements|[Go]({{< relref "/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md" >}})|Easy||||64.5%|
 |1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||59.0%|
-|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||67.1%|
+|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||67.2%|
 |1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||55.5%|
 |1646|Get Maximum in Generated Array|[Go]({{< relref "/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md" >}})|Easy||||52.8%|
 |1652|Defuse the Bomb|[Go]({{< relref "/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md" >}})|Easy||||60.5%|
@@ -178,7 +178,7 @@ weight: 1
 |1732|Find the Highest Altitude|[Go]({{< relref "/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude.md" >}})|Easy||||79.2%|
 |1738|Find Kth Largest XOR Coordinate Value|[Go]({{< relref "/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value.md" >}})|Medium||||62.8%|
 |1742|Maximum Number of Balls in a Box|[Go]({{< relref "/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box.md" >}})|Easy||||73.2%|
-|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||74.7%|
+|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||74.6%|
 |1752|Check if Array Is Sorted and Rotated|[Go]({{< relref "/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated.md" >}})|Easy||||44.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.2%|
 |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
diff --git a/website/content/ChapterTwo/Binary_Search.md b/website/content/ChapterTwo/Binary_Search.md
index cd214d598..241867e8b 100644
--- a/website/content/ChapterTwo/Binary_Search.md
+++ b/website/content/ChapterTwo/Binary_Search.md
@@ -150,7 +150,7 @@ func peakIndexInMountainArray(A []int) int {
 |0230|Kth Smallest Element in a BST|[Go]({{< relref "/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md" >}})|Medium| O(n)| O(1)||63.7%|
 |0240|Search a 2D Matrix II|[Go]({{< relref "/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md" >}})|Medium||||45.9%|
 |0275|H-Index II|[Go]({{< relref "/ChapterFour/0200~0299/0275.H-Index-II.md" >}})|Medium||||36.5%|
-|0278|First Bad Version|[Go]({{< relref "/ChapterFour/0200~0299/0278.First-Bad-Version.md" >}})|Easy||||38.3%|
+|0278|First Bad Version|[Go]({{< relref "/ChapterFour/0200~0299/0278.First-Bad-Version.md" >}})|Easy||||38.4%|
 |0287|Find the Duplicate Number|[Go]({{< relref "/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md" >}})|Medium| O(n)| O(1)|❤️|58.2%|
 |0300|Longest Increasing Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md" >}})|Medium| O(n log n)| O(n)||45.3%|
 |0315|Count of Smaller Numbers After Self|[Go]({{< relref "/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md" >}})|Hard||||42.3%|
@@ -164,14 +164,14 @@ func peakIndexInMountainArray(A []int) int {
 |0392|Is Subsequence|[Go]({{< relref "/ChapterFour/0300~0399/0392.Is-Subsequence.md" >}})|Easy| O(n)| O(1)||49.8%|
 |0410|Split Array Largest Sum|[Go]({{< relref "/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md" >}})|Hard||||47.2%|
 |0436|Find Right Interval|[Go]({{< relref "/ChapterFour/0400~0499/0436.Find-Right-Interval.md" >}})|Medium||||48.7%|
-|0441|Arranging Coins|[Go]({{< relref "/ChapterFour/0400~0499/0441.Arranging-Coins.md" >}})|Easy||||42.8%|
+|0441|Arranging Coins|[Go]({{< relref "/ChapterFour/0400~0499/0441.Arranging-Coins.md" >}})|Easy||||42.9%|
 |0454|4Sum II|[Go]({{< relref "/ChapterFour/0400~0499/0454.4Sum-II.md" >}})|Medium| O(n^2)| O(n) ||54.9%|
 |0475|Heaters|[Go]({{< relref "/ChapterFour/0400~0499/0475.Heaters.md" >}})|Medium||||33.9%|
 |0483|Smallest Good Base|[Go]({{< relref "/ChapterFour/0400~0499/0483.Smallest-Good-Base.md" >}})|Hard||||36.7%|
 |0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard||||27.7%|
 |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||||45.0%|
-|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||42.7%|
+|0658|Find K Closest Elements|[Go]({{< relref "/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md" >}})|Medium||||42.8%|
 |0668|Kth Smallest Number in Multiplication Table|[Go]({{< relref "/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md" >}})|Hard||||48.3%|
 |0704|Binary Search|[Go]({{< relref "/ChapterFour/0700~0799/0704.Binary-Search.md" >}})|Easy||||54.7%|
 |0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n)  ||33.2%|
@@ -184,16 +184,16 @@ func peakIndexInMountainArray(A []int) int {
 |0852|Peak Index in a Mountain Array|[Go]({{< relref "/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md" >}})|Easy||||71.6%|
 |0862|Shortest Subarray with Sum at Least K|[Go]({{< relref "/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md" >}})|Hard||||25.3%|
 |0875|Koko Eating Bananas|[Go]({{< relref "/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md" >}})|Medium||||53.7%|
-|0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||29.0%|
-|0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||26.9%|
+|0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||29.1%|
+|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.7%|
 |0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||34.8%|
 |0981|Time Based Key-Value Store|[Go]({{< relref "/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md" >}})|Medium||||54.5%|
 |1011|Capacity To Ship Packages Within D Days|[Go]({{< relref "/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md" >}})|Medium||||60.5%|
 |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.8%|
-|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||41.1%|
+|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard||||41.2%|
 |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||||60.5%|
-|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||26.6%|
+|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||26.7%|
 |1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||48.2%|
 |1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||50.6%|
 |1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||42.6%|
diff --git a/website/content/ChapterTwo/Bit_Manipulation.md b/website/content/ChapterTwo/Bit_Manipulation.md
index 48d7b35ff..51cc27ea4 100644
--- a/website/content/ChapterTwo/Bit_Manipulation.md
+++ b/website/content/ChapterTwo/Bit_Manipulation.md
@@ -57,14 +57,14 @@ X & ~X = 0
 |0268|Missing Number|[Go]({{< relref "/ChapterFour/0200~0299/0268.Missing-Number.md" >}})|Easy| O(n)| O(1)||56.1%|
 |0318|Maximum Product of Word Lengths|[Go]({{< relref "/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md" >}})|Medium| O(n)| O(1)||55.3%|
 |0338|Counting Bits|[Go]({{< relref "/ChapterFour/0300~0399/0338.Counting-Bits.md" >}})|Easy| O(n)| O(n)||71.0%|
-|0342|Power of Four|[Go]({{< relref "/ChapterFour/0300~0399/0342.Power-of-Four.md" >}})|Easy| O(n)| O(1)||42.0%|
+|0342|Power of Four|[Go]({{< relref "/ChapterFour/0300~0399/0342.Power-of-Four.md" >}})|Easy| O(n)| O(1)||42.1%|
 |0371|Sum of Two Integers|[Go]({{< relref "/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md" >}})|Medium| O(n)| O(1)||50.6%|
 |0389|Find the Difference|[Go]({{< relref "/ChapterFour/0300~0399/0389.Find-the-Difference.md" >}})|Easy| O(n)| O(1)||58.2%|
 |0393|UTF-8 Validation|[Go]({{< relref "/ChapterFour/0300~0399/0393.UTF-8-Validation.md" >}})|Medium| O(n)| O(1)||38.4%|
 |0397|Integer Replacement|[Go]({{< relref "/ChapterFour/0300~0399/0397.Integer-Replacement.md" >}})|Medium| O(n)| O(1)||33.7%|
 |0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||48.9%|
 |0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy| O(n)| O(1)||44.8%|
-|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.6%|
+|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.7%|
 |0461|Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0461.Hamming-Distance.md" >}})|Easy| O(n)| O(1)||73.4%|
 |0476|Number Complement|[Go]({{< relref "/ChapterFour/0400~0499/0476.Number-Complement.md" >}})|Easy| O(n)| O(1)||65.2%|
 |0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium| O(n)| O(1)||50.9%|
@@ -80,7 +80,7 @@ X & ~X = 0
 |1442|Count Triplets That Can Form Two Arrays of Equal XOR|[Go]({{< relref "/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR.md" >}})|Medium||||72.8%|
 |1461|Check If a String Contains All Binary Codes of Size K|[Go]({{< relref "/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.md" >}})|Medium||||54.2%|
 |1486|XOR Operation in an Array|[Go]({{< relref "/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array.md" >}})|Easy||||83.9%|
-|1720|Decode XORed Array|[Go]({{< relref "/ChapterFour/1700~1799/1720.Decode-XORed-Array.md" >}})|Easy||||85.4%|
+|1720|Decode XORed Array|[Go]({{< relref "/ChapterFour/1700~1799/1720.Decode-XORed-Array.md" >}})|Easy||||85.5%|
 |1734|Decode XORed Permutation|[Go]({{< relref "/ChapterFour/1700~1799/1734.Decode-XORed-Permutation.md" >}})|Medium||||56.7%|
 |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
 
diff --git a/website/content/ChapterTwo/Breadth_First_Search.md b/website/content/ChapterTwo/Breadth_First_Search.md
index 39682696e..4aa49b9ed 100644
--- a/website/content/ChapterTwo/Breadth_First_Search.md
+++ b/website/content/ChapterTwo/Breadth_First_Search.md
@@ -9,11 +9,11 @@ weight: 10
 
 | No.      | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity |Favorite| Acceptance |
 |:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
-|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||49.0%|
+|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||49.1%|
 |0102|Binary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md" >}})|Medium| O(n)| O(1)||57.9%|
 |0103|Binary Tree Zigzag Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})|Medium| O(n)| O(n)||51.0%|
 |0107|Binary Tree Level Order Traversal II|[Go]({{< relref "/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})|Medium| O(n)| O(1)||56.1%|
-|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||40.3%|
+|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||40.4%|
 |0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|24.2%|
 |0127|Word Ladder|[Go]({{< relref "/ChapterFour/0100~0199/0127.Word-Ladder.md" >}})|Hard| O(n)| O(n)||32.7%|
 |0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||30.4%|
@@ -27,10 +27,10 @@ weight: 10
 |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.8%|
 |0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||62.1%|
 |0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium| O(n)| O(1)||41.5%|
-|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Easy||||59.7%|
-|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||49.0%|
+|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Easy||||59.8%|
+|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||49.1%|
 |0815|Bus Routes|[Go]({{< relref "/ChapterFour/0800~0899/0815.Bus-Routes.md" >}})|Hard||||43.8%|
-|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||58.6%|
+|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||58.7%|
 |0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||42.8%|
 |0987|Vertical Order Traversal of a Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree.md" >}})|Hard||||39.3%|
 |0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md" >}})|Easy| O(n)| O(1)||52.4%|
diff --git a/website/content/ChapterTwo/Depth_First_Search.md b/website/content/ChapterTwo/Depth_First_Search.md
index 640271c33..817c8f7ca 100644
--- a/website/content/ChapterTwo/Depth_First_Search.md
+++ b/website/content/ChapterTwo/Depth_First_Search.md
@@ -13,14 +13,14 @@ weight: 9
 |0098|Validate Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||29.2%|
 |0099|Recover Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||43.4%|
 |0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy| O(n)| O(1)||54.5%|
-|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||49.0%|
+|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||49.1%|
 |0104|Maximum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||69.0%|
 |0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md" >}})|Medium||||53.8%|
 |0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md" >}})|Medium||||51.0%|
 |0108|Convert Sorted Array to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})|Easy| O(n)| O(1)||61.8%|
 |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)||52.4%|
 |0110|Balanced Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md" >}})|Easy| O(n)| O(1)||45.1%|
-|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||40.3%|
+|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||40.4%|
 |0112|Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0112.Path-Sum.md" >}})|Easy| O(n)| O(1)||43.1%|
 |0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium| O(n)| O(1)||50.3%|
 |0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium| O(n)| O(1)||53.8%|
@@ -45,27 +45,27 @@ weight: 9
 |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.8%|
 |0526|Beautiful Arrangement|[Go]({{< relref "/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md" >}})|Medium||||62.4%|
 |0529|Minesweeper|[Go]({{< relref "/ChapterFour/0500~0599/0529.Minesweeper.md" >}})|Medium||||62.1%|
-|0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||60.5%|
+|0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||60.6%|
 |0542|01 Matrix|[Go]({{< relref "/ChapterFour/0500~0599/0542.01-Matrix.md" >}})|Medium| O(n)| O(1)||41.5%|
 |0547|Number of Provinces|[Go]({{< relref "/ChapterFour/0500~0599/0547.Number-of-Provinces.md" >}})|Medium||||61.3%|
 |0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||53.9%|
 |0638|Shopping Offers|[Go]({{< relref "/ChapterFour/0600~0699/0638.Shopping-Offers.md" >}})|Medium||||53.7%|
 |0685|Redundant Connection II|[Go]({{< relref "/ChapterFour/0600~0699/0685.Redundant-Connection-II.md" >}})|Hard||||33.2%|
-|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Easy||||59.7%|
-|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||66.7%|
+|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Easy||||59.8%|
+|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||66.6%|
 |0721|Accounts Merge|[Go]({{< relref "/ChapterFour/0700~0799/0721.Accounts-Merge.md" >}})|Medium||||53.0%|
 |0733|Flood Fill|[Go]({{< relref "/ChapterFour/0700~0799/0733.Flood-Fill.md" >}})|Easy||||56.1%|
 |0753|Cracking the Safe|[Go]({{< relref "/ChapterFour/0700~0799/0753.Cracking-the-Safe.md" >}})|Hard||||52.9%|
 |0756|Pyramid Transition Matrix|[Go]({{< relref "/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md" >}})|Medium||||55.9%|
 |0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||55.3%|
 |0783|Minimum Distance Between BST Nodes|[Go]({{< relref "/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md" >}})|Easy||||54.6%|
-|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||49.0%|
+|0785|Is Graph Bipartite?|[Go]({{< relref "/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md" >}})|Medium||||49.1%|
 |0802|Find Eventual Safe States|[Go]({{< relref "/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md" >}})|Medium||||50.5%|
 |0834|Sum of Distances in Tree|[Go]({{< relref "/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md" >}})|Hard||||47.3%|
 |0839|Similar String Groups|[Go]({{< relref "/ChapterFour/0800~0899/0839.Similar-String-Groups.md" >}})|Hard||||42.6%|
 |0841|Keys and Rooms|[Go]({{< relref "/ChapterFour/0800~0899/0841.Keys-and-Rooms.md" >}})|Medium||||66.8%|
 |0851|Loud and Rich|[Go]({{< relref "/ChapterFour/0800~0899/0851.Loud-and-Rich.md" >}})|Medium||||53.1%|
-|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||58.6%|
+|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||58.7%|
 |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.9%|
 |0924|Minimize Malware Spread|[Go]({{< relref "/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md" >}})|Hard||||41.8%|
@@ -82,9 +82,9 @@ weight: 9
 |1026|Maximum Difference Between Node and Ancestor|[Go]({{< relref "/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})|Medium||||70.1%|
 |1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||71.3%|
 |1038|Binary Search Tree to Greater Sum Tree|[Go]({{< relref "/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md" >}})|Medium||||83.1%|
-|1110|Delete Nodes And Return Forest|[Go]({{< relref "/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md" >}})|Medium||||68.1%|
+|1110|Delete Nodes And Return Forest|[Go]({{< relref "/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md" >}})|Medium||||68.2%|
 |1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||68.4%|
-|1145|Binary Tree Coloring Game|[Go]({{< relref "/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md" >}})|Medium||||51.1%|
+|1145|Binary Tree Coloring Game|[Go]({{< relref "/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md" >}})|Medium||||51.2%|
 |1203|Sort Items by Groups Respecting Dependencies|[Go]({{< relref "/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md" >}})|Hard||||48.3%|
 |1254|Number of Closed Islands|[Go]({{< relref "/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md" >}})|Medium||||62.2%|
 |1302|Deepest Leaves Sum|[Go]({{< relref "/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md" >}})|Medium||||85.4%|
diff --git a/website/content/ChapterTwo/Dynamic_Programming.md b/website/content/ChapterTwo/Dynamic_Programming.md
index df96af031..10da26ad7 100644
--- a/website/content/ChapterTwo/Dynamic_Programming.md
+++ b/website/content/ChapterTwo/Dynamic_Programming.md
@@ -21,7 +21,7 @@ weight: 7
 |0095|Unique Binary Search Trees II|[Go]({{< relref "/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md" >}})|Medium||||43.8%|
 |0096|Unique Binary Search Trees|[Go]({{< relref "/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md" >}})|Medium| O(n)| O(n)||55.2%|
 |0097|Interleaving String|[Go]({{< relref "/ChapterFour/0001~0099/0097.Interleaving-String.md" >}})|Medium||||33.6%|
-|0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||40.3%|
+|0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||40.4%|
 |0120|Triangle|[Go]({{< relref "/ChapterFour/0100~0199/0120.Triangle.md" >}})|Medium| O(n^2)| O(n)||47.3%|
 |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)||52.1%|
 |0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium||||53.7%|
@@ -58,7 +58,7 @@ weight: 7
 |0746|Min Cost Climbing Stairs|[Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}})|Easy| O(n)| O(1)||53.5%|
 |0838|Push Dominoes|[Go]({{< relref "/ChapterFour/0800~0899/0838.Push-Dominoes.md" >}})|Medium| O(n)| O(n)||50.4%|
 |0877|Stone Game|[Go]({{< relref "/ChapterFour/0800~0899/0877.Stone-Game.md" >}})|Medium||||67.6%|
-|0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||26.9%|
+|0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||27.0%|
 |0898|Bitwise ORs of Subarrays|[Go]({{< relref "/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md" >}})|Medium||||35.0%|
 |0920|Number of Music Playlists|[Go]({{< relref "/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md" >}})|Hard||||48.4%|
 |0968|Binary Tree Cameras|[Go]({{< relref "/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md" >}})|Hard||||40.6%|
diff --git a/website/content/ChapterTwo/Hash_Table.md b/website/content/ChapterTwo/Hash_Table.md
index 924888f88..4559d5206 100644
--- a/website/content/ChapterTwo/Hash_Table.md
+++ b/website/content/ChapterTwo/Hash_Table.md
@@ -29,7 +29,7 @@ weight: 13
 |0242|Valid Anagram|[Go]({{< relref "/ChapterFour/0200~0299/0242.Valid-Anagram.md" >}})|Easy| O(n)| O(n) ||59.3%|
 |0274|H-Index|[Go]({{< relref "/ChapterFour/0200~0299/0274.H-Index.md" >}})|Medium|  O(n)| O(n) ||36.6%|
 |0290|Word Pattern|[Go]({{< relref "/ChapterFour/0200~0299/0290.Word-Pattern.md" >}})|Easy|  O(n)| O(n) ||38.6%|
-|0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium|  O(n)| O(n) ||62.9%|
+|0347|Top K Frequent Elements|[Go]({{< relref "/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md" >}})|Medium|  O(n)| O(n) ||63.0%|
 |0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||66.1%|
 |0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||52.5%|
 |0387|First Unique Character in a String|[Go]({{< relref "/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md" >}})|Easy||||54.5%|
@@ -51,9 +51,9 @@ weight: 13
 |0609|Find Duplicate File in System|[Go]({{< relref "/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md" >}})|Medium||||63.0%|
 |0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||55.2%|
 |0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||40.9%|
-|0648|Replace Words|[Go]({{< relref "/ChapterFour/0600~0699/0648.Replace-Words.md" >}})|Medium| O(n)| O(n) ||59.7%|
+|0648|Replace Words|[Go]({{< relref "/ChapterFour/0600~0699/0648.Replace-Words.md" >}})|Medium| O(n)| O(n) ||59.8%|
 |0676|Implement Magic Dictionary|[Go]({{< relref "/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md" >}})|Medium| O(n)| O(n) ||55.5%|
-|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Easy||||59.7%|
+|0690|Employee Importance|[Go]({{< relref "/ChapterFour/0600~0699/0690.Employee-Importance.md" >}})|Easy||||59.8%|
 |0692|Top K Frequent Words|[Go]({{< relref "/ChapterFour/0600~0699/0692.Top-K-Frequent-Words.md" >}})|Medium||||53.5%|
 |0705|Design HashSet|[Go]({{< relref "/ChapterFour/0700~0799/0705.Design-HashSet.md" >}})|Easy||||63.9%|
 |0706|Design HashMap|[Go]({{< relref "/ChapterFour/0700~0799/0706.Design-HashMap.md" >}})|Easy||||63.9%|
@@ -81,13 +81,13 @@ weight: 13
 |1078|Occurrences After Bigram|[Go]({{< relref "/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md" >}})|Easy||||64.8%|
 |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||||40.3%|
-|1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||62.1%|
+|1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||62.0%|
 |1207|Unique Number of Occurrences|[Go]({{< relref "/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md" >}})|Easy||||72.2%|
 |1512|Number of Good Pairs|[Go]({{< relref "/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md" >}})|Easy||||87.6%|
 |1539|Kth Missing Positive Number|[Go]({{< relref "/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md" >}})|Easy||||54.7%|
 |1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||55.5%|
 |1679|Max Number of K-Sum Pairs|[Go]({{< relref "/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md" >}})|Medium||||53.6%|
-|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||74.7%|
+|1748|Sum of Unique Elements|[Go]({{< relref "/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements.md" >}})|Easy||||74.6%|
 |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
 
 
diff --git a/website/content/ChapterTwo/Linked_List.md b/website/content/ChapterTwo/Linked_List.md
index d807bb013..c6dd1f49d 100644
--- a/website/content/ChapterTwo/Linked_List.md
+++ b/website/content/ChapterTwo/Linked_List.md
@@ -32,7 +32,7 @@ weight: 4
 |0061|Rotate List|[Go]({{< relref "/ChapterFour/0001~0099/0061.Rotate-List.md" >}})|Medium| O(n)| O(1)||32.3%|
 |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)||40.0%|
 |0083|Remove Duplicates from Sorted List|[Go]({{< relref "/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md" >}})|Easy| O(n)| O(1)||47.0%|
-|0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|45.3%|
+|0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|45.4%|
 |0092|Reverse Linked List II|[Go]({{< relref "/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md" >}})|Medium| O(n)| O(1)|❤️|41.2%|
 |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)||52.4%|
 |0138|Copy List with Random Pointer|[Go]({{< relref "/ChapterFour/0100~0199/0138.Copy-List-with-Random-Pointer.md" >}})|Medium||||42.5%|
diff --git a/website/content/ChapterTwo/Math.md b/website/content/ChapterTwo/Math.md
index 3d727455f..5c5773de5 100644
--- a/website/content/ChapterTwo/Math.md
+++ b/website/content/ChapterTwo/Math.md
@@ -11,12 +11,12 @@ weight: 12
 |:--------:|:------- | :--------: | :----------: | :----: | :-----: | :-----: |:-----: |
 |0002|Add Two Numbers|[Go]({{< relref "/ChapterFour/0001~0099/0002.Add-Two-Numbers.md" >}})|Medium| O(n)| O(1)||36.2%|
 |0007|Reverse Integer|[Go]({{< relref "/ChapterFour/0001~0099/0007.Reverse-Integer.md" >}})|Easy||||26.0%|
-|0008|String to Integer (atoi)|[Go]({{< relref "/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md" >}})|Medium||||15.8%|
-|0009|Palindrome Number|[Go]({{< relref "/ChapterFour/0001~0099/0009.Palindrome-Number.md" >}})|Easy||||50.5%|
+|0008|String to Integer (atoi)|[Go]({{< relref "/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md" >}})|Medium||||15.9%|
+|0009|Palindrome Number|[Go]({{< relref "/ChapterFour/0001~0099/0009.Palindrome-Number.md" >}})|Easy||||50.6%|
 |0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||57.5%|
 |0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||57.3%|
 |0029|Divide Two Integers|[Go]({{< relref "/ChapterFour/0001~0099/0029.Divide-Two-Integers.md" >}})|Medium||||17.0%|
-|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||35.4%|
+|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||35.5%|
 |0050|Pow(x, n)|[Go]({{< relref "/ChapterFour/0001~0099/0050.Powx-n.md" >}})|Medium| O(log n)| O(1)||31.3%|
 |0060|Permutation Sequence|[Go]({{< relref "/ChapterFour/0001~0099/0060.Permutation-Sequence.md" >}})|Hard| O(n log n)| O(1)||40.0%|
 |0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||47.8%|
@@ -26,7 +26,7 @@ weight: 12
 |0172|Factorial Trailing Zeroes|[Go]({{< relref "/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md" >}})|Easy||||39.2%|
 |0202|Happy Number|[Go]({{< relref "/ChapterFour/0200~0299/0202.Happy-Number.md" >}})|Easy| O(log n)| O(1)||51.7%|
 |0204|Count Primes|[Go]({{< relref "/ChapterFour/0200~0299/0204.Count-Primes.md" >}})|Easy||||32.8%|
-|0223|Rectangle Area|[Go]({{< relref "/ChapterFour/0200~0299/0223.Rectangle-Area.md" >}})|Medium||||38.6%|
+|0223|Rectangle Area|[Go]({{< relref "/ChapterFour/0200~0299/0223.Rectangle-Area.md" >}})|Medium||||38.7%|
 |0224|Basic Calculator|[Go]({{< relref "/ChapterFour/0200~0299/0224.Basic-Calculator.md" >}})|Hard| O(n)| O(n)||38.6%|
 |0231|Power of Two|[Go]({{< relref "/ChapterFour/0200~0299/0231.Power-of-Two.md" >}})|Easy| O(1)| O(1)||43.8%|
 |0258|Add Digits|[Go]({{< relref "/ChapterFour/0200~0299/0258.Add-Digits.md" >}})|Easy||||59.1%|
@@ -43,7 +43,7 @@ weight: 12
 |0397|Integer Replacement|[Go]({{< relref "/ChapterFour/0300~0399/0397.Integer-Replacement.md" >}})|Medium||||33.7%|
 |0413|Arithmetic Slices|[Go]({{< relref "/ChapterFour/0400~0499/0413.Arithmetic-Slices.md" >}})|Medium||||60.2%|
 |0423|Reconstruct Original Digits from English|[Go]({{< relref "/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English.md" >}})|Medium||||51.2%|
-|0441|Arranging Coins|[Go]({{< relref "/ChapterFour/0400~0499/0441.Arranging-Coins.md" >}})|Easy||||42.8%|
+|0441|Arranging Coins|[Go]({{< relref "/ChapterFour/0400~0499/0441.Arranging-Coins.md" >}})|Easy||||42.9%|
 |0447|Number of Boomerangs|[Go]({{< relref "/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md" >}})|Medium||||52.7%|
 |0453|Minimum Moves to Equal Array Elements|[Go]({{< relref "/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md" >}})|Easy||||51.6%|
 |0462|Minimum Moves to Equal Array Elements II|[Go]({{< relref "/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II.md" >}})|Medium||||55.6%|
@@ -58,23 +58,23 @@ weight: 12
 |0633|Sum of Square Numbers|[Go]({{< relref "/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md" >}})|Medium||||32.9%|
 |0645|Set Mismatch|[Go]({{< relref "/ChapterFour/0600~0699/0645.Set-Mismatch.md" >}})|Easy||||40.9%|
 |0753|Cracking the Safe|[Go]({{< relref "/ChapterFour/0700~0799/0753.Cracking-the-Safe.md" >}})|Hard||||52.9%|
-|0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||46.0%|
+|0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||46.1%|
 |0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||56.2%|
-|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||51.0%|
+|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||50.9%|
 |0812|Largest Triangle Area|[Go]({{< relref "/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md" >}})|Easy||||59.2%|
 |0836|Rectangle Overlap|[Go]({{< relref "/ChapterFour/0800~0899/0836.Rectangle-Overlap.md" >}})|Easy||||42.7%|
 |0869|Reordered Power of 2|[Go]({{< relref "/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md" >}})|Medium||||61.2%|
 |0877|Stone Game|[Go]({{< relref "/ChapterFour/0800~0899/0877.Stone-Game.md" >}})|Medium||||67.6%|
-|0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||29.0%|
+|0878|Nth Magical Number|[Go]({{< relref "/ChapterFour/0800~0899/0878.Nth-Magical-Number.md" >}})|Hard||||29.1%|
 |0885|Spiral Matrix III|[Go]({{< relref "/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md" >}})|Medium| O(n^2)| O(1)||71.3%|
-|0887|Super Egg Drop|[Go]({{< relref "/ChapterFour/0800~0899/0887.Super-Egg-Drop.md" >}})|Hard||||26.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.4%|
 |0892|Surface Area of 3D Shapes|[Go]({{< relref "/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md" >}})|Easy||||60.2%|
 |0910|Smallest Range II|[Go]({{< relref "/ChapterFour/0900~0999/0910.Smallest-Range-II.md" >}})|Medium||||31.3%|
 |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||||33.7%|
 |0927|Three Equal Parts|[Go]({{< relref "/ChapterFour/0900~0999/0927.Three-Equal-Parts.md" >}})|Hard||||34.8%|
 |0942|DI String Match|[Go]({{< relref "/ChapterFour/0900~0999/0942.DI-String-Match.md" >}})|Easy| O(n)| O(1)||74.1%|
-|0949|Largest Time for Given Digits|[Go]({{< relref "/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md" >}})|Medium||||36.0%|
+|0949|Largest Time for Given Digits|[Go]({{< relref "/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md" >}})|Medium||||36.1%|
 |0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard||||36.5%|
 |0970|Powerful Integers|[Go]({{< relref "/ChapterFour/0900~0999/0970.Powerful-Integers.md" >}})|Medium||||43.4%|
 |0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy| O(n log n)| O(log n) ||59.4%|
@@ -84,11 +84,11 @@ weight: 12
 |1017|Convert to Base -2|[Go]({{< relref "/ChapterFour/1000~1099/1017.Convert-to-Base-2.md" >}})|Medium||||59.4%|
 |1025|Divisor Game|[Go]({{< relref "/ChapterFour/1000~1099/1025.Divisor-Game.md" >}})|Easy| O(1)| O(1)||66.2%|
 |1037|Valid Boomerang|[Go]({{< relref "/ChapterFour/1000~1099/1037.Valid-Boomerang.md" >}})|Easy||||37.4%|
-|1073|Adding Two Negabinary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md" >}})|Medium||||34.7%|
+|1073|Adding Two Negabinary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md" >}})|Medium||||34.8%|
 |1093|Statistics from a Large Sample|[Go]({{< relref "/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md" >}})|Medium||||47.8%|
 |1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||49.6%|
 |1175|Prime Arrangements|[Go]({{< relref "/ChapterFour/1100~1199/1175.Prime-Arrangements.md" >}})|Easy||||51.8%|
-|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||26.6%|
+|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||26.7%|
 |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||||70.7%|
 |1232|Check If It Is a Straight Line|[Go]({{< relref "/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md" >}})|Easy||||42.8%|
 |1281|Subtract the Product and Sum of Digits of an Integer|[Go]({{< relref "/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md" >}})|Easy||||85.6%|
@@ -100,7 +100,7 @@ weight: 12
 |1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||31.1%|
 |1680|Concatenation of Consecutive Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md" >}})|Medium||||52.2%|
 |1685|Sum of Absolute Differences in a Sorted Array|[Go]({{< relref "/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md" >}})|Medium||||63.4%|
-|1716|Calculate Money in Leetcode Bank|[Go]({{< relref "/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md" >}})|Easy||||64.0%|
+|1716|Calculate Money in Leetcode Bank|[Go]({{< relref "/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md" >}})|Easy||||64.1%|
 |1744|Can You Eat Your Favorite Candy on Your Favorite Day?|[Go]({{< relref "/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md" >}})|Medium||||31.3%|
 |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
 
diff --git a/website/content/ChapterTwo/Segment_Tree.md b/website/content/ChapterTwo/Segment_Tree.md
index 2209da814..6dd9a2f46 100644
--- a/website/content/ChapterTwo/Segment_Tree.md
+++ b/website/content/ChapterTwo/Segment_Tree.md
@@ -44,9 +44,9 @@ weight: 18
 |0493|Reverse Pairs|[Go]({{< relref "/ChapterFour/0400~0499/0493.Reverse-Pairs.md" >}})|Hard| O(n log n)| O(n)||27.7%|
 |0699|Falling Squares|[Go]({{< relref "/ChapterFour/0600~0699/0699.Falling-Squares.md" >}})|Hard| O(n log n)| O(n)|❤️|43.4%|
 |0715|Range Module|[Go]({{< relref "/ChapterFour/0700~0799/0715.Range-Module.md" >}})|Hard| O(log n)| O(n)|❤️|41.6%|
-|0732|My Calendar III|[Go]({{< relref "/ChapterFour/0700~0799/0732.My-Calendar-III.md" >}})|Hard| O(log n)| O(n)|❤️|63.4%|
+|0732|My Calendar III|[Go]({{< relref "/ChapterFour/0700~0799/0732.My-Calendar-III.md" >}})|Hard| O(log n)| O(n)|❤️|63.5%|
 |0850|Rectangle Area II|[Go]({{< relref "/ChapterFour/0800~0899/0850.Rectangle-Area-II.md" >}})|Hard| O(n log n)| O(n)|❤️|48.6%|
-|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard| O(log n)| O(n)|❤️|41.1%|
+|1157|Online Majority Element In Subarray|[Go]({{< relref "/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md" >}})|Hard| O(log n)| O(n)|❤️|41.2%|
 |1353|Maximum Number of Events That Can Be Attended|[Go]({{< relref "/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md" >}})|Medium||||30.6%|
 |1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||36.8%|
 |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
diff --git a/website/content/ChapterTwo/Sliding_Window.md b/website/content/ChapterTwo/Sliding_Window.md
index b3d8e5804..288529a0a 100644
--- a/website/content/ChapterTwo/Sliding_Window.md
+++ b/website/content/ChapterTwo/Sliding_Window.md
@@ -33,7 +33,7 @@ weight: 17
 |0076|Minimum Window Substring|[Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}})|Hard| O(n)| O(n)|❤️|36.6%|
 |0239|Sliding Window Maximum|[Go]({{< relref "/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md" >}})|Hard| O(n * k)| O(n)|❤️|45.1%|
 |0395|Longest Substring with At Least K Repeating Characters|[Go]({{< relref "/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters.md" >}})|Medium||||43.8%|
-|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium| O(n)| O(1) ||48.8%|
+|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium| O(n)| O(1) ||48.9%|
 |0480|Sliding Window Median|[Go]({{< relref "/ChapterFour/0400~0499/0480.Sliding-Window-Median.md" >}})|Hard| O(n * log k)| O(k)|❤️|39.5%|
 |0567|Permutation in String|[Go]({{< relref "/ChapterFour/0500~0599/0567.Permutation-in-String.md" >}})|Medium| O(n)| O(1)|❤️|44.6%|
 |0978|Longest Turbulent Subarray|[Go]({{< relref "/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md" >}})|Medium| O(n)| O(1)|❤️|46.7%|
diff --git a/website/content/ChapterTwo/Sort.md b/website/content/ChapterTwo/Sort.md
index 8fe64e7c8..144b95c4e 100644
--- a/website/content/ChapterTwo/Sort.md
+++ b/website/content/ChapterTwo/Sort.md
@@ -42,15 +42,15 @@ weight: 14
 |0969|Pancake Sorting|[Go]({{< relref "/ChapterFour/0900~0999/0969.Pancake-Sorting.md" >}})|Medium| O(n log n)| O(log n) |❤️|69.0%|
 |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) ||65.0%|
 |0976|Largest Perimeter Triangle|[Go]({{< relref "/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md" >}})|Easy| O(n log n)| O(log n) ||59.4%|
-|1030|Matrix Cells in Distance Order|[Go]({{< relref "/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md" >}})|Easy| O(n^2)| O(1) ||68.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) ||68.5%|
 |1054|Distant Barcodes|[Go]({{< relref "/ChapterFour/1000~1099/1054.Distant-Barcodes.md" >}})|Medium| O(n log n)| O(log n) |❤️|44.6%|
 |1122|Relative Sort Array|[Go]({{< relref "/ChapterFour/1100~1199/1122.Relative-Sort-Array.md" >}})|Easy||||68.0%|
 |1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||48.2%|
 |1305|All Elements in Two Binary Search Trees|[Go]({{< relref "/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md" >}})|Medium||||77.9%|
 |1329|Sort the Matrix Diagonally|[Go]({{< relref "/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md" >}})|Medium||||81.4%|
 |1353|Maximum Number of Events That Can Be Attended|[Go]({{< relref "/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended.md" >}})|Medium||||30.6%|
-|1383|Maximum Performance of a Team|[Go]({{< relref "/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md" >}})|Hard||||41.2%|
-|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||67.1%|
+|1383|Maximum Performance of a Team|[Go]({{< relref "/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team.md" >}})|Hard||||41.3%|
+|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||67.2%|
 |1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||55.5%|
 |1647|Minimum Deletions to Make Character Frequencies Unique|[Go]({{< relref "/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md" >}})|Medium||||55.7%|
 |1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||31.1%|
diff --git a/website/content/ChapterTwo/Stack.md b/website/content/ChapterTwo/Stack.md
index 2fdadd50c..c6d4af2bd 100644
--- a/website/content/ChapterTwo/Stack.md
+++ b/website/content/ChapterTwo/Stack.md
@@ -40,7 +40,7 @@ weight: 5
 |0456|132 Pattern|[Go]({{< relref "/ChapterFour/0400~0499/0456.132-Pattern.md" >}})|Medium| O(n)| O(n)||30.7%|
 |0496|Next Greater Element I|[Go]({{< relref "/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md" >}})|Easy| O(n)| O(n)||66.4%|
 |0503|Next Greater Element II|[Go]({{< relref "/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md" >}})|Medium| O(n)| O(n)||59.3%|
-|0636|Exclusive Time of Functions|[Go]({{< relref "/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md" >}})|Medium| O(n)| O(n)||55.9%|
+|0636|Exclusive Time of Functions|[Go]({{< relref "/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md" >}})|Medium| O(n)| O(n)||56.0%|
 |0682|Baseball Game|[Go]({{< relref "/ChapterFour/0600~0699/0682.Baseball-Game.md" >}})|Easy| O(n)| O(n)||67.9%|
 |0726|Number of Atoms|[Go]({{< relref "/ChapterFour/0700~0799/0726.Number-of-Atoms.md" >}})|Hard| O(n)| O(n) |❤️|51.1%|
 |0735|Asteroid Collision|[Go]({{< relref "/ChapterFour/0700~0799/0735.Asteroid-Collision.md" >}})|Medium| O(n)| O(n) ||43.5%|
@@ -56,7 +56,7 @@ weight: 5
 |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)||57.0%|
 |1019|Next Greater Node In Linked List|[Go]({{< relref "/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md" >}})|Medium| O(n)| O(1)||58.4%|
 |1021|Remove Outermost Parentheses|[Go]({{< relref "/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md" >}})|Easy| O(n)| O(1)||79.3%|
-|1047|Remove All Adjacent Duplicates In String|[Go]({{< relref "/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})|Easy| O(n)| O(1)||71.7%|
+|1047|Remove All Adjacent Duplicates In String|[Go]({{< relref "/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})|Easy| O(n)| O(1)||71.6%|
 |1190|Reverse Substrings Between Each Pair of Parentheses|[Go]({{< relref "/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md" >}})|Medium||||64.6%|
 |1209|Remove All Adjacent Duplicates in String II|[Go]({{< relref "/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md" >}})|Medium||||57.1%|
 |1249|Minimum Remove to Make Valid Parentheses|[Go]({{< relref "/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})|Medium||||64.4%|
diff --git a/website/content/ChapterTwo/String.md b/website/content/ChapterTwo/String.md
index 0699a4807..c1ee6da31 100644
--- a/website/content/ChapterTwo/String.md
+++ b/website/content/ChapterTwo/String.md
@@ -12,7 +12,7 @@ weight: 2
 |0003|Longest Substring Without Repeating Characters|[Go]({{< relref "/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md" >}})|Medium| O(n)| O(1)|❤️|31.8%|
 |0005|Longest Palindromic Substring|[Go]({{< relref "/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring.md" >}})|Medium||||30.9%|
 |0006|ZigZag Conversion|[Go]({{< relref "/ChapterFour/0001~0099/0006.ZigZag-Conversion.md" >}})|Medium||||38.8%|
-|0008|String to Integer (atoi)|[Go]({{< relref "/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md" >}})|Medium||||15.8%|
+|0008|String to Integer (atoi)|[Go]({{< relref "/ChapterFour/0001~0099/0008.String-to-Integer-atoi.md" >}})|Medium||||15.9%|
 |0012|Integer to Roman|[Go]({{< relref "/ChapterFour/0001~0099/0012.Integer-to-Roman.md" >}})|Medium||||57.5%|
 |0013|Roman to Integer|[Go]({{< relref "/ChapterFour/0001~0099/0013.Roman-to-Integer.md" >}})|Easy||||57.3%|
 |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)||50.5%|
@@ -21,7 +21,7 @@ weight: 2
 |0028|Implement strStr()|[Go]({{< relref "/ChapterFour/0001~0099/0028.Implement-strStr.md" >}})|Easy| O(n)| O(1)||35.6%|
 |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.7%|
 |0032|Longest Valid Parentheses|[Go]({{< relref "/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses.md" >}})|Hard||||30.1%|
-|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||35.4%|
+|0043|Multiply Strings|[Go]({{< relref "/ChapterFour/0001~0099/0043.Multiply-Strings.md" >}})|Medium||||35.5%|
 |0049|Group Anagrams|[Go]({{< relref "/ChapterFour/0001~0099/0049.Group-Anagrams.md" >}})|Medium| O(n log n)| O(n)||60.5%|
 |0067|Add Binary|[Go]({{< relref "/ChapterFour/0001~0099/0067.Add-Binary.md" >}})|Easy||||47.8%|
 |0071|Simplify Path|[Go]({{< relref "/ChapterFour/0001~0099/0071.Simplify-Path.md" >}})|Medium| O(n)| O(n)||35.3%|
@@ -29,7 +29,7 @@ weight: 2
 |0091|Decode Ways|[Go]({{< relref "/ChapterFour/0001~0099/0091.Decode-Ways.md" >}})|Medium| O(n)| O(n)||27.4%|
 |0093|Restore IP Addresses|[Go]({{< relref "/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md" >}})|Medium| O(n)| O(n)|❤️|38.5%|
 |0097|Interleaving String|[Go]({{< relref "/ChapterFour/0001~0099/0097.Interleaving-String.md" >}})|Medium||||33.6%|
-|0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||40.3%|
+|0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||40.4%|
 |0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||39.0%|
 |0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|24.2%|
 |0151|Reverse Words in a String|[Go]({{< relref "/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md" >}})|Medium||||24.8%|
@@ -40,7 +40,7 @@ weight: 2
 |0387|First Unique Character in a String|[Go]({{< relref "/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md" >}})|Easy||||54.5%|
 |0537|Complex Number Multiplication|[Go]({{< relref "/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md" >}})|Medium||||68.5%|
 |0541|Reverse String II|[Go]({{< relref "/ChapterFour/0500~0599/0541.Reverse-String-II.md" >}})|Easy||||49.7%|
-|0557|Reverse Words in a String III|[Go]({{< relref "/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md" >}})|Easy||||73.0%|
+|0557|Reverse Words in a String III|[Go]({{< relref "/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md" >}})|Easy||||73.1%|
 |0583|Delete Operation for Two Strings|[Go]({{< relref "/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings.md" >}})|Medium||||52.1%|
 |0609|Find Duplicate File in System|[Go]({{< relref "/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System.md" >}})|Medium||||63.0%|
 |0632|Smallest Range Covering Elements from K Lists|[Go]({{< relref "/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md" >}})|Hard||||55.2%|
@@ -59,7 +59,7 @@ weight: 2
 |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)||57.0%|
 |1108|Defanging an IP Address|[Go]({{< relref "/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md" >}})|Easy||||88.5%|
 |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||||60.5%|
-|1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||62.1%|
+|1189|Maximum Number of Balloons|[Go]({{< relref "/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md" >}})|Easy||||62.0%|
 |1221|Split a String in Balanced Strings|[Go]({{< relref "/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md" >}})|Easy||||84.4%|
 |1234|Replace the Substring for Balanced String|[Go]({{< relref "/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md" >}})|Medium||||34.8%|
 |1249|Minimum Remove to Make Valid Parentheses|[Go]({{< relref "/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})|Medium||||64.4%|
diff --git a/website/content/ChapterTwo/Tree.md b/website/content/ChapterTwo/Tree.md
index 6f899f801..0f227c101 100644
--- a/website/content/ChapterTwo/Tree.md
+++ b/website/content/ChapterTwo/Tree.md
@@ -15,7 +15,7 @@ weight: 6
 |0098|Validate Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||29.2%|
 |0099|Recover Binary Search Tree|[Go]({{< relref "/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md" >}})|Medium| O(n)| O(1)||43.4%|
 |0100|Same Tree|[Go]({{< relref "/ChapterFour/0100~0199/0100.Same-Tree.md" >}})|Easy| O(n)| O(1)||54.5%|
-|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||49.0%|
+|0101|Symmetric Tree|[Go]({{< relref "/ChapterFour/0100~0199/0101.Symmetric-Tree.md" >}})|Easy| O(n)| O(1)||49.1%|
 |0102|Binary Tree Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md" >}})|Medium| O(n)| O(1)||57.9%|
 |0103|Binary Tree Zigzag Level Order Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}})|Medium| O(n)| O(n)||51.0%|
 |0104|Maximum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||69.0%|
@@ -24,7 +24,7 @@ weight: 6
 |0107|Binary Tree Level Order Traversal II|[Go]({{< relref "/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md" >}})|Medium| O(n)| O(1)||56.1%|
 |0108|Convert Sorted Array to Binary Search Tree|[Go]({{< relref "/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md" >}})|Easy| O(n)| O(1)||61.8%|
 |0110|Balanced Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md" >}})|Easy| O(n)| O(1)||45.1%|
-|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||40.3%|
+|0111|Minimum Depth of Binary Tree|[Go]({{< relref "/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md" >}})|Easy| O(n)| O(1)||40.4%|
 |0112|Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0112.Path-Sum.md" >}})|Easy| O(n)| O(1)||43.1%|
 |0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium| O(n)| O(1)||50.3%|
 |0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium| O(n)| O(1)||53.8%|
@@ -40,7 +40,7 @@ weight: 6
 |0235|Lowest Common Ancestor of a Binary Search Tree|[Go]({{< relref "/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md" >}})|Easy| O(n)| O(1)||52.8%|
 |0236|Lowest Common Ancestor of a Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md" >}})|Medium| O(n)| O(1)||50.4%|
 |0257|Binary Tree Paths|[Go]({{< relref "/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md" >}})|Easy| O(n)| O(1)||54.9%|
-|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||50.9%|
+|0297|Serialize and Deserialize Binary Tree|[Go]({{< relref "/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree.md" >}})|Hard||||51.0%|
 |0337|House Robber III|[Go]({{< relref "/ChapterFour/0300~0399/0337.House-Robber-III.md" >}})|Medium||||52.1%|
 |0404|Sum of Left Leaves|[Go]({{< relref "/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md" >}})|Easy| O(n)| O(1)||52.6%|
 |0437|Path Sum III|[Go]({{< relref "/ChapterFour/0400~0499/0437.Path-Sum-III.md" >}})|Medium| O(n)| O(1)||48.6%|
@@ -48,12 +48,12 @@ weight: 6
 |0513|Find Bottom Left Tree Value|[Go]({{< relref "/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md" >}})|Medium||||63.3%|
 |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.8%|
 |0530|Minimum Absolute Difference in BST|[Go]({{< relref "/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST.md" >}})|Easy||||55.3%|
-|0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||60.5%|
+|0538|Convert BST to Greater Tree|[Go]({{< relref "/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree.md" >}})|Medium||||60.6%|
 |0563|Binary Tree Tilt|[Go]({{< relref "/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md" >}})|Easy||||53.9%|
 |0572|Subtree of Another Tree|[Go]({{< relref "/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md" >}})|Easy||||44.6%|
 |0589|N-ary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})|Easy||||74.6%|
 |0623|Add One Row to Tree|[Go]({{< relref "/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree.md" >}})|Medium||||53.2%|
-|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.5%|
+|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.6%|
 |0653|Two Sum IV - Input is a BST|[Go]({{< relref "/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST.md" >}})|Easy||||56.6%|
 |0662|Maximum Width of Binary Tree|[Go]({{< relref "/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md" >}})|Medium||||39.6%|
 |0669|Trim a Binary Search Tree|[Go]({{< relref "/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree.md" >}})|Medium||||64.4%|
@@ -61,7 +61,7 @@ weight: 6
 |0685|Redundant Connection II|[Go]({{< relref "/ChapterFour/0600~0699/0685.Redundant-Connection-II.md" >}})|Hard||||33.2%|
 |0783|Minimum Distance Between BST Nodes|[Go]({{< relref "/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes.md" >}})|Easy||||54.6%|
 |0834|Sum of Distances in Tree|[Go]({{< relref "/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md" >}})|Hard||||47.3%|
-|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||58.6%|
+|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||58.7%|
 |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.9%|
 |0938|Range Sum of BST|[Go]({{< relref "/ChapterFour/0900~0999/0938.Range-Sum-of-BST.md" >}})|Easy||||83.5%|
@@ -73,11 +73,12 @@ weight: 6
 |1026|Maximum Difference Between Node and Ancestor|[Go]({{< relref "/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md" >}})|Medium||||70.1%|
 |1028|Recover a Tree From Preorder Traversal|[Go]({{< relref "/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md" >}})|Hard||||71.3%|
 |1038|Binary Search Tree to Greater Sum Tree|[Go]({{< relref "/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree.md" >}})|Medium||||83.1%|
-|1110|Delete Nodes And Return Forest|[Go]({{< relref "/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md" >}})|Medium||||68.1%|
+|1110|Delete Nodes And Return Forest|[Go]({{< relref "/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md" >}})|Medium||||68.2%|
 |1123|Lowest Common Ancestor of Deepest Leaves|[Go]({{< relref "/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md" >}})|Medium||||68.4%|
-|1145|Binary Tree Coloring Game|[Go]({{< relref "/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md" >}})|Medium||||51.1%|
+|1145|Binary Tree Coloring Game|[Go]({{< relref "/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md" >}})|Medium||||51.2%|
 |1302|Deepest Leaves Sum|[Go]({{< relref "/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md" >}})|Medium||||85.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.9%|
+|1600|Throne Inheritance|[Go]({{< relref "/ChapterFour/1600~1699/1600.Throne-Inheritance.md" >}})|Medium||||61.4%|
 |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|
 
 
diff --git a/website/content/ChapterTwo/Two_Pointers.md b/website/content/ChapterTwo/Two_Pointers.md
index 016d313e2..4e388360d 100644
--- a/website/content/ChapterTwo/Two_Pointers.md
+++ b/website/content/ChapterTwo/Two_Pointers.md
@@ -47,7 +47,7 @@ weight: 3
 |0075|Sort Colors|[Go]({{< relref "/ChapterFour/0001~0099/0075.Sort-Colors.md" >}})|Medium| O(n)| O(1)|❤️|50.6%|
 |0076|Minimum Window Substring|[Go]({{< relref "/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md" >}})|Hard| O(n)| O(n)|❤️|36.6%|
 |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.8%|
-|0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|45.3%|
+|0086|Partition List|[Go]({{< relref "/ChapterFour/0001~0099/0086.Partition-List.md" >}})|Medium| O(n)| O(1)|❤️|45.4%|
 |0088|Merge Sorted Array|[Go]({{< relref "/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md" >}})|Easy| O(n)| O(1)|❤️|41.2%|
 |0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||39.0%|
 |0141|Linked List Cycle|[Go]({{< relref "/ChapterFour/0100~0199/0141.Linked-List-Cycle.md" >}})|Easy| O(n)| O(1)|❤️|43.5%|
@@ -61,7 +61,7 @@ weight: 3
 |0345|Reverse Vowels of a String|[Go]({{< relref "/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md" >}})|Easy| O(n)| O(1)||45.6%|
 |0349|Intersection of Two Arrays|[Go]({{< relref "/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md" >}})|Easy| O(n)| O(n) ||66.1%|
 |0350|Intersection of Two Arrays II|[Go]({{< relref "/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md" >}})|Easy| O(n)| O(n) ||52.5%|
-|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium| O(n)| O(1) ||48.8%|
+|0424|Longest Repeating Character Replacement|[Go]({{< relref "/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md" >}})|Medium| O(n)| O(1) ||48.9%|
 |0457|Circular Array Loop|[Go]({{< relref "/ChapterFour/0400~0499/0457.Circular-Array-Loop.md" >}})|Medium||||30.5%|
 |0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium| O(n)| O(1) ||50.3%|
 |0532|K-diff Pairs in an Array|[Go]({{< relref "/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md" >}})|Medium| O(n)| O(n)||36.0%|
@@ -70,10 +70,10 @@ weight: 3
 |0713|Subarray Product Less Than K|[Go]({{< relref "/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md" >}})|Medium| O(n)| O(1)||40.8%|
 |0763|Partition Labels|[Go]({{< relref "/ChapterFour/0700~0799/0763.Partition-Labels.md" >}})|Medium| O(n)| O(1)|❤️|78.2%|
 |0826|Most Profit Assigning Work|[Go]({{< relref "/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md" >}})|Medium| O(n log n)| O(n)||39.5%|
-|0828|Count Unique Characters of All Substrings of a Given String|[Go]({{< relref "/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})|Hard| O(n)| O(1)|❤️|46.8%|
+|0828|Count Unique Characters of All Substrings of a Given String|[Go]({{< relref "/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md" >}})|Hard| O(n)| O(1)|❤️|46.7%|
 |0838|Push Dominoes|[Go]({{< relref "/ChapterFour/0800~0899/0838.Push-Dominoes.md" >}})|Medium| O(n)| O(n)||50.4%|
 |0844|Backspace String Compare|[Go]({{< relref "/ChapterFour/0800~0899/0844.Backspace-String-Compare.md" >}})|Easy| O(n)| O(n) ||47.2%|
-|0845|Longest Mountain in Array|[Go]({{< relref "/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md" >}})|Medium| O(n)| O(1) ||38.9%|
+|0845|Longest Mountain in Array|[Go]({{< relref "/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md" >}})|Medium| O(n)| O(1) ||38.8%|
 |0881|Boats to Save People|[Go]({{< relref "/ChapterFour/0800~0899/0881.Boats-to-Save-People.md" >}})|Medium| O(n log n)| O(1) ||49.2%|
 |0904|Fruit Into Baskets|[Go]({{< relref "/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md" >}})|Medium| O(n log n)| O(1) ||43.2%|
 |0923|3Sum With Multiplicity|[Go]({{< relref "/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md" >}})|Medium| O(n^2)| O(n) ||41.0%|