|0700|Search in a Binary Search Tree||73.4%|Easy||
|0701|Insert into a Binary Search Tree||75.9%|Medium||
@ -1001,7 +1001,7 @@
|0861|Score After Flipping Matrix||73.5%|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.1%|Hard||
|0863|All Nodes Distance K in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree)|57.5%|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)|41.6%|Hard||
|0864|Shortest Path to Get All Keys|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys)|41.5%|Hard||
|0865|Smallest Subtree with all the Deepest Nodes||64.7%|Medium||
|0981|Time Based Key-Value Store|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store)|54.0%|Medium||
|0982|Triples with Bitwise AND Equal To Zero||56.2%|Hard||
|0983|Minimum Cost For Tickets||62.6%|Medium||
|0983|Minimum Cost For Tickets||62.7%|Medium||
|0984|String Without AAA or BBB|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB)|38.5%|Medium||
|0985|Sum of Even Numbers After Queries|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0985.Sum-of-Even-Numbers-After-Queries)|60.7%|Easy||
|0986|Interval List Intersections|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections)|68.1%|Medium||
|1228|Missing Number In Arithmetic Progression||51.6%|Easy||
|1229|Meeting Scheduler||54.3%|Medium||
@ -1436,8 +1436,8 @@
|1296|Divide Array in Sets of K Consecutive Numbers||55.3%|Medium||
|1297|Maximum Number of Occurrences of a Substring||49.3%|Medium||
|1298|Maximum Candies You Can Get from Boxes||59.6%|Hard||
|1299|Replace Elements with Greatest Element on Right Side|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side)|74.3%|Easy||
|1300|Sum of Mutated Array Closest to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target)|43.3%|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.4%|Easy||
|1300|Sum of Mutated Array Closest to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target)|43.2%|Medium||
|1301|Number of Paths with Max Score||38.0%|Hard||
|1369|Get the Second Most Recent Activity||68.5%|Hard||
|1370|Increasing Decreasing String||76.5%|Easy||
|1371|Find the Longest Substring Containing Vowels in Even Counts||61.1%|Medium||
|1372|Longest ZigZag Path in a Binary Tree||54.7%|Medium||
|1372|Longest ZigZag Path in a Binary Tree||54.6%|Medium||
|1373|Maximum Sum BST in Binary Tree||37.5%|Hard||
|1374|Generate a String With Characters That Have Odd Counts||76.2%|Easy||
|1375|Bulb Switcher III||64.1%|Medium||
|1376|Time Needed to Inform All Employees||56.3%|Medium||
|1377|Frog Position After T Seconds||34.9%|Hard||
|1377|Frog Position After T Seconds||34.8%|Hard||
|1378|Replace Employee ID With The Unique Identifier||89.9%|Easy||
|1379|Find a Corresponding Node of a Binary Tree in a Clone of That Tree||84.9%|Medium||
|1380|Lucky Numbers in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1380.Lucky-Numbers-in-a-Matrix)|70.8%|Easy||
@ -1549,7 +1549,7 @@
|1409|Queries on a Permutation With Key||81.4%|Medium||
|1410|HTML Entity Parser||54.4%|Medium||
|1411|Number of Ways to Paint N × 3 Grid||60.4%|Hard||
|1412|Find the Quiet Students in All Exams||65.4%|Hard||
|1412|Find the Quiet Students in All Exams||65.3%|Hard||
|1413|Minimum Value to Get Positive Step by Step Sum||65.4%|Easy||
|1414|Find the Minimum Number of Fibonacci Numbers Whose Sum Is K||63.3%|Medium||
|1415|The k-th Lexicographical String of All Happy Strings of Length n||69.9%|Medium||
@ -1574,7 +1574,7 @@
|1434|Number of Ways to Wear Different Hats to Each Other||39.1%|Hard||
|1435|Create a Session Bar Chart||77.6%|Easy||
|1436|Destination City||77.0%|Easy||
|1437|Check If All 1's Are at Least Length K Places Away||61.8%|Easy||
|1437|Check If All 1's Are at Least Length K Places Away||61.7%|Easy||
|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit||44.1%|Medium||
|1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows||60.0%|Hard||
|1440|Evaluate Boolean Expression||74.6%|Medium||
@ -1592,7 +1592,7 @@
|1452|People Whose List of Favorite Companies Is Not a Subset of Another List||54.9%|Medium||
|1453|Maximum Number of Darts Inside of a Circular Dartboard||35.2%|Hard||
|1454|Active Users||38.7%|Medium||
|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence)|64.7%|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.6%|Easy||
|1456|Maximum Number of Vowels in a Substring of Given Length||54.4%|Medium||
|1457|Pseudo-Palindromic Paths in a Binary Tree||71.2%|Medium||
|1458|Max Dot Product of Two Subsequences||42.9%|Hard||
@ -1604,12 +1604,12 @@
|1464|Maximum Product of Two Elements in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1464.Maximum-Product-of-Two-Elements-in-an-Array)|77.1%|Easy||
|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts||31.8%|Medium||
|1466|Reorder Routes to Make All Paths Lead to the City Zero||61.3%|Medium||
|1467|Probability of a Two Boxes Having The Same Number of Distinct Balls||61.0%|Hard||
|1467|Probability of a Two Boxes Having The Same Number of Distinct Balls||60.9%|Hard||
|1468|Calculate Salaries||81.4%|Medium||
|1469|Find All The Lonely Nodes||80.6%|Easy||
|1470|Shuffle the Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1470.Shuffle-the-Array)|88.5%|Easy||
|1471|The k Strongest Values in an Array||58.4%|Medium||
|1472|Design Browser History||70.4%|Medium||
|1472|Design Browser History||70.5%|Medium||
|1473|Paint House III||48.7%|Hard||
|1474|Delete N Nodes After M Nodes of a Linked List||74.4%|Easy||
|1475|Final Prices With a Special Discount in a Shop||75.0%|Easy||
@ -1706,10 +1706,10 @@
|1566|Detect Pattern of Length M Repeated K or More Times||42.4%|Easy||
|1567|Maximum Length of Subarray With Positive Product||36.5%|Medium||
|1568|Minimum Number of Days to Disconnect Island||50.3%|Hard||
|1569|Number of Ways to Reorder Array to Get Same BST||50.0%|Hard||
|1569|Number of Ways to Reorder Array to Get Same BST||50.1%|Hard||
|1570|Dot Product of Two Sparse Vectors||91.4%|Medium||
|1571|Warehouse Manager||90.1%|Easy||
|1572|Matrix Diagonal Sum||78.2%|Easy||
|1572|Matrix Diagonal Sum||78.3%|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)|30.9%|Medium||
|1574|Shortest Subarray to be Removed to Make Array Sorted||33.0%|Medium||
|1575|Count All Possible Routes||57.4%|Hard||
@ -1741,14 +1741,14 @@
|1601|Maximum Number of Achievable Transfer Requests||47.6%|Hard||
|1602|Find Nearest Right Node in Binary Tree||74.0%|Medium||
|1603|Design Parking System||86.6%|Easy||
|1604|Alert Using Same Key-Card Three or More Times in a One Hour Period||42.2%|Medium||
|1604|Alert Using Same Key-Card Three or More Times in a One Hour Period||42.3%|Medium||
|1605|Find Valid Matrix Given Row and Column Sums||77.9%|Medium||
|1606|Find Servers That Handled Most Number of Requests||36.9%|Hard||
|1607|Sellers With No Sales||55.8%|Easy||
|1608|Special Array With X Elements Greater Than or Equal X||61.8%|Easy||
|1609|Even Odd Tree||53.2%|Medium||
|1610|Maximum Number of Visible Points||28.7%|Hard||
|1611|Minimum One Bit Operations to Make Integers Zero||57.1%|Hard||
|1611|Minimum One Bit Operations to Make Integers Zero||57.2%|Hard||
|1612|Check If Two Expression Trees are Equivalent||69.9%|Medium||
|1613|Find the Missing IDs||72.6%|Medium||
|1614|Maximum Nesting Depth of the Parentheses||83.3%|Easy||
@ -1756,17 +1756,17 @@
|1616|Split Two Strings to Make Palindrome||36.4%|Medium||
|1617|Count Subtrees With Max Distance Between Cities||63.4%|Hard||
|1618|Maximum Font to Fit a Sentence in a Screen||57.5%|Medium||
|1619|Mean of Array After Removing Some Elements||65.4%|Easy||
|1619|Mean of Array After Removing Some Elements||65.5%|Easy||
|1620|Coordinate With Maximum Network Quality||37.0%|Medium||
|1621|Number of Sets of K Non-Overlapping Line Segments||41.2%|Medium||
|1622|Fancy Sequence||15.6%|Hard||
|1623|All Valid Triplets That Can Represent a Country||89.0%|Easy||
|1624|Largest Substring Between Two Equal Characters||59.1%|Easy||
|1625|Lexicographically Smallest String After Applying Operations||63.7%|Medium||
|1625|Lexicographically Smallest String After Applying Operations||63.6%|Medium||
|1626|Best Team With No Conflicts||37.4%|Medium||
|1627|Graph Connectivity With Threshold||38.2%|Hard||
|1628|Design an Expression Tree With Evaluate Function||79.9%|Medium||
|1629|Slowest Key||58.9%|Easy||
|1629|Slowest Key||59.0%|Easy||
|1630|Arithmetic Subarrays||77.5%|Medium||
|1631|Path With Minimum Effort||43.6%|Medium||
|1632|Rank Transform of a Matrix||30.5%|Hard||
@ -1786,10 +1786,10 @@
|1646|Get Maximum in Generated Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1646.Get-Maximum-in-Generated-Array)|53.5%|Easy||
|1647|Minimum Deletions to Make Character Frequencies Unique|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique)|53.8%|Medium||
|1649|Create Sorted Array through Instructions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1649.Create-Sorted-Array-through-Instructions)|36.1%|Hard||
|1649|Create Sorted Array through Instructions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1649.Create-Sorted-Array-through-Instructions)|36.2%|Hard||
|1650|Lowest Common Ancestor of a Binary Tree III||77.1%|Medium||
|1651|Hopper Company Queries III||66.6%|Hard||
|1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|63.8%|Easy||
|1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|63.9%|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)|50.1%|Medium||
|1654|Minimum Jumps to Reach Home|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1654.Minimum-Jumps-to-Reach-Home)|26.2%|Medium||
|1673|Find the Most Competitive Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1673.Find-the-Most-Competitive-Subsequence)|45.1%|Medium||
|1674|Minimum Moves to Make Array Complementary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary)|34.6%|Medium||
|1675|Minimize Deviation in Array||44.6%|Hard||
|1676|Lowest Common Ancestor of a Binary Tree IV||78.1%|Medium||
|1676|Lowest Common Ancestor of a Binary Tree IV||77.8%|Medium||
|1679|Max Number of K-Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1679.Max-Number-of-K-Sum-Pairs)|54.3%|Medium||
|1680|Concatenation of Consecutive Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers)|45.1%|Medium||
|1687|Delivering Boxes from Storage to Ports||34.7%|Hard||
|1688|Count of Matches in Tournament|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1688.Count-of-Matches-in-Tournament)|83.0%|Easy||
|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers)|87.8%|Medium||
|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers)|87.9%|Medium||
|1690|Stone Game VII|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1690.Stone-Game-VII)|46.9%|Medium||
|1691|Maximum Height by Stacking Cuboids ||49.9%|Hard||
|1692|Count Ways to Distribute Candies||61.7%|Hard||
|1287|Element Appearing More Than 25% In Sorted Array|[Go]({{< relref "/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md" >}})|Easy||||60.2%|
|1295|Find Numbers with Even Number of Digits|[Go]({{< relref "/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md" >}})|Easy||||79.3%|
|1299|Replace Elements with Greatest Element on Right Side|[Go]({{< relref "/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md" >}})|Easy||||74.3%|
|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.3%|
|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.2%|
|1304|Find N Unique Integers Sum up to Zero|[Go]({{< relref "/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})|Easy||||76.8%|
@ -193,8 +193,8 @@ func peakIndexInMountainArray(A []int) int {
|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1201.Ugly-Number-III.md" >}})|Medium||||26.4%|
|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||46.9%|
|1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||49.3%|
|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.3%|
|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||36.1%|
|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||43.2%|
|1649|Create Sorted Array through Instructions|[Go]({{< relref "/ChapterFour/1649.Create-Sorted-Array-through-Instructions.md" >}})|Hard||||36.2%|
|1658|Minimum Operations to Reduce X to Zero|[Go]({{< relref "/ChapterFour/1658.Minimum-Operations-to-Reduce-X-to-Zero.md" >}})|Medium||||33.3%|
|0863|All Nodes Distance K in Binary Tree|[Go]({{< relref "/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md" >}})|Medium||||57.5%|
|0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||41.6%|
|0864|Shortest Path to Get All Keys|[Go]({{< relref "/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md" >}})|Hard||||41.5%|
|0993|Cousins in Binary Tree|[Go]({{< relref "/ChapterFour/0993.Cousins-in-Binary-Tree.md" >}})|Easy| O(n)| O(1)||52.3%|
|1306|Jump Game III|[Go]({{< relref "/ChapterFour/1306.Jump-Game-III.md" >}})|Medium||||62.6%|
|1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||54.9%|
|0524|Longest Word in Dictionary through Deleting|[Go]({{< relref "/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md" >}})|Medium| O(n)| O(1) ||48.9%|
Blocking a user prevents them from interacting with repositories, such as opening or commenting on pull requests or issues. Learn more about blocking a user.
YDZ