From 47419913bb95d5aa309bbfd5809aa1a3c8771dd2 Mon Sep 17 00:00:00 2001 From: yanglbme Date: Fri, 21 Jun 2024 11:27:07 +0800 Subject: [PATCH] chore: format rust code with rustfmt tool --- basic/sorting/HeapSort/README.md | 10 +- basic/sorting/MergeSort/README.md | 5 +- lcci/01.03.String to URL/README.md | 6 +- lcci/01.03.String to URL/README_EN.md | 6 +- lcci/02.05.Sum Lists/README.md | 2 +- lcci/02.05.Sum Lists/README_EN.md | 2 +- lcci/03.02.Min Stack/README.md | 5 +- lcci/03.02.Min Stack/README_EN.md | 5 +- lcci/03.05.Sort of Stacks/README.md | 6 +- lcci/03.05.Sort of Stacks/README_EN.md | 6 +- lcci/03.06.Animal Shelter/README.md | 5 +- lcci/03.06.Animal Shelter/README_EN.md | 5 +- lcci/04.02.Minimum Height Tree/README.md | 16 +- lcci/04.02.Minimum Height Tree/README_EN.md | 16 +- lcci/04.03.List of Depth/README.md | 2 +- lcci/04.03.List of Depth/README_EN.md | 2 +- lcci/04.05.Legal Binary Search Tree/README.md | 2 +- .../README_EN.md | 2 +- lcci/04.10.Check SubTree/README.md | 16 +- lcci/04.10.Check SubTree/README_EN.md | 16 +- lcci/04.12.Paths with Sum/README.md | 4 +- lcci/04.12.Paths with Sum/README_EN.md | 4 +- lcci/08.02.Robot in a Grid/README.md | 7 +- lcci/08.02.Robot in a Grid/README_EN.md | 7 +- .../README.md" | 21 +- .../README.md" | 11 +- .../README.md" | 4 +- .../README.md" | 12 +- .../README.md" | 2 +- .../README.md" | 8 +- .../README.md" | 5 +- .../README.md" | 2 +- .../README.md" | 2 +- .../README.md" | 2 +- .../README.md" | 6 +- .../README.md" | 4 +- .../README.md" | 4 +- .../README.md" | 2 +- .../README.md" | 2 +- .../README.md" | 8 +- .../README.md" | 7 +- .../README.md" | 4 +- .../README.md" | 8 +- .../README.md" | 6 +- .../README.md" | 2 +- .../README.md" | 16 +- .../README.md" | 2 +- .../README.md" | 6 +- .../README.md" | 5 +- run_format.py | 69 +- .../0000-0099/0002.Add Two Numbers/README.md | 2 +- .../0002.Add Two Numbers/README_EN.md | 2 +- .../README.md | 3 +- .../README_EN.md | 3 +- .../0000-0099/0007.Reverse Integer/README.md | 9 +- .../0007.Reverse Integer/README_EN.md | 9 +- .../README.md | 17 +- .../README_EN.md | 17 +- .../0000-0099/0012.Integer to Roman/README.md | 4 +- .../0012.Integer to Roman/README_EN.md | 4 +- .../0000-0099/0013.Roman to Integer/README.md | 14 +- .../0013.Roman to Integer/README_EN.md | 14 +- .../0014.Longest Common Prefix/README.md | 6 +- .../0014.Longest Common Prefix/README_EN.md | 6 +- .../0021.Merge Two Sorted Lists/README.md | 4 +- .../0021.Merge Two Sorted Lists/README_EN.md | 4 +- .../0032.Longest Valid Parentheses/README.md | 22 +- .../README_EN.md | 22 +- .../0041.First Missing Positive/README.md | 13 +- .../0041.First Missing Positive/README_EN.md | 13 +- .../0000-0099/0049.Group Anagrams/README.md | 4 +- .../0049.Group Anagrams/README_EN.md | 4 +- .../0000-0099/0065.Valid Number/README.md | 11 +- .../0000-0099/0065.Valid Number/README_EN.md | 11 +- solution/0000-0099/0079.Word Search/README.md | 9 +- .../0000-0099/0079.Word Search/README_EN.md | 9 +- .../0092.Reverse Linked List II/README.md | 2 +- .../0092.Reverse Linked List II/README_EN.md | 2 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 18 +- .../README_EN.md | 18 +- .../0097.Interleaving String/README.md | 13 +- .../0097.Interleaving String/README_EN.md | 13 +- .../README.md | 2 +- .../README_EN.md | 2 +- solution/0100-0199/0100.Same Tree/README.md | 8 +- .../0100-0199/0100.Same Tree/README_EN.md | 8 +- .../0100-0199/0101.Symmetric Tree/README.md | 10 +- .../0101.Symmetric Tree/README_EN.md | 10 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 16 +- .../README_EN.md | 16 +- .../README.md | 16 +- .../README_EN.md | 16 +- .../0110.Balanced Binary Tree/README.md | 2 +- .../0110.Balanced Binary Tree/README_EN.md | 2 +- .../README.md | 2 +- .../README_EN.md | 2 +- solution/0100-0199/0112.Path Sum/README.md | 6 +- solution/0100-0199/0112.Path Sum/README_EN.md | 6 +- solution/0100-0199/0113.Path Sum II/README.md | 4 +- .../0100-0199/0113.Path Sum II/README_EN.md | 4 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../0129.Sum Root to Leaf Numbers/README.md | 2 +- .../README_EN.md | 2 +- .../0130.Surrounded Regions/README.md | 4 +- .../0130.Surrounded Regions/README_EN.md | 4 +- .../0100-0199/0136.Single Number/README.md | 4 +- .../0100-0199/0136.Single Number/README_EN.md | 4 +- .../0100-0199/0137.Single Number II/README.md | 5 +- .../0137.Single Number II/README_EN.md | 5 +- .../0100-0199/0143.Reorder List/README.md | 6 +- .../0100-0199/0143.Reorder List/README_EN.md | 6 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 2 +- .../README_EN.md | 2 +- solution/0100-0199/0155.Min Stack/README.md | 5 +- .../0100-0199/0155.Min Stack/README_EN.md | 5 +- .../README.md | 11 +- .../README_EN.md | 11 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../0200.Number of Islands/README.md | 22 +- .../0200.Number of Islands/README_EN.md | 22 +- .../README.md | 6 +- .../README_EN.md | 6 +- .../0216.Combination Sum III/README.md | 12 +- .../0216.Combination Sum III/README_EN.md | 12 +- .../0222.Count Complete Tree Nodes/README.md | 6 +- .../README_EN.md | 6 +- .../0226.Invert Binary Tree/README.md | 2 +- .../0226.Invert Binary Tree/README_EN.md | 2 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 8 +- .../README_EN.md | 8 +- .../0200-0299/0252.Meeting Rooms/README.md | 2 +- .../0200-0299/0252.Meeting Rooms/README_EN.md | 2 +- .../0200-0299/0253.Meeting Rooms II/README.md | 4 +- .../0253.Meeting Rooms II/README_EN.md | 4 +- solution/0200-0299/0258.Add Digits/README.md | 5 +- .../0200-0299/0258.Add Digits/README_EN.md | 5 +- solution/0200-0299/0274.H-Index/README.md | 2 +- solution/0200-0299/0274.H-Index/README_EN.md | 2 +- .../0287.Find the Duplicate Number/README.md | 5 +- .../README_EN.md | 5 +- .../0296.Best Meeting Point/README.md | 4 +- .../0296.Best Meeting Point/README_EN.md | 4 +- .../README.md | 14 +- .../README_EN.md | 15 +- .../README.md | 5 +- .../README_EN.md | 5 +- .../README_EN.md | 1 - .../README.md | 2 +- .../README_EN.md | 2 +- .../0389.Find the Difference/README.md | 10 +- .../0389.Find the Difference/README_EN.md | 10 +- .../0300-0399/0396.Rotate Function/README.md | 6 +- .../0396.Rotate Function/README_EN.md | 6 +- .../0399.Evaluate Division/README.md | 13 +- .../0399.Evaluate Division/README_EN.md | 13 +- solution/0400-0499/0403.Frog Jump/README.md | 9 +- .../0400-0499/0403.Frog Jump/README_EN.md | 9 +- .../0404.Sum of Left Leaves/README.md | 2 +- .../0404.Sum of Left Leaves/README_EN.md | 2 +- .../0433.Minimum Genetic Mutation/README.md | 2 +- .../README_EN.md | 2 +- .../0445.Add Two Numbers II/README.md | 14 +- .../0445.Add Two Numbers II/README_EN.md | 14 +- .../0450.Delete Node in a BST/README.md | 4 +- .../0450.Delete Node in a BST/README_EN.md | 4 +- solution/0400-0499/0454.4Sum II/README.md | 2 +- solution/0400-0499/0454.4Sum II/README_EN.md | 2 +- .../README_EN.md | 1 - .../0400-0499/0481.Magical String/README.md | 6 +- .../0481.Magical String/README_EN.md | 6 +- .../0486.Predict the Winner/README.md | 2 +- .../0486.Predict the Winner/README_EN.md | 2 +- .../0508.Most Frequent Subtree Sum/README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../0528.Random Pick with Weight/README.md | 2 +- .../0528.Random Pick with Weight/README_EN.md | 2 +- .../README.md | 2 +- .../README_EN.md | 2 +- solution/0500-0599/0542.01 Matrix/README.md | 5 +- .../0500-0599/0542.01 Matrix/README_EN.md | 5 +- .../0543.Diameter of Binary Tree/README.md | 2 +- .../0543.Diameter of Binary Tree/README_EN.md | 2 +- .../0572.Subtree of Another Tree/README.md | 18 +- .../0572.Subtree of Another Tree/README_EN.md | 18 +- .../0500-0599/0591.Tag Validator/README.md | 7 +- .../0500-0599/0591.Tag Validator/README_EN.md | 7 +- .../README.md | 23 +- .../README_EN.md | 23 +- .../0617.Merge Two Binary Trees/README.md | 4 +- .../0617.Merge Two Binary Trees/README_EN.md | 4 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../0600-0699/0645.Set Mismatch/README.md | 7 +- .../0600-0699/0645.Set Mismatch/README_EN.md | 7 +- .../0652.Find Duplicate Subtrees/README.md | 6 +- .../0652.Find Duplicate Subtrees/README_EN.md | 6 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../0654.Maximum Binary Tree/README.md | 16 +- .../0654.Maximum Binary Tree/README_EN.md | 16 +- .../0655.Print Binary Tree/README.md | 20 +- .../0655.Print Binary Tree/README_EN.md | 20 +- .../0669.Trim a Binary Search Tree/README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 20 +- .../README_EN.md | 20 +- .../0676.Implement Magic Dictionary/README.md | 7 +- .../README_EN.md | 7 +- .../0687.Longest Univalue Path/README.md | 8 +- .../0687.Longest Univalue Path/README_EN.md | 8 +- .../0691.Stickers to Spell Word/README.md | 2 +- .../0691.Stickers to Spell Word/README_EN.md | 2 +- .../0707.Design Linked List/README.md | 20 +- .../0707.Design Linked List/README_EN.md | 20 +- .../README.md | 18 +- .../README_EN.md | 18 +- .../0728.Self Dividing Numbers/README.md | 20 +- .../0728.Self Dividing Numbers/README_EN.md | 20 +- .../0767.Reorganize String/README.md | 2 +- .../0767.Reorganize String/README_EN.md | 2 +- .../0778.Swim in Rising Water/README.md | 12 +- .../0778.Swim in Rising Water/README_EN.md | 12 +- .../0785.Is Graph Bipartite/README.md | 2 +- .../0785.Is Graph Bipartite/README_EN.md | 2 +- .../0791.Custom Sort String/README.md | 4 +- .../0791.Custom Sort String/README_EN.md | 4 +- .../0804.Unique Morse Code Words/README.md | 29 +- .../0804.Unique Morse Code Words/README_EN.md | 29 +- .../0814.Binary Tree Pruning/README.md | 2 +- .../0814.Binary Tree Pruning/README_EN.md | 2 +- .../0800-0899/0819.Most Common Word/README.md | 5 +- .../0819.Most Common Word/README_EN.md | 5 +- .../0827.Making A Large Island/README.md | 15 +- .../0827.Making A Large Island/README_EN.md | 15 +- .../0872.Leaf-Similar Trees/README.md | 8 +- .../0872.Leaf-Similar Trees/README_EN.md | 8 +- .../README.md | 21 +- .../README_EN.md | 21 +- .../README.md | 18 +- .../README_EN.md | 18 +- .../0907.Sum of Subarray Minimums/README.md | 5 +- .../README_EN.md | 5 +- .../0936.Stamping The Sequence/README.md | 7 +- .../0936.Stamping The Sequence/README_EN.md | 7 +- .../0937.Reorder Data in Log Files/README.md | 10 +- .../README_EN.md | 10 +- .../0940.Distinct Subsequences II/README.md | 15 +- .../README_EN.md | 15 +- .../0900-0999/0942.DI String Match/README.md | 16 +- .../0942.DI String Match/README_EN.md | 16 +- .../README.md | 10 +- .../README_EN.md | 10 +- .../0965.Univalued Binary Tree/README.md | 2 +- .../0965.Univalued Binary Tree/README_EN.md | 2 +- .../0973.K Closest Points to Origin/README.md | 5 +- .../README_EN.md | 5 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../0900-0999/0994.Rotting Oranges/README.md | 11 +- .../0994.Rotting Oranges/README_EN.md | 11 +- .../0998.Maximum Binary Tree II/README.md | 18 +- .../0998.Maximum Binary Tree II/README_EN.md | 18 +- .../README.md | 18 +- .../README_EN.md | 18 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../1036.Escape a Large Maze/README.md | 15 +- .../1036.Escape a Large Maze/README_EN.md | 15 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../1048.Longest String Chain/README.md | 2 +- .../1048.Longest String Chain/README_EN.md | 2 +- .../1049.Last Stone Weight II/README.md | 2 +- .../1049.Last Stone Weight II/README_EN.md | 2 +- solution/1000-1099/1094.Car Pooling/README.md | 6 +- .../1000-1099/1094.Car Pooling/README_EN.md | 6 +- .../README.md | 11 +- .../README_EN.md | 11 +- .../README.md | 12 +- .../README_EN.md | 12 +- .../1197.Minimum Knight Moves/README.md | 20 +- .../1197.Minimum Knight Moves/README_EN.md | 20 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../1229.Meeting Scheduler/README.md | 6 +- .../1229.Meeting Scheduler/README_EN.md | 6 +- .../1244.Design A Leaderboard/README.md | 10 +- .../1244.Design A Leaderboard/README_EN.md | 10 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../1302.Deepest Leaves Sum/README.md | 2 +- .../1302.Deepest Leaves Sum/README_EN.md | 2 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 6 +- .../README_EN.md | 6 +- .../1367.Linked List in Binary Tree/README.md | 8 +- .../README_EN.md | 8 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 1 - .../README.md | 5 +- .../README_EN.md | 5 +- .../1400-1499/1436.Destination City/README.md | 5 +- .../1436.Destination City/README_EN.md | 5 +- .../README.md | 7 +- .../README_EN.md | 7 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 14 +- .../README_EN.md | 14 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../1656.Design an Ordered Stream/README.md | 5 +- .../README_EN.md | 5 +- .../README.md | 6 +- .../README_EN.md | 6 +- .../1672.Richest Customer Wealth/README.md | 6 +- .../1672.Richest Customer Wealth/README_EN.md | 6 +- .../1678.Goal Parser Interpretation/README.md | 6 +- .../README_EN.md | 6 +- .../1694.Reformat Phone Number/README.md | 5 +- .../1694.Reformat Phone Number/README_EN.md | 5 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 14 +- .../README_EN.md | 14 +- .../README.md | 5 +- .../README_EN.md | 5 +- .../README.md | 13 +- .../README_EN.md | 13 +- .../1862.Sum of Floored Pairs/README.md | 9 +- .../1862.Sum of Floored Pairs/README_EN.md | 9 +- .../README.md | 5 +- .../README_EN.md | 5 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../2000-2099/2032.Two Out of Three/README.md | 13 +- .../2032.Two Out of Three/README_EN.md | 13 +- .../2100-2199/2103.Rings and Rods/README.md | 5 +- .../2103.Rings and Rods/README_EN.md | 5 +- .../README.md | 5 +- .../README_EN.md | 5 +- .../2132.Stamping the Grid/README.md | 5 +- .../2132.Stamping the Grid/README_EN.md | 5 +- .../README.md | 5 +- .../README_EN.md | 5 +- .../README.md | 5 +- .../README_EN.md | 5 +- .../README.md | 5 +- .../README_EN.md | 5 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 14 +- .../README_EN.md | 14 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 7 +- .../README_EN.md | 7 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 8 +- .../README_EN.md | 8 +- .../2200-2299/2293.Min Max Game/README.md | 2 +- .../2200-2299/2293.Min Max Game/README_EN.md | 2 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 18 +- .../README_EN.md | 18 +- .../2400-2499/2418.Sort the People/README.md | 5 +- .../2418.Sort the People/README_EN.md | 5 +- .../README.md | 20 +- .../README_EN.md | 20 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../2451.Odd String Difference/README.md | 9 +- .../2451.Odd String Difference/README_EN.md | 9 +- .../README.md | 10 +- .../README_EN.md | 10 +- .../README.md | 6 +- .../README_EN.md | 6 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 13 +- .../README_EN.md | 13 +- .../2512.Reward Top K Students/README.md | 9 +- .../2512.Reward Top K Students/README_EN.md | 9 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 3 +- .../README_EN.md | 3 +- .../README.md | 9 +- .../README_EN.md | 9 +- .../README.md | 7 +- .../README_EN.md | 7 +- .../README.md | 7 +- .../README_EN.md | 7 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 5 +- .../README_EN.md | 5 +- .../README.md | 4 +- .../README_EN.md | 4 +- .../README.md | 5 +- .../README_EN.md | 5 +- .../2590.Design a Todo List/README.md | 42 +- .../2590.Design a Todo List/README_EN.md | 42 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../2643.Row With Maximum Ones/README.md | 5 +- .../2643.Row With Maximum Ones/README_EN.md | 5 +- .../2600-2699/2652.Sum Multiples/README.md | 4 +- .../2600-2699/2652.Sum Multiples/README_EN.md | 4 +- .../README.md" | 2 +- .../README_EN.md" | 2 +- .../2600-2699/2679.Sum in a Matrix/README.md | 8 +- .../2679.Sum in a Matrix/README_EN.md | 8 +- .../2742.Painting the Walls/README.md | 8 +- .../2742.Painting the Walls/README_EN.md | 8 +- .../README.md | 5 +- .../README_EN.md | 5 +- .../README.md | 10 +- .../README_EN.md | 10 +- .../README.md | 3 +- .../README_EN.md | 3 +- .../2864.Maximum Odd Binary Number/README.md | 5 +- .../README_EN.md | 5 +- .../README.md | 2 +- .../README_EN.md | 2 +- .../README.md | 9 +- .../README_EN.md | 9 +- .../README.md | 10 +- .../README_EN.md | 10 +- .../2974.Minimum Number Game/README.md | 2 +- .../2974.Minimum Number Game/README_EN.md | 2 +- solution/CONTEST_README.md | 6382 ++++++++-------- solution/CONTEST_README_EN.md | 6388 ++++++++-------- solution/README.md | 6424 ++++++++-------- solution/README_EN.md | 6428 ++++++++--------- solution/main.py | 70 +- 474 files changed, 14354 insertions(+), 14729 deletions(-) diff --git a/basic/sorting/HeapSort/README.md b/basic/sorting/HeapSort/README.md index a4506916e9ae2..8d755c3063af3 100644 --- a/basic/sorting/HeapSort/README.md +++ b/basic/sorting/HeapSort/README.md @@ -480,19 +480,13 @@ fn sink(nums: &mut Vec, mut i: usize, n: usize) { fn main() -> io::Result<()> { let mut s = String::new(); io::stdin().read_line(&mut s)?; - let s: Vec = s - .split(' ') - .map(|s| s.trim().parse().unwrap()) - .collect(); + let s: Vec = s.split(' ').map(|s| s.trim().parse().unwrap()).collect(); // let n = s[0]; let m = s[1]; let mut nums = String::new(); io::stdin().read_line(&mut nums)?; - let mut nums: Vec = nums - .split(' ') - .map(|s| s.trim().parse().unwrap()) - .collect(); + let mut nums: Vec = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect(); heap_sort(&mut nums); for num in nums.iter().take(m) { diff --git a/basic/sorting/MergeSort/README.md b/basic/sorting/MergeSort/README.md index 34934e70e4948..c02479af1d1cf 100644 --- a/basic/sorting/MergeSort/README.md +++ b/basic/sorting/MergeSort/README.md @@ -302,10 +302,7 @@ fn main() -> io::Result<()> { let mut nums = String::new(); io::stdin().read_line(&mut nums)?; - let mut nums: Vec = nums - .split(' ') - .map(|s| s.trim().parse().unwrap()) - .collect(); + let mut nums: Vec = nums.split(' ').map(|s| s.trim().parse().unwrap()).collect(); merge_sort(&mut nums, 0, n - 1); for num in nums.iter() { diff --git a/lcci/01.03.String to URL/README.md b/lcci/01.03.String to URL/README.md index fd68643cbc456..70dc133091411 100644 --- a/lcci/01.03.String to URL/README.md +++ b/lcci/01.03.String to URL/README.md @@ -181,7 +181,11 @@ impl Solution { s.chars() .take(length as usize) .map(|c| { - if c == ' ' { "%20".to_string() } else { c.to_string() } + if c == ' ' { + "%20".to_string() + } else { + c.to_string() + } }) .collect() } diff --git a/lcci/01.03.String to URL/README_EN.md b/lcci/01.03.String to URL/README_EN.md index 12c5ecc5fb171..c4872869b03e8 100644 --- a/lcci/01.03.String to URL/README_EN.md +++ b/lcci/01.03.String to URL/README_EN.md @@ -195,7 +195,11 @@ impl Solution { s.chars() .take(length as usize) .map(|c| { - if c == ' ' { "%20".to_string() } else { c.to_string() } + if c == ' ' { + "%20".to_string() + } else { + c.to_string() + } }) .collect() } diff --git a/lcci/02.05.Sum Lists/README.md b/lcci/02.05.Sum Lists/README.md index 3ce68c29bf90c..27b004db13c68 100644 --- a/lcci/02.05.Sum Lists/README.md +++ b/lcci/02.05.Sum Lists/README.md @@ -220,7 +220,7 @@ function addTwoNumbers(l1: ListNode | null, l2: ListNode | null): ListNode | nul impl Solution { pub fn add_two_numbers( mut l1: Option>, - mut l2: Option> + mut l2: Option>, ) -> Option> { let mut dummy = Some(Box::new(ListNode::new(0))); let mut cur = dummy.as_mut(); diff --git a/lcci/02.05.Sum Lists/README_EN.md b/lcci/02.05.Sum Lists/README_EN.md index 863acc038358b..87be2783be931 100644 --- a/lcci/02.05.Sum Lists/README_EN.md +++ b/lcci/02.05.Sum Lists/README_EN.md @@ -224,7 +224,7 @@ function addTwoNumbers(l1: ListNode | null, l2: ListNode | null): ListNode | nul impl Solution { pub fn add_two_numbers( mut l1: Option>, - mut l2: Option> + mut l2: Option>, ) -> Option> { let mut dummy = Some(Box::new(ListNode::new(0))); let mut cur = dummy.as_mut(); diff --git a/lcci/03.02.Min Stack/README.md b/lcci/03.02.Min Stack/README.md index fb22c3c2783a5..53d742ad9fbfb 100644 --- a/lcci/03.02.Min Stack/README.md +++ b/lcci/03.02.Min Stack/README.md @@ -250,7 +250,10 @@ struct MinStack { impl MinStack { /** initialize your data structure here. */ fn new() -> Self { - Self { stack: VecDeque::new(), min_stack: VecDeque::new() } + Self { + stack: VecDeque::new(), + min_stack: VecDeque::new(), + } } fn push(&mut self, x: i32) { diff --git a/lcci/03.02.Min Stack/README_EN.md b/lcci/03.02.Min Stack/README_EN.md index 666fe77dbdd34..46bd103a08582 100644 --- a/lcci/03.02.Min Stack/README_EN.md +++ b/lcci/03.02.Min Stack/README_EN.md @@ -270,7 +270,10 @@ struct MinStack { impl MinStack { /** initialize your data structure here. */ fn new() -> Self { - Self { stack: VecDeque::new(), min_stack: VecDeque::new() } + Self { + stack: VecDeque::new(), + min_stack: VecDeque::new(), + } } fn push(&mut self, x: i32) { diff --git a/lcci/03.05.Sort of Stacks/README.md b/lcci/03.05.Sort of Stacks/README.md index f0c3853f11e40..3e8213cb73064 100644 --- a/lcci/03.05.Sort of Stacks/README.md +++ b/lcci/03.05.Sort of Stacks/README.md @@ -323,7 +323,11 @@ impl SortedStack { } fn peek(&self) -> i32 { - if self.is_empty() { -1 } else { *self.stk.back().unwrap() } + if self.is_empty() { + -1 + } else { + *self.stk.back().unwrap() + } } fn is_empty(&self) -> bool { diff --git a/lcci/03.05.Sort of Stacks/README_EN.md b/lcci/03.05.Sort of Stacks/README_EN.md index 23b496f732a01..378a4fec37be9 100644 --- a/lcci/03.05.Sort of Stacks/README_EN.md +++ b/lcci/03.05.Sort of Stacks/README_EN.md @@ -337,7 +337,11 @@ impl SortedStack { } fn peek(&self) -> i32 { - if self.is_empty() { -1 } else { *self.stk.back().unwrap() } + if self.is_empty() { + -1 + } else { + *self.stk.back().unwrap() + } } fn is_empty(&self) -> bool { diff --git a/lcci/03.06.Animal Shelter/README.md b/lcci/03.06.Animal Shelter/README.md index 81bfb00561687..e57fdbf8284bf 100644 --- a/lcci/03.06.Animal Shelter/README.md +++ b/lcci/03.06.Animal Shelter/README.md @@ -304,9 +304,8 @@ impl AnimalShelf { } fn dequeue_any(&mut self) -> Vec { - if - self.q[0].is_empty() || - (!self.q[1].is_empty() && self.q[1].front().unwrap() < self.q[0].front().unwrap()) + if self.q[0].is_empty() + || (!self.q[1].is_empty() && self.q[1].front().unwrap() < self.q[0].front().unwrap()) { self.dequeue_dog() } else { diff --git a/lcci/03.06.Animal Shelter/README_EN.md b/lcci/03.06.Animal Shelter/README_EN.md index c0538b2910fdf..4a483da096a47 100644 --- a/lcci/03.06.Animal Shelter/README_EN.md +++ b/lcci/03.06.Animal Shelter/README_EN.md @@ -318,9 +318,8 @@ impl AnimalShelf { } fn dequeue_any(&mut self) -> Vec { - if - self.q[0].is_empty() || - (!self.q[1].is_empty() && self.q[1].front().unwrap() < self.q[0].front().unwrap()) + if self.q[0].is_empty() + || (!self.q[1].is_empty() && self.q[1].front().unwrap() < self.q[0].front().unwrap()) { self.dequeue_dog() } else { diff --git a/lcci/04.02.Minimum Height Tree/README.md b/lcci/04.02.Minimum Height Tree/README.md index 7d3becafc1d44..dedb278968fca 100644 --- a/lcci/04.02.Minimum Height Tree/README.md +++ b/lcci/04.02.Minimum Height Tree/README.md @@ -190,23 +190,19 @@ function sortedArrayToBST(nums: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(nums: &Vec, l: usize, r: usize) -> Option>> { if l >= r { return None; } let mid = (l + r) >> 1; - Some( - Rc::new( - RefCell::new(TreeNode { - val: nums[mid], - left: Self::dfs(nums, l, mid), - right: Self::dfs(nums, mid + 1, r), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: nums[mid], + left: Self::dfs(nums, l, mid), + right: Self::dfs(nums, mid + 1, r), + }))) } pub fn sorted_array_to_bst(nums: Vec) -> Option>> { Self::dfs(&nums, 0, nums.len()) diff --git a/lcci/04.02.Minimum Height Tree/README_EN.md b/lcci/04.02.Minimum Height Tree/README_EN.md index f0b78ac54426d..40f629d61050d 100644 --- a/lcci/04.02.Minimum Height Tree/README_EN.md +++ b/lcci/04.02.Minimum Height Tree/README_EN.md @@ -214,23 +214,19 @@ function sortedArrayToBST(nums: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(nums: &Vec, l: usize, r: usize) -> Option>> { if l >= r { return None; } let mid = (l + r) >> 1; - Some( - Rc::new( - RefCell::new(TreeNode { - val: nums[mid], - left: Self::dfs(nums, l, mid), - right: Self::dfs(nums, mid + 1, r), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: nums[mid], + left: Self::dfs(nums, l, mid), + right: Self::dfs(nums, mid + 1, r), + }))) } pub fn sorted_array_to_bst(nums: Vec) -> Option>> { Self::dfs(&nums, 0, nums.len()) diff --git a/lcci/04.03.List of Depth/README.md b/lcci/04.03.List of Depth/README.md index 615480288e257..7bfaf6ed252e8 100644 --- a/lcci/04.03.List of Depth/README.md +++ b/lcci/04.03.List of Depth/README.md @@ -301,9 +301,9 @@ function listOfDepth(tree: TreeNode | null): Array { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn list_of_depth(tree: Option>>) -> Vec>> { let mut res = vec![]; diff --git a/lcci/04.03.List of Depth/README_EN.md b/lcci/04.03.List of Depth/README_EN.md index daf0f4a791c6e..e0a2f62bf8341 100644 --- a/lcci/04.03.List of Depth/README_EN.md +++ b/lcci/04.03.List of Depth/README_EN.md @@ -314,9 +314,9 @@ function listOfDepth(tree: TreeNode | null): Array { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn list_of_depth(tree: Option>>) -> Vec>> { let mut res = vec![]; diff --git a/lcci/04.05.Legal Binary Search Tree/README.md b/lcci/04.05.Legal Binary Search Tree/README.md index 07ac1398e2aee..8c738774f7d24 100644 --- a/lcci/04.05.Legal Binary Search Tree/README.md +++ b/lcci/04.05.Legal Binary Search Tree/README.md @@ -223,8 +223,8 @@ function isValidBST(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, prev: &mut Option) -> bool { if root.is_none() { diff --git a/lcci/04.05.Legal Binary Search Tree/README_EN.md b/lcci/04.05.Legal Binary Search Tree/README_EN.md index 7d8bdf3bcb0a2..70ba293a0ed1b 100644 --- a/lcci/04.05.Legal Binary Search Tree/README_EN.md +++ b/lcci/04.05.Legal Binary Search Tree/README_EN.md @@ -261,8 +261,8 @@ function isValidBST(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, prev: &mut Option) -> bool { if root.is_none() { diff --git a/lcci/04.10.Check SubTree/README.md b/lcci/04.10.Check SubTree/README.md index 814f68f0563bc..4b425c2c32337 100644 --- a/lcci/04.10.Check SubTree/README.md +++ b/lcci/04.10.Check SubTree/README.md @@ -256,17 +256,17 @@ function checkSubTree(t1: TreeNode | null, t2: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(t1: &Option>>, t2: &Option>>) -> bool { match (t1, t2) { (Some(node1), Some(node2)) => { let n1 = node1.borrow(); let n2 = node2.borrow(); - n1.val == n2.val && - Solution::dfs(&n1.left, &n2.left) && - Solution::dfs(&n1.right, &n2.right) + n1.val == n2.val + && Solution::dfs(&n1.left, &n2.left) + && Solution::dfs(&n1.right, &n2.right) } (None, Some(_)) => false, (Some(_), None) => false, @@ -276,15 +276,15 @@ impl Solution { pub fn check_sub_tree( t1: Option>>, - t2: Option>> + t2: Option>>, ) -> bool { match (t1, t2) { (Some(node1), Some(node2)) => { let n1 = node1.borrow(); let n2 = node2.borrow(); - Solution::dfs(&Some(Rc::clone(&node1)), &Some(Rc::clone(&node2))) || - Solution::check_sub_tree(n1.left.clone(), Some(Rc::clone(&node2))) || - Solution::check_sub_tree(n1.right.clone(), Some(Rc::clone(&node2))) + Solution::dfs(&Some(Rc::clone(&node1)), &Some(Rc::clone(&node2))) + || Solution::check_sub_tree(n1.left.clone(), Some(Rc::clone(&node2))) + || Solution::check_sub_tree(n1.right.clone(), Some(Rc::clone(&node2))) } (Some(_), None) => true, (None, Some(_)) => false, diff --git a/lcci/04.10.Check SubTree/README_EN.md b/lcci/04.10.Check SubTree/README_EN.md index 0f14c0e64f407..6397fd1b53c15 100644 --- a/lcci/04.10.Check SubTree/README_EN.md +++ b/lcci/04.10.Check SubTree/README_EN.md @@ -264,17 +264,17 @@ function checkSubTree(t1: TreeNode | null, t2: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(t1: &Option>>, t2: &Option>>) -> bool { match (t1, t2) { (Some(node1), Some(node2)) => { let n1 = node1.borrow(); let n2 = node2.borrow(); - n1.val == n2.val && - Solution::dfs(&n1.left, &n2.left) && - Solution::dfs(&n1.right, &n2.right) + n1.val == n2.val + && Solution::dfs(&n1.left, &n2.left) + && Solution::dfs(&n1.right, &n2.right) } (None, Some(_)) => false, (Some(_), None) => false, @@ -284,15 +284,15 @@ impl Solution { pub fn check_sub_tree( t1: Option>>, - t2: Option>> + t2: Option>>, ) -> bool { match (t1, t2) { (Some(node1), Some(node2)) => { let n1 = node1.borrow(); let n2 = node2.borrow(); - Solution::dfs(&Some(Rc::clone(&node1)), &Some(Rc::clone(&node2))) || - Solution::check_sub_tree(n1.left.clone(), Some(Rc::clone(&node2))) || - Solution::check_sub_tree(n1.right.clone(), Some(Rc::clone(&node2))) + Solution::dfs(&Some(Rc::clone(&node1)), &Some(Rc::clone(&node2))) + || Solution::check_sub_tree(n1.left.clone(), Some(Rc::clone(&node2))) + || Solution::check_sub_tree(n1.right.clone(), Some(Rc::clone(&node2))) } (Some(_), None) => true, (None, Some(_)) => false, diff --git a/lcci/04.12.Paths with Sum/README.md b/lcci/04.12.Paths with Sum/README.md index 011af3a4cc8b7..5ff30a2c961e5 100644 --- a/lcci/04.12.Paths with Sum/README.md +++ b/lcci/04.12.Paths with Sum/README.md @@ -251,9 +251,9 @@ function pathSum(root: TreeNode | null, sum: number): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { pub fn path_sum(root: Option>>, sum: i32) -> i32 { let mut cnt = HashMap::new(); @@ -265,7 +265,7 @@ impl Solution { root: Option>>, sum: i32, s: i32, - cnt: &mut HashMap + cnt: &mut HashMap, ) -> i32 { if let Some(node) = root { let node = node.borrow(); diff --git a/lcci/04.12.Paths with Sum/README_EN.md b/lcci/04.12.Paths with Sum/README_EN.md index aa65137b0d795..e2b797b3c05f5 100644 --- a/lcci/04.12.Paths with Sum/README_EN.md +++ b/lcci/04.12.Paths with Sum/README_EN.md @@ -264,9 +264,9 @@ function pathSum(root: TreeNode | null, sum: number): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { pub fn path_sum(root: Option>>, sum: i32) -> i32 { let mut cnt = HashMap::new(); @@ -278,7 +278,7 @@ impl Solution { root: Option>>, sum: i32, s: i32, - cnt: &mut HashMap + cnt: &mut HashMap, ) -> i32 { if let Some(node) = root { let node = node.borrow(); diff --git a/lcci/08.02.Robot in a Grid/README.md b/lcci/08.02.Robot in a Grid/README.md index a13e2f594e13c..cc1bf9f600664 100644 --- a/lcci/08.02.Robot in a Grid/README.md +++ b/lcci/08.02.Robot in a Grid/README.md @@ -186,10 +186,9 @@ impl Solution { } path.push(vec![i as i32, j as i32]); grid[i as usize][j as usize] = 1; - if - (i + 1 == grid.len() && j + 1 == grid[0].len()) || - Self::dfs(grid, path, i + 1, j) || - Self::dfs(grid, path, i, j + 1) + if (i + 1 == grid.len() && j + 1 == grid[0].len()) + || Self::dfs(grid, path, i + 1, j) + || Self::dfs(grid, path, i, j + 1) { return true; } diff --git a/lcci/08.02.Robot in a Grid/README_EN.md b/lcci/08.02.Robot in a Grid/README_EN.md index 07603c08178fc..3ba14cfdcd585 100644 --- a/lcci/08.02.Robot in a Grid/README_EN.md +++ b/lcci/08.02.Robot in a Grid/README_EN.md @@ -195,10 +195,9 @@ impl Solution { } path.push(vec![i as i32, j as i32]); grid[i as usize][j as usize] = 1; - if - (i + 1 == grid.len() && j + 1 == grid[0].len()) || - Self::dfs(grid, path, i + 1, j) || - Self::dfs(grid, path, i, j + 1) + if (i + 1 == grid.len() && j + 1 == grid[0].len()) + || Self::dfs(grid, path, i + 1, j) + || Self::dfs(grid, path, i, j + 1) { return true; } diff --git "a/lcof/\351\235\242\350\257\225\351\242\23007. \351\207\215\345\273\272\344\272\214\345\217\211\346\240\221/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23007. \351\207\215\345\273\272\344\272\214\345\217\211\346\240\221/README.md" index 5139b8a574f28..adeb60c5e1c6f 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23007. \351\207\215\345\273\272\344\272\214\345\217\211\346\240\221/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23007. \351\207\215\345\273\272\344\272\214\345\217\211\346\240\221/README.md" @@ -259,27 +259,20 @@ function buildTree(preorder: number[], inorder: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn help(preorder: &[i32], inorder: &[i32]) -> Option>> { if inorder.is_empty() { return None; } let val = preorder[0]; - let i = inorder - .iter() - .position(|num| *num == val) - .unwrap(); - Some( - Rc::new( - RefCell::new(TreeNode { - val, - left: Self::help(&preorder[1..i + 1], &inorder[..i]), - right: Self::help(&preorder[i + 1..], &inorder[i + 1..]), - }) - ) - ) + let i = inorder.iter().position(|num| *num == val).unwrap(); + Some(Rc::new(RefCell::new(TreeNode { + val, + left: Self::help(&preorder[1..i + 1], &inorder[..i]), + right: Self::help(&preorder[i + 1..], &inorder[i + 1..]), + }))) } pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { diff --git "a/lcof/\351\235\242\350\257\225\351\242\23012. \347\237\251\351\230\265\344\270\255\347\232\204\350\267\257\345\276\204/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23012. \347\237\251\351\230\265\344\270\255\347\232\204\350\267\257\345\276\204/README.md" index b17d31b163096..fa8818a920e1d 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23012. \347\237\251\351\230\265\344\270\255\347\232\204\350\267\257\345\276\204/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23012. \347\237\251\351\230\265\344\270\255\347\232\204\350\267\257\345\276\204/README.md" @@ -246,7 +246,7 @@ impl Solution { chars: &Vec, i: usize, j: usize, - mut k: usize + mut k: usize, ) -> bool { if board[i][j] != chars[k] { return false; @@ -257,11 +257,10 @@ impl Solution { } let temp = board[i][j]; board[i][j] = ' '; - if - (i != 0 && Self::dfs(board, chars, i - 1, j, k)) || - (j != 0 && Self::dfs(board, chars, i, j - 1, k)) || - (i != board.len() - 1 && Self::dfs(board, chars, i + 1, j, k)) || - (j != board[0].len() - 1 && Self::dfs(board, chars, i, j + 1, k)) + if (i != 0 && Self::dfs(board, chars, i - 1, j, k)) + || (j != 0 && Self::dfs(board, chars, i, j - 1, k)) + || (i != board.len() - 1 && Self::dfs(board, chars, i + 1, j, k)) + || (j != board[0].len() - 1 && Self::dfs(board, chars, i, j + 1, k)) { return true; } diff --git "a/lcof/\351\235\242\350\257\225\351\242\23025. \345\220\210\345\271\266\344\270\244\344\270\252\346\216\222\345\272\217\347\232\204\351\223\276\350\241\250/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23025. \345\220\210\345\271\266\344\270\244\344\270\252\346\216\222\345\272\217\347\232\204\351\223\276\350\241\250/README.md" index c680b89c8a18e..02d51874258b0 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23025. \345\220\210\345\271\266\344\270\244\344\270\252\346\216\222\345\272\217\347\232\204\351\223\276\350\241\250/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23025. \345\220\210\345\271\266\344\270\244\344\270\252\346\216\222\345\272\217\347\232\204\351\223\276\350\241\250/README.md" @@ -218,7 +218,7 @@ function mergeTwoLists(l1: ListNode | null, l2: ListNode | null): ListNode | nul impl Solution { pub fn merge_two_lists( mut l1: Option>, - mut l2: Option> + mut l2: Option>, ) -> Option> { match (l1.is_some(), l2.is_some()) { (false, false) => None, @@ -528,7 +528,7 @@ function mergeTwoLists(l1: ListNode | null, l2: ListNode | null): ListNode | nul impl Solution { pub fn merge_two_lists( l1: Option>, - l2: Option> + l2: Option>, ) -> Option> { match (l1, l2) { (Some(mut n1), Some(mut n2)) => { diff --git "a/lcof/\351\235\242\350\257\225\351\242\23026. \346\240\221\347\232\204\345\255\220\347\273\223\346\236\204/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23026. \346\240\221\347\232\204\345\255\220\347\273\223\346\236\204/README.md" index 0341f55a0961b..a098001e65705 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23026. \346\240\221\347\232\204\345\255\220\347\273\223\346\236\204/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23026. \346\240\221\347\232\204\345\255\220\347\273\223\346\236\204/README.md" @@ -244,27 +244,27 @@ function isSubStructure(A: TreeNode | null, B: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn is_sub_structure( a: Option>>, - b: Option>> + b: Option>>, ) -> bool { Self::is_sub_structure_help(&a, &b) } fn is_sub_structure_help( a: &Option>>, - b: &Option>> + b: &Option>>, ) -> bool { if a.is_none() || b.is_none() { return false; } - Self::dfs(a, b) || - Self::is_sub_structure_help(&a.as_ref().unwrap().borrow().left, b) || - Self::is_sub_structure_help(&a.as_ref().unwrap().borrow().right, b) + Self::dfs(a, b) + || Self::is_sub_structure_help(&a.as_ref().unwrap().borrow().left, b) + || Self::is_sub_structure_help(&a.as_ref().unwrap().borrow().right, b) } fn dfs(a: &Option>>, b: &Option>>) -> bool { diff --git "a/lcof/\351\235\242\350\257\225\351\242\23027. \344\272\214\345\217\211\346\240\221\347\232\204\351\225\234\345\203\217/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23027. \344\272\214\345\217\211\346\240\221\347\232\204\351\225\234\345\203\217/README.md" index 90c697d3bad05..294c7b96b23fb 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23027. \344\272\214\345\217\211\346\240\221\347\232\204\351\225\234\345\203\217/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23027. \344\272\214\345\217\211\346\240\221\347\232\204\351\225\234\345\203\217/README.md" @@ -206,8 +206,8 @@ function mirrorTree(root: TreeNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &mut Option>>) { if let Some(node) = root { diff --git "a/lcof/\351\235\242\350\257\225\351\242\23029. \351\241\272\346\227\266\351\222\210\346\211\223\345\215\260\347\237\251\351\230\265/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23029. \351\241\272\346\227\266\351\222\210\346\211\223\345\215\260\347\237\251\351\230\265/README.md" index 5597ab2645b8b..10bff7eed49b6 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23029. \351\241\272\346\227\266\351\222\210\346\211\223\345\215\260\347\237\251\351\230\265/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23029. \351\241\272\346\227\266\351\222\210\346\211\223\345\215\260\347\237\251\351\230\265/README.md" @@ -204,12 +204,8 @@ impl Solution { if matrix.len() == 0 { return ans; } - let (mut left, mut right, mut top, mut bottom) = ( - 0, - matrix[0].len() - 1, - 0, - matrix.len() - 1, - ); + let (mut left, mut right, mut top, mut bottom) = + (0, matrix[0].len() - 1, 0, matrix.len() - 1); loop { for i in left..right + 1 { ans.push(matrix[top][i]); diff --git "a/lcof/\351\235\242\350\257\225\351\242\23030. \345\214\205\345\220\253min\345\207\275\346\225\260\347\232\204\346\240\210/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23030. \345\214\205\345\220\253min\345\207\275\346\225\260\347\232\204\346\240\210/README.md" index b79b7a64b0bbf..388aa0de6f047 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23030. \345\214\205\345\220\253min\345\207\275\346\225\260\347\232\204\346\240\210/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23030. \345\214\205\345\220\253min\345\207\275\346\225\260\347\232\204\346\240\210/README.md" @@ -269,7 +269,10 @@ struct MinStack { impl MinStack { /** initialize your data structure here. */ fn new() -> Self { - Self { stack: VecDeque::new(), min_stack: VecDeque::new() } + Self { + stack: VecDeque::new(), + min_stack: VecDeque::new(), + } } fn push(&mut self, x: i32) { diff --git "a/lcof/\351\235\242\350\257\225\351\242\23032 - I. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23032 - I. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221/README.md" index d636b8966a3b5..f504c32686c1e 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23032 - I. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23032 - I. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221/README.md" @@ -250,9 +250,9 @@ function levelOrder(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn level_order(root: Option>>) -> Vec { let mut ans = Vec::new(); diff --git "a/lcof/\351\235\242\350\257\225\351\242\23032 - II. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 II/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23032 - II. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 II/README.md" index 5abd0fc0fdcb3..51eaff1a6facf 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23032 - II. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 II/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23032 - II. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 II/README.md" @@ -261,9 +261,9 @@ function levelOrder(root: TreeNode | null): number[][] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn level_order(root: Option>>) -> Vec> { let mut res = Vec::new(); diff --git "a/lcof/\351\235\242\350\257\225\351\242\23032 - III. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 III/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23032 - III. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 III/README.md" index 4ab03e4237ee2..2fbb7b9cf5083 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23032 - III. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 III/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23032 - III. \344\273\216\344\270\212\345\210\260\344\270\213\346\211\223\345\215\260\344\272\214\345\217\211\346\240\221 III/README.md" @@ -274,9 +274,9 @@ function levelOrder(root: TreeNode | null): number[][] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn level_order(root: Option>>) -> Vec> { let mut res = Vec::new(); diff --git "a/lcof/\351\235\242\350\257\225\351\242\23033. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\345\220\216\345\272\217\351\201\215\345\216\206\345\272\217\345\210\227/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23033. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\345\220\216\345\272\217\351\201\215\345\216\206\345\272\217\345\210\227/README.md" index 86bdf0f27ffa7..305490fa72e75 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23033. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\345\220\216\345\272\217\351\201\215\345\216\206\345\272\217\345\210\227/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23033. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\345\220\216\345\272\217\351\201\215\345\216\206\345\272\217\345\210\227/README.md" @@ -196,10 +196,8 @@ impl Solution { return false; } if val < root_val { - return ( - Self::dfs(start, i, root_val, postorder) && - Self::dfs(i + 1, end - 1, max_val, postorder) - ); + return (Self::dfs(start, i, root_val, postorder) + && Self::dfs(i + 1, end - 1, max_val, postorder)); } } Self::dfs(start, end - 1, max_val, postorder) diff --git "a/lcof/\351\235\242\350\257\225\351\242\23034. \344\272\214\345\217\211\346\240\221\344\270\255\345\222\214\344\270\272\346\237\220\344\270\200\345\200\274\347\232\204\350\267\257\345\276\204/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23034. \344\272\214\345\217\211\346\240\221\344\270\255\345\222\214\344\270\272\346\237\220\344\270\200\345\200\274\347\232\204\350\267\257\345\276\204/README.md" index 579caa5fa16fa..e687991a82a7f 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23034. \344\272\214\345\217\211\346\240\221\344\270\255\345\222\214\344\270\272\346\237\220\344\270\200\345\200\274\347\232\204\350\267\257\345\276\204/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23034. \344\272\214\345\217\211\346\240\221\344\270\255\345\222\214\344\270\272\346\237\220\344\270\200\345\200\274\347\232\204\350\267\257\345\276\204/README.md" @@ -272,14 +272,14 @@ function pathSum(root: TreeNode | null, target: number): number[][] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs( root: &Option>>, mut target: i32, t: &mut Vec, - ans: &mut Vec> + ans: &mut Vec>, ) { if let Some(node) = root.as_ref() { let node = node.borrow(); diff --git "a/lcof/\351\235\242\350\257\225\351\242\23045. \346\212\212\346\225\260\347\273\204\346\216\222\346\210\220\346\234\200\345\260\217\347\232\204\346\225\260/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23045. \346\212\212\346\225\260\347\273\204\346\216\222\346\210\220\346\234\200\345\260\217\347\232\204\346\225\260/README.md" index 7faee246fb171..04626ec2ea105 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23045. \346\212\212\346\225\260\347\273\204\346\216\222\346\210\220\346\234\200\345\260\217\347\232\204\346\225\260/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23045. \346\212\212\346\225\260\347\273\204\346\216\222\346\210\220\346\234\200\345\260\217\347\232\204\346\225\260/README.md" @@ -132,9 +132,7 @@ function minNumber(nums: number[]): string { impl Solution { pub fn min_number(mut nums: Vec) -> String { nums.sort_by(|a, b| format!("{}{}", a, b).cmp(&format!("{}{}", b, a))); - nums.iter() - .map(|num| num.to_string()) - .collect() + nums.iter().map(|num| num.to_string()).collect() } } ``` diff --git "a/lcof/\351\235\242\350\257\225\351\242\23054. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\347\254\254k\345\244\247\350\212\202\347\202\271/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23054. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\347\254\254k\345\244\247\350\212\202\347\202\271/README.md" index 8d575de4ac002..a92913332f5d4 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23054. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\347\254\254k\345\244\247\350\212\202\347\202\271/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23054. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\347\254\254k\345\244\247\350\212\202\347\202\271/README.md" @@ -244,8 +244,8 @@ function kthLargest(root: TreeNode | null, k: number): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, arr: &mut Vec) { diff --git "a/lcof/\351\235\242\350\257\225\351\242\23055 - I. \344\272\214\345\217\211\346\240\221\347\232\204\346\267\261\345\272\246/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23055 - I. \344\272\214\345\217\211\346\240\221\347\232\204\346\267\261\345\272\246/README.md" index adcb15bfdcc41..e7a9bbb140d55 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23055 - I. \344\272\214\345\217\211\346\240\221\347\232\204\346\267\261\345\272\246/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23055 - I. \344\272\214\345\217\211\346\240\221\347\232\204\346\267\261\345\272\246/README.md" @@ -157,8 +157,8 @@ func maxDepth(root *TreeNode) int { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn max_depth(root: Option>>) -> i32 { match root { diff --git "a/lcof/\351\235\242\350\257\225\351\242\23055 - II. \345\271\263\350\241\241\344\272\214\345\217\211\346\240\221/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23055 - II. \345\271\263\350\241\241\344\272\214\345\217\211\346\240\221/README.md" index fb84f44bd733a..048ebbe82f72c 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23055 - II. \345\271\263\350\241\241\344\272\214\345\217\211\346\240\221/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23055 - II. \345\271\263\350\241\241\344\272\214\345\217\211\346\240\221/README.md" @@ -221,8 +221,8 @@ func abs(x int) int { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>) -> i32 { match root { @@ -239,9 +239,9 @@ impl Solution { Some(node) => { let mut node = node.borrow_mut(); let a = 10; - (Self::dfs(&node.left) - Self::dfs(&node.right)).abs() <= 1 && - Self::is_balanced(node.left.take()) && - Self::is_balanced(node.right.take()) + (Self::dfs(&node.left) - Self::dfs(&node.right)).abs() <= 1 + && Self::is_balanced(node.left.take()) + && Self::is_balanced(node.right.take()) } } } diff --git "a/lcof/\351\235\242\350\257\225\351\242\23064. \346\261\2021+2+\342\200\246+n/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23064. \346\261\2021+2+\342\200\246+n/README.md" index a5567719f731d..4e54a20ac6a3e 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23064. \346\261\2021+2+\342\200\246+n/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23064. \346\261\2021+2+\342\200\246+n/README.md" @@ -106,13 +106,14 @@ var sumNums = function (n: number): number { ```rust impl Solution { pub fn sum_nums(mut n: i32) -> i32 { - n != 0 && - ( + n != 0 + && ( { n += Solution::sum_nums(n - 1); }, true, - ).1; + ) + .1; n } } diff --git "a/lcof/\351\235\242\350\257\225\351\242\23068 - I. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23068 - I. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210/README.md" index c59514fedcd0d..0572aca2c720c 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23068 - I. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23068 - I. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210/README.md" @@ -215,14 +215,14 @@ function lowestCommonAncestor( // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::cmp::Ordering; +use std::rc::Rc; impl Solution { pub fn lowest_common_ancestor( mut root: Option>>, p: Option>>, - q: Option>> + q: Option>>, ) -> Option>> { let p = p.unwrap().borrow().val; let q = q.unwrap().borrow().val; diff --git "a/lcof/\351\235\242\350\257\225\351\242\23068 - II. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210/README.md" "b/lcof/\351\235\242\350\257\225\351\242\23068 - II. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210/README.md" index 68b0c1530f460..03de51bb5331d 100644 --- "a/lcof/\351\235\242\350\257\225\351\242\23068 - II. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210/README.md" +++ "b/lcof/\351\235\242\350\257\225\351\242\23068 - II. \344\272\214\345\217\211\346\240\221\347\232\204\346\234\200\350\277\221\345\205\254\345\205\261\347\245\226\345\205\210/README.md" @@ -238,13 +238,13 @@ function lowestCommonAncestor( // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn lowest_common_ancestor( root: Option>>, p: Option>>, - q: Option>> + q: Option>>, ) -> Option>> { if root.is_none() || root == p || root == q { return root; @@ -252,12 +252,12 @@ impl Solution { let left = Self::lowest_common_ancestor( root.as_ref().unwrap().borrow_mut().left.take(), p.clone(), - q.clone() + q.clone(), ); let right = Self::lowest_common_ancestor( root.as_ref().unwrap().borrow_mut().right.take(), p.clone(), - q.clone() + q.clone(), ); match (left.is_none(), right.is_none()) { (true, false) => right, diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 038. \346\257\217\346\227\245\346\270\251\345\272\246/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 038. \346\257\217\346\227\245\346\270\251\345\272\246/README.md" index 9afc271cf6214..1aca7a5a5ca7a 100644 --- "a/lcof2/\345\211\221\346\214\207 Offer II 038. \346\257\217\346\227\245\346\270\251\345\272\246/README.md" +++ "b/lcof2/\345\211\221\346\214\207 Offer II 038. \346\257\217\346\227\245\346\270\251\345\272\246/README.md" @@ -172,7 +172,11 @@ impl Solution { while !stack.is_empty() && temperatures[*stack.last().unwrap()] <= temperatures[i] { stack.pop(); } - res[i] = if stack.is_empty() { 0 } else { (stack.last().unwrap() - i) as i32 }; + res[i] = if stack.is_empty() { + 0 + } else { + (stack.last().unwrap() - i) as i32 + }; stack.push(i); } res diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 051. \350\212\202\347\202\271\344\271\213\345\222\214\346\234\200\345\244\247\347\232\204\350\267\257\345\276\204/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 051. \350\212\202\347\202\271\344\271\213\345\222\214\346\234\200\345\244\247\347\232\204\350\267\257\345\276\204/README.md" index 6a1e1c79f182e..030d163b70103 100644 --- "a/lcof2/\345\211\221\346\214\207 Offer II 051. \350\212\202\347\202\271\344\271\213\345\222\214\346\234\200\345\244\247\347\232\204\350\267\257\345\276\204/README.md" +++ "b/lcof2/\345\211\221\346\214\207 Offer II 051. \350\212\202\347\202\271\344\271\213\345\222\214\346\234\200\345\244\247\347\232\204\350\267\257\345\276\204/README.md" @@ -259,8 +259,8 @@ function maxPathSum(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, res: &mut i32) -> i32 { if root.is_none() { diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 052. \345\261\225\345\271\263\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 052. \345\261\225\345\271\263\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221/README.md" index f07d2e3da88be..6c1a65bd11a08 100644 --- "a/lcof2/\345\211\221\346\214\207 Offer II 052. \345\261\225\345\271\263\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221/README.md" +++ "b/lcof2/\345\211\221\346\214\207 Offer II 052. \345\261\225\345\271\263\344\272\214\345\217\211\346\220\234\347\264\242\346\240\221/README.md" @@ -259,8 +259,8 @@ function increasingBST(root: TreeNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, vals: &mut Vec) { if root.is_none() { @@ -278,15 +278,11 @@ impl Solution { let mut dummy = Rc::new(RefCell::new(TreeNode::new(0))); for &val in vals.iter().rev() { let mut dummy = dummy.as_ref().borrow_mut(); - dummy.right = Some( - Rc::new( - RefCell::new(TreeNode { - val, - left: None, - right: dummy.right.take(), - }) - ) - ); + dummy.right = Some(Rc::new(RefCell::new(TreeNode { + val, + left: None, + right: dummy.right.take(), + }))); } let ans = dummy.as_ref().borrow_mut().right.take(); ans diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 054. \346\211\200\346\234\211\345\244\247\344\272\216\347\255\211\344\272\216\350\212\202\347\202\271\347\232\204\345\200\274\344\271\213\345\222\214/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 054. \346\211\200\346\234\211\345\244\247\344\272\216\347\255\211\344\272\216\350\212\202\347\202\271\347\232\204\345\200\274\344\271\213\345\222\214/README.md" index b67f283d92b8b..3368b722bdb4f 100644 --- "a/lcof2/\345\211\221\346\214\207 Offer II 054. \346\211\200\346\234\211\345\244\247\344\272\216\347\255\211\344\272\216\350\212\202\347\202\271\347\232\204\345\200\274\344\271\213\345\222\214/README.md" +++ "b/lcof2/\345\211\221\346\214\207 Offer II 054. \346\211\200\346\234\211\345\244\247\344\272\216\347\255\211\344\272\216\350\212\202\347\202\271\347\232\204\345\200\274\344\271\213\345\222\214/README.md" @@ -267,8 +267,8 @@ function convertBST(root: TreeNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, sum: &mut i32) { if let Some(node) = root { diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 055. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\277\255\344\273\243\345\231\250/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 055. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\277\255\344\273\243\345\231\250/README.md" index 9047583f1c5ee..61fcb6a13d892 100644 --- "a/lcof2/\345\211\221\346\214\207 Offer II 055. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\277\255\344\273\243\345\231\250/README.md" +++ "b/lcof2/\345\211\221\346\214\207 Offer II 055. \344\272\214\345\217\211\346\220\234\347\264\242\346\240\221\350\277\255\344\273\243\345\231\250/README.md" @@ -338,8 +338,8 @@ class BSTIterator { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; struct BSTIterator { stack: Vec, } @@ -363,9 +363,7 @@ impl BSTIterator { fn new(root: Option>>) -> Self { let mut stack = Vec::new(); Self::dfs(&root, &mut stack); - Self { - stack, - } + Self { stack } } fn next(&mut self) -> i32 { diff --git "a/lcp/LCP 06. \346\213\277\347\241\254\345\270\201/README.md" "b/lcp/LCP 06. \346\213\277\347\241\254\345\270\201/README.md" index dcd19d4422cf1..a13eeebc8f399 100644 --- "a/lcp/LCP 06. \346\213\277\347\241\254\345\270\201/README.md" +++ "b/lcp/LCP 06. \346\213\277\347\241\254\345\270\201/README.md" @@ -119,10 +119,7 @@ function minCount(coins: number[]): number { ```rust impl Solution { pub fn min_count(coins: Vec) -> i32 { - coins - .iter() - .map(|&x| (x + 1) >> 1) - .sum::() + coins.iter().map(|&x| (x + 1) >> 1).sum::() } } ``` diff --git a/run_format.py b/run_format.py index 0c72c6d53137f..6754fdb72561b 100644 --- a/run_format.py +++ b/run_format.py @@ -1,6 +1,8 @@ from typing import List import os.path +import platform +import subprocess import re import black @@ -286,7 +288,7 @@ def format_inline_code(path: str): if not block or not block.strip(): continue if suf in ["c", "cpp", "java", "go"]: - file = f"{root}/Solution2.{suf}" + file = f"{root}/tmp.{suf}" with open(file, "w", encoding="utf-8") as f: f.write(block) if suf == "go": @@ -314,11 +316,71 @@ def format_inline_code(path: str): ) content = content.replace(block, new_block) block = new_block + elif suf == "rust": + file = f"{root}/tmp.rs" + with open(file, "w", encoding="utf-8") as f: + f.write(block) + os.system(f'rustfmt "{file}"') + with open(file, "r", encoding="utf-8") as f: + new_block = f.read() + if not new_block.endswith("\n"): + new_block += "\n" + content = content.replace(block, new_block) + os.remove(file) with open(path, "w", encoding="utf-8") as f: f.write(content) +def format_rust_files_linux(): + # The find command to locate and format all .rs files in Linux + find_command = 'find . -name "*.rs" -exec rustfmt {} \\;' + + # Execute the command + process = subprocess.Popen( + find_command, + shell=True, + stdout=subprocess.PIPE, + stderr=subprocess.PIPE, + text=True, + ) + + # Get the output and errors + stdout, stderr = process.communicate() + + if process.returncode == 0: + print("Rust files formatted successfully on Linux!") + print(stdout) + else: + print("Error formatting Rust files on Linux:") + print(stderr) + + +def format_rust_files_windows(): + # PowerShell command to format all .rs files recursively in Windows + ps_command = ( + "Get-ChildItem -Recurse -Filter *.rs | ForEach-Object { rustfmt $_.FullName }" + ) + + # Execute the PowerShell command + process = subprocess.Popen( + ["powershell", "-Command", ps_command], + stdout=subprocess.PIPE, + stderr=subprocess.PIPE, + text=True, + ) + + # Get the output and errors + stdout, stderr = process.communicate() + + if process.returncode == 0: + print("Rust files formatted successfully on Windows!") + print(stdout) + else: + print("Error formatting Rust files on Windows:") + print(stderr) + + def run(): """Start formatting""" paths = find_all_paths() @@ -336,7 +398,10 @@ def run(): os.system("gofmt -w .") # format with rustfmt - os.system('find . -name "*.rs" -exec rustfmt {} \\;') + if platform.system() == "Linux": + format_rust_files_linux() + else: + format_rust_files_windows() for path in paths: remove_header(path) diff --git a/solution/0000-0099/0002.Add Two Numbers/README.md b/solution/0000-0099/0002.Add Two Numbers/README.md index 635d780d940e3..3806f64b53d17 100644 --- a/solution/0000-0099/0002.Add Two Numbers/README.md +++ b/solution/0000-0099/0002.Add Two Numbers/README.md @@ -257,7 +257,7 @@ function addTwoNumbers(l1: ListNode | null, l2: ListNode | null): ListNode | nul impl Solution { pub fn add_two_numbers( mut l1: Option>, - mut l2: Option> + mut l2: Option>, ) -> Option> { let mut dummy = Some(Box::new(ListNode::new(0))); let mut cur = &mut dummy; diff --git a/solution/0000-0099/0002.Add Two Numbers/README_EN.md b/solution/0000-0099/0002.Add Two Numbers/README_EN.md index 0692de009adbe..f6878f0937322 100644 --- a/solution/0000-0099/0002.Add Two Numbers/README_EN.md +++ b/solution/0000-0099/0002.Add Two Numbers/README_EN.md @@ -253,7 +253,7 @@ function addTwoNumbers(l1: ListNode | null, l2: ListNode | null): ListNode | nul impl Solution { pub fn add_two_numbers( mut l1: Option>, - mut l2: Option> + mut l2: Option>, ) -> Option> { let mut dummy = Some(Box::new(ListNode::new(0))); let mut cur = &mut dummy; diff --git a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md index 3ccff6d099d5b..8fa9d3034f3ba 100644 --- a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md +++ b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md @@ -185,8 +185,7 @@ impl Solution { let s = s.as_bytes(); let mut ss = HashSet::new(); let mut i = 0; - s - .iter() + s.iter() .map(|c| { while ss.contains(&c) { ss.remove(&s[i]); diff --git a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md index 699444fecaaf9..d36a769767aaf 100644 --- a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md +++ b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md @@ -183,8 +183,7 @@ impl Solution { let s = s.as_bytes(); let mut ss = HashSet::new(); let mut i = 0; - s - .iter() + s.iter() .map(|c| { while ss.contains(&c) { ss.remove(&s[i]); diff --git a/solution/0000-0099/0007.Reverse Integer/README.md b/solution/0000-0099/0007.Reverse Integer/README.md index 2a415a12be25c..20a294ba1c308 100644 --- a/solution/0000-0099/0007.Reverse Integer/README.md +++ b/solution/0000-0099/0007.Reverse Integer/README.md @@ -162,7 +162,14 @@ func reverse(x int) (ans int) { impl Solution { pub fn reverse(mut x: i32) -> i32 { let is_minus = x < 0; - match x.abs().to_string().chars().rev().collect::().parse::() { + match x + .abs() + .to_string() + .chars() + .rev() + .collect::() + .parse::() + { Ok(x) => x * (if is_minus { -1 } else { 1 }), Err(_) => 0, } diff --git a/solution/0000-0099/0007.Reverse Integer/README_EN.md b/solution/0000-0099/0007.Reverse Integer/README_EN.md index f4780e71e3874..2297405a28828 100644 --- a/solution/0000-0099/0007.Reverse Integer/README_EN.md +++ b/solution/0000-0099/0007.Reverse Integer/README_EN.md @@ -152,7 +152,14 @@ func reverse(x int) (ans int) { impl Solution { pub fn reverse(mut x: i32) -> i32 { let is_minus = x < 0; - match x.abs().to_string().chars().rev().collect::().parse::() { + match x + .abs() + .to_string() + .chars() + .rev() + .collect::() + .parse::() + { Ok(x) => x * (if is_minus { -1 } else { 1 }), Err(_) => 0, } diff --git a/solution/0000-0099/0010.Regular Expression Matching/README.md b/solution/0000-0099/0010.Regular Expression Matching/README.md index c666e7a09b269..eb824ee89d247 100644 --- a/solution/0000-0099/0010.Regular Expression Matching/README.md +++ b/solution/0000-0099/0010.Regular Expression Matching/README.md @@ -222,7 +222,7 @@ impl Solution { i: usize, j: usize, m: usize, - n: usize + n: usize, ) -> bool { if j >= n { return i == m; @@ -232,9 +232,8 @@ impl Solution { } let mut res = -1; if j + 1 < n && p[j + 1] == '*' { - if - dfs(s, p, f, i, j + 2, m, n) || - (i < m && (s[i] == p[j] || p[j] == '.') && dfs(s, p, f, i + 1, j, m, n)) + if dfs(s, p, f, i, j + 2, m, n) + || (i < m && (s[i] == p[j] || p[j] == '.') && dfs(s, p, f, i + 1, j, m, n)) { res = 1; } @@ -245,7 +244,15 @@ impl Solution { res == 1 } - dfs(&s.chars().collect(), &p.chars().collect(), &mut f, 0, 0, m, n) + dfs( + &s.chars().collect(), + &p.chars().collect(), + &mut f, + 0, + 0, + m, + n, + ) } } ``` diff --git a/solution/0000-0099/0010.Regular Expression Matching/README_EN.md b/solution/0000-0099/0010.Regular Expression Matching/README_EN.md index d121f57f81c60..d7302fddd9809 100644 --- a/solution/0000-0099/0010.Regular Expression Matching/README_EN.md +++ b/solution/0000-0099/0010.Regular Expression Matching/README_EN.md @@ -221,7 +221,7 @@ impl Solution { i: usize, j: usize, m: usize, - n: usize + n: usize, ) -> bool { if j >= n { return i == m; @@ -231,9 +231,8 @@ impl Solution { } let mut res = -1; if j + 1 < n && p[j + 1] == '*' { - if - dfs(s, p, f, i, j + 2, m, n) || - (i < m && (s[i] == p[j] || p[j] == '.') && dfs(s, p, f, i + 1, j, m, n)) + if dfs(s, p, f, i, j + 2, m, n) + || (i < m && (s[i] == p[j] || p[j] == '.') && dfs(s, p, f, i + 1, j, m, n)) { res = 1; } @@ -244,7 +243,15 @@ impl Solution { res == 1 } - dfs(&s.chars().collect(), &p.chars().collect(), &mut f, 0, 0, m, n) + dfs( + &s.chars().collect(), + &p.chars().collect(), + &mut f, + 0, + 0, + m, + n, + ) } } ``` diff --git a/solution/0000-0099/0012.Integer to Roman/README.md b/solution/0000-0099/0012.Integer to Roman/README.md index 97834846dc636..815d37edba30b 100644 --- a/solution/0000-0099/0012.Integer to Roman/README.md +++ b/solution/0000-0099/0012.Integer to Roman/README.md @@ -237,7 +237,9 @@ function intToRoman(num: number): string { ```rust impl Solution { pub fn int_to_roman(num: i32) -> String { - let cs = ["M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"]; + let cs = [ + "M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I", + ]; let vs = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]; let mut num = num; let mut ans = String::new(); diff --git a/solution/0000-0099/0012.Integer to Roman/README_EN.md b/solution/0000-0099/0012.Integer to Roman/README_EN.md index 505d7b461c85a..c7b57f780c463 100644 --- a/solution/0000-0099/0012.Integer to Roman/README_EN.md +++ b/solution/0000-0099/0012.Integer to Roman/README_EN.md @@ -235,7 +235,9 @@ function intToRoman(num: number): string { ```rust impl Solution { pub fn int_to_roman(num: i32) -> String { - let cs = ["M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"]; + let cs = [ + "M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I", + ]; let vs = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]; let mut num = num; let mut ans = String::new(); diff --git a/solution/0000-0099/0013.Roman to Integer/README.md b/solution/0000-0099/0013.Roman to Integer/README.md index 1e18ec7953214..ca5d3ca8955b6 100644 --- a/solution/0000-0099/0013.Roman to Integer/README.md +++ b/solution/0000-0099/0013.Roman to Integer/README.md @@ -204,9 +204,17 @@ function romanToInt(s: string): number { ```rust impl Solution { pub fn roman_to_int(s: String) -> i32 { - let d = vec![('I', 1), ('V', 5), ('X', 10), ('L', 50), ('C', 100), ('D', 500), ('M', 1000)] - .into_iter() - .collect::>(); + let d = vec![ + ('I', 1), + ('V', 5), + ('X', 10), + ('L', 50), + ('C', 100), + ('D', 500), + ('M', 1000), + ] + .into_iter() + .collect::>(); let s: Vec = s.chars().collect(); let mut ans = 0; diff --git a/solution/0000-0099/0013.Roman to Integer/README_EN.md b/solution/0000-0099/0013.Roman to Integer/README_EN.md index b38823e114ef6..099ed325658a3 100644 --- a/solution/0000-0099/0013.Roman to Integer/README_EN.md +++ b/solution/0000-0099/0013.Roman to Integer/README_EN.md @@ -190,9 +190,17 @@ function romanToInt(s: string): number { ```rust impl Solution { pub fn roman_to_int(s: String) -> i32 { - let d = vec![('I', 1), ('V', 5), ('X', 10), ('L', 50), ('C', 100), ('D', 500), ('M', 1000)] - .into_iter() - .collect::>(); + let d = vec![ + ('I', 1), + ('V', 5), + ('X', 10), + ('L', 50), + ('C', 100), + ('D', 500), + ('M', 1000), + ] + .into_iter() + .collect::>(); let s: Vec = s.chars().collect(); let mut ans = 0; diff --git a/solution/0000-0099/0014.Longest Common Prefix/README.md b/solution/0000-0099/0014.Longest Common Prefix/README.md index 60aed7b345167..94c9bfbe90b0e 100644 --- a/solution/0000-0099/0014.Longest Common Prefix/README.md +++ b/solution/0000-0099/0014.Longest Common Prefix/README.md @@ -148,11 +148,7 @@ function longestCommonPrefix(strs: string[]): string { ```rust impl Solution { pub fn longest_common_prefix(strs: Vec) -> String { - let mut len = strs - .iter() - .map(|s| s.len()) - .min() - .unwrap(); + let mut len = strs.iter().map(|s| s.len()).min().unwrap(); for i in (1..=len).rev() { let mut is_equal = true; let target = strs[0][0..i].to_string(); diff --git a/solution/0000-0099/0014.Longest Common Prefix/README_EN.md b/solution/0000-0099/0014.Longest Common Prefix/README_EN.md index 823f95aba280d..78d633afe5956 100644 --- a/solution/0000-0099/0014.Longest Common Prefix/README_EN.md +++ b/solution/0000-0099/0014.Longest Common Prefix/README_EN.md @@ -147,11 +147,7 @@ function longestCommonPrefix(strs: string[]): string { ```rust impl Solution { pub fn longest_common_prefix(strs: Vec) -> String { - let mut len = strs - .iter() - .map(|s| s.len()) - .min() - .unwrap(); + let mut len = strs.iter().map(|s| s.len()).min().unwrap(); for i in (1..=len).rev() { let mut is_equal = true; let target = strs[0][0..i].to_string(); diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/README.md b/solution/0000-0099/0021.Merge Two Sorted Lists/README.md index f9e7c4440dab9..264c42ada1421 100644 --- a/solution/0000-0099/0021.Merge Two Sorted Lists/README.md +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/README.md @@ -230,7 +230,7 @@ function mergeTwoLists(list1: ListNode | null, list2: ListNode | null): ListNode impl Solution { pub fn merge_two_lists( list1: Option>, - list2: Option> + list2: Option>, ) -> Option> { match (list1, list2) { (None, None) => None, @@ -547,7 +547,7 @@ function mergeTwoLists(list1: ListNode | null, list2: ListNode | null): ListNode impl Solution { pub fn merge_two_lists( mut list1: Option>, - mut list2: Option> + mut list2: Option>, ) -> Option> { let mut new_list = ListNode::new(0); let mut cur = &mut new_list; diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md b/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md index 7f9d8daa39f61..1aaa040d75715 100644 --- a/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md +++ b/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md @@ -232,7 +232,7 @@ function mergeTwoLists(list1: ListNode | null, list2: ListNode | null): ListNode impl Solution { pub fn merge_two_lists( list1: Option>, - list2: Option> + list2: Option>, ) -> Option> { match (list1, list2) { (None, None) => None, @@ -549,7 +549,7 @@ function mergeTwoLists(list1: ListNode | null, list2: ListNode | null): ListNode impl Solution { pub fn merge_two_lists( mut list1: Option>, - mut list2: Option> + mut list2: Option>, ) -> Option> { let mut new_list = ListNode::new(0); let mut cur = &mut new_list; diff --git a/solution/0000-0099/0032.Longest Valid Parentheses/README.md b/solution/0000-0099/0032.Longest Valid Parentheses/README.md index 3e346ace42bb3..6f29dbc123039 100644 --- a/solution/0000-0099/0032.Longest Valid Parentheses/README.md +++ b/solution/0000-0099/0032.Longest Valid Parentheses/README.md @@ -208,25 +208,11 @@ impl Solution { let mut ans = 0; let mut f = vec![0; s.len() + 1]; for i in 2..=s.len() { - if - s - .chars() - .nth(i - 1) - .unwrap() == ')' - { - if - s - .chars() - .nth(i - 2) - .unwrap() == '(' - { + if s.chars().nth(i - 1).unwrap() == ')' { + if s.chars().nth(i - 2).unwrap() == '(' { f[i] = f[i - 2] + 2; - } else if - (i as i32) - f[i - 1] - 1 > 0 && - s - .chars() - .nth(i - (f[i - 1] as usize) - 2) - .unwrap() == '(' + } else if (i as i32) - f[i - 1] - 1 > 0 + && s.chars().nth(i - (f[i - 1] as usize) - 2).unwrap() == '(' { f[i] = f[i - 1] + 2 + f[i - (f[i - 1] as usize) - 2]; } diff --git a/solution/0000-0099/0032.Longest Valid Parentheses/README_EN.md b/solution/0000-0099/0032.Longest Valid Parentheses/README_EN.md index 5e644f686b175..c6dba25b590ca 100644 --- a/solution/0000-0099/0032.Longest Valid Parentheses/README_EN.md +++ b/solution/0000-0099/0032.Longest Valid Parentheses/README_EN.md @@ -206,25 +206,11 @@ impl Solution { let mut ans = 0; let mut f = vec![0; s.len() + 1]; for i in 2..=s.len() { - if - s - .chars() - .nth(i - 1) - .unwrap() == ')' - { - if - s - .chars() - .nth(i - 2) - .unwrap() == '(' - { + if s.chars().nth(i - 1).unwrap() == ')' { + if s.chars().nth(i - 2).unwrap() == '(' { f[i] = f[i - 2] + 2; - } else if - (i as i32) - f[i - 1] - 1 > 0 && - s - .chars() - .nth(i - (f[i - 1] as usize) - 2) - .unwrap() == '(' + } else if (i as i32) - f[i - 1] - 1 > 0 + && s.chars().nth(i - (f[i - 1] as usize) - 2).unwrap() == '(' { f[i] = f[i - 1] + 2 + f[i - (f[i - 1] as usize) - 2]; } diff --git a/solution/0000-0099/0041.First Missing Positive/README.md b/solution/0000-0099/0041.First Missing Positive/README.md index b8cfef2dbafee..efdeb9c2259c8 100644 --- a/solution/0000-0099/0041.First Missing Positive/README.md +++ b/solution/0000-0099/0041.First Missing Positive/README.md @@ -189,13 +189,12 @@ impl Solution { nums.swap(i, j as usize); } } - ( - nums - .iter() - .enumerate() - .position(|(i, &v)| (v as usize) != i + 1) - .unwrap_or(n) as i32 - ) + 1 + (nums + .iter() + .enumerate() + .position(|(i, &v)| (v as usize) != i + 1) + .unwrap_or(n) as i32) + + 1 } } ``` diff --git a/solution/0000-0099/0041.First Missing Positive/README_EN.md b/solution/0000-0099/0041.First Missing Positive/README_EN.md index 2377aa7fb0236..cfebe29e8cf3f 100644 --- a/solution/0000-0099/0041.First Missing Positive/README_EN.md +++ b/solution/0000-0099/0041.First Missing Positive/README_EN.md @@ -191,13 +191,12 @@ impl Solution { nums.swap(i, j as usize); } } - ( - nums - .iter() - .enumerate() - .position(|(i, &v)| (v as usize) != i + 1) - .unwrap_or(n) as i32 - ) + 1 + (nums + .iter() + .enumerate() + .position(|(i, &v)| (v as usize) != i + 1) + .unwrap_or(n) as i32) + + 1 } } ``` diff --git a/solution/0000-0099/0049.Group Anagrams/README.md b/solution/0000-0099/0049.Group Anagrams/README.md index 9767b3ebee38f..404f965482ca4 100644 --- a/solution/0000-0099/0049.Group Anagrams/README.md +++ b/solution/0000-0099/0049.Group Anagrams/README.md @@ -179,9 +179,7 @@ impl Solution { let val = map.entry(key).or_insert(vec![]); val.push(s); } - map.into_iter() - .map(|(_, v)| v) - .collect() + map.into_iter().map(|(_, v)| v).collect() } } ``` diff --git a/solution/0000-0099/0049.Group Anagrams/README_EN.md b/solution/0000-0099/0049.Group Anagrams/README_EN.md index 2f82a01e52cca..acfbcd0b85a09 100644 --- a/solution/0000-0099/0049.Group Anagrams/README_EN.md +++ b/solution/0000-0099/0049.Group Anagrams/README_EN.md @@ -168,9 +168,7 @@ impl Solution { let val = map.entry(key).or_insert(vec![]); val.push(s); } - map.into_iter() - .map(|(_, v)| v) - .collect() + map.into_iter().map(|(_, v)| v).collect() } } ``` diff --git a/solution/0000-0099/0065.Valid Number/README.md b/solution/0000-0099/0065.Valid Number/README.md index e33b4712e5344..e3e9620a83816 100644 --- a/solution/0000-0099/0065.Valid Number/README.md +++ b/solution/0000-0099/0065.Valid Number/README.md @@ -266,10 +266,13 @@ impl Solution { } } if let Some(x) = s.chars().nth(i) { - if - x == '.' && - (i + 1 == n || - (if let Some(m) = s.chars().nth(i + 1) { m == 'e' || m == 'E' } else { false })) + if x == '.' + && (i + 1 == n + || (if let Some(m) = s.chars().nth(i + 1) { + m == 'e' || m == 'E' + } else { + false + })) { return false; } diff --git a/solution/0000-0099/0065.Valid Number/README_EN.md b/solution/0000-0099/0065.Valid Number/README_EN.md index 434aa0a18abee..941bd4cdafcd7 100644 --- a/solution/0000-0099/0065.Valid Number/README_EN.md +++ b/solution/0000-0099/0065.Valid Number/README_EN.md @@ -264,10 +264,13 @@ impl Solution { } } if let Some(x) = s.chars().nth(i) { - if - x == '.' && - (i + 1 == n || - (if let Some(m) = s.chars().nth(i + 1) { m == 'e' || m == 'E' } else { false })) + if x == '.' + && (i + 1 == n + || (if let Some(m) = s.chars().nth(i + 1) { + m == 'e' || m == 'E' + } else { + false + })) { return false; } diff --git a/solution/0000-0099/0079.Word Search/README.md b/solution/0000-0099/0079.Word Search/README.md index 9c98571dd64fc..251a0731df458 100644 --- a/solution/0000-0099/0079.Word Search/README.md +++ b/solution/0000-0099/0079.Word Search/README.md @@ -274,7 +274,7 @@ impl Solution { c: usize, word: &[u8], board: &Vec>, - vis: &mut Vec> + vis: &mut Vec>, ) -> bool { if (board[i][j] as u8) != word[c] { return false; @@ -283,12 +283,7 @@ impl Solution { return true; } vis[i][j] = true; - let dirs = [ - [-1, 0], - [0, -1], - [1, 0], - [0, 1], - ]; + let dirs = [[-1, 0], [0, -1], [1, 0], [0, 1]]; for [x, y] in dirs.into_iter() { let i = x + (i as i32); let j = y + (j as i32); diff --git a/solution/0000-0099/0079.Word Search/README_EN.md b/solution/0000-0099/0079.Word Search/README_EN.md index 997bd0986d218..74075b7865b58 100644 --- a/solution/0000-0099/0079.Word Search/README_EN.md +++ b/solution/0000-0099/0079.Word Search/README_EN.md @@ -271,7 +271,7 @@ impl Solution { c: usize, word: &[u8], board: &Vec>, - vis: &mut Vec> + vis: &mut Vec>, ) -> bool { if (board[i][j] as u8) != word[c] { return false; @@ -280,12 +280,7 @@ impl Solution { return true; } vis[i][j] = true; - let dirs = [ - [-1, 0], - [0, -1], - [1, 0], - [0, 1], - ]; + let dirs = [[-1, 0], [0, -1], [1, 0], [0, 1]]; for [x, y] in dirs.into_iter() { let i = x + (i as i32); let j = y + (j as i32); diff --git a/solution/0000-0099/0092.Reverse Linked List II/README.md b/solution/0000-0099/0092.Reverse Linked List II/README.md index 167ad9ea49943..f1e9360a78a97 100644 --- a/solution/0000-0099/0092.Reverse Linked List II/README.md +++ b/solution/0000-0099/0092.Reverse Linked List II/README.md @@ -268,7 +268,7 @@ impl Solution { pub fn reverse_between( head: Option>, left: i32, - right: i32 + right: i32, ) -> Option> { let mut dummy = Some(Box::new(ListNode { val: 0, next: head })); let mut pre = &mut dummy; diff --git a/solution/0000-0099/0092.Reverse Linked List II/README_EN.md b/solution/0000-0099/0092.Reverse Linked List II/README_EN.md index a734f08ee2c3c..2b5edbf6023b9 100644 --- a/solution/0000-0099/0092.Reverse Linked List II/README_EN.md +++ b/solution/0000-0099/0092.Reverse Linked List II/README_EN.md @@ -265,7 +265,7 @@ impl Solution { pub fn reverse_between( head: Option>, left: i32, - right: i32 + right: i32, ) -> Option> { let mut dummy = Some(Box::new(ListNode { val: 0, next: head })); let mut pre = &mut dummy; diff --git a/solution/0000-0099/0094.Binary Tree Inorder Traversal/README.md b/solution/0000-0099/0094.Binary Tree Inorder Traversal/README.md index e975066143786..4fbed8d858ed2 100644 --- a/solution/0000-0099/0094.Binary Tree Inorder Traversal/README.md +++ b/solution/0000-0099/0094.Binary Tree Inorder Traversal/README.md @@ -242,8 +242,8 @@ function inorderTraversal(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, ans: &mut Vec) { if root.is_none() { @@ -490,8 +490,8 @@ function inorderTraversal(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn inorder_traversal(mut root: Option>>) -> Vec { let mut ans = vec![]; diff --git a/solution/0000-0099/0094.Binary Tree Inorder Traversal/README_EN.md b/solution/0000-0099/0094.Binary Tree Inorder Traversal/README_EN.md index 9207f973f223f..896dc81bfa685 100644 --- a/solution/0000-0099/0094.Binary Tree Inorder Traversal/README_EN.md +++ b/solution/0000-0099/0094.Binary Tree Inorder Traversal/README_EN.md @@ -239,8 +239,8 @@ function inorderTraversal(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, ans: &mut Vec) { if root.is_none() { @@ -487,8 +487,8 @@ function inorderTraversal(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn inorder_traversal(mut root: Option>>) -> Vec { let mut ans = vec![]; diff --git a/solution/0000-0099/0095.Unique Binary Search Trees II/README.md b/solution/0000-0099/0095.Unique Binary Search Trees II/README.md index 9e90e8f8a1d5a..da0a3b97e6f50 100644 --- a/solution/0000-0099/0095.Unique Binary Search Trees II/README.md +++ b/solution/0000-0099/0095.Unique Binary Search Trees II/README.md @@ -268,8 +268,8 @@ function generateTrees(n: number): Array { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn generate_trees(n: i32) -> Vec>>> { Self::dfs(1, n) @@ -286,17 +286,11 @@ impl Solution { let right = Self::dfs(v + 1, j); for l in &left { for r in &right { - ans.push( - Some( - Rc::new( - RefCell::new(TreeNode { - val: v, - left: l.clone(), - right: r.clone(), - }) - ) - ) - ); + ans.push(Some(Rc::new(RefCell::new(TreeNode { + val: v, + left: l.clone(), + right: r.clone(), + })))); } } } diff --git a/solution/0000-0099/0095.Unique Binary Search Trees II/README_EN.md b/solution/0000-0099/0095.Unique Binary Search Trees II/README_EN.md index 2211d9e750623..31c286dc9e121 100644 --- a/solution/0000-0099/0095.Unique Binary Search Trees II/README_EN.md +++ b/solution/0000-0099/0095.Unique Binary Search Trees II/README_EN.md @@ -262,8 +262,8 @@ function generateTrees(n: number): Array { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn generate_trees(n: i32) -> Vec>>> { Self::dfs(1, n) @@ -280,17 +280,11 @@ impl Solution { let right = Self::dfs(v + 1, j); for l in &left { for r in &right { - ans.push( - Some( - Rc::new( - RefCell::new(TreeNode { - val: v, - left: l.clone(), - right: r.clone(), - }) - ) - ) - ); + ans.push(Some(Rc::new(RefCell::new(TreeNode { + val: v, + left: l.clone(), + right: r.clone(), + })))); } } } diff --git a/solution/0000-0099/0097.Interleaving String/README.md b/solution/0000-0099/0097.Interleaving String/README.md index 2b7b2430e5c21..564d3cc41af10 100644 --- a/solution/0000-0099/0097.Interleaving String/README.md +++ b/solution/0000-0099/0097.Interleaving String/README.md @@ -274,7 +274,7 @@ impl Solution { 0, &s1.chars().collect(), &s2.chars().collect(), - &s3.chars().collect() + &s3.chars().collect(), ) } @@ -287,7 +287,7 @@ impl Solution { j: usize, s1: &Vec, s2: &Vec, - s3: &Vec + s3: &Vec, ) -> bool { if i >= n && j >= m { return true; @@ -307,11 +307,10 @@ impl Solution { } // If the first approach does not succeed, let's then try `s2` - if - record[i][j] == 0 && - j < m && - s2[j] == s3[k] && - Self::dfs(record, n, m, i, j + 1, s1, s2, s3) + if record[i][j] == 0 + && j < m + && s2[j] == s3[k] + && Self::dfs(record, n, m, i, j + 1, s1, s2, s3) { record[i][j] = 1; } diff --git a/solution/0000-0099/0097.Interleaving String/README_EN.md b/solution/0000-0099/0097.Interleaving String/README_EN.md index acb6a5f016607..eb48eb39c68a2 100644 --- a/solution/0000-0099/0097.Interleaving String/README_EN.md +++ b/solution/0000-0099/0097.Interleaving String/README_EN.md @@ -276,7 +276,7 @@ impl Solution { 0, &s1.chars().collect(), &s2.chars().collect(), - &s3.chars().collect() + &s3.chars().collect(), ) } @@ -289,7 +289,7 @@ impl Solution { j: usize, s1: &Vec, s2: &Vec, - s3: &Vec + s3: &Vec, ) -> bool { if i >= n && j >= m { return true; @@ -309,11 +309,10 @@ impl Solution { } // If the first approach does not succeed, let's then try `s2` - if - record[i][j] == 0 && - j < m && - s2[j] == s3[k] && - Self::dfs(record, n, m, i, j + 1, s1, s2, s3) + if record[i][j] == 0 + && j < m + && s2[j] == s3[k] + && Self::dfs(record, n, m, i, j + 1, s1, s2, s3) { record[i][j] = 1; } diff --git a/solution/0000-0099/0098.Validate Binary Search Tree/README.md b/solution/0000-0099/0098.Validate Binary Search Tree/README.md index c1b350c8aba60..129b61bafaef8 100644 --- a/solution/0000-0099/0098.Validate Binary Search Tree/README.md +++ b/solution/0000-0099/0098.Validate Binary Search Tree/README.md @@ -262,8 +262,8 @@ function isValidBST(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, prev: &mut Option) -> bool { if root.is_none() { diff --git a/solution/0000-0099/0098.Validate Binary Search Tree/README_EN.md b/solution/0000-0099/0098.Validate Binary Search Tree/README_EN.md index cddfa5502d578..ffeedfb757f39 100644 --- a/solution/0000-0099/0098.Validate Binary Search Tree/README_EN.md +++ b/solution/0000-0099/0098.Validate Binary Search Tree/README_EN.md @@ -260,8 +260,8 @@ function isValidBST(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, prev: &mut Option) -> bool { if root.is_none() { diff --git a/solution/0100-0199/0100.Same Tree/README.md b/solution/0100-0199/0100.Same Tree/README.md index 84e9014b184e4..aae71dd557c3c 100644 --- a/solution/0100-0199/0100.Same Tree/README.md +++ b/solution/0100-0199/0100.Same Tree/README.md @@ -211,8 +211,8 @@ function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(p: &Option>>, q: &Option>>) -> bool { if p.is_none() && q.is_none() { @@ -228,7 +228,7 @@ impl Solution { pub fn is_same_tree( p: Option>>, - q: Option>> + q: Option>>, ) -> bool { Self::dfs(&p, &q) } @@ -575,13 +575,13 @@ function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn is_same_tree( mut p: Option>>, - mut q: Option>> + mut q: Option>>, ) -> bool { let mut queue = VecDeque::new(); if p.is_some() { diff --git a/solution/0100-0199/0100.Same Tree/README_EN.md b/solution/0100-0199/0100.Same Tree/README_EN.md index 104e6b3e64ec1..77d9e8682c802 100644 --- a/solution/0100-0199/0100.Same Tree/README_EN.md +++ b/solution/0100-0199/0100.Same Tree/README_EN.md @@ -209,8 +209,8 @@ function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(p: &Option>>, q: &Option>>) -> bool { if p.is_none() && q.is_none() { @@ -226,7 +226,7 @@ impl Solution { pub fn is_same_tree( p: Option>>, - q: Option>> + q: Option>>, ) -> bool { Self::dfs(&p, &q) } @@ -573,13 +573,13 @@ function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn is_same_tree( mut p: Option>>, - mut q: Option>> + mut q: Option>>, ) -> bool { let mut queue = VecDeque::new(); if p.is_some() { diff --git a/solution/0100-0199/0101.Symmetric Tree/README.md b/solution/0100-0199/0101.Symmetric Tree/README.md index 92b7e874e3fa0..800a5c5ba45ee 100644 --- a/solution/0100-0199/0101.Symmetric Tree/README.md +++ b/solution/0100-0199/0101.Symmetric Tree/README.md @@ -232,8 +232,8 @@ function isSymmetric(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root1: &Option>>, root2: &Option>>) -> bool { if root1.is_none() && root2.is_none() { @@ -244,9 +244,9 @@ impl Solution { } let node1 = root1.as_ref().unwrap().borrow(); let node2 = root2.as_ref().unwrap().borrow(); - node1.val == node2.val && - Self::dfs(&node1.left, &node2.right) && - Self::dfs(&node1.right, &node2.left) + node1.val == node2.val + && Self::dfs(&node1.left, &node2.right) + && Self::dfs(&node1.right, &node2.left) } pub fn is_symmetric(root: Option>>) -> bool { @@ -312,9 +312,9 @@ var isSymmetric = function (root) { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn is_symmetric(root: Option>>) -> bool { let root = root.unwrap(); diff --git a/solution/0100-0199/0101.Symmetric Tree/README_EN.md b/solution/0100-0199/0101.Symmetric Tree/README_EN.md index a1a2981119196..9fc42e2e1fd12 100644 --- a/solution/0100-0199/0101.Symmetric Tree/README_EN.md +++ b/solution/0100-0199/0101.Symmetric Tree/README_EN.md @@ -229,8 +229,8 @@ function isSymmetric(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root1: &Option>>, root2: &Option>>) -> bool { if root1.is_none() && root2.is_none() { @@ -241,9 +241,9 @@ impl Solution { } let node1 = root1.as_ref().unwrap().borrow(); let node2 = root2.as_ref().unwrap().borrow(); - node1.val == node2.val && - Self::dfs(&node1.left, &node2.right) && - Self::dfs(&node1.right, &node2.left) + node1.val == node2.val + && Self::dfs(&node1.left, &node2.right) + && Self::dfs(&node1.right, &node2.left) } pub fn is_symmetric(root: Option>>) -> bool { @@ -309,9 +309,9 @@ var isSymmetric = function (root) { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn is_symmetric(root: Option>>) -> bool { let root = root.unwrap(); diff --git a/solution/0100-0199/0102.Binary Tree Level Order Traversal/README.md b/solution/0100-0199/0102.Binary Tree Level Order Traversal/README.md index 0f9f0f4417653..abdc0cb6c0299 100644 --- a/solution/0100-0199/0102.Binary Tree Level Order Traversal/README.md +++ b/solution/0100-0199/0102.Binary Tree Level Order Traversal/README.md @@ -278,9 +278,9 @@ function levelOrder(root: TreeNode | null): number[][] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; -use std::collections::{ VecDeque }; +use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn level_order(root: Option>>) -> Vec> { let mut ans = Vec::new(); diff --git a/solution/0100-0199/0102.Binary Tree Level Order Traversal/README_EN.md b/solution/0100-0199/0102.Binary Tree Level Order Traversal/README_EN.md index 04c98c7768841..5975dfda2bfdf 100644 --- a/solution/0100-0199/0102.Binary Tree Level Order Traversal/README_EN.md +++ b/solution/0100-0199/0102.Binary Tree Level Order Traversal/README_EN.md @@ -276,9 +276,9 @@ function levelOrder(root: TreeNode | null): number[][] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; -use std::collections::{ VecDeque }; +use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn level_order(root: Option>>) -> Vec> { let mut ans = Vec::new(); diff --git a/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README.md b/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README.md index e4c96fa886dc1..be80ded542971 100644 --- a/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README.md +++ b/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README.md @@ -297,9 +297,9 @@ function zigzagLevelOrder(root: TreeNode | null): number[][] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn zigzag_level_order(root: Option>>) -> Vec> { let mut ans = Vec::new(); diff --git a/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README_EN.md b/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README_EN.md index 404d591105702..5df7041a2ab62 100644 --- a/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README_EN.md +++ b/solution/0100-0199/0103.Binary Tree Zigzag Level Order Traversal/README_EN.md @@ -295,9 +295,9 @@ function zigzagLevelOrder(root: TreeNode | null): number[][] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn zigzag_level_order(root: Option>>) -> Vec> { let mut ans = Vec::new(); diff --git a/solution/0100-0199/0104.Maximum Depth of Binary Tree/README.md b/solution/0100-0199/0104.Maximum Depth of Binary Tree/README.md index 093f56b86abeb..f733fcac443f9 100644 --- a/solution/0100-0199/0104.Maximum Depth of Binary Tree/README.md +++ b/solution/0100-0199/0104.Maximum Depth of Binary Tree/README.md @@ -203,8 +203,8 @@ function maxDepth(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>) -> i32 { if root.is_none() { diff --git a/solution/0100-0199/0104.Maximum Depth of Binary Tree/README_EN.md b/solution/0100-0199/0104.Maximum Depth of Binary Tree/README_EN.md index 3ca6261284815..b6b412d7feb96 100644 --- a/solution/0100-0199/0104.Maximum Depth of Binary Tree/README_EN.md +++ b/solution/0100-0199/0104.Maximum Depth of Binary Tree/README_EN.md @@ -197,8 +197,8 @@ function maxDepth(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>) -> i32 { if root.is_none() { diff --git a/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README.md b/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README.md index 9ecc27bf0f14c..68d872cc8c044 100644 --- a/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README.md +++ b/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README.md @@ -271,9 +271,9 @@ function buildTree(preorder: number[], inorder: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { let mut d = HashMap::new(); @@ -288,7 +288,7 @@ impl Solution { d: &HashMap, i: usize, j: usize, - n: usize + n: usize, ) -> Option>> { if n <= 0 { return None; diff --git a/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README_EN.md b/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README_EN.md index 54321baf38ff8..3f5cb0416f9d2 100644 --- a/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README_EN.md +++ b/solution/0100-0199/0105.Construct Binary Tree from Preorder and Inorder Traversal/README_EN.md @@ -269,9 +269,9 @@ function buildTree(preorder: number[], inorder: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { let mut d = HashMap::new(); @@ -286,7 +286,7 @@ impl Solution { d: &HashMap, i: usize, j: usize, - n: usize + n: usize, ) -> Option>> { if n <= 0 { return None; diff --git a/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README.md b/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README.md index 77e52a945c1f9..7049491790dc1 100644 --- a/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README.md +++ b/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README.md @@ -266,9 +266,9 @@ function buildTree(inorder: number[], postorder: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { pub fn build_tree(inorder: Vec, postorder: Vec) -> Option>> { let n = inorder.len(); @@ -281,7 +281,7 @@ impl Solution { d: &HashMap, i: usize, j: usize, - n: usize + n: usize, ) -> Option>> { if n <= 0 { return None; diff --git a/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README_EN.md b/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README_EN.md index 81107a19be9a2..f545532091483 100644 --- a/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README_EN.md +++ b/solution/0100-0199/0106.Construct Binary Tree from Inorder and Postorder Traversal/README_EN.md @@ -264,9 +264,9 @@ function buildTree(inorder: number[], postorder: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { pub fn build_tree(inorder: Vec, postorder: Vec) -> Option>> { let n = inorder.len(); @@ -279,7 +279,7 @@ impl Solution { d: &HashMap, i: usize, j: usize, - n: usize + n: usize, ) -> Option>> { if n <= 0 { return None; diff --git a/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README.md b/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README.md index 171152f8d5908..0addc6d9d16c3 100644 --- a/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README.md +++ b/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README.md @@ -284,7 +284,7 @@ function levelOrderBottom(root: TreeNode | null): number[][] { // } // } // } -use std::{ rc::Rc, cell::RefCell, collections::VecDeque }; +use std::{cell::RefCell, collections::VecDeque, rc::Rc}; impl Solution { pub fn level_order_bottom(root: Option>>) -> Vec> { let mut ans = Vec::new(); diff --git a/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README_EN.md b/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README_EN.md index b5c011d166276..6f5652aa95b5f 100644 --- a/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README_EN.md +++ b/solution/0100-0199/0107.Binary Tree Level Order Traversal II/README_EN.md @@ -282,7 +282,7 @@ function levelOrderBottom(root: TreeNode | null): number[][] { // } // } // } -use std::{ rc::Rc, cell::RefCell, collections::VecDeque }; +use std::{cell::RefCell, collections::VecDeque, rc::Rc}; impl Solution { pub fn level_order_bottom(root: Option>>) -> Vec> { let mut ans = Vec::new(); diff --git a/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README.md b/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README.md index 0c24207a12625..db7fb7f53c1d7 100644 --- a/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README.md +++ b/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README.md @@ -243,23 +243,19 @@ function sortedArrayToBST(nums: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn to_bst(nums: &Vec, start: usize, end: usize) -> Option>> { if start >= end { return None; } let mid = start + (end - start) / 2; - Some( - Rc::new( - RefCell::new(TreeNode { - val: nums[mid], - left: Self::to_bst(nums, start, mid), - right: Self::to_bst(nums, mid + 1, end), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: nums[mid], + left: Self::to_bst(nums, start, mid), + right: Self::to_bst(nums, mid + 1, end), + }))) } pub fn sorted_array_to_bst(nums: Vec) -> Option>> { diff --git a/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README_EN.md b/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README_EN.md index f9bf795abc8d4..e21e8ee2ec57a 100644 --- a/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README_EN.md +++ b/solution/0100-0199/0108.Convert Sorted Array to Binary Search Tree/README_EN.md @@ -241,23 +241,19 @@ function sortedArrayToBST(nums: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn to_bst(nums: &Vec, start: usize, end: usize) -> Option>> { if start >= end { return None; } let mid = start + (end - start) / 2; - Some( - Rc::new( - RefCell::new(TreeNode { - val: nums[mid], - left: Self::to_bst(nums, start, mid), - right: Self::to_bst(nums, mid + 1, end), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: nums[mid], + left: Self::to_bst(nums, start, mid), + right: Self::to_bst(nums, mid + 1, end), + }))) } pub fn sorted_array_to_bst(nums: Vec) -> Option>> { diff --git a/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README.md b/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README.md index 46772892185d2..8ba0c6018f8ad 100644 --- a/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README.md +++ b/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README.md @@ -318,23 +318,19 @@ function sortedListToBST(head: ListNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn build(vals: &Vec, start: usize, end: usize) -> Option>> { if start == end { return None; } let mid = (start + end) >> 1; - Some( - Rc::new( - RefCell::new(TreeNode { - val: vals[mid], - left: Self::build(vals, start, mid), - right: Self::build(vals, mid + 1, end), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: vals[mid], + left: Self::build(vals, start, mid), + right: Self::build(vals, mid + 1, end), + }))) } pub fn sorted_list_to_bst(head: Option>) -> Option>> { diff --git a/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README_EN.md b/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README_EN.md index c8fb7cd4117dd..79f70e47c211b 100644 --- a/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README_EN.md +++ b/solution/0100-0199/0109.Convert Sorted List to Binary Search Tree/README_EN.md @@ -314,23 +314,19 @@ function sortedListToBST(head: ListNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn build(vals: &Vec, start: usize, end: usize) -> Option>> { if start == end { return None; } let mid = (start + end) >> 1; - Some( - Rc::new( - RefCell::new(TreeNode { - val: vals[mid], - left: Self::build(vals, start, mid), - right: Self::build(vals, mid + 1, end), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: vals[mid], + left: Self::build(vals, start, mid), + right: Self::build(vals, mid + 1, end), + }))) } pub fn sorted_list_to_bst(head: Option>) -> Option>> { diff --git a/solution/0100-0199/0110.Balanced Binary Tree/README.md b/solution/0100-0199/0110.Balanced Binary Tree/README.md index 7fa4333c75669..84a65ef9916dc 100644 --- a/solution/0100-0199/0110.Balanced Binary Tree/README.md +++ b/solution/0100-0199/0110.Balanced Binary Tree/README.md @@ -254,8 +254,8 @@ function isBalanced(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn is_balanced(root: Option>>) -> bool { Self::dfs(&root) > -1 diff --git a/solution/0100-0199/0110.Balanced Binary Tree/README_EN.md b/solution/0100-0199/0110.Balanced Binary Tree/README_EN.md index b5731ec81a100..71b4d73d2e316 100644 --- a/solution/0100-0199/0110.Balanced Binary Tree/README_EN.md +++ b/solution/0100-0199/0110.Balanced Binary Tree/README_EN.md @@ -252,8 +252,8 @@ function isBalanced(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn is_balanced(root: Option>>) -> bool { Self::dfs(&root) > -1 diff --git a/solution/0100-0199/0111.Minimum Depth of Binary Tree/README.md b/solution/0100-0199/0111.Minimum Depth of Binary Tree/README.md index 49077759f2de0..d98bd4f2c6a52 100644 --- a/solution/0100-0199/0111.Minimum Depth of Binary Tree/README.md +++ b/solution/0100-0199/0111.Minimum Depth of Binary Tree/README.md @@ -227,8 +227,8 @@ function minDepth(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>) -> i32 { if root.is_none() { diff --git a/solution/0100-0199/0111.Minimum Depth of Binary Tree/README_EN.md b/solution/0100-0199/0111.Minimum Depth of Binary Tree/README_EN.md index 773a44580087d..57112b053a48a 100644 --- a/solution/0100-0199/0111.Minimum Depth of Binary Tree/README_EN.md +++ b/solution/0100-0199/0111.Minimum Depth of Binary Tree/README_EN.md @@ -225,8 +225,8 @@ function minDepth(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>) -> i32 { if root.is_none() { diff --git a/solution/0100-0199/0112.Path Sum/README.md b/solution/0100-0199/0112.Path Sum/README.md index 19bff0caed7c8..7059a3ea99ffb 100644 --- a/solution/0100-0199/0112.Path Sum/README.md +++ b/solution/0100-0199/0112.Path Sum/README.md @@ -238,8 +238,8 @@ function hasPathSum(root: TreeNode | null, targetSum: number): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn has_path_sum(root: Option>>, target_sum: i32) -> bool { match root { @@ -251,8 +251,8 @@ impl Solution { return target_sum - node.val == 0; } let val = node.val; - Self::has_path_sum(node.left.take(), target_sum - val) || - Self::has_path_sum(node.right.take(), target_sum - val) + Self::has_path_sum(node.left.take(), target_sum - val) + || Self::has_path_sum(node.right.take(), target_sum - val) } } } diff --git a/solution/0100-0199/0112.Path Sum/README_EN.md b/solution/0100-0199/0112.Path Sum/README_EN.md index 6d8424fb74661..b3df7020a512a 100644 --- a/solution/0100-0199/0112.Path Sum/README_EN.md +++ b/solution/0100-0199/0112.Path Sum/README_EN.md @@ -237,8 +237,8 @@ function hasPathSum(root: TreeNode | null, targetSum: number): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn has_path_sum(root: Option>>, target_sum: i32) -> bool { match root { @@ -250,8 +250,8 @@ impl Solution { return target_sum - node.val == 0; } let val = node.val; - Self::has_path_sum(node.left.take(), target_sum - val) || - Self::has_path_sum(node.right.take(), target_sum - val) + Self::has_path_sum(node.left.take(), target_sum - val) + || Self::has_path_sum(node.right.take(), target_sum - val) } } } diff --git a/solution/0100-0199/0113.Path Sum II/README.md b/solution/0100-0199/0113.Path Sum II/README.md index 9ef212230829e..dc45b38cc9cc0 100644 --- a/solution/0100-0199/0113.Path Sum II/README.md +++ b/solution/0100-0199/0113.Path Sum II/README.md @@ -232,14 +232,14 @@ func pathSum(root *TreeNode, targetSum int) (ans [][]int) { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs( root: Option>>, paths: &mut Vec, mut target_sum: i32, - res: &mut Vec> + res: &mut Vec>, ) { if let Some(node) = root { let mut node = node.borrow_mut(); diff --git a/solution/0100-0199/0113.Path Sum II/README_EN.md b/solution/0100-0199/0113.Path Sum II/README_EN.md index cf3e3d87250f3..89c1f2000068c 100644 --- a/solution/0100-0199/0113.Path Sum II/README_EN.md +++ b/solution/0100-0199/0113.Path Sum II/README_EN.md @@ -229,14 +229,14 @@ func pathSum(root *TreeNode, targetSum int) (ans [][]int) { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs( root: Option>>, paths: &mut Vec, mut target_sum: i32, - res: &mut Vec> + res: &mut Vec>, ) { if let Some(node) = root { let mut node = node.borrow_mut(); diff --git a/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README.md b/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README.md index bc9ad8d7cb7a0..4a92796282bc3 100644 --- a/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README.md +++ b/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README.md @@ -262,8 +262,8 @@ function flatten(root: TreeNode | null): void { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { #[allow(dead_code)] pub fn flatten(root: &mut Option>>) { @@ -284,7 +284,7 @@ impl Solution { #[allow(dead_code)] fn pre_order_traverse( v: &mut Vec>>>, - root: &Option>> + root: &Option>>, ) { if root.is_none() { return; diff --git a/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README_EN.md b/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README_EN.md index 9d5d23b05f3b7..da5a312a2e9f8 100644 --- a/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README_EN.md +++ b/solution/0100-0199/0114.Flatten Binary Tree to Linked List/README_EN.md @@ -259,8 +259,8 @@ function flatten(root: TreeNode | null): void { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { #[allow(dead_code)] pub fn flatten(root: &mut Option>>) { @@ -281,7 +281,7 @@ impl Solution { #[allow(dead_code)] fn pre_order_traverse( v: &mut Vec>>>, - root: &Option>> + root: &Option>>, ) { if root.is_none() { return; diff --git a/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README.md b/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README.md index 0f080cd3e1810..5fa2f666e22df 100644 --- a/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README.md +++ b/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README.md @@ -259,8 +259,8 @@ function maxPathSum(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, res: &mut i32) -> i32 { if root.is_none() { diff --git a/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README_EN.md b/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README_EN.md index ff1ea56cab05c..13f8f61bbad8f 100644 --- a/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README_EN.md +++ b/solution/0100-0199/0124.Binary Tree Maximum Path Sum/README_EN.md @@ -258,8 +258,8 @@ function maxPathSum(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, res: &mut i32) -> i32 { if root.is_none() { diff --git a/solution/0100-0199/0129.Sum Root to Leaf Numbers/README.md b/solution/0100-0199/0129.Sum Root to Leaf Numbers/README.md index 47d1c5a5da7b9..38bae5bf5bd33 100644 --- a/solution/0100-0199/0129.Sum Root to Leaf Numbers/README.md +++ b/solution/0100-0199/0129.Sum Root to Leaf Numbers/README.md @@ -251,8 +251,8 @@ function sumNumbers(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(node: &Option>>, mut num: i32) -> i32 { if node.is_none() { diff --git a/solution/0100-0199/0129.Sum Root to Leaf Numbers/README_EN.md b/solution/0100-0199/0129.Sum Root to Leaf Numbers/README_EN.md index 8de2f6e3f32d1..fc9b22a945f77 100644 --- a/solution/0100-0199/0129.Sum Root to Leaf Numbers/README_EN.md +++ b/solution/0100-0199/0129.Sum Root to Leaf Numbers/README_EN.md @@ -246,8 +246,8 @@ function sumNumbers(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(node: &Option>>, mut num: i32) -> i32 { if node.is_none() { diff --git a/solution/0100-0199/0130.Surrounded Regions/README.md b/solution/0100-0199/0130.Surrounded Regions/README.md index 3711169bbd077..6cada1edbf4b0 100644 --- a/solution/0100-0199/0130.Surrounded Regions/README.md +++ b/solution/0100-0199/0130.Surrounded Regions/README.md @@ -282,7 +282,7 @@ impl Solution { j: usize, dirs: &Vec, m: usize, - n: usize + n: usize, ) { if i >= 0 && i < m && j >= 0 && j < n && board[i][j] == 'O' { board[i][j] = '.'; @@ -293,7 +293,7 @@ impl Solution { ((j as i32) + dirs[k + 1]) as usize, dirs, m, - n + n, ); } } diff --git a/solution/0100-0199/0130.Surrounded Regions/README_EN.md b/solution/0100-0199/0130.Surrounded Regions/README_EN.md index 006bd19b1708e..5d9367db386ee 100644 --- a/solution/0100-0199/0130.Surrounded Regions/README_EN.md +++ b/solution/0100-0199/0130.Surrounded Regions/README_EN.md @@ -276,7 +276,7 @@ impl Solution { j: usize, dirs: &Vec, m: usize, - n: usize + n: usize, ) { if i >= 0 && i < m && j >= 0 && j < n && board[i][j] == 'O' { board[i][j] = '.'; @@ -287,7 +287,7 @@ impl Solution { ((j as i32) + dirs[k + 1]) as usize, dirs, m, - n + n, ); } } diff --git a/solution/0100-0199/0136.Single Number/README.md b/solution/0100-0199/0136.Single Number/README.md index b4ae7241ceeab..a7b9704e4dba6 100644 --- a/solution/0100-0199/0136.Single Number/README.md +++ b/solution/0100-0199/0136.Single Number/README.md @@ -138,9 +138,7 @@ function singleNumber(nums: number[]): number { ```rust impl Solution { pub fn single_number(nums: Vec) -> i32 { - nums.into_iter() - .reduce(|r, v| r ^ v) - .unwrap() + nums.into_iter().reduce(|r, v| r ^ v).unwrap() } } ``` diff --git a/solution/0100-0199/0136.Single Number/README_EN.md b/solution/0100-0199/0136.Single Number/README_EN.md index 352f5b64edf00..1b8ea407c1c32 100644 --- a/solution/0100-0199/0136.Single Number/README_EN.md +++ b/solution/0100-0199/0136.Single Number/README_EN.md @@ -121,9 +121,7 @@ function singleNumber(nums: number[]): number { ```rust impl Solution { pub fn single_number(nums: Vec) -> i32 { - nums.into_iter() - .reduce(|r, v| r ^ v) - .unwrap() + nums.into_iter().reduce(|r, v| r ^ v).unwrap() } } ``` diff --git a/solution/0100-0199/0137.Single Number II/README.md b/solution/0100-0199/0137.Single Number II/README.md index 53d35d1faa2fa..380f5e4329ad4 100644 --- a/solution/0100-0199/0137.Single Number II/README.md +++ b/solution/0100-0199/0137.Single Number II/README.md @@ -153,10 +153,7 @@ impl Solution { pub fn single_number(nums: Vec) -> i32 { let mut ans = 0; for i in 0..32 { - let count = nums - .iter() - .map(|v| (v >> i) & 1) - .sum::(); + let count = nums.iter().map(|v| (v >> i) & 1).sum::(); ans |= count % 3 << i; } ans diff --git a/solution/0100-0199/0137.Single Number II/README_EN.md b/solution/0100-0199/0137.Single Number II/README_EN.md index 03357aad9c4e0..65c7a2543a182 100644 --- a/solution/0100-0199/0137.Single Number II/README_EN.md +++ b/solution/0100-0199/0137.Single Number II/README_EN.md @@ -144,10 +144,7 @@ impl Solution { pub fn single_number(nums: Vec) -> i32 { let mut ans = 0; for i in 0..32 { - let count = nums - .iter() - .map(|v| (v >> i) & 1) - .sum::(); + let count = nums.iter().map(|v| (v >> i) & 1).sum::(); ans |= count % 3 << i; } ans diff --git a/solution/0100-0199/0143.Reorder List/README.md b/solution/0100-0199/0143.Reorder List/README.md index 5a56d5a810b6d..e81a3f520141e 100644 --- a/solution/0100-0199/0143.Reorder List/README.md +++ b/solution/0100-0199/0143.Reorder List/README.md @@ -328,7 +328,11 @@ impl Solution { } let mut flag = false; while !deque.is_empty() { - *tail = if flag { deque.pop_front().unwrap() } else { deque.pop_back().unwrap() }; + *tail = if flag { + deque.pop_front().unwrap() + } else { + deque.pop_back().unwrap() + }; tail = &mut tail.as_mut().unwrap().next; flag = !flag; } diff --git a/solution/0100-0199/0143.Reorder List/README_EN.md b/solution/0100-0199/0143.Reorder List/README_EN.md index fbd8b31c664ee..666d047426575 100644 --- a/solution/0100-0199/0143.Reorder List/README_EN.md +++ b/solution/0100-0199/0143.Reorder List/README_EN.md @@ -304,7 +304,11 @@ impl Solution { } let mut flag = false; while !deque.is_empty() { - *tail = if flag { deque.pop_front().unwrap() } else { deque.pop_back().unwrap() }; + *tail = if flag { + deque.pop_front().unwrap() + } else { + deque.pop_back().unwrap() + }; tail = &mut tail.as_mut().unwrap().next; flag = !flag; } diff --git a/solution/0100-0199/0144.Binary Tree Preorder Traversal/README.md b/solution/0100-0199/0144.Binary Tree Preorder Traversal/README.md index 70e91affc866e..1317fccd35d10 100644 --- a/solution/0100-0199/0144.Binary Tree Preorder Traversal/README.md +++ b/solution/0100-0199/0144.Binary Tree Preorder Traversal/README.md @@ -256,8 +256,8 @@ function preorderTraversal(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, ans: &mut Vec) { if root.is_none() { diff --git a/solution/0100-0199/0144.Binary Tree Preorder Traversal/README_EN.md b/solution/0100-0199/0144.Binary Tree Preorder Traversal/README_EN.md index d341cafdf76a8..30c53aa139c1a 100644 --- a/solution/0100-0199/0144.Binary Tree Preorder Traversal/README_EN.md +++ b/solution/0100-0199/0144.Binary Tree Preorder Traversal/README_EN.md @@ -239,8 +239,8 @@ function preorderTraversal(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, ans: &mut Vec) { if root.is_none() { diff --git a/solution/0100-0199/0145.Binary Tree Postorder Traversal/README.md b/solution/0100-0199/0145.Binary Tree Postorder Traversal/README.md index d3f64ff95c979..8ad81248c46b4 100644 --- a/solution/0100-0199/0145.Binary Tree Postorder Traversal/README.md +++ b/solution/0100-0199/0145.Binary Tree Postorder Traversal/README.md @@ -242,8 +242,8 @@ function postorderTraversal(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, ans: &mut Vec) { if root.is_none() { diff --git a/solution/0100-0199/0145.Binary Tree Postorder Traversal/README_EN.md b/solution/0100-0199/0145.Binary Tree Postorder Traversal/README_EN.md index 075415be54b20..784409dcf1a54 100644 --- a/solution/0100-0199/0145.Binary Tree Postorder Traversal/README_EN.md +++ b/solution/0100-0199/0145.Binary Tree Postorder Traversal/README_EN.md @@ -239,8 +239,8 @@ function postorderTraversal(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, ans: &mut Vec) { if root.is_none() { diff --git a/solution/0100-0199/0155.Min Stack/README.md b/solution/0100-0199/0155.Min Stack/README.md index c03b30edd785e..dacaea6a6e044 100644 --- a/solution/0100-0199/0155.Min Stack/README.md +++ b/solution/0100-0199/0155.Min Stack/README.md @@ -290,7 +290,10 @@ struct MinStack { */ impl MinStack { fn new() -> Self { - Self { stk1: VecDeque::new(), stk2: VecDeque::new() } + Self { + stk1: VecDeque::new(), + stk2: VecDeque::new(), + } } fn push(&mut self, x: i32) { diff --git a/solution/0100-0199/0155.Min Stack/README_EN.md b/solution/0100-0199/0155.Min Stack/README_EN.md index af7858b95ccca..14480bedbf97f 100644 --- a/solution/0100-0199/0155.Min Stack/README_EN.md +++ b/solution/0100-0199/0155.Min Stack/README_EN.md @@ -281,7 +281,10 @@ struct MinStack { */ impl MinStack { fn new() -> Self { - Self { stk1: VecDeque::new(), stk2: VecDeque::new() } + Self { + stk1: VecDeque::new(), + stk2: VecDeque::new(), + } } fn push(&mut self, x: i32) { diff --git a/solution/0100-0199/0173.Binary Search Tree Iterator/README.md b/solution/0100-0199/0173.Binary Search Tree Iterator/README.md index 111b7b4b8f68e..f2acae41a82a1 100644 --- a/solution/0100-0199/0173.Binary Search Tree Iterator/README.md +++ b/solution/0100-0199/0173.Binary Search Tree Iterator/README.md @@ -354,8 +354,8 @@ struct BSTIterator { index: usize, } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; /** * `&self` means the method takes an immutable reference. * If you need a mutable reference, change it to `&mut self` instead. @@ -373,10 +373,7 @@ impl BSTIterator { fn new(root: Option>>) -> Self { let mut vals = vec![]; Self::inorder(&root, &mut vals); - BSTIterator { - vals, - index: 0, - } + BSTIterator { vals, index: 0 } } fn next(&mut self) -> i32 { @@ -662,8 +659,8 @@ struct BSTIterator { stack: Vec>>>, } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; /** * `&self` means the method takes an immutable reference. * If you need a mutable reference, change it to `&mut self` instead. @@ -671,7 +668,7 @@ use std::cell::RefCell; impl BSTIterator { fn dfs( mut root: Option>>, - stack: &mut Vec>>> + stack: &mut Vec>>>, ) { if root.is_some() { let left = root.as_mut().unwrap().borrow_mut().left.take(); diff --git a/solution/0100-0199/0173.Binary Search Tree Iterator/README_EN.md b/solution/0100-0199/0173.Binary Search Tree Iterator/README_EN.md index 47ac70c605db9..294563ad196c3 100644 --- a/solution/0100-0199/0173.Binary Search Tree Iterator/README_EN.md +++ b/solution/0100-0199/0173.Binary Search Tree Iterator/README_EN.md @@ -343,8 +343,8 @@ struct BSTIterator { index: usize, } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; /** * `&self` means the method takes an immutable reference. * If you need a mutable reference, change it to `&mut self` instead. @@ -362,10 +362,7 @@ impl BSTIterator { fn new(root: Option>>) -> Self { let mut vals = vec![]; Self::inorder(&root, &mut vals); - BSTIterator { - vals, - index: 0, - } + BSTIterator { vals, index: 0 } } fn next(&mut self) -> i32 { @@ -647,8 +644,8 @@ struct BSTIterator { stack: Vec>>>, } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; /** * `&self` means the method takes an immutable reference. * If you need a mutable reference, change it to `&mut self` instead. @@ -656,7 +653,7 @@ use std::cell::RefCell; impl BSTIterator { fn dfs( mut root: Option>>, - stack: &mut Vec>>> + stack: &mut Vec>>>, ) { if root.is_some() { let left = root.as_mut().unwrap().borrow_mut().left.take(); diff --git a/solution/0100-0199/0199.Binary Tree Right Side View/README.md b/solution/0100-0199/0199.Binary Tree Right Side View/README.md index 34da011565c23..ec64d1852f3d6 100644 --- a/solution/0100-0199/0199.Binary Tree Right Side View/README.md +++ b/solution/0100-0199/0199.Binary Tree Right Side View/README.md @@ -272,9 +272,9 @@ function rightSideView(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn right_side_view(root: Option>>) -> Vec { let mut res = vec![]; diff --git a/solution/0100-0199/0199.Binary Tree Right Side View/README_EN.md b/solution/0100-0199/0199.Binary Tree Right Side View/README_EN.md index 3b89f57b7b8ce..d7d7f211848fc 100644 --- a/solution/0100-0199/0199.Binary Tree Right Side View/README_EN.md +++ b/solution/0100-0199/0199.Binary Tree Right Side View/README_EN.md @@ -264,9 +264,9 @@ function rightSideView(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn right_side_view(root: Option>>) -> Vec { let mut res = vec![]; diff --git a/solution/0200-0299/0200.Number of Islands/README.md b/solution/0200-0299/0200.Number of Islands/README.md index 87e54186056f9..8e6d47a60065f 100644 --- a/solution/0200-0299/0200.Number of Islands/README.md +++ b/solution/0200-0299/0200.Number of Islands/README.md @@ -242,12 +242,11 @@ impl Solution { for k in 0..4 { let x = (i as i32) + DIRS[k]; let y = (j as i32) + DIRS[k + 1]; - if - x >= 0 && - (x as usize) < grid.len() && - y >= 0 && - (y as usize) < grid[0].len() && - grid[x as usize][y as usize] == '1' + if x >= 0 + && (x as usize) < grid.len() + && y >= 0 + && (y as usize) < grid[0].len() + && grid[x as usize][y as usize] == '1' { dfs(grid, x as usize, y as usize); } @@ -559,12 +558,11 @@ impl Solution { for k in 0..4 { let x = (i as i32) + DIRS[k]; let y = (j as i32) + DIRS[k + 1]; - if - x >= 0 && - (x as usize) < grid.len() && - y >= 0 && - (y as usize) < grid[0].len() && - grid[x as usize][y as usize] == '1' + if x >= 0 + && (x as usize) < grid.len() + && y >= 0 + && (y as usize) < grid[0].len() + && grid[x as usize][y as usize] == '1' { grid[x as usize][y as usize] = '0'; queue.push_back((x as usize, y as usize)); diff --git a/solution/0200-0299/0200.Number of Islands/README_EN.md b/solution/0200-0299/0200.Number of Islands/README_EN.md index 6af18eb748ddf..b89c69dd4170a 100644 --- a/solution/0200-0299/0200.Number of Islands/README_EN.md +++ b/solution/0200-0299/0200.Number of Islands/README_EN.md @@ -232,12 +232,11 @@ impl Solution { for k in 0..4 { let x = (i as i32) + DIRS[k]; let y = (j as i32) + DIRS[k + 1]; - if - x >= 0 && - (x as usize) < grid.len() && - y >= 0 && - (y as usize) < grid[0].len() && - grid[x as usize][y as usize] == '1' + if x >= 0 + && (x as usize) < grid.len() + && y >= 0 + && (y as usize) < grid[0].len() + && grid[x as usize][y as usize] == '1' { dfs(grid, x as usize, y as usize); } @@ -512,12 +511,11 @@ impl Solution { for k in 0..4 { let x = (i as i32) + DIRS[k]; let y = (j as i32) + DIRS[k + 1]; - if - x >= 0 && - (x as usize) < grid.len() && - y >= 0 && - (y as usize) < grid[0].len() && - grid[x as usize][y as usize] == '1' + if x >= 0 + && (x as usize) < grid.len() + && y >= 0 + && (y as usize) < grid[0].len() + && grid[x as usize][y as usize] == '1' { grid[x as usize][y as usize] = '0'; queue.push_back((x as usize, y as usize)); diff --git a/solution/0200-0299/0208.Implement Trie (Prefix Tree)/README.md b/solution/0200-0299/0208.Implement Trie (Prefix Tree)/README.md index 5f6842ce356b7..76481c3da5923 100644 --- a/solution/0200-0299/0208.Implement Trie (Prefix Tree)/README.md +++ b/solution/0200-0299/0208.Implement Trie (Prefix Tree)/README.md @@ -355,7 +355,7 @@ class Trie { #### Rust ```rust -use std::{ rc::Rc, cell::RefCell, collections::HashMap }; +use std::{cell::RefCell, collections::HashMap, rc::Rc}; struct TrieNode { pub val: Option, @@ -404,7 +404,9 @@ impl Trie { for c in &char_vec { if !root.borrow().child.contains_key(c) { // We need to manually create the entry - root.borrow_mut().child.insert(*c, Rc::new(RefCell::new(TrieNode::new()))); + root.borrow_mut() + .child + .insert(*c, Rc::new(RefCell::new(TrieNode::new()))); } // Get the child node let root_clone = Rc::clone(root.borrow().child.get(c).unwrap()); diff --git a/solution/0200-0299/0208.Implement Trie (Prefix Tree)/README_EN.md b/solution/0200-0299/0208.Implement Trie (Prefix Tree)/README_EN.md index 769b54431e8cb..44a337cd122e8 100644 --- a/solution/0200-0299/0208.Implement Trie (Prefix Tree)/README_EN.md +++ b/solution/0200-0299/0208.Implement Trie (Prefix Tree)/README_EN.md @@ -328,7 +328,7 @@ class Trie { #### Rust ```rust -use std::{ rc::Rc, cell::RefCell, collections::HashMap }; +use std::{cell::RefCell, collections::HashMap, rc::Rc}; struct TrieNode { pub val: Option, @@ -377,7 +377,9 @@ impl Trie { for c in &char_vec { if !root.borrow().child.contains_key(c) { // We need to manually create the entry - root.borrow_mut().child.insert(*c, Rc::new(RefCell::new(TrieNode::new()))); + root.borrow_mut() + .child + .insert(*c, Rc::new(RefCell::new(TrieNode::new()))); } // Get the child node let root_clone = Rc::clone(root.borrow().child.get(c).unwrap()); diff --git a/solution/0200-0299/0216.Combination Sum III/README.md b/solution/0200-0299/0216.Combination Sum III/README.md index 008f507bc638b..e7ab082b83fff 100644 --- a/solution/0200-0299/0216.Combination Sum III/README.md +++ b/solution/0200-0299/0216.Combination Sum III/README.md @@ -243,7 +243,7 @@ impl Solution { cur_sum: i32, cur_vec: &mut Vec, candidates: &Vec, - ans: &mut Vec> + ans: &mut Vec>, ) { if cur_sum > target || cur_vec.len() > (length as usize) { // No answer for this @@ -256,7 +256,15 @@ impl Solution { } for i in cur_index..candidates.len() { cur_vec.push(candidates[i]); - Self::dfs(target, length, i + 1, cur_sum + candidates[i], cur_vec, candidates, ans); + Self::dfs( + target, + length, + i + 1, + cur_sum + candidates[i], + cur_vec, + candidates, + ans, + ); cur_vec.pop().unwrap(); } } diff --git a/solution/0200-0299/0216.Combination Sum III/README_EN.md b/solution/0200-0299/0216.Combination Sum III/README_EN.md index afec40aff3180..db3075f058166 100644 --- a/solution/0200-0299/0216.Combination Sum III/README_EN.md +++ b/solution/0200-0299/0216.Combination Sum III/README_EN.md @@ -242,7 +242,7 @@ impl Solution { cur_sum: i32, cur_vec: &mut Vec, candidates: &Vec, - ans: &mut Vec> + ans: &mut Vec>, ) { if cur_sum > target || cur_vec.len() > (length as usize) { // No answer for this @@ -255,7 +255,15 @@ impl Solution { } for i in cur_index..candidates.len() { cur_vec.push(candidates[i]); - Self::dfs(target, length, i + 1, cur_sum + candidates[i], cur_vec, candidates, ans); + Self::dfs( + target, + length, + i + 1, + cur_sum + candidates[i], + cur_vec, + candidates, + ans, + ); cur_vec.pop().unwrap(); } } diff --git a/solution/0200-0299/0222.Count Complete Tree Nodes/README.md b/solution/0200-0299/0222.Count Complete Tree Nodes/README.md index 74868bd90f5df..f71300305dc27 100644 --- a/solution/0200-0299/0222.Count Complete Tree Nodes/README.md +++ b/solution/0200-0299/0222.Count Complete Tree Nodes/README.md @@ -185,7 +185,11 @@ impl Solution { } fn depth(root: &Option>>) -> i32 { - if let Some(node) = root { Self::depth(&node.borrow().left) + 1 } else { 0 } + if let Some(node) = root { + Self::depth(&node.borrow().left) + 1 + } else { + 0 + } } } ``` diff --git a/solution/0200-0299/0222.Count Complete Tree Nodes/README_EN.md b/solution/0200-0299/0222.Count Complete Tree Nodes/README_EN.md index abc917a879b3e..19be73bcdba53 100644 --- a/solution/0200-0299/0222.Count Complete Tree Nodes/README_EN.md +++ b/solution/0200-0299/0222.Count Complete Tree Nodes/README_EN.md @@ -181,7 +181,11 @@ impl Solution { } fn depth(root: &Option>>) -> i32 { - if let Some(node) = root { Self::depth(&node.borrow().left) + 1 } else { 0 } + if let Some(node) = root { + Self::depth(&node.borrow().left) + 1 + } else { + 0 + } } } ``` diff --git a/solution/0200-0299/0226.Invert Binary Tree/README.md b/solution/0200-0299/0226.Invert Binary Tree/README.md index 22288dbdecb38..3368249fdff33 100644 --- a/solution/0200-0299/0226.Invert Binary Tree/README.md +++ b/solution/0200-0299/0226.Invert Binary Tree/README.md @@ -239,8 +239,8 @@ function invertTree(root: TreeNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { #[allow(dead_code)] pub fn invert_tree(root: Option>>) -> Option>> { diff --git a/solution/0200-0299/0226.Invert Binary Tree/README_EN.md b/solution/0200-0299/0226.Invert Binary Tree/README_EN.md index 123dd9e82957b..eaa496ae32679 100644 --- a/solution/0200-0299/0226.Invert Binary Tree/README_EN.md +++ b/solution/0200-0299/0226.Invert Binary Tree/README_EN.md @@ -233,8 +233,8 @@ function invertTree(root: TreeNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { #[allow(dead_code)] pub fn invert_tree(root: Option>>) -> Option>> { diff --git a/solution/0200-0299/0230.Kth Smallest Element in a BST/README.md b/solution/0200-0299/0230.Kth Smallest Element in a BST/README.md index 1280d7c978211..a07358a84b9c4 100644 --- a/solution/0200-0299/0230.Kth Smallest Element in a BST/README.md +++ b/solution/0200-0299/0230.Kth Smallest Element in a BST/README.md @@ -250,8 +250,8 @@ function kthSmallest(root: TreeNode | null, k: number): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: Option>>, res: &mut Vec, k: usize) { if let Some(node) = root { diff --git a/solution/0200-0299/0230.Kth Smallest Element in a BST/README_EN.md b/solution/0200-0299/0230.Kth Smallest Element in a BST/README_EN.md index a77e519a41a4a..c5bc95d9f7ec5 100644 --- a/solution/0200-0299/0230.Kth Smallest Element in a BST/README_EN.md +++ b/solution/0200-0299/0230.Kth Smallest Element in a BST/README_EN.md @@ -243,8 +243,8 @@ function kthSmallest(root: TreeNode | null, k: number): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: Option>>, res: &mut Vec, k: usize) { if let Some(node) = root { diff --git a/solution/0200-0299/0236.Lowest Common Ancestor of a Binary Tree/README.md b/solution/0200-0299/0236.Lowest Common Ancestor of a Binary Tree/README.md index d58c4b9bd3c6d..ff5e1f6e9d35e 100644 --- a/solution/0200-0299/0236.Lowest Common Ancestor of a Binary Tree/README.md +++ b/solution/0200-0299/0236.Lowest Common Ancestor of a Binary Tree/README.md @@ -233,13 +233,13 @@ function lowestCommonAncestor( // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn lowest_common_ancestor( root: Option>>, p: Option>>, - q: Option>> + q: Option>>, ) -> Option>> { if root.is_none() || root == p || root == q { return root; @@ -247,12 +247,12 @@ impl Solution { let left = Self::lowest_common_ancestor( root.as_ref().unwrap().borrow().left.clone(), p.clone(), - q.clone() + q.clone(), ); let right = Self::lowest_common_ancestor( root.as_ref().unwrap().borrow().right.clone(), p.clone(), - q.clone() + q.clone(), ); if left.is_some() && right.is_some() { return root; diff --git a/solution/0200-0299/0236.Lowest Common Ancestor of a Binary Tree/README_EN.md b/solution/0200-0299/0236.Lowest Common Ancestor of a Binary Tree/README_EN.md index af6711a273066..0e79a03d36fa0 100644 --- a/solution/0200-0299/0236.Lowest Common Ancestor of a Binary Tree/README_EN.md +++ b/solution/0200-0299/0236.Lowest Common Ancestor of a Binary Tree/README_EN.md @@ -231,13 +231,13 @@ function lowestCommonAncestor( // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn lowest_common_ancestor( root: Option>>, p: Option>>, - q: Option>> + q: Option>>, ) -> Option>> { if root.is_none() || root == p || root == q { return root; @@ -245,12 +245,12 @@ impl Solution { let left = Self::lowest_common_ancestor( root.as_ref().unwrap().borrow().left.clone(), p.clone(), - q.clone() + q.clone(), ); let right = Self::lowest_common_ancestor( root.as_ref().unwrap().borrow().right.clone(), p.clone(), - q.clone() + q.clone(), ); if left.is_some() && right.is_some() { return root; diff --git a/solution/0200-0299/0252.Meeting Rooms/README.md b/solution/0200-0299/0252.Meeting Rooms/README.md index fedda275b8ca1..db5c3a47d17bf 100644 --- a/solution/0200-0299/0252.Meeting Rooms/README.md +++ b/solution/0200-0299/0252.Meeting Rooms/README.md @@ -150,7 +150,7 @@ impl Solution { let mut intervals = intervals; // Sort the intervals vector - intervals.sort_by(|lhs, rhs| { lhs[0].cmp(&rhs[0]) }); + intervals.sort_by(|lhs, rhs| lhs[0].cmp(&rhs[0])); let mut end = -1; diff --git a/solution/0200-0299/0252.Meeting Rooms/README_EN.md b/solution/0200-0299/0252.Meeting Rooms/README_EN.md index 696d1785ead4a..e052d217a0a34 100644 --- a/solution/0200-0299/0252.Meeting Rooms/README_EN.md +++ b/solution/0200-0299/0252.Meeting Rooms/README_EN.md @@ -135,7 +135,7 @@ impl Solution { let mut intervals = intervals; // Sort the intervals vector - intervals.sort_by(|lhs, rhs| { lhs[0].cmp(&rhs[0]) }); + intervals.sort_by(|lhs, rhs| lhs[0].cmp(&rhs[0])); let mut end = -1; diff --git a/solution/0200-0299/0253.Meeting Rooms II/README.md b/solution/0200-0299/0253.Meeting Rooms II/README.md index f1ab17fff9b2f..c330c2024b93d 100644 --- a/solution/0200-0299/0253.Meeting Rooms II/README.md +++ b/solution/0200-0299/0253.Meeting Rooms II/README.md @@ -131,7 +131,7 @@ func minMeetingRooms(intervals [][]int) int { #### Rust ```rust -use std::{ collections::BinaryHeap, cmp::Reverse }; +use std::{cmp::Reverse, collections::BinaryHeap}; impl Solution { #[allow(dead_code)] @@ -142,7 +142,7 @@ impl Solution { let n = intervals.len(); // Let's first sort the intervals vector - intervals.sort_by(|lhs, rhs| { lhs[0].cmp(&rhs[0]) }); + intervals.sort_by(|lhs, rhs| lhs[0].cmp(&rhs[0])); // Push the first end time to the heap pq.push(Reverse(intervals[0][1])); diff --git a/solution/0200-0299/0253.Meeting Rooms II/README_EN.md b/solution/0200-0299/0253.Meeting Rooms II/README_EN.md index 3fcbd368dc4dd..819e7009ce22e 100644 --- a/solution/0200-0299/0253.Meeting Rooms II/README_EN.md +++ b/solution/0200-0299/0253.Meeting Rooms II/README_EN.md @@ -122,7 +122,7 @@ func minMeetingRooms(intervals [][]int) int { #### Rust ```rust -use std::{ collections::BinaryHeap, cmp::Reverse }; +use std::{cmp::Reverse, collections::BinaryHeap}; impl Solution { #[allow(dead_code)] @@ -133,7 +133,7 @@ impl Solution { let n = intervals.len(); // Let's first sort the intervals vector - intervals.sort_by(|lhs, rhs| { lhs[0].cmp(&rhs[0]) }); + intervals.sort_by(|lhs, rhs| lhs[0].cmp(&rhs[0])); // Push the first end time to the heap pq.push(Reverse(intervals[0][1])); diff --git a/solution/0200-0299/0258.Add Digits/README.md b/solution/0200-0299/0258.Add Digits/README.md index 43a0111dc4244..a268362344b77 100644 --- a/solution/0200-0299/0258.Add Digits/README.md +++ b/solution/0200-0299/0258.Add Digits/README.md @@ -110,11 +110,10 @@ impl Solution { return num; } Self::add_digits( - num - .to_string() + num.to_string() .chars() .map(|c| c.to_string().parse::().unwrap()) - .sum::() + .sum::(), ) } } diff --git a/solution/0200-0299/0258.Add Digits/README_EN.md b/solution/0200-0299/0258.Add Digits/README_EN.md index 6f649af24c7e0..6007ed5ba785c 100644 --- a/solution/0200-0299/0258.Add Digits/README_EN.md +++ b/solution/0200-0299/0258.Add Digits/README_EN.md @@ -108,11 +108,10 @@ impl Solution { return num; } Self::add_digits( - num - .to_string() + num.to_string() .chars() .map(|c| c.to_string().parse::().unwrap()) - .sum::() + .sum::(), ) } } diff --git a/solution/0200-0299/0274.H-Index/README.md b/solution/0200-0299/0274.H-Index/README.md index 5d232fc47fc68..e4c82df41053e 100644 --- a/solution/0200-0299/0274.H-Index/README.md +++ b/solution/0200-0299/0274.H-Index/README.md @@ -145,7 +145,7 @@ impl Solution { #[allow(dead_code)] pub fn h_index(citations: Vec) -> i32 { let mut citations = citations; - citations.sort_by(|&lhs, &rhs| { rhs.cmp(&lhs) }); + citations.sort_by(|&lhs, &rhs| rhs.cmp(&lhs)); let n = citations.len(); diff --git a/solution/0200-0299/0274.H-Index/README_EN.md b/solution/0200-0299/0274.H-Index/README_EN.md index d4b6562d38384..ea060140e405d 100644 --- a/solution/0200-0299/0274.H-Index/README_EN.md +++ b/solution/0200-0299/0274.H-Index/README_EN.md @@ -144,7 +144,7 @@ impl Solution { #[allow(dead_code)] pub fn h_index(citations: Vec) -> i32 { let mut citations = citations; - citations.sort_by(|&lhs, &rhs| { rhs.cmp(&lhs) }); + citations.sort_by(|&lhs, &rhs| rhs.cmp(&lhs)); let n = citations.len(); diff --git a/solution/0200-0299/0287.Find the Duplicate Number/README.md b/solution/0200-0299/0287.Find the Duplicate Number/README.md index 35ad64919c062..9bcc075e8b9ee 100644 --- a/solution/0200-0299/0287.Find the Duplicate Number/README.md +++ b/solution/0200-0299/0287.Find the Duplicate Number/README.md @@ -197,10 +197,7 @@ impl Solution { while left < right { let mid = (left + right) >> 1; - let cnt = nums - .iter() - .filter(|x| **x <= (mid as i32)) - .count(); + let cnt = nums.iter().filter(|x| **x <= (mid as i32)).count(); if cnt > mid { right = mid; } else { diff --git a/solution/0200-0299/0287.Find the Duplicate Number/README_EN.md b/solution/0200-0299/0287.Find the Duplicate Number/README_EN.md index 74262e1a59e36..5862de27b5974 100644 --- a/solution/0200-0299/0287.Find the Duplicate Number/README_EN.md +++ b/solution/0200-0299/0287.Find the Duplicate Number/README_EN.md @@ -191,10 +191,7 @@ impl Solution { while left < right { let mid = (left + right) >> 1; - let cnt = nums - .iter() - .filter(|x| **x <= (mid as i32)) - .count(); + let cnt = nums.iter().filter(|x| **x <= (mid as i32)).count(); if cnt > mid { right = mid; } else { diff --git a/solution/0200-0299/0296.Best Meeting Point/README.md b/solution/0200-0299/0296.Best Meeting Point/README.md index 1996e999e77ee..0bee87b81e8da 100644 --- a/solution/0200-0299/0296.Best Meeting Point/README.md +++ b/solution/0200-0299/0296.Best Meeting Point/README.md @@ -221,8 +221,8 @@ impl Solution { // Since the row vector is originally sorted, we only need to sort the col vector here col_vec.sort(); - Self::compute_manhattan_dis(&row_vec, row_vec[row_vec.len() / 2]) + - Self::compute_manhattan_dis(&col_vec, col_vec[col_vec.len() / 2]) + Self::compute_manhattan_dis(&row_vec, row_vec[row_vec.len() / 2]) + + Self::compute_manhattan_dis(&col_vec, col_vec[col_vec.len() / 2]) } #[allow(dead_code)] diff --git a/solution/0200-0299/0296.Best Meeting Point/README_EN.md b/solution/0200-0299/0296.Best Meeting Point/README_EN.md index b51994ccb726f..1806af85a20a2 100644 --- a/solution/0200-0299/0296.Best Meeting Point/README_EN.md +++ b/solution/0200-0299/0296.Best Meeting Point/README_EN.md @@ -207,8 +207,8 @@ impl Solution { // Since the row vector is originally sorted, we only need to sort the col vector here col_vec.sort(); - Self::compute_manhattan_dis(&row_vec, row_vec[row_vec.len() / 2]) + - Self::compute_manhattan_dis(&col_vec, col_vec[col_vec.len() / 2]) + Self::compute_manhattan_dis(&row_vec, row_vec[row_vec.len() / 2]) + + Self::compute_manhattan_dis(&col_vec, col_vec[col_vec.len() / 2]) } #[allow(dead_code)] diff --git a/solution/0300-0399/0304.Range Sum Query 2D - Immutable/README.md b/solution/0300-0399/0304.Range Sum Query 2D - Immutable/README.md index 1cd5f050b57bc..1d21c3639d737 100644 --- a/solution/0300-0399/0304.Range Sum Query 2D - Immutable/README.md +++ b/solution/0300-0399/0304.Range Sum Query 2D - Immutable/README.md @@ -286,10 +286,10 @@ impl NumMatrix { let row2: usize = row2 as usize; let col2: usize = col2 as usize; // Return the value in O(1) - self.prefix_vec[row2 + 1][col2 + 1] - - self.prefix_vec[row2 + 1][col1] - - self.prefix_vec[row1][col2 + 1] + - self.prefix_vec[row1][col1] + self.prefix_vec[row2 + 1][col2 + 1] + - self.prefix_vec[row2 + 1][col1] + - self.prefix_vec[row1][col2 + 1] + + self.prefix_vec[row1][col1] } fn initialize_prefix_vec(&mut self) { @@ -297,10 +297,8 @@ impl NumMatrix { for i in 0..self.n { for j in 0..self.m { self.prefix_vec[i + 1][j + 1] = - self.prefix_vec[i][j + 1] + - self.prefix_vec[i + 1][j] - - self.prefix_vec[i][j] + - self.ref_vec[i][j]; + self.prefix_vec[i][j + 1] + self.prefix_vec[i + 1][j] - self.prefix_vec[i][j] + + self.ref_vec[i][j]; } } self.is_initialized = true; diff --git a/solution/0300-0399/0304.Range Sum Query 2D - Immutable/README_EN.md b/solution/0300-0399/0304.Range Sum Query 2D - Immutable/README_EN.md index fc1d38177be8b..391554d59b0b1 100644 --- a/solution/0300-0399/0304.Range Sum Query 2D - Immutable/README_EN.md +++ b/solution/0300-0399/0304.Range Sum Query 2D - Immutable/README_EN.md @@ -245,7 +245,6 @@ class NumMatrix { #### Rust ```rust - /** * Your NumMatrix object will be instantiated and called as such: * let obj = NumMatrix::new(matrix); @@ -286,10 +285,10 @@ impl NumMatrix { let row2: usize = row2 as usize; let col2: usize = col2 as usize; // Return the value in O(1) - self.prefix_vec[row2 + 1][col2 + 1] - - self.prefix_vec[row2 + 1][col1] - - self.prefix_vec[row1][col2 + 1] + - self.prefix_vec[row1][col1] + self.prefix_vec[row2 + 1][col2 + 1] + - self.prefix_vec[row2 + 1][col1] + - self.prefix_vec[row1][col2 + 1] + + self.prefix_vec[row1][col1] } fn initialize_prefix_vec(&mut self) { @@ -297,10 +296,8 @@ impl NumMatrix { for i in 0..self.n { for j in 0..self.m { self.prefix_vec[i + 1][j + 1] = - self.prefix_vec[i][j + 1] + - self.prefix_vec[i + 1][j] - - self.prefix_vec[i][j] + - self.ref_vec[i][j]; + self.prefix_vec[i][j + 1] + self.prefix_vec[i + 1][j] - self.prefix_vec[i][j] + + self.ref_vec[i][j]; } } self.is_initialized = true; diff --git a/solution/0300-0399/0341.Flatten Nested List Iterator/README.md b/solution/0300-0399/0341.Flatten Nested List Iterator/README.md index aa61860ad01c5..616325863bc88 100644 --- a/solution/0300-0399/0341.Flatten Nested List Iterator/README.md +++ b/solution/0300-0399/0341.Flatten Nested List Iterator/README.md @@ -420,10 +420,7 @@ impl NestedIterator { fn new(nestedList: Vec) -> Self { let mut vals = vec![]; Self::dfs(&nestedList, &mut vals); - Self { - vals, - index: 0, - } + Self { vals, index: 0 } } fn next(&mut self) -> i32 { diff --git a/solution/0300-0399/0341.Flatten Nested List Iterator/README_EN.md b/solution/0300-0399/0341.Flatten Nested List Iterator/README_EN.md index 6f94b4cc44f6c..7346931361926 100644 --- a/solution/0300-0399/0341.Flatten Nested List Iterator/README_EN.md +++ b/solution/0300-0399/0341.Flatten Nested List Iterator/README_EN.md @@ -418,10 +418,7 @@ impl NestedIterator { fn new(nestedList: Vec) -> Self { let mut vals = vec![]; Self::dfs(&nestedList, &mut vals); - Self { - vals, - index: 0, - } + Self { vals, index: 0 } } fn next(&mut self) -> i32 { diff --git a/solution/0300-0399/0374.Guess Number Higher or Lower/README_EN.md b/solution/0300-0399/0374.Guess Number Higher or Lower/README_EN.md index a673f341fc6cc..8958e372619b9 100644 --- a/solution/0300-0399/0374.Guess Number Higher or Lower/README_EN.md +++ b/solution/0300-0399/0374.Guess Number Higher or Lower/README_EN.md @@ -200,7 +200,6 @@ function guessNumber(n: number): number { #### Rust ```rust - /** * Forward declaration of guess API. * @param num your guess diff --git a/solution/0300-0399/0380.Insert Delete GetRandom O(1)/README.md b/solution/0300-0399/0380.Insert Delete GetRandom O(1)/README.md index ffca29e3979d4..5cbd63872277f 100644 --- a/solution/0300-0399/0380.Insert Delete GetRandom O(1)/README.md +++ b/solution/0300-0399/0380.Insert Delete GetRandom O(1)/README.md @@ -309,8 +309,8 @@ class RandomizedSet { #### Rust ```rust -use std::collections::HashSet; use rand::Rng; +use std::collections::HashSet; struct RandomizedSet { list: HashSet, diff --git a/solution/0300-0399/0380.Insert Delete GetRandom O(1)/README_EN.md b/solution/0300-0399/0380.Insert Delete GetRandom O(1)/README_EN.md index 6a530aaffbbc2..ee5ebb0a24f07 100644 --- a/solution/0300-0399/0380.Insert Delete GetRandom O(1)/README_EN.md +++ b/solution/0300-0399/0380.Insert Delete GetRandom O(1)/README_EN.md @@ -303,8 +303,8 @@ class RandomizedSet { #### Rust ```rust -use std::collections::HashSet; use rand::Rng; +use std::collections::HashSet; struct RandomizedSet { list: HashSet, diff --git a/solution/0300-0399/0389.Find the Difference/README.md b/solution/0300-0399/0389.Find the Difference/README.md index 7a15713a50f81..ec7002338a52c 100644 --- a/solution/0300-0399/0389.Find the Difference/README.md +++ b/solution/0300-0399/0389.Find the Difference/README.md @@ -167,15 +167,7 @@ impl Solution { count[(t[i] - b'a') as usize] -= 1; } count[(t[n] - b'a') as usize] -= 1; - char::from( - b'a' + - ( - count - .iter() - .position(|&v| v != 0) - .unwrap() as u8 - ) - ) + char::from(b'a' + (count.iter().position(|&v| v != 0).unwrap() as u8)) } } ``` diff --git a/solution/0300-0399/0389.Find the Difference/README_EN.md b/solution/0300-0399/0389.Find the Difference/README_EN.md index a0ea9e6a8e1fa..6cae7d455ad89 100644 --- a/solution/0300-0399/0389.Find the Difference/README_EN.md +++ b/solution/0300-0399/0389.Find the Difference/README_EN.md @@ -165,15 +165,7 @@ impl Solution { count[(t[i] - b'a') as usize] -= 1; } count[(t[n] - b'a') as usize] -= 1; - char::from( - b'a' + - ( - count - .iter() - .position(|&v| v != 0) - .unwrap() as u8 - ) - ) + char::from(b'a' + (count.iter().position(|&v| v != 0).unwrap() as u8)) } } ``` diff --git a/solution/0300-0399/0396.Rotate Function/README.md b/solution/0300-0399/0396.Rotate Function/README.md index 50e04fd76ed10..bc53a64224135 100644 --- a/solution/0300-0399/0396.Rotate Function/README.md +++ b/solution/0300-0399/0396.Rotate Function/README.md @@ -172,11 +172,7 @@ impl Solution { pub fn max_rotate_function(nums: Vec) -> i32 { let n = nums.len(); let sum: i32 = nums.iter().sum(); - let mut pre: i32 = nums - .iter() - .enumerate() - .map(|(i, &v)| (i as i32) * v) - .sum(); + let mut pre: i32 = nums.iter().enumerate().map(|(i, &v)| (i as i32) * v).sum(); (0..n) .map(|i| { let res = pre; diff --git a/solution/0300-0399/0396.Rotate Function/README_EN.md b/solution/0300-0399/0396.Rotate Function/README_EN.md index 974fb594ffee4..084d497a62c1e 100644 --- a/solution/0300-0399/0396.Rotate Function/README_EN.md +++ b/solution/0300-0399/0396.Rotate Function/README_EN.md @@ -170,11 +170,7 @@ impl Solution { pub fn max_rotate_function(nums: Vec) -> i32 { let n = nums.len(); let sum: i32 = nums.iter().sum(); - let mut pre: i32 = nums - .iter() - .enumerate() - .map(|(i, &v)| (i as i32) * v) - .sum(); + let mut pre: i32 = nums.iter().enumerate().map(|(i, &v)| (i as i32) * v).sum(); (0..n) .map(|i| { let res = pre; diff --git a/solution/0300-0399/0399.Evaluate Division/README.md b/solution/0300-0399/0399.Evaluate Division/README.md index fb234730b3d45..348afbccfe5b2 100644 --- a/solution/0300-0399/0399.Evaluate Division/README.md +++ b/solution/0300-0399/0399.Evaluate Division/README.md @@ -274,10 +274,13 @@ impl DisjointSetUnion { let mut nodes = HashMap::new(); for equation in equations.iter() { for iter in equation.iter() { - nodes.insert(iter.clone(), DSUNode { - parent: iter.clone(), - weight: 1.0, - }); + nodes.insert( + iter.clone(), + DSUNode { + parent: iter.clone(), + weight: 1.0, + }, + ); } } DisjointSetUnion { nodes } @@ -325,7 +328,7 @@ impl Solution { pub fn calc_equation( equations: Vec>, values: Vec, - queries: Vec> + queries: Vec>, ) -> Vec { let mut dsu = DisjointSetUnion::new(&equations); for (i, &v) in values.iter().enumerate() { diff --git a/solution/0300-0399/0399.Evaluate Division/README_EN.md b/solution/0300-0399/0399.Evaluate Division/README_EN.md index b24ca37bbe93d..c7f86c1933946 100644 --- a/solution/0300-0399/0399.Evaluate Division/README_EN.md +++ b/solution/0300-0399/0399.Evaluate Division/README_EN.md @@ -272,10 +272,13 @@ impl DisjointSetUnion { let mut nodes = HashMap::new(); for equation in equations.iter() { for iter in equation.iter() { - nodes.insert(iter.clone(), DSUNode { - parent: iter.clone(), - weight: 1.0, - }); + nodes.insert( + iter.clone(), + DSUNode { + parent: iter.clone(), + weight: 1.0, + }, + ); } } DisjointSetUnion { nodes } @@ -323,7 +326,7 @@ impl Solution { pub fn calc_equation( equations: Vec>, values: Vec, - queries: Vec> + queries: Vec>, ) -> Vec { let mut dsu = DisjointSetUnion::new(&equations); for (i, &v) in values.iter().enumerate() { diff --git a/solution/0400-0499/0403.Frog Jump/README.md b/solution/0400-0499/0403.Frog Jump/README.md index f9bf769208d60..b9af93cf60878 100644 --- a/solution/0400-0499/0403.Frog Jump/README.md +++ b/solution/0400-0499/0403.Frog Jump/README.md @@ -260,7 +260,7 @@ impl Solution { k: usize, n: usize, pos: &HashMap, - stones: &Vec + stones: &Vec, ) -> bool { if i == n - 1 { return true; @@ -272,10 +272,9 @@ impl Solution { let k = k as i32; for j in k - 1..=k + 1 { - if - j > 0 && - pos.contains_key(&(stones[i] + j)) && - Self::dfs(record, pos[&(stones[i] + j)], j as usize, n, pos, stones) + if j > 0 + && pos.contains_key(&(stones[i] + j)) + && Self::dfs(record, pos[&(stones[i] + j)], j as usize, n, pos, stones) { record[i][k as usize] = 1; return true; diff --git a/solution/0400-0499/0403.Frog Jump/README_EN.md b/solution/0400-0499/0403.Frog Jump/README_EN.md index 25e9151741b0a..580498ca238ed 100644 --- a/solution/0400-0499/0403.Frog Jump/README_EN.md +++ b/solution/0400-0499/0403.Frog Jump/README_EN.md @@ -260,7 +260,7 @@ impl Solution { k: usize, n: usize, pos: &HashMap, - stones: &Vec + stones: &Vec, ) -> bool { if i == n - 1 { return true; @@ -272,10 +272,9 @@ impl Solution { let k = k as i32; for j in k - 1..=k + 1 { - if - j > 0 && - pos.contains_key(&(stones[i] + j)) && - Self::dfs(record, pos[&(stones[i] + j)], j as usize, n, pos, stones) + if j > 0 + && pos.contains_key(&(stones[i] + j)) + && Self::dfs(record, pos[&(stones[i] + j)], j as usize, n, pos, stones) { record[i][k as usize] = 1; return true; diff --git a/solution/0400-0499/0404.Sum of Left Leaves/README.md b/solution/0400-0499/0404.Sum of Left Leaves/README.md index c5d8fb0fc7558..86eb0934a9292 100644 --- a/solution/0400-0499/0404.Sum of Left Leaves/README.md +++ b/solution/0400-0499/0404.Sum of Left Leaves/README.md @@ -241,8 +241,8 @@ function sumOfLeftLeaves(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, is_left: bool) -> i32 { if root.is_none() { diff --git a/solution/0400-0499/0404.Sum of Left Leaves/README_EN.md b/solution/0400-0499/0404.Sum of Left Leaves/README_EN.md index 133d94716f9e6..75f49c7ffa1ba 100644 --- a/solution/0400-0499/0404.Sum of Left Leaves/README_EN.md +++ b/solution/0400-0499/0404.Sum of Left Leaves/README_EN.md @@ -237,8 +237,8 @@ function sumOfLeftLeaves(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, is_left: bool) -> i32 { if root.is_none() { diff --git a/solution/0400-0499/0433.Minimum Genetic Mutation/README.md b/solution/0400-0499/0433.Minimum Genetic Mutation/README.md index 0fba603179eb9..b56e1ce52900b 100644 --- a/solution/0400-0499/0433.Minimum Genetic Mutation/README.md +++ b/solution/0400-0499/0433.Minimum Genetic Mutation/README.md @@ -233,7 +233,7 @@ function minMutation(startGene: string, endGene: string, bank: string[]): number #### Rust ```rust -use std::collections::{ HashSet, VecDeque }; +use std::collections::{HashSet, VecDeque}; impl Solution { pub fn min_mutation(start_gene: String, end_gene: String, bank: Vec) -> i32 { diff --git a/solution/0400-0499/0433.Minimum Genetic Mutation/README_EN.md b/solution/0400-0499/0433.Minimum Genetic Mutation/README_EN.md index 85a81a2e38f5b..9b6c4fc484a12 100644 --- a/solution/0400-0499/0433.Minimum Genetic Mutation/README_EN.md +++ b/solution/0400-0499/0433.Minimum Genetic Mutation/README_EN.md @@ -222,7 +222,7 @@ function minMutation(startGene: string, endGene: string, bank: string[]): number #### Rust ```rust -use std::collections::{ HashSet, VecDeque }; +use std::collections::{HashSet, VecDeque}; impl Solution { pub fn min_mutation(start_gene: String, end_gene: String, bank: Vec) -> i32 { diff --git a/solution/0400-0499/0445.Add Two Numbers II/README.md b/solution/0400-0499/0445.Add Two Numbers II/README.md index 03c4de4b63dce..2c71fbbbe1e4b 100644 --- a/solution/0400-0499/0445.Add Two Numbers II/README.md +++ b/solution/0400-0499/0445.Add Two Numbers II/README.md @@ -292,7 +292,7 @@ impl Solution { pub fn add_two_numbers( mut l1: Option>, - mut l2: Option> + mut l2: Option>, ) -> Option> { l1 = Self::reverse(l1); l2 = Self::reverse(l2); @@ -366,7 +366,7 @@ impl Solution { pub fn add_two_numbers( l1: Option>, - l2: Option> + l2: Option>, ) -> Option> { let mut s1 = Self::create_stack(l1); let mut s2 = Self::create_stack(l2); @@ -380,12 +380,10 @@ impl Solution { if let Some(val) = s2.pop() { carry += val; } - dummy.next = Some( - Box::new(ListNode { - val: carry % 10, - next: dummy.next.take(), - }) - ); + dummy.next = Some(Box::new(ListNode { + val: carry % 10, + next: dummy.next.take(), + })); carry /= 10; } dummy.next.take() diff --git a/solution/0400-0499/0445.Add Two Numbers II/README_EN.md b/solution/0400-0499/0445.Add Two Numbers II/README_EN.md index 9b019b5ce48ed..e84def2435fea 100644 --- a/solution/0400-0499/0445.Add Two Numbers II/README_EN.md +++ b/solution/0400-0499/0445.Add Two Numbers II/README_EN.md @@ -285,7 +285,7 @@ impl Solution { pub fn add_two_numbers( mut l1: Option>, - mut l2: Option> + mut l2: Option>, ) -> Option> { l1 = Self::reverse(l1); l2 = Self::reverse(l2); @@ -351,7 +351,7 @@ impl Solution { pub fn add_two_numbers( l1: Option>, - l2: Option> + l2: Option>, ) -> Option> { let mut s1 = Self::create_stack(l1); let mut s2 = Self::create_stack(l2); @@ -365,12 +365,10 @@ impl Solution { if let Some(val) = s2.pop() { carry += val; } - dummy.next = Some( - Box::new(ListNode { - val: carry % 10, - next: dummy.next.take(), - }) - ); + dummy.next = Some(Box::new(ListNode { + val: carry % 10, + next: dummy.next.take(), + })); carry /= 10; } dummy.next.take() diff --git a/solution/0400-0499/0450.Delete Node in a BST/README.md b/solution/0400-0499/0450.Delete Node in a BST/README.md index 12cacb8772735..49f25a6a18fe3 100644 --- a/solution/0400-0499/0450.Delete Node in a BST/README.md +++ b/solution/0400-0499/0450.Delete Node in a BST/README.md @@ -326,8 +326,8 @@ function deleteNode(root: TreeNode | null, key: number): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>) -> i32 { let node = root.as_ref().unwrap().borrow(); @@ -339,7 +339,7 @@ impl Solution { pub fn delete_node( mut root: Option>>, - key: i32 + key: i32, ) -> Option>> { if root.is_some() { let mut node = root.as_mut().unwrap().borrow_mut(); diff --git a/solution/0400-0499/0450.Delete Node in a BST/README_EN.md b/solution/0400-0499/0450.Delete Node in a BST/README_EN.md index 58ed29b310782..400fa101af9c1 100644 --- a/solution/0400-0499/0450.Delete Node in a BST/README_EN.md +++ b/solution/0400-0499/0450.Delete Node in a BST/README_EN.md @@ -304,8 +304,8 @@ function deleteNode(root: TreeNode | null, key: number): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>) -> i32 { let node = root.as_ref().unwrap().borrow(); @@ -317,7 +317,7 @@ impl Solution { pub fn delete_node( mut root: Option>>, - key: i32 + key: i32, ) -> Option>> { if root.is_some() { let mut node = root.as_mut().unwrap().borrow_mut(); diff --git a/solution/0400-0499/0454.4Sum II/README.md b/solution/0400-0499/0454.4Sum II/README.md index 6a3c1e6443f70..fbc39eb982615 100644 --- a/solution/0400-0499/0454.4Sum II/README.md +++ b/solution/0400-0499/0454.4Sum II/README.md @@ -180,7 +180,7 @@ impl Solution { nums1: Vec, nums2: Vec, nums3: Vec, - nums4: Vec + nums4: Vec, ) -> i32 { let mut cnt = HashMap::new(); for &a in &nums1 { diff --git a/solution/0400-0499/0454.4Sum II/README_EN.md b/solution/0400-0499/0454.4Sum II/README_EN.md index 484be9eb0356e..0d0ddba7eae2d 100644 --- a/solution/0400-0499/0454.4Sum II/README_EN.md +++ b/solution/0400-0499/0454.4Sum II/README_EN.md @@ -178,7 +178,7 @@ impl Solution { nums1: Vec, nums2: Vec, nums3: Vec, - nums4: Vec + nums4: Vec, ) -> i32 { let mut cnt = HashMap::new(); for &a in &nums1 { diff --git a/solution/0400-0499/0470.Implement Rand10() Using Rand7()/README_EN.md b/solution/0400-0499/0470.Implement Rand10() Using Rand7()/README_EN.md index 3c67eb5a21545..b0e5d0adfe752 100644 --- a/solution/0400-0499/0470.Implement Rand10() Using Rand7()/README_EN.md +++ b/solution/0400-0499/0470.Implement Rand10() Using Rand7()/README_EN.md @@ -163,7 +163,6 @@ function rand10(): number { #### Rust ```rust - /** * The rand7() API is already defined for you. * @return a random integer in the range 1 to 7 diff --git a/solution/0400-0499/0481.Magical String/README.md b/solution/0400-0499/0481.Magical String/README.md index fb789de3668b5..0866a781a5fed 100644 --- a/solution/0400-0499/0481.Magical String/README.md +++ b/solution/0400-0499/0481.Magical String/README.md @@ -208,11 +208,7 @@ impl Solution { } i += 1; } - s - .as_bytes() - [0..n].iter() - .filter(|&v| v == &b'1') - .count() as i32 + s.as_bytes()[0..n].iter().filter(|&v| v == &b'1').count() as i32 } } ``` diff --git a/solution/0400-0499/0481.Magical String/README_EN.md b/solution/0400-0499/0481.Magical String/README_EN.md index e901590d1b25d..bad1c9afde676 100644 --- a/solution/0400-0499/0481.Magical String/README_EN.md +++ b/solution/0400-0499/0481.Magical String/README_EN.md @@ -174,11 +174,7 @@ impl Solution { } i += 1; } - s - .as_bytes() - [0..n].iter() - .filter(|&v| v == &b'1') - .count() as i32 + s.as_bytes()[0..n].iter().filter(|&v| v == &b'1').count() as i32 } } ``` diff --git a/solution/0400-0499/0486.Predict the Winner/README.md b/solution/0400-0499/0486.Predict the Winner/README.md index c4dac150e8457..9a5613b1b103c 100644 --- a/solution/0400-0499/0486.Predict the Winner/README.md +++ b/solution/0400-0499/0486.Predict the Winner/README.md @@ -204,7 +204,7 @@ impl Solution { // Take i-th num nums[i] - dp[i + 1][j], // Take j-th num - nums[j] - dp[i][j - 1] + nums[j] - dp[i][j - 1], ); } } diff --git a/solution/0400-0499/0486.Predict the Winner/README_EN.md b/solution/0400-0499/0486.Predict the Winner/README_EN.md index e0d3fe922375a..88171f6b2f1b1 100644 --- a/solution/0400-0499/0486.Predict the Winner/README_EN.md +++ b/solution/0400-0499/0486.Predict the Winner/README_EN.md @@ -191,7 +191,7 @@ impl Solution { // Take i-th num nums[i] - dp[i + 1][j], // Take j-th num - nums[j] - dp[i][j - 1] + nums[j] - dp[i][j - 1], ); } } diff --git a/solution/0500-0599/0508.Most Frequent Subtree Sum/README.md b/solution/0500-0599/0508.Most Frequent Subtree Sum/README.md index 454b3fae6673c..9647cf651c26b 100644 --- a/solution/0500-0599/0508.Most Frequent Subtree Sum/README.md +++ b/solution/0500-0599/0508.Most Frequent Subtree Sum/README.md @@ -276,14 +276,14 @@ function findFrequentTreeSum(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { fn dfs( root: &Option>>, map: &mut HashMap, - max: &mut i32 + max: &mut i32, ) -> i32 { if root.is_none() { return 0; diff --git a/solution/0500-0599/0508.Most Frequent Subtree Sum/README_EN.md b/solution/0500-0599/0508.Most Frequent Subtree Sum/README_EN.md index 686f1c832f87f..1e4ac92117882 100644 --- a/solution/0500-0599/0508.Most Frequent Subtree Sum/README_EN.md +++ b/solution/0500-0599/0508.Most Frequent Subtree Sum/README_EN.md @@ -270,14 +270,14 @@ function findFrequentTreeSum(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { fn dfs( root: &Option>>, map: &mut HashMap, - max: &mut i32 + max: &mut i32, ) -> i32 { if root.is_none() { return 0; diff --git a/solution/0500-0599/0513.Find Bottom Left Tree Value/README.md b/solution/0500-0599/0513.Find Bottom Left Tree Value/README.md index 34d9260518256..2be3ff8dba7ee 100644 --- a/solution/0500-0599/0513.Find Bottom Left Tree Value/README.md +++ b/solution/0500-0599/0513.Find Bottom Left Tree Value/README.md @@ -249,9 +249,9 @@ function findBottomLeftValue(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn find_bottom_left_value(root: Option>>) -> i32 { let mut queue = VecDeque::new(); @@ -477,9 +477,9 @@ function findBottomLeftValue(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, cur: i32, max: &mut i32, res: &mut i32) { if root.is_none() { diff --git a/solution/0500-0599/0513.Find Bottom Left Tree Value/README_EN.md b/solution/0500-0599/0513.Find Bottom Left Tree Value/README_EN.md index e7e6642153d09..4b4cd509c22e5 100644 --- a/solution/0500-0599/0513.Find Bottom Left Tree Value/README_EN.md +++ b/solution/0500-0599/0513.Find Bottom Left Tree Value/README_EN.md @@ -239,9 +239,9 @@ function findBottomLeftValue(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn find_bottom_left_value(root: Option>>) -> i32 { let mut queue = VecDeque::new(); @@ -465,9 +465,9 @@ function findBottomLeftValue(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, cur: i32, max: &mut i32, res: &mut i32) { if root.is_none() { diff --git a/solution/0500-0599/0515.Find Largest Value in Each Tree Row/README.md b/solution/0500-0599/0515.Find Largest Value in Each Tree Row/README.md index 776d503ff16ae..412db8b003463 100644 --- a/solution/0500-0599/0515.Find Largest Value in Each Tree Row/README.md +++ b/solution/0500-0599/0515.Find Largest Value in Each Tree Row/README.md @@ -266,9 +266,9 @@ function largestValues(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn largest_values(root: Option>>) -> Vec { let mut res = Vec::new(); @@ -499,8 +499,8 @@ function largestValues(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, depth: usize, res: &mut Vec) { if root.is_none() { diff --git a/solution/0500-0599/0515.Find Largest Value in Each Tree Row/README_EN.md b/solution/0500-0599/0515.Find Largest Value in Each Tree Row/README_EN.md index 2f21077f1b987..f110ca8e293c3 100644 --- a/solution/0500-0599/0515.Find Largest Value in Each Tree Row/README_EN.md +++ b/solution/0500-0599/0515.Find Largest Value in Each Tree Row/README_EN.md @@ -258,9 +258,9 @@ function largestValues(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn largest_values(root: Option>>) -> Vec { let mut res = Vec::new(); @@ -489,8 +489,8 @@ function largestValues(root: TreeNode | null): number[] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, depth: usize, res: &mut Vec) { if root.is_none() { diff --git a/solution/0500-0599/0528.Random Pick with Weight/README.md b/solution/0500-0599/0528.Random Pick with Weight/README.md index 6648e51e316aa..f0fecf0396aa5 100644 --- a/solution/0500-0599/0528.Random Pick with Weight/README.md +++ b/solution/0500-0599/0528.Random Pick with Weight/README.md @@ -230,7 +230,7 @@ func (this *Solution) PickIndex() int { #### Rust ```rust -use rand::{ thread_rng, Rng }; +use rand::{thread_rng, Rng}; struct Solution { sum: Vec, diff --git a/solution/0500-0599/0528.Random Pick with Weight/README_EN.md b/solution/0500-0599/0528.Random Pick with Weight/README_EN.md index b4df0a1599934..39b40fa563403 100644 --- a/solution/0500-0599/0528.Random Pick with Weight/README_EN.md +++ b/solution/0500-0599/0528.Random Pick with Weight/README_EN.md @@ -229,7 +229,7 @@ func (this *Solution) PickIndex() int { #### Rust ```rust -use rand::{ thread_rng, Rng }; +use rand::{thread_rng, Rng}; struct Solution { sum: Vec, diff --git a/solution/0500-0599/0530.Minimum Absolute Difference in BST/README.md b/solution/0500-0599/0530.Minimum Absolute Difference in BST/README.md index 151087a8c52d3..b5759e2fcdfaa 100644 --- a/solution/0500-0599/0530.Minimum Absolute Difference in BST/README.md +++ b/solution/0500-0599/0530.Minimum Absolute Difference in BST/README.md @@ -225,8 +225,8 @@ func abs(x int) int { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { #[allow(dead_code)] pub fn get_minimum_difference(root: Option>>) -> i32 { diff --git a/solution/0500-0599/0530.Minimum Absolute Difference in BST/README_EN.md b/solution/0500-0599/0530.Minimum Absolute Difference in BST/README_EN.md index f232f09d055b7..c844437fd016a 100644 --- a/solution/0500-0599/0530.Minimum Absolute Difference in BST/README_EN.md +++ b/solution/0500-0599/0530.Minimum Absolute Difference in BST/README_EN.md @@ -218,8 +218,8 @@ func abs(x int) int { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { #[allow(dead_code)] pub fn get_minimum_difference(root: Option>>) -> i32 { diff --git a/solution/0500-0599/0542.01 Matrix/README.md b/solution/0500-0599/0542.01 Matrix/README.md index 533ea1862d60e..1af062da84d4e 100644 --- a/solution/0500-0599/0542.01 Matrix/README.md +++ b/solution/0500-0599/0542.01 Matrix/README.md @@ -266,9 +266,8 @@ impl Solution { for pair in &traverse_vec { let cur_x = pair.0 + (x as i32); let cur_y = pair.1 + (y as i32); - if - Solution::check_bounds(cur_x, cur_y, n as i32, m as i32) && - ret_vec[cur_x as usize][cur_y as usize] == -1 + if Solution::check_bounds(cur_x, cur_y, n as i32, m as i32) + && ret_vec[cur_x as usize][cur_y as usize] == -1 { // The current cell has not be updated yet, and is also in bound ret_vec[cur_x as usize][cur_y as usize] = ret_vec[x][y] + 1; diff --git a/solution/0500-0599/0542.01 Matrix/README_EN.md b/solution/0500-0599/0542.01 Matrix/README_EN.md index b8101a8467405..a81f66566262b 100644 --- a/solution/0500-0599/0542.01 Matrix/README_EN.md +++ b/solution/0500-0599/0542.01 Matrix/README_EN.md @@ -256,9 +256,8 @@ impl Solution { for pair in &traverse_vec { let cur_x = pair.0 + (x as i32); let cur_y = pair.1 + (y as i32); - if - Solution::check_bounds(cur_x, cur_y, n as i32, m as i32) && - ret_vec[cur_x as usize][cur_y as usize] == -1 + if Solution::check_bounds(cur_x, cur_y, n as i32, m as i32) + && ret_vec[cur_x as usize][cur_y as usize] == -1 { // The current cell has not be updated yet, and is also in bound ret_vec[cur_x as usize][cur_y as usize] = ret_vec[x][y] + 1; diff --git a/solution/0500-0599/0543.Diameter of Binary Tree/README.md b/solution/0500-0599/0543.Diameter of Binary Tree/README.md index 51d31a944f111..f8359280524f3 100644 --- a/solution/0500-0599/0543.Diameter of Binary Tree/README.md +++ b/solution/0500-0599/0543.Diameter of Binary Tree/README.md @@ -239,8 +239,8 @@ function diameterOfBinaryTree(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, res: &mut i32) -> i32 { if root.is_none() { diff --git a/solution/0500-0599/0543.Diameter of Binary Tree/README_EN.md b/solution/0500-0599/0543.Diameter of Binary Tree/README_EN.md index 7270f596278e5..acc4e7107025f 100644 --- a/solution/0500-0599/0543.Diameter of Binary Tree/README_EN.md +++ b/solution/0500-0599/0543.Diameter of Binary Tree/README_EN.md @@ -237,8 +237,8 @@ function diameterOfBinaryTree(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, res: &mut i32) -> i32 { if root.is_none() { diff --git a/solution/0500-0599/0572.Subtree of Another Tree/README.md b/solution/0500-0599/0572.Subtree of Another Tree/README.md index 6c85faedc9b6a..f0924ecb6949d 100644 --- a/solution/0500-0599/0572.Subtree of Another Tree/README.md +++ b/solution/0500-0599/0572.Subtree of Another Tree/README.md @@ -250,8 +250,8 @@ function isSubtree(root: TreeNode | null, subRoot: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, sub_root: &Option>>) -> bool { if root.is_none() && sub_root.is_none() { @@ -262,26 +262,26 @@ impl Solution { } let root = root.as_ref().unwrap().borrow(); let sub_root = sub_root.as_ref().unwrap().borrow(); - root.val == sub_root.val && - Self::dfs(&root.left, &sub_root.left) && - Self::dfs(&root.right, &sub_root.right) + root.val == sub_root.val + && Self::dfs(&root.left, &sub_root.left) + && Self::dfs(&root.right, &sub_root.right) } fn help( root: &Option>>, - sub_root: &Option>> + sub_root: &Option>>, ) -> bool { if root.is_none() { return false; } - Self::dfs(root, sub_root) || - Self::help(&root.as_ref().unwrap().borrow().left, sub_root) || - Self::help(&root.as_ref().unwrap().borrow().right, sub_root) + Self::dfs(root, sub_root) + || Self::help(&root.as_ref().unwrap().borrow().left, sub_root) + || Self::help(&root.as_ref().unwrap().borrow().right, sub_root) } pub fn is_subtree( root: Option>>, - sub_root: Option>> + sub_root: Option>>, ) -> bool { Self::help(&root, &sub_root) } diff --git a/solution/0500-0599/0572.Subtree of Another Tree/README_EN.md b/solution/0500-0599/0572.Subtree of Another Tree/README_EN.md index 17c1f8eecad78..68c54ff473842 100644 --- a/solution/0500-0599/0572.Subtree of Another Tree/README_EN.md +++ b/solution/0500-0599/0572.Subtree of Another Tree/README_EN.md @@ -244,8 +244,8 @@ function isSubtree(root: TreeNode | null, subRoot: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, sub_root: &Option>>) -> bool { if root.is_none() && sub_root.is_none() { @@ -256,26 +256,26 @@ impl Solution { } let root = root.as_ref().unwrap().borrow(); let sub_root = sub_root.as_ref().unwrap().borrow(); - root.val == sub_root.val && - Self::dfs(&root.left, &sub_root.left) && - Self::dfs(&root.right, &sub_root.right) + root.val == sub_root.val + && Self::dfs(&root.left, &sub_root.left) + && Self::dfs(&root.right, &sub_root.right) } fn help( root: &Option>>, - sub_root: &Option>> + sub_root: &Option>>, ) -> bool { if root.is_none() { return false; } - Self::dfs(root, sub_root) || - Self::help(&root.as_ref().unwrap().borrow().left, sub_root) || - Self::help(&root.as_ref().unwrap().borrow().right, sub_root) + Self::dfs(root, sub_root) + || Self::help(&root.as_ref().unwrap().borrow().left, sub_root) + || Self::help(&root.as_ref().unwrap().borrow().right, sub_root) } pub fn is_subtree( root: Option>>, - sub_root: Option>> + sub_root: Option>>, ) -> bool { Self::help(&root, &sub_root) } diff --git a/solution/0500-0599/0591.Tag Validator/README.md b/solution/0500-0599/0591.Tag Validator/README.md index 35352cae1442d..a61d60ef8f9d8 100644 --- a/solution/0500-0599/0591.Tag Validator/README.md +++ b/solution/0500-0599/0591.Tag Validator/README.md @@ -320,12 +320,7 @@ impl Solution { pub fn is_valid(code: String) -> bool { fn check(tag: &str) -> bool { let n = tag.len(); - n >= 1 && - n <= 9 && - tag - .as_bytes() - .iter() - .all(|b| b.is_ascii_uppercase()) + n >= 1 && n <= 9 && tag.as_bytes().iter().all(|b| b.is_ascii_uppercase()) } let mut stk = Vec::new(); diff --git a/solution/0500-0599/0591.Tag Validator/README_EN.md b/solution/0500-0599/0591.Tag Validator/README_EN.md index 39948b2a2fbc3..b58357594d05d 100644 --- a/solution/0500-0599/0591.Tag Validator/README_EN.md +++ b/solution/0500-0599/0591.Tag Validator/README_EN.md @@ -296,12 +296,7 @@ impl Solution { pub fn is_valid(code: String) -> bool { fn check(tag: &str) -> bool { let n = tag.len(); - n >= 1 && - n <= 9 && - tag - .as_bytes() - .iter() - .all(|b| b.is_ascii_uppercase()) + n >= 1 && n <= 9 && tag.as_bytes().iter().all(|b| b.is_ascii_uppercase()) } let mut stk = Vec::new(); diff --git a/solution/0500-0599/0599.Minimum Index Sum of Two Lists/README.md b/solution/0500-0599/0599.Minimum Index Sum of Two Lists/README.md index cf8f47108d48b..ee4562200d5c1 100644 --- a/solution/0500-0599/0599.Minimum Index Sum of Two Lists/README.md +++ b/solution/0500-0599/0599.Minimum Index Sum of Two Lists/README.md @@ -196,21 +196,18 @@ impl Solution { let map: HashMap = HashMap::from_iter(list1.into_iter().zip(0..)); let mut res = vec![]; let mut min_i = usize::MAX; - list2 - .into_iter() - .enumerate() - .for_each(|(i, key)| { - if map.contains_key(&key) { - let sum_i = map.get(&key).unwrap() + i; - if sum_i <= min_i { - if sum_i < min_i { - min_i = sum_i; - res.clear(); - } - res.push(key); + list2.into_iter().enumerate().for_each(|(i, key)| { + if map.contains_key(&key) { + let sum_i = map.get(&key).unwrap() + i; + if sum_i <= min_i { + if sum_i < min_i { + min_i = sum_i; + res.clear(); } + res.push(key); } - }); + } + }); res } } diff --git a/solution/0500-0599/0599.Minimum Index Sum of Two Lists/README_EN.md b/solution/0500-0599/0599.Minimum Index Sum of Two Lists/README_EN.md index e5d2eb10a265c..a0e64465e8d62 100644 --- a/solution/0500-0599/0599.Minimum Index Sum of Two Lists/README_EN.md +++ b/solution/0500-0599/0599.Minimum Index Sum of Two Lists/README_EN.md @@ -211,21 +211,18 @@ impl Solution { let map: HashMap = HashMap::from_iter(list1.into_iter().zip(0..)); let mut res = vec![]; let mut min_i = usize::MAX; - list2 - .into_iter() - .enumerate() - .for_each(|(i, key)| { - if map.contains_key(&key) { - let sum_i = map.get(&key).unwrap() + i; - if sum_i <= min_i { - if sum_i < min_i { - min_i = sum_i; - res.clear(); - } - res.push(key); + list2.into_iter().enumerate().for_each(|(i, key)| { + if map.contains_key(&key) { + let sum_i = map.get(&key).unwrap() + i; + if sum_i <= min_i { + if sum_i < min_i { + min_i = sum_i; + res.clear(); } + res.push(key); } - }); + } + }); res } } diff --git a/solution/0600-0699/0617.Merge Two Binary Trees/README.md b/solution/0600-0699/0617.Merge Two Binary Trees/README.md index d71072df468f4..3923923f35bbb 100644 --- a/solution/0600-0699/0617.Merge Two Binary Trees/README.md +++ b/solution/0600-0699/0617.Merge Two Binary Trees/README.md @@ -226,12 +226,12 @@ function mergeTrees(root1: TreeNode | null, root2: TreeNode | null): TreeNode | // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn merge_trees( root1: Option>>, - root2: Option>> + root2: Option>>, ) -> Option>> { match (root1.is_some(), root2.is_some()) { (false, false) => None, diff --git a/solution/0600-0699/0617.Merge Two Binary Trees/README_EN.md b/solution/0600-0699/0617.Merge Two Binary Trees/README_EN.md index 00d4fa85b0d31..c8f9ddc064d56 100644 --- a/solution/0600-0699/0617.Merge Two Binary Trees/README_EN.md +++ b/solution/0600-0699/0617.Merge Two Binary Trees/README_EN.md @@ -217,12 +217,12 @@ function mergeTrees(root1: TreeNode | null, root2: TreeNode | null): TreeNode | // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn merge_trees( root1: Option>>, - root2: Option>> + root2: Option>>, ) -> Option>> { match (root1.is_some(), root2.is_some()) { (false, false) => None, diff --git a/solution/0600-0699/0637.Average of Levels in Binary Tree/README.md b/solution/0600-0699/0637.Average of Levels in Binary Tree/README.md index 45dd687b475e8..9ce115a0e3321 100644 --- a/solution/0600-0699/0637.Average of Levels in Binary Tree/README.md +++ b/solution/0600-0699/0637.Average of Levels in Binary Tree/README.md @@ -234,9 +234,9 @@ func averageOfLevels(root *TreeNode) []float64 { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn average_of_levels(root: Option>>) -> Vec { diff --git a/solution/0600-0699/0637.Average of Levels in Binary Tree/README_EN.md b/solution/0600-0699/0637.Average of Levels in Binary Tree/README_EN.md index 48727694b31a4..8a6e533e1f855 100644 --- a/solution/0600-0699/0637.Average of Levels in Binary Tree/README_EN.md +++ b/solution/0600-0699/0637.Average of Levels in Binary Tree/README_EN.md @@ -226,9 +226,9 @@ func averageOfLevels(root *TreeNode) []float64 { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn average_of_levels(root: Option>>) -> Vec { diff --git a/solution/0600-0699/0645.Set Mismatch/README.md b/solution/0600-0699/0645.Set Mismatch/README.md index 8d964455d6425..0538ba5670c54 100644 --- a/solution/0600-0699/0645.Set Mismatch/README.md +++ b/solution/0600-0699/0645.Set Mismatch/README.md @@ -157,7 +157,12 @@ impl Solution { pub fn find_error_nums(nums: Vec) -> Vec { let n = nums.len() as i32; let s1 = ((1 + n) * n) / 2; - let s2 = nums.iter().cloned().collect::>().iter().sum::(); + let s2 = nums + .iter() + .cloned() + .collect::>() + .iter() + .sum::(); let s: i32 = nums.iter().sum(); vec![s - s2, s1 - s2] } diff --git a/solution/0600-0699/0645.Set Mismatch/README_EN.md b/solution/0600-0699/0645.Set Mismatch/README_EN.md index ed22e4abc0388..fef38be0dac0a 100644 --- a/solution/0600-0699/0645.Set Mismatch/README_EN.md +++ b/solution/0600-0699/0645.Set Mismatch/README_EN.md @@ -148,7 +148,12 @@ impl Solution { pub fn find_error_nums(nums: Vec) -> Vec { let n = nums.len() as i32; let s1 = ((1 + n) * n) / 2; - let s2 = nums.iter().cloned().collect::>().iter().sum::(); + let s2 = nums + .iter() + .cloned() + .collect::>() + .iter() + .sum::(); let s: i32 = nums.iter().sum(); vec![s - s2, s1 - s2] } diff --git a/solution/0600-0699/0652.Find Duplicate Subtrees/README.md b/solution/0600-0699/0652.Find Duplicate Subtrees/README.md index bd67f9da71917..4fd7e4865e76d 100644 --- a/solution/0600-0699/0652.Find Duplicate Subtrees/README.md +++ b/solution/0600-0699/0652.Find Duplicate Subtrees/README.md @@ -266,14 +266,14 @@ function findDuplicateSubtrees(root: TreeNode | null): Array { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { fn dfs( root: &Option>>, map: &mut HashMap, - res: &mut Vec>>> + res: &mut Vec>>>, ) -> String { if root.is_none() { return String::from('#'); @@ -296,7 +296,7 @@ impl Solution { } pub fn find_duplicate_subtrees( - root: Option>> + root: Option>>, ) -> Vec>>> { let mut map = HashMap::new(); let mut res = Vec::new(); diff --git a/solution/0600-0699/0652.Find Duplicate Subtrees/README_EN.md b/solution/0600-0699/0652.Find Duplicate Subtrees/README_EN.md index f1b4cfb8eb1f5..72bfefb55129b 100644 --- a/solution/0600-0699/0652.Find Duplicate Subtrees/README_EN.md +++ b/solution/0600-0699/0652.Find Duplicate Subtrees/README_EN.md @@ -259,14 +259,14 @@ function findDuplicateSubtrees(root: TreeNode | null): Array { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { fn dfs( root: &Option>>, map: &mut HashMap, - res: &mut Vec>>> + res: &mut Vec>>>, ) -> String { if root.is_none() { return String::from('#'); @@ -289,7 +289,7 @@ impl Solution { } pub fn find_duplicate_subtrees( - root: Option>> + root: Option>>, ) -> Vec>>> { let mut map = HashMap::new(); let mut res = Vec::new(); diff --git a/solution/0600-0699/0653.Two Sum IV - Input is a BST/README.md b/solution/0600-0699/0653.Two Sum IV - Input is a BST/README.md index fb2fd72db6565..b5156591ef741 100644 --- a/solution/0600-0699/0653.Two Sum IV - Input is a BST/README.md +++ b/solution/0600-0699/0653.Two Sum IV - Input is a BST/README.md @@ -244,9 +244,9 @@ function findTarget(root: TreeNode | null, k: number): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; -use std::collections::{ HashSet, VecDeque }; +use std::collections::{HashSet, VecDeque}; +use std::rc::Rc; impl Solution { pub fn find_target(root: Option>>, k: i32) -> bool { let mut set = HashSet::new(); diff --git a/solution/0600-0699/0653.Two Sum IV - Input is a BST/README_EN.md b/solution/0600-0699/0653.Two Sum IV - Input is a BST/README_EN.md index 5f6d06b123768..b88f141d8548b 100644 --- a/solution/0600-0699/0653.Two Sum IV - Input is a BST/README_EN.md +++ b/solution/0600-0699/0653.Two Sum IV - Input is a BST/README_EN.md @@ -238,9 +238,9 @@ function findTarget(root: TreeNode | null, k: number): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; -use std::collections::{ HashSet, VecDeque }; +use std::collections::{HashSet, VecDeque}; +use std::rc::Rc; impl Solution { pub fn find_target(root: Option>>, k: i32) -> bool { let mut set = HashSet::new(); diff --git a/solution/0600-0699/0654.Maximum Binary Tree/README.md b/solution/0600-0699/0654.Maximum Binary Tree/README.md index 85db495986032..99b9398a9d3eb 100644 --- a/solution/0600-0699/0654.Maximum Binary Tree/README.md +++ b/solution/0600-0699/0654.Maximum Binary Tree/README.md @@ -269,8 +269,8 @@ function constructMaximumBinaryTree(nums: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn construct(nums: &Vec, start: usize, end: usize) -> Option>> { if start >= end { @@ -284,15 +284,11 @@ impl Solution { max_val = nums[i]; } } - Some( - Rc::new( - RefCell::new(TreeNode { - val: max_val, - left: Self::construct(nums, start, idx), - right: Self::construct(nums, idx + 1, end), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: max_val, + left: Self::construct(nums, start, idx), + right: Self::construct(nums, idx + 1, end), + }))) } pub fn construct_maximum_binary_tree(nums: Vec) -> Option>> { diff --git a/solution/0600-0699/0654.Maximum Binary Tree/README_EN.md b/solution/0600-0699/0654.Maximum Binary Tree/README_EN.md index 30734631efa03..7560b321bcce2 100644 --- a/solution/0600-0699/0654.Maximum Binary Tree/README_EN.md +++ b/solution/0600-0699/0654.Maximum Binary Tree/README_EN.md @@ -263,8 +263,8 @@ function constructMaximumBinaryTree(nums: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn construct(nums: &Vec, start: usize, end: usize) -> Option>> { if start >= end { @@ -278,15 +278,11 @@ impl Solution { max_val = nums[i]; } } - Some( - Rc::new( - RefCell::new(TreeNode { - val: max_val, - left: Self::construct(nums, start, idx), - right: Self::construct(nums, idx + 1, end), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: max_val, + left: Self::construct(nums, start, idx), + right: Self::construct(nums, idx + 1, end), + }))) } pub fn construct_maximum_binary_tree(nums: Vec) -> Option>> { diff --git a/solution/0600-0699/0655.Print Binary Tree/README.md b/solution/0600-0699/0655.Print Binary Tree/README.md index a0d3651fe1095..d4f587ac29229 100644 --- a/solution/0600-0699/0655.Print Binary Tree/README.md +++ b/solution/0600-0699/0655.Print Binary Tree/README.md @@ -308,8 +308,8 @@ function printTree(root: TreeNode | null): string[][] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn get_height(root: &Option>>, h: u32) -> u32 { if let Some(node) = root { @@ -324,15 +324,27 @@ impl Solution { i: usize, j: usize, res: &mut Vec>, - height: u32 + height: u32, ) { if root.is_none() { return; } let node = root.as_ref().unwrap().borrow(); res[i][j] = node.val.to_string(); - Self::dfs(&node.left, i + 1, j - (2usize).pow(height - (i as u32) - 1), res, height); - Self::dfs(&node.right, i + 1, j + (2usize).pow(height - (i as u32) - 1), res, height); + Self::dfs( + &node.left, + i + 1, + j - (2usize).pow(height - (i as u32) - 1), + res, + height, + ); + Self::dfs( + &node.right, + i + 1, + j + (2usize).pow(height - (i as u32) - 1), + res, + height, + ); } pub fn print_tree(root: Option>>) -> Vec> { diff --git a/solution/0600-0699/0655.Print Binary Tree/README_EN.md b/solution/0600-0699/0655.Print Binary Tree/README_EN.md index 22b67b58120fc..7423766da6d2e 100644 --- a/solution/0600-0699/0655.Print Binary Tree/README_EN.md +++ b/solution/0600-0699/0655.Print Binary Tree/README_EN.md @@ -298,8 +298,8 @@ function printTree(root: TreeNode | null): string[][] { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn get_height(root: &Option>>, h: u32) -> u32 { if let Some(node) = root { @@ -314,15 +314,27 @@ impl Solution { i: usize, j: usize, res: &mut Vec>, - height: u32 + height: u32, ) { if root.is_none() { return; } let node = root.as_ref().unwrap().borrow(); res[i][j] = node.val.to_string(); - Self::dfs(&node.left, i + 1, j - (2usize).pow(height - (i as u32) - 1), res, height); - Self::dfs(&node.right, i + 1, j + (2usize).pow(height - (i as u32) - 1), res, height); + Self::dfs( + &node.left, + i + 1, + j - (2usize).pow(height - (i as u32) - 1), + res, + height, + ); + Self::dfs( + &node.right, + i + 1, + j + (2usize).pow(height - (i as u32) - 1), + res, + height, + ); } pub fn print_tree(root: Option>>) -> Vec> { diff --git a/solution/0600-0699/0669.Trim a Binary Search Tree/README.md b/solution/0600-0699/0669.Trim a Binary Search Tree/README.md index 18d33162cff80..bcc530147b03c 100644 --- a/solution/0600-0699/0669.Trim a Binary Search Tree/README.md +++ b/solution/0600-0699/0669.Trim a Binary Search Tree/README.md @@ -243,13 +243,13 @@ function trimBST(root: TreeNode | null, low: number, high: number): TreeNode | n // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn trim_bst( mut root: Option>>, low: i32, - high: i32 + high: i32, ) -> Option>> { if root.is_none() { return root; diff --git a/solution/0600-0699/0669.Trim a Binary Search Tree/README_EN.md b/solution/0600-0699/0669.Trim a Binary Search Tree/README_EN.md index 701fbc6c38941..72fa573703955 100644 --- a/solution/0600-0699/0669.Trim a Binary Search Tree/README_EN.md +++ b/solution/0600-0699/0669.Trim a Binary Search Tree/README_EN.md @@ -231,13 +231,13 @@ function trimBST(root: TreeNode | null, low: number, high: number): TreeNode | n // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn trim_bst( mut root: Option>>, low: i32, - high: i32 + high: i32, ) -> Option>> { if root.is_none() { return root; diff --git a/solution/0600-0699/0675.Cut Off Trees for Golf Event/README.md b/solution/0600-0699/0675.Cut Off Trees for Golf Event/README.md index 798fadfe8ec0c..58d853ae6799e 100644 --- a/solution/0600-0699/0675.Cut Off Trees for Golf Event/README.md +++ b/solution/0600-0699/0675.Cut Off Trees for Golf Event/README.md @@ -336,12 +336,7 @@ func cutOffTree(forest [][]int) int { use std::collections::HashSet; use std::collections::VecDeque; -const DIRS: [[i32; 2]; 4] = [ - [-1, 0], - [1, 0], - [0, -1], - [0, 1], -]; +const DIRS: [[i32; 2]; 4] = [[-1, 0], [1, 0], [0, -1], [0, 1]]; impl Solution { pub fn cut_off_tree(forest: Vec>) -> i32 { @@ -364,13 +359,12 @@ impl Solution { let x = state / col + DIRS[k][0]; let y = (state % col) + DIRS[k][1]; let nxt = x * col + y; - if - x >= 0 && - x < row && - y >= 0 && - y < col && - forest[x as usize][y as usize] != 0 && - !vis.contains(&nxt) + if x >= 0 + && x < row + && y >= 0 + && y < col + && forest[x as usize][y as usize] != 0 + && !vis.contains(&nxt) { queue.push_back(nxt); vis.insert(nxt); diff --git a/solution/0600-0699/0675.Cut Off Trees for Golf Event/README_EN.md b/solution/0600-0699/0675.Cut Off Trees for Golf Event/README_EN.md index 52c4f244b40a4..fae2b646a5c00 100644 --- a/solution/0600-0699/0675.Cut Off Trees for Golf Event/README_EN.md +++ b/solution/0600-0699/0675.Cut Off Trees for Golf Event/README_EN.md @@ -324,12 +324,7 @@ func cutOffTree(forest [][]int) int { use std::collections::HashSet; use std::collections::VecDeque; -const DIRS: [[i32; 2]; 4] = [ - [-1, 0], - [1, 0], - [0, -1], - [0, 1], -]; +const DIRS: [[i32; 2]; 4] = [[-1, 0], [1, 0], [0, -1], [0, 1]]; impl Solution { pub fn cut_off_tree(forest: Vec>) -> i32 { @@ -352,13 +347,12 @@ impl Solution { let x = state / col + DIRS[k][0]; let y = (state % col) + DIRS[k][1]; let nxt = x * col + y; - if - x >= 0 && - x < row && - y >= 0 && - y < col && - forest[x as usize][y as usize] != 0 && - !vis.contains(&nxt) + if x >= 0 + && x < row + && y >= 0 + && y < col + && forest[x as usize][y as usize] != 0 + && !vis.contains(&nxt) { queue.push_back(nxt); vis.insert(nxt); diff --git a/solution/0600-0699/0676.Implement Magic Dictionary/README.md b/solution/0600-0699/0676.Implement Magic Dictionary/README.md index 72eca0abaa4c9..beb9e9f3b4bfb 100644 --- a/solution/0600-0699/0676.Implement Magic Dictionary/README.md +++ b/solution/0600-0699/0676.Implement Magic Dictionary/README.md @@ -466,12 +466,7 @@ impl Trie { if diff == 0 { for (i, child) in self.children.iter().enumerate() { if i != index && child.is_some() { - if - child - .as_ref() - .unwrap() - .search(&word[1..], 1) - { + if child.as_ref().unwrap().search(&word[1..], 1) { return true; } } diff --git a/solution/0600-0699/0676.Implement Magic Dictionary/README_EN.md b/solution/0600-0699/0676.Implement Magic Dictionary/README_EN.md index ac7f2df4d4980..ff447ce4177cc 100644 --- a/solution/0600-0699/0676.Implement Magic Dictionary/README_EN.md +++ b/solution/0600-0699/0676.Implement Magic Dictionary/README_EN.md @@ -458,12 +458,7 @@ impl Trie { if diff == 0 { for (i, child) in self.children.iter().enumerate() { if i != index && child.is_some() { - if - child - .as_ref() - .unwrap() - .search(&word[1..], 1) - { + if child.as_ref().unwrap().search(&word[1..], 1) { return true; } } diff --git a/solution/0600-0699/0687.Longest Univalue Path/README.md b/solution/0600-0699/0687.Longest Univalue Path/README.md index 2b03c5365c4da..30f28047961a1 100644 --- a/solution/0600-0699/0687.Longest Univalue Path/README.md +++ b/solution/0600-0699/0687.Longest Univalue Path/README.md @@ -269,8 +269,8 @@ function longestUnivaluePath(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, target: i32, res: &mut i32) -> i32 { if root.is_none() { @@ -293,7 +293,11 @@ impl Solution { } let mut res = 0; - Self::dfs(&root, root.as_ref().unwrap().as_ref().borrow().val, &mut res); + Self::dfs( + &root, + root.as_ref().unwrap().as_ref().borrow().val, + &mut res, + ); res } } diff --git a/solution/0600-0699/0687.Longest Univalue Path/README_EN.md b/solution/0600-0699/0687.Longest Univalue Path/README_EN.md index 4879faaaee3e6..f78f941f08b66 100644 --- a/solution/0600-0699/0687.Longest Univalue Path/README_EN.md +++ b/solution/0600-0699/0687.Longest Univalue Path/README_EN.md @@ -261,8 +261,8 @@ function longestUnivaluePath(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, target: i32, res: &mut i32) -> i32 { if root.is_none() { @@ -285,7 +285,11 @@ impl Solution { } let mut res = 0; - Self::dfs(&root, root.as_ref().unwrap().as_ref().borrow().val, &mut res); + Self::dfs( + &root, + root.as_ref().unwrap().as_ref().borrow().val, + &mut res, + ); res } } diff --git a/solution/0600-0699/0691.Stickers to Spell Word/README.md b/solution/0600-0699/0691.Stickers to Spell Word/README.md index 999fb2382e15b..ba583ec999ee5 100644 --- a/solution/0600-0699/0691.Stickers to Spell Word/README.md +++ b/solution/0600-0699/0691.Stickers to Spell Word/README.md @@ -269,7 +269,7 @@ function minStickers(stickers: string[], target: string): number { #### Rust ```rust -use std::collections::{ HashSet, VecDeque }; +use std::collections::{HashSet, VecDeque}; impl Solution { pub fn min_stickers(stickers: Vec, target: String) -> i32 { diff --git a/solution/0600-0699/0691.Stickers to Spell Word/README_EN.md b/solution/0600-0699/0691.Stickers to Spell Word/README_EN.md index d63b3179a210b..a05efe65cf7d0 100644 --- a/solution/0600-0699/0691.Stickers to Spell Word/README_EN.md +++ b/solution/0600-0699/0691.Stickers to Spell Word/README_EN.md @@ -269,7 +269,7 @@ function minStickers(stickers: string[], target: string): number { #### Rust ```rust -use std::collections::{ HashSet, VecDeque }; +use std::collections::{HashSet, VecDeque}; impl Solution { pub fn min_stickers(stickers: Vec, target: String) -> i32 { diff --git a/solution/0700-0799/0707.Design Linked List/README.md b/solution/0700-0799/0707.Design Linked List/README.md index 1ad3c77559131..f897077ba2337 100644 --- a/solution/0700-0799/0707.Design Linked List/README.md +++ b/solution/0700-0799/0707.Design Linked List/README.md @@ -482,12 +482,10 @@ impl MyLinkedList { } fn add_at_head(&mut self, val: i32) { - self.head = Some( - Box::new(ListNode { - val, - next: self.head.take(), - }) - ); + self.head = Some(Box::new(ListNode { + val, + next: self.head.take(), + })); } fn add_at_tail(&mut self, val: i32) { @@ -516,12 +514,10 @@ impl MyLinkedList { cur = cur.next.as_mut().unwrap(); index -= 1; } - cur.next = Some( - Box::new(ListNode { - val, - next: cur.next.take(), - }) - ); + cur.next = Some(Box::new(ListNode { + val, + next: cur.next.take(), + })); self.head = dummy.next; } diff --git a/solution/0700-0799/0707.Design Linked List/README_EN.md b/solution/0700-0799/0707.Design Linked List/README_EN.md index 8d68d1121bdfa..8d13cf59c2219 100644 --- a/solution/0700-0799/0707.Design Linked List/README_EN.md +++ b/solution/0700-0799/0707.Design Linked List/README_EN.md @@ -464,12 +464,10 @@ impl MyLinkedList { } fn add_at_head(&mut self, val: i32) { - self.head = Some( - Box::new(ListNode { - val, - next: self.head.take(), - }) - ); + self.head = Some(Box::new(ListNode { + val, + next: self.head.take(), + })); } fn add_at_tail(&mut self, val: i32) { @@ -498,12 +496,10 @@ impl MyLinkedList { cur = cur.next.as_mut().unwrap(); index -= 1; } - cur.next = Some( - Box::new(ListNode { - val, - next: cur.next.take(), - }) - ); + cur.next = Some(Box::new(ListNode { + val, + next: cur.next.take(), + })); self.head = dummy.next; } diff --git a/solution/0700-0799/0713.Subarray Product Less Than K/README.md b/solution/0700-0799/0713.Subarray Product Less Than K/README.md index 1aff3142d5dbc..fae69af2d1051 100644 --- a/solution/0700-0799/0713.Subarray Product Less Than K/README.md +++ b/solution/0700-0799/0713.Subarray Product Less Than K/README.md @@ -169,16 +169,14 @@ impl Solution { let mut res = 0; let mut product = 1; let mut i = 0; - nums.iter() - .enumerate() - .for_each(|(j, v)| { - product *= v; - while product >= k { - product /= nums[i]; - i += 1; - } - res += j - i + 1; - }); + nums.iter().enumerate().for_each(|(j, v)| { + product *= v; + while product >= k { + product /= nums[i]; + i += 1; + } + res += j - i + 1; + }); res as i32 } } diff --git a/solution/0700-0799/0713.Subarray Product Less Than K/README_EN.md b/solution/0700-0799/0713.Subarray Product Less Than K/README_EN.md index 6e1615a8c6577..47a61e2294340 100644 --- a/solution/0700-0799/0713.Subarray Product Less Than K/README_EN.md +++ b/solution/0700-0799/0713.Subarray Product Less Than K/README_EN.md @@ -150,16 +150,14 @@ impl Solution { let mut res = 0; let mut product = 1; let mut i = 0; - nums.iter() - .enumerate() - .for_each(|(j, v)| { - product *= v; - while product >= k { - product /= nums[i]; - i += 1; - } - res += j - i + 1; - }); + nums.iter().enumerate().for_each(|(j, v)| { + product *= v; + while product >= k { + product /= nums[i]; + i += 1; + } + res += j - i + 1; + }); res as i32 } } diff --git a/solution/0700-0799/0728.Self Dividing Numbers/README.md b/solution/0700-0799/0728.Self Dividing Numbers/README.md index 88c682fe4d3af..28b66a5626026 100644 --- a/solution/0700-0799/0728.Self Dividing Numbers/README.md +++ b/solution/0700-0799/0728.Self Dividing Numbers/README.md @@ -153,18 +153,16 @@ impl Solution { let mut res = vec![]; for i in left..=right { let mut num = i; - if ( - loop { - if num == 0 { - break true; - } - let j = num % 10; - if j == 0 || i % j != 0 { - break false; - } - num /= 10; + if (loop { + if num == 0 { + break true; } - ) { + let j = num % 10; + if j == 0 || i % j != 0 { + break false; + } + num /= 10; + }) { res.push(i); } } diff --git a/solution/0700-0799/0728.Self Dividing Numbers/README_EN.md b/solution/0700-0799/0728.Self Dividing Numbers/README_EN.md index c110120d19ed1..c26e0dc44b1af 100644 --- a/solution/0700-0799/0728.Self Dividing Numbers/README_EN.md +++ b/solution/0700-0799/0728.Self Dividing Numbers/README_EN.md @@ -144,18 +144,16 @@ impl Solution { let mut res = vec![]; for i in left..=right { let mut num = i; - if ( - loop { - if num == 0 { - break true; - } - let j = num % 10; - if j == 0 || i % j != 0 { - break false; - } - num /= 10; + if (loop { + if num == 0 { + break true; } - ) { + let j = num % 10; + if j == 0 || i % j != 0 { + break false; + } + num /= 10; + }) { res.push(i); } } diff --git a/solution/0700-0799/0767.Reorganize String/README.md b/solution/0700-0799/0767.Reorganize String/README.md index deb441754d75a..53172835701c7 100644 --- a/solution/0700-0799/0767.Reorganize String/README.md +++ b/solution/0700-0799/0767.Reorganize String/README.md @@ -210,7 +210,7 @@ func reorganizeString(s string) string { #### Rust ```rust -use std::collections::{ HashMap, BinaryHeap, VecDeque }; +use std::collections::{BinaryHeap, HashMap, VecDeque}; impl Solution { #[allow(dead_code)] diff --git a/solution/0700-0799/0767.Reorganize String/README_EN.md b/solution/0700-0799/0767.Reorganize String/README_EN.md index 060cba2333358..d47975efc375c 100644 --- a/solution/0700-0799/0767.Reorganize String/README_EN.md +++ b/solution/0700-0799/0767.Reorganize String/README_EN.md @@ -195,7 +195,7 @@ func reorganizeString(s string) string { #### Rust ```rust -use std::collections::{ HashMap, BinaryHeap, VecDeque }; +use std::collections::{BinaryHeap, HashMap, VecDeque}; impl Solution { #[allow(dead_code)] diff --git a/solution/0700-0799/0778.Swim in Rising Water/README.md b/solution/0700-0799/0778.Swim in Rising Water/README.md index 00322b6e5efc5..690429f8a8f04 100644 --- a/solution/0700-0799/0778.Swim in Rising Water/README.md +++ b/solution/0700-0799/0778.Swim in Rising Water/README.md @@ -259,12 +259,7 @@ function swimInWater(grid: number[][]): number { #### Rust ```rust -const DIR: [(i32, i32); 4] = [ - (-1, 0), - (1, 0), - (0, -1), - (0, 1), -]; +const DIR: [(i32, i32); 4] = [(-1, 0), (1, 0), (0, -1), (0, 1)]; impl Solution { #[allow(dead_code)] @@ -304,9 +299,8 @@ impl Solution { for (dx, dy) in DIR { let x = dx + (i as i32); let y = dy + (j as i32); - if - Self::check_bounds(x, y, n as i32, m as i32) && - grid[x as usize][y as usize] <= cur_time + if Self::check_bounds(x, y, n as i32, m as i32) + && grid[x as usize][y as usize] <= cur_time { Self::union(i * m + j, (x as usize) * m + (y as usize), d_set); } diff --git a/solution/0700-0799/0778.Swim in Rising Water/README_EN.md b/solution/0700-0799/0778.Swim in Rising Water/README_EN.md index 4a960a75f7276..8212558afeb12 100644 --- a/solution/0700-0799/0778.Swim in Rising Water/README_EN.md +++ b/solution/0700-0799/0778.Swim in Rising Water/README_EN.md @@ -254,12 +254,7 @@ function swimInWater(grid: number[][]): number { #### Rust ```rust -const DIR: [(i32, i32); 4] = [ - (-1, 0), - (1, 0), - (0, -1), - (0, 1), -]; +const DIR: [(i32, i32); 4] = [(-1, 0), (1, 0), (0, -1), (0, 1)]; impl Solution { #[allow(dead_code)] @@ -299,9 +294,8 @@ impl Solution { for (dx, dy) in DIR { let x = dx + (i as i32); let y = dy + (j as i32); - if - Self::check_bounds(x, y, n as i32, m as i32) && - grid[x as usize][y as usize] <= cur_time + if Self::check_bounds(x, y, n as i32, m as i32) + && grid[x as usize][y as usize] <= cur_time { Self::union(i * m + j, (x as usize) * m + (y as usize), d_set); } diff --git a/solution/0700-0799/0785.Is Graph Bipartite/README.md b/solution/0700-0799/0785.Is Graph Bipartite/README.md index 0bf747f9a685b..e11371cfd0b59 100644 --- a/solution/0700-0799/0785.Is Graph Bipartite/README.md +++ b/solution/0700-0799/0785.Is Graph Bipartite/README.md @@ -241,7 +241,7 @@ impl Solution { v: usize, color: usize, color_vec: &mut Vec, - graph: &mut Vec> + graph: &mut Vec>, ) -> bool { color_vec[v] = color; for n in graph[v].clone() { diff --git a/solution/0700-0799/0785.Is Graph Bipartite/README_EN.md b/solution/0700-0799/0785.Is Graph Bipartite/README_EN.md index e21ddfe52013b..b748279581ce6 100644 --- a/solution/0700-0799/0785.Is Graph Bipartite/README_EN.md +++ b/solution/0700-0799/0785.Is Graph Bipartite/README_EN.md @@ -237,7 +237,7 @@ impl Solution { v: usize, color: usize, color_vec: &mut Vec, - graph: &mut Vec> + graph: &mut Vec>, ) -> bool { color_vec[v] = color; for n in graph[v].clone() { diff --git a/solution/0700-0799/0791.Custom Sort String/README.md b/solution/0700-0799/0791.Custom Sort String/README.md index 3df09a7767b67..4987a1d29cdf2 100644 --- a/solution/0700-0799/0791.Custom Sort String/README.md +++ b/solution/0700-0799/0791.Custom Sort String/README.md @@ -151,9 +151,9 @@ impl Solution { d[(c - b'a') as usize] = i; } let mut ans = s.chars().collect::>(); - ans.sort_by(|&a, &b| + ans.sort_by(|&a, &b| { d[((a as u8) - ('a' as u8)) as usize].cmp(&d[((b as u8) - ('a' as u8)) as usize]) - ); + }); ans.into_iter().collect() } } diff --git a/solution/0700-0799/0791.Custom Sort String/README_EN.md b/solution/0700-0799/0791.Custom Sort String/README_EN.md index 752080a108374..ddc2e942c3849 100644 --- a/solution/0700-0799/0791.Custom Sort String/README_EN.md +++ b/solution/0700-0799/0791.Custom Sort String/README_EN.md @@ -150,9 +150,9 @@ impl Solution { d[(c - b'a') as usize] = i; } let mut ans = s.chars().collect::>(); - ans.sort_by(|&a, &b| + ans.sort_by(|&a, &b| { d[((a as u8) - ('a' as u8)) as usize].cmp(&d[((b as u8) - ('a' as u8)) as usize]) - ); + }); ans.into_iter().collect() } } diff --git a/solution/0800-0899/0804.Unique Morse Code Words/README.md b/solution/0800-0899/0804.Unique Morse Code Words/README.md index 131a815ae007c..7f89a550ab36f 100644 --- a/solution/0800-0899/0804.Unique Morse Code Words/README.md +++ b/solution/0800-0899/0804.Unique Morse Code Words/README.md @@ -233,32 +233,9 @@ use std::collections::HashSet; impl Solution { pub fn unique_morse_representations(words: Vec) -> i32 { const codes: [&str; 26] = [ - ".-", - "-...", - "-.-.", - "-..", - ".", - "..-.", - "--.", - "....", - "..", - ".---", - "-.-", - ".-..", - "--", - "-.", - "---", - ".--.", - "--.-", - ".-.", - "...", - "-", - "..-", - "...-", - ".--", - "-..-", - "-.--", - "--..", + ".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", + "--", "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", + "-.--", "--..", ]; words .iter() diff --git a/solution/0800-0899/0804.Unique Morse Code Words/README_EN.md b/solution/0800-0899/0804.Unique Morse Code Words/README_EN.md index 3c4a3372fbd07..397841ee250dd 100644 --- a/solution/0800-0899/0804.Unique Morse Code Words/README_EN.md +++ b/solution/0800-0899/0804.Unique Morse Code Words/README_EN.md @@ -225,32 +225,9 @@ use std::collections::HashSet; impl Solution { pub fn unique_morse_representations(words: Vec) -> i32 { const codes: [&str; 26] = [ - ".-", - "-...", - "-.-.", - "-..", - ".", - "..-.", - "--.", - "....", - "..", - ".---", - "-.-", - ".-..", - "--", - "-.", - "---", - ".--.", - "--.-", - ".-.", - "...", - "-", - "..-", - "...-", - ".--", - "-..-", - "-.--", - "--..", + ".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", + "--", "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", + "-.--", "--..", ]; words .iter() diff --git a/solution/0800-0899/0814.Binary Tree Pruning/README.md b/solution/0800-0899/0814.Binary Tree Pruning/README.md index 09c8d959cec78..e305386216d61 100644 --- a/solution/0800-0899/0814.Binary Tree Pruning/README.md +++ b/solution/0800-0899/0814.Binary Tree Pruning/README.md @@ -224,8 +224,8 @@ function pruneTree(root: TreeNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn prune_tree(root: Option>>) -> Option>> { if root.is_none() { diff --git a/solution/0800-0899/0814.Binary Tree Pruning/README_EN.md b/solution/0800-0899/0814.Binary Tree Pruning/README_EN.md index 285f9217d38a2..39d06266717c3 100644 --- a/solution/0800-0899/0814.Binary Tree Pruning/README_EN.md +++ b/solution/0800-0899/0814.Binary Tree Pruning/README_EN.md @@ -219,8 +219,8 @@ function pruneTree(root: TreeNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn prune_tree(root: Option>>) -> Option>> { if root.is_none() { diff --git a/solution/0800-0899/0819.Most Common Word/README.md b/solution/0800-0899/0819.Most Common Word/README.md index 5dacf5bc726e9..f3adddcb4620e 100644 --- a/solution/0800-0899/0819.Most Common Word/README.md +++ b/solution/0800-0899/0819.Most Common Word/README.md @@ -201,7 +201,7 @@ function mostCommonWord(paragraph: string, banned: string[]): string { #### Rust ```rust -use std::collections::{ HashMap, HashSet }; +use std::collections::{HashMap, HashSet}; impl Solution { pub fn most_common_word(mut paragraph: String, banned: Vec) -> String { paragraph.make_ascii_lowercase(); @@ -217,7 +217,8 @@ impl Solution { map.into_iter() .max_by_key(|&(_, v)| v) .unwrap() - .0.to_string() + .0 + .to_string() } } ``` diff --git a/solution/0800-0899/0819.Most Common Word/README_EN.md b/solution/0800-0899/0819.Most Common Word/README_EN.md index 2099528c2a25e..ebcacda3c5c8e 100644 --- a/solution/0800-0899/0819.Most Common Word/README_EN.md +++ b/solution/0800-0899/0819.Most Common Word/README_EN.md @@ -197,7 +197,7 @@ function mostCommonWord(paragraph: string, banned: string[]): string { #### Rust ```rust -use std::collections::{ HashMap, HashSet }; +use std::collections::{HashMap, HashSet}; impl Solution { pub fn most_common_word(mut paragraph: String, banned: Vec) -> String { paragraph.make_ascii_lowercase(); @@ -213,7 +213,8 @@ impl Solution { map.into_iter() .max_by_key(|&(_, v)| v) .unwrap() - .0.to_string() + .0 + .to_string() } } ``` diff --git a/solution/0800-0899/0827.Making A Large Island/README.md b/solution/0800-0899/0827.Making A Large Island/README.md index b1dd83b54eabf..f4a0b44c5d1c8 100644 --- a/solution/0800-0899/0827.Making A Large Island/README.md +++ b/solution/0800-0899/0827.Making A Large Island/README.md @@ -372,20 +372,19 @@ impl Solution { root: i32, i: usize, j: usize, - dirs: &[i32; 5] + dirs: &[i32; 5], ) -> i32 { p[i][j] = root; cnt[root as usize] += 1; for k in 0..4 { let x = (i as i32) + dirs[k]; let y = (j as i32) + dirs[k + 1]; - if - x >= 0 && - (x as usize) < grid.len() && - y >= 0 && - (y as usize) < grid.len() && - grid[x as usize][y as usize] == 1 && - p[x as usize][y as usize] == 0 + if x >= 0 + && (x as usize) < grid.len() + && y >= 0 + && (y as usize) < grid.len() + && grid[x as usize][y as usize] == 1 + && p[x as usize][y as usize] == 0 { dfs(grid, p, cnt, root, x as usize, y as usize, dirs); } diff --git a/solution/0800-0899/0827.Making A Large Island/README_EN.md b/solution/0800-0899/0827.Making A Large Island/README_EN.md index 54c16c5aaa94d..8995ae7677c44 100644 --- a/solution/0800-0899/0827.Making A Large Island/README_EN.md +++ b/solution/0800-0899/0827.Making A Large Island/README_EN.md @@ -371,20 +371,19 @@ impl Solution { root: i32, i: usize, j: usize, - dirs: &[i32; 5] + dirs: &[i32; 5], ) -> i32 { p[i][j] = root; cnt[root as usize] += 1; for k in 0..4 { let x = (i as i32) + dirs[k]; let y = (j as i32) + dirs[k + 1]; - if - x >= 0 && - (x as usize) < grid.len() && - y >= 0 && - (y as usize) < grid.len() && - grid[x as usize][y as usize] == 1 && - p[x as usize][y as usize] == 0 + if x >= 0 + && (x as usize) < grid.len() + && y >= 0 + && (y as usize) < grid.len() + && grid[x as usize][y as usize] == 1 + && p[x as usize][y as usize] == 0 { dfs(grid, p, cnt, root, x as usize, y as usize, dirs); } diff --git a/solution/0800-0899/0872.Leaf-Similar Trees/README.md b/solution/0800-0899/0872.Leaf-Similar Trees/README.md index 2ae8af0e9cd97..a57e76dee965f 100644 --- a/solution/0800-0899/0872.Leaf-Similar Trees/README.md +++ b/solution/0800-0899/0872.Leaf-Similar Trees/README.md @@ -208,13 +208,13 @@ func leafSimilar(root1 *TreeNode, root2 *TreeNode) bool { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { #[allow(dead_code)] pub fn leaf_similar( root1: Option>>, - root2: Option>> + root2: Option>>, ) -> bool { let mut one_vec: Vec = Vec::new(); let mut two_vec: Vec = Vec::new(); @@ -242,8 +242,8 @@ impl Solution { #[allow(dead_code)] fn is_leaf_node(node: &Option>>) -> bool { - node.as_ref().unwrap().borrow().left.is_none() && - node.as_ref().unwrap().borrow().right.is_none() + node.as_ref().unwrap().borrow().left.is_none() + && node.as_ref().unwrap().borrow().right.is_none() } } ``` diff --git a/solution/0800-0899/0872.Leaf-Similar Trees/README_EN.md b/solution/0800-0899/0872.Leaf-Similar Trees/README_EN.md index 398fd54ab8430..f2ffa8578b9ae 100644 --- a/solution/0800-0899/0872.Leaf-Similar Trees/README_EN.md +++ b/solution/0800-0899/0872.Leaf-Similar Trees/README_EN.md @@ -200,13 +200,13 @@ func leafSimilar(root1 *TreeNode, root2 *TreeNode) bool { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { #[allow(dead_code)] pub fn leaf_similar( root1: Option>>, - root2: Option>> + root2: Option>>, ) -> bool { let mut one_vec: Vec = Vec::new(); let mut two_vec: Vec = Vec::new(); @@ -234,8 +234,8 @@ impl Solution { #[allow(dead_code)] fn is_leaf_node(node: &Option>>) -> bool { - node.as_ref().unwrap().borrow().left.is_none() && - node.as_ref().unwrap().borrow().right.is_none() + node.as_ref().unwrap().borrow().left.is_none() + && node.as_ref().unwrap().borrow().right.is_none() } } ``` diff --git a/solution/0800-0899/0883.Projection Area of 3D Shapes/README.md b/solution/0800-0899/0883.Projection Area of 3D Shapes/README.md index 2e3ba96914a5e..aa2993b39b3de 100644 --- a/solution/0800-0899/0883.Projection Area of 3D Shapes/README.md +++ b/solution/0800-0899/0883.Projection Area of 3D Shapes/README.md @@ -195,26 +195,11 @@ impl Solution { pub fn projection_area(grid: Vec>) -> i32 { let xy: i32 = grid .iter() - .map( - |row| - row - .iter() - .filter(|&&v| v > 0) - .count() as i32 - ) - .sum(); - let yz: i32 = grid - .iter() - .map(|row| *row.iter().max().unwrap_or(&0)) + .map(|row| row.iter().filter(|&&v| v > 0).count() as i32) .sum(); + let yz: i32 = grid.iter().map(|row| *row.iter().max().unwrap_or(&0)).sum(); let zx: i32 = (0..grid[0].len()) - .map(|i| - grid - .iter() - .map(|row| row[i]) - .max() - .unwrap_or(0) - ) + .map(|i| grid.iter().map(|row| row[i]).max().unwrap_or(0)) .sum(); xy + yz + zx } diff --git a/solution/0800-0899/0883.Projection Area of 3D Shapes/README_EN.md b/solution/0800-0899/0883.Projection Area of 3D Shapes/README_EN.md index a0252190d2eaf..fc059350aec43 100644 --- a/solution/0800-0899/0883.Projection Area of 3D Shapes/README_EN.md +++ b/solution/0800-0899/0883.Projection Area of 3D Shapes/README_EN.md @@ -179,26 +179,11 @@ impl Solution { pub fn projection_area(grid: Vec>) -> i32 { let xy: i32 = grid .iter() - .map( - |row| - row - .iter() - .filter(|&&v| v > 0) - .count() as i32 - ) - .sum(); - let yz: i32 = grid - .iter() - .map(|row| *row.iter().max().unwrap_or(&0)) + .map(|row| row.iter().filter(|&&v| v > 0).count() as i32) .sum(); + let yz: i32 = grid.iter().map(|row| *row.iter().max().unwrap_or(&0)).sum(); let zx: i32 = (0..grid[0].len()) - .map(|i| - grid - .iter() - .map(|row| row[i]) - .max() - .unwrap_or(0) - ) + .map(|i| grid.iter().map(|row| row[i]).max().unwrap_or(0)) .sum(); xy + yz + zx } diff --git a/solution/0800-0899/0894.All Possible Full Binary Trees/README.md b/solution/0800-0899/0894.All Possible Full Binary Trees/README.md index ed32137b69d37..6a462dfec3f83 100644 --- a/solution/0800-0899/0894.All Possible Full Binary Trees/README.md +++ b/solution/0800-0899/0894.All Possible Full Binary Trees/README.md @@ -282,8 +282,8 @@ function allPossibleFBT(n: number): Array { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn all_possible_fbt(n: i32) -> Vec>>> { let mut f: Vec>>>>> = vec![None; (n + 1) as usize]; @@ -292,7 +292,7 @@ impl Solution { fn dfs( n: i32, - f: &mut Vec>>>>> + f: &mut Vec>>>>>, ) -> Vec>>> { if let Some(ref result) = f[n as usize] { return result.clone(); @@ -308,15 +308,11 @@ impl Solution { let j = n - 1 - i; for left in Self::dfs(i, f).iter() { for right in Self::dfs(j, f).iter() { - let new_node = Some( - Rc::new( - RefCell::new(TreeNode { - val: 0, - left: left.clone(), - right: right.clone(), - }) - ) - ); + let new_node = Some(Rc::new(RefCell::new(TreeNode { + val: 0, + left: left.clone(), + right: right.clone(), + }))); ans.push(new_node); } } diff --git a/solution/0800-0899/0894.All Possible Full Binary Trees/README_EN.md b/solution/0800-0899/0894.All Possible Full Binary Trees/README_EN.md index 99bfc733e512e..5eb40916d85ee 100644 --- a/solution/0800-0899/0894.All Possible Full Binary Trees/README_EN.md +++ b/solution/0800-0899/0894.All Possible Full Binary Trees/README_EN.md @@ -280,8 +280,8 @@ function allPossibleFBT(n: number): Array { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn all_possible_fbt(n: i32) -> Vec>>> { let mut f: Vec>>>>> = vec![None; (n + 1) as usize]; @@ -290,7 +290,7 @@ impl Solution { fn dfs( n: i32, - f: &mut Vec>>>>> + f: &mut Vec>>>>>, ) -> Vec>>> { if let Some(ref result) = f[n as usize] { return result.clone(); @@ -306,15 +306,11 @@ impl Solution { let j = n - 1 - i; for left in Self::dfs(i, f).iter() { for right in Self::dfs(j, f).iter() { - let new_node = Some( - Rc::new( - RefCell::new(TreeNode { - val: 0, - left: left.clone(), - right: right.clone(), - }) - ) - ); + let new_node = Some(Rc::new(RefCell::new(TreeNode { + val: 0, + left: left.clone(), + right: right.clone(), + }))); ans.push(new_node); } } diff --git a/solution/0900-0999/0907.Sum of Subarray Minimums/README.md b/solution/0900-0999/0907.Sum of Subarray Minimums/README.md index b653263dd3f32..e7a4a5edbc4ca 100644 --- a/solution/0900-0999/0907.Sum of Subarray Minimums/README.md +++ b/solution/0900-0999/0907.Sum of Subarray Minimums/README.md @@ -315,9 +315,8 @@ impl Solution { let MOD = 1_000_000_007; let mut ans: i64 = 0; for i in 0..n { - ans += - ((((right[i] - (i as i32)) * ((i as i32) - left[i])) as i64) * (arr[i] as i64)) % - MOD; + ans += ((((right[i] - (i as i32)) * ((i as i32) - left[i])) as i64) * (arr[i] as i64)) + % MOD; ans %= MOD; } ans as i32 diff --git a/solution/0900-0999/0907.Sum of Subarray Minimums/README_EN.md b/solution/0900-0999/0907.Sum of Subarray Minimums/README_EN.md index dd6b0821740b0..63f94f5f90c3d 100644 --- a/solution/0900-0999/0907.Sum of Subarray Minimums/README_EN.md +++ b/solution/0900-0999/0907.Sum of Subarray Minimums/README_EN.md @@ -311,9 +311,8 @@ impl Solution { let MOD = 1_000_000_007; let mut ans: i64 = 0; for i in 0..n { - ans += - ((((right[i] - (i as i32)) * ((i as i32) - left[i])) as i64) * (arr[i] as i64)) % - MOD; + ans += ((((right[i] - (i as i32)) * ((i as i32) - left[i])) as i64) * (arr[i] as i64)) + % MOD; ans %= MOD; } ans as i32 diff --git a/solution/0900-0999/0936.Stamping The Sequence/README.md b/solution/0900-0999/0936.Stamping The Sequence/README.md index 4318785adfac9..7bfcff7369496 100644 --- a/solution/0900-0999/0936.Stamping The Sequence/README.md +++ b/solution/0900-0999/0936.Stamping The Sequence/README.md @@ -330,12 +330,7 @@ impl Solution { for i in 0..n - m + 1 { for j in 0..m { - if - target - .chars() - .nth(i + j) - .unwrap() == stamp.chars().nth(j).unwrap() - { + if target.chars().nth(i + j).unwrap() == stamp.chars().nth(j).unwrap() { indeg[i] -= 1; if indeg[i] == 0 { q.push_back(i); diff --git a/solution/0900-0999/0936.Stamping The Sequence/README_EN.md b/solution/0900-0999/0936.Stamping The Sequence/README_EN.md index dde2ac7343790..0d178eb5f5e4f 100644 --- a/solution/0900-0999/0936.Stamping The Sequence/README_EN.md +++ b/solution/0900-0999/0936.Stamping The Sequence/README_EN.md @@ -343,12 +343,7 @@ impl Solution { for i in 0..n - m + 1 { for j in 0..m { - if - target - .chars() - .nth(i + j) - .unwrap() == stamp.chars().nth(j).unwrap() - { + if target.chars().nth(i + j).unwrap() == stamp.chars().nth(j).unwrap() { indeg[i] -= 1; if indeg[i] == 0 { q.push_back(i); diff --git a/solution/0900-0999/0937.Reorder Data in Log Files/README.md b/solution/0900-0999/0937.Reorder Data in Log Files/README.md index e583c902fb0f0..b966a9856ad0a 100644 --- a/solution/0900-0999/0937.Reorder Data in Log Files/README.md +++ b/solution/0900-0999/0937.Reorder Data in Log Files/README.md @@ -150,12 +150,10 @@ impl Solution { logs.sort_by(|s1, s2| { let (start1, content1) = s1.split_once(' ').unwrap(); let (start2, content2) = s2.split_once(' ').unwrap(); - match - ( - content1.chars().nth(0).unwrap().is_digit(10), - content2.chars().nth(0).unwrap().is_digit(10), - ) - { + match ( + content1.chars().nth(0).unwrap().is_digit(10), + content2.chars().nth(0).unwrap().is_digit(10), + ) { (true, true) => std::cmp::Ordering::Equal, (true, false) => std::cmp::Ordering::Greater, (false, true) => std::cmp::Ordering::Less, diff --git a/solution/0900-0999/0937.Reorder Data in Log Files/README_EN.md b/solution/0900-0999/0937.Reorder Data in Log Files/README_EN.md index a9ffbad5b75bf..301f2df59d3ab 100644 --- a/solution/0900-0999/0937.Reorder Data in Log Files/README_EN.md +++ b/solution/0900-0999/0937.Reorder Data in Log Files/README_EN.md @@ -148,12 +148,10 @@ impl Solution { logs.sort_by(|s1, s2| { let (start1, content1) = s1.split_once(' ').unwrap(); let (start2, content2) = s2.split_once(' ').unwrap(); - match - ( - content1.chars().nth(0).unwrap().is_digit(10), - content2.chars().nth(0).unwrap().is_digit(10), - ) - { + match ( + content1.chars().nth(0).unwrap().is_digit(10), + content2.chars().nth(0).unwrap().is_digit(10), + ) { (true, true) => std::cmp::Ordering::Equal, (true, false) => std::cmp::Ordering::Greater, (false, true) => std::cmp::Ordering::Less, diff --git a/solution/0900-0999/0940.Distinct Subsequences II/README.md b/solution/0900-0999/0940.Distinct Subsequences II/README.md index 0299e49a63b07..e8c1fd72d8d5b 100644 --- a/solution/0900-0999/0940.Distinct Subsequences II/README.md +++ b/solution/0900-0999/0940.Distinct Subsequences II/README.md @@ -185,14 +185,13 @@ impl Solution { let mut dp = [0; 26]; for u in s.as_bytes() { let i = (u - &b'a') as usize; - dp[i] = - ({ - let mut sum = 0; - dp.iter().for_each(|&v| { - sum = (sum + v) % MOD; - }); - sum - }) + 1; + dp[i] = ({ + let mut sum = 0; + dp.iter().for_each(|&v| { + sum = (sum + v) % MOD; + }); + sum + }) + 1; } let mut res = 0; dp.iter().for_each(|&v| { diff --git a/solution/0900-0999/0940.Distinct Subsequences II/README_EN.md b/solution/0900-0999/0940.Distinct Subsequences II/README_EN.md index de839fe25ed8e..fa7fa9ca1d3a5 100644 --- a/solution/0900-0999/0940.Distinct Subsequences II/README_EN.md +++ b/solution/0900-0999/0940.Distinct Subsequences II/README_EN.md @@ -167,14 +167,13 @@ impl Solution { let mut dp = [0; 26]; for u in s.as_bytes() { let i = (u - &b'a') as usize; - dp[i] = - ({ - let mut sum = 0; - dp.iter().for_each(|&v| { - sum = (sum + v) % MOD; - }); - sum - }) + 1; + dp[i] = ({ + let mut sum = 0; + dp.iter().for_each(|&v| { + sum = (sum + v) % MOD; + }); + sum + }) + 1; } let mut res = 0; dp.iter().for_each(|&v| { diff --git a/solution/0900-0999/0942.DI String Match/README.md b/solution/0900-0999/0942.DI String Match/README.md index a526dde247c1a..e0cc78978275a 100644 --- a/solution/0900-0999/0942.DI String Match/README.md +++ b/solution/0900-0999/0942.DI String Match/README.md @@ -182,15 +182,13 @@ impl Solution { let mut res = Vec::with_capacity(n + 1); let (mut low, mut high) = (-1, (n + 1) as i32); for i in 0..n { - res.push( - if s[i] == b'I' { - low += 1; - low - } else { - high -= 1; - high - } - ); + res.push(if s[i] == b'I' { + low += 1; + low + } else { + high -= 1; + high + }); } res.push(low + 1); res diff --git a/solution/0900-0999/0942.DI String Match/README_EN.md b/solution/0900-0999/0942.DI String Match/README_EN.md index d90cf2fabc1c2..53c6fd96b3ee6 100644 --- a/solution/0900-0999/0942.DI String Match/README_EN.md +++ b/solution/0900-0999/0942.DI String Match/README_EN.md @@ -170,15 +170,13 @@ impl Solution { let mut res = Vec::with_capacity(n + 1); let (mut low, mut high) = (-1, (n + 1) as i32); for i in 0..n { - res.push( - if s[i] == b'I' { - low += 1; - low - } else { - high -= 1; - high - } - ); + res.push(if s[i] == b'I' { + low += 1; + low + } else { + high -= 1; + high + }); } res.push(low + 1); res diff --git a/solution/0900-0999/0953.Verifying an Alien Dictionary/README.md b/solution/0900-0999/0953.Verifying an Alien Dictionary/README.md index c3fdce7bf02a6..39229a9a206de 100644 --- a/solution/0900-0999/0953.Verifying an Alien Dictionary/README.md +++ b/solution/0900-0999/0953.Verifying an Alien Dictionary/README.md @@ -214,13 +214,9 @@ impl Solution { pub fn is_alien_sorted(words: Vec, order: String) -> bool { let n = words.len(); let mut map = HashMap::new(); - order - .as_bytes() - .iter() - .enumerate() - .for_each(|(i, &v)| { - map.insert(v, i); - }); + order.as_bytes().iter().enumerate().for_each(|(i, &v)| { + map.insert(v, i); + }); for i in 1..n { let s1 = words[i - 1].as_bytes(); let s2 = words[i].as_bytes(); diff --git a/solution/0900-0999/0953.Verifying an Alien Dictionary/README_EN.md b/solution/0900-0999/0953.Verifying an Alien Dictionary/README_EN.md index 5d957d695254c..0ed680c085e2d 100644 --- a/solution/0900-0999/0953.Verifying an Alien Dictionary/README_EN.md +++ b/solution/0900-0999/0953.Verifying an Alien Dictionary/README_EN.md @@ -214,13 +214,9 @@ impl Solution { pub fn is_alien_sorted(words: Vec, order: String) -> bool { let n = words.len(); let mut map = HashMap::new(); - order - .as_bytes() - .iter() - .enumerate() - .for_each(|(i, &v)| { - map.insert(v, i); - }); + order.as_bytes().iter().enumerate().for_each(|(i, &v)| { + map.insert(v, i); + }); for i in 1..n { let s1 = words[i - 1].as_bytes(); let s2 = words[i].as_bytes(); diff --git a/solution/0900-0999/0965.Univalued Binary Tree/README.md b/solution/0900-0999/0965.Univalued Binary Tree/README.md index f8195bf258489..3c19bd0afd1b0 100644 --- a/solution/0900-0999/0965.Univalued Binary Tree/README.md +++ b/solution/0900-0999/0965.Univalued Binary Tree/README.md @@ -211,8 +211,8 @@ function isUnivalTree(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(val: i32, root: &Option>>) -> bool { if root.is_none() { diff --git a/solution/0900-0999/0965.Univalued Binary Tree/README_EN.md b/solution/0900-0999/0965.Univalued Binary Tree/README_EN.md index ecffe7c494df0..ac899728e38d9 100644 --- a/solution/0900-0999/0965.Univalued Binary Tree/README_EN.md +++ b/solution/0900-0999/0965.Univalued Binary Tree/README_EN.md @@ -207,8 +207,8 @@ function isUnivalTree(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(val: i32, root: &Option>>) -> bool { if root.is_none() { diff --git a/solution/0900-0999/0973.K Closest Points to Origin/README.md b/solution/0900-0999/0973.K Closest Points to Origin/README.md index d469bd7ba2845..5350dbaa5b121 100644 --- a/solution/0900-0999/0973.K Closest Points to Origin/README.md +++ b/solution/0900-0999/0973.K Closest Points to Origin/README.md @@ -138,9 +138,8 @@ function kClosest(points: number[][], k: number): number[][] { ```rust impl Solution { pub fn k_closest(mut points: Vec>, k: i32) -> Vec> { - points.sort_unstable_by(|a, b| { - (a[0].pow(2) + a[1].pow(2)).cmp(&(b[0].pow(2) + b[1].pow(2))) - }); + points + .sort_unstable_by(|a, b| (a[0].pow(2) + a[1].pow(2)).cmp(&(b[0].pow(2) + b[1].pow(2)))); points[0..k as usize].to_vec() } } diff --git a/solution/0900-0999/0973.K Closest Points to Origin/README_EN.md b/solution/0900-0999/0973.K Closest Points to Origin/README_EN.md index 3e74b8f6eaa75..21f0250eab7c1 100644 --- a/solution/0900-0999/0973.K Closest Points to Origin/README_EN.md +++ b/solution/0900-0999/0973.K Closest Points to Origin/README_EN.md @@ -130,9 +130,8 @@ function kClosest(points: number[][], k: number): number[][] { ```rust impl Solution { pub fn k_closest(mut points: Vec>, k: i32) -> Vec> { - points.sort_unstable_by(|a, b| { - (a[0].pow(2) + a[1].pow(2)).cmp(&(b[0].pow(2) + b[1].pow(2))) - }); + points + .sort_unstable_by(|a, b| (a[0].pow(2) + a[1].pow(2)).cmp(&(b[0].pow(2) + b[1].pow(2)))); points[0..k as usize].to_vec() } } diff --git a/solution/0900-0999/0986.Interval List Intersections/README.md b/solution/0900-0999/0986.Interval List Intersections/README.md index ff3389b472d2b..5e20047fd7441 100644 --- a/solution/0900-0999/0986.Interval List Intersections/README.md +++ b/solution/0900-0999/0986.Interval List Intersections/README.md @@ -198,7 +198,7 @@ function intervalIntersection(firstList: number[][], secondList: number[][]): nu impl Solution { pub fn interval_intersection( first_list: Vec>, - second_list: Vec> + second_list: Vec>, ) -> Vec> { let n = first_list.len(); let m = second_list.len(); diff --git a/solution/0900-0999/0986.Interval List Intersections/README_EN.md b/solution/0900-0999/0986.Interval List Intersections/README_EN.md index c3473754cead1..8cdf2984ac3a9 100644 --- a/solution/0900-0999/0986.Interval List Intersections/README_EN.md +++ b/solution/0900-0999/0986.Interval List Intersections/README_EN.md @@ -182,7 +182,7 @@ function intervalIntersection(firstList: number[][], secondList: number[][]): nu impl Solution { pub fn interval_intersection( first_list: Vec>, - second_list: Vec> + second_list: Vec>, ) -> Vec> { let n = first_list.len(); let m = second_list.len(); diff --git a/solution/0900-0999/0994.Rotting Oranges/README.md b/solution/0900-0999/0994.Rotting Oranges/README.md index e074253a68af2..2b458272f51d8 100644 --- a/solution/0900-0999/0994.Rotting Oranges/README.md +++ b/solution/0900-0999/0994.Rotting Oranges/README.md @@ -298,12 +298,11 @@ impl Solution { for d in 0..4 { let x = p[0] + dirs[d]; let y = p[1] + dirs[d + 1]; - if - x >= 0 && - x < (m as i32) && - y >= 0 && - y < (n as i32) && - grid[x as usize][y as usize] == 1 + if x >= 0 + && x < (m as i32) + && y >= 0 + && y < (n as i32) + && grid[x as usize][y as usize] == 1 { grid[x as usize][y as usize] = 2; q.push_back(vec![x, y]); diff --git a/solution/0900-0999/0994.Rotting Oranges/README_EN.md b/solution/0900-0999/0994.Rotting Oranges/README_EN.md index b568baabad481..6fe41467c7731 100644 --- a/solution/0900-0999/0994.Rotting Oranges/README_EN.md +++ b/solution/0900-0999/0994.Rotting Oranges/README_EN.md @@ -294,12 +294,11 @@ impl Solution { for d in 0..4 { let x = p[0] + dirs[d]; let y = p[1] + dirs[d + 1]; - if - x >= 0 && - x < (m as i32) && - y >= 0 && - y < (n as i32) && - grid[x as usize][y as usize] == 1 + if x >= 0 + && x < (m as i32) + && y >= 0 + && y < (n as i32) + && grid[x as usize][y as usize] == 1 { grid[x as usize][y as usize] = 2; q.push_back(vec![x, y]); diff --git a/solution/0900-0999/0998.Maximum Binary Tree II/README.md b/solution/0900-0999/0998.Maximum Binary Tree II/README.md index d8ccf1a7d262b..63729bde1bb92 100644 --- a/solution/0900-0999/0998.Maximum Binary Tree II/README.md +++ b/solution/0900-0999/0998.Maximum Binary Tree II/README.md @@ -233,23 +233,19 @@ function insertIntoMaxTree(root: TreeNode | null, val: number): TreeNode | null // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn insert_into_max_tree( mut root: Option>>, - val: i32 + val: i32, ) -> Option>> { if root.is_none() || root.as_ref().unwrap().as_ref().borrow().val < val { - return Some( - Rc::new( - RefCell::new(TreeNode { - val, - left: root.take(), - right: None, - }) - ) - ); + return Some(Rc::new(RefCell::new(TreeNode { + val, + left: root.take(), + right: None, + }))); } { let mut root = root.as_ref().unwrap().as_ref().borrow_mut(); diff --git a/solution/0900-0999/0998.Maximum Binary Tree II/README_EN.md b/solution/0900-0999/0998.Maximum Binary Tree II/README_EN.md index 10e047f6e4225..fac21b581f05e 100644 --- a/solution/0900-0999/0998.Maximum Binary Tree II/README_EN.md +++ b/solution/0900-0999/0998.Maximum Binary Tree II/README_EN.md @@ -227,23 +227,19 @@ function insertIntoMaxTree(root: TreeNode | null, val: number): TreeNode | null // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn insert_into_max_tree( mut root: Option>>, - val: i32 + val: i32, ) -> Option>> { if root.is_none() || root.as_ref().unwrap().as_ref().borrow().val < val { - return Some( - Rc::new( - RefCell::new(TreeNode { - val, - left: root.take(), - right: None, - }) - ) - ); + return Some(Rc::new(RefCell::new(TreeNode { + val, + left: root.take(), + right: None, + }))); } { let mut root = root.as_ref().unwrap().as_ref().borrow_mut(); diff --git a/solution/1000-1099/1008.Construct Binary Search Tree from Preorder Traversal/README.md b/solution/1000-1099/1008.Construct Binary Search Tree from Preorder Traversal/README.md index 3f4a31b099eba..ea6d2588f15b3 100644 --- a/solution/1000-1099/1008.Construct Binary Search Tree from Preorder Traversal/README.md +++ b/solution/1000-1099/1008.Construct Binary Search Tree from Preorder Traversal/README.md @@ -278,27 +278,23 @@ function bstFromPreorder(preorder: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs( preorder: &Vec, next: &Vec, left: usize, - right: usize + right: usize, ) -> Option>> { if left >= right { return None; } - Some( - Rc::new( - RefCell::new(TreeNode { - val: preorder[left], - left: Self::dfs(preorder, next, left + 1, next[left]), - right: Self::dfs(preorder, next, next[left], right), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: preorder[left], + left: Self::dfs(preorder, next, left + 1, next[left]), + right: Self::dfs(preorder, next, next[left], right), + }))) } pub fn bst_from_preorder(preorder: Vec) -> Option>> { diff --git a/solution/1000-1099/1008.Construct Binary Search Tree from Preorder Traversal/README_EN.md b/solution/1000-1099/1008.Construct Binary Search Tree from Preorder Traversal/README_EN.md index a51257309b110..62b5c8d41fed2 100644 --- a/solution/1000-1099/1008.Construct Binary Search Tree from Preorder Traversal/README_EN.md +++ b/solution/1000-1099/1008.Construct Binary Search Tree from Preorder Traversal/README_EN.md @@ -272,27 +272,23 @@ function bstFromPreorder(preorder: number[]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs( preorder: &Vec, next: &Vec, left: usize, - right: usize + right: usize, ) -> Option>> { if left >= right { return None; } - Some( - Rc::new( - RefCell::new(TreeNode { - val: preorder[left], - left: Self::dfs(preorder, next, left + 1, next[left]), - right: Self::dfs(preorder, next, next[left], right), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: preorder[left], + left: Self::dfs(preorder, next, left + 1, next[left]), + right: Self::dfs(preorder, next, next[left], right), + }))) } pub fn bst_from_preorder(preorder: Vec) -> Option>> { diff --git a/solution/1000-1099/1022.Sum of Root To Leaf Binary Numbers/README.md b/solution/1000-1099/1022.Sum of Root To Leaf Binary Numbers/README.md index 171769a5cf0f7..bdcba91dad001 100644 --- a/solution/1000-1099/1022.Sum of Root To Leaf Binary Numbers/README.md +++ b/solution/1000-1099/1022.Sum of Root To Leaf Binary Numbers/README.md @@ -244,8 +244,8 @@ function sumRootToLeaf(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, mut num: i32) -> i32 { if root.is_none() { diff --git a/solution/1000-1099/1022.Sum of Root To Leaf Binary Numbers/README_EN.md b/solution/1000-1099/1022.Sum of Root To Leaf Binary Numbers/README_EN.md index 5197eb9345730..b883a8c6a2068 100644 --- a/solution/1000-1099/1022.Sum of Root To Leaf Binary Numbers/README_EN.md +++ b/solution/1000-1099/1022.Sum of Root To Leaf Binary Numbers/README_EN.md @@ -242,8 +242,8 @@ function sumRootToLeaf(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, mut num: i32) -> i32 { if root.is_none() { diff --git a/solution/1000-1099/1036.Escape a Large Maze/README.md b/solution/1000-1099/1036.Escape a Large Maze/README.md index 7926a046e6c98..b741ac6a3723c 100644 --- a/solution/1000-1099/1036.Escape a Large Maze/README.md +++ b/solution/1000-1099/1036.Escape a Large Maze/README.md @@ -210,7 +210,7 @@ func isEscapePossible(blocked [][]int, source []int, target []int) bool { #### Rust ```rust -use std::collections::{ HashSet, VecDeque }; +use std::collections::{HashSet, VecDeque}; const BOUNDARY: i32 = 1_000_000; const MAX: usize = 20000; @@ -240,13 +240,12 @@ fn bfs(block: &HashSet<(i32, i32)>, source: &Vec, target: &Vec) -> boo } for (dx, dy) in dir.iter() { let (nx, ny) = (x + dx, y + dy); - if - nx < 0 || - nx >= BOUNDARY || - ny < 0 || - ny >= BOUNDARY || - vis.contains(&(nx, ny)) || - block.contains(&(nx, ny)) + if nx < 0 + || nx >= BOUNDARY + || ny < 0 + || ny >= BOUNDARY + || vis.contains(&(nx, ny)) + || block.contains(&(nx, ny)) { continue; } diff --git a/solution/1000-1099/1036.Escape a Large Maze/README_EN.md b/solution/1000-1099/1036.Escape a Large Maze/README_EN.md index 6f0a221a8dfcc..eaa4a95a4b6d0 100644 --- a/solution/1000-1099/1036.Escape a Large Maze/README_EN.md +++ b/solution/1000-1099/1036.Escape a Large Maze/README_EN.md @@ -207,7 +207,7 @@ func isEscapePossible(blocked [][]int, source []int, target []int) bool { #### Rust ```rust -use std::collections::{ HashSet, VecDeque }; +use std::collections::{HashSet, VecDeque}; const BOUNDARY: i32 = 1_000_000; const MAX: usize = 20000; @@ -237,13 +237,12 @@ fn bfs(block: &HashSet<(i32, i32)>, source: &Vec, target: &Vec) -> boo } for (dx, dy) in dir.iter() { let (nx, ny) = (x + dx, y + dy); - if - nx < 0 || - nx >= BOUNDARY || - ny < 0 || - ny >= BOUNDARY || - vis.contains(&(nx, ny)) || - block.contains(&(nx, ny)) + if nx < 0 + || nx >= BOUNDARY + || ny < 0 + || ny >= BOUNDARY + || vis.contains(&(nx, ny)) + || block.contains(&(nx, ny)) { continue; } diff --git a/solution/1000-1099/1038.Binary Search Tree to Greater Sum Tree/README.md b/solution/1000-1099/1038.Binary Search Tree to Greater Sum Tree/README.md index c9889a1862185..51d5dd2846f39 100644 --- a/solution/1000-1099/1038.Binary Search Tree to Greater Sum Tree/README.md +++ b/solution/1000-1099/1038.Binary Search Tree to Greater Sum Tree/README.md @@ -255,8 +255,8 @@ function bstToGst(root: TreeNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &mut Option>>, mut sum: i32) -> i32 { if let Some(node) = root { diff --git a/solution/1000-1099/1038.Binary Search Tree to Greater Sum Tree/README_EN.md b/solution/1000-1099/1038.Binary Search Tree to Greater Sum Tree/README_EN.md index 6d8df92c5bef5..f0b0a6a082837 100644 --- a/solution/1000-1099/1038.Binary Search Tree to Greater Sum Tree/README_EN.md +++ b/solution/1000-1099/1038.Binary Search Tree to Greater Sum Tree/README_EN.md @@ -246,8 +246,8 @@ function bstToGst(root: TreeNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &mut Option>>, mut sum: i32) -> i32 { if let Some(node) = root { diff --git a/solution/1000-1099/1048.Longest String Chain/README.md b/solution/1000-1099/1048.Longest String Chain/README.md index 90372dadf45dd..293b782d25428 100644 --- a/solution/1000-1099/1048.Longest String Chain/README.md +++ b/solution/1000-1099/1048.Longest String Chain/README.md @@ -207,7 +207,7 @@ impl Solution { let mut map: HashMap = HashMap::new(); // Sort the words vector first - words.sort_by(|lhs, rhs| { lhs.len().cmp(&rhs.len()) }); + words.sort_by(|lhs, rhs| lhs.len().cmp(&rhs.len())); // Begin the "dp" process for w in words.iter() { diff --git a/solution/1000-1099/1048.Longest String Chain/README_EN.md b/solution/1000-1099/1048.Longest String Chain/README_EN.md index 5dd4fb465bbc4..ddf4537914571 100644 --- a/solution/1000-1099/1048.Longest String Chain/README_EN.md +++ b/solution/1000-1099/1048.Longest String Chain/README_EN.md @@ -206,7 +206,7 @@ impl Solution { let mut map: HashMap = HashMap::new(); // Sort the words vector first - words.sort_by(|lhs, rhs| { lhs.len().cmp(&rhs.len()) }); + words.sort_by(|lhs, rhs| lhs.len().cmp(&rhs.len())); // Begin the "dp" process for w in words.iter() { diff --git a/solution/1000-1099/1049.Last Stone Weight II/README.md b/solution/1000-1099/1049.Last Stone Weight II/README.md index f4e967bf9a2fe..c00a8b99f09f6 100644 --- a/solution/1000-1099/1049.Last Stone Weight II/README.md +++ b/solution/1000-1099/1049.Last Stone Weight II/README.md @@ -188,7 +188,7 @@ impl Solution { } else { std::cmp::max( dp[i - 1][j], - dp[i - 1][j - (stones[i - 1] as usize)] + stones[i - 1] + dp[i - 1][j - (stones[i - 1] as usize)] + stones[i - 1], ) }; } diff --git a/solution/1000-1099/1049.Last Stone Weight II/README_EN.md b/solution/1000-1099/1049.Last Stone Weight II/README_EN.md index 0eb170351b600..0a2a3e92add32 100644 --- a/solution/1000-1099/1049.Last Stone Weight II/README_EN.md +++ b/solution/1000-1099/1049.Last Stone Weight II/README_EN.md @@ -182,7 +182,7 @@ impl Solution { } else { std::cmp::max( dp[i - 1][j], - dp[i - 1][j - (stones[i - 1] as usize)] + stones[i - 1] + dp[i - 1][j - (stones[i - 1] as usize)] + stones[i - 1], ) }; } diff --git a/solution/1000-1099/1094.Car Pooling/README.md b/solution/1000-1099/1094.Car Pooling/README.md index be69ba06407a2..453da9877f8b9 100644 --- a/solution/1000-1099/1094.Car Pooling/README.md +++ b/solution/1000-1099/1094.Car Pooling/README.md @@ -177,11 +177,7 @@ function carPooling(trips: number[][], capacity: number): boolean { ```rust impl Solution { pub fn car_pooling(trips: Vec>, capacity: i32) -> bool { - let mx = trips - .iter() - .map(|e| e[2]) - .max() - .unwrap_or(0) as usize; + let mx = trips.iter().map(|e| e[2]).max().unwrap_or(0) as usize; let mut d = vec![0; mx + 1]; for trip in &trips { let (x, f, t) = (trip[0], trip[1] as usize, trip[2] as usize); diff --git a/solution/1000-1099/1094.Car Pooling/README_EN.md b/solution/1000-1099/1094.Car Pooling/README_EN.md index bb216c1abaf8d..96c24a484f341 100644 --- a/solution/1000-1099/1094.Car Pooling/README_EN.md +++ b/solution/1000-1099/1094.Car Pooling/README_EN.md @@ -175,11 +175,7 @@ function carPooling(trips: number[][], capacity: number): boolean { ```rust impl Solution { pub fn car_pooling(trips: Vec>, capacity: i32) -> bool { - let mx = trips - .iter() - .map(|e| e[2]) - .max() - .unwrap_or(0) as usize; + let mx = trips.iter().map(|e| e[2]).max().unwrap_or(0) as usize; let mut d = vec![0; mx + 1]; for trip in &trips { let (x, f, t) = (trip[0], trip[1] as usize, trip[2] as usize); diff --git a/solution/1100-1199/1102.Path With Maximum Minimum Value/README.md b/solution/1100-1199/1102.Path With Maximum Minimum Value/README.md index d8352b60cf967..d057d6c46c0cf 100644 --- a/solution/1100-1199/1102.Path With Maximum Minimum Value/README.md +++ b/solution/1100-1199/1102.Path With Maximum Minimum Value/README.md @@ -351,12 +351,11 @@ impl Solution { for d in 0..4 { let x = (i as i32) + dirs[d]; let y = (j as i32) + dirs[d + 1]; - if - x >= 0 && - x < (m as i32) && - y >= 0 && - y < (n as i32) && - vis[x as usize][y as usize] + if x >= 0 + && x < (m as i32) + && y >= 0 + && y < (n as i32) + && vis[x as usize][y as usize] { uf.union((x as usize) * n + (y as usize), i * n + j); } diff --git a/solution/1100-1199/1102.Path With Maximum Minimum Value/README_EN.md b/solution/1100-1199/1102.Path With Maximum Minimum Value/README_EN.md index dd9b46d23582e..6ec071c5e964f 100644 --- a/solution/1100-1199/1102.Path With Maximum Minimum Value/README_EN.md +++ b/solution/1100-1199/1102.Path With Maximum Minimum Value/README_EN.md @@ -343,12 +343,11 @@ impl Solution { for d in 0..4 { let x = (i as i32) + dirs[d]; let y = (j as i32) + dirs[d + 1]; - if - x >= 0 && - x < (m as i32) && - y >= 0 && - y < (n as i32) && - vis[x as usize][y as usize] + if x >= 0 + && x < (m as i32) + && y >= 0 + && y < (n as i32) + && vis[x as usize][y as usize] { uf.union((x as usize) * n + (y as usize), i * n + j); } diff --git a/solution/1100-1199/1106.Parsing A Boolean Expression/README.md b/solution/1100-1199/1106.Parsing A Boolean Expression/README.md index 205daae213a13..4de63b119fb33 100644 --- a/solution/1100-1199/1106.Parsing A Boolean Expression/README.md +++ b/solution/1100-1199/1106.Parsing A Boolean Expression/README.md @@ -268,18 +268,10 @@ impl Solution { res.push(!Self::dfs(i, expr)[0]); } b'&' => { - res.push( - Self::dfs(i, expr) - .iter() - .all(|v| *v) - ); + res.push(Self::dfs(i, expr).iter().all(|v| *v)); } b'|' => { - res.push( - Self::dfs(i, expr) - .iter() - .any(|v| *v) - ); + res.push(Self::dfs(i, expr).iter().any(|v| *v)); } _ => {} } diff --git a/solution/1100-1199/1106.Parsing A Boolean Expression/README_EN.md b/solution/1100-1199/1106.Parsing A Boolean Expression/README_EN.md index 80c5be3a3fa53..e94ee7339f4ce 100644 --- a/solution/1100-1199/1106.Parsing A Boolean Expression/README_EN.md +++ b/solution/1100-1199/1106.Parsing A Boolean Expression/README_EN.md @@ -266,18 +266,10 @@ impl Solution { res.push(!Self::dfs(i, expr)[0]); } b'&' => { - res.push( - Self::dfs(i, expr) - .iter() - .all(|v| *v) - ); + res.push(Self::dfs(i, expr).iter().all(|v| *v)); } b'|' => { - res.push( - Self::dfs(i, expr) - .iter() - .any(|v| *v) - ); + res.push(Self::dfs(i, expr).iter().any(|v| *v)); } _ => {} } diff --git a/solution/1100-1199/1197.Minimum Knight Moves/README.md b/solution/1100-1199/1197.Minimum Knight Moves/README.md index bb1ede233fe72..d9814f44b19de 100644 --- a/solution/1100-1199/1197.Minimum Knight Moves/README.md +++ b/solution/1100-1199/1197.Minimum Knight Moves/README.md @@ -248,7 +248,7 @@ impl Solution { q: &mut VecDeque<(i32, i32, i32)>, i: i32, j: i32, - cur_step: i32 + cur_step: i32, ) { let next_step = cur_step + 1; for (dx, dy) in DIR { @@ -472,8 +472,8 @@ func minKnightMoves(x int, y int) int { #### Rust ```rust -use std::collections::VecDeque; use std::collections::HashMap; +use std::collections::VecDeque; const DIR: [(i32, i32); 8] = [ (-2, 1), @@ -527,17 +527,14 @@ impl Solution { fn extend( map_to: &mut HashMap, map_from: &mut HashMap, - cur_q: &mut VecDeque<(i32, i32)> + cur_q: &mut VecDeque<(i32, i32)>, ) -> i32 { let n = cur_q.len(); for _ in 0..n { let (i, j) = cur_q.front().unwrap().clone(); cur_q.pop_front(); // The cur_step here must exist - let cur_step = map_to - .get(&(601 * i + j)) - .unwrap() - .clone(); + let cur_step = map_to.get(&(601 * i + j)).unwrap().clone(); for (dx, dy) in DIR { let x = i + dx; let y = j + dy; @@ -549,14 +546,7 @@ impl Solution { // Check if this node has been visited by the other side if map_from.contains_key(&(601 * x + y)) { // We found the node - return ( - cur_step + - 1 + - map_from - .get(&(601 * x + y)) - .unwrap() - .clone() - ); + return (cur_step + 1 + map_from.get(&(601 * x + y)).unwrap().clone()); } // Otherwise, update map_to and push the new node to queue map_to.insert(601 * x + y, cur_step + 1); diff --git a/solution/1100-1199/1197.Minimum Knight Moves/README_EN.md b/solution/1100-1199/1197.Minimum Knight Moves/README_EN.md index 8421d24132dcb..597b69fcd44a3 100644 --- a/solution/1100-1199/1197.Minimum Knight Moves/README_EN.md +++ b/solution/1100-1199/1197.Minimum Knight Moves/README_EN.md @@ -242,7 +242,7 @@ impl Solution { q: &mut VecDeque<(i32, i32, i32)>, i: i32, j: i32, - cur_step: i32 + cur_step: i32, ) { let next_step = cur_step + 1; for (dx, dy) in DIR { @@ -466,8 +466,8 @@ func minKnightMoves(x int, y int) int { #### Rust ```rust -use std::collections::VecDeque; use std::collections::HashMap; +use std::collections::VecDeque; const DIR: [(i32, i32); 8] = [ (-2, 1), @@ -521,17 +521,14 @@ impl Solution { fn extend( map_to: &mut HashMap, map_from: &mut HashMap, - cur_q: &mut VecDeque<(i32, i32)> + cur_q: &mut VecDeque<(i32, i32)>, ) -> i32 { let n = cur_q.len(); for _ in 0..n { let (i, j) = cur_q.front().unwrap().clone(); cur_q.pop_front(); // The cur_step here must exist - let cur_step = map_to - .get(&(601 * i + j)) - .unwrap() - .clone(); + let cur_step = map_to.get(&(601 * i + j)).unwrap().clone(); for (dx, dy) in DIR { let x = i + dx; let y = j + dy; @@ -543,14 +540,7 @@ impl Solution { // Check if this node has been visited by the other side if map_from.contains_key(&(601 * x + y)) { // We found the node - return ( - cur_step + - 1 + - map_from - .get(&(601 * x + y)) - .unwrap() - .clone() - ); + return (cur_step + 1 + map_from.get(&(601 * x + y)).unwrap().clone()); } // Otherwise, update map_to and push the new node to queue map_to.insert(601 * x + y, cur_step + 1); diff --git a/solution/1100-1199/1199.Minimum Time to Build Blocks/README.md b/solution/1100-1199/1199.Minimum Time to Build Blocks/README.md index caa6577b2e902..51ef4de9428a4 100644 --- a/solution/1100-1199/1199.Minimum Time to Build Blocks/README.md +++ b/solution/1100-1199/1199.Minimum Time to Build Blocks/README.md @@ -185,8 +185,8 @@ function minBuildTime(blocks: number[], split: number): number { #### Rust ```rust -use std::collections::BinaryHeap; use std::cmp::Reverse; +use std::collections::BinaryHeap; impl Solution { pub fn min_build_time(blocks: Vec, split: i32) -> i32 { diff --git a/solution/1100-1199/1199.Minimum Time to Build Blocks/README_EN.md b/solution/1100-1199/1199.Minimum Time to Build Blocks/README_EN.md index 898fce0d8b6b6..10932b0092608 100644 --- a/solution/1100-1199/1199.Minimum Time to Build Blocks/README_EN.md +++ b/solution/1100-1199/1199.Minimum Time to Build Blocks/README_EN.md @@ -183,8 +183,8 @@ function minBuildTime(blocks: number[], split: number): number { #### Rust ```rust -use std::collections::BinaryHeap; use std::cmp::Reverse; +use std::collections::BinaryHeap; impl Solution { pub fn min_build_time(blocks: Vec, split: i32) -> i32 { diff --git a/solution/1200-1299/1229.Meeting Scheduler/README.md b/solution/1200-1299/1229.Meeting Scheduler/README.md index fb7ff61308f40..f09c733f597e3 100644 --- a/solution/1200-1299/1229.Meeting Scheduler/README.md +++ b/solution/1200-1299/1229.Meeting Scheduler/README.md @@ -178,14 +178,14 @@ impl Solution { pub fn min_available_duration( slots1: Vec>, slots2: Vec>, - duration: i32 + duration: i32, ) -> Vec { let mut slots1 = slots1; let mut slots2 = slots2; // First sort the two vectors based on the beginning time - slots1.sort_by(|lhs, rhs| { lhs[0].cmp(&rhs[0]) }); - slots2.sort_by(|lhs, rhs| { lhs[0].cmp(&rhs[0]) }); + slots1.sort_by(|lhs, rhs| lhs[0].cmp(&rhs[0])); + slots2.sort_by(|lhs, rhs| lhs[0].cmp(&rhs[0])); // Then traverse the two vector let mut i: usize = 0; diff --git a/solution/1200-1299/1229.Meeting Scheduler/README_EN.md b/solution/1200-1299/1229.Meeting Scheduler/README_EN.md index 772cf0a23a3e5..2bb8f66336b95 100644 --- a/solution/1200-1299/1229.Meeting Scheduler/README_EN.md +++ b/solution/1200-1299/1229.Meeting Scheduler/README_EN.md @@ -176,14 +176,14 @@ impl Solution { pub fn min_available_duration( slots1: Vec>, slots2: Vec>, - duration: i32 + duration: i32, ) -> Vec { let mut slots1 = slots1; let mut slots2 = slots2; // First sort the two vectors based on the beginning time - slots1.sort_by(|lhs, rhs| { lhs[0].cmp(&rhs[0]) }); - slots2.sort_by(|lhs, rhs| { lhs[0].cmp(&rhs[0]) }); + slots1.sort_by(|lhs, rhs| lhs[0].cmp(&rhs[0])); + slots2.sort_by(|lhs, rhs| lhs[0].cmp(&rhs[0])); // Then traverse the two vector let mut i: usize = 0; diff --git a/solution/1200-1299/1244.Design A Leaderboard/README.md b/solution/1200-1299/1244.Design A Leaderboard/README.md index fda2275afdf9d..887104c8c33bc 100644 --- a/solution/1200-1299/1244.Design A Leaderboard/README.md +++ b/solution/1200-1299/1244.Design A Leaderboard/README.md @@ -250,7 +250,8 @@ impl Leaderboard { fn add_score(&mut self, player_id: i32, score: i32) { if self.record_map.contains_key(&player_id) { // The player exists, just add the score - self.record_map.insert(player_id, self.record_map.get(&player_id).unwrap() + score); + self.record_map + .insert(player_id, self.record_map.get(&player_id).unwrap() + score); } else { // Add the new player to the map self.record_map.insert(player_id, score); @@ -259,11 +260,8 @@ impl Leaderboard { #[allow(dead_code)] fn top(&self, k: i32) -> i32 { - let mut cur_vec: Vec<(i32, i32)> = self.record_map - .iter() - .map(|(k, v)| (*k, *v)) - .collect(); - cur_vec.sort_by(|lhs, rhs| { rhs.1.cmp(&lhs.1) }); + let mut cur_vec: Vec<(i32, i32)> = self.record_map.iter().map(|(k, v)| (*k, *v)).collect(); + cur_vec.sort_by(|lhs, rhs| rhs.1.cmp(&lhs.1)); // Iterate reversely for K let mut sum = 0; let mut i = 0; diff --git a/solution/1200-1299/1244.Design A Leaderboard/README_EN.md b/solution/1200-1299/1244.Design A Leaderboard/README_EN.md index 2183ec7c5fa6a..9f7243af74731 100644 --- a/solution/1200-1299/1244.Design A Leaderboard/README_EN.md +++ b/solution/1200-1299/1244.Design A Leaderboard/README_EN.md @@ -239,7 +239,8 @@ impl Leaderboard { fn add_score(&mut self, player_id: i32, score: i32) { if self.record_map.contains_key(&player_id) { // The player exists, just add the score - self.record_map.insert(player_id, self.record_map.get(&player_id).unwrap() + score); + self.record_map + .insert(player_id, self.record_map.get(&player_id).unwrap() + score); } else { // Add the new player to the map self.record_map.insert(player_id, score); @@ -248,11 +249,8 @@ impl Leaderboard { #[allow(dead_code)] fn top(&self, k: i32) -> i32 { - let mut cur_vec: Vec<(i32, i32)> = self.record_map - .iter() - .map(|(k, v)| (*k, *v)) - .collect(); - cur_vec.sort_by(|lhs, rhs| { rhs.1.cmp(&lhs.1) }); + let mut cur_vec: Vec<(i32, i32)> = self.record_map.iter().map(|(k, v)| (*k, *v)).collect(); + cur_vec.sort_by(|lhs, rhs| rhs.1.cmp(&lhs.1)); // Iterate reversely for K let mut sum = 0; let mut i = 0; diff --git a/solution/1200-1299/1282.Group the People Given the Group Size They Belong To/README.md b/solution/1200-1299/1282.Group the People Given the Group Size They Belong To/README.md index f7fac3a3e076b..47dfe3ae7925a 100644 --- a/solution/1200-1299/1282.Group the People Given the Group Size They Belong To/README.md +++ b/solution/1200-1299/1282.Group the People Given the Group Size They Belong To/README.md @@ -193,7 +193,7 @@ impl Solution { v[j..(j + i).min(v.len())] .iter() .map(|&x| x as i32) - .collect() + .collect(), ); } } diff --git a/solution/1200-1299/1282.Group the People Given the Group Size They Belong To/README_EN.md b/solution/1200-1299/1282.Group the People Given the Group Size They Belong To/README_EN.md index 31ae0a20bbe60..1fd1511f31cf6 100644 --- a/solution/1200-1299/1282.Group the People Given the Group Size They Belong To/README_EN.md +++ b/solution/1200-1299/1282.Group the People Given the Group Size They Belong To/README_EN.md @@ -191,7 +191,7 @@ impl Solution { v[j..(j + i).min(v.len())] .iter() .map(|&x| x as i32) - .collect() + .collect(), ); } } diff --git a/solution/1300-1399/1302.Deepest Leaves Sum/README.md b/solution/1300-1399/1302.Deepest Leaves Sum/README.md index bc34e8755e99e..1f24f08f0c75b 100644 --- a/solution/1300-1399/1302.Deepest Leaves Sum/README.md +++ b/solution/1300-1399/1302.Deepest Leaves Sum/README.md @@ -251,8 +251,8 @@ function deepestLeavesSum(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, depth: i32, max_depth: &mut i32, res: &mut i32) { if let Some(node) = root { diff --git a/solution/1300-1399/1302.Deepest Leaves Sum/README_EN.md b/solution/1300-1399/1302.Deepest Leaves Sum/README_EN.md index ea9652ff9cbf1..98f03740fa7f7 100644 --- a/solution/1300-1399/1302.Deepest Leaves Sum/README_EN.md +++ b/solution/1300-1399/1302.Deepest Leaves Sum/README_EN.md @@ -243,8 +243,8 @@ function deepestLeavesSum(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>, depth: i32, max_depth: &mut i32, res: &mut i32) { if let Some(node) = root { diff --git a/solution/1300-1399/1305.All Elements in Two Binary Search Trees/README.md b/solution/1300-1399/1305.All Elements in Two Binary Search Trees/README.md index 968b49c92d078..afd7545d9c5b0 100644 --- a/solution/1300-1399/1305.All Elements in Two Binary Search Trees/README.md +++ b/solution/1300-1399/1305.All Elements in Two Binary Search Trees/README.md @@ -331,7 +331,7 @@ use std::rc::Rc; impl Solution { pub fn get_all_elements( root1: Option>>, - root2: Option>> + root2: Option>>, ) -> Vec { fn dfs(root: &Option>>, t: &mut Vec) { if let Some(root) = root { diff --git a/solution/1300-1399/1305.All Elements in Two Binary Search Trees/README_EN.md b/solution/1300-1399/1305.All Elements in Two Binary Search Trees/README_EN.md index 1fe1ea8f8e4b3..1845ec9ae494a 100644 --- a/solution/1300-1399/1305.All Elements in Two Binary Search Trees/README_EN.md +++ b/solution/1300-1399/1305.All Elements in Two Binary Search Trees/README_EN.md @@ -325,7 +325,7 @@ use std::rc::Rc; impl Solution { pub fn get_all_elements( root1: Option>>, - root2: Option>> + root2: Option>>, ) -> Vec { fn dfs(root: &Option>>, t: &mut Vec) { if let Some(root) = root { diff --git a/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README.md b/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README.md index 5184db67f9b87..246fb58074aab 100644 --- a/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README.md +++ b/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README.md @@ -239,10 +239,8 @@ impl Solution { // Initialize the last vector for (i, &r) in ranges.iter().enumerate() { if (i as i32) - r >= 0 { - last[((i as i32) - r) as usize] = std::cmp::max( - last[((i as i32) - r) as usize], - (i as i32) + r - ); + last[((i as i32) - r) as usize] = + std::cmp::max(last[((i as i32) - r) as usize], (i as i32) + r); } else { last[0] = std::cmp::max(last[0], (i as i32) + r); } diff --git a/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README_EN.md b/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README_EN.md index fe40712b4dac8..a6f873b6250e2 100644 --- a/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README_EN.md +++ b/solution/1300-1399/1326.Minimum Number of Taps to Open to Water a Garden/README_EN.md @@ -209,10 +209,8 @@ impl Solution { // Initialize the last vector for (i, &r) in ranges.iter().enumerate() { if (i as i32) - r >= 0 { - last[((i as i32) - r) as usize] = std::cmp::max( - last[((i as i32) - r) as usize], - (i as i32) + r - ); + last[((i as i32) - r) as usize] = + std::cmp::max(last[((i as i32) - r) as usize], (i as i32) + r); } else { last[0] = std::cmp::max(last[0], (i as i32) + r); } diff --git a/solution/1300-1399/1367.Linked List in Binary Tree/README.md b/solution/1300-1399/1367.Linked List in Binary Tree/README.md index cae09ba807b9a..a8debc2e7e59c 100644 --- a/solution/1300-1399/1367.Linked List in Binary Tree/README.md +++ b/solution/1300-1399/1367.Linked List in Binary Tree/README.md @@ -330,8 +330,8 @@ function isSubPath(head: ListNode | null, root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(head: &Option>, root: &Option>>) -> bool { if head.is_none() { @@ -353,9 +353,9 @@ impl Solution { return false; } let node = root.as_ref().unwrap().borrow(); - Self::dfs(head, root) || - Self::my_is_sub_path(head, &node.left) || - Self::my_is_sub_path(head, &node.right) + Self::dfs(head, root) + || Self::my_is_sub_path(head, &node.left) + || Self::my_is_sub_path(head, &node.right) } pub fn is_sub_path(head: Option>, root: Option>>) -> bool { diff --git a/solution/1300-1399/1367.Linked List in Binary Tree/README_EN.md b/solution/1300-1399/1367.Linked List in Binary Tree/README_EN.md index 031736bd62d77..b413ba1d14178 100644 --- a/solution/1300-1399/1367.Linked List in Binary Tree/README_EN.md +++ b/solution/1300-1399/1367.Linked List in Binary Tree/README_EN.md @@ -331,8 +331,8 @@ function isSubPath(head: ListNode | null, root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(head: &Option>, root: &Option>>) -> bool { if head.is_none() { @@ -354,9 +354,9 @@ impl Solution { return false; } let node = root.as_ref().unwrap().borrow(); - Self::dfs(head, root) || - Self::my_is_sub_path(head, &node.left) || - Self::my_is_sub_path(head, &node.right) + Self::dfs(head, root) + || Self::my_is_sub_path(head, &node.left) + || Self::my_is_sub_path(head, &node.right) } pub fn is_sub_path(head: Option>, root: Option>>) -> bool { diff --git a/solution/1300-1399/1385.Find the Distance Value Between Two Arrays/README.md b/solution/1300-1399/1385.Find the Distance Value Between Two Arrays/README.md index 143c3d1ab1a24..8b3ab47cb18e6 100644 --- a/solution/1300-1399/1385.Find the Distance Value Between Two Arrays/README.md +++ b/solution/1300-1399/1385.Find the Distance Value Between Two Arrays/README.md @@ -216,9 +216,7 @@ impl Solution { right = mid; } } - if - i32::abs(num - arr2[left]) <= d || - (left != 0 && i32::abs(num - arr2[left - 1]) <= d) + if i32::abs(num - arr2[left]) <= d || (left != 0 && i32::abs(num - arr2[left - 1]) <= d) { continue; } diff --git a/solution/1300-1399/1385.Find the Distance Value Between Two Arrays/README_EN.md b/solution/1300-1399/1385.Find the Distance Value Between Two Arrays/README_EN.md index de07ef80d27ed..a3712f51fde41 100644 --- a/solution/1300-1399/1385.Find the Distance Value Between Two Arrays/README_EN.md +++ b/solution/1300-1399/1385.Find the Distance Value Between Two Arrays/README_EN.md @@ -211,9 +211,7 @@ impl Solution { right = mid; } } - if - i32::abs(num - arr2[left]) <= d || - (left != 0 && i32::abs(num - arr2[left - 1]) <= d) + if i32::abs(num - arr2[left]) <= d || (left != 0 && i32::abs(num - arr2[left - 1]) <= d) { continue; } diff --git a/solution/1400-1499/1428.Leftmost Column with at Least a One/README.md b/solution/1400-1499/1428.Leftmost Column with at Least a One/README.md index 328f7245f67e7..a26b7304c918e 100644 --- a/solution/1400-1499/1428.Leftmost Column with at Least a One/README.md +++ b/solution/1400-1499/1428.Leftmost Column with at Least a One/README.md @@ -261,7 +261,6 @@ function leftMostColumnWithOne(binaryMatrix: BinaryMatrix) { #### Rust ```rust - /** * // This is the BinaryMatrix's API interface. * // You should not implement it, or speculate about its implementation diff --git a/solution/1400-1499/1431.Kids With the Greatest Number of Candies/README.md b/solution/1400-1499/1431.Kids With the Greatest Number of Candies/README.md index 188bd54693edf..77e5e94316a0b 100644 --- a/solution/1400-1499/1431.Kids With the Greatest Number of Candies/README.md +++ b/solution/1400-1499/1431.Kids With the Greatest Number of Candies/README.md @@ -139,10 +139,7 @@ function kidsWithCandies(candies: number[], extraCandies: number): boolean[] { impl Solution { pub fn kids_with_candies(candies: Vec, extra_candies: i32) -> Vec { let max = *candies.iter().max().unwrap(); - candies - .iter() - .map(|v| v + extra_candies >= max) - .collect() + candies.iter().map(|v| v + extra_candies >= max).collect() } } ``` diff --git a/solution/1400-1499/1431.Kids With the Greatest Number of Candies/README_EN.md b/solution/1400-1499/1431.Kids With the Greatest Number of Candies/README_EN.md index 26a6839370622..2aa0d799f44fb 100644 --- a/solution/1400-1499/1431.Kids With the Greatest Number of Candies/README_EN.md +++ b/solution/1400-1499/1431.Kids With the Greatest Number of Candies/README_EN.md @@ -144,10 +144,7 @@ function kidsWithCandies(candies: number[], extraCandies: number): boolean[] { impl Solution { pub fn kids_with_candies(candies: Vec, extra_candies: i32) -> Vec { let max = *candies.iter().max().unwrap(); - candies - .iter() - .map(|v| v + extra_candies >= max) - .collect() + candies.iter().map(|v| v + extra_candies >= max).collect() } } ``` diff --git a/solution/1400-1499/1436.Destination City/README.md b/solution/1400-1499/1436.Destination City/README.md index 436117856461f..1e07a3b9d376a 100644 --- a/solution/1400-1499/1436.Destination City/README.md +++ b/solution/1400-1499/1436.Destination City/README.md @@ -165,10 +165,7 @@ function destCity(paths: string[][]): string { use std::collections::HashSet; impl Solution { pub fn dest_city(paths: Vec>) -> String { - let set = paths - .iter() - .map(|v| &v[0]) - .collect::>(); + let set = paths.iter().map(|v| &v[0]).collect::>(); for path in paths.iter() { if !set.contains(&path[1]) { return path[1].clone(); diff --git a/solution/1400-1499/1436.Destination City/README_EN.md b/solution/1400-1499/1436.Destination City/README_EN.md index 0e9b8f02cbcd6..e4f15c0c9368e 100644 --- a/solution/1400-1499/1436.Destination City/README_EN.md +++ b/solution/1400-1499/1436.Destination City/README_EN.md @@ -159,10 +159,7 @@ function destCity(paths: string[][]): string { use std::collections::HashSet; impl Solution { pub fn dest_city(paths: Vec>) -> String { - let set = paths - .iter() - .map(|v| &v[0]) - .collect::>(); + let set = paths.iter().map(|v| &v[0]).collect::>(); for path in paths.iter() { if !set.contains(&path[1]) { return path[1].clone(); diff --git a/solution/1400-1499/1457.Pseudo-Palindromic Paths in a Binary Tree/README.md b/solution/1400-1499/1457.Pseudo-Palindromic Paths in a Binary Tree/README.md index d10383b8d99b4..acd69936d3e74 100644 --- a/solution/1400-1499/1457.Pseudo-Palindromic Paths in a Binary Tree/README.md +++ b/solution/1400-1499/1457.Pseudo-Palindromic Paths in a Binary Tree/README.md @@ -267,8 +267,8 @@ function pseudoPalindromicPaths(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn pseudo_palindromic_paths(root: Option>>) -> i32 { @@ -282,9 +282,8 @@ impl Solution { return if (mask & (mask - 1)) == 0 { 1 } else { 0 }; } - return ( - dfs(node.borrow().left.clone(), mask) + dfs(node.borrow().right.clone(), mask) - ); + return (dfs(node.borrow().left.clone(), mask) + + dfs(node.borrow().right.clone(), mask)); } 0 } diff --git a/solution/1400-1499/1457.Pseudo-Palindromic Paths in a Binary Tree/README_EN.md b/solution/1400-1499/1457.Pseudo-Palindromic Paths in a Binary Tree/README_EN.md index 9ea155e450ad4..d35805e9381a3 100644 --- a/solution/1400-1499/1457.Pseudo-Palindromic Paths in a Binary Tree/README_EN.md +++ b/solution/1400-1499/1457.Pseudo-Palindromic Paths in a Binary Tree/README_EN.md @@ -263,8 +263,8 @@ function pseudoPalindromicPaths(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn pseudo_palindromic_paths(root: Option>>) -> i32 { @@ -278,9 +278,8 @@ impl Solution { return if (mask & (mask - 1)) == 0 { 1 } else { 0 }; } - return ( - dfs(node.borrow().left.clone(), mask) + dfs(node.borrow().right.clone(), mask) - ); + return (dfs(node.borrow().left.clone(), mask) + + dfs(node.borrow().right.clone(), mask)); } 0 } diff --git a/solution/1400-1499/1458.Max Dot Product of Two Subsequences/README.md b/solution/1400-1499/1458.Max Dot Product of Two Subsequences/README.md index 70522bad6b603..2d5cc8c3efca0 100644 --- a/solution/1400-1499/1458.Max Dot Product of Two Subsequences/README.md +++ b/solution/1400-1499/1458.Max Dot Product of Two Subsequences/README.md @@ -188,7 +188,7 @@ impl Solution { for j in 1..=m { dp[i][j] = std::cmp::max( std::cmp::max(dp[i - 1][j], dp[i][j - 1]), - std::cmp::max(dp[i - 1][j - 1], 0) + nums1[i - 1] * nums2[j - 1] + std::cmp::max(dp[i - 1][j - 1], 0) + nums1[i - 1] * nums2[j - 1], ); } } diff --git a/solution/1400-1499/1458.Max Dot Product of Two Subsequences/README_EN.md b/solution/1400-1499/1458.Max Dot Product of Two Subsequences/README_EN.md index 319411318266e..9adf9790e37f4 100644 --- a/solution/1400-1499/1458.Max Dot Product of Two Subsequences/README_EN.md +++ b/solution/1400-1499/1458.Max Dot Product of Two Subsequences/README_EN.md @@ -162,7 +162,7 @@ impl Solution { for j in 1..=m { dp[i][j] = std::cmp::max( std::cmp::max(dp[i - 1][j], dp[i][j - 1]), - std::cmp::max(dp[i - 1][j - 1], 0) + nums1[i - 1] * nums2[j - 1] + std::cmp::max(dp[i - 1][j - 1], 0) + nums1[i - 1] * nums2[j - 1], ); } } diff --git a/solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/README.md b/solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/README.md index e72582a551d8e..8b6d9985b8db2 100644 --- a/solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/README.md +++ b/solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/README.md @@ -199,7 +199,7 @@ impl Solution { h: i32, w: i32, mut horizontal_cuts: Vec, - mut vertical_cuts: Vec + mut vertical_cuts: Vec, ) -> i32 { const MOD: i64 = 1_000_000_007; @@ -211,12 +211,18 @@ impl Solution { let mut x = i64::max( horizontal_cuts[0] as i64, - (h as i64) - (horizontal_cuts[m - 1] as i64) + (h as i64) - (horizontal_cuts[m - 1] as i64), + ); + let mut y = i64::max( + vertical_cuts[0] as i64, + (w as i64) - (vertical_cuts[n - 1] as i64), ); - let mut y = i64::max(vertical_cuts[0] as i64, (w as i64) - (vertical_cuts[n - 1] as i64)); for i in 1..m { - x = i64::max(x, (horizontal_cuts[i] as i64) - (horizontal_cuts[i - 1] as i64)); + x = i64::max( + x, + (horizontal_cuts[i] as i64) - (horizontal_cuts[i - 1] as i64), + ); } for i in 1..n { diff --git a/solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/README_EN.md b/solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/README_EN.md index 21103fd3cb258..6dfcda60e84e1 100644 --- a/solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/README_EN.md +++ b/solution/1400-1499/1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/README_EN.md @@ -194,7 +194,7 @@ impl Solution { h: i32, w: i32, mut horizontal_cuts: Vec, - mut vertical_cuts: Vec + mut vertical_cuts: Vec, ) -> i32 { const MOD: i64 = 1_000_000_007; @@ -206,12 +206,18 @@ impl Solution { let mut x = i64::max( horizontal_cuts[0] as i64, - (h as i64) - (horizontal_cuts[m - 1] as i64) + (h as i64) - (horizontal_cuts[m - 1] as i64), + ); + let mut y = i64::max( + vertical_cuts[0] as i64, + (w as i64) - (vertical_cuts[n - 1] as i64), ); - let mut y = i64::max(vertical_cuts[0] as i64, (w as i64) - (vertical_cuts[n - 1] as i64)); for i in 1..m { - x = i64::max(x, (horizontal_cuts[i] as i64) - (horizontal_cuts[i - 1] as i64)); + x = i64::max( + x, + (horizontal_cuts[i] as i64) - (horizontal_cuts[i - 1] as i64), + ); } for i in 1..n { diff --git a/solution/1500-1599/1599.Maximum Profit of Operating a Centennial Wheel/README.md b/solution/1500-1599/1599.Maximum Profit of Operating a Centennial Wheel/README.md index de396f21a7638..99b3e0a714ad4 100644 --- a/solution/1500-1599/1599.Maximum Profit of Operating a Centennial Wheel/README.md +++ b/solution/1500-1599/1599.Maximum Profit of Operating a Centennial Wheel/README.md @@ -227,7 +227,7 @@ impl Solution { pub fn min_operations_max_profit( customers: Vec, boarding_cost: i32, - running_cost: i32 + running_cost: i32, ) -> i32 { let mut ans = -1; let mut mx = 0; diff --git a/solution/1500-1599/1599.Maximum Profit of Operating a Centennial Wheel/README_EN.md b/solution/1500-1599/1599.Maximum Profit of Operating a Centennial Wheel/README_EN.md index 1b2f7424d2a91..ffc47a09c5e86 100644 --- a/solution/1500-1599/1599.Maximum Profit of Operating a Centennial Wheel/README_EN.md +++ b/solution/1500-1599/1599.Maximum Profit of Operating a Centennial Wheel/README_EN.md @@ -224,7 +224,7 @@ impl Solution { pub fn min_operations_max_profit( customers: Vec, boarding_cost: i32, - running_cost: i32 + running_cost: i32, ) -> i32 { let mut ans = -1; let mut mx = 0; diff --git a/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README.md b/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README.md index 32e1f74139c2a..ed23af50499ac 100644 --- a/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README.md +++ b/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README.md @@ -197,7 +197,7 @@ impl Solution { cnt[((c as u8) - ('a' as u8)) as usize] += 1; } - cnt.sort_by(|&lhs, &rhs| { rhs.cmp(&lhs) }); + cnt.sort_by(|&lhs, &rhs| rhs.cmp(&lhs)); for i in 1..26 { while cnt[i] >= cnt[i - 1] && cnt[i] > 0 { diff --git a/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README_EN.md b/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README_EN.md index 60e1fb3cf3dcb..38e7ba8a18b9b 100644 --- a/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README_EN.md +++ b/solution/1600-1699/1647.Minimum Deletions to Make Character Frequencies Unique/README_EN.md @@ -185,7 +185,7 @@ impl Solution { cnt[((c as u8) - ('a' as u8)) as usize] += 1; } - cnt.sort_by(|&lhs, &rhs| { rhs.cmp(&lhs) }); + cnt.sort_by(|&lhs, &rhs| rhs.cmp(&lhs)); for i in 1..26 { while cnt[i] >= cnt[i - 1] && cnt[i] > 0 { diff --git a/solution/1600-1699/1656.Design an Ordered Stream/README.md b/solution/1600-1699/1656.Design an Ordered Stream/README.md index 90082a6cdbcb7..f1b5a644de66b 100644 --- a/solution/1600-1699/1656.Design an Ordered Stream/README.md +++ b/solution/1600-1699/1656.Design an Ordered Stream/README.md @@ -236,7 +236,10 @@ struct OrderedStream { */ impl OrderedStream { fn new(n: i32) -> Self { - Self { ptr: 0, vals: vec![None; n as usize] } + Self { + ptr: 0, + vals: vec![None; n as usize], + } } fn insert(&mut self, id_key: i32, value: String) -> Vec { diff --git a/solution/1600-1699/1656.Design an Ordered Stream/README_EN.md b/solution/1600-1699/1656.Design an Ordered Stream/README_EN.md index c34c2f0bba412..2fb0836c2356a 100644 --- a/solution/1600-1699/1656.Design an Ordered Stream/README_EN.md +++ b/solution/1600-1699/1656.Design an Ordered Stream/README_EN.md @@ -231,7 +231,10 @@ struct OrderedStream { */ impl OrderedStream { fn new(n: i32) -> Self { - Self { ptr: 0, vals: vec![None; n as usize] } + Self { + ptr: 0, + vals: vec![None; n as usize], + } } fn insert(&mut self, id_key: i32, value: String) -> Vec { diff --git a/solution/1600-1699/1668.Maximum Repeating Substring/README.md b/solution/1600-1699/1668.Maximum Repeating Substring/README.md index 899f87ab9566b..5b85a332cffd8 100644 --- a/solution/1600-1699/1668.Maximum Repeating Substring/README.md +++ b/solution/1600-1699/1668.Maximum Repeating Substring/README.md @@ -162,7 +162,11 @@ impl Solution { for i in 0..=n - m { let s = &sequence[i..i + m]; if s == word { - dp[i] = (if (i as i32) - (m as i32) < 0 { 0 } else { dp[i - m] }) + 1; + dp[i] = (if (i as i32) - (m as i32) < 0 { + 0 + } else { + dp[i - m] + }) + 1; } } *dp.iter().max().unwrap() diff --git a/solution/1600-1699/1668.Maximum Repeating Substring/README_EN.md b/solution/1600-1699/1668.Maximum Repeating Substring/README_EN.md index 4df84b87126ed..4b840d241740c 100644 --- a/solution/1600-1699/1668.Maximum Repeating Substring/README_EN.md +++ b/solution/1600-1699/1668.Maximum Repeating Substring/README_EN.md @@ -156,7 +156,11 @@ impl Solution { for i in 0..=n - m { let s = &sequence[i..i + m]; if s == word { - dp[i] = (if (i as i32) - (m as i32) < 0 { 0 } else { dp[i - m] }) + 1; + dp[i] = (if (i as i32) - (m as i32) < 0 { + 0 + } else { + dp[i - m] + }) + 1; } } *dp.iter().max().unwrap() diff --git a/solution/1600-1699/1672.Richest Customer Wealth/README.md b/solution/1600-1699/1672.Richest Customer Wealth/README.md index 1447af28ba6b8..9bc27849eee95 100644 --- a/solution/1600-1699/1672.Richest Customer Wealth/README.md +++ b/solution/1600-1699/1672.Richest Customer Wealth/README.md @@ -156,11 +156,7 @@ function maximumWealth(accounts: number[][]): number { ```rust impl Solution { pub fn maximum_wealth(accounts: Vec>) -> i32 { - accounts - .iter() - .map(|v| v.iter().sum()) - .max() - .unwrap() + accounts.iter().map(|v| v.iter().sum()).max().unwrap() } } ``` diff --git a/solution/1600-1699/1672.Richest Customer Wealth/README_EN.md b/solution/1600-1699/1672.Richest Customer Wealth/README_EN.md index 28db0d239dcfe..7cff07b9cdd58 100644 --- a/solution/1600-1699/1672.Richest Customer Wealth/README_EN.md +++ b/solution/1600-1699/1672.Richest Customer Wealth/README_EN.md @@ -157,11 +157,7 @@ function maximumWealth(accounts: number[][]): number { ```rust impl Solution { pub fn maximum_wealth(accounts: Vec>) -> i32 { - accounts - .iter() - .map(|v| v.iter().sum()) - .max() - .unwrap() + accounts.iter().map(|v| v.iter().sum()).max().unwrap() } } ``` diff --git a/solution/1600-1699/1678.Goal Parser Interpretation/README.md b/solution/1600-1699/1678.Goal Parser Interpretation/README.md index 160ff24292c43..8a3932af3e399 100644 --- a/solution/1600-1699/1678.Goal Parser Interpretation/README.md +++ b/solution/1600-1699/1678.Goal Parser Interpretation/README.md @@ -276,7 +276,11 @@ impl Solution { } if bs[i] == b'(' { ans.push_str({ - if bs[i + 1] == b')' { "o" } else { "al" } + if bs[i + 1] == b')' { + "o" + } else { + "al" + } }); } } diff --git a/solution/1600-1699/1678.Goal Parser Interpretation/README_EN.md b/solution/1600-1699/1678.Goal Parser Interpretation/README_EN.md index 1ac056741f54f..67f7e5b3c9fd6 100644 --- a/solution/1600-1699/1678.Goal Parser Interpretation/README_EN.md +++ b/solution/1600-1699/1678.Goal Parser Interpretation/README_EN.md @@ -275,7 +275,11 @@ impl Solution { } if bs[i] == b'(' { ans.push_str({ - if bs[i + 1] == b')' { "o" } else { "al" } + if bs[i + 1] == b')' { + "o" + } else { + "al" + } }); } } diff --git a/solution/1600-1699/1694.Reformat Phone Number/README.md b/solution/1600-1699/1694.Reformat Phone Number/README.md index b5f74d3a289d6..e33b330d2ddc3 100644 --- a/solution/1600-1699/1694.Reformat Phone Number/README.md +++ b/solution/1600-1699/1694.Reformat Phone Number/README.md @@ -230,10 +230,7 @@ function reformatNumber(number: string): string { ```rust impl Solution { pub fn reformat_number(number: String) -> String { - let cs: Vec = number - .chars() - .filter(|&c| c != ' ' && c != '-') - .collect(); + let cs: Vec = number.chars().filter(|&c| c != ' ' && c != '-').collect(); let n = cs.len(); cs.iter() .enumerate() diff --git a/solution/1600-1699/1694.Reformat Phone Number/README_EN.md b/solution/1600-1699/1694.Reformat Phone Number/README_EN.md index 90608de8f80c8..59568e60abc6f 100644 --- a/solution/1600-1699/1694.Reformat Phone Number/README_EN.md +++ b/solution/1600-1699/1694.Reformat Phone Number/README_EN.md @@ -211,10 +211,7 @@ function reformatNumber(number: string): string { ```rust impl Solution { pub fn reformat_number(number: String) -> String { - let cs: Vec = number - .chars() - .filter(|&c| c != ' ' && c != '-') - .collect(); + let cs: Vec = number.chars().filter(|&c| c != ' ' && c != '-').collect(); let n = cs.len(); cs.iter() .enumerate() diff --git a/solution/1600-1699/1697.Checking Existence of Edge Length Limited Paths/README.md b/solution/1600-1699/1697.Checking Existence of Edge Length Limited Paths/README.md index 985b091722a28..2aa95a465328e 100644 --- a/solution/1600-1699/1697.Checking Existence of Edge Length Limited Paths/README.md +++ b/solution/1600-1699/1697.Checking Existence of Edge Length Limited Paths/README.md @@ -226,7 +226,7 @@ impl Solution { pub fn distance_limited_paths_exist( n: i32, edge_list: Vec>, - queries: Vec> + queries: Vec>, ) -> Vec { let mut disjoint_set: Vec = vec![0; n as usize]; let mut ans_vec: Vec = vec![false; queries.len()]; @@ -259,7 +259,7 @@ impl Solution { Solution::union( edge_list[edge_idx][0] as usize, edge_list[edge_idx][1] as usize, - &mut disjoint_set + &mut disjoint_set, ); edge_idx += 1; } diff --git a/solution/1600-1699/1697.Checking Existence of Edge Length Limited Paths/README_EN.md b/solution/1600-1699/1697.Checking Existence of Edge Length Limited Paths/README_EN.md index 312ff274aa889..66626db1bc77a 100644 --- a/solution/1600-1699/1697.Checking Existence of Edge Length Limited Paths/README_EN.md +++ b/solution/1600-1699/1697.Checking Existence of Edge Length Limited Paths/README_EN.md @@ -224,7 +224,7 @@ impl Solution { pub fn distance_limited_paths_exist( n: i32, edge_list: Vec>, - queries: Vec> + queries: Vec>, ) -> Vec { let mut disjoint_set: Vec = vec![0; n as usize]; let mut ans_vec: Vec = vec![false; queries.len()]; @@ -257,7 +257,7 @@ impl Solution { Solution::union( edge_list[edge_idx][0] as usize, edge_list[edge_idx][1] as usize, - &mut disjoint_set + &mut disjoint_set, ); edge_idx += 1; } diff --git a/solution/1700-1799/1702.Maximum Binary String After Change/README.md b/solution/1700-1799/1702.Maximum Binary String After Change/README.md index 60b6c39ef7f11..7d8c5d8fb10d2 100644 --- a/solution/1700-1799/1702.Maximum Binary String After Change/README.md +++ b/solution/1700-1799/1702.Maximum Binary String After Change/README.md @@ -185,13 +185,13 @@ function maximumBinaryString(binary: string): string { impl Solution { pub fn maximum_binary_string(binary: String) -> String { if let Some(k) = binary.find('0') { - let k = - k + - binary[k + 1..] - .chars() - .filter(|&c| c == '0') - .count(); - return format!("{}{}{}", "1".repeat(k), "0", "1".repeat(binary.len() - k - 1)); + let k = k + binary[k + 1..].chars().filter(|&c| c == '0').count(); + return format!( + "{}{}{}", + "1".repeat(k), + "0", + "1".repeat(binary.len() - k - 1) + ); } binary } diff --git a/solution/1700-1799/1702.Maximum Binary String After Change/README_EN.md b/solution/1700-1799/1702.Maximum Binary String After Change/README_EN.md index 1517cfb7b0d03..6cdaf44e591ed 100644 --- a/solution/1700-1799/1702.Maximum Binary String After Change/README_EN.md +++ b/solution/1700-1799/1702.Maximum Binary String After Change/README_EN.md @@ -183,13 +183,13 @@ function maximumBinaryString(binary: string): string { impl Solution { pub fn maximum_binary_string(binary: String) -> String { if let Some(k) = binary.find('0') { - let k = - k + - binary[k + 1..] - .chars() - .filter(|&c| c == '0') - .count(); - return format!("{}{}{}", "1".repeat(k), "0", "1".repeat(binary.len() - k - 1)); + let k = k + binary[k + 1..].chars().filter(|&c| c == '0').count(); + return format!( + "{}{}{}", + "1".repeat(k), + "0", + "1".repeat(binary.len() - k - 1) + ); } binary } diff --git a/solution/1700-1799/1769.Minimum Number of Operations to Move All Balls to Each Box/README.md b/solution/1700-1799/1769.Minimum Number of Operations to Move All Balls to Each Box/README.md index 3a6ccc6fd98eb..ec15457c574c3 100644 --- a/solution/1700-1799/1769.Minimum Number of Operations to Move All Balls to Each Box/README.md +++ b/solution/1700-1799/1769.Minimum Number of Operations to Move All Balls to Each Box/README.md @@ -221,10 +221,7 @@ impl Solution { } right[i] = right[i + 1] + count; } - (0..n) - .into_iter() - .map(|i| left[i] + right[i]) - .collect() + (0..n).into_iter().map(|i| left[i] + right[i]).collect() } } ``` diff --git a/solution/1700-1799/1769.Minimum Number of Operations to Move All Balls to Each Box/README_EN.md b/solution/1700-1799/1769.Minimum Number of Operations to Move All Balls to Each Box/README_EN.md index fb4fd910dc98c..14a85c8c7cc8c 100644 --- a/solution/1700-1799/1769.Minimum Number of Operations to Move All Balls to Each Box/README_EN.md +++ b/solution/1700-1799/1769.Minimum Number of Operations to Move All Balls to Each Box/README_EN.md @@ -213,10 +213,7 @@ impl Solution { } right[i] = right[i + 1] + count; } - (0..n) - .into_iter() - .map(|i| left[i] + right[i]) - .collect() + (0..n).into_iter().map(|i| left[i] + right[i]).collect() } } ``` diff --git a/solution/1700-1799/1773.Count Items Matching a Rule/README.md b/solution/1700-1799/1773.Count Items Matching a Rule/README.md index fef382a11b62d..4ddb821ecd9d4 100644 --- a/solution/1700-1799/1773.Count Items Matching a Rule/README.md +++ b/solution/1700-1799/1773.Count Items Matching a Rule/README.md @@ -141,11 +141,14 @@ function countMatches(items: string[][], ruleKey: string, ruleValue: string): nu ```rust impl Solution { pub fn count_matches(items: Vec>, rule_key: String, rule_value: String) -> i32 { - let key = if rule_key == "type" { 0 } else if rule_key == "color" { 1 } else { 2 }; - items - .iter() - .filter(|v| v[key] == rule_value) - .count() as i32 + let key = if rule_key == "type" { + 0 + } else if rule_key == "color" { + 1 + } else { + 2 + }; + items.iter().filter(|v| v[key] == rule_value).count() as i32 } } ``` diff --git a/solution/1700-1799/1773.Count Items Matching a Rule/README_EN.md b/solution/1700-1799/1773.Count Items Matching a Rule/README_EN.md index abdaf339c0520..14a526db906f8 100644 --- a/solution/1700-1799/1773.Count Items Matching a Rule/README_EN.md +++ b/solution/1700-1799/1773.Count Items Matching a Rule/README_EN.md @@ -133,11 +133,14 @@ function countMatches(items: string[][], ruleKey: string, ruleValue: string): nu ```rust impl Solution { pub fn count_matches(items: Vec>, rule_key: String, rule_value: String) -> i32 { - let key = if rule_key == "type" { 0 } else if rule_key == "color" { 1 } else { 2 }; - items - .iter() - .filter(|v| v[key] == rule_value) - .count() as i32 + let key = if rule_key == "type" { + 0 + } else if rule_key == "color" { + 1 + } else { + 2 + }; + items.iter().filter(|v| v[key] == rule_value).count() as i32 } } ``` diff --git a/solution/1800-1899/1862.Sum of Floored Pairs/README.md b/solution/1800-1899/1862.Sum of Floored Pairs/README.md index 2ce2bb38bfa37..93341fdfa0b7a 100644 --- a/solution/1800-1899/1862.Sum of Floored Pairs/README.md +++ b/solution/1800-1899/1862.Sum of Floored Pairs/README.md @@ -235,11 +235,10 @@ impl Solution { if cnt[y] > 0 { let mut d = 1; while d * y <= (mx as usize) { - ans += - ((cnt[y] as i64) * - (d as i64) * - (s[std::cmp::min(mx as usize, d * y + y - 1)] - s[d * y - 1])) % - (MOD as i64); + ans += ((cnt[y] as i64) + * (d as i64) + * (s[std::cmp::min(mx as usize, d * y + y - 1)] - s[d * y - 1])) + % (MOD as i64); ans %= MOD as i64; d += 1; } diff --git a/solution/1800-1899/1862.Sum of Floored Pairs/README_EN.md b/solution/1800-1899/1862.Sum of Floored Pairs/README_EN.md index f417acf577ec2..f3cb6a401bb7d 100644 --- a/solution/1800-1899/1862.Sum of Floored Pairs/README_EN.md +++ b/solution/1800-1899/1862.Sum of Floored Pairs/README_EN.md @@ -235,11 +235,10 @@ impl Solution { if cnt[y] > 0 { let mut d = 1; while d * y <= (mx as usize) { - ans += - ((cnt[y] as i64) * - (d as i64) * - (s[std::cmp::min(mx as usize, d * y + y - 1)] - s[d * y - 1])) % - (MOD as i64); + ans += ((cnt[y] as i64) + * (d as i64) + * (s[std::cmp::min(mx as usize, d * y + y - 1)] - s[d * y - 1])) + % (MOD as i64); ans %= MOD as i64; d += 1; } diff --git a/solution/1800-1899/1894.Find the Student that Will Replace the Chalk/README.md b/solution/1800-1899/1894.Find the Student that Will Replace the Chalk/README.md index 03ee46d1b0f95..6f3b6008fa4c4 100644 --- a/solution/1800-1899/1894.Find the Student that Will Replace the Chalk/README.md +++ b/solution/1800-1899/1894.Find the Student that Will Replace the Chalk/README.md @@ -180,10 +180,7 @@ function chalkReplacer(chalk: number[], k: number): number { ```rust impl Solution { pub fn chalk_replacer(chalk: Vec, k: i32) -> i32 { - let mut s: i64 = chalk - .iter() - .map(|&x| x as i64) - .sum(); + let mut s: i64 = chalk.iter().map(|&x| x as i64).sum(); let mut k = (k as i64) % s; for (i, &x) in chalk.iter().enumerate() { if k < (x as i64) { diff --git a/solution/1800-1899/1894.Find the Student that Will Replace the Chalk/README_EN.md b/solution/1800-1899/1894.Find the Student that Will Replace the Chalk/README_EN.md index 2ac5a1c524349..56f3439def7e9 100644 --- a/solution/1800-1899/1894.Find the Student that Will Replace the Chalk/README_EN.md +++ b/solution/1800-1899/1894.Find the Student that Will Replace the Chalk/README_EN.md @@ -178,10 +178,7 @@ function chalkReplacer(chalk: number[], k: number): number { ```rust impl Solution { pub fn chalk_replacer(chalk: Vec, k: i32) -> i32 { - let mut s: i64 = chalk - .iter() - .map(|&x| x as i64) - .sum(); + let mut s: i64 = chalk.iter().map(|&x| x as i64).sum(); let mut k = (k as i64) % s; for (i, &x) in chalk.iter().enumerate() { if k < (x as i64) { diff --git a/solution/1900-1999/1920.Build Array from Permutation/README.md b/solution/1900-1999/1920.Build Array from Permutation/README.md index c9327e72df808..c03514ebd3f17 100644 --- a/solution/1900-1999/1920.Build Array from Permutation/README.md +++ b/solution/1900-1999/1920.Build Array from Permutation/README.md @@ -131,9 +131,7 @@ function buildArray(nums: number[]): number[] { ```rust impl Solution { pub fn build_array(nums: Vec) -> Vec { - nums.iter() - .map(|&v| nums[v as usize]) - .collect() + nums.iter().map(|&v| nums[v as usize]).collect() } } ``` diff --git a/solution/1900-1999/1920.Build Array from Permutation/README_EN.md b/solution/1900-1999/1920.Build Array from Permutation/README_EN.md index a755d7426fa6e..3b6b4d9a9f510 100644 --- a/solution/1900-1999/1920.Build Array from Permutation/README_EN.md +++ b/solution/1900-1999/1920.Build Array from Permutation/README_EN.md @@ -128,9 +128,7 @@ function buildArray(nums: number[]): number[] { ```rust impl Solution { pub fn build_array(nums: Vec) -> Vec { - nums.iter() - .map(|&v| nums[v as usize]) - .collect() + nums.iter().map(|&v| nums[v as usize]).collect() } } ``` diff --git a/solution/1900-1999/1971.Find if Path Exists in Graph/README.md b/solution/1900-1999/1971.Find if Path Exists in Graph/README.md index 09af4c3bf6d24..f6e85b3808683 100644 --- a/solution/1900-1999/1971.Find if Path Exists in Graph/README.md +++ b/solution/1900-1999/1971.Find if Path Exists in Graph/README.md @@ -430,7 +430,7 @@ function validPath(n: number, edges: number[][], source: number, destination: nu #### Rust ```rust -use std::collections::{ HashSet, VecDeque }; +use std::collections::{HashSet, VecDeque}; impl Solution { pub fn valid_path(n: i32, edges: Vec>, source: i32, destination: i32) -> bool { diff --git a/solution/1900-1999/1971.Find if Path Exists in Graph/README_EN.md b/solution/1900-1999/1971.Find if Path Exists in Graph/README_EN.md index fb5b8c6579f28..7c77c68d6fb4a 100644 --- a/solution/1900-1999/1971.Find if Path Exists in Graph/README_EN.md +++ b/solution/1900-1999/1971.Find if Path Exists in Graph/README_EN.md @@ -428,7 +428,7 @@ function validPath(n: number, edges: number[][], source: number, destination: nu #### Rust ```rust -use std::collections::{ HashSet, VecDeque }; +use std::collections::{HashSet, VecDeque}; impl Solution { pub fn valid_path(n: i32, edges: Vec>, source: i32, destination: i32) -> bool { diff --git a/solution/2000-2099/2003.Smallest Missing Genetic Value in Each Subtree/README.md b/solution/2000-2099/2003.Smallest Missing Genetic Value in Each Subtree/README.md index 19ae9cb4646b8..5f571e1e4253c 100644 --- a/solution/2000-2099/2003.Smallest Missing Genetic Value in Each Subtree/README.md +++ b/solution/2000-2099/2003.Smallest Missing Genetic Value in Each Subtree/README.md @@ -347,7 +347,7 @@ impl Solution { vis: &mut Vec, has: &mut Vec, g: &Vec>, - nums: &Vec + nums: &Vec, ) { if vis[i] { return; diff --git a/solution/2000-2099/2003.Smallest Missing Genetic Value in Each Subtree/README_EN.md b/solution/2000-2099/2003.Smallest Missing Genetic Value in Each Subtree/README_EN.md index 01e382e688604..abcbd20f413b1 100644 --- a/solution/2000-2099/2003.Smallest Missing Genetic Value in Each Subtree/README_EN.md +++ b/solution/2000-2099/2003.Smallest Missing Genetic Value in Each Subtree/README_EN.md @@ -344,7 +344,7 @@ impl Solution { vis: &mut Vec, has: &mut Vec, g: &Vec>, - nums: &Vec + nums: &Vec, ) { if vis[i] { return; diff --git a/solution/2000-2099/2032.Two Out of Three/README.md b/solution/2000-2099/2032.Two Out of Three/README.md index 87364dda70f89..c3f8f5effee7d 100644 --- a/solution/2000-2099/2032.Two Out of Three/README.md +++ b/solution/2000-2099/2032.Two Out of Three/README.md @@ -202,14 +202,11 @@ impl Solution { count[v as usize] += 1; }); let mut ans = Vec::new(); - count - .iter() - .enumerate() - .for_each(|(i, v)| { - if *v >= 2 { - ans.push(i as i32); - } - }); + count.iter().enumerate().for_each(|(i, v)| { + if *v >= 2 { + ans.push(i as i32); + } + }); ans } } diff --git a/solution/2000-2099/2032.Two Out of Three/README_EN.md b/solution/2000-2099/2032.Two Out of Three/README_EN.md index 3addc3751bfdf..7efb0c8eb24e8 100644 --- a/solution/2000-2099/2032.Two Out of Three/README_EN.md +++ b/solution/2000-2099/2032.Two Out of Three/README_EN.md @@ -200,14 +200,11 @@ impl Solution { count[v as usize] += 1; }); let mut ans = Vec::new(); - count - .iter() - .enumerate() - .for_each(|(i, v)| { - if *v >= 2 { - ans.push(i as i32); - } - }); + count.iter().enumerate().for_each(|(i, v)| { + if *v >= 2 { + ans.push(i as i32); + } + }); ans } } diff --git a/solution/2100-2199/2103.Rings and Rods/README.md b/solution/2100-2199/2103.Rings and Rods/README.md index d3b05845655ac..a70c0cf34f93f 100644 --- a/solution/2100-2199/2103.Rings and Rods/README.md +++ b/solution/2100-2199/2103.Rings and Rods/README.md @@ -212,10 +212,7 @@ impl Solution { mask[j] |= d[c]; } - mask - .iter() - .filter(|&&x| x == 7) - .count() as i32 + mask.iter().filter(|&&x| x == 7).count() as i32 } } ``` diff --git a/solution/2100-2199/2103.Rings and Rods/README_EN.md b/solution/2100-2199/2103.Rings and Rods/README_EN.md index 0717bc4c864b4..b63accdc0d920 100644 --- a/solution/2100-2199/2103.Rings and Rods/README_EN.md +++ b/solution/2100-2199/2103.Rings and Rods/README_EN.md @@ -210,10 +210,7 @@ impl Solution { mask[j] |= d[c]; } - mask - .iter() - .filter(|&&x| x == 7) - .count() as i32 + mask.iter().filter(|&&x| x == 7).count() as i32 } } ``` diff --git a/solution/2100-2199/2125.Number of Laser Beams in a Bank/README.md b/solution/2100-2199/2125.Number of Laser Beams in a Bank/README.md index c5edf129f898f..b5af24b159e88 100644 --- a/solution/2100-2199/2125.Number of Laser Beams in a Bank/README.md +++ b/solution/2100-2199/2125.Number of Laser Beams in a Bank/README.md @@ -183,10 +183,7 @@ impl Solution { let mut ans = 0; let mut pre = 0; for row in bank { - let cur = row - .chars() - .filter(|&c| c == '1') - .count() as i32; + let cur = row.chars().filter(|&c| c == '1').count() as i32; if cur > 0 { ans += pre * cur; pre = cur; diff --git a/solution/2100-2199/2125.Number of Laser Beams in a Bank/README_EN.md b/solution/2100-2199/2125.Number of Laser Beams in a Bank/README_EN.md index 82f880a45b39b..f29ec93dfdcd0 100644 --- a/solution/2100-2199/2125.Number of Laser Beams in a Bank/README_EN.md +++ b/solution/2100-2199/2125.Number of Laser Beams in a Bank/README_EN.md @@ -177,10 +177,7 @@ impl Solution { let mut ans = 0; let mut pre = 0; for row in bank { - let cur = row - .chars() - .filter(|&c| c == '1') - .count() as i32; + let cur = row.chars().filter(|&c| c == '1').count() as i32; if cur > 0 { ans += pre * cur; pre = cur; diff --git a/solution/2100-2199/2132.Stamping the Grid/README.md b/solution/2100-2199/2132.Stamping the Grid/README.md index de2b0401b5173..326aef9a29c5d 100644 --- a/solution/2100-2199/2132.Stamping the Grid/README.md +++ b/solution/2100-2199/2132.Stamping the Grid/README.md @@ -319,9 +319,8 @@ impl Solution { // Check the bound if x <= n && y <= m { // If the region can be sticked (All cells are empty, which means the sum will be zero) - if - prefix_vec[x][y] - prefix_vec[x][j] - prefix_vec[i][y] + prefix_vec[i][j] == - 0 + if prefix_vec[x][y] - prefix_vec[x][j] - prefix_vec[i][y] + prefix_vec[i][j] + == 0 { // Update the difference vector diff_vec[i][j] += 1; diff --git a/solution/2100-2199/2132.Stamping the Grid/README_EN.md b/solution/2100-2199/2132.Stamping the Grid/README_EN.md index ecc4c0e5b3c92..c1e797504d862 100644 --- a/solution/2100-2199/2132.Stamping the Grid/README_EN.md +++ b/solution/2100-2199/2132.Stamping the Grid/README_EN.md @@ -315,9 +315,8 @@ impl Solution { // Check the bound if x <= n && y <= m { // If the region can be sticked (All cells are empty, which means the sum will be zero) - if - prefix_vec[x][y] - prefix_vec[x][j] - prefix_vec[i][y] + prefix_vec[i][j] == - 0 + if prefix_vec[x][y] - prefix_vec[x][j] - prefix_vec[i][y] + prefix_vec[i][j] + == 0 { // Update the difference vector diff_vec[i][j] += 1; diff --git a/solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/README.md b/solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/README.md index 4a57b5acc1c90..bec56c71c5d9c 100644 --- a/solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/README.md +++ b/solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/README.md @@ -188,9 +188,8 @@ impl Solution { } let mut mx: i32 = cnt; for i in k..(n as i32) + k { - cnt += - nums[(i % (n as i32)) as usize] - - nums[((i - k + (n as i32)) % (n as i32)) as usize]; + cnt += nums[(i % (n as i32)) as usize] + - nums[((i - k + (n as i32)) % (n as i32)) as usize]; mx = mx.max(cnt); } return k - mx; diff --git a/solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/README_EN.md b/solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/README_EN.md index 2663f18f1b6b0..fa654171b5a71 100644 --- a/solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/README_EN.md +++ b/solution/2100-2199/2134.Minimum Swaps to Group All 1's Together II/README_EN.md @@ -190,9 +190,8 @@ impl Solution { } let mut mx: i32 = cnt; for i in k..(n as i32) + k { - cnt += - nums[(i % (n as i32)) as usize] - - nums[((i - k + (n as i32)) % (n as i32)) as usize]; + cnt += nums[(i % (n as i32)) as usize] + - nums[((i - k + (n as i32)) % (n as i32)) as usize]; mx = mx.max(cnt); } return k - mx; diff --git a/solution/2100-2199/2141.Maximum Running Time of N Computers/README.md b/solution/2100-2199/2141.Maximum Running Time of N Computers/README.md index 2c225e80ef2d0..84ddddc7e8989 100644 --- a/solution/2100-2199/2141.Maximum Running Time of N Computers/README.md +++ b/solution/2100-2199/2141.Maximum Running Time of N Computers/README.md @@ -239,9 +239,8 @@ impl Solution { ret = (cur_height as i64) + diff; break; } else { - extra_sum -= - ((batteries[i + 1] - batteries[i]) as i64) * - ((i - ((m - n) as usize) + 1) as i64); + extra_sum -= ((batteries[i + 1] - batteries[i]) as i64) + * ((i - ((m - n) as usize) + 1) as i64); ret = batteries[i + 1] as i64; } diff --git a/solution/2100-2199/2141.Maximum Running Time of N Computers/README_EN.md b/solution/2100-2199/2141.Maximum Running Time of N Computers/README_EN.md index d827d9a49b03c..933ad30b85b94 100644 --- a/solution/2100-2199/2141.Maximum Running Time of N Computers/README_EN.md +++ b/solution/2100-2199/2141.Maximum Running Time of N Computers/README_EN.md @@ -228,9 +228,8 @@ impl Solution { ret = (cur_height as i64) + diff; break; } else { - extra_sum -= - ((batteries[i + 1] - batteries[i]) as i64) * - ((i - ((m - n) as usize) + 1) as i64); + extra_sum -= ((batteries[i + 1] - batteries[i]) as i64) + * ((i - ((m - n) as usize) + 1) as i64); ret = batteries[i + 1] as i64; } diff --git a/solution/2100-2199/2185.Counting Words With a Given Prefix/README.md b/solution/2100-2199/2185.Counting Words With a Given Prefix/README.md index 50aa54a53ee4f..0f3bc97d27de8 100644 --- a/solution/2100-2199/2185.Counting Words With a Given Prefix/README.md +++ b/solution/2100-2199/2185.Counting Words With a Given Prefix/README.md @@ -129,10 +129,7 @@ function prefixCount(words: string[], pref: string): number { ```rust impl Solution { pub fn prefix_count(words: Vec, pref: String) -> i32 { - words - .iter() - .filter(|s| s.starts_with(&pref)) - .count() as i32 + words.iter().filter(|s| s.starts_with(&pref)).count() as i32 } } ``` diff --git a/solution/2100-2199/2185.Counting Words With a Given Prefix/README_EN.md b/solution/2100-2199/2185.Counting Words With a Given Prefix/README_EN.md index ceebea5554929..682f3016c9c5f 100644 --- a/solution/2100-2199/2185.Counting Words With a Given Prefix/README_EN.md +++ b/solution/2100-2199/2185.Counting Words With a Given Prefix/README_EN.md @@ -125,10 +125,7 @@ function prefixCount(words: string[], pref: string): number { ```rust impl Solution { pub fn prefix_count(words: Vec, pref: String) -> i32 { - words - .iter() - .filter(|s| s.starts_with(&pref)) - .count() as i32 + words.iter().filter(|s| s.starts_with(&pref)).count() as i32 } } ``` diff --git a/solution/2100-2199/2196.Create Binary Tree From Descriptions/README.md b/solution/2100-2199/2196.Create Binary Tree From Descriptions/README.md index fe5388c1e0233..16cddcc4ce3fa 100644 --- a/solution/2100-2199/2196.Create Binary Tree From Descriptions/README.md +++ b/solution/2100-2199/2196.Create Binary Tree From Descriptions/README.md @@ -298,9 +298,9 @@ function createBinaryTree(descriptions: number[][]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { fn dfs(val: i32, map: &HashMap) -> Option>> { if val == 0 { diff --git a/solution/2100-2199/2196.Create Binary Tree From Descriptions/README_EN.md b/solution/2100-2199/2196.Create Binary Tree From Descriptions/README_EN.md index 1ed1385d040a3..375aa87e0889b 100644 --- a/solution/2100-2199/2196.Create Binary Tree From Descriptions/README_EN.md +++ b/solution/2100-2199/2196.Create Binary Tree From Descriptions/README_EN.md @@ -293,9 +293,9 @@ function createBinaryTree(descriptions: number[][]): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::HashMap; +use std::rc::Rc; impl Solution { fn dfs(val: i32, map: &HashMap) -> Option>> { if val == 0 { diff --git a/solution/2200-2299/2212.Maximum Points in an Archery Competition/README.md b/solution/2200-2299/2212.Maximum Points in an Archery Competition/README.md index 1289804aba490..60123919b642d 100644 --- a/solution/2200-2299/2212.Maximum Points in an Archery Competition/README.md +++ b/solution/2200-2299/2212.Maximum Points in an Archery Competition/README.md @@ -259,14 +259,12 @@ impl Solution { if count > alice_arrows[i] { res[i] = alice_arrows[i] + 1; let r2 = Self::dfs(alice_arrows, res, count - alice_arrows[i] - 1, i - 1); - if - r2 - .iter() - .enumerate() - .map(|(i, v)| if v > &0 { i } else { 0 }) - .sum::() > - r1 - .iter() + if r2 + .iter() + .enumerate() + .map(|(i, v)| if v > &0 { i } else { 0 }) + .sum::() + > r1.iter() .enumerate() .map(|(i, v)| if v > &0 { i } else { 0 }) .sum::() diff --git a/solution/2200-2299/2212.Maximum Points in an Archery Competition/README_EN.md b/solution/2200-2299/2212.Maximum Points in an Archery Competition/README_EN.md index c6ef77c7979f7..e956458b8fdd8 100644 --- a/solution/2200-2299/2212.Maximum Points in an Archery Competition/README_EN.md +++ b/solution/2200-2299/2212.Maximum Points in an Archery Competition/README_EN.md @@ -251,14 +251,12 @@ impl Solution { if count > alice_arrows[i] { res[i] = alice_arrows[i] + 1; let r2 = Self::dfs(alice_arrows, res, count - alice_arrows[i] - 1, i - 1); - if - r2 - .iter() - .enumerate() - .map(|(i, v)| if v > &0 { i } else { 0 }) - .sum::() > - r1 - .iter() + if r2 + .iter() + .enumerate() + .map(|(i, v)| if v > &0 { i } else { 0 }) + .sum::() + > r1.iter() .enumerate() .map(|(i, v)| if v > &0 { i } else { 0 }) .sum::() diff --git a/solution/2200-2299/2215.Find the Difference of Two Arrays/README.md b/solution/2200-2299/2215.Find the Difference of Two Arrays/README.md index 14c3d5d8ff90d..71d732d00ad20 100644 --- a/solution/2200-2299/2215.Find the Difference of Two Arrays/README.md +++ b/solution/2200-2299/2215.Find the Difference of Two Arrays/README.md @@ -193,7 +193,7 @@ impl Solution { .filter_map(|&v| if nums1.contains(&v) { None } else { Some(v) }) .collect::>() .into_iter() - .collect() + .collect(), ] } } diff --git a/solution/2200-2299/2215.Find the Difference of Two Arrays/README_EN.md b/solution/2200-2299/2215.Find the Difference of Two Arrays/README_EN.md index 458ea5b8fef56..e86a18a1e14d4 100644 --- a/solution/2200-2299/2215.Find the Difference of Two Arrays/README_EN.md +++ b/solution/2200-2299/2215.Find the Difference of Two Arrays/README_EN.md @@ -191,7 +191,7 @@ impl Solution { .filter_map(|&v| if nums1.contains(&v) { None } else { Some(v) }) .collect::>() .into_iter() - .collect() + .collect(), ] } } diff --git a/solution/2200-2299/2217.Find Palindrome With Fixed Length/README.md b/solution/2200-2299/2217.Find Palindrome With Fixed Length/README.md index 851bbc91a6085..453233a4b87ec 100644 --- a/solution/2200-2299/2217.Find Palindrome With Fixed Length/README.md +++ b/solution/2200-2299/2217.Find Palindrome With Fixed Length/README.md @@ -205,15 +205,14 @@ impl Solution { format!( "{}{}", num, - num - .to_string() + num.to_string() .chars() .rev() .skip(if is_odd { 1 } else { 0 }) .collect::() ) - .parse() - .unwrap() + .parse() + .unwrap() }) .collect() } diff --git a/solution/2200-2299/2217.Find Palindrome With Fixed Length/README_EN.md b/solution/2200-2299/2217.Find Palindrome With Fixed Length/README_EN.md index ee98f5a69e744..9a1ad77b3cb92 100644 --- a/solution/2200-2299/2217.Find Palindrome With Fixed Length/README_EN.md +++ b/solution/2200-2299/2217.Find Palindrome With Fixed Length/README_EN.md @@ -203,15 +203,14 @@ impl Solution { format!( "{}{}", num, - num - .to_string() + num.to_string() .chars() .rev() .skip(if is_odd { 1 } else { 0 }) .collect::() ) - .parse() - .unwrap() + .parse() + .unwrap() }) .collect() } diff --git a/solution/2200-2299/2236.Root Equals Sum of Children/README.md b/solution/2200-2299/2236.Root Equals Sum of Children/README.md index be9b82f8ae1b2..66fafac88dabe 100644 --- a/solution/2200-2299/2236.Root Equals Sum of Children/README.md +++ b/solution/2200-2299/2236.Root Equals Sum of Children/README.md @@ -184,8 +184,8 @@ function checkTree(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn check_tree(root: Option>>) -> bool { let node = root.as_ref().unwrap().borrow(); diff --git a/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md b/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md index ad9c083f61929..755a810a99151 100644 --- a/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md +++ b/solution/2200-2299/2236.Root Equals Sum of Children/README_EN.md @@ -178,8 +178,8 @@ function checkTree(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { pub fn check_tree(root: Option>>) -> bool { let node = root.as_ref().unwrap().borrow(); diff --git a/solution/2200-2299/2251.Number of Flowers in Full Bloom/README.md b/solution/2200-2299/2251.Number of Flowers in Full Bloom/README.md index bd66845ec4a92..e1e903ce0ea3d 100644 --- a/solution/2200-2299/2251.Number of Flowers in Full Bloom/README.md +++ b/solution/2200-2299/2251.Number of Flowers in Full Bloom/README.md @@ -221,13 +221,9 @@ impl Solution { let n = people.len(); // First sort the people vector based on the first item - let mut people: Vec<(usize, i32)> = people - .into_iter() - .enumerate() - .map(|x| x) - .collect(); + let mut people: Vec<(usize, i32)> = people.into_iter().enumerate().map(|x| x).collect(); - people.sort_by(|lhs, rhs| { lhs.1.cmp(&rhs.1) }); + people.sort_by(|lhs, rhs| lhs.1.cmp(&rhs.1)); // Initialize the difference vector let mut diff = BTreeMap::new(); diff --git a/solution/2200-2299/2251.Number of Flowers in Full Bloom/README_EN.md b/solution/2200-2299/2251.Number of Flowers in Full Bloom/README_EN.md index 2fceb1bcc9ed8..21331834fae49 100644 --- a/solution/2200-2299/2251.Number of Flowers in Full Bloom/README_EN.md +++ b/solution/2200-2299/2251.Number of Flowers in Full Bloom/README_EN.md @@ -211,13 +211,9 @@ impl Solution { let n = people.len(); // First sort the people vector based on the first item - let mut people: Vec<(usize, i32)> = people - .into_iter() - .enumerate() - .map(|x| x) - .collect(); + let mut people: Vec<(usize, i32)> = people.into_iter().enumerate().map(|x| x).collect(); - people.sort_by(|lhs, rhs| { lhs.1.cmp(&rhs.1) }); + people.sort_by(|lhs, rhs| lhs.1.cmp(&rhs.1)); // Initialize the difference vector let mut diff = BTreeMap::new(); diff --git a/solution/2200-2299/2293.Min Max Game/README.md b/solution/2200-2299/2293.Min Max Game/README.md index 3f33f38faa9b6..4f7e26fcfc8f0 100644 --- a/solution/2200-2299/2293.Min Max Game/README.md +++ b/solution/2200-2299/2293.Min Max Game/README.md @@ -176,7 +176,7 @@ impl Solution { for i in 0..n { nums[i] = (if (i & 1) == 1 { i32::max } else { i32::min })( nums[i << 1], - nums[(i << 1) | 1] + nums[(i << 1) | 1], ); } } diff --git a/solution/2200-2299/2293.Min Max Game/README_EN.md b/solution/2200-2299/2293.Min Max Game/README_EN.md index 028546c274575..4591bb10b2c62 100644 --- a/solution/2200-2299/2293.Min Max Game/README_EN.md +++ b/solution/2200-2299/2293.Min Max Game/README_EN.md @@ -168,7 +168,7 @@ impl Solution { for i in 0..n { nums[i] = (if (i & 1) == 1 { i32::max } else { i32::min })( nums[i << 1], - nums[(i << 1) | 1] + nums[(i << 1) | 1], ); } } diff --git a/solution/2300-2399/2331.Evaluate Boolean Binary Tree/README.md b/solution/2300-2399/2331.Evaluate Boolean Binary Tree/README.md index d1c7aa221bbe5..4818d704fc161 100644 --- a/solution/2300-2399/2331.Evaluate Boolean Binary Tree/README.md +++ b/solution/2300-2399/2331.Evaluate Boolean Binary Tree/README.md @@ -255,8 +255,8 @@ function evaluateTree(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>) -> bool { let root = root.as_ref().unwrap().as_ref().borrow(); diff --git a/solution/2300-2399/2331.Evaluate Boolean Binary Tree/README_EN.md b/solution/2300-2399/2331.Evaluate Boolean Binary Tree/README_EN.md index 94a94a6b39fa5..41d313561cf0d 100644 --- a/solution/2300-2399/2331.Evaluate Boolean Binary Tree/README_EN.md +++ b/solution/2300-2399/2331.Evaluate Boolean Binary Tree/README_EN.md @@ -242,8 +242,8 @@ function evaluateTree(root: TreeNode | null): boolean { // } // } // } -use std::rc::Rc; use std::cell::RefCell; +use std::rc::Rc; impl Solution { fn dfs(root: &Option>>) -> bool { let root = root.as_ref().unwrap().as_ref().borrow(); diff --git a/solution/2300-2399/2383.Minimum Hours of Training to Win a Competition/README.md b/solution/2300-2399/2383.Minimum Hours of Training to Win a Competition/README.md index a335d1de4d8d8..57ebdbaa99273 100644 --- a/solution/2300-2399/2383.Minimum Hours of Training to Win a Competition/README.md +++ b/solution/2300-2399/2383.Minimum Hours of Training to Win a Competition/README.md @@ -219,7 +219,7 @@ impl Solution { mut initial_energy: i32, mut initial_experience: i32, energy: Vec, - experience: Vec + experience: Vec, ) -> i32 { let n = energy.len(); let mut res = 0; diff --git a/solution/2300-2399/2383.Minimum Hours of Training to Win a Competition/README_EN.md b/solution/2300-2399/2383.Minimum Hours of Training to Win a Competition/README_EN.md index 576d6682f1ab8..fb0b2c4aa04f8 100644 --- a/solution/2300-2399/2383.Minimum Hours of Training to Win a Competition/README_EN.md +++ b/solution/2300-2399/2383.Minimum Hours of Training to Win a Competition/README_EN.md @@ -213,7 +213,7 @@ impl Solution { mut initial_energy: i32, mut initial_experience: i32, energy: Vec, - experience: Vec + experience: Vec, ) -> i32 { let n = energy.len(); let mut res = 0; diff --git a/solution/2400-2499/2415.Reverse Odd Levels of Binary Tree/README.md b/solution/2400-2499/2415.Reverse Odd Levels of Binary Tree/README.md index 4062864f77b3d..97c3dd3d6e9f7 100644 --- a/solution/2400-2499/2415.Reverse Odd Levels of Binary Tree/README.md +++ b/solution/2400-2499/2415.Reverse Odd Levels of Binary Tree/README.md @@ -294,27 +294,23 @@ function reverseOddLevels(root: TreeNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { fn create_tree(vals: &Vec>, i: usize, j: usize) -> Option>> { if i == vals.len() { return None; } - Some( - Rc::new( - RefCell::new(TreeNode { - val: vals[i][j], - left: Self::create_tree(vals, i + 1, j * 2), - right: Self::create_tree(vals, i + 1, j * 2 + 1), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: vals[i][j], + left: Self::create_tree(vals, i + 1, j * 2), + right: Self::create_tree(vals, i + 1, j * 2 + 1), + }))) } pub fn reverse_odd_levels( - root: Option>> + root: Option>>, ) -> Option>> { let mut queue = VecDeque::new(); queue.push_back(root); diff --git a/solution/2400-2499/2415.Reverse Odd Levels of Binary Tree/README_EN.md b/solution/2400-2499/2415.Reverse Odd Levels of Binary Tree/README_EN.md index cc33e4d58b1b9..b1e6a6dcc6241 100644 --- a/solution/2400-2499/2415.Reverse Odd Levels of Binary Tree/README_EN.md +++ b/solution/2400-2499/2415.Reverse Odd Levels of Binary Tree/README_EN.md @@ -293,27 +293,23 @@ function reverseOddLevels(root: TreeNode | null): TreeNode | null { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { fn create_tree(vals: &Vec>, i: usize, j: usize) -> Option>> { if i == vals.len() { return None; } - Some( - Rc::new( - RefCell::new(TreeNode { - val: vals[i][j], - left: Self::create_tree(vals, i + 1, j * 2), - right: Self::create_tree(vals, i + 1, j * 2 + 1), - }) - ) - ) + Some(Rc::new(RefCell::new(TreeNode { + val: vals[i][j], + left: Self::create_tree(vals, i + 1, j * 2), + right: Self::create_tree(vals, i + 1, j * 2 + 1), + }))) } pub fn reverse_odd_levels( - root: Option>> + root: Option>>, ) -> Option>> { let mut queue = VecDeque::new(); queue.push_back(root); diff --git a/solution/2400-2499/2418.Sort the People/README.md b/solution/2400-2499/2418.Sort the People/README.md index 4a7c2508fcbcf..a3d891e926c45 100644 --- a/solution/2400-2499/2418.Sort the People/README.md +++ b/solution/2400-2499/2418.Sort the People/README.md @@ -163,10 +163,7 @@ impl Solution { pub fn sort_people(names: Vec, heights: Vec) -> Vec { let mut combine: Vec<(String, i32)> = names.into_iter().zip(heights.into_iter()).collect(); combine.sort_by(|a, b| b.1.cmp(&a.1)); - combine - .iter() - .map(|s| s.0.clone()) - .collect() + combine.iter().map(|s| s.0.clone()).collect() } } ``` diff --git a/solution/2400-2499/2418.Sort the People/README_EN.md b/solution/2400-2499/2418.Sort the People/README_EN.md index 304babee3613a..d4fc8bc793f5a 100644 --- a/solution/2400-2499/2418.Sort the People/README_EN.md +++ b/solution/2400-2499/2418.Sort the People/README_EN.md @@ -163,10 +163,7 @@ impl Solution { pub fn sort_people(names: Vec, heights: Vec) -> Vec { let mut combine: Vec<(String, i32)> = names.into_iter().zip(heights.into_iter()).collect(); combine.sort_by(|a, b| b.1.cmp(&a.1)); - combine - .iter() - .map(|s| s.0.clone()) - .collect() + combine.iter().map(|s| s.0.clone()).collect() } } ``` diff --git a/solution/2400-2499/2443.Sum of Number and Its Reverse/README.md b/solution/2400-2499/2443.Sum of Number and Its Reverse/README.md index fa68199348d9d..8129967a12e73 100644 --- a/solution/2400-2499/2443.Sum of Number and Its Reverse/README.md +++ b/solution/2400-2499/2443.Sum of Number and Its Reverse/README.md @@ -159,17 +159,15 @@ function sumOfNumberAndReverse(num: number): boolean { impl Solution { pub fn sum_of_number_and_reverse(num: i32) -> bool { for i in 0..=num { - if - i + - ({ - let mut t = i; - let mut j = 0; - while t > 0 { - j = j * 10 + (t % 10); - t /= 10; - } - j - }) == num + if i + ({ + let mut t = i; + let mut j = 0; + while t > 0 { + j = j * 10 + (t % 10); + t /= 10; + } + j + }) == num { return true; } diff --git a/solution/2400-2499/2443.Sum of Number and Its Reverse/README_EN.md b/solution/2400-2499/2443.Sum of Number and Its Reverse/README_EN.md index cd4d9adaa9284..a6f50856070be 100644 --- a/solution/2400-2499/2443.Sum of Number and Its Reverse/README_EN.md +++ b/solution/2400-2499/2443.Sum of Number and Its Reverse/README_EN.md @@ -155,17 +155,15 @@ function sumOfNumberAndReverse(num: number): boolean { impl Solution { pub fn sum_of_number_and_reverse(num: i32) -> bool { for i in 0..=num { - if - i + - ({ - let mut t = i; - let mut j = 0; - while t > 0 { - j = j * 10 + (t % 10); - t /= 10; - } - j - }) == num + if i + ({ + let mut t = i; + let mut j = 0; + while t > 0 { + j = j * 10 + (t % 10); + t /= 10; + } + j + }) == num { return true; } diff --git a/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README.md b/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README.md index 78b0cf35fd98b..1fafb50ddad53 100644 --- a/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README.md +++ b/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README.md @@ -218,7 +218,7 @@ impl Solution { let mut zip_vec: Vec<_> = nums.into_iter().zip(cost.into_iter()).collect(); // Sort the zip vector based on nums - zip_vec.sort_by(|lhs, rhs| { lhs.0.cmp(&rhs.0) }); + zip_vec.sort_by(|lhs, rhs| lhs.0.cmp(&rhs.0)); let (nums, cost): (Vec, Vec) = zip_vec.into_iter().unzip(); diff --git a/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README_EN.md b/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README_EN.md index 83411a63ed933..790b6750565ad 100644 --- a/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README_EN.md +++ b/solution/2400-2499/2448.Minimum Cost to Make Array Equal/README_EN.md @@ -216,7 +216,7 @@ impl Solution { let mut zip_vec: Vec<_> = nums.into_iter().zip(cost.into_iter()).collect(); // Sort the zip vector based on nums - zip_vec.sort_by(|lhs, rhs| { lhs.0.cmp(&rhs.0) }); + zip_vec.sort_by(|lhs, rhs| lhs.0.cmp(&rhs.0)); let (nums, cost): (Vec, Vec) = zip_vec.into_iter().unzip(); diff --git a/solution/2400-2499/2451.Odd String Difference/README.md b/solution/2400-2499/2451.Odd String Difference/README.md index f0cd98f872e72..7fd70441f7dd1 100644 --- a/solution/2400-2499/2451.Odd String Difference/README.md +++ b/solution/2400-2499/2451.Odd String Difference/README.md @@ -243,14 +243,9 @@ impl Solution { .map(|(current, next)| (next - current) as i32) .collect(); - let s: String = bytes - .iter() - .map(|&b| char::from(b as u8)) - .collect(); + let s: String = bytes.iter().map(|&b| char::from(b as u8)).collect(); - h.entry(s) - .or_insert(vec![]) - .push(w); + h.entry(s).or_insert(vec![]).push(w); } for strs in h.values() { diff --git a/solution/2400-2499/2451.Odd String Difference/README_EN.md b/solution/2400-2499/2451.Odd String Difference/README_EN.md index 3ef807f7ba30f..b5d32bd5ad1fa 100644 --- a/solution/2400-2499/2451.Odd String Difference/README_EN.md +++ b/solution/2400-2499/2451.Odd String Difference/README_EN.md @@ -241,14 +241,9 @@ impl Solution { .map(|(current, next)| (next - current) as i32) .collect(); - let s: String = bytes - .iter() - .map(|&b| char::from(b as u8)) - .collect(); + let s: String = bytes.iter().map(|&b| char::from(b as u8)).collect(); - h.entry(s) - .or_insert(vec![]) - .push(w); + h.entry(s).or_insert(vec![]).push(w); } for strs in h.values() { diff --git a/solution/2400-2499/2452.Words Within Two Edits of Dictionary/README.md b/solution/2400-2499/2452.Words Within Two Edits of Dictionary/README.md index 3cc3665d5f4e6..445c9a76d3b36 100644 --- a/solution/2400-2499/2452.Words Within Two Edits of Dictionary/README.md +++ b/solution/2400-2499/2452.Words Within Two Edits of Dictionary/README.md @@ -189,13 +189,9 @@ impl Solution { queries .into_iter() .filter(|s| { - dictionary.iter().any(|t| { - s - .chars() - .zip(t.chars()) - .filter(|&(a, b)| a != b) - .count() < 3 - }) + dictionary + .iter() + .any(|t| s.chars().zip(t.chars()).filter(|&(a, b)| a != b).count() < 3) }) .collect() } diff --git a/solution/2400-2499/2452.Words Within Two Edits of Dictionary/README_EN.md b/solution/2400-2499/2452.Words Within Two Edits of Dictionary/README_EN.md index deef5fc710905..7d08b933b83d0 100644 --- a/solution/2400-2499/2452.Words Within Two Edits of Dictionary/README_EN.md +++ b/solution/2400-2499/2452.Words Within Two Edits of Dictionary/README_EN.md @@ -188,13 +188,9 @@ impl Solution { queries .into_iter() .filter(|s| { - dictionary.iter().any(|t| { - s - .chars() - .zip(t.chars()) - .filter(|&(a, b)| a != b) - .count() < 3 - }) + dictionary + .iter() + .any(|t| s.chars().zip(t.chars()).filter(|&(a, b)| a != b).count() < 3) }) .collect() } diff --git a/solution/2400-2499/2455.Average Value of Even Numbers That Are Divisible by Three/README.md b/solution/2400-2499/2455.Average Value of Even Numbers That Are Divisible by Three/README.md index c4e4df207aef1..008d59ca4f4f9 100644 --- a/solution/2400-2499/2455.Average Value of Even Numbers That Are Divisible by Three/README.md +++ b/solution/2400-2499/2455.Average Value of Even Numbers That Are Divisible by Three/README.md @@ -197,11 +197,7 @@ int averageValue(int* nums, int numsSize) { ```rust impl Solution { pub fn average_value(nums: Vec) -> i32 { - let filtered_nums: Vec = nums - .iter() - .cloned() - .filter(|&n| n % 6 == 0) - .collect(); + let filtered_nums: Vec = nums.iter().cloned().filter(|&n| n % 6 == 0).collect(); if filtered_nums.is_empty() { return 0; diff --git a/solution/2400-2499/2455.Average Value of Even Numbers That Are Divisible by Three/README_EN.md b/solution/2400-2499/2455.Average Value of Even Numbers That Are Divisible by Three/README_EN.md index e29ad2cc572e3..8ecc5816c215a 100644 --- a/solution/2400-2499/2455.Average Value of Even Numbers That Are Divisible by Three/README_EN.md +++ b/solution/2400-2499/2455.Average Value of Even Numbers That Are Divisible by Three/README_EN.md @@ -195,11 +195,7 @@ int averageValue(int* nums, int numsSize) { ```rust impl Solution { pub fn average_value(nums: Vec) -> i32 { - let filtered_nums: Vec = nums - .iter() - .cloned() - .filter(|&n| n % 6 == 0) - .collect(); + let filtered_nums: Vec = nums.iter().cloned().filter(|&n| n % 6 == 0).collect(); if filtered_nums.is_empty() { return 0; diff --git a/solution/2400-2499/2471.Minimum Number of Operations to Sort a Binary Tree by Level/README.md b/solution/2400-2499/2471.Minimum Number of Operations to Sort a Binary Tree by Level/README.md index 2cd6e1e48d827..0d8071061c800 100644 --- a/solution/2400-2499/2471.Minimum Number of Operations to Sort a Binary Tree by Level/README.md +++ b/solution/2400-2499/2471.Minimum Number of Operations to Sort a Binary Tree by Level/README.md @@ -369,9 +369,9 @@ function minimumOperations(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn minimum_operations(root: Option>>) -> i32 { let mut queue = VecDeque::new(); diff --git a/solution/2400-2499/2471.Minimum Number of Operations to Sort a Binary Tree by Level/README_EN.md b/solution/2400-2499/2471.Minimum Number of Operations to Sort a Binary Tree by Level/README_EN.md index 066f46bb1b63a..8f2c8e1731179 100644 --- a/solution/2400-2499/2471.Minimum Number of Operations to Sort a Binary Tree by Level/README_EN.md +++ b/solution/2400-2499/2471.Minimum Number of Operations to Sort a Binary Tree by Level/README_EN.md @@ -370,9 +370,9 @@ function minimumOperations(root: TreeNode | null): number { // } // } // } -use std::rc::Rc; use std::cell::RefCell; use std::collections::VecDeque; +use std::rc::Rc; impl Solution { pub fn minimum_operations(root: Option>>) -> i32 { let mut queue = VecDeque::new(); diff --git a/solution/2500-2599/2511.Maximum Enemy Forts That Can Be Captured/README.md b/solution/2500-2599/2511.Maximum Enemy Forts That Can Be Captured/README.md index 7cf37c724b58c..4a82f40d88255 100644 --- a/solution/2500-2599/2511.Maximum Enemy Forts That Can Be Captured/README.md +++ b/solution/2500-2599/2511.Maximum Enemy Forts That Can Be Captured/README.md @@ -235,19 +235,12 @@ impl Solution { let mut ans = 0; let mut i = 0; - while - let Some((idx, &value)) = forts + while let Some((idx, &value)) = forts.iter().enumerate().skip(i).find(|&(_, &x)| x != 0) { + if let Some((jdx, _)) = forts .iter() .enumerate() - .skip(i) + .skip(idx + 1) .find(|&(_, &x)| x != 0) - { - if - let Some((jdx, _)) = forts - .iter() - .enumerate() - .skip(idx + 1) - .find(|&(_, &x)| x != 0) { if value + forts[jdx] == 0 { ans = ans.max(jdx - idx - 1); diff --git a/solution/2500-2599/2511.Maximum Enemy Forts That Can Be Captured/README_EN.md b/solution/2500-2599/2511.Maximum Enemy Forts That Can Be Captured/README_EN.md index b46d1246ead1f..1ba3777a86b4d 100644 --- a/solution/2500-2599/2511.Maximum Enemy Forts That Can Be Captured/README_EN.md +++ b/solution/2500-2599/2511.Maximum Enemy Forts That Can Be Captured/README_EN.md @@ -231,19 +231,12 @@ impl Solution { let mut ans = 0; let mut i = 0; - while - let Some((idx, &value)) = forts + while let Some((idx, &value)) = forts.iter().enumerate().skip(i).find(|&(_, &x)| x != 0) { + if let Some((jdx, _)) = forts .iter() .enumerate() - .skip(i) + .skip(idx + 1) .find(|&(_, &x)| x != 0) - { - if - let Some((jdx, _)) = forts - .iter() - .enumerate() - .skip(idx + 1) - .find(|&(_, &x)| x != 0) { if value + forts[jdx] == 0 { ans = ans.max(jdx - idx - 1); diff --git a/solution/2500-2599/2512.Reward Top K Students/README.md b/solution/2500-2599/2512.Reward Top K Students/README.md index fc55f6119b564..747d9583d1e77 100644 --- a/solution/2500-2599/2512.Reward Top K Students/README.md +++ b/solution/2500-2599/2512.Reward Top K Students/README.md @@ -270,14 +270,14 @@ function topStudents( #### Rust ```rust -use std::collections::{ HashMap, HashSet }; +use std::collections::{HashMap, HashSet}; impl Solution { pub fn top_students( positive_feedback: Vec, negative_feedback: Vec, report: Vec, student_id: Vec, - k: i32 + k: i32, ) -> Vec { let n = student_id.len(); let ps = positive_feedback.iter().collect::>(); @@ -303,10 +303,7 @@ impl Solution { } b.1.cmp(&a.1) }); - t.iter() - .map(|v| v.0) - .collect::>() - [0..k as usize].to_vec() + t.iter().map(|v| v.0).collect::>()[0..k as usize].to_vec() } } ``` diff --git a/solution/2500-2599/2512.Reward Top K Students/README_EN.md b/solution/2500-2599/2512.Reward Top K Students/README_EN.md index 55c91662fc1ae..ae0f9df70030a 100644 --- a/solution/2500-2599/2512.Reward Top K Students/README_EN.md +++ b/solution/2500-2599/2512.Reward Top K Students/README_EN.md @@ -270,14 +270,14 @@ function topStudents( #### Rust ```rust -use std::collections::{ HashMap, HashSet }; +use std::collections::{HashMap, HashSet}; impl Solution { pub fn top_students( positive_feedback: Vec, negative_feedback: Vec, report: Vec, student_id: Vec, - k: i32 + k: i32, ) -> Vec { let n = student_id.len(); let ps = positive_feedback.iter().collect::>(); @@ -303,10 +303,7 @@ impl Solution { } b.1.cmp(&a.1) }); - t.iter() - .map(|v| v.0) - .collect::>() - [0..k as usize].to_vec() + t.iter().map(|v| v.0).collect::>()[0..k as usize].to_vec() } } ``` diff --git a/solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/README.md b/solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/README.md index 615b7cca0826f..423127085fea0 100644 --- a/solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/README.md +++ b/solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/README.md @@ -185,9 +185,7 @@ impl Solution { let start_index = start_index as usize; let n = words.len(); for i in 0..=n >> 1 { - if - words[(start_index - i + n) % n] == target || - words[(start_index + i) % n] == target + if words[(start_index - i + n) % n] == target || words[(start_index + i) % n] == target { return i as i32; } diff --git a/solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/README_EN.md b/solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/README_EN.md index 5d2c2f1bd0a72..fc6f0e30b0b4d 100644 --- a/solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/README_EN.md +++ b/solution/2500-2599/2515.Shortest Distance to Target String in a Circular Array/README_EN.md @@ -182,9 +182,7 @@ impl Solution { let start_index = start_index as usize; let n = words.len(); for i in 0..=n >> 1 { - if - words[(start_index - i + n) % n] == target || - words[(start_index + i) % n] == target + if words[(start_index - i + n) % n] == target || words[(start_index + i) % n] == target { return i as i32; } diff --git a/solution/2500-2599/2520.Count the Digits That Divide a Number/README.md b/solution/2500-2599/2520.Count the Digits That Divide a Number/README.md index c4f3755dbc30c..8d8f8b4ae181c 100644 --- a/solution/2500-2599/2520.Count the Digits That Divide a Number/README.md +++ b/solution/2500-2599/2520.Count the Digits That Divide a Number/README.md @@ -205,8 +205,7 @@ function countDigits(num: number): number { ```rust impl Solution { pub fn count_digits(num: i32) -> i32 { - num - .to_string() + num.to_string() .chars() .filter(|&c| c != '0') .filter(|&c| num % (c.to_digit(10).unwrap() as i32) == 0) diff --git a/solution/2500-2599/2520.Count the Digits That Divide a Number/README_EN.md b/solution/2500-2599/2520.Count the Digits That Divide a Number/README_EN.md index b18abae97d0ff..4da04171147be 100644 --- a/solution/2500-2599/2520.Count the Digits That Divide a Number/README_EN.md +++ b/solution/2500-2599/2520.Count the Digits That Divide a Number/README_EN.md @@ -206,8 +206,7 @@ function countDigits(num: number): number { ```rust impl Solution { pub fn count_digits(num: i32) -> i32 { - num - .to_string() + num.to_string() .chars() .filter(|&c| c != '0') .filter(|&c| num % (c.to_digit(10).unwrap() as i32) == 0) diff --git a/solution/2500-2599/2525.Categorize Box According to Criteria/README.md b/solution/2500-2599/2525.Categorize Box According to Criteria/README.md index 952b3457ef6bd..0a78c4b6553d5 100644 --- a/solution/2500-2599/2525.Categorize Box According to Criteria/README.md +++ b/solution/2500-2599/2525.Categorize Box According to Criteria/README.md @@ -308,11 +308,10 @@ function categorizeBox(length: number, width: number, height: number, mass: numb impl Solution { pub fn categorize_box(length: i32, width: i32, height: i32, mass: i32) -> String { let v = length * width * height; - let bulky = - length >= 10000 || - width >= 10000 || - height >= 10000 || - (length as i64) * (width as i64) * (height as i64) >= 1000000000; + let bulky = length >= 10000 + || width >= 10000 + || height >= 10000 + || (length as i64) * (width as i64) * (height as i64) >= 1000000000; let heavy = mass >= 100; diff --git a/solution/2500-2599/2525.Categorize Box According to Criteria/README_EN.md b/solution/2500-2599/2525.Categorize Box According to Criteria/README_EN.md index f4ffa0fb31536..2c2c285ed5020 100644 --- a/solution/2500-2599/2525.Categorize Box According to Criteria/README_EN.md +++ b/solution/2500-2599/2525.Categorize Box According to Criteria/README_EN.md @@ -306,11 +306,10 @@ function categorizeBox(length: number, width: number, height: number, mass: numb impl Solution { pub fn categorize_box(length: i32, width: i32, height: i32, mass: i32) -> String { let v = length * width * height; - let bulky = - length >= 10000 || - width >= 10000 || - height >= 10000 || - (length as i64) * (width as i64) * (height as i64) >= 1000000000; + let bulky = length >= 10000 + || width >= 10000 + || height >= 10000 + || (length as i64) * (width as i64) * (height as i64) >= 1000000000; let heavy = mass >= 100; diff --git a/solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/README.md b/solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/README.md index a76e3e1a1b8bb..b3bb27d7e347a 100644 --- a/solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/README.md +++ b/solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/README.md @@ -215,13 +215,12 @@ impl Solution { let a: i32 = nums.iter().sum(); let b: i32 = nums .iter() - .map(|&n| - n - .to_string() + .map(|&n| { + n.to_string() .chars() .map(|c| c.to_digit(10).unwrap() as i32) .sum::() - ) + }) .sum(); (a - b).abs() } diff --git a/solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/README_EN.md b/solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/README_EN.md index 88550919a8897..d31b871ccee90 100644 --- a/solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/README_EN.md +++ b/solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/README_EN.md @@ -213,13 +213,12 @@ impl Solution { let a: i32 = nums.iter().sum(); let b: i32 = nums .iter() - .map(|&n| - n - .to_string() + .map(|&n| { + n.to_string() .chars() .map(|c| c.to_digit(10).unwrap() as i32) .sum::() - ) + }) .sum(); (a - b).abs() } diff --git a/solution/2500-2599/2541.Minimum Operations to Make Array Equal II/README.md b/solution/2500-2599/2541.Minimum Operations to Make Array Equal II/README.md index fa2a67b3613c8..1b39650beacda 100644 --- a/solution/2500-2599/2541.Minimum Operations to Make Array Equal II/README.md +++ b/solution/2500-2599/2541.Minimum Operations to Make Array Equal II/README.md @@ -216,12 +216,7 @@ impl Solution { let k = k as i64; let n = nums1.len(); if k == 0 { - return if - nums1 - .iter() - .enumerate() - .all(|(i, &v)| v == nums2[i]) - { + return if nums1.iter().enumerate().all(|(i, &v)| v == nums2[i]) { 0 } else { -1 diff --git a/solution/2500-2599/2541.Minimum Operations to Make Array Equal II/README_EN.md b/solution/2500-2599/2541.Minimum Operations to Make Array Equal II/README_EN.md index 900814bb79525..c35a4180832d1 100644 --- a/solution/2500-2599/2541.Minimum Operations to Make Array Equal II/README_EN.md +++ b/solution/2500-2599/2541.Minimum Operations to Make Array Equal II/README_EN.md @@ -216,12 +216,7 @@ impl Solution { let k = k as i64; let n = nums1.len(); if k == 0 { - return if - nums1 - .iter() - .enumerate() - .all(|(i, &v)| v == nums2[i]) - { + return if nums1.iter().enumerate().all(|(i, &v)| v == nums2[i]) { 0 } else { -1 diff --git a/solution/2500-2599/2553.Separate the Digits in an Array/README.md b/solution/2500-2599/2553.Separate the Digits in an Array/README.md index 1a3325ad18bfc..059fd024badd4 100644 --- a/solution/2500-2599/2553.Separate the Digits in an Array/README.md +++ b/solution/2500-2599/2553.Separate the Digits in an Array/README.md @@ -180,9 +180,7 @@ impl Solution { t.push(num % 10); num /= 10; } - t.into_iter() - .rev() - .for_each(|v| ans.push(v)); + t.into_iter().rev().for_each(|v| ans.push(v)); } ans } diff --git a/solution/2500-2599/2553.Separate the Digits in an Array/README_EN.md b/solution/2500-2599/2553.Separate the Digits in an Array/README_EN.md index 2c4745fb73046..2b1167f996f36 100644 --- a/solution/2500-2599/2553.Separate the Digits in an Array/README_EN.md +++ b/solution/2500-2599/2553.Separate the Digits in an Array/README_EN.md @@ -180,9 +180,7 @@ impl Solution { t.push(num % 10); num /= 10; } - t.into_iter() - .rev() - .for_each(|v| ans.push(v)); + t.into_iter().rev().for_each(|v| ans.push(v)); } ans } diff --git a/solution/2500-2599/2566.Maximum Difference by Remapping a Digit/README.md b/solution/2500-2599/2566.Maximum Difference by Remapping a Digit/README.md index 5b405487fe0ba..4978faa0d0616 100644 --- a/solution/2500-2599/2566.Maximum Difference by Remapping a Digit/README.md +++ b/solution/2500-2599/2566.Maximum Difference by Remapping a Digit/README.md @@ -194,7 +194,10 @@ function minMaxDifference(num: number): number { impl Solution { pub fn min_max_difference(num: i32) -> i32 { let s = num.to_string(); - let min = s.replace(char::from(s.as_bytes()[0]), "0").parse::().unwrap(); + let min = s + .replace(char::from(s.as_bytes()[0]), "0") + .parse::() + .unwrap(); for &c in s.as_bytes() { if c != b'9' { return s.replace(c, "9").parse().unwrap() - min; diff --git a/solution/2500-2599/2566.Maximum Difference by Remapping a Digit/README_EN.md b/solution/2500-2599/2566.Maximum Difference by Remapping a Digit/README_EN.md index 22180b56081c1..8f48a113cc496 100644 --- a/solution/2500-2599/2566.Maximum Difference by Remapping a Digit/README_EN.md +++ b/solution/2500-2599/2566.Maximum Difference by Remapping a Digit/README_EN.md @@ -191,7 +191,10 @@ function minMaxDifference(num: number): number { impl Solution { pub fn min_max_difference(num: i32) -> i32 { let s = num.to_string(); - let min = s.replace(char::from(s.as_bytes()[0]), "0").parse::().unwrap(); + let min = s + .replace(char::from(s.as_bytes()[0]), "0") + .parse::() + .unwrap(); for &c in s.as_bytes() { if c != b'9' { return s.replace(c, "9").parse().unwrap() - min; diff --git a/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README.md b/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README.md index eefd2b6617a25..6c9b5f0ad90e0 100644 --- a/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README.md +++ b/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README.md @@ -155,7 +155,9 @@ impl Solution { pub fn minimize_sum(mut nums: Vec) -> i32 { nums.sort(); let n = nums.len(); - (nums[n - 1] - nums[2]).min(nums[n - 2] - nums[1]).min(nums[n - 3] - nums[0]) + (nums[n - 1] - nums[2]) + .min(nums[n - 2] - nums[1]) + .min(nums[n - 3] - nums[0]) } } ``` diff --git a/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README_EN.md b/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README_EN.md index cb9e753755995..a5c8c0dfa5110 100644 --- a/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README_EN.md +++ b/solution/2500-2599/2567.Minimum Score by Changing Two Elements/README_EN.md @@ -160,7 +160,9 @@ impl Solution { pub fn minimize_sum(mut nums: Vec) -> i32 { nums.sort(); let n = nums.len(); - (nums[n - 1] - nums[2]).min(nums[n - 2] - nums[1]).min(nums[n - 3] - nums[0]) + (nums[n - 1] - nums[2]) + .min(nums[n - 2] - nums[1]) + .min(nums[n - 3] - nums[0]) } } ``` diff --git a/solution/2500-2599/2586.Count the Number of Vowel Strings in Range/README.md b/solution/2500-2599/2586.Count the Number of Vowel Strings in Range/README.md index 6f7dc3cce8766..896dffc1674bd 100644 --- a/solution/2500-2599/2586.Count the Number of Vowel Strings in Range/README.md +++ b/solution/2500-2599/2586.Count the Number of Vowel Strings in Range/README.md @@ -166,9 +166,8 @@ function vowelStrings(words: string[], left: number, right: number): number { ```rust impl Solution { pub fn vowel_strings(words: Vec, left: i32, right: i32) -> i32 { - let check = |c: u8| -> bool { - c == b'a' || c == b'e' || c == b'i' || c == b'o' || c == b'u' - }; + let check = + |c: u8| -> bool { c == b'a' || c == b'e' || c == b'i' || c == b'o' || c == b'u' }; let mut ans = 0; for i in left..=right { diff --git a/solution/2500-2599/2586.Count the Number of Vowel Strings in Range/README_EN.md b/solution/2500-2599/2586.Count the Number of Vowel Strings in Range/README_EN.md index 37fe0e4af82b9..a2e26424ea87c 100644 --- a/solution/2500-2599/2586.Count the Number of Vowel Strings in Range/README_EN.md +++ b/solution/2500-2599/2586.Count the Number of Vowel Strings in Range/README_EN.md @@ -164,9 +164,8 @@ function vowelStrings(words: string[], left: number, right: number): number { ```rust impl Solution { pub fn vowel_strings(words: Vec, left: i32, right: i32) -> i32 { - let check = |c: u8| -> bool { - c == b'a' || c == b'e' || c == b'i' || c == b'o' || c == b'u' - }; + let check = + |c: u8| -> bool { c == b'a' || c == b'e' || c == b'i' || c == b'o' || c == b'u' }; let mut ans = 0; for i in left..=right { diff --git a/solution/2500-2599/2590.Design a Todo List/README.md b/solution/2500-2599/2590.Design a Todo List/README.md index 9d54747b280ec..6455bca8ef8a2 100644 --- a/solution/2500-2599/2590.Design a Todo List/README.md +++ b/solution/2500-2599/2590.Design a Todo List/README.md @@ -216,7 +216,7 @@ class TodoList { #### Rust ```rust -use std::collections::{ HashMap, HashSet }; +use std::collections::{HashMap, HashSet}; #[derive(Clone)] struct Task { @@ -246,19 +246,16 @@ impl TodoList { user_id: i32, task_description: String, due_date: i32, - tags: Vec + tags: Vec, ) -> i32 { if self.user_map.contains_key(&user_id) { // Just add the task - self.user_map - .get_mut(&user_id) - .unwrap() - .push(Task { - task_id: self.id, - description: task_description, - tags: tags.into_iter().collect::>(), - due_date, - }); + self.user_map.get_mut(&user_id).unwrap().push(Task { + task_id: self.id, + description: task_description, + tags: tags.into_iter().collect::>(), + due_date, + }); // Increase the global id self.id += 1; return self.id - 1; @@ -271,41 +268,34 @@ impl TodoList { description: task_description, tags: tags.into_iter().collect::>(), due_date, - }] + }], ); self.id += 1; self.id - 1 } fn get_all_tasks(&self, user_id: i32) -> Vec { - if - !self.user_map.contains_key(&user_id) || - self.user_map.get(&user_id).unwrap().is_empty() + if !self.user_map.contains_key(&user_id) || self.user_map.get(&user_id).unwrap().is_empty() { return vec![]; } // Get the task vector let mut ret_vec = (*self.user_map.get(&user_id).unwrap()).clone(); // Sort by due date - ret_vec.sort_by(|lhs, rhs| { lhs.due_date.cmp(&rhs.due_date) }); + ret_vec.sort_by(|lhs, rhs| lhs.due_date.cmp(&rhs.due_date)); // Return the description vector - ret_vec - .into_iter() - .map(|x| x.description) - .collect() + ret_vec.into_iter().map(|x| x.description).collect() } fn get_tasks_for_tag(&self, user_id: i32, tag: String) -> Vec { - if - !self.user_map.contains_key(&user_id) || - self.user_map.get(&user_id).unwrap().is_empty() + if !self.user_map.contains_key(&user_id) || self.user_map.get(&user_id).unwrap().is_empty() { return vec![]; } // Get the task vector let mut ret_vec = (*self.user_map.get(&user_id).unwrap()).clone(); // Sort by due date - ret_vec.sort_by(|lhs, rhs| { lhs.due_date.cmp(&rhs.due_date) }); + ret_vec.sort_by(|lhs, rhs| lhs.due_date.cmp(&rhs.due_date)); // Return the description vector ret_vec .into_iter() @@ -315,9 +305,7 @@ impl TodoList { } fn complete_task(&mut self, user_id: i32, task_id: i32) { - if - !self.user_map.contains_key(&user_id) || - self.user_map.get(&user_id).unwrap().is_empty() + if !self.user_map.contains_key(&user_id) || self.user_map.get(&user_id).unwrap().is_empty() { return; } diff --git a/solution/2500-2599/2590.Design a Todo List/README_EN.md b/solution/2500-2599/2590.Design a Todo List/README_EN.md index 04b525117328a..bc443e5dee35c 100644 --- a/solution/2500-2599/2590.Design a Todo List/README_EN.md +++ b/solution/2500-2599/2590.Design a Todo List/README_EN.md @@ -214,7 +214,7 @@ class TodoList { #### Rust ```rust -use std::collections::{ HashMap, HashSet }; +use std::collections::{HashMap, HashSet}; #[derive(Clone)] struct Task { @@ -244,19 +244,16 @@ impl TodoList { user_id: i32, task_description: String, due_date: i32, - tags: Vec + tags: Vec, ) -> i32 { if self.user_map.contains_key(&user_id) { // Just add the task - self.user_map - .get_mut(&user_id) - .unwrap() - .push(Task { - task_id: self.id, - description: task_description, - tags: tags.into_iter().collect::>(), - due_date, - }); + self.user_map.get_mut(&user_id).unwrap().push(Task { + task_id: self.id, + description: task_description, + tags: tags.into_iter().collect::>(), + due_date, + }); // Increase the global id self.id += 1; return self.id - 1; @@ -269,41 +266,34 @@ impl TodoList { description: task_description, tags: tags.into_iter().collect::>(), due_date, - }] + }], ); self.id += 1; self.id - 1 } fn get_all_tasks(&self, user_id: i32) -> Vec { - if - !self.user_map.contains_key(&user_id) || - self.user_map.get(&user_id).unwrap().is_empty() + if !self.user_map.contains_key(&user_id) || self.user_map.get(&user_id).unwrap().is_empty() { return vec![]; } // Get the task vector let mut ret_vec = (*self.user_map.get(&user_id).unwrap()).clone(); // Sort by due date - ret_vec.sort_by(|lhs, rhs| { lhs.due_date.cmp(&rhs.due_date) }); + ret_vec.sort_by(|lhs, rhs| lhs.due_date.cmp(&rhs.due_date)); // Return the description vector - ret_vec - .into_iter() - .map(|x| x.description) - .collect() + ret_vec.into_iter().map(|x| x.description).collect() } fn get_tasks_for_tag(&self, user_id: i32, tag: String) -> Vec { - if - !self.user_map.contains_key(&user_id) || - self.user_map.get(&user_id).unwrap().is_empty() + if !self.user_map.contains_key(&user_id) || self.user_map.get(&user_id).unwrap().is_empty() { return vec![]; } // Get the task vector let mut ret_vec = (*self.user_map.get(&user_id).unwrap()).clone(); // Sort by due date - ret_vec.sort_by(|lhs, rhs| { lhs.due_date.cmp(&rhs.due_date) }); + ret_vec.sort_by(|lhs, rhs| lhs.due_date.cmp(&rhs.due_date)); // Return the description vector ret_vec .into_iter() @@ -313,9 +303,7 @@ impl TodoList { } fn complete_task(&mut self, user_id: i32, task_id: i32) { - if - !self.user_map.contains_key(&user_id) || - self.user_map.get(&user_id).unwrap().is_empty() + if !self.user_map.contains_key(&user_id) || self.user_map.get(&user_id).unwrap().is_empty() { return; } diff --git a/solution/2600-2699/2600.K Items With the Maximum Sum/README.md b/solution/2600-2699/2600.K Items With the Maximum Sum/README.md index 2c8fd486de48f..aa3ebe42346d8 100644 --- a/solution/2600-2699/2600.K Items With the Maximum Sum/README.md +++ b/solution/2600-2699/2600.K Items With the Maximum Sum/README.md @@ -169,7 +169,7 @@ impl Solution { num_ones: i32, num_zeros: i32, num_neg_ones: i32, - k: i32 + k: i32, ) -> i32 { if num_ones > k { return k; diff --git a/solution/2600-2699/2600.K Items With the Maximum Sum/README_EN.md b/solution/2600-2699/2600.K Items With the Maximum Sum/README_EN.md index 1d3865f3b551c..7a1a97bd5c100 100644 --- a/solution/2600-2699/2600.K Items With the Maximum Sum/README_EN.md +++ b/solution/2600-2699/2600.K Items With the Maximum Sum/README_EN.md @@ -158,7 +158,7 @@ impl Solution { num_ones: i32, num_zeros: i32, num_neg_ones: i32, - k: i32 + k: i32, ) -> i32 { if num_ones > k { return k; diff --git a/solution/2600-2699/2643.Row With Maximum Ones/README.md b/solution/2600-2699/2643.Row With Maximum Ones/README.md index e132cf6a53e76..d29d5170fab3a 100644 --- a/solution/2600-2699/2643.Row With Maximum Ones/README.md +++ b/solution/2600-2699/2643.Row With Maximum Ones/README.md @@ -177,10 +177,7 @@ impl Solution { let mut ans = vec![0, 0]; for (i, row) in mat.iter().enumerate() { - let cnt = row - .iter() - .filter(|&v| *v == 1) - .count() as i32; + let cnt = row.iter().filter(|&v| *v == 1).count() as i32; if ans[1] < cnt { ans[0] = i as i32; ans[1] = cnt; diff --git a/solution/2600-2699/2643.Row With Maximum Ones/README_EN.md b/solution/2600-2699/2643.Row With Maximum Ones/README_EN.md index 98773e363d9c9..236220b1491cd 100644 --- a/solution/2600-2699/2643.Row With Maximum Ones/README_EN.md +++ b/solution/2600-2699/2643.Row With Maximum Ones/README_EN.md @@ -176,10 +176,7 @@ impl Solution { let mut ans = vec![0, 0]; for (i, row) in mat.iter().enumerate() { - let cnt = row - .iter() - .filter(|&v| *v == 1) - .count() as i32; + let cnt = row.iter().filter(|&v| *v == 1).count() as i32; if ans[1] < cnt { ans[0] = i as i32; ans[1] = cnt; diff --git a/solution/2600-2699/2652.Sum Multiples/README.md b/solution/2600-2699/2652.Sum Multiples/README.md index 8e9d0b0b0d6c8..82e935582b2ce 100644 --- a/solution/2600-2699/2652.Sum Multiples/README.md +++ b/solution/2600-2699/2652.Sum Multiples/README.md @@ -250,7 +250,9 @@ function sumOfMultiples(n: number): number { ```rust impl Solution { pub fn sum_of_multiples(n: i32) -> i32 { - (1..=n).filter(|&x| (x % 3 == 0 || x % 5 == 0 || x % 7 == 0)).sum() + (1..=n) + .filter(|&x| (x % 3 == 0 || x % 5 == 0 || x % 7 == 0)) + .sum() } } ``` diff --git a/solution/2600-2699/2652.Sum Multiples/README_EN.md b/solution/2600-2699/2652.Sum Multiples/README_EN.md index a6b36bbc60d09..f020a6ffa3b75 100644 --- a/solution/2600-2699/2652.Sum Multiples/README_EN.md +++ b/solution/2600-2699/2652.Sum Multiples/README_EN.md @@ -250,7 +250,9 @@ function sumOfMultiples(n: number): number { ```rust impl Solution { pub fn sum_of_multiples(n: i32) -> i32 { - (1..=n).filter(|&x| (x % 3 == 0 || x % 5 == 0 || x % 7 == 0)).sum() + (1..=n) + .filter(|&x| (x % 3 == 0 || x % 5 == 0 || x % 7 == 0)) + .sum() } } ``` diff --git "a/solution/2600-2699/2664.The Knight\342\200\231s Tour/README.md" "b/solution/2600-2699/2664.The Knight\342\200\231s Tour/README.md" index e584eefb079f4..c144e921f6dd5 100644 --- "a/solution/2600-2699/2664.The Knight\342\200\231s Tour/README.md" +++ "b/solution/2600-2699/2664.The Knight\342\200\231s Tour/README.md" @@ -258,7 +258,7 @@ impl Solution { m: i32, n: i32, dirs: &[i32; 9], - ok: &mut bool + ok: &mut bool, ) { if g[i][j] == m * n - 1 { *ok = true; diff --git "a/solution/2600-2699/2664.The Knight\342\200\231s Tour/README_EN.md" "b/solution/2600-2699/2664.The Knight\342\200\231s Tour/README_EN.md" index 8c37c8196c49a..a85af030da77a 100644 --- "a/solution/2600-2699/2664.The Knight\342\200\231s Tour/README_EN.md" +++ "b/solution/2600-2699/2664.The Knight\342\200\231s Tour/README_EN.md" @@ -256,7 +256,7 @@ impl Solution { m: i32, n: i32, dirs: &[i32; 9], - ok: &mut bool + ok: &mut bool, ) { if g[i][j] == m * n - 1 { *ok = true; diff --git a/solution/2600-2699/2679.Sum in a Matrix/README.md b/solution/2600-2699/2679.Sum in a Matrix/README.md index 6c3f9fff12eba..e514d630db89c 100644 --- a/solution/2600-2699/2679.Sum in a Matrix/README.md +++ b/solution/2600-2699/2679.Sum in a Matrix/README.md @@ -173,13 +173,7 @@ impl Solution { row.sort(); } (0..nums[0].len()) - .map(|col| - nums - .iter() - .map(|row| row[col]) - .max() - .unwrap() - ) + .map(|col| nums.iter().map(|row| row[col]).max().unwrap()) .sum() } } diff --git a/solution/2600-2699/2679.Sum in a Matrix/README_EN.md b/solution/2600-2699/2679.Sum in a Matrix/README_EN.md index de2ba66d7a560..b0c153363fd8d 100644 --- a/solution/2600-2699/2679.Sum in a Matrix/README_EN.md +++ b/solution/2600-2699/2679.Sum in a Matrix/README_EN.md @@ -164,13 +164,7 @@ impl Solution { row.sort(); } (0..nums[0].len()) - .map(|col| - nums - .iter() - .map(|row| row[col]) - .max() - .unwrap() - ) + .map(|col| nums.iter().map(|row| row[col]).max().unwrap()) .sum() } } diff --git a/solution/2700-2799/2742.Painting the Walls/README.md b/solution/2700-2799/2742.Painting the Walls/README.md index 43be9bfc16aaa..80ba50fbb9e87 100644 --- a/solution/2700-2799/2742.Painting the Walls/README.md +++ b/solution/2700-2799/2742.Painting the Walls/README.md @@ -199,7 +199,7 @@ impl Solution { j: i32, n: i32, time: &Vec, - cost: &Vec + cost: &Vec, ) -> i32 { if n - i <= j - n { // All the remaining walls can be printed at no cost @@ -214,9 +214,9 @@ impl Solution { if record_vec[i as usize][j as usize] == -1 { // This record hasn't been written record_vec[i as usize][j as usize] = std::cmp::min( - Self::dfs(record_vec, i + 1, j + time[i as usize], n, time, cost) + - cost[i as usize], - Self::dfs(record_vec, i + 1, j - 1, n, time, cost) + Self::dfs(record_vec, i + 1, j + time[i as usize], n, time, cost) + + cost[i as usize], + Self::dfs(record_vec, i + 1, j - 1, n, time, cost), ); } record_vec[i as usize][j as usize] diff --git a/solution/2700-2799/2742.Painting the Walls/README_EN.md b/solution/2700-2799/2742.Painting the Walls/README_EN.md index 4ed33d1670909..597d6f48d8850 100644 --- a/solution/2700-2799/2742.Painting the Walls/README_EN.md +++ b/solution/2700-2799/2742.Painting the Walls/README_EN.md @@ -199,7 +199,7 @@ impl Solution { j: i32, n: i32, time: &Vec, - cost: &Vec + cost: &Vec, ) -> i32 { if n - i <= j - n { // All the remaining walls can be printed at no cost @@ -214,9 +214,9 @@ impl Solution { if record_vec[i as usize][j as usize] == -1 { // This record hasn't been written record_vec[i as usize][j as usize] = std::cmp::min( - Self::dfs(record_vec, i + 1, j + time[i as usize], n, time, cost) + - cost[i as usize], - Self::dfs(record_vec, i + 1, j - 1, n, time, cost) + Self::dfs(record_vec, i + 1, j + time[i as usize], n, time, cost) + + cost[i as usize], + Self::dfs(record_vec, i + 1, j - 1, n, time, cost), ); } record_vec[i as usize][j as usize] diff --git a/solution/2700-2799/2798.Number of Employees Who Met the Target/README.md b/solution/2700-2799/2798.Number of Employees Who Met the Target/README.md index a3fc7480ac831..a3907c2b924d8 100644 --- a/solution/2700-2799/2798.Number of Employees Who Met the Target/README.md +++ b/solution/2700-2799/2798.Number of Employees Who Met the Target/README.md @@ -135,10 +135,7 @@ function numberOfEmployeesWhoMetTarget(hours: number[], target: number): number ```rust impl Solution { pub fn number_of_employees_who_met_target(hours: Vec, target: i32) -> i32 { - hours - .iter() - .filter(|&x| *x >= target) - .count() as i32 + hours.iter().filter(|&x| *x >= target).count() as i32 } } ``` diff --git a/solution/2700-2799/2798.Number of Employees Who Met the Target/README_EN.md b/solution/2700-2799/2798.Number of Employees Who Met the Target/README_EN.md index 7f2296dcbc31f..617ad164137d8 100644 --- a/solution/2700-2799/2798.Number of Employees Who Met the Target/README_EN.md +++ b/solution/2700-2799/2798.Number of Employees Who Met the Target/README_EN.md @@ -135,10 +135,7 @@ function numberOfEmployeesWhoMetTarget(hours: number[], target: number): number ```rust impl Solution { pub fn number_of_employees_who_met_target(hours: Vec, target: i32) -> i32 { - hours - .iter() - .filter(|&x| *x >= target) - .count() as i32 + hours.iter().filter(|&x| *x >= target).count() as i32 } } ``` diff --git a/solution/2800-2899/2812.Find the Safest Path in a Grid/README.md b/solution/2800-2899/2812.Find the Safest Path in a Grid/README.md index 2bb6774ec41ae..e80bfa619a738 100644 --- a/solution/2800-2899/2812.Find the Safest Path in a Grid/README.md +++ b/solution/2800-2899/2812.Find the Safest Path in a Grid/README.md @@ -519,11 +519,11 @@ impl Solution { } vis[i][j] = true; let n = g.len(); - (i == n - 1 && j == n - 1) || - (i != 0 && Self::dfs(i - 1, j, v, g, vis)) || - (i != n - 1 && Self::dfs(i + 1, j, v, g, vis)) || - (j != 0 && Self::dfs(i, j - 1, v, g, vis)) || - (j != n - 1 && Self::dfs(i, j + 1, v, g, vis)) + (i == n - 1 && j == n - 1) + || (i != 0 && Self::dfs(i - 1, j, v, g, vis)) + || (i != n - 1 && Self::dfs(i + 1, j, v, g, vis)) + || (j != 0 && Self::dfs(i, j - 1, v, g, vis)) + || (j != n - 1 && Self::dfs(i, j + 1, v, g, vis)) } pub fn maximum_safeness_factor(grid: Vec>) -> i32 { diff --git a/solution/2800-2899/2812.Find the Safest Path in a Grid/README_EN.md b/solution/2800-2899/2812.Find the Safest Path in a Grid/README_EN.md index f00c06bc93e32..a24aed2dea276 100644 --- a/solution/2800-2899/2812.Find the Safest Path in a Grid/README_EN.md +++ b/solution/2800-2899/2812.Find the Safest Path in a Grid/README_EN.md @@ -516,11 +516,11 @@ impl Solution { } vis[i][j] = true; let n = g.len(); - (i == n - 1 && j == n - 1) || - (i != 0 && Self::dfs(i - 1, j, v, g, vis)) || - (i != n - 1 && Self::dfs(i + 1, j, v, g, vis)) || - (j != 0 && Self::dfs(i, j - 1, v, g, vis)) || - (j != n - 1 && Self::dfs(i, j + 1, v, g, vis)) + (i == n - 1 && j == n - 1) + || (i != 0 && Self::dfs(i - 1, j, v, g, vis)) + || (i != n - 1 && Self::dfs(i + 1, j, v, g, vis)) + || (j != 0 && Self::dfs(i, j - 1, v, g, vis)) + || (j != n - 1 && Self::dfs(i, j + 1, v, g, vis)) } pub fn maximum_safeness_factor(grid: Vec>) -> i32 { diff --git a/solution/2800-2899/2828.Check if a String Is an Acronym of Words/README.md b/solution/2800-2899/2828.Check if a String Is an Acronym of Words/README.md index 5b8699b43f4cb..81d5882aefc5d 100644 --- a/solution/2800-2899/2828.Check if a String Is an Acronym of Words/README.md +++ b/solution/2800-2899/2828.Check if a String Is an Acronym of Words/README.md @@ -144,7 +144,8 @@ impl Solution { words .iter() .map(|w| w.chars().next().unwrap_or_default()) - .collect::() == s + .collect::() + == s } } ``` diff --git a/solution/2800-2899/2828.Check if a String Is an Acronym of Words/README_EN.md b/solution/2800-2899/2828.Check if a String Is an Acronym of Words/README_EN.md index 74025fc1b2054..183ad0549185f 100644 --- a/solution/2800-2899/2828.Check if a String Is an Acronym of Words/README_EN.md +++ b/solution/2800-2899/2828.Check if a String Is an Acronym of Words/README_EN.md @@ -142,7 +142,8 @@ impl Solution { words .iter() .map(|w| w.chars().next().unwrap_or_default()) - .collect::() == s + .collect::() + == s } } ``` diff --git a/solution/2800-2899/2864.Maximum Odd Binary Number/README.md b/solution/2800-2899/2864.Maximum Odd Binary Number/README.md index 8aa2e3acafe34..5164a7937d205 100644 --- a/solution/2800-2899/2864.Maximum Odd Binary Number/README.md +++ b/solution/2800-2899/2864.Maximum Odd Binary Number/README.md @@ -125,10 +125,7 @@ function maximumOddBinaryNumber(s: string): string { ```rust impl Solution { pub fn maximum_odd_binary_number(s: String) -> String { - let cnt = s - .chars() - .filter(|&c| c == '1') - .count(); + let cnt = s.chars().filter(|&c| c == '1').count(); "1".repeat(cnt - 1) + &"0".repeat(s.len() - cnt) + "1" } } diff --git a/solution/2800-2899/2864.Maximum Odd Binary Number/README_EN.md b/solution/2800-2899/2864.Maximum Odd Binary Number/README_EN.md index 45312f3dcf436..0e1d172e74a00 100644 --- a/solution/2800-2899/2864.Maximum Odd Binary Number/README_EN.md +++ b/solution/2800-2899/2864.Maximum Odd Binary Number/README_EN.md @@ -123,10 +123,7 @@ function maximumOddBinaryNumber(s: string): string { ```rust impl Solution { pub fn maximum_odd_binary_number(s: String) -> String { - let cnt = s - .chars() - .filter(|&c| c == '1') - .count(); + let cnt = s.chars().filter(|&c| c == '1').count(); "1".repeat(cnt - 1) + &"0".repeat(s.len() - cnt) + "1" } } diff --git a/solution/2900-2999/2900.Longest Unequal Adjacent Groups Subsequence I/README.md b/solution/2900-2999/2900.Longest Unequal Adjacent Groups Subsequence I/README.md index 5d07d0d048caf..b48e43453d133 100644 --- a/solution/2900-2999/2900.Longest Unequal Adjacent Groups Subsequence I/README.md +++ b/solution/2900-2999/2900.Longest Unequal Adjacent Groups Subsequence I/README.md @@ -160,7 +160,7 @@ impl Solution { pub fn get_words_in_longest_subsequence( n: i32, words: Vec, - groups: Vec + groups: Vec, ) -> Vec { let mut ans = vec![]; diff --git a/solution/2900-2999/2900.Longest Unequal Adjacent Groups Subsequence I/README_EN.md b/solution/2900-2999/2900.Longest Unequal Adjacent Groups Subsequence I/README_EN.md index d26df2cfd389f..913cdda134f56 100644 --- a/solution/2900-2999/2900.Longest Unequal Adjacent Groups Subsequence I/README_EN.md +++ b/solution/2900-2999/2900.Longest Unequal Adjacent Groups Subsequence I/README_EN.md @@ -184,7 +184,7 @@ impl Solution { pub fn get_words_in_longest_subsequence( n: i32, words: Vec, - groups: Vec + groups: Vec, ) -> Vec { let mut ans = vec![]; diff --git a/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README.md b/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README.md index 37e768d92d08d..4758e78c64610 100644 --- a/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README.md +++ b/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README.md @@ -316,15 +316,10 @@ impl Solution { pub fn get_words_in_longest_subsequence( n: i32, words: Vec, - groups: Vec + groups: Vec, ) -> Vec { fn check(s: &str, t: &str) -> bool { - s.len() == t.len() && - s - .chars() - .zip(t.chars()) - .filter(|(a, b)| a != b) - .count() == 1 + s.len() == t.len() && s.chars().zip(t.chars()).filter(|(a, b)| a != b).count() == 1 } let n = n as usize; diff --git a/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README_EN.md b/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README_EN.md index 981ba58cf67c2..3e2d53f6701c4 100644 --- a/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README_EN.md +++ b/solution/2900-2999/2901.Longest Unequal Adjacent Groups Subsequence II/README_EN.md @@ -331,15 +331,10 @@ impl Solution { pub fn get_words_in_longest_subsequence( n: i32, words: Vec, - groups: Vec + groups: Vec, ) -> Vec { fn check(s: &str, t: &str) -> bool { - s.len() == t.len() && - s - .chars() - .zip(t.chars()) - .filter(|(a, b)| a != b) - .count() == 1 + s.len() == t.len() && s.chars().zip(t.chars()).filter(|(a, b)| a != b).count() == 1 } let n = n as usize; diff --git a/solution/2900-2999/2904.Shortest and Lexicographically Smallest Beautiful String/README.md b/solution/2900-2999/2904.Shortest and Lexicographically Smallest Beautiful String/README.md index 39594949b2794..a418ce57883a4 100644 --- a/solution/2900-2999/2904.Shortest and Lexicographically Smallest Beautiful String/README.md +++ b/solution/2900-2999/2904.Shortest and Lexicographically Smallest Beautiful String/README.md @@ -217,9 +217,8 @@ impl Solution { for i in 0..n { for j in i + (k as usize)..=n { let t = &s[i..j]; - if - (t.matches('1').count() as i32) == k && - (ans.is_empty() || j - i < ans.len() || (j - i == ans.len() && t < &ans)) + if (t.matches('1').count() as i32) == k + && (ans.is_empty() || j - i < ans.len() || (j - i == ans.len() && t < &ans)) { ans = t.to_string(); } @@ -391,9 +390,8 @@ impl Solution { j += 1; - if - cnt == k && - (ans.is_empty() || j - i < ans.len() || (j - i == ans.len() && &s[i..j] < &ans)) + if cnt == k + && (ans.is_empty() || j - i < ans.len() || (j - i == ans.len() && &s[i..j] < &ans)) { ans = s_chars[i..j].iter().collect(); } diff --git a/solution/2900-2999/2904.Shortest and Lexicographically Smallest Beautiful String/README_EN.md b/solution/2900-2999/2904.Shortest and Lexicographically Smallest Beautiful String/README_EN.md index cef92f2bb7d1e..33650c1c3bd8b 100644 --- a/solution/2900-2999/2904.Shortest and Lexicographically Smallest Beautiful String/README_EN.md +++ b/solution/2900-2999/2904.Shortest and Lexicographically Smallest Beautiful String/README_EN.md @@ -215,9 +215,8 @@ impl Solution { for i in 0..n { for j in i + (k as usize)..=n { let t = &s[i..j]; - if - (t.matches('1').count() as i32) == k && - (ans.is_empty() || j - i < ans.len() || (j - i == ans.len() && t < &ans)) + if (t.matches('1').count() as i32) == k + && (ans.is_empty() || j - i < ans.len() || (j - i == ans.len() && t < &ans)) { ans = t.to_string(); } @@ -389,9 +388,8 @@ impl Solution { j += 1; - if - cnt == k && - (ans.is_empty() || j - i < ans.len() || (j - i == ans.len() && &s[i..j] < &ans)) + if cnt == k + && (ans.is_empty() || j - i < ans.len() || (j - i == ans.len() && &s[i..j] < &ans)) { ans = s_chars[i..j].iter().collect(); } diff --git a/solution/2900-2999/2974.Minimum Number Game/README.md b/solution/2900-2999/2974.Minimum Number Game/README.md index ac04c9f8d758f..be7563a32ac95 100644 --- a/solution/2900-2999/2974.Minimum Number Game/README.md +++ b/solution/2900-2999/2974.Minimum Number Game/README.md @@ -184,8 +184,8 @@ function numberGame(nums: number[]): number[] { #### Rust ```rust -use std::collections::BinaryHeap; use std::cmp::Reverse; +use std::collections::BinaryHeap; impl Solution { pub fn number_game(nums: Vec) -> Vec { diff --git a/solution/2900-2999/2974.Minimum Number Game/README_EN.md b/solution/2900-2999/2974.Minimum Number Game/README_EN.md index dd8a23bd05010..ea00e12d69ec4 100644 --- a/solution/2900-2999/2974.Minimum Number Game/README_EN.md +++ b/solution/2900-2999/2974.Minimum Number Game/README_EN.md @@ -182,8 +182,8 @@ function numberGame(nums: number[]): number[] { #### Rust ```rust -use std::collections::BinaryHeap; use std::cmp::Reverse; +use std::collections::BinaryHeap; impl Solution { pub fn number_game(nums: Vec) -> Vec { diff --git a/solution/CONTEST_README.md b/solution/CONTEST_README.md index 9ff9c9222103e..ddcbaaf1cfb2a 100644 --- a/solution/CONTEST_README.md +++ b/solution/CONTEST_README.md @@ -1,3191 +1,3191 @@ ---- -comments: true ---- - -# 力扣竞赛 - -[English Version](/solution/CONTEST_README_EN.md) - -## 段位与荣誉勋章 - -竞赛排名根据竞赛积分（周赛和双周赛）进行计算，注册新用户的基础分值为 1500 分，在竞赛积分 ≥1600 的用户中，根据比例 5%, 20%, 75% 设定三档段位，段位每周比赛结束后计算一次。 - -如果竞赛积分处于段位的临界值，在每周比赛结束重新计算后会出现段位升级或降级的情况。段位升级或降级后会自动替换对应的荣誉勋章。 - -| 段位 | 比例 | 段位名 | 国服分数线 | 勋章 | -| ---- | ---- | -------- | ----------- | ----------------------------------------------------------------------------------------------------------------------- | -| LV3 | 5% | Guardian | ≥2278.34 |

| -| LV2 | 20% | Knight | ≥1889.36 |

| -| LV1 | 75% | - | - | - | - -力扣竞赛 **全国排名前 10** 的用户，全站用户名展示为品牌橙色。 - -## 赛后估分网站 - -如果你想在比赛结束后估算自己的积分变化，可以访问网站 [LeetCode Contest Rating Predictor](https://lccn.lbao.site/)。 - -## 往期竞赛 - -#### 第 402 场周赛(2024-06-16 10:30, 90 分钟) 参赛人数 3283 - -- [3184. 构成整天的下标对数目 I](/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README.md) -- [3185. 构成整天的下标对数目 II](/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README.md) -- [3186. 施咒的最大总伤害](/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README.md) -- [3187. 数组中的峰值](/solution/3100-3199/3187.Peaks%20in%20Array/README.md) - -#### 第 401 场周赛(2024-06-09 10:30, 90 分钟) 参赛人数 3160 - -- [3178. 找出 K 秒后拿着球的孩子](/solution/3100-3199/3178.Find%20the%20Child%20Who%20Has%20the%20Ball%20After%20K%20Seconds/README.md) -- [3179. K 秒后第 N 个元素的值](/solution/3100-3199/3179.Find%20the%20N-th%20Value%20After%20K%20Seconds/README.md) -- [3180. 执行操作可获得的最大总奖励 I](/solution/3100-3199/3180.Maximum%20Total%20Reward%20Using%20Operations%20I/README.md) -- [3181. 执行操作可获得的最大总奖励 II](/solution/3100-3199/3181.Maximum%20Total%20Reward%20Using%20Operations%20II/README.md) - -#### 第 132 场双周赛(2024-06-08 22:30, 90 分钟) 参赛人数 2457 - -- [3174. 清除数字](/solution/3100-3199/3174.Clear%20Digits/README.md) -- [3175. 找到连续赢 K 场比赛的第一位玩家](/solution/3100-3199/3175.Find%20The%20First%20Player%20to%20win%20K%20Games%20in%20a%20Row/README.md) -- [3176. 求出最长好子序列 I](/solution/3100-3199/3176.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20I/README.md) -- [3177. 求出最长好子序列 II](/solution/3100-3199/3177.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20II/README.md) - -#### 第 400 场周赛(2024-06-02 10:30, 90 分钟) 参赛人数 3534 - -- [3168. 候诊室中的最少椅子数](/solution/3100-3199/3168.Minimum%20Number%20of%20Chairs%20in%20a%20Waiting%20Room/README.md) -- [3169. 无需开会的工作日](/solution/3100-3199/3169.Count%20Days%20Without%20Meetings/README.md) -- [3170. 删除星号以后字典序最小的字符串](/solution/3100-3199/3170.Lexicographically%20Minimum%20String%20After%20Removing%20Stars/README.md) -- [3171. 找到按位或最接近 K 的子数组](/solution/3100-3199/3171.Find%20Subarray%20With%20Bitwise%20OR%20Closest%20to%20K/README.md) - -#### 第 399 场周赛(2024-05-26 10:30, 90 分钟) 参赛人数 3424 - -- [3162. 优质数对的总数 I](/solution/3100-3199/3162.Find%20the%20Number%20of%20Good%20Pairs%20I/README.md) -- [3163. 压缩字符串 III](/solution/3100-3199/3163.String%20Compression%20III/README.md) -- [3164. 优质数对的总数 II](/solution/3100-3199/3164.Find%20the%20Number%20of%20Good%20Pairs%20II/README.md) -- [3165. 不包含相邻元素的子序列的最大和](/solution/3100-3199/3165.Maximum%20Sum%20of%20Subsequence%20With%20Non-adjacent%20Elements/README.md) - -#### 第 131 场双周赛(2024-05-25 22:30, 90 分钟) 参赛人数 2537 - -- [3158. 求出出现两次数字的 XOR 值](/solution/3100-3199/3158.Find%20the%20XOR%20of%20Numbers%20Which%20Appear%20Twice/README.md) -- [3159. 查询数组中元素的出现位置](/solution/3100-3199/3159.Find%20Occurrences%20of%20an%20Element%20in%20an%20Array/README.md) -- [3160. 所有球里面不同颜色的数目](/solution/3100-3199/3160.Find%20the%20Number%20of%20Distinct%20Colors%20Among%20the%20Balls/README.md) -- [3161. 物块放置查询](/solution/3100-3199/3161.Block%20Placement%20Queries/README.md) - -#### 第 398 场周赛(2024-05-19 10:30, 90 分钟) 参赛人数 3606 - -- [3151. 特殊数组 I](/solution/3100-3199/3151.Special%20Array%20I/README.md) -- [3152. 特殊数组 II](/solution/3100-3199/3152.Special%20Array%20II/README.md) -- [3153. 所有数对中数位不同之和](/solution/3100-3199/3153.Sum%20of%20Digit%20Differences%20of%20All%20Pairs/README.md) -- [3154. 到达第 K 级台阶的方案数](/solution/3100-3199/3154.Find%20Number%20of%20Ways%20to%20Reach%20the%20K-th%20Stair/README.md) - -#### 第 397 场周赛(2024-05-12 10:30, 90 分钟) 参赛人数 3365 - -- [3146. 两个字符串的排列差](/solution/3100-3199/3146.Permutation%20Difference%20between%20Two%20Strings/README.md) -- [3147. 从魔法师身上吸取的最大能量](/solution/3100-3199/3147.Taking%20Maximum%20Energy%20From%20the%20Mystic%20Dungeon/README.md) -- [3148. 矩阵中的最大得分](/solution/3100-3199/3148.Maximum%20Difference%20Score%20in%20a%20Grid/README.md) -- [3149. 找出分数最低的排列](/solution/3100-3199/3149.Find%20the%20Minimum%20Cost%20Array%20Permutation/README.md) - -#### 第 130 场双周赛(2024-05-11 22:30, 90 分钟) 参赛人数 2604 - -- [3142. 判断矩阵是否满足条件](/solution/3100-3199/3142.Check%20if%20Grid%20Satisfies%20Conditions/README.md) -- [3143. 正方形中的最多点数](/solution/3100-3199/3143.Maximum%20Points%20Inside%20the%20Square/README.md) -- [3144. 分割字符频率相等的最少子字符串](/solution/3100-3199/3144.Minimum%20Substring%20Partition%20of%20Equal%20Character%20Frequency/README.md) -- [3145. 大数组元素的乘积](/solution/3100-3199/3145.Find%20Products%20of%20Elements%20of%20Big%20Array/README.md) - -#### 第 396 场周赛(2024-05-05 10:30, 90 分钟) 参赛人数 2932 - -- [3136. 有效单词](/solution/3100-3199/3136.Valid%20Word/README.md) -- [3137. K 周期字符串需要的最少操作次数](/solution/3100-3199/3137.Minimum%20Number%20of%20Operations%20to%20Make%20Word%20K-Periodic/README.md) -- [3138. 同位字符串连接的最小长度](/solution/3100-3199/3138.Minimum%20Length%20of%20Anagram%20Concatenation/README.md) -- [3139. 使数组中所有元素相等的最小开销](/solution/3100-3199/3139.Minimum%20Cost%20to%20Equalize%20Array/README.md) - -#### 第 395 场周赛(2024-04-28 10:30, 90 分钟) 参赛人数 2968 - -- [3131. 找出与数组相加的整数 I](/solution/3100-3199/3131.Find%20the%20Integer%20Added%20to%20Array%20I/README.md) -- [3132. 找出与数组相加的整数 II](/solution/3100-3199/3132.Find%20the%20Integer%20Added%20to%20Array%20II/README.md) -- [3133. 数组最后一个元素的最小值](/solution/3100-3199/3133.Minimum%20Array%20End/README.md) -- [3134. 找出唯一性数组的中位数](/solution/3100-3199/3134.Find%20the%20Median%20of%20the%20Uniqueness%20Array/README.md) - -#### 第 129 场双周赛(2024-04-27 22:30, 90 分钟) 参赛人数 2510 - -- [3127. 构造相同颜色的正方形](/solution/3100-3199/3127.Make%20a%20Square%20with%20the%20Same%20Color/README.md) -- [3128. 直角三角形](/solution/3100-3199/3128.Right%20Triangles/README.md) -- [3129. 找出所有稳定的二进制数组 I](/solution/3100-3199/3129.Find%20All%20Possible%20Stable%20Binary%20Arrays%20I/README.md) -- [3130. 找出所有稳定的二进制数组 II](/solution/3100-3199/3130.Find%20All%20Possible%20Stable%20Binary%20Arrays%20II/README.md) - -#### 第 394 场周赛(2024-04-21 10:30, 90 分钟) 参赛人数 3957 - -- [3120. 统计特殊字母的数量 I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README.md) -- [3121. 统计特殊字母的数量 II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README.md) -- [3122. 使矩阵满足条件的最少操作次数](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README.md) -- [3123. 最短路径中的边](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README.md) - -#### 第 393 场周赛(2024-04-14 10:30, 90 分钟) 参赛人数 4218 - -- [3114. 替换字符可以得到的最晚时间](/solution/3100-3199/3114.Latest%20Time%20You%20Can%20Obtain%20After%20Replacing%20Characters/README.md) -- [3115. 质数的最大距离](/solution/3100-3199/3115.Maximum%20Prime%20Difference/README.md) -- [3116. 单面值组合的第 K 小金额](/solution/3100-3199/3116.Kth%20Smallest%20Amount%20With%20Single%20Denomination%20Combination/README.md) -- [3117. 划分数组得到最小的值之和](/solution/3100-3199/3117.Minimum%20Sum%20of%20Values%20by%20Dividing%20Array/README.md) - -#### 第 128 场双周赛(2024-04-13 22:30, 90 分钟) 参赛人数 2653 - -- [3110. 字符串的分数](/solution/3100-3199/3110.Score%20of%20a%20String/README.md) -- [3111. 覆盖所有点的最少矩形数目](/solution/3100-3199/3111.Minimum%20Rectangles%20to%20Cover%20Points/README.md) -- [3112. 访问消失节点的最少时间](/solution/3100-3199/3112.Minimum%20Time%20to%20Visit%20Disappearing%20Nodes/README.md) -- [3113. 边界元素是最大值的子数组数目](/solution/3100-3199/3113.Find%20the%20Number%20of%20Subarrays%20Where%20Boundary%20Elements%20Are%20Maximum/README.md) - -#### 第 392 场周赛(2024-04-07 10:30, 90 分钟) 参赛人数 3193 - -- [3105. 最长的严格递增或递减子数组](/solution/3100-3199/3105.Longest%20Strictly%20Increasing%20or%20Strictly%20Decreasing%20Subarray/README.md) -- [3106. 满足距离约束且字典序最小的字符串](/solution/3100-3199/3106.Lexicographically%20Smallest%20String%20After%20Operations%20With%20Constraint/README.md) -- [3107. 使数组中位数等于 K 的最少操作数](/solution/3100-3199/3107.Minimum%20Operations%20to%20Make%20Median%20of%20Array%20Equal%20to%20K/README.md) -- [3108. 带权图里旅途的最小代价](/solution/3100-3199/3108.Minimum%20Cost%20Walk%20in%20Weighted%20Graph/README.md) - -#### 第 391 场周赛(2024-03-31 10:30, 90 分钟) 参赛人数 4180 - -- [3099. 哈沙德数](/solution/3000-3099/3099.Harshad%20Number/README.md) -- [3100. 换水问题 II](/solution/3100-3199/3100.Water%20Bottles%20II/README.md) -- [3101. 交替子数组计数](/solution/3100-3199/3101.Count%20Alternating%20Subarrays/README.md) -- [3102. 最小化曼哈顿距离](/solution/3100-3199/3102.Minimize%20Manhattan%20Distances/README.md) - -#### 第 127 场双周赛(2024-03-30 22:30, 90 分钟) 参赛人数 2950 - -- [3095. 或值至少 K 的最短子数组 I](/solution/3000-3099/3095.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20I/README.md) -- [3096. 得到更多分数的最少关卡数目](/solution/3000-3099/3096.Minimum%20Levels%20to%20Gain%20More%20Points/README.md) -- [3097. 或值至少为 K 的最短子数组 II](/solution/3000-3099/3097.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20II/README.md) -- [3098. 求出所有子序列的能量和](/solution/3000-3099/3098.Find%20the%20Sum%20of%20Subsequence%20Powers/README.md) - -#### 第 390 场周赛(2024-03-24 10:30, 90 分钟) 参赛人数 4817 - -- [3090. 每个字符最多出现两次的最长子字符串](/solution/3000-3099/3090.Maximum%20Length%20Substring%20With%20Two%20Occurrences/README.md) -- [3091. 执行操作使数据元素之和大于等于 K](/solution/3000-3099/3091.Apply%20Operations%20to%20Make%20Sum%20of%20Array%20Greater%20Than%20or%20Equal%20to%20k/README.md) -- [3092. 最高频率的 ID](/solution/3000-3099/3092.Most%20Frequent%20IDs/README.md) -- [3093. 最长公共后缀查询](/solution/3000-3099/3093.Longest%20Common%20Suffix%20Queries/README.md) - -#### 第 389 场周赛(2024-03-17 10:30, 90 分钟) 参赛人数 4561 - -- [3083. 字符串及其反转中是否存在同一子字符串](/solution/3000-3099/3083.Existence%20of%20a%20Substring%20in%20a%20String%20and%20Its%20Reverse/README.md) -- [3084. 统计以给定字符开头和结尾的子字符串总数](/solution/3000-3099/3084.Count%20Substrings%20Starting%20and%20Ending%20with%20Given%20Character/README.md) -- [3085. 成为 K 特殊字符串需要删除的最少字符数](/solution/3000-3099/3085.Minimum%20Deletions%20to%20Make%20String%20K-Special/README.md) -- [3086. 拾起 K 个 1 需要的最少行动次数](/solution/3000-3099/3086.Minimum%20Moves%20to%20Pick%20K%20Ones/README.md) - -#### 第 126 场双周赛(2024-03-16 22:30, 90 分钟) 参赛人数 3234 - -- [3079. 求出加密整数的和](/solution/3000-3099/3079.Find%20the%20Sum%20of%20Encrypted%20Integers/README.md) -- [3080. 执行操作标记数组中的元素](/solution/3000-3099/3080.Mark%20Elements%20on%20Array%20by%20Performing%20Queries/README.md) -- [3081. 替换字符串中的问号使分数最小](/solution/3000-3099/3081.Replace%20Question%20Marks%20in%20String%20to%20Minimize%20Its%20Value/README.md) -- [3082. 求出所有子序列的能量和](/solution/3000-3099/3082.Find%20the%20Sum%20of%20the%20Power%20of%20All%20Subsequences/README.md) - -#### 第 388 场周赛(2024-03-10 10:30, 90 分钟) 参赛人数 4291 - -- [3074. 重新分装苹果](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README.md) -- [3075. 幸福值最大化的选择方案](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README.md) -- [3076. 数组中的最短非公共子字符串](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README.md) -- [3077. K 个不相交子数组的最大能量值](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README.md) - -#### 第 387 场周赛(2024-03-03 10:30, 90 分钟) 参赛人数 3694 - -- [3069. 将元素分配到两个数组中 I](/solution/3000-3099/3069.Distribute%20Elements%20Into%20Two%20Arrays%20I/README.md) -- [3070. 元素和小于等于 k 的子矩阵的数目](/solution/3000-3099/3070.Count%20Submatrices%20with%20Top-Left%20Element%20and%20Sum%20Less%20Than%20k/README.md) -- [3071. 在矩阵上写出字母 Y 所需的最少操作次数](/solution/3000-3099/3071.Minimum%20Operations%20to%20Write%20the%20Letter%20Y%20on%20a%20Grid/README.md) -- [3072. 将元素分配到两个数组中 II](/solution/3000-3099/3072.Distribute%20Elements%20Into%20Two%20Arrays%20II/README.md) - -#### 第 125 场双周赛(2024-03-02 22:30, 90 分钟) 参赛人数 2599 - -- [3065. 超过阈值的最少操作数 I](/solution/3000-3099/3065.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20I/README.md) -- [3066. 超过阈值的最少操作数 II](/solution/3000-3099/3066.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20II/README.md) -- [3067. 在带权树网络中统计可连接服务器对数目](/solution/3000-3099/3067.Count%20Pairs%20of%20Connectable%20Servers%20in%20a%20Weighted%20Tree%20Network/README.md) -- [3068. 最大节点价值之和](/solution/3000-3099/3068.Find%20the%20Maximum%20Sum%20of%20Node%20Values/README.md) - -#### 第 386 场周赛(2024-02-25 10:30, 90 分钟) 参赛人数 2731 - -- [3046. 分割数组](/solution/3000-3099/3046.Split%20the%20Array/README.md) -- [3047. 求交集区域内的最大正方形面积](/solution/3000-3099/3047.Find%20the%20Largest%20Area%20of%20Square%20Inside%20Two%20Rectangles/README.md) -- [3048. 标记所有下标的最早秒数 I](/solution/3000-3099/3048.Earliest%20Second%20to%20Mark%20Indices%20I/README.md) -- [3049. 标记所有下标的最早秒数 II](/solution/3000-3099/3049.Earliest%20Second%20to%20Mark%20Indices%20II/README.md) - -#### 第 385 场周赛(2024-02-18 10:30, 90 分钟) 参赛人数 2382 - -- [3042. 统计前后缀下标对 I](/solution/3000-3099/3042.Count%20Prefix%20and%20Suffix%20Pairs%20I/README.md) -- [3043. 最长公共前缀的长度](/solution/3000-3099/3043.Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/README.md) -- [3044. 出现频率最高的质数](/solution/3000-3099/3044.Most%20Frequent%20Prime/README.md) -- [3045. 统计前后缀下标对 II](/solution/3000-3099/3045.Count%20Prefix%20and%20Suffix%20Pairs%20II/README.md) - -#### 第 124 场双周赛(2024-02-17 22:30, 90 分钟) 参赛人数 1861 - -- [3038. 相同分数的最大操作数目 I](/solution/3000-3099/3038.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20I/README.md) -- [3039. 进行操作使字符串为空](/solution/3000-3099/3039.Apply%20Operations%20to%20Make%20String%20Empty/README.md) -- [3040. 相同分数的最大操作数目 II](/solution/3000-3099/3040.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20II/README.md) -- [3041. 修改数组后最大化数组中的连续元素数目](/solution/3000-3099/3041.Maximize%20Consecutive%20Elements%20in%20an%20Array%20After%20Modification/README.md) - -#### 第 384 场周赛(2024-02-11 10:30, 90 分钟) 参赛人数 1652 - -- [3033. 修改矩阵](/solution/3000-3099/3033.Modify%20the%20Matrix/README.md) -- [3034. 匹配模式数组的子数组数目 I](/solution/3000-3099/3034.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20I/README.md) -- [3035. 回文字符串的最大数量](/solution/3000-3099/3035.Maximum%20Palindromes%20After%20Operations/README.md) -- [3036. 匹配模式数组的子数组数目 II](/solution/3000-3099/3036.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20II/README.md) - -#### 第 383 场周赛(2024-02-04 10:30, 90 分钟) 参赛人数 2691 - -- [3028. 边界上的蚂蚁](/solution/3000-3099/3028.Ant%20on%20the%20Boundary/README.md) -- [3029. 将单词恢复初始状态所需的最短时间 I](/solution/3000-3099/3029.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20I/README.md) -- [3030. 找出网格的区域平均强度](/solution/3000-3099/3030.Find%20the%20Grid%20of%20Region%20Average/README.md) -- [3031. 将单词恢复初始状态所需的最短时间 II](/solution/3000-3099/3031.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20II/README.md) - -#### 第 123 场双周赛(2024-02-03 22:30, 90 分钟) 参赛人数 2209 - -- [3024. 三角形类型](/solution/3000-3099/3024.Type%20of%20Triangle/README.md) -- [3025. 人员站位的方案数 I](/solution/3000-3099/3025.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20I/README.md) -- [3026. 最大好子数组和](/solution/3000-3099/3026.Maximum%20Good%20Subarray%20Sum/README.md) -- [3027. 人员站位的方案数 II](/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/README.md) - -#### 第 382 场周赛(2024-01-28 10:30, 90 分钟) 参赛人数 3134 - -- [3019. 按键变更的次数](/solution/3000-3099/3019.Number%20of%20Changing%20Keys/README.md) -- [3020. 子集中元素的最大数量](/solution/3000-3099/3020.Find%20the%20Maximum%20Number%20of%20Elements%20in%20Subset/README.md) -- [3021. Alice 和 Bob 玩鲜花游戏](/solution/3000-3099/3021.Alice%20and%20Bob%20Playing%20Flower%20Game/README.md) -- [3022. 给定操作次数内使剩余元素的或值最小](/solution/3000-3099/3022.Minimize%20OR%20of%20Remaining%20Elements%20Using%20Operations/README.md) - -#### 第 381 场周赛(2024-01-21 10:30, 90 分钟) 参赛人数 3737 - -- [3014. 输入单词需要的最少按键次数 I](/solution/3000-3099/3014.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20I/README.md) -- [3015. 按距离统计房屋对数目 I](/solution/3000-3099/3015.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20I/README.md) -- [3016. 输入单词需要的最少按键次数 II](/solution/3000-3099/3016.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20II/README.md) -- [3017. 按距离统计房屋对数目 II](/solution/3000-3099/3017.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20II/README.md) - -#### 第 122 场双周赛(2024-01-20 22:30, 90 分钟) 参赛人数 2547 - -- [3010. 将数组分成最小总代价的子数组 I](/solution/3000-3099/3010.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20I/README.md) -- [3011. 判断一个数组是否可以变为有序](/solution/3000-3099/3011.Find%20if%20Array%20Can%20Be%20Sorted/README.md) -- [3012. 通过操作使数组长度最小](/solution/3000-3099/3012.Minimize%20Length%20of%20Array%20Using%20Operations/README.md) -- [3013. 将数组分成最小总代价的子数组 II](/solution/3000-3099/3013.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20II/README.md) - -#### 第 380 场周赛(2024-01-14 10:30, 90 分钟) 参赛人数 3325 - -- [3005. 最大频率元素计数](/solution/3000-3099/3005.Count%20Elements%20With%20Maximum%20Frequency/README.md) -- [3006. 找出数组中的美丽下标 I](/solution/3000-3099/3006.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I/README.md) -- [3007. 价值和小于等于 K 的最大数字](/solution/3000-3099/3007.Maximum%20Number%20That%20Sum%20of%20the%20Prices%20Is%20Less%20Than%20or%20Equal%20to%20K/README.md) -- [3008. 找出数组中的美丽下标 II](/solution/3000-3099/3008.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20II/README.md) - -#### 第 379 场周赛(2024-01-07 10:30, 90 分钟) 参赛人数 3117 - -- [3000. 对角线最长的矩形的面积](/solution/3000-3099/3000.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README.md) -- [3001. 捕获黑皇后需要的最少移动次数](/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/README.md) -- [3002. 移除后集合的最多元素数](/solution/3000-3099/3002.Maximum%20Size%20of%20a%20Set%20After%20Removals/README.md) -- [3003. 执行操作后的最大分割数量](/solution/3000-3099/3003.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README.md) - -#### 第 121 场双周赛(2024-01-06 22:30, 90 分钟) 参赛人数 2218 - -- [2996. 大于等于顺序前缀和的最小缺失整数](/solution/2900-2999/2996.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README.md) -- [2997. 使数组异或和等于 K 的最少操作次数](/solution/2900-2999/2997.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README.md) -- [2998. 使 X 和 Y 相等的最少操作次数](/solution/2900-2999/2998.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README.md) -- [2999. 统计强大整数的数目](/solution/2900-2999/2999.Count%20the%20Number%20of%20Powerful%20Integers/README.md) - -#### 第 378 场周赛(2023-12-31 10:30, 90 分钟) 参赛人数 2747 - -- [2980. 检查按位或是否存在尾随零](/solution/2900-2999/2980.Check%20if%20Bitwise%20OR%20Has%20Trailing%20Zeros/README.md) -- [2981. 找出出现至少三次的最长特殊子字符串 I](/solution/2900-2999/2981.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20I/README.md) -- [2982. 找出出现至少三次的最长特殊子字符串 II](/solution/2900-2999/2982.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20II/README.md) -- [2983. 回文串重新排列查询](/solution/2900-2999/2983.Palindrome%20Rearrangement%20Queries/README.md) - -#### 第 377 场周赛(2023-12-24 10:30, 90 分钟) 参赛人数 3148 - -- [2974. 最小数字游戏](/solution/2900-2999/2974.Minimum%20Number%20Game/README.md) -- [2975. 移除栅栏得到的正方形田地的最大面积](/solution/2900-2999/2975.Maximum%20Square%20Area%20by%20Removing%20Fences%20From%20a%20Field/README.md) -- [2976. 转换字符串的最小成本 I](/solution/2900-2999/2976.Minimum%20Cost%20to%20Convert%20String%20I/README.md) -- [2977. 转换字符串的最小成本 II](/solution/2900-2999/2977.Minimum%20Cost%20to%20Convert%20String%20II/README.md) - -#### 第 120 场双周赛(2023-12-23 22:30, 90 分钟) 参赛人数 2542 - -- [2970. 统计移除递增子数组的数目 I](/solution/2900-2999/2970.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README.md) -- [2971. 找到最大周长的多边形](/solution/2900-2999/2971.Find%20Polygon%20With%20the%20Largest%20Perimeter/README.md) -- [2972. 统计移除递增子数组的数目 II](/solution/2900-2999/2972.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README.md) -- [2973. 树中每个节点放置的金币数目](/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README.md) - -#### 第 376 场周赛(2023-12-17 10:30, 90 分钟) 参赛人数 3409 - -- [2965. 找出缺失和重复的数字](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README.md) -- [2966. 划分数组并满足最大差限制](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README.md) -- [2967. 使数组成为等数数组的最小代价](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README.md) -- [2968. 执行操作使频率分数最大](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README.md) - -#### 第 375 场周赛(2023-12-10 10:30, 90 分钟) 参赛人数 3518 - -- [2960. 统计已测试设备](/solution/2900-2999/2960.Count%20Tested%20Devices%20After%20Test%20Operations/README.md) -- [2961. 双模幂运算](/solution/2900-2999/2961.Double%20Modular%20Exponentiation/README.md) -- [2962. 统计最大元素出现至少 K 次的子数组](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README.md) -- [2963. 统计好分割方案的数目](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README.md) - -#### 第 119 场双周赛(2023-12-09 22:30, 90 分钟) 参赛人数 2472 - -- [2956. 找到两个数组中的公共元素](/solution/2900-2999/2956.Find%20Common%20Elements%20Between%20Two%20Arrays/README.md) -- [2957. 消除相邻近似相等字符](/solution/2900-2999/2957.Remove%20Adjacent%20Almost-Equal%20Characters/README.md) -- [2958. 最多 K 个重复元素的最长子数组](/solution/2900-2999/2958.Length%20of%20Longest%20Subarray%20With%20at%20Most%20K%20Frequency/README.md) -- [2959. 关闭分部的可行集合数目](/solution/2900-2999/2959.Number%20of%20Possible%20Sets%20of%20Closing%20Branches/README.md) - -#### 第 374 场周赛(2023-12-03 10:30, 90 分钟) 参赛人数 4053 - -- [2951. 找出峰值](/solution/2900-2999/2951.Find%20the%20Peaks/README.md) -- [2952. 需要添加的硬币的最小数量](/solution/2900-2999/2952.Minimum%20Number%20of%20Coins%20to%20be%20Added/README.md) -- [2953. 统计完全子字符串](/solution/2900-2999/2953.Count%20Complete%20Substrings/README.md) -- [2954. 统计感冒序列的数目](/solution/2900-2999/2954.Count%20the%20Number%20of%20Infection%20Sequences/README.md) - -#### 第 373 场周赛(2023-11-26 10:30, 90 分钟) 参赛人数 3577 - -- [2946. 循环移位后的矩阵相似检查](/solution/2900-2999/2946.Matrix%20Similarity%20After%20Cyclic%20Shifts/README.md) -- [2947. 统计美丽子字符串 I](/solution/2900-2999/2947.Count%20Beautiful%20Substrings%20I/README.md) -- [2948. 交换得到字典序最小的数组](/solution/2900-2999/2948.Make%20Lexicographically%20Smallest%20Array%20by%20Swapping%20Elements/README.md) -- [2949. 统计美丽子字符串 II](/solution/2900-2999/2949.Count%20Beautiful%20Substrings%20II/README.md) - -#### 第 118 场双周赛(2023-11-25 22:30, 90 分钟) 参赛人数 2425 - -- [2942. 查找包含给定字符的单词](/solution/2900-2999/2942.Find%20Words%20Containing%20Character/README.md) -- [2943. 最大化网格图中正方形空洞的面积](/solution/2900-2999/2943.Maximize%20Area%20of%20Square%20Hole%20in%20Grid/README.md) -- [2944. 购买水果需要的最少金币数](/solution/2900-2999/2944.Minimum%20Number%20of%20Coins%20for%20Fruits/README.md) -- [2945. 找到最大非递减数组的长度](/solution/2900-2999/2945.Find%20Maximum%20Non-decreasing%20Array%20Length/README.md) - -#### 第 372 场周赛(2023-11-19 10:30, 90 分钟) 参赛人数 3920 - -- [2937. 使三个字符串相等](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README.md) -- [2938. 区分黑球与白球](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README.md) -- [2939. 最大异或乘积](/solution/2900-2999/2939.Maximum%20Xor%20Product/README.md) -- [2940. 找到 Alice 和 Bob 可以相遇的建筑](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README.md) - -#### 第 371 场周赛(2023-11-12 10:30, 90 分钟) 参赛人数 3638 - -- [2932. 找出强数对的最大异或值 I](/solution/2900-2999/2932.Maximum%20Strong%20Pair%20XOR%20I/README.md) -- [2933. 高访问员工](/solution/2900-2999/2933.High-Access%20Employees/README.md) -- [2934. 最大化数组末位元素的最少操作次数](/solution/2900-2999/2934.Minimum%20Operations%20to%20Maximize%20Last%20Elements%20in%20Arrays/README.md) -- [2935. 找出强数对的最大异或值 II](/solution/2900-2999/2935.Maximum%20Strong%20Pair%20XOR%20II/README.md) - -#### 第 117 场双周赛(2023-11-11 22:30, 90 分钟) 参赛人数 2629 - -- [2928. 给小朋友们分糖果 I](/solution/2900-2999/2928.Distribute%20Candies%20Among%20Children%20I/README.md) -- [2929. 给小朋友们分糖果 II](/solution/2900-2999/2929.Distribute%20Candies%20Among%20Children%20II/README.md) -- [2930. 重新排列后包含指定子字符串的字符串数目](/solution/2900-2999/2930.Number%20of%20Strings%20Which%20Can%20Be%20Rearranged%20to%20Contain%20Substring/README.md) -- [2931. 购买物品的最大开销](/solution/2900-2999/2931.Maximum%20Spending%20After%20Buying%20Items/README.md) - -#### 第 370 场周赛(2023-11-05 10:30, 90 分钟) 参赛人数 3983 - -- [2923. 找到冠军 I](/solution/2900-2999/2923.Find%20Champion%20I/README.md) -- [2924. 找到冠军 II](/solution/2900-2999/2924.Find%20Champion%20II/README.md) -- [2925. 在树上执行操作以后得到的最大分数](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README.md) -- [2926. 平衡子序列的最大和](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README.md) - -#### 第 369 场周赛(2023-10-29 10:30, 90 分钟) 参赛人数 4121 - -- [2917. 找出数组中的 K-or 值](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README.md) -- [2918. 数组的最小相等和](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README.md) -- [2919. 使数组变美的最小增量运算数](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README.md) -- [2920. 收集所有金币可获得的最大积分](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README.md) - -#### 第 116 场双周赛(2023-10-28 22:30, 90 分钟) 参赛人数 2904 - -- [2913. 子数组不同元素数目的平方和 I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README.md) -- [2914. 使二进制字符串变美丽的最少修改次数](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README.md) -- [2915. 和为目标值的最长子序列的长度](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README.md) -- [2916. 子数组不同元素数目的平方和 II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README.md) - -#### 第 368 场周赛(2023-10-22 10:30, 90 分钟) 参赛人数 5002 - -- [2908. 元素和最小的山形三元组 I](/solution/2900-2999/2908.Minimum%20Sum%20of%20Mountain%20Triplets%20I/README.md) -- [2909. 元素和最小的山形三元组 II](/solution/2900-2999/2909.Minimum%20Sum%20of%20Mountain%20Triplets%20II/README.md) -- [2910. 合法分组的最少组数](/solution/2900-2999/2910.Minimum%20Number%20of%20Groups%20to%20Create%20a%20Valid%20Assignment/README.md) -- [2911. 得到 K 个半回文串的最少修改次数](/solution/2900-2999/2911.Minimum%20Changes%20to%20Make%20K%20Semi-palindromes/README.md) - -#### 第 367 场周赛(2023-10-15 10:30, 90 分钟) 参赛人数 4317 - -- [2903. 找出满足差值条件的下标 I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README.md) -- [2904. 最短且字典序最小的美丽子字符串](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README.md) -- [2905. 找出满足差值条件的下标 II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README.md) -- [2906. 构造乘积矩阵](/solution/2900-2999/2906.Construct%20Product%20Matrix/README.md) - -#### 第 115 场双周赛(2023-10-14 22:30, 90 分钟) 参赛人数 2809 - -- [2899. 上一个遍历的整数](/solution/2800-2899/2899.Last%20Visited%20Integers/README.md) -- [2900. 最长相邻不相等子序列 I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README.md) -- [2901. 最长相邻不相等子序列 II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README.md) -- [2902. 和带限制的子多重集合的数目](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README.md) - -#### 第 366 场周赛(2023-10-08 10:30, 90 分钟) 参赛人数 2790 - -- [2894. 分类求和并作差](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README.md) -- [2895. 最小处理时间](/solution/2800-2899/2895.Minimum%20Processing%20Time/README.md) -- [2896. 执行操作使两个字符串相等](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README.md) -- [2897. 对数组执行操作使平方和最大](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README.md) - -#### 第 365 场周赛(2023-10-01 10:30, 90 分钟) 参赛人数 2909 - -- [2873. 有序三元组中的最大值 I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README.md) -- [2874. 有序三元组中的最大值 II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README.md) -- [2875. 无限数组的最短子数组](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README.md) -- [2876. 有向图访问计数](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README.md) - -#### 第 114 场双周赛(2023-09-30 22:30, 90 分钟) 参赛人数 2406 - -- [2869. 收集元素的最少操作次数](/solution/2800-2899/2869.Minimum%20Operations%20to%20Collect%20Elements/README.md) -- [2870. 使数组为空的最少操作次数](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README.md) -- [2871. 将数组分割成最多数目的子数组](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README.md) -- [2872. 可以被 K 整除连通块的最大数目](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README.md) - -#### 第 364 场周赛(2023-09-24 10:30, 90 分钟) 参赛人数 4304 - -- [2864. 最大二进制奇数](/solution/2800-2899/2864.Maximum%20Odd%20Binary%20Number/README.md) -- [2865. 美丽塔 I](/solution/2800-2899/2865.Beautiful%20Towers%20I/README.md) -- [2866. 美丽塔 II](/solution/2800-2899/2866.Beautiful%20Towers%20II/README.md) -- [2867. 统计树中的合法路径数目](/solution/2800-2899/2867.Count%20Valid%20Paths%20in%20a%20Tree/README.md) - -#### 第 363 场周赛(2023-09-17 10:30, 90 分钟) 参赛人数 4768 - -- [2859. 计算 K 置位下标对应元素的和](/solution/2800-2899/2859.Sum%20of%20Values%20at%20Indices%20With%20K%20Set%20Bits/README.md) -- [2860. 让所有学生保持开心的分组方法数](/solution/2800-2899/2860.Happy%20Students/README.md) -- [2861. 最大合金数](/solution/2800-2899/2861.Maximum%20Number%20of%20Alloys/README.md) -- [2862. 完全子集的最大元素和](/solution/2800-2899/2862.Maximum%20Element-Sum%20of%20a%20Complete%20Subset%20of%20Indices/README.md) - -#### 第 113 场双周赛(2023-09-16 22:30, 90 分钟) 参赛人数 3028 - -- [2855. 使数组成为递增数组的最少右移次数](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README.md) -- [2856. 删除数对后的最小数组长度](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README.md) -- [2857. 统计距离为 k 的点对](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README.md) -- [2858. 可以到达每一个节点的最少边反转次数](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README.md) - -#### 第 362 场周赛(2023-09-10 10:30, 90 分钟) 参赛人数 4800 - -- [2848. 与车相交的点](/solution/2800-2899/2848.Points%20That%20Intersect%20With%20Cars/README.md) -- [2849. 判断能否在给定时间到达单元格](/solution/2800-2899/2849.Determine%20if%20a%20Cell%20Is%20Reachable%20at%20a%20Given%20Time/README.md) -- [2850. 将石头分散到网格图的最少移动次数](/solution/2800-2899/2850.Minimum%20Moves%20to%20Spread%20Stones%20Over%20Grid/README.md) -- [2851. 字符串转换](/solution/2800-2899/2851.String%20Transformation/README.md) - -#### 第 361 场周赛(2023-09-03 10:30, 90 分钟) 参赛人数 4170 - -- [2843. 统计对称整数的数目](/solution/2800-2899/2843.Count%20Symmetric%20Integers/README.md) -- [2844. 生成特殊数字的最少操作](/solution/2800-2899/2844.Minimum%20Operations%20to%20Make%20a%20Special%20Number/README.md) -- [2845. 统计趣味子数组的数目](/solution/2800-2899/2845.Count%20of%20Interesting%20Subarrays/README.md) -- [2846. 边权重均等查询](/solution/2800-2899/2846.Minimum%20Edge%20Weight%20Equilibrium%20Queries%20in%20a%20Tree/README.md) - -#### 第 112 场双周赛(2023-09-02 22:30, 90 分钟) 参赛人数 2900 - -- [2839. 判断通过操作能否让字符串相等 I](/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README.md) -- [2840. 判断通过操作能否让字符串相等 II](/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README.md) -- [2841. 几乎唯一子数组的最大和](/solution/2800-2899/2841.Maximum%20Sum%20of%20Almost%20Unique%20Subarray/README.md) -- [2842. 统计一个字符串的 k 子序列美丽值最大的数目](/solution/2800-2899/2842.Count%20K-Subsequences%20of%20a%20String%20With%20Maximum%20Beauty/README.md) - -#### 第 360 场周赛(2023-08-27 10:30, 90 分钟) 参赛人数 4496 - -- [2833. 距离原点最远的点](/solution/2800-2899/2833.Furthest%20Point%20From%20Origin/README.md) -- [2834. 找出美丽数组的最小和](/solution/2800-2899/2834.Find%20the%20Minimum%20Possible%20Sum%20of%20a%20Beautiful%20Array/README.md) -- [2835. 使子序列的和等于目标的最少操作次数](/solution/2800-2899/2835.Minimum%20Operations%20to%20Form%20Subsequence%20With%20Target%20Sum/README.md) -- [2836. 在传球游戏中最大化函数值](/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README.md) - -#### 第 359 场周赛(2023-08-20 10:30, 90 分钟) 参赛人数 4101 - -- [2828. 判别首字母缩略词](/solution/2800-2899/2828.Check%20if%20a%20String%20Is%20an%20Acronym%20of%20Words/README.md) -- [2829. k-avoiding 数组的最小总和](/solution/2800-2899/2829.Determine%20the%20Minimum%20Sum%20of%20a%20k-avoiding%20Array/README.md) -- [2830. 销售利润最大化](/solution/2800-2899/2830.Maximize%20the%20Profit%20as%20the%20Salesman/README.md) -- [2831. 找出最长等值子数组](/solution/2800-2899/2831.Find%20the%20Longest%20Equal%20Subarray/README.md) - -#### 第 111 场双周赛(2023-08-19 22:30, 90 分钟) 参赛人数 2787 - -- [2824. 统计和小于目标的下标对数目](/solution/2800-2899/2824.Count%20Pairs%20Whose%20Sum%20is%20Less%20than%20Target/README.md) -- [2825. 循环增长使字符串子序列等于另一个字符串](/solution/2800-2899/2825.Make%20String%20a%20Subsequence%20Using%20Cyclic%20Increments/README.md) -- [2826. 将三个组排序](/solution/2800-2899/2826.Sorting%20Three%20Groups/README.md) -- [2827. 范围中美丽整数的数目](/solution/2800-2899/2827.Number%20of%20Beautiful%20Integers%20in%20the%20Range/README.md) - -#### 第 358 场周赛(2023-08-13 10:30, 90 分钟) 参赛人数 4475 - -- [2815. 数组中的最大数对和](/solution/2800-2899/2815.Max%20Pair%20Sum%20in%20an%20Array/README.md) -- [2816. 翻倍以链表形式表示的数字](/solution/2800-2899/2816.Double%20a%20Number%20Represented%20as%20a%20Linked%20List/README.md) -- [2817. 限制条件下元素之间的最小绝对差](/solution/2800-2899/2817.Minimum%20Absolute%20Difference%20Between%20Elements%20With%20Constraint/README.md) -- [2818. 操作使得分最大](/solution/2800-2899/2818.Apply%20Operations%20to%20Maximize%20Score/README.md) - -#### 第 357 场周赛(2023-08-06 10:30, 90 分钟) 参赛人数 4265 - -- [2810. 故障键盘](/solution/2800-2899/2810.Faulty%20Keyboard/README.md) -- [2811. 判断是否能拆分数组](/solution/2800-2899/2811.Check%20if%20it%20is%20Possible%20to%20Split%20Array/README.md) -- [2812. 找出最安全路径](/solution/2800-2899/2812.Find%20the%20Safest%20Path%20in%20a%20Grid/README.md) -- [2813. 子序列最大优雅度](/solution/2800-2899/2813.Maximum%20Elegance%20of%20a%20K-Length%20Subsequence/README.md) - -#### 第 110 场双周赛(2023-08-05 22:30, 90 分钟) 参赛人数 2546 - -- [2806. 取整购买后的账户余额](/solution/2800-2899/2806.Account%20Balance%20After%20Rounded%20Purchase/README.md) -- [2807. 在链表中插入最大公约数](/solution/2800-2899/2807.Insert%20Greatest%20Common%20Divisors%20in%20Linked%20List/README.md) -- [2808. 使循环数组所有元素相等的最少秒数](/solution/2800-2899/2808.Minimum%20Seconds%20to%20Equalize%20a%20Circular%20Array/README.md) -- [2809. 使数组和小于等于 x 的最少时间](/solution/2800-2899/2809.Minimum%20Time%20to%20Make%20Array%20Sum%20At%20Most%20x/README.md) - -#### 第 356 场周赛(2023-07-30 10:30, 90 分钟) 参赛人数 4082 - -- [2798. 满足目标工作时长的员工数目](/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README.md) -- [2799. 统计完全子数组的数目](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README.md) -- [2800. 包含三个字符串的最短字符串](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README.md) -- [2801. 统计范围内的步进数字数目](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README.md) - -#### 第 355 场周赛(2023-07-23 10:30, 90 分钟) 参赛人数 4112 - -- [2788. 按分隔符拆分字符串](/solution/2700-2799/2788.Split%20Strings%20by%20Separator/README.md) -- [2789. 合并后数组中的最大元素](/solution/2700-2799/2789.Largest%20Element%20in%20an%20Array%20after%20Merge%20Operations/README.md) -- [2790. 长度递增组的最大数目](/solution/2700-2799/2790.Maximum%20Number%20of%20Groups%20With%20Increasing%20Length/README.md) -- [2791. 树中可以形成回文的路径数](/solution/2700-2799/2791.Count%20Paths%20That%20Can%20Form%20a%20Palindrome%20in%20a%20Tree/README.md) - -#### 第 109 场双周赛(2023-07-22 22:30, 90 分钟) 参赛人数 2461 - -- [2784. 检查数组是否是好的](/solution/2700-2799/2784.Check%20if%20Array%20is%20Good/README.md) -- [2785. 将字符串中的元音字母排序](/solution/2700-2799/2785.Sort%20Vowels%20in%20a%20String/README.md) -- [2786. 访问数组中的位置使分数最大](/solution/2700-2799/2786.Visit%20Array%20Positions%20to%20Maximize%20Score/README.md) -- [2787. 将一个数字表示成幂的和的方案数](/solution/2700-2799/2787.Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers/README.md) - -#### 第 354 场周赛(2023-07-16 10:30, 90 分钟) 参赛人数 3957 - -- [2778. 特殊元素平方和](/solution/2700-2799/2778.Sum%20of%20Squares%20of%20Special%20Elements/README.md) -- [2779. 数组的最大美丽值](/solution/2700-2799/2779.Maximum%20Beauty%20of%20an%20Array%20After%20Applying%20Operation/README.md) -- [2780. 合法分割的最小下标](/solution/2700-2799/2780.Minimum%20Index%20of%20a%20Valid%20Split/README.md) -- [2781. 最长合法子字符串的长度](/solution/2700-2799/2781.Length%20of%20the%20Longest%20Valid%20Substring/README.md) - -#### 第 353 场周赛(2023-07-09 10:30, 90 分钟) 参赛人数 4113 - -- [2769. 找出最大的可达成数字](/solution/2700-2799/2769.Find%20the%20Maximum%20Achievable%20Number/README.md) -- [2770. 达到末尾下标所需的最大跳跃次数](/solution/2700-2799/2770.Maximum%20Number%20of%20Jumps%20to%20Reach%20the%20Last%20Index/README.md) -- [2771. 构造最长非递减子数组](/solution/2700-2799/2771.Longest%20Non-decreasing%20Subarray%20From%20Two%20Arrays/README.md) -- [2772. 使数组中的所有元素都等于零](/solution/2700-2799/2772.Apply%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%20Zero/README.md) - -#### 第 108 场双周赛(2023-07-08 22:30, 90 分钟) 参赛人数 2349 - -- [2765. 最长交替子数组](/solution/2700-2799/2765.Longest%20Alternating%20Subarray/README.md) -- [2766. 重新放置石块](/solution/2700-2799/2766.Relocate%20Marbles/README.md) -- [2767. 将字符串分割为最少的美丽子字符串](/solution/2700-2799/2767.Partition%20String%20Into%20Minimum%20Beautiful%20Substrings/README.md) -- [2768. 黑格子的数目](/solution/2700-2799/2768.Number%20of%20Black%20Blocks/README.md) - -#### 第 352 场周赛(2023-07-02 10:30, 90 分钟) 参赛人数 3437 - -- [2760. 最长奇偶子数组](/solution/2700-2799/2760.Longest%20Even%20Odd%20Subarray%20With%20Threshold/README.md) -- [2761. 和等于目标值的质数对](/solution/2700-2799/2761.Prime%20Pairs%20With%20Target%20Sum/README.md) -- [2762. 不间断子数组](/solution/2700-2799/2762.Continuous%20Subarrays/README.md) -- [2763. 所有子数组中不平衡数字之和](/solution/2700-2799/2763.Sum%20of%20Imbalance%20Numbers%20of%20All%20Subarrays/README.md) - -#### 第 351 场周赛(2023-06-25 10:30, 90 分钟) 参赛人数 2471 - -- [2748. 美丽下标对的数目](/solution/2700-2799/2748.Number%20of%20Beautiful%20Pairs/README.md) -- [2749. 得到整数零需要执行的最少操作数](/solution/2700-2799/2749.Minimum%20Operations%20to%20Make%20the%20Integer%20Zero/README.md) -- [2750. 将数组划分成若干好子数组的方式](/solution/2700-2799/2750.Ways%20to%20Split%20Array%20Into%20Good%20Subarrays/README.md) -- [2751. 机器人碰撞](/solution/2700-2799/2751.Robot%20Collisions/README.md) - -#### 第 107 场双周赛(2023-06-24 22:30, 90 分钟) 参赛人数 1870 - -- [2744. 最大字符串配对数目](/solution/2700-2799/2744.Find%20Maximum%20Number%20of%20String%20Pairs/README.md) -- [2745. 构造最长的新字符串](/solution/2700-2799/2745.Construct%20the%20Longest%20New%20String/README.md) -- [2746. 字符串连接删减字母](/solution/2700-2799/2746.Decremental%20String%20Concatenation/README.md) -- [2747. 统计没有收到请求的服务器数目](/solution/2700-2799/2747.Count%20Zero%20Request%20Servers/README.md) - -#### 第 350 场周赛(2023-06-18 10:30, 90 分钟) 参赛人数 3580 - -- [2739. 总行驶距离](/solution/2700-2799/2739.Total%20Distance%20Traveled/README.md) -- [2740. 找出分区值](/solution/2700-2799/2740.Find%20the%20Value%20of%20the%20Partition/README.md) -- [2741. 特别的排列](/solution/2700-2799/2741.Special%20Permutations/README.md) -- [2742. 给墙壁刷油漆](/solution/2700-2799/2742.Painting%20the%20Walls/README.md) - -#### 第 349 场周赛(2023-06-11 10:30, 90 分钟) 参赛人数 3714 - -- [2733. 既不是最小值也不是最大值](/solution/2700-2799/2733.Neither%20Minimum%20nor%20Maximum/README.md) -- [2734. 执行子串操作后的字典序最小字符串](/solution/2700-2799/2734.Lexicographically%20Smallest%20String%20After%20Substring%20Operation/README.md) -- [2735. 收集巧克力](/solution/2700-2799/2735.Collecting%20Chocolates/README.md) -- [2736. 最大和查询](/solution/2700-2799/2736.Maximum%20Sum%20Queries/README.md) - -#### 第 106 场双周赛(2023-06-10 22:30, 90 分钟) 参赛人数 2346 - -- [2729. 判断一个数是否迷人](/solution/2700-2799/2729.Check%20if%20The%20Number%20is%20Fascinating/README.md) -- [2730. 找到最长的半重复子字符串](/solution/2700-2799/2730.Find%20the%20Longest%20Semi-Repetitive%20Substring/README.md) -- [2731. 移动机器人](/solution/2700-2799/2731.Movement%20of%20Robots/README.md) -- [2732. 找到矩阵中的好子集](/solution/2700-2799/2732.Find%20a%20Good%20Subset%20of%20the%20Matrix/README.md) - -#### 第 348 场周赛(2023-06-04 10:30, 90 分钟) 参赛人数 3909 - -- [2716. 最小化字符串长度](/solution/2700-2799/2716.Minimize%20String%20Length/README.md) -- [2717. 半有序排列](/solution/2700-2799/2717.Semi-Ordered%20Permutation/README.md) -- [2718. 查询后矩阵的和](/solution/2700-2799/2718.Sum%20of%20Matrix%20After%20Queries/README.md) -- [2719. 统计整数数目](/solution/2700-2799/2719.Count%20of%20Integers/README.md) - -#### 第 347 场周赛(2023-05-28 10:30, 90 分钟) 参赛人数 3836 - -- [2710. 移除字符串中的尾随零](/solution/2700-2799/2710.Remove%20Trailing%20Zeros%20From%20a%20String/README.md) -- [2711. 对角线上不同值的数量差](/solution/2700-2799/2711.Difference%20of%20Number%20of%20Distinct%20Values%20on%20Diagonals/README.md) -- [2712. 使所有字符相等的最小成本](/solution/2700-2799/2712.Minimum%20Cost%20to%20Make%20All%20Characters%20Equal/README.md) -- [2713. 矩阵中严格递增的单元格数](/solution/2700-2799/2713.Maximum%20Strictly%20Increasing%20Cells%20in%20a%20Matrix/README.md) - -#### 第 105 场双周赛(2023-05-27 22:30, 90 分钟) 参赛人数 2604 - -- [2706. 购买两块巧克力](/solution/2700-2799/2706.Buy%20Two%20Chocolates/README.md) -- [2707. 字符串中的额外字符](/solution/2700-2799/2707.Extra%20Characters%20in%20a%20String/README.md) -- [2708. 一个小组的最大实力值](/solution/2700-2799/2708.Maximum%20Strength%20of%20a%20Group/README.md) -- [2709. 最大公约数遍历](/solution/2700-2799/2709.Greatest%20Common%20Divisor%20Traversal/README.md) - -#### 第 346 场周赛(2023-05-21 10:30, 90 分钟) 参赛人数 4035 - -- [2696. 删除子串后的字符串最小长度](/solution/2600-2699/2696.Minimum%20String%20Length%20After%20Removing%20Substrings/README.md) -- [2697. 字典序最小回文串](/solution/2600-2699/2697.Lexicographically%20Smallest%20Palindrome/README.md) -- [2698. 求一个整数的惩罚数](/solution/2600-2699/2698.Find%20the%20Punishment%20Number%20of%20an%20Integer/README.md) -- [2699. 修改图中的边权](/solution/2600-2699/2699.Modify%20Graph%20Edge%20Weights/README.md) - -#### 第 345 场周赛(2023-05-14 10:30, 90 分钟) 参赛人数 4165 - -- [2682. 找出转圈游戏输家](/solution/2600-2699/2682.Find%20the%20Losers%20of%20the%20Circular%20Game/README.md) -- [2683. 相邻值的按位异或](/solution/2600-2699/2683.Neighboring%20Bitwise%20XOR/README.md) -- [2684. 矩阵中移动的最大次数](/solution/2600-2699/2684.Maximum%20Number%20of%20Moves%20in%20a%20Grid/README.md) -- [2685. 统计完全连通分量的数量](/solution/2600-2699/2685.Count%20the%20Number%20of%20Complete%20Components/README.md) - -#### 第 104 场双周赛(2023-05-13 22:30, 90 分钟) 参赛人数 2519 - -- [2678. 老人的数目](/solution/2600-2699/2678.Number%20of%20Senior%20Citizens/README.md) -- [2679. 矩阵中的和](/solution/2600-2699/2679.Sum%20in%20a%20Matrix/README.md) -- [2680. 最大或值](/solution/2600-2699/2680.Maximum%20OR/README.md) -- [2681. 英雄的力量](/solution/2600-2699/2681.Power%20of%20Heroes/README.md) - -#### 第 344 场周赛(2023-05-07 10:30, 90 分钟) 参赛人数 3986 - -- [2670. 找出不同元素数目差数组](/solution/2600-2699/2670.Find%20the%20Distinct%20Difference%20Array/README.md) -- [2671. 频率跟踪器](/solution/2600-2699/2671.Frequency%20Tracker/README.md) -- [2672. 有相同颜色的相邻元素数目](/solution/2600-2699/2672.Number%20of%20Adjacent%20Elements%20With%20the%20Same%20Color/README.md) -- [2673. 使二叉树所有路径值相等的最小代价](/solution/2600-2699/2673.Make%20Costs%20of%20Paths%20Equal%20in%20a%20Binary%20Tree/README.md) - -#### 第 343 场周赛(2023-04-30 10:30, 90 分钟) 参赛人数 3313 - -- [2660. 保龄球游戏的获胜者](/solution/2600-2699/2660.Determine%20the%20Winner%20of%20a%20Bowling%20Game/README.md) -- [2661. 找出叠涂元素](/solution/2600-2699/2661.First%20Completely%20Painted%20Row%20or%20Column/README.md) -- [2662. 前往目标的最小代价](/solution/2600-2699/2662.Minimum%20Cost%20of%20a%20Path%20With%20Special%20Roads/README.md) -- [2663. 字典序最小的美丽字符串](/solution/2600-2699/2663.Lexicographically%20Smallest%20Beautiful%20String/README.md) - -#### 第 103 场双周赛(2023-04-29 22:30, 90 分钟) 参赛人数 2299 - -- [2656. K 个元素的最大和](/solution/2600-2699/2656.Maximum%20Sum%20With%20Exactly%20K%20Elements/README.md) -- [2657. 找到两个数组的前缀公共数组](/solution/2600-2699/2657.Find%20the%20Prefix%20Common%20Array%20of%20Two%20Arrays/README.md) -- [2658. 网格图中鱼的最大数目](/solution/2600-2699/2658.Maximum%20Number%20of%20Fish%20in%20a%20Grid/README.md) -- [2659. 将数组清空](/solution/2600-2699/2659.Make%20Array%20Empty/README.md) - -#### 第 342 场周赛(2023-04-23 10:30, 90 分钟) 参赛人数 3702 - -- [2651. 计算列车到站时间](/solution/2600-2699/2651.Calculate%20Delayed%20Arrival%20Time/README.md) -- [2652. 倍数求和](/solution/2600-2699/2652.Sum%20Multiples/README.md) -- [2653. 滑动子数组的美丽值](/solution/2600-2699/2653.Sliding%20Subarray%20Beauty/README.md) -- [2654. 使数组所有元素变成 1 的最少操作次数](/solution/2600-2699/2654.Minimum%20Number%20of%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%201/README.md) - -#### 第 341 场周赛(2023-04-16 10:30, 90 分钟) 参赛人数 4792 - -- [2643. 一最多的行](/solution/2600-2699/2643.Row%20With%20Maximum%20Ones/README.md) -- [2644. 找出可整除性得分最大的整数](/solution/2600-2699/2644.Find%20the%20Maximum%20Divisibility%20Score/README.md) -- [2645. 构造有效字符串的最少插入数](/solution/2600-2699/2645.Minimum%20Additions%20to%20Make%20Valid%20String/README.md) -- [2646. 最小化旅行的价格总和](/solution/2600-2699/2646.Minimize%20the%20Total%20Price%20of%20the%20Trips/README.md) - -#### 第 102 场双周赛(2023-04-15 22:30, 90 分钟) 参赛人数 3058 - -- [2639. 查询网格图中每一列的宽度](/solution/2600-2699/2639.Find%20the%20Width%20of%20Columns%20of%20a%20Grid/README.md) -- [2640. 一个数组所有前缀的分数](/solution/2600-2699/2640.Find%20the%20Score%20of%20All%20Prefixes%20of%20an%20Array/README.md) -- [2641. 二叉树的堂兄弟节点 II](/solution/2600-2699/2641.Cousins%20in%20Binary%20Tree%20II/README.md) -- [2642. 设计可以求最短路径的图类](/solution/2600-2699/2642.Design%20Graph%20With%20Shortest%20Path%20Calculator/README.md) - -#### 第 340 场周赛(2023-04-09 10:30, 90 分钟) 参赛人数 4937 - -- [2614. 对角线上的质数](/solution/2600-2699/2614.Prime%20In%20Diagonal/README.md) -- [2615. 等值距离和](/solution/2600-2699/2615.Sum%20of%20Distances/README.md) -- [2616. 最小化数对的最大差值](/solution/2600-2699/2616.Minimize%20the%20Maximum%20Difference%20of%20Pairs/README.md) -- [2617. 网格图中最少访问的格子数](/solution/2600-2699/2617.Minimum%20Number%20of%20Visited%20Cells%20in%20a%20Grid/README.md) - -#### 第 339 场周赛(2023-04-02 10:30, 90 分钟) 参赛人数 5180 - -- [2609. 最长平衡子字符串](/solution/2600-2699/2609.Find%20the%20Longest%20Balanced%20Substring%20of%20a%20Binary%20String/README.md) -- [2610. 转换二维数组](/solution/2600-2699/2610.Convert%20an%20Array%20Into%20a%202D%20Array%20With%20Conditions/README.md) -- [2611. 老鼠和奶酪](/solution/2600-2699/2611.Mice%20and%20Cheese/README.md) -- [2612. 最少翻转操作数](/solution/2600-2699/2612.Minimum%20Reverse%20Operations/README.md) - -#### 第 101 场双周赛(2023-04-01 22:30, 90 分钟) 参赛人数 3353 - -- [2605. 从两个数字数组里生成最小数字](/solution/2600-2699/2605.Form%20Smallest%20Number%20From%20Two%20Digit%20Arrays/README.md) -- [2606. 找到最大开销的子字符串](/solution/2600-2699/2606.Find%20the%20Substring%20With%20Maximum%20Cost/README.md) -- [2607. 使子数组元素和相等](/solution/2600-2699/2607.Make%20K-Subarray%20Sums%20Equal/README.md) -- [2608. 图中的最短环](/solution/2600-2699/2608.Shortest%20Cycle%20in%20a%20Graph/README.md) - -#### 第 338 场周赛(2023-03-26 10:30, 90 分钟) 参赛人数 5594 - -- [2600. K 件物品的最大和](/solution/2600-2699/2600.K%20Items%20With%20the%20Maximum%20Sum/README.md) -- [2601. 质数减法运算](/solution/2600-2699/2601.Prime%20Subtraction%20Operation/README.md) -- [2602. 使数组元素全部相等的最少操作次数](/solution/2600-2699/2602.Minimum%20Operations%20to%20Make%20All%20Array%20Elements%20Equal/README.md) -- [2603. 收集树中金币](/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README.md) - -#### 第 337 场周赛(2023-03-19 10:30, 90 分钟) 参赛人数 5628 - -- [2595. 奇偶位数](/solution/2500-2599/2595.Number%20of%20Even%20and%20Odd%20Bits/README.md) -- [2596. 检查骑士巡视方案](/solution/2500-2599/2596.Check%20Knight%20Tour%20Configuration/README.md) -- [2597. 美丽子集的数目](/solution/2500-2599/2597.The%20Number%20of%20Beautiful%20Subsets/README.md) -- [2598. 执行操作后的最大 MEX](/solution/2500-2599/2598.Smallest%20Missing%20Non-negative%20Integer%20After%20Operations/README.md) - -#### 第 100 场双周赛(2023-03-18 22:30, 90 分钟) 参赛人数 3639 - -- [2591. 将钱分给最多的儿童](/solution/2500-2599/2591.Distribute%20Money%20to%20Maximum%20Children/README.md) -- [2592. 最大化数组的伟大值](/solution/2500-2599/2592.Maximize%20Greatness%20of%20an%20Array/README.md) -- [2593. 标记所有元素后数组的分数](/solution/2500-2599/2593.Find%20Score%20of%20an%20Array%20After%20Marking%20All%20Elements/README.md) -- [2594. 修车的最少时间](/solution/2500-2599/2594.Minimum%20Time%20to%20Repair%20Cars/README.md) - -#### 第 336 场周赛(2023-03-12 10:30, 90 分钟) 参赛人数 5897 - -- [2586. 统计范围内的元音字符串数](/solution/2500-2599/2586.Count%20the%20Number%20of%20Vowel%20Strings%20in%20Range/README.md) -- [2587. 重排数组以得到最大前缀分数](/solution/2500-2599/2587.Rearrange%20Array%20to%20Maximize%20Prefix%20Score/README.md) -- [2588. 统计美丽子数组数目](/solution/2500-2599/2588.Count%20the%20Number%20of%20Beautiful%20Subarrays/README.md) -- [2589. 完成所有任务的最少时间](/solution/2500-2599/2589.Minimum%20Time%20to%20Complete%20All%20Tasks/README.md) - -#### 第 335 场周赛(2023-03-05 10:30, 90 分钟) 参赛人数 6019 - -- [2582. 递枕头](/solution/2500-2599/2582.Pass%20the%20Pillow/README.md) -- [2583. 二叉树中的第 K 大层和](/solution/2500-2599/2583.Kth%20Largest%20Sum%20in%20a%20Binary%20Tree/README.md) -- [2584. 分割数组使乘积互质](/solution/2500-2599/2584.Split%20the%20Array%20to%20Make%20Coprime%20Products/README.md) -- [2585. 获得分数的方法数](/solution/2500-2599/2585.Number%20of%20Ways%20to%20Earn%20Points/README.md) - -#### 第 99 场双周赛(2023-03-04 22:30, 90 分钟) 参赛人数 3467 - -- [2578. 最小和分割](/solution/2500-2599/2578.Split%20With%20Minimum%20Sum/README.md) -- [2579. 统计染色格子数](/solution/2500-2599/2579.Count%20Total%20Number%20of%20Colored%20Cells/README.md) -- [2580. 统计将重叠区间合并成组的方案数](/solution/2500-2599/2580.Count%20Ways%20to%20Group%20Overlapping%20Ranges/README.md) -- [2581. 统计可能的树根数目](/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README.md) - -#### 第 334 场周赛(2023-02-26 10:30, 90 分钟) 参赛人数 5501 - -- [2574. 左右元素和的差值](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README.md) -- [2575. 找出字符串的可整除数组](/solution/2500-2599/2575.Find%20the%20Divisibility%20Array%20of%20a%20String/README.md) -- [2576. 求出最多标记下标](/solution/2500-2599/2576.Find%20the%20Maximum%20Number%20of%20Marked%20Indices/README.md) -- [2577. 在网格图中访问一个格子的最少时间](/solution/2500-2599/2577.Minimum%20Time%20to%20Visit%20a%20Cell%20In%20a%20Grid/README.md) - -#### 第 333 场周赛(2023-02-19 10:30, 90 分钟) 参赛人数 4969 - -- [2570. 合并两个二维数组 - 求和法](/solution/2500-2599/2570.Merge%20Two%202D%20Arrays%20by%20Summing%20Values/README.md) -- [2571. 将整数减少到零需要的最少操作数](/solution/2500-2599/2571.Minimum%20Operations%20to%20Reduce%20an%20Integer%20to%200/README.md) -- [2572. 无平方子集计数](/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README.md) -- [2573. 找出对应 LCP 矩阵的字符串](/solution/2500-2599/2573.Find%20the%20String%20with%20LCP/README.md) - -#### 第 98 场双周赛(2023-02-18 22:30, 90 分钟) 参赛人数 3250 - -- [2566. 替换一个数字后的最大差值](/solution/2500-2599/2566.Maximum%20Difference%20by%20Remapping%20a%20Digit/README.md) -- [2567. 修改两个元素的最小分数](/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README.md) -- [2568. 最小无法得到的或值](/solution/2500-2599/2568.Minimum%20Impossible%20OR/README.md) -- [2569. 更新数组后处理求和查询](/solution/2500-2599/2569.Handling%20Sum%20Queries%20After%20Update/README.md) - -#### 第 332 场周赛(2023-02-12 10:30, 90 分钟) 参赛人数 4547 - -- [2562. 找出数组的串联值](/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README.md) -- [2563. 统计公平数对的数目](/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README.md) -- [2564. 子字符串异或查询](/solution/2500-2599/2564.Substring%20XOR%20Queries/README.md) -- [2565. 最少得分子序列](/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README.md) - -#### 第 331 场周赛(2023-02-05 10:30, 90 分钟) 参赛人数 4256 - -- [2558. 从数量最多的堆取走礼物](/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README.md) -- [2559. 统计范围内的元音字符串数](/solution/2500-2599/2559.Count%20Vowel%20Strings%20in%20Ranges/README.md) -- [2560. 打家劫舍 IV](/solution/2500-2599/2560.House%20Robber%20IV/README.md) -- [2561. 重排水果](/solution/2500-2599/2561.Rearranging%20Fruits/README.md) - -#### 第 97 场双周赛(2023-02-04 22:30, 90 分钟) 参赛人数 2631 - -- [2553. 分割数组中数字的数位](/solution/2500-2599/2553.Separate%20the%20Digits%20in%20an%20Array/README.md) -- [2554. 从一个范围内选择最多整数 I](/solution/2500-2599/2554.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20I/README.md) -- [2555. 两个线段获得的最多奖品](/solution/2500-2599/2555.Maximize%20Win%20From%20Two%20Segments/README.md) -- [2556. 二进制矩阵中翻转最多一次使路径不连通](/solution/2500-2599/2556.Disconnect%20Path%20in%20a%20Binary%20Matrix%20by%20at%20Most%20One%20Flip/README.md) - -#### 第 330 场周赛(2023-01-29 10:30, 90 分钟) 参赛人数 3399 - -- [2549. 统计桌面上的不同数字](/solution/2500-2599/2549.Count%20Distinct%20Numbers%20on%20Board/README.md) -- [2550. 猴子碰撞的方法数](/solution/2500-2599/2550.Count%20Collisions%20of%20Monkeys%20on%20a%20Polygon/README.md) -- [2551. 将珠子放入背包中](/solution/2500-2599/2551.Put%20Marbles%20in%20Bags/README.md) -- [2552. 统计上升四元组](/solution/2500-2599/2552.Count%20Increasing%20Quadruplets/README.md) - -#### 第 329 场周赛(2023-01-22 10:30, 90 分钟) 参赛人数 2591 - -- [2544. 交替数字和](/solution/2500-2599/2544.Alternating%20Digit%20Sum/README.md) -- [2545. 根据第 K 场考试的分数排序](/solution/2500-2599/2545.Sort%20the%20Students%20by%20Their%20Kth%20Score/README.md) -- [2546. 执行逐位运算使字符串相等](/solution/2500-2599/2546.Apply%20Bitwise%20Operations%20to%20Make%20Strings%20Equal/README.md) -- [2547. 拆分数组的最小代价](/solution/2500-2599/2547.Minimum%20Cost%20to%20Split%20an%20Array/README.md) - -#### 第 96 场双周赛(2023-01-21 22:30, 90 分钟) 参赛人数 2103 - -- [2540. 最小公共值](/solution/2500-2599/2540.Minimum%20Common%20Value/README.md) -- [2541. 使数组中所有元素相等的最小操作数 II](/solution/2500-2599/2541.Minimum%20Operations%20to%20Make%20Array%20Equal%20II/README.md) -- [2542. 最大子序列的分数](/solution/2500-2599/2542.Maximum%20Subsequence%20Score/README.md) -- [2543. 判断一个点是否可以到达](/solution/2500-2599/2543.Check%20if%20Point%20Is%20Reachable/README.md) - -#### 第 328 场周赛(2023-01-15 10:30, 90 分钟) 参赛人数 4776 - -- [2535. 数组元素和与数字和的绝对差](/solution/2500-2599/2535.Difference%20Between%20Element%20Sum%20and%20Digit%20Sum%20of%20an%20Array/README.md) -- [2536. 子矩阵元素加 1](/solution/2500-2599/2536.Increment%20Submatrices%20by%20One/README.md) -- [2537. 统计好子数组的数目](/solution/2500-2599/2537.Count%20the%20Number%20of%20Good%20Subarrays/README.md) -- [2538. 最大价值和与最小价值和的差值](/solution/2500-2599/2538.Difference%20Between%20Maximum%20and%20Minimum%20Price%20Sum/README.md) - -#### 第 327 场周赛(2023-01-08 10:30, 90 分钟) 参赛人数 4518 - -- [2529. 正整数和负整数的最大计数](/solution/2500-2599/2529.Maximum%20Count%20of%20Positive%20Integer%20and%20Negative%20Integer/README.md) -- [2530. 执行 K 次操作后的最大分数](/solution/2500-2599/2530.Maximal%20Score%20After%20Applying%20K%20Operations/README.md) -- [2531. 使字符串中不同字符的数目相等](/solution/2500-2599/2531.Make%20Number%20of%20Distinct%20Characters%20Equal/README.md) -- [2532. 过桥的时间](/solution/2500-2599/2532.Time%20to%20Cross%20a%20Bridge/README.md) - -#### 第 95 场双周赛(2023-01-07 22:30, 90 分钟) 参赛人数 2880 - -- [2525. 根据规则将箱子分类](/solution/2500-2599/2525.Categorize%20Box%20According%20to%20Criteria/README.md) -- [2526. 找到数据流中的连续整数](/solution/2500-2599/2526.Find%20Consecutive%20Integers%20from%20a%20Data%20Stream/README.md) -- [2527. 查询数组异或美丽值](/solution/2500-2599/2527.Find%20Xor-Beauty%20of%20Array/README.md) -- [2528. 最大化城市的最小电量](/solution/2500-2599/2528.Maximize%20the%20Minimum%20Powered%20City/README.md) - -#### 第 326 场周赛(2023-01-01 10:30, 90 分钟) 参赛人数 3873 - -- [2520. 统计能整除数字的位数](/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README.md) -- [2521. 数组乘积中的不同质因数数目](/solution/2500-2599/2521.Distinct%20Prime%20Factors%20of%20Product%20of%20Array/README.md) -- [2522. 将字符串分割成值不超过 K 的子字符串](/solution/2500-2599/2522.Partition%20String%20Into%20Substrings%20With%20Values%20at%20Most%20K/README.md) -- [2523. 范围内最接近的两个质数](/solution/2500-2599/2523.Closest%20Prime%20Numbers%20in%20Range/README.md) - -#### 第 325 场周赛(2022-12-25 10:30, 90 分钟) 参赛人数 3530 - -- [2515. 到目标字符串的最短距离](/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README.md) -- [2516. 每种字符至少取 K 个](/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README.md) -- [2517. 礼盒的最大甜蜜度](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README.md) -- [2518. 好分区的数目](/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README.md) - -#### 第 94 场双周赛(2022-12-24 22:30, 90 分钟) 参赛人数 2298 - -- [2511. 最多可以摧毁的敌人城堡数目](/solution/2500-2599/2511.Maximum%20Enemy%20Forts%20That%20Can%20Be%20Captured/README.md) -- [2512. 奖励最顶尖的 K 名学生](/solution/2500-2599/2512.Reward%20Top%20K%20Students/README.md) -- [2513. 最小化两个数组中的最大值](/solution/2500-2599/2513.Minimize%20the%20Maximum%20of%20Two%20Arrays/README.md) -- [2514. 统计同位异构字符串数目](/solution/2500-2599/2514.Count%20Anagrams/README.md) - -#### 第 324 场周赛(2022-12-18 10:30, 90 分钟) 参赛人数 4167 - -- [2506. 统计相似字符串对的数目](/solution/2500-2599/2506.Count%20Pairs%20Of%20Similar%20Strings/README.md) -- [2507. 使用质因数之和替换后可以取到的最小值](/solution/2500-2599/2507.Smallest%20Value%20After%20Replacing%20With%20Sum%20of%20Prime%20Factors/README.md) -- [2508. 添加边使所有节点度数都为偶数](/solution/2500-2599/2508.Add%20Edges%20to%20Make%20Degrees%20of%20All%20Nodes%20Even/README.md) -- [2509. 查询树中环的长度](/solution/2500-2599/2509.Cycle%20Length%20Queries%20in%20a%20Tree/README.md) - -#### 第 323 场周赛(2022-12-11 10:30, 90 分钟) 参赛人数 4671 - -- [2500. 删除每行中的最大值](/solution/2500-2599/2500.Delete%20Greatest%20Value%20in%20Each%20Row/README.md) -- [2501. 数组中最长的方波](/solution/2500-2599/2501.Longest%20Square%20Streak%20in%20an%20Array/README.md) -- [2502. 设计内存分配器](/solution/2500-2599/2502.Design%20Memory%20Allocator/README.md) -- [2503. 矩阵查询可获得的最大分数](/solution/2500-2599/2503.Maximum%20Number%20of%20Points%20From%20Grid%20Queries/README.md) - -#### 第 93 场双周赛(2022-12-10 22:30, 90 分钟) 参赛人数 2929 - -- [2496. 数组中字符串的最大值](/solution/2400-2499/2496.Maximum%20Value%20of%20a%20String%20in%20an%20Array/README.md) -- [2497. 图中最大星和](/solution/2400-2499/2497.Maximum%20Star%20Sum%20of%20a%20Graph/README.md) -- [2498. 青蛙过河 II](/solution/2400-2499/2498.Frog%20Jump%20II/README.md) -- [2499. 让数组不相等的最小总代价](/solution/2400-2499/2499.Minimum%20Total%20Cost%20to%20Make%20Arrays%20Unequal/README.md) - -#### 第 322 场周赛(2022-12-04 10:30, 90 分钟) 参赛人数 5085 - -- [2490. 回环句](/solution/2400-2499/2490.Circular%20Sentence/README.md) -- [2491. 划分技能点相等的团队](/solution/2400-2499/2491.Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/README.md) -- [2492. 两个城市间路径的最小分数](/solution/2400-2499/2492.Minimum%20Score%20of%20a%20Path%20Between%20Two%20Cities/README.md) -- [2493. 将节点分成尽可能多的组](/solution/2400-2499/2493.Divide%20Nodes%20Into%20the%20Maximum%20Number%20of%20Groups/README.md) - -#### 第 321 场周赛(2022-11-27 10:30, 90 分钟) 参赛人数 5115 - -- [2485. 找出中枢整数](/solution/2400-2499/2485.Find%20the%20Pivot%20Integer/README.md) -- [2486. 追加字符以获得子序列](/solution/2400-2499/2486.Append%20Characters%20to%20String%20to%20Make%20Subsequence/README.md) -- [2487. 从链表中移除节点](/solution/2400-2499/2487.Remove%20Nodes%20From%20Linked%20List/README.md) -- [2488. 统计中位数为 K 的子数组](/solution/2400-2499/2488.Count%20Subarrays%20With%20Median%20K/README.md) - -#### 第 92 场双周赛(2022-11-26 22:30, 90 分钟) 参赛人数 3055 - -- [2481. 分割圆的最少切割次数](/solution/2400-2499/2481.Minimum%20Cuts%20to%20Divide%20a%20Circle/README.md) -- [2482. 行和列中一和零的差值](/solution/2400-2499/2482.Difference%20Between%20Ones%20and%20Zeros%20in%20Row%20and%20Column/README.md) -- [2483. 商店的最少代价](/solution/2400-2499/2483.Minimum%20Penalty%20for%20a%20Shop/README.md) -- [2484. 统计回文子序列数目](/solution/2400-2499/2484.Count%20Palindromic%20Subsequences/README.md) - -#### 第 320 场周赛(2022-11-20 10:30, 90 分钟) 参赛人数 5678 - -- [2475. 数组中不等三元组的数目](/solution/2400-2499/2475.Number%20of%20Unequal%20Triplets%20in%20Array/README.md) -- [2476. 二叉搜索树最近节点查询](/solution/2400-2499/2476.Closest%20Nodes%20Queries%20in%20a%20Binary%20Search%20Tree/README.md) -- [2477. 到达首都的最少油耗](/solution/2400-2499/2477.Minimum%20Fuel%20Cost%20to%20Report%20to%20the%20Capital/README.md) -- [2478. 完美分割的方案数](/solution/2400-2499/2478.Number%20of%20Beautiful%20Partitions/README.md) - -#### 第 319 场周赛(2022-11-13 10:30, 90 分钟) 参赛人数 6175 - -- [2469. 温度转换](/solution/2400-2499/2469.Convert%20the%20Temperature/README.md) -- [2470. 最小公倍数为 K 的子数组数目](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README.md) -- [2471. 逐层排序二叉树所需的最少操作数目](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README.md) -- [2472. 不重叠回文子字符串的最大数目](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README.md) - -#### 第 91 场双周赛(2022-11-12 22:30, 90 分钟) 参赛人数 3535 - -- [2465. 不同的平均值数目](/solution/2400-2499/2465.Number%20of%20Distinct%20Averages/README.md) -- [2466. 统计构造好字符串的方案数](/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README.md) -- [2467. 树上最大得分和路径](/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README.md) -- [2468. 根据限制分割消息](/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README.md) - -#### 第 318 场周赛(2022-11-06 10:30, 90 分钟) 参赛人数 5670 - -- [2460. 对数组执行操作](/solution/2400-2499/2460.Apply%20Operations%20to%20an%20Array/README.md) -- [2461. 长度为 K 子数组中的最大和](/solution/2400-2499/2461.Maximum%20Sum%20of%20Distinct%20Subarrays%20With%20Length%20K/README.md) -- [2462. 雇佣 K 位工人的总代价](/solution/2400-2499/2462.Total%20Cost%20to%20Hire%20K%20Workers/README.md) -- [2463. 最小移动总距离](/solution/2400-2499/2463.Minimum%20Total%20Distance%20Traveled/README.md) - -#### 第 317 场周赛(2022-10-30 10:30, 90 分钟) 参赛人数 5660 - -- [2455. 可被三整除的偶数的平均值](/solution/2400-2499/2455.Average%20Value%20of%20Even%20Numbers%20That%20Are%20Divisible%20by%20Three/README.md) -- [2456. 最流行的视频创作者](/solution/2400-2499/2456.Most%20Popular%20Video%20Creator/README.md) -- [2457. 美丽整数的最小增量](/solution/2400-2499/2457.Minimum%20Addition%20to%20Make%20Integer%20Beautiful/README.md) -- [2458. 移除子树后的二叉树高度](/solution/2400-2499/2458.Height%20of%20Binary%20Tree%20After%20Subtree%20Removal%20Queries/README.md) - -#### 第 90 场双周赛(2022-10-29 22:30, 90 分钟) 参赛人数 3624 - -- [2451. 差值数组不同的字符串](/solution/2400-2499/2451.Odd%20String%20Difference/README.md) -- [2452. 距离字典两次编辑以内的单词](/solution/2400-2499/2452.Words%20Within%20Two%20Edits%20of%20Dictionary/README.md) -- [2453. 摧毁一系列目标](/solution/2400-2499/2453.Destroy%20Sequential%20Targets/README.md) -- [2454. 下一个更大元素 IV](/solution/2400-2499/2454.Next%20Greater%20Element%20IV/README.md) - -#### 第 316 场周赛(2022-10-23 10:30, 90 分钟) 参赛人数 6387 - -- [2446. 判断两个事件是否存在冲突](/solution/2400-2499/2446.Determine%20if%20Two%20Events%20Have%20Conflict/README.md) -- [2447. 最大公因数等于 K 的子数组数目](/solution/2400-2499/2447.Number%20of%20Subarrays%20With%20GCD%20Equal%20to%20K/README.md) -- [2448. 使数组相等的最小开销](/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README.md) -- [2449. 使数组相似的最少操作次数](/solution/2400-2499/2449.Minimum%20Number%20of%20Operations%20to%20Make%20Arrays%20Similar/README.md) - -#### 第 315 场周赛(2022-10-16 10:30, 90 分钟) 参赛人数 6490 - -- [2441. 与对应负数同时存在的最大正整数](/solution/2400-2499/2441.Largest%20Positive%20Integer%20That%20Exists%20With%20Its%20Negative/README.md) -- [2442. 反转之后不同整数的数目](/solution/2400-2499/2442.Count%20Number%20of%20Distinct%20Integers%20After%20Reverse%20Operations/README.md) -- [2443. 反转之后的数字和](/solution/2400-2499/2443.Sum%20of%20Number%20and%20Its%20Reverse/README.md) -- [2444. 统计定界子数组的数目](/solution/2400-2499/2444.Count%20Subarrays%20With%20Fixed%20Bounds/README.md) - -#### 第 89 场双周赛(2022-10-15 22:30, 90 分钟) 参赛人数 3984 - -- [2437. 有效时间的数目](/solution/2400-2499/2437.Number%20of%20Valid%20Clock%20Times/README.md) -- [2438. 二的幂数组中查询范围内的乘积](/solution/2400-2499/2438.Range%20Product%20Queries%20of%20Powers/README.md) -- [2439. 最小化数组中的最大值](/solution/2400-2499/2439.Minimize%20Maximum%20of%20Array/README.md) -- [2440. 创建价值相同的连通块](/solution/2400-2499/2440.Create%20Components%20With%20Same%20Value/README.md) - -#### 第 314 场周赛(2022-10-09 10:30, 90 分钟) 参赛人数 4838 - -- [2432. 处理用时最长的那个任务的员工](/solution/2400-2499/2432.The%20Employee%20That%20Worked%20on%20the%20Longest%20Task/README.md) -- [2433. 找出前缀异或的原始数组](/solution/2400-2499/2433.Find%20The%20Original%20Array%20of%20Prefix%20Xor/README.md) -- [2434. 使用机器人打印字典序最小的字符串](/solution/2400-2499/2434.Using%20a%20Robot%20to%20Print%20the%20Lexicographically%20Smallest%20String/README.md) -- [2435. 矩阵中和能被 K 整除的路径](/solution/2400-2499/2435.Paths%20in%20Matrix%20Whose%20Sum%20Is%20Divisible%20by%20K/README.md) - -#### 第 313 场周赛(2022-10-02 10:30, 90 分钟) 参赛人数 5445 - -- [2427. 公因子的数目](/solution/2400-2499/2427.Number%20of%20Common%20Factors/README.md) -- [2428. 沙漏的最大总和](/solution/2400-2499/2428.Maximum%20Sum%20of%20an%20Hourglass/README.md) -- [2429. 最小异或](/solution/2400-2499/2429.Minimize%20XOR/README.md) -- [2430. 对字母串可执行的最大删除数](/solution/2400-2499/2430.Maximum%20Deletions%20on%20a%20String/README.md) - -#### 第 88 场双周赛(2022-10-01 22:30, 90 分钟) 参赛人数 3905 - -- [2423. 删除字符使频率相同](/solution/2400-2499/2423.Remove%20Letter%20To%20Equalize%20Frequency/README.md) -- [2424. 最长上传前缀](/solution/2400-2499/2424.Longest%20Uploaded%20Prefix/README.md) -- [2425. 所有数对的异或和](/solution/2400-2499/2425.Bitwise%20XOR%20of%20All%20Pairings/README.md) -- [2426. 满足不等式的数对数目](/solution/2400-2499/2426.Number%20of%20Pairs%20Satisfying%20Inequality/README.md) - -#### 第 312 场周赛(2022-09-25 10:30, 90 分钟) 参赛人数 6638 - -- [2418. 按身高排序](/solution/2400-2499/2418.Sort%20the%20People/README.md) -- [2419. 按位与最大的最长子数组](/solution/2400-2499/2419.Longest%20Subarray%20With%20Maximum%20Bitwise%20AND/README.md) -- [2420. 找到所有好下标](/solution/2400-2499/2420.Find%20All%20Good%20Indices/README.md) -- [2421. 好路径的数目](/solution/2400-2499/2421.Number%20of%20Good%20Paths/README.md) - -#### 第 311 场周赛(2022-09-18 10:30, 90 分钟) 参赛人数 6710 - -- [2413. 最小偶倍数](/solution/2400-2499/2413.Smallest%20Even%20Multiple/README.md) -- [2414. 最长的字母序连续子字符串的长度](/solution/2400-2499/2414.Length%20of%20the%20Longest%20Alphabetical%20Continuous%20Substring/README.md) -- [2415. 反转二叉树的奇数层](/solution/2400-2499/2415.Reverse%20Odd%20Levels%20of%20Binary%20Tree/README.md) -- [2416. 字符串的前缀分数和](/solution/2400-2499/2416.Sum%20of%20Prefix%20Scores%20of%20Strings/README.md) - -#### 第 87 场双周赛(2022-09-17 22:30, 90 分钟) 参赛人数 4005 - -- [2409. 统计共同度过的日子数](/solution/2400-2499/2409.Count%20Days%20Spent%20Together/README.md) -- [2410. 运动员和训练师的最大匹配数](/solution/2400-2499/2410.Maximum%20Matching%20of%20Players%20With%20Trainers/README.md) -- [2411. 按位或最大的最小子数组长度](/solution/2400-2499/2411.Smallest%20Subarrays%20With%20Maximum%20Bitwise%20OR/README.md) -- [2412. 完成所有交易的初始最少钱数](/solution/2400-2499/2412.Minimum%20Money%20Required%20Before%20Transactions/README.md) - -#### 第 310 场周赛(2022-09-11 10:30, 90 分钟) 参赛人数 6081 - -- [2404. 出现最频繁的偶数元素](/solution/2400-2499/2404.Most%20Frequent%20Even%20Element/README.md) -- [2405. 子字符串的最优划分](/solution/2400-2499/2405.Optimal%20Partition%20of%20String/README.md) -- [2406. 将区间分为最少组数](/solution/2400-2499/2406.Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/README.md) -- [2407. 最长递增子序列 II](/solution/2400-2499/2407.Longest%20Increasing%20Subsequence%20II/README.md) - -#### 第 309 场周赛(2022-09-04 10:30, 90 分钟) 参赛人数 7972 - -- [2399. 检查相同字母间的距离](/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README.md) -- [2400. 恰好移动 k 步到达某一位置的方法数目](/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README.md) -- [2401. 最长优雅子数组](/solution/2400-2499/2401.Longest%20Nice%20Subarray/README.md) -- [2402. 会议室 III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README.md) - -#### 第 86 场双周赛(2022-09-03 22:30, 90 分钟) 参赛人数 4401 - -- [2395. 和相等的子数组](/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README.md) -- [2396. 严格回文的数字](/solution/2300-2399/2396.Strictly%20Palindromic%20Number/README.md) -- [2397. 被列覆盖的最多行数](/solution/2300-2399/2397.Maximum%20Rows%20Covered%20by%20Columns/README.md) -- [2398. 预算内的最多机器人数目](/solution/2300-2399/2398.Maximum%20Number%20of%20Robots%20Within%20Budget/README.md) - -#### 第 308 场周赛(2022-08-28 10:30, 90 分钟) 参赛人数 6394 - -- [2389. 和有限的最长子序列](/solution/2300-2399/2389.Longest%20Subsequence%20With%20Limited%20Sum/README.md) -- [2390. 从字符串中移除星号](/solution/2300-2399/2390.Removing%20Stars%20From%20a%20String/README.md) -- [2391. 收集垃圾的最少总时间](/solution/2300-2399/2391.Minimum%20Amount%20of%20Time%20to%20Collect%20Garbage/README.md) -- [2392. 给定条件下构造矩阵](/solution/2300-2399/2392.Build%20a%20Matrix%20With%20Conditions/README.md) - -#### 第 307 场周赛(2022-08-21 10:30, 90 分钟) 参赛人数 7064 - -- [2383. 赢得比赛需要的最少训练时长](/solution/2300-2399/2383.Minimum%20Hours%20of%20Training%20to%20Win%20a%20Competition/README.md) -- [2384. 最大回文数字](/solution/2300-2399/2384.Largest%20Palindromic%20Number/README.md) -- [2385. 感染二叉树需要的总时间](/solution/2300-2399/2385.Amount%20of%20Time%20for%20Binary%20Tree%20to%20Be%20Infected/README.md) -- [2386. 找出数组的第 K 大和](/solution/2300-2399/2386.Find%20the%20K-Sum%20of%20an%20Array/README.md) - -#### 第 85 场双周赛(2022-08-20 22:30, 90 分钟) 参赛人数 4193 - -- [2379. 得到 K 个黑块的最少涂色次数](/solution/2300-2399/2379.Minimum%20Recolors%20to%20Get%20K%20Consecutive%20Black%20Blocks/README.md) -- [2380. 二进制字符串重新安排顺序需要的时间](/solution/2300-2399/2380.Time%20Needed%20to%20Rearrange%20a%20Binary%20String/README.md) -- [2381. 字母移位 II](/solution/2300-2399/2381.Shifting%20Letters%20II/README.md) -- [2382. 删除操作后的最大子段和](/solution/2300-2399/2382.Maximum%20Segment%20Sum%20After%20Removals/README.md) - -#### 第 306 场周赛(2022-08-14 10:30, 90 分钟) 参赛人数 7500 - -- [2373. 矩阵中的局部最大值](/solution/2300-2399/2373.Largest%20Local%20Values%20in%20a%20Matrix/README.md) -- [2374. 边积分最高的节点](/solution/2300-2399/2374.Node%20With%20Highest%20Edge%20Score/README.md) -- [2375. 根据模式串构造最小数字](/solution/2300-2399/2375.Construct%20Smallest%20Number%20From%20DI%20String/README.md) -- [2376. 统计特殊整数](/solution/2300-2399/2376.Count%20Special%20Integers/README.md) - -#### 第 305 场周赛(2022-08-07 10:30, 90 分钟) 参赛人数 7465 - -- [2367. 算术三元组的数目](/solution/2300-2399/2367.Number%20of%20Arithmetic%20Triplets/README.md) -- [2368. 受限条件下可到达节点的数目](/solution/2300-2399/2368.Reachable%20Nodes%20With%20Restrictions/README.md) -- [2369. 检查数组是否存在有效划分](/solution/2300-2399/2369.Check%20if%20There%20is%20a%20Valid%20Partition%20For%20The%20Array/README.md) -- [2370. 最长理想子序列](/solution/2300-2399/2370.Longest%20Ideal%20Subsequence/README.md) - -#### 第 84 场双周赛(2022-08-06 22:30, 90 分钟) 参赛人数 4574 - -- [2363. 合并相似的物品](/solution/2300-2399/2363.Merge%20Similar%20Items/README.md) -- [2364. 统计坏数对的数目](/solution/2300-2399/2364.Count%20Number%20of%20Bad%20Pairs/README.md) -- [2365. 任务调度器 II](/solution/2300-2399/2365.Task%20Scheduler%20II/README.md) -- [2366. 将数组排序的最少替换次数](/solution/2300-2399/2366.Minimum%20Replacements%20to%20Sort%20the%20Array/README.md) - -#### 第 304 场周赛(2022-07-31 10:30, 90 分钟) 参赛人数 7372 - -- [2357. 使数组中所有元素都等于零](/solution/2300-2399/2357.Make%20Array%20Zero%20by%20Subtracting%20Equal%20Amounts/README.md) -- [2358. 分组的最大数量](/solution/2300-2399/2358.Maximum%20Number%20of%20Groups%20Entering%20a%20Competition/README.md) -- [2359. 找到离给定两个节点最近的节点](/solution/2300-2399/2359.Find%20Closest%20Node%20to%20Given%20Two%20Nodes/README.md) -- [2360. 图中的最长环](/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README.md) - -#### 第 303 场周赛(2022-07-24 10:30, 90 分钟) 参赛人数 7032 - -- [2351. 第一个出现两次的字母](/solution/2300-2399/2351.First%20Letter%20to%20Appear%20Twice/README.md) -- [2352. 相等行列对](/solution/2300-2399/2352.Equal%20Row%20and%20Column%20Pairs/README.md) -- [2353. 设计食物评分系统](/solution/2300-2399/2353.Design%20a%20Food%20Rating%20System/README.md) -- [2354. 优质数对的数目](/solution/2300-2399/2354.Number%20of%20Excellent%20Pairs/README.md) - -#### 第 83 场双周赛(2022-07-23 22:30, 90 分钟) 参赛人数 4437 - -- [2347. 最好的扑克手牌](/solution/2300-2399/2347.Best%20Poker%20Hand/README.md) -- [2348. 全 0 子数组的数目](/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README.md) -- [2349. 设计数字容器系统](/solution/2300-2399/2349.Design%20a%20Number%20Container%20System/README.md) -- [2350. 不可能得到的最短骰子序列](/solution/2300-2399/2350.Shortest%20Impossible%20Sequence%20of%20Rolls/README.md) - -#### 第 302 场周赛(2022-07-17 10:30, 90 分钟) 参赛人数 7092 - -- [2341. 数组能形成多少数对](/solution/2300-2399/2341.Maximum%20Number%20of%20Pairs%20in%20Array/README.md) -- [2342. 数位和相等数对的最大和](/solution/2300-2399/2342.Max%20Sum%20of%20a%20Pair%20With%20Equal%20Sum%20of%20Digits/README.md) -- [2343. 裁剪数字后查询第 K 小的数字](/solution/2300-2399/2343.Query%20Kth%20Smallest%20Trimmed%20Number/README.md) -- [2344. 使数组可以被整除的最少删除次数](/solution/2300-2399/2344.Minimum%20Deletions%20to%20Make%20Array%20Divisible/README.md) - -#### 第 301 场周赛(2022-07-10 10:30, 90 分钟) 参赛人数 7133 - -- [2335. 装满杯子需要的最短总时长](/solution/2300-2399/2335.Minimum%20Amount%20of%20Time%20to%20Fill%20Cups/README.md) -- [2336. 无限集中的最小数字](/solution/2300-2399/2336.Smallest%20Number%20in%20Infinite%20Set/README.md) -- [2337. 移动片段得到字符串](/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README.md) -- [2338. 统计理想数组的数目](/solution/2300-2399/2338.Count%20the%20Number%20of%20Ideal%20Arrays/README.md) - -#### 第 82 场双周赛(2022-07-09 22:30, 90 分钟) 参赛人数 4144 - -- [2331. 计算布尔二叉树的值](/solution/2300-2399/2331.Evaluate%20Boolean%20Binary%20Tree/README.md) -- [2332. 坐上公交的最晚时间](/solution/2300-2399/2332.The%20Latest%20Time%20to%20Catch%20a%20Bus/README.md) -- [2333. 最小差值平方和](/solution/2300-2399/2333.Minimum%20Sum%20of%20Squared%20Difference/README.md) -- [2334. 元素值大于变化阈值的子数组](/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README.md) - -#### 第 300 场周赛(2022-07-03 10:30, 90 分钟) 参赛人数 6792 - -- [2325. 解密消息](/solution/2300-2399/2325.Decode%20the%20Message/README.md) -- [2326. 螺旋矩阵 IV](/solution/2300-2399/2326.Spiral%20Matrix%20IV/README.md) -- [2327. 知道秘密的人数](/solution/2300-2399/2327.Number%20of%20People%20Aware%20of%20a%20Secret/README.md) -- [2328. 网格图中递增路径的数目](/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README.md) - -#### 第 299 场周赛(2022-06-26 10:30, 90 分钟) 参赛人数 6108 - -- [2319. 判断矩阵是否是一个 X 矩阵](/solution/2300-2399/2319.Check%20if%20Matrix%20Is%20X-Matrix/README.md) -- [2320. 统计放置房子的方式数](/solution/2300-2399/2320.Count%20Number%20of%20Ways%20to%20Place%20Houses/README.md) -- [2321. 拼接数组的最大分数](/solution/2300-2399/2321.Maximum%20Score%20Of%20Spliced%20Array/README.md) -- [2322. 从树中删除边的最小分数](/solution/2300-2399/2322.Minimum%20Score%20After%20Removals%20on%20a%20Tree/README.md) - -#### 第 81 场双周赛(2022-06-25 22:30, 90 分钟) 参赛人数 3847 - -- [2315. 统计星号](/solution/2300-2399/2315.Count%20Asterisks/README.md) -- [2316. 统计无向图中无法互相到达点对数](/solution/2300-2399/2316.Count%20Unreachable%20Pairs%20of%20Nodes%20in%20an%20Undirected%20Graph/README.md) -- [2317. 操作后的最大异或和](/solution/2300-2399/2317.Maximum%20XOR%20After%20Operations/README.md) -- [2318. 不同骰子序列的数目](/solution/2300-2399/2318.Number%20of%20Distinct%20Roll%20Sequences/README.md) - -#### 第 298 场周赛(2022-06-19 10:30, 90 分钟) 参赛人数 6228 - -- [2309. 兼具大小写的最好英文字母](/solution/2300-2399/2309.Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case/README.md) -- [2310. 个位数字为 K 的整数之和](/solution/2300-2399/2310.Sum%20of%20Numbers%20With%20Units%20Digit%20K/README.md) -- [2311. 小于等于 K 的最长二进制子序列](/solution/2300-2399/2311.Longest%20Binary%20Subsequence%20Less%20Than%20or%20Equal%20to%20K/README.md) -- [2312. 卖木头块](/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README.md) - -#### 第 297 场周赛(2022-06-12 10:30, 90 分钟) 参赛人数 5915 - -- [2303. 计算应缴税款总额](/solution/2300-2399/2303.Calculate%20Amount%20Paid%20in%20Taxes/README.md) -- [2304. 网格中的最小路径代价](/solution/2300-2399/2304.Minimum%20Path%20Cost%20in%20a%20Grid/README.md) -- [2305. 公平分发饼干](/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README.md) -- [2306. 公司命名](/solution/2300-2399/2306.Naming%20a%20Company/README.md) - -#### 第 80 场双周赛(2022-06-11 22:30, 90 分钟) 参赛人数 3949 - -- [2299. 强密码检验器 II](/solution/2200-2299/2299.Strong%20Password%20Checker%20II/README.md) -- [2300. 咒语和药水的成功对数](/solution/2300-2399/2300.Successful%20Pairs%20of%20Spells%20and%20Potions/README.md) -- [2301. 替换字符后匹配](/solution/2300-2399/2301.Match%20Substring%20After%20Replacement/README.md) -- [2302. 统计得分小于 K 的子数组数目](/solution/2300-2399/2302.Count%20Subarrays%20With%20Score%20Less%20Than%20K/README.md) - -#### 第 296 场周赛(2022-06-05 10:30, 90 分钟) 参赛人数 5721 - -- [2293. 极大极小游戏](/solution/2200-2299/2293.Min%20Max%20Game/README.md) -- [2294. 划分数组使最大差为 K](/solution/2200-2299/2294.Partition%20Array%20Such%20That%20Maximum%20Difference%20Is%20K/README.md) -- [2295. 替换数组中的元素](/solution/2200-2299/2295.Replace%20Elements%20in%20an%20Array/README.md) -- [2296. 设计一个文本编辑器](/solution/2200-2299/2296.Design%20a%20Text%20Editor/README.md) - -#### 第 295 场周赛(2022-05-29 10:30, 90 分钟) 参赛人数 6447 - -- [2287. 重排字符形成目标字符串](/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README.md) -- [2288. 价格减免](/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README.md) -- [2289. 使数组按非递减顺序排列](/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README.md) -- [2290. 到达角落需要移除障碍物的最小数目](/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README.md) - -#### 第 79 场双周赛(2022-05-28 22:30, 90 分钟) 参赛人数 4250 - -- [2283. 判断一个数的数字计数是否等于数位的值](/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README.md) -- [2284. 最多单词数的发件人](/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README.md) -- [2285. 道路的最大总重要性](/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README.md) -- [2286. 以组为单位订音乐会的门票](/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README.md) - -#### 第 294 场周赛(2022-05-22 10:30, 90 分钟) 参赛人数 6640 - -- [2278. 字母在字符串中的百分比](/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README.md) -- [2279. 装满石头的背包的最大数量](/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README.md) -- [2280. 表示一个折线图的最少线段数](/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README.md) -- [2281. 巫师的总力量和](/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README.md) - -#### 第 293 场周赛(2022-05-15 10:30, 90 分钟) 参赛人数 7357 - -- [2273. 移除字母异位词后的结果数组](/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README.md) -- [2274. 不含特殊楼层的最大连续楼层数](/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README.md) -- [2275. 按位与结果大于零的最长组合](/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README.md) -- [2276. 统计区间中的整数数目](/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README.md) - -#### 第 78 场双周赛(2022-05-14 22:30, 90 分钟) 参赛人数 4347 - -- [2269. 找到一个数字的 K 美丽值](/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README.md) -- [2270. 分割数组的方案数](/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README.md) -- [2271. 毯子覆盖的最多白色砖块数](/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README.md) -- [2272. 最大波动的子字符串](/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README.md) - -#### 第 292 场周赛(2022-05-08 10:30, 90 分钟) 参赛人数 6884 - -- [2264. 字符串中最大的 3 位相同数字](/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README.md) -- [2265. 统计值等于子树平均值的节点数](/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README.md) -- [2266. 统计打字方案数](/solution/2200-2299/2266.Count%20Number%20of%20Texts/README.md) -- [2267. 检查是否有合法括号字符串路径](/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README.md) - -#### 第 291 场周赛(2022-05-01 10:30, 90 分钟) 参赛人数 6574 - -- [2259. 移除指定数字得到的最大结果](/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README.md) -- [2260. 必须拿起的最小连续卡牌数](/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README.md) -- [2261. 含最多 K 个可整除元素的子数组](/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README.md) -- [2262. 字符串的总引力](/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README.md) - -#### 第 77 场双周赛(2022-04-30 22:30, 90 分钟) 参赛人数 4211 - -- [2255. 统计是给定字符串前缀的字符串数目](/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README.md) -- [2256. 最小平均差](/solution/2200-2299/2256.Minimum%20Average%20Difference/README.md) -- [2257. 统计网格图中没有被保卫的格子数](/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README.md) -- [2258. 逃离火灾](/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README.md) - -#### 第 290 场周赛(2022-04-24 10:30, 90 分钟) 参赛人数 6275 - -- [2248. 多个数组求交集](/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README.md) -- [2249. 统计圆内格点数目](/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README.md) -- [2250. 统计包含每个点的矩形数目](/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README.md) -- [2251. 花期内花的数目](/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README.md) - -#### 第 289 场周赛(2022-04-17 10:30, 90 分钟) 参赛人数 7293 - -- [2243. 计算字符串的数字和](/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README.md) -- [2244. 完成所有任务需要的最少轮数](/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README.md) -- [2245. 转角路径的乘积中最多能有几个尾随零](/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README.md) -- [2246. 相邻字符不同的最长路径](/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README.md) - -#### 第 76 场双周赛(2022-04-16 22:30, 90 分钟) 参赛人数 4477 - -- [2239. 找到最接近 0 的数字](/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README.md) -- [2240. 买钢笔和铅笔的方案数](/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README.md) -- [2241. 设计一个 ATM 机器](/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README.md) -- [2242. 节点序列的最大得分](/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README.md) - -#### 第 288 场周赛(2022-04-10 10:30, 90 分钟) 参赛人数 6926 - -- [2231. 按奇偶性交换后的最大数字](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md) -- [2232. 向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md) -- [2233. K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md) -- [2234. 花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md) - -#### 第 287 场周赛(2022-04-03 10:30, 90 分钟) 参赛人数 6811 - -- [2224. 转化时间需要的最少操作数](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README.md) -- [2225. 找出输掉零场或一场比赛的玩家](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README.md) -- [2226. 每个小孩最多能分到多少糖果](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README.md) -- [2227. 加密解密字符串](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README.md) - -#### 第 75 场双周赛(2022-04-02 22:30, 90 分钟) 参赛人数 4335 - -- [2220. 转换数字的最少位翻转次数](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README.md) -- [2221. 数组的三角和](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README.md) -- [2222. 选择建筑的方案数](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README.md) -- [2223. 构造字符串的总得分和](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README.md) - -#### 第 286 场周赛(2022-03-27 10:30, 90 分钟) 参赛人数 7248 - -- [2215. 找出两数组的不同](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README.md) -- [2216. 美化数组的最少删除数](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README.md) -- [2217. 找到指定长度的回文数](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README.md) -- [2218. 从栈中取出 K 个硬币的最大面值和](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README.md) - -#### 第 285 场周赛(2022-03-20 10:30, 90 分钟) 参赛人数 7501 - -- [2210. 统计数组中峰和谷的数量](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README.md) -- [2211. 统计道路上的碰撞次数](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README.md) -- [2212. 射箭比赛中的最大得分](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README.md) -- [2213. 由单个字符重复的最长子字符串](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README.md) - -#### 第 74 场双周赛(2022-03-19 22:30, 90 分钟) 参赛人数 5442 - -- [2206. 将数组划分成相等数对](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README.md) -- [2207. 字符串中最多数目的子序列](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README.md) -- [2208. 将数组和减半的最少操作次数](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README.md) -- [2209. 用地毯覆盖后的最少白色砖块](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README.md) - -#### 第 284 场周赛(2022-03-13 10:30, 90 分钟) 参赛人数 8483 - -- [2200. 找出数组中的所有 K 近邻下标](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README.md) -- [2201. 统计可以提取的工件](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README.md) -- [2202. K 次操作后最大化顶端元素](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README.md) -- [2203. 得到要求路径的最小带权子图](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md) - -#### 第 283 场周赛(2022-03-06 10:30, 90 分钟) 参赛人数 7817 - -- [2194. Excel 表中某个范围内的单元格](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README.md) -- [2195. 向数组中追加 K 个整数](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README.md) -- [2196. 根据描述创建二叉树](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README.md) -- [2197. 替换数组中的非互质数](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README.md) - -#### 第 73 场双周赛(2022-03-05 22:30, 90 分钟) 参赛人数 5132 - -- [2190. 数组中紧跟 key 之后出现最频繁的数字](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README.md) -- [2191. 将杂乱无章的数字排序](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README.md) -- [2192. 有向无环图中一个节点的所有祖先](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README.md) -- [2193. 得到回文串的最少操作次数](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README.md) - -#### 第 282 场周赛(2022-02-27 10:30, 90 分钟) 参赛人数 7164 - -- [2185. 统计包含给定前缀的字符串](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README.md) -- [2186. 制造字母异位词的最小步骤数 II](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README.md) -- [2187. 完成旅途的最少时间](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README.md) -- [2188. 完成比赛的最少时间](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README.md) - -#### 第 281 场周赛(2022-02-20 10:30, 100 分钟) 参赛人数 6005 - -- [2180. 统计各位数字之和为偶数的整数个数](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README.md) -- [2181. 合并零之间的节点](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README.md) -- [2182. 构造限制重复的字符串](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README.md) -- [2183. 统计可以被 K 整除的下标对数目](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README.md) - -#### 第 72 场双周赛(2022-02-19 22:30, 90 分钟) 参赛人数 4400 - -- [2176. 统计数组中相等且可以被整除的数对](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README.md) -- [2177. 找到和为给定整数的三个连续整数](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README.md) -- [2178. 拆分成最多数目的正偶数之和](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README.md) -- [2179. 统计数组中好三元组数目](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README.md) - -#### 第 280 场周赛(2022-02-13 10:30, 90 分钟) 参赛人数 5834 - -- [2169. 得到 0 的操作数](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README.md) -- [2170. 使数组变成交替数组的最少操作数](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README.md) -- [2171. 拿出最少数目的魔法豆](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README.md) -- [2172. 数组的最大与和](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README.md) - -#### 第 279 场周赛(2022-02-06 10:30, 90 分钟) 参赛人数 4132 - -- [2164. 对奇偶下标分别排序](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README.md) -- [2165. 重排数字的最小值](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README.md) -- [2166. 设计位集](/solution/2100-2199/2166.Design%20Bitset/README.md) -- [2167. 移除所有载有违禁货物车厢所需的最少时间](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README.md) - -#### 第 71 场双周赛(2022-02-05 22:30, 90 分钟) 参赛人数 3028 - -- [2160. 拆分数位后四位数字的最小和](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README.md) -- [2161. 根据给定数字划分数组](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README.md) -- [2162. 设置时间的最少代价](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README.md) -- [2163. 删除元素后和的最小差值](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README.md) - -#### 第 278 场周赛(2022-01-30 10:30, 90 分钟) 参赛人数 4643 - -- [2154. 将找到的值乘以 2](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README.md) -- [2155. 分组得分最高的所有下标](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README.md) -- [2156. 查找给定哈希值的子串](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README.md) -- [2157. 字符串分组](/solution/2100-2199/2157.Groups%20of%20Strings/README.md) - -#### 第 277 场周赛(2022-01-23 10:30, 90 分钟) 参赛人数 5060 - -- [2148. 元素计数](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README.md) -- [2149. 按符号重排数组](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README.md) -- [2150. 找出数组中的所有孤独数字](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README.md) -- [2151. 基于陈述统计最多好人数](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README.md) - -#### 第 70 场双周赛(2022-01-22 22:30, 90 分钟) 参赛人数 3640 - -- [2144. 打折购买糖果的最小开销](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README.md) -- [2145. 统计隐藏数组数目](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README.md) -- [2146. 价格范围内最高排名的 K 样物品](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README.md) -- [2147. 分隔长廊的方案数](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README.md) - -#### 第 276 场周赛(2022-01-16 10:30, 90 分钟) 参赛人数 5244 - -- [2138. 将字符串拆分为若干长度为 k 的组](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README.md) -- [2139. 得到目标值的最少行动次数](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README.md) -- [2140. 解决智力问题](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README.md) -- [2141. 同时运行 N 台电脑的最长时间](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README.md) - -#### 第 275 场周赛(2022-01-09 10:30, 90 分钟) 参赛人数 4787 - -- [2133. 检查是否每一行每一列都包含全部整数](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README.md) -- [2134. 最少交换次数来组合所有的 1 II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README.md) -- [2135. 统计追加字母可以获得的单词数](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README.md) -- [2136. 全部开花的最早一天](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README.md) - -#### 第 69 场双周赛(2022-01-08 22:30, 90 分钟) 参赛人数 3360 - -- [2129. 将标题首字母大写](/solution/2100-2199/2129.Capitalize%20the%20Title/README.md) -- [2130. 链表最大孪生和](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md) -- [2131. 连接两字母单词得到的最长回文串](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README.md) -- [2132. 用邮票贴满网格图](/solution/2100-2199/2132.Stamping%20the%20Grid/README.md) - -#### 第 274 场周赛(2022-01-02 10:30, 90 分钟) 参赛人数 4109 - -- [2124. 检查是否所有 A 都在 B 之前](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md) -- [2125. 银行中的激光束数量](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md) -- [2126. 摧毁小行星](/solution/2100-2199/2126.Destroying%20Asteroids/README.md) -- [2127. 参加会议的最多员工数](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md) - -#### 第 273 场周赛(2021-12-26 10:30, 90 分钟) 参赛人数 4368 - -- [2119. 反转两次的数字](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README.md) -- [2120. 执行所有后缀指令](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README.md) -- [2121. 相同元素的间隔之和](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README.md) -- [2122. 还原原数组](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README.md) - -#### 第 68 场双周赛(2021-12-25 22:30, 90 分钟) 参赛人数 2854 - -- [2114. 句子中的最多单词数](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README.md) -- [2115. 从给定原材料中找到所有可以做出的菜](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README.md) -- [2116. 判断一个括号字符串是否有效](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md) -- [2117. 一个区间内所有数乘积的缩写](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README.md) - -#### 第 272 场周赛(2021-12-19 10:30, 90 分钟) 参赛人数 4698 - -- [2108. 找出数组中的第一个回文字符串](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README.md) -- [2109. 向字符串添加空格](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README.md) -- [2110. 股票平滑下跌阶段的数目](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README.md) -- [2111. 使数组 K 递增的最少操作次数](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README.md) - -#### 第 271 场周赛(2021-12-12 10:30, 90 分钟) 参赛人数 4562 - -- [2103. 环和杆](/solution/2100-2199/2103.Rings%20and%20Rods/README.md) -- [2104. 子数组范围和](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README.md) -- [2105. 给植物浇水 II](/solution/2100-2199/2105.Watering%20Plants%20II/README.md) -- [2106. 摘水果](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README.md) - -#### 第 67 场双周赛(2021-12-11 22:30, 90 分钟) 参赛人数 2923 - -- [2099. 找到和最大的长度为 K 的子序列](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README.md) -- [2100. 适合野炊的日子](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README.md) -- [2101. 引爆最多的炸弹](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README.md) -- [2102. 序列顺序查询](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README.md) - -#### 第 270 场周赛(2021-12-05 10:30, 90 分钟) 参赛人数 4748 - -- [2094. 找出 3 位偶数](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README.md) -- [2095. 删除链表的中间节点](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README.md) -- [2096. 从二叉树一个节点到另一个节点每一步的方向](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README.md) -- [2097. 合法重新排列数对](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README.md) - -#### 第 269 场周赛(2021-11-28 10:30, 90 分钟) 参赛人数 4293 - -- [2089. 找出数组排序后的目标下标](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README.md) -- [2090. 半径为 k 的子数组平均值](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README.md) -- [2091. 从数组中移除最大值和最小值](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README.md) -- [2092. 找出知晓秘密的所有专家](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README.md) - -#### 第 66 场双周赛(2021-11-27 22:30, 90 分钟) 参赛人数 2803 - -- [2085. 统计出现过一次的公共字符串](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README.md) -- [2086. 喂食仓鼠的最小食物桶数](/solution/2000-2099/2086.Minimum%20Number%20of%20Food%20Buckets%20to%20Feed%20the%20Hamsters/README.md) -- [2087. 网格图中机器人回家的最小代价](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README.md) -- [2088. 统计农场中肥沃金字塔的数目](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README.md) - -#### 第 268 场周赛(2021-11-21 10:30, 90 分钟) 参赛人数 4398 - -- [2078. 两栋颜色不同且距离最远的房子](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README.md) -- [2079. 给植物浇水](/solution/2000-2099/2079.Watering%20Plants/README.md) -- [2080. 区间内查询数字的频率](/solution/2000-2099/2080.Range%20Frequency%20Queries/README.md) -- [2081. k 镜像数字的和](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README.md) - -#### 第 267 场周赛(2021-11-14 10:30, 90 分钟) 参赛人数 4365 - -- [2073. 买票需要的时间](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README.md) -- [2074. 反转偶数长度组的节点](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README.md) -- [2075. 解码斜向换位密码](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README.md) -- [2076. 处理含限制条件的好友请求](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README.md) - -#### 第 65 场双周赛(2021-11-13 22:30, 90 分钟) 参赛人数 2676 - -- [2068. 检查两个字符串是否几乎相等](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README.md) -- [2069. 模拟行走机器人 II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README.md) -- [2070. 每一个查询的最大美丽值](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README.md) -- [2071. 你可以安排的最多任务数目](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README.md) - -#### 第 266 场周赛(2021-11-07 10:30, 90 分钟) 参赛人数 4385 - -- [2062. 统计字符串中的元音子字符串](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README.md) -- [2063. 所有子字符串中的元音](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README.md) -- [2064. 分配给商店的最多商品的最小值](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README.md) -- [2065. 最大化一张图中的路径价值](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README.md) - -#### 第 265 场周赛(2021-10-31 10:30, 90 分钟) 参赛人数 4182 - -- [2057. 值相等的最小索引](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README.md) -- [2058. 找出临界点之间的最小和最大距离](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README.md) -- [2059. 转化数字的最小运算数](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README.md) -- [2060. 同源字符串检测](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README.md) - -#### 第 64 场双周赛(2021-10-30 22:30, 90 分钟) 参赛人数 2838 - -- [2053. 数组中第 K 个独一无二的字符串](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README.md) -- [2054. 两个最好的不重叠活动](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README.md) -- [2055. 蜡烛之间的盘子](/solution/2000-2099/2055.Plates%20Between%20Candles/README.md) -- [2056. 棋盘上有效移动组合的数目](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README.md) - -#### 第 264 场周赛(2021-10-24 10:30, 90 分钟) 参赛人数 4659 - -- [2047. 句子中的有效单词数](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README.md) -- [2048. 下一个更大的数值平衡数](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README.md) -- [2049. 统计最高分的节点数目](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README.md) -- [2050. 并行课程 III](/solution/2000-2099/2050.Parallel%20Courses%20III/README.md) - -#### 第 263 场周赛(2021-10-17 10:30, 90 分钟) 参赛人数 4572 - -- [2042. 检查句子中的数字是否递增](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README.md) -- [2043. 简易银行系统](/solution/2000-2099/2043.Simple%20Bank%20System/README.md) -- [2044. 统计按位或能得到最大值的子集数目](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README.md) -- [2045. 到达目的地的第二短时间](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README.md) - -#### 第 63 场双周赛(2021-10-16 22:30, 90 分钟) 参赛人数 2828 - -- [2037. 使每位学生都有座位的最少移动次数](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README.md) -- [2038. 如果相邻两个颜色均相同则删除当前颜色](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README.md) -- [2039. 网络空闲的时刻](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README.md) -- [2040. 两个有序数组的第 K 小乘积](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README.md) - -#### 第 262 场周赛(2021-10-10 10:30, 90 分钟) 参赛人数 4261 - -- [2032. 至少在两个数组中出现的值](/solution/2000-2099/2032.Two%20Out%20of%20Three/README.md) -- [2033. 获取单值网格的最小操作数](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README.md) -- [2034. 股票价格波动](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README.md) -- [2035. 将数组分成两个数组并最小化数组和的差](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README.md) - -#### 第 261 场周赛(2021-10-03 10:30, 90 分钟) 参赛人数 3368 - -- [2027. 转换字符串的最少操作次数](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README.md) -- [2028. 找出缺失的观测数据](/solution/2000-2099/2028.Find%20Missing%20Observations/README.md) -- [2029. 石子游戏 IX](/solution/2000-2099/2029.Stone%20Game%20IX/README.md) -- [2030. 含特定字母的最小子序列](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README.md) - -#### 第 62 场双周赛(2021-10-02 22:30, 90 分钟) 参赛人数 2619 - -- [2022. 将一维数组转变成二维数组](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README.md) -- [2023. 连接后等于目标字符串的字符串对](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README.md) -- [2024. 考试的最大困扰度](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README.md) -- [2025. 分割数组的最多方案数](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README.md) - -#### 第 260 场周赛(2021-09-26 10:30, 90 分钟) 参赛人数 3654 - -- [2016. 增量元素之间的最大差值](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README.md) -- [2017. 网格游戏](/solution/2000-2099/2017.Grid%20Game/README.md) -- [2018. 判断单词是否能放入填字游戏内](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README.md) -- [2019. 解出数学表达式的学生分数](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README.md) - -#### 第 259 场周赛(2021-09-19 10:30, 90 分钟) 参赛人数 3775 - -- [2011. 执行操作后的变量值](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README.md) -- [2012. 数组美丽值求和](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README.md) -- [2013. 检测正方形](/solution/2000-2099/2013.Detect%20Squares/README.md) -- [2014. 重复 K 次的最长子序列](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README.md) - -#### 第 61 场双周赛(2021-09-18 22:30, 90 分钟) 参赛人数 2534 - -- [2006. 差的绝对值为 K 的数对数目](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README.md) -- [2007. 从双倍数组中还原原数组](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README.md) -- [2008. 出租车的最大盈利](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md) -- [2009. 使数组连续的最少操作数](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README.md) - -#### 第 258 场周赛(2021-09-12 10:30, 90 分钟) 参赛人数 4519 - -- [2000. 反转单词前缀](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README.md) -- [2001. 可互换矩形的组数](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README.md) -- [2002. 两个回文子序列长度的最大乘积](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README.md) -- [2003. 每棵子树内缺失的最小基因值](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README.md) - -#### 第 257 场周赛(2021-09-05 10:30, 90 分钟) 参赛人数 4278 - -- [1995. 统计特殊四元组](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README.md) -- [1996. 游戏中弱角色的数量](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README.md) -- [1997. 访问完所有房间的第一天](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README.md) -- [1998. 数组的最大公因数排序](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README.md) - -#### 第 60 场双周赛(2021-09-04 22:30, 90 分钟) 参赛人数 2848 - -- [1991. 找到数组的中间位置](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md) -- [1992. 找到所有的农场组](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README.md) -- [1993. 树上的操作](/solution/1900-1999/1993.Operations%20on%20Tree/README.md) -- [1994. 好子集的数目](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README.md) - -#### 第 256 场周赛(2021-08-29 10:30, 90 分钟) 参赛人数 4136 - -- [1984. 学生分数的最小差值](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README.md) -- [1985. 找出数组中的第 K 大整数](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README.md) -- [1986. 完成任务的最少工作时间段](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README.md) -- [1987. 不同的好子序列数目](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README.md) - -#### 第 255 场周赛(2021-08-22 10:30, 90 分钟) 参赛人数 4333 - -- [1979. 找出数组的最大公约数](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README.md) -- [1980. 找出不同的二进制字符串](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README.md) -- [1981. 最小化目标值与所选元素的差](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README.md) -- [1982. 从子集的和还原数组](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README.md) - -#### 第 59 场双周赛(2021-08-21 22:30, 90 分钟) 参赛人数 3030 - -- [1974. 使用特殊打字机键入单词的最少时间](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README.md) -- [1975. 最大方阵和](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README.md) -- [1976. 到达目的地的方案数](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README.md) -- [1977. 划分数字的方案数](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README.md) - -#### 第 254 场周赛(2021-08-15 10:30, 90 分钟) 参赛人数 4349 - -- [1967. 作为子字符串出现在单词中的字符串数目](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README.md) -- [1968. 构造元素不等于两相邻元素平均值的数组](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README.md) -- [1969. 数组元素的最小非零乘积](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README.md) -- [1970. 你能穿过矩阵的最后一天](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README.md) - -#### 第 253 场周赛(2021-08-08 10:30, 90 分钟) 参赛人数 4570 - -- [1961. 检查字符串是否为数组前缀](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README.md) -- [1962. 移除石子使总数最小](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README.md) -- [1963. 使字符串平衡的最小交换次数](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README.md) -- [1964. 找出到每个位置为止最长的有效障碍赛跑路线](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README.md) - -#### 第 58 场双周赛(2021-08-07 22:30, 90 分钟) 参赛人数 2889 - -- [1957. 删除字符使字符串变好](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README.md) -- [1958. 检查操作是否合法](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README.md) -- [1959. K 次调整数组大小浪费的最小总空间](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README.md) -- [1960. 两个回文子字符串长度的最大乘积](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README.md) - -#### 第 252 场周赛(2021-08-01 10:30, 90 分钟) 参赛人数 4647 - -- [1952. 三除数](/solution/1900-1999/1952.Three%20Divisors/README.md) -- [1953. 你可以工作的最大周数](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README.md) -- [1954. 收集足够苹果的最小花园周长](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README.md) -- [1955. 统计特殊子序列的数目](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README.md) - -#### 第 251 场周赛(2021-07-25 10:30, 90 分钟) 参赛人数 4747 - -- [1945. 字符串转化后的各位数字之和](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README.md) -- [1946. 子字符串突变后可能得到的最大整数](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README.md) -- [1947. 最大兼容性评分和](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README.md) -- [1948. 删除系统中的重复文件夹](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README.md) - -#### 第 57 场双周赛(2021-07-24 22:30, 90 分钟) 参赛人数 2933 - -- [1941. 检查是否所有字符出现次数相同](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README.md) -- [1942. 最小未被占据椅子的编号](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README.md) -- [1943. 描述绘画结果](/solution/1900-1999/1943.Describe%20the%20Painting/README.md) -- [1944. 队列中可以看到的人数](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README.md) - -#### 第 250 场周赛(2021-07-18 10:30, 90 分钟) 参赛人数 4315 - -- [1935. 可以输入的最大单词数](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README.md) -- [1936. 新增的最少台阶数](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README.md) -- [1937. 扣分后的最大得分](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README.md) -- [1938. 查询最大基因差](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README.md) - -#### 第 249 场周赛(2021-07-11 10:30, 90 分钟) 参赛人数 4335 - -- [1929. 数组串联](/solution/1900-1999/1929.Concatenation%20of%20Array/README.md) -- [1930. 长度为 3 的不同回文子序列](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README.md) -- [1931. 用三种不同颜色为网格涂色](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README.md) -- [1932. 合并多棵二叉搜索树](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README.md) - -#### 第 56 场双周赛(2021-07-10 22:30, 90 分钟) 参赛人数 2760 - -- [1925. 统计平方和三元组的数目](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README.md) -- [1926. 迷宫中离入口最近的出口](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README.md) -- [1927. 求和游戏](/solution/1900-1999/1927.Sum%20Game/README.md) -- [1928. 规定时间内到达终点的最小花费](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README.md) - -#### 第 248 场周赛(2021-07-04 10:30, 90 分钟) 参赛人数 4451 - -- [1920. 基于排列构建数组](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README.md) -- [1921. 消灭怪物的最大数量](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README.md) -- [1922. 统计好数字的数目](/solution/1900-1999/1922.Count%20Good%20Numbers/README.md) -- [1923. 最长公共子路径](/solution/1900-1999/1923.Longest%20Common%20Subpath/README.md) - -#### 第 247 场周赛(2021-06-27 10:30, 90 分钟) 参赛人数 3981 - -- [1913. 两个数对之间的最大乘积差](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README.md) -- [1914. 循环轮转矩阵](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README.md) -- [1915. 最美子字符串的数目](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README.md) -- [1916. 统计为蚁群构筑房间的不同顺序](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README.md) - -#### 第 55 场双周赛(2021-06-26 22:30, 90 分钟) 参赛人数 3277 - -- [1909. 删除一个元素使数组严格递增](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README.md) -- [1910. 删除一个字符串中所有出现的给定子字符串](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README.md) -- [1911. 最大子序列交替和](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README.md) -- [1912. 设计电影租借系统](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README.md) - -#### 第 246 场周赛(2021-06-20 10:30, 90 分钟) 参赛人数 4136 - -- [1903. 字符串中的最大奇数](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README.md) -- [1904. 你完成的完整对局数](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README.md) -- [1905. 统计子岛屿](/solution/1900-1999/1905.Count%20Sub%20Islands/README.md) -- [1906. 查询差绝对值的最小值](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README.md) - -#### 第 245 场周赛(2021-06-13 10:30, 90 分钟) 参赛人数 4271 - -- [1897. 重新分配字符使所有字符串都相等](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README.md) -- [1898. 可移除字符的最大数目](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md) -- [1899. 合并若干三元组以形成目标三元组](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README.md) -- [1900. 最佳运动员的比拼回合](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README.md) - -#### 第 54 场双周赛(2021-06-12 22:30, 90 分钟) 参赛人数 2479 - -- [1893. 检查是否区域内所有整数都被覆盖](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README.md) -- [1894. 找到需要补充粉笔的学生编号](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md) -- [1895. 最大的幻方](/solution/1800-1899/1895.Largest%20Magic%20Square/README.md) -- [1896. 反转表达式值的最少操作次数](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README.md) - -#### 第 244 场周赛(2021-06-06 10:30, 90 分钟) 参赛人数 4430 - -- [1886. 判断矩阵经轮转后是否一致](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README.md) -- [1887. 使数组元素相等的减少操作次数](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README.md) -- [1888. 使二进制字符串字符交替的最少反转次数](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README.md) -- [1889. 装包裹的最小浪费空间](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README.md) - -#### 第 243 场周赛(2021-05-30 10:30, 90 分钟) 参赛人数 4493 - -- [1880. 检查某单词是否等于两单词之和](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README.md) -- [1881. 插入后的最大值](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README.md) -- [1882. 使用服务器处理任务](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md) -- [1883. 准时抵达会议现场的最小跳过休息次数](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README.md) - -#### 第 53 场双周赛(2021-05-29 22:30, 90 分钟) 参赛人数 3069 - -- [1876. 长度为三且各字符不同的子字符串](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README.md) -- [1877. 数组中最大数对和的最小值](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README.md) -- [1878. 矩阵中最大的三个菱形和](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README.md) -- [1879. 两个数组最小的异或值之和](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README.md) - -#### 第 242 场周赛(2021-05-23 10:30, 90 分钟) 参赛人数 4306 - -- [1869. 哪种连续子字符串更长](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README.md) -- [1870. 准时到达的列车最小时速](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md) -- [1871. 跳跃游戏 VII](/solution/1800-1899/1871.Jump%20Game%20VII/README.md) -- [1872. 石子游戏 VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README.md) - -#### 第 241 场周赛(2021-05-16 10:30, 90 分钟) 参赛人数 4491 - -- [1863. 找出所有子集的异或总和再求和](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README.md) -- [1864. 构成交替字符串需要的最小交换次数](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README.md) -- [1865. 找出和为指定值的下标对](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README.md) -- [1866. 恰有 K 根木棍可以看到的排列数目](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README.md) - -#### 第 52 场双周赛(2021-05-15 22:30, 90 分钟) 参赛人数 2930 - -- [1859. 将句子排序](/solution/1800-1899/1859.Sorting%20the%20Sentence/README.md) -- [1860. 增长的内存泄露](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README.md) -- [1861. 旋转盒子](/solution/1800-1899/1861.Rotating%20the%20Box/README.md) -- [1862. 向下取整数对和](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README.md) - -#### 第 240 场周赛(2021-05-09 10:30, 90 分钟) 参赛人数 4307 - -- [1854. 人口最多的年份](/solution/1800-1899/1854.Maximum%20Population%20Year/README.md) -- [1855. 下标对中的最大距离](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README.md) -- [1856. 子数组最小乘积的最大值](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README.md) -- [1857. 有向图中最大颜色值](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README.md) - -#### 第 239 场周赛(2021-05-02 10:30, 90 分钟) 参赛人数 3907 - -- [1848. 到目标元素的最小距离](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README.md) -- [1849. 将字符串拆分为递减的连续值](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README.md) -- [1850. 邻位交换的最小次数](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README.md) -- [1851. 包含每个查询的最小区间](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README.md) - -#### 第 51 场双周赛(2021-05-01 22:30, 90 分钟) 参赛人数 2675 - -- [1844. 将所有数字用字符替换](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README.md) -- [1845. 座位预约管理系统](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README.md) -- [1846. 减小和重新排列数组后的最大元素](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README.md) -- [1847. 最近的房间](/solution/1800-1899/1847.Closest%20Room/README.md) - -#### 第 238 场周赛(2021-04-25 10:30, 90 分钟) 参赛人数 3978 - -- [1837. K 进制表示下的各位数字总和](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README.md) -- [1838. 最高频元素的频数](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README.md) -- [1839. 所有元音按顺序排布的最长子字符串](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README.md) -- [1840. 最高建筑高度](/solution/1800-1899/1840.Maximum%20Building%20Height/README.md) - -#### 第 237 场周赛(2021-04-18 10:30, 90 分钟) 参赛人数 4577 - -- [1832. 判断句子是否为全字母句](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README.md) -- [1833. 雪糕的最大数量](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README.md) -- [1834. 单线程 CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README.md) -- [1835. 所有数对按位与结果的异或和](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README.md) - -#### 第 50 场双周赛(2021-04-17 22:30, 90 分钟) 参赛人数 3608 - -- [1827. 最少操作使数组递增](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README.md) -- [1828. 统计一个圆中点的数目](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README.md) -- [1829. 每个查询的最大异或值](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README.md) -- [1830. 使字符串有序的最少操作次数](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README.md) - -#### 第 236 场周赛(2021-04-11 10:30, 90 分钟) 参赛人数 5113 - -- [1822. 数组元素积的符号](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README.md) -- [1823. 找出游戏的获胜者](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README.md) -- [1824. 最少侧跳次数](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README.md) -- [1825. 求出 MK 平均值](/solution/1800-1899/1825.Finding%20MK%20Average/README.md) - -#### 第 235 场周赛(2021-04-04 10:30, 90 分钟) 参赛人数 4494 - -- [1816. 截断句子](/solution/1800-1899/1816.Truncate%20Sentence/README.md) -- [1817. 查找用户活跃分钟数](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README.md) -- [1818. 绝对差值和](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README.md) -- [1819. 序列中不同最大公约数的数目](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README.md) - -#### 第 49 场双周赛(2021-04-03 22:30, 90 分钟) 参赛人数 3193 - -- [1812. 判断国际象棋棋盘中一个格子的颜色](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README.md) -- [1813. 句子相似性 III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README.md) -- [1814. 统计一个数组中好对子的数目](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README.md) -- [1815. 得到新鲜甜甜圈的最多组数](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README.md) - -#### 第 234 场周赛(2021-03-28 10:30, 90 分钟) 参赛人数 4998 - -- [1805. 字符串中不同整数的数目](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README.md) -- [1806. 还原排列的最少操作步数](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README.md) -- [1807. 替换字符串中的括号内容](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README.md) -- [1808. 好因子的最大数目](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README.md) - -#### 第 233 场周赛(2021-03-21 10:30, 90 分钟) 参赛人数 5010 - -- [1800. 最大升序子数组和](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README.md) -- [1801. 积压订单中的订单总数](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README.md) -- [1802. 有界数组中指定下标处的最大值](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README.md) -- [1803. 统计异或值在范围内的数对有多少](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README.md) - -#### 第 48 场双周赛(2021-03-20 22:30, 90 分钟) 参赛人数 2853 - -- [1796. 字符串中第二大的数字](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README.md) -- [1797. 设计一个验证系统](/solution/1700-1799/1797.Design%20Authentication%20Manager/README.md) -- [1798. 你能构造出连续值的最大数目](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README.md) -- [1799. N 次操作后的最大分数和](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README.md) - -#### 第 232 场周赛(2021-03-14 10:30, 90 分钟) 参赛人数 4802 - -- [1790. 仅执行一次字符串交换能否使两个字符串相等](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README.md) -- [1791. 找出星型图的中心节点](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README.md) -- [1792. 最大平均通过率](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README.md) -- [1793. 好子数组的最大分数](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README.md) - -#### 第 231 场周赛(2021-03-07 10:30, 90 分钟) 参赛人数 4668 - -- [1784. 检查二进制字符串字段](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README.md) -- [1785. 构成特定和需要添加的最少元素](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README.md) -- [1786. 从第一个节点出发到最后一个节点的受限路径数](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README.md) -- [1787. 使所有区间的异或结果为零](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README.md) - -#### 第 47 场双周赛(2021-03-06 22:30, 90 分钟) 参赛人数 3085 - -- [1779. 找到最近的有相同 X 或 Y 坐标的点](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README.md) -- [1780. 判断一个数字是否可以表示成三的幂的和](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README.md) -- [1781. 所有子字符串美丽值之和](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README.md) -- [1782. 统计点对的数目](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README.md) - -#### 第 230 场周赛(2021-02-28 10:30, 90 分钟) 参赛人数 3728 - -- [1773. 统计匹配检索规则的物品数量](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README.md) -- [1774. 最接近目标价格的甜点成本](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md) -- [1775. 通过最少操作次数使数组的和相等](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README.md) -- [1776. 车队 II](/solution/1700-1799/1776.Car%20Fleet%20II/README.md) - -#### 第 229 场周赛(2021-02-21 10:30, 90 分钟) 参赛人数 3484 - -- [1768. 交替合并字符串](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README.md) -- [1769. 移动所有球到每个盒子所需的最小操作数](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README.md) -- [1770. 执行乘法运算的最大分数](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README.md) -- [1771. 由子序列构造的最长回文串的长度](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README.md) - -#### 第 46 场双周赛(2021-02-20 22:30, 90 分钟) 参赛人数 1647 - -- [1763. 最长的美好子字符串](/solution/1700-1799/1763.Longest%20Nice%20Substring/README.md) -- [1764. 通过连接另一个数组的子数组得到一个数组](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README.md) -- [1765. 地图中的最高点](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md) -- [1766. 互质树](/solution/1700-1799/1766.Tree%20of%20Coprimes/README.md) - -#### 第 228 场周赛(2021-02-14 10:30, 90 分钟) 参赛人数 2484 - -- [1758. 生成交替二进制字符串的最少操作数](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README.md) -- [1759. 统计同质子字符串的数目](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README.md) -- [1760. 袋子里最少数目的球](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README.md) -- [1761. 一个图中连通三元组的最小度数](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README.md) - -#### 第 227 场周赛(2021-02-07 10:30, 90 分钟) 参赛人数 3546 - -- [1752. 检查数组是否经排序和轮转得到](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md) -- [1753. 移除石子的最大得分](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md) -- [1754. 构造字典序最大的合并字符串](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md) -- [1755. 最接近目标值的子序列和](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md) - -#### 第 45 场双周赛(2021-02-06 22:30, 90 分钟) 参赛人数 1676 - -- [1748. 唯一元素的和](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md) -- [1749. 任意子数组和的绝对值的最大值](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md) -- [1750. 删除字符串两端相同字符后的最短长度](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md) -- [1751. 最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md) - -#### 第 226 场周赛(2021-01-31 10:30, 90 分钟) 参赛人数 4034 - -- [1742. 盒子中小球的最大数量](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md) -- [1743. 从相邻元素对还原数组](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md) -- [1744. 你能在你最喜欢的那天吃到你最喜欢的糖果吗？](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md) -- [1745. 分割回文串 IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md) - -#### 第 225 场周赛(2021-01-24 10:30, 90 分钟) 参赛人数 3853 - -- [1736. 替换隐藏数字得到的最晚时间](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md) -- [1737. 满足三条件之一需改变的最少字符数](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md) -- [1738. 找出第 K 大的异或坐标值](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md) -- [1739. 放置盒子](/solution/1700-1799/1739.Building%20Boxes/README.md) - -#### 第 44 场双周赛(2021-01-23 22:30, 90 分钟) 参赛人数 1826 - -- [1732. 找到最高海拔](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md) -- [1733. 需要教语言的最少人数](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md) -- [1734. 解码异或后的排列](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md) -- [1735. 生成乘积数组的方案数](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md) - -#### 第 224 场周赛(2021-01-17 10:30, 90 分钟) 参赛人数 3795 - -- [1725. 可以形成最大正方形的矩形数目](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README.md) -- [1726. 同积元组](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README.md) -- [1727. 重新排列后的最大子矩阵](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README.md) -- [1728. 猫和老鼠 II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README.md) - -#### 第 223 场周赛(2021-01-10 10:30, 90 分钟) 参赛人数 3872 - -- [1720. 解码异或后的数组](/solution/1700-1799/1720.Decode%20XORed%20Array/README.md) -- [1721. 交换链表中的节点](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README.md) -- [1722. 执行交换操作后的最小汉明距离](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README.md) -- [1723. 完成所有工作的最短时间](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md) - -#### 第 43 场双周赛(2021-01-09 22:30, 90 分钟) 参赛人数 1631 - -- [1716. 计算力扣银行的钱](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README.md) -- [1717. 删除子字符串的最大得分](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README.md) -- [1718. 构建字典序最大的可行序列](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README.md) -- [1719. 重构一棵树的方案数](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README.md) - -#### 第 222 场周赛(2021-01-03 10:30, 90 分钟) 参赛人数 3119 - -- [1710. 卡车上的最大单元数](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README.md) -- [1711. 大餐计数](/solution/1700-1799/1711.Count%20Good%20Meals/README.md) -- [1712. 将数组分成三个子数组的方案数](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README.md) -- [1713. 得到子序列的最少操作次数](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README.md) - -#### 第 221 场周赛(2020-12-27 10:30, 90 分钟) 参赛人数 3398 - -- [1704. 判断字符串的两半是否相似](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README.md) -- [1705. 吃苹果的最大数目](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README.md) -- [1706. 球会落何处](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README.md) -- [1707. 与数组中元素的最大异或值](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README.md) - -#### 第 42 场双周赛(2020-12-26 22:30, 90 分钟) 参赛人数 1578 - -- [1700. 无法吃午餐的学生数量](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md) -- [1701. 平均等待时间](/solution/1700-1799/1701.Average%20Waiting%20Time/README.md) -- [1702. 修改后的最大二进制字符串](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README.md) -- [1703. 得到连续 K 个 1 的最少相邻交换次数](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README.md) - -#### 第 220 场周赛(2020-12-20 10:30, 90 分钟) 参赛人数 3691 - -- [1694. 重新格式化电话号码](/solution/1600-1699/1694.Reformat%20Phone%20Number/README.md) -- [1695. 删除子数组的最大得分](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md) -- [1696. 跳跃游戏 VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md) -- [1697. 检查边长度限制的路径是否存在](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md) - -#### 第 219 场周赛(2020-12-13 10:30, 90 分钟) 参赛人数 3710 - -- [1688. 比赛中的配对次数](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README.md) -- [1689. 十-二进制数的最少数目](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README.md) -- [1690. 石子游戏 VII](/solution/1600-1699/1690.Stone%20Game%20VII/README.md) -- [1691. 堆叠长方体的最大高度](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md) - -#### 第 41 场双周赛(2020-12-12 22:30, 90 分钟) 参赛人数 1660 - -- [1684. 统计一致字符串的数目](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README.md) -- [1685. 有序数组中差绝对值之和](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README.md) -- [1686. 石子游戏 VI](/solution/1600-1699/1686.Stone%20Game%20VI/README.md) -- [1687. 从仓库到码头运输箱子](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README.md) - -#### 第 218 场周赛(2020-12-06 10:30, 90 分钟) 参赛人数 3762 - -- [1678. 设计 Goal 解析器](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md) -- [1679. K 和数对的最大数目](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md) -- [1680. 连接连续二进制数字](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README.md) -- [1681. 最小不兼容性](/solution/1600-1699/1681.Minimum%20Incompatibility/README.md) - -#### 第 217 场周赛(2020-11-29 10:30, 90 分钟) 参赛人数 3745 - -- [1672. 最富有客户的资产总量](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README.md) -- [1673. 找出最具竞争力的子序列](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README.md) -- [1674. 使数组互补的最少操作次数](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README.md) -- [1675. 数组的最小偏移量](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README.md) - -#### 第 40 场双周赛(2020-11-28 22:30, 90 分钟) 参赛人数 1891 - -- [1668. 最大重复子字符串](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README.md) -- [1669. 合并两个链表](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README.md) -- [1670. 设计前中后队列](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README.md) -- [1671. 得到山形数组的最少删除次数](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README.md) - -#### 第 216 场周赛(2020-11-22 10:30, 90 分钟) 参赛人数 3857 - -- [1662. 检查两个字符串数组是否相等](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README.md) -- [1663. 具有给定数值的最小字符串](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README.md) -- [1664. 生成平衡数组的方案数](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README.md) -- [1665. 完成所有任务的最少初始能量](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README.md) - -#### 第 215 场周赛(2020-11-15 10:30, 90 分钟) 参赛人数 4429 - -- [1656. 设计有序流](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README.md) -- [1657. 确定两个字符串是否接近](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README.md) -- [1658. 将 x 减到 0 的最小操作数](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README.md) -- [1659. 最大化网格幸福感](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README.md) - -#### 第 39 场双周赛(2020-11-14 22:30, 90 分钟) 参赛人数 2069 - -- [1652. 拆炸弹](/solution/1600-1699/1652.Defuse%20the%20Bomb/README.md) -- [1653. 使字符串平衡的最少删除次数](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README.md) -- [1654. 到家的最少跳跃次数](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README.md) -- [1655. 分配重复整数](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README.md) - -#### 第 214 场周赛(2020-11-08 10:30, 90 分钟) 参赛人数 3598 - -- [1646. 获取生成数组中的最大值](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README.md) -- [1647. 字符频次唯一的最小删除次数](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README.md) -- [1648. 销售价值减少的颜色球](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README.md) -- [1649. 通过指令创建有序数组](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md) - -#### 第 213 场周赛(2020-11-01 10:30, 90 分钟) 参赛人数 3827 - -- [1640. 能否连接形成数组](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README.md) -- [1641. 统计字典序元音字符串的数目](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README.md) -- [1642. 可以到达的最远建筑](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README.md) -- [1643. 第 K 条最小指令](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README.md) - -#### 第 38 场双周赛(2020-10-31 22:30, 90 分钟) 参赛人数 2004 - -- [1636. 按照频率将数组升序排序](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README.md) -- [1637. 两点之间不包含任何点的最宽垂直区域](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README.md) -- [1638. 统计只差一个字符的子串数目](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README.md) -- [1639. 通过给定词典构造目标字符串的方案数](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README.md) - -#### 第 212 场周赛(2020-10-25 10:30, 90 分钟) 参赛人数 4227 - -- [1629. 按键持续时间最长的键](/solution/1600-1699/1629.Slowest%20Key/README.md) -- [1630. 等差子数组](/solution/1600-1699/1630.Arithmetic%20Subarrays/README.md) -- [1631. 最小体力消耗路径](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README.md) -- [1632. 矩阵转换后的秩](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README.md) - -#### 第 211 场周赛(2020-10-18 10:30, 90 分钟) 参赛人数 4034 - -- [1624. 两个相同字符之间的最长子字符串](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README.md) -- [1625. 执行操作后字典序最小的字符串](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README.md) -- [1626. 无矛盾的最佳球队](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md) -- [1627. 带阈值的图连通性](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README.md) - -#### 第 37 场双周赛(2020-10-17 22:30, 90 分钟) 参赛人数 2104 - -- [1619. 删除某些元素后的数组均值](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README.md) -- [1620. 网络信号最好的坐标](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README.md) -- [1621. 大小为 K 的不重叠线段的数目](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README.md) -- [1622. 奇妙序列](/solution/1600-1699/1622.Fancy%20Sequence/README.md) - -#### 第 210 场周赛(2020-10-11 10:30, 90 分钟) 参赛人数 4007 - -- [1614. 括号的最大嵌套深度](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README.md) -- [1615. 最大网络秩](/solution/1600-1699/1615.Maximal%20Network%20Rank/README.md) -- [1616. 分割两个字符串得到回文串](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README.md) -- [1617. 统计子树中城市之间最大距离](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README.md) - -#### 第 209 场周赛(2020-10-04 10:30, 90 分钟) 参赛人数 4023 - -- [1608. 特殊数组的特征值](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README.md) -- [1609. 奇偶树](/solution/1600-1699/1609.Even%20Odd%20Tree/README.md) -- [1610. 可见点的最大数目](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README.md) -- [1611. 使整数变为 0 的最少操作次数](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README.md) - -#### 第 36 场双周赛(2020-10-03 22:30, 90 分钟) 参赛人数 2204 - -- [1603. 设计停车系统](/solution/1600-1699/1603.Design%20Parking%20System/README.md) -- [1604. 警告一小时内使用相同员工卡大于等于三次的人](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README.md) -- [1605. 给定行和列的和求可行矩阵](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README.md) -- [1606. 找到处理最多请求的服务器](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README.md) - -#### 第 208 场周赛(2020-09-27 10:30, 90 分钟) 参赛人数 3582 - -- [1598. 文件夹操作日志搜集器](/solution/1500-1599/1598.Crawler%20Log%20Folder/README.md) -- [1599. 经营摩天轮的最大利润](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README.md) -- [1600. 王位继承顺序](/solution/1600-1699/1600.Throne%20Inheritance/README.md) -- [1601. 最多可达成的换楼请求数目](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README.md) - -#### 第 207 场周赛(2020-09-20 10:30, 90 分钟) 参赛人数 4116 - -- [1592. 重新排列单词间的空格](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README.md) -- [1593. 拆分字符串使唯一子字符串的数目最大](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README.md) -- [1594. 矩阵的最大非负积](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README.md) -- [1595. 连通两组点的最小成本](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README.md) - -#### 第 35 场双周赛(2020-09-19 22:30, 90 分钟) 参赛人数 2839 - -- [1588. 所有奇数长度子数组的和](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README.md) -- [1589. 所有排列中的最大和](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README.md) -- [1590. 使数组和能被 P 整除](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README.md) -- [1591. 奇怪的打印机 II](/solution/1500-1599/1591.Strange%20Printer%20II/README.md) - -#### 第 206 场周赛(2020-09-13 10:30, 90 分钟) 参赛人数 4493 - -- [1582. 二进制矩阵中的特殊位置](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README.md) -- [1583. 统计不开心的朋友](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README.md) -- [1584. 连接所有点的最小费用](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md) -- [1585. 检查字符串是否可以通过排序子字符串得到另一个字符串](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README.md) - -#### 第 205 场周赛(2020-09-06 10:30, 90 分钟) 参赛人数 4176 - -- [1576. 替换所有的问号](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md) -- [1577. 数的平方等于两数乘积的方法数](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md) -- [1578. 使绳子变成彩色的最短时间](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README.md) -- [1579. 保证图可完全遍历](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md) - -#### 第 34 场双周赛(2020-09-05 22:30, 90 分钟) 参赛人数 2842 - -- [1572. 矩阵对角线元素的和](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README.md) -- [1573. 分割字符串的方案数](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md) -- [1574. 删除最短的子数组使剩余数组有序](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md) -- [1575. 统计所有可行路径](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md) - -#### 第 204 场周赛(2020-08-30 10:30, 90 分钟) 参赛人数 4487 - -- [1566. 重复至少 K 次且长度为 M 的模式](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README.md) -- [1567. 乘积为正数的最长子数组长度](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README.md) -- [1568. 使陆地分离的最少天数](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README.md) -- [1569. 将子数组重新排序得到同一个二叉搜索树的方案数](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README.md) - -#### 第 203 场周赛(2020-08-23 10:30, 90 分钟) 参赛人数 5285 - -- [1560. 圆形赛道上经过次数最多的扇区](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README.md) -- [1561. 你可以获得的最大硬币数目](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README.md) -- [1562. 查找大小为 M 的最新分组](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README.md) -- [1563. 石子游戏 V](/solution/1500-1599/1563.Stone%20Game%20V/README.md) - -#### 第 33 场双周赛(2020-08-22 22:30, 90 分钟) 参赛人数 3304 - -- [1556. 千位分隔数](/solution/1500-1599/1556.Thousand%20Separator/README.md) -- [1557. 可以到达所有点的最少点数目](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README.md) -- [1558. 得到目标数组的最少函数调用次数](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README.md) -- [1559. 二维网格图中探测环](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md) - -#### 第 202 场周赛(2020-08-16 10:30, 90 分钟) 参赛人数 4990 - -- [1550. 存在连续三个奇数的数组](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README.md) -- [1551. 使数组中所有元素相等的最小操作数](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README.md) -- [1552. 两球之间的磁力](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README.md) -- [1553. 吃掉 N 个橘子的最少天数](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README.md) - -#### 第 201 场周赛(2020-08-09 10:30, 90 分钟) 参赛人数 5615 - -- [1544. 整理字符串](/solution/1500-1599/1544.Make%20The%20String%20Great/README.md) -- [1545. 找出第 N 个二进制字符串中的第 K 位](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README.md) -- [1546. 和为目标值且不重叠的非空子数组的最大数目](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README.md) -- [1547. 切棍子的最小成本](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README.md) - -#### 第 32 场双周赛(2020-08-08 22:30, 90 分钟) 参赛人数 2957 - -- [1539. 第 k 个缺失的正整数](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README.md) -- [1540. K 次操作转变字符串](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README.md) -- [1541. 平衡括号字符串的最少插入次数](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md) -- [1542. 找出最长的超赞子字符串](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README.md) - -#### 第 200 场周赛(2020-08-02 10:30, 90 分钟) 参赛人数 5476 - -- [1534. 统计好三元组](/solution/1500-1599/1534.Count%20Good%20Triplets/README.md) -- [1535. 找出数组游戏的赢家](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README.md) -- [1536. 排布二进制网格的最少交换次数](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README.md) -- [1537. 最大得分](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README.md) - -#### 第 199 场周赛(2020-07-26 10:30, 90 分钟) 参赛人数 5232 - -- [1528. 重新排列字符串](/solution/1500-1599/1528.Shuffle%20String/README.md) -- [1529. 最少的后缀翻转次数](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README.md) -- [1530. 好叶子节点对的数量](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README.md) -- [1531. 压缩字符串 II](/solution/1500-1599/1531.String%20Compression%20II/README.md) - -#### 第 31 场双周赛(2020-07-25 22:30, 90 分钟) 参赛人数 2767 - -- [1523. 在区间范围内统计奇数数目](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README.md) -- [1524. 和为奇数的子数组数目](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README.md) -- [1525. 字符串的好分割数目](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README.md) -- [1526. 形成目标数组的子数组最少增加次数](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README.md) - -#### 第 198 场周赛(2020-07-19 10:30, 90 分钟) 参赛人数 5780 - -- [1518. 换水问题](/solution/1500-1599/1518.Water%20Bottles/README.md) -- [1519. 子树中标签相同的节点数](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README.md) -- [1520. 最多的不重叠子字符串](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README.md) -- [1521. 找到最接近目标值的函数值](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README.md) - -#### 第 197 场周赛(2020-07-12 10:30, 90 分钟) 参赛人数 5275 - -- [1512. 好数对的数目](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README.md) -- [1513. 仅含 1 的子串数](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md) -- [1514. 概率最大的路径](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README.md) -- [1515. 服务中心的最佳位置](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README.md) - -#### 第 30 场双周赛(2020-07-11 22:30, 90 分钟) 参赛人数 2545 - -- [1507. 转变日期格式](/solution/1500-1599/1507.Reformat%20Date/README.md) -- [1508. 子数组和排序后的区间和](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README.md) -- [1509. 三次操作后最大值与最小值的最小差](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README.md) -- [1510. 石子游戏 IV](/solution/1500-1599/1510.Stone%20Game%20IV/README.md) - -#### 第 196 场周赛(2020-07-05 10:30, 90 分钟) 参赛人数 5507 - -- [1502. 判断能否形成等差数列](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README.md) -- [1503. 所有蚂蚁掉下来前的最后一刻](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README.md) -- [1504. 统计全 1 子矩形](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README.md) -- [1505. 最多 K 次交换相邻数位后得到的最小整数](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README.md) - -#### 第 195 场周赛(2020-06-28 10:30, 90 分钟) 参赛人数 3401 - -- [1496. 判断路径是否相交](/solution/1400-1499/1496.Path%20Crossing/README.md) -- [1497. 检查数组对是否可以被 k 整除](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README.md) -- [1498. 满足条件的子序列数目](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README.md) -- [1499. 满足不等式的最大值](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README.md) - -#### 第 29 场双周赛(2020-06-27 22:30, 90 分钟) 参赛人数 2260 - -- [1491. 去掉最低工资和最高工资后的工资平均值](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README.md) -- [1492. n 的第 k 个因子](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README.md) -- [1493. 删掉一个元素以后全为 1 的最长子数组](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README.md) -- [1494. 并行课程 II](/solution/1400-1499/1494.Parallel%20Courses%20II/README.md) - -#### 第 194 场周赛(2020-06-21 10:30, 90 分钟) 参赛人数 4378 - -- [1486. 数组异或操作](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README.md) -- [1487. 保证文件名唯一](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README.md) -- [1488. 避免洪水泛滥](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README.md) -- [1489. 找到最小生成树里的关键边和伪关键边](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README.md) - -#### 第 193 场周赛(2020-06-14 10:30, 90 分钟) 参赛人数 3804 - -- [1480. 一维数组的动态和](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README.md) -- [1481. 不同整数的最少数目](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README.md) -- [1482. 制作 m 束花所需的最少天数](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README.md) -- [1483. 树节点的第 K 个祖先](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md) - -#### 第 28 场双周赛(2020-06-13 22:30, 90 分钟) 参赛人数 2144 - -- [1475. 商品折扣后的最终价格](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README.md) -- [1476. 子矩形查询](/solution/1400-1499/1476.Subrectangle%20Queries/README.md) -- [1477. 找两个和为目标值且不重叠的子数组](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README.md) -- [1478. 安排邮筒](/solution/1400-1499/1478.Allocate%20Mailboxes/README.md) - -#### 第 192 场周赛(2020-06-07 10:30, 90 分钟) 参赛人数 3615 - -- [1470. 重新排列数组](/solution/1400-1499/1470.Shuffle%20the%20Array/README.md) -- [1471. 数组中的 k 个最强值](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README.md) -- [1472. 设计浏览器历史记录](/solution/1400-1499/1472.Design%20Browser%20History/README.md) -- [1473. 粉刷房子 III](/solution/1400-1499/1473.Paint%20House%20III/README.md) - -#### 第 191 场周赛(2020-05-31 10:30, 90 分钟) 参赛人数 3687 - -- [1464. 数组中两元素的最大乘积](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README.md) -- [1465. 切割后面积最大的蛋糕](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README.md) -- [1466. 重新规划路线](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README.md) -- [1467. 两个盒子中球的颜色数相同的概率](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README.md) - -#### 第 27 场双周赛(2020-05-30 22:30, 90 分钟) 参赛人数 1966 - -- [1460. 通过翻转子数组使两个数组相等](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README.md) -- [1461. 检查一个字符串是否包含所有长度为 K 的二进制子串](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README.md) -- [1462. 课程表 IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README.md) -- [1463. 摘樱桃 II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README.md) - -#### 第 190 场周赛(2020-05-24 10:30, 90 分钟) 参赛人数 3352 - -- [1455. 检查单词是否为句中其他单词的前缀](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README.md) -- [1456. 定长子串中元音的最大数目](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README.md) -- [1457. 二叉树中的伪回文路径](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README.md) -- [1458. 两个子序列的最大点积](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README.md) - -#### 第 189 场周赛(2020-05-17 10:30, 90 分钟) 参赛人数 3692 - -- [1450. 在既定时间做作业的学生人数](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README.md) -- [1451. 重新排列句子中的单词](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README.md) -- [1452. 收藏清单](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README.md) -- [1453. 圆形靶内的最大飞镖数量](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README.md) - -#### 第 26 场双周赛(2020-05-16 22:30, 90 分钟) 参赛人数 1971 - -- [1446. 连续字符](/solution/1400-1499/1446.Consecutive%20Characters/README.md) -- [1447. 最简分数](/solution/1400-1499/1447.Simplified%20Fractions/README.md) -- [1448. 统计二叉树中好节点的数目](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README.md) -- [1449. 数位成本和为目标值的最大数字](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README.md) - -#### 第 188 场周赛(2020-05-10 10:30, 90 分钟) 参赛人数 3982 - -- [1441. 用栈操作构建数组](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README.md) -- [1442. 形成两个异或相等数组的三元组数目](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README.md) -- [1443. 收集树上所有苹果的最少时间](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README.md) -- [1444. 切披萨的方案数](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md) - -#### 第 187 场周赛(2020-05-03 10:30, 90 分钟) 参赛人数 3109 - -- [1436. 旅行终点站](/solution/1400-1499/1436.Destination%20City/README.md) -- [1437. 是否所有 1 都至少相隔 k 个元素](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README.md) -- [1438. 绝对差不超过限制的最长连续子数组](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README.md) -- [1439. 有序矩阵中的第 k 个最小数组和](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README.md) - -#### 第 25 场双周赛(2020-05-02 22:30, 90 分钟) 参赛人数 1832 - -- [1431. 拥有最多糖果的孩子](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README.md) -- [1432. 改变一个整数能得到的最大差值](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README.md) -- [1433. 检查一个字符串是否可以打破另一个字符串](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README.md) -- [1434. 每个人戴不同帽子的方案数](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README.md) - -#### 第 186 场周赛(2020-04-26 10:30, 90 分钟) 参赛人数 3108 - -- [1422. 分割字符串的最大得分](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README.md) -- [1423. 可获得的最大点数](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README.md) -- [1424. 对角线遍历 II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README.md) -- [1425. 带限制的子序列和](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md) - -#### 第 185 场周赛(2020-04-19 10:30, 90 分钟) 参赛人数 5004 - -- [1417. 重新格式化字符串](/solution/1400-1499/1417.Reformat%20The%20String/README.md) -- [1418. 点菜展示表](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README.md) -- [1419. 数青蛙](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README.md) -- [1420. 生成数组](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README.md) - -#### 第 24 场双周赛(2020-04-18 22:30, 90 分钟) 参赛人数 1898 - -- [1413. 逐步求和得到正数的最小值](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README.md) -- [1414. 和为 K 的最少斐波那契数字数目](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README.md) -- [1415. 长度为 n 的开心字符串中字典序第 k 小的字符串](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README.md) -- [1416. 恢复数组](/solution/1400-1499/1416.Restore%20The%20Array/README.md) - -#### 第 184 场周赛(2020-04-12 10:30, 90 分钟) 参赛人数 3847 - -- [1408. 数组中的字符串匹配](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README.md) -- [1409. 查询带键的排列](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README.md) -- [1410. HTML 实体解析器](/solution/1400-1499/1410.HTML%20Entity%20Parser/README.md) -- [1411. 给 N x 3 网格图涂色的方案数](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README.md) - -#### 第 183 场周赛(2020-04-05 10:30, 90 分钟) 参赛人数 3756 - -- [1403. 非递增顺序的最小子序列](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md) -- [1404. 将二进制表示减到 1 的步骤数](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md) -- [1405. 最长快乐字符串](/solution/1400-1499/1405.Longest%20Happy%20String/README.md) -- [1406. 石子游戏 III](/solution/1400-1499/1406.Stone%20Game%20III/README.md) - -#### 第 23 场双周赛(2020-04-04 22:30, 90 分钟) 参赛人数 2045 - -- [1399. 统计最大组的数目](/solution/1300-1399/1399.Count%20Largest%20Group/README.md) -- [1400. 构造 K 个回文字符串](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md) -- [1401. 圆和矩形是否有重叠](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md) -- [1402. 做菜顺序](/solution/1400-1499/1402.Reducing%20Dishes/README.md) - -#### 第 182 场周赛(2020-03-29 10:30, 90 分钟) 参赛人数 3911 - -- [1394. 找出数组中的幸运数](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README.md) -- [1395. 统计作战单位数](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README.md) -- [1396. 设计地铁系统](/solution/1300-1399/1396.Design%20Underground%20System/README.md) -- [1397. 找到所有好字符串](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README.md) - -#### 第 181 场周赛(2020-03-22 10:30, 90 分钟) 参赛人数 4149 - -- [1389. 按既定顺序创建目标数组](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README.md) -- [1390. 四因数](/solution/1300-1399/1390.Four%20Divisors/README.md) -- [1391. 检查网格中是否存在有效路径](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README.md) -- [1392. 最长快乐前缀](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README.md) - -#### 第 22 场双周赛(2020-03-21 22:30, 90 分钟) 参赛人数 2042 - -- [1385. 两个数组间的距离值](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README.md) -- [1386. 安排电影院座位](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README.md) -- [1387. 将整数按权重排序](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README.md) -- [1388. 3n 块披萨](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README.md) - -#### 第 180 场周赛(2020-03-15 10:30, 90 分钟) 参赛人数 3715 - -- [1380. 矩阵中的幸运数](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md) -- [1381. 设计一个支持增量操作的栈](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md) -- [1382. 将二叉搜索树变平衡](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md) -- [1383. 最大的团队表现值](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md) - -#### 第 179 场周赛(2020-03-08 10:30, 90 分钟) 参赛人数 3606 - -- [1374. 生成每种字符都是奇数个的字符串](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README.md) -- [1375. 二进制字符串前缀一致的次数](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README.md) -- [1376. 通知所有员工所需的时间](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md) -- [1377. T 秒后青蛙的位置](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md) - -#### 第 21 场双周赛(2020-03-07 22:30, 90 分钟) 参赛人数 1913 - -- [1370. 上升下降字符串](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README.md) -- [1371. 每个元音包含偶数次的最长子字符串](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md) -- [1372. 二叉树中的最长交错路径](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README.md) -- [1373. 二叉搜索子树的最大键值和](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README.md) - -#### 第 178 场周赛(2020-03-01 10:30, 90 分钟) 参赛人数 3305 - -- [1365. 有多少小于当前数字的数字](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README.md) -- [1366. 通过投票对团队排名](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README.md) -- [1367. 二叉树中的链表](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README.md) -- [1368. 使网格图至少有一条有效路径的最小代价](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md) - -#### 第 177 场周赛(2020-02-23 10:30, 90 分钟) 参赛人数 2986 - -- [1360. 日期之间隔几天](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README.md) -- [1361. 验证二叉树](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README.md) -- [1362. 最接近的因数](/solution/1300-1399/1362.Closest%20Divisors/README.md) -- [1363. 形成三的最大倍数](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README.md) - -#### 第 20 场双周赛(2020-02-22 22:30, 90 分钟) 参赛人数 1541 - -- [1356. 根据数字二进制下 1 的数目排序](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README.md) -- [1357. 每隔 n 个顾客打折](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README.md) -- [1358. 包含所有三种字符的子字符串数目](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README.md) -- [1359. 有效的快递序列数目](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README.md) - -#### 第 176 场周赛(2020-02-16 10:30, 90 分钟) 参赛人数 2410 - -- [1351. 统计有序矩阵中的负数](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README.md) -- [1352. 最后 K 个数的乘积](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README.md) -- [1353. 最多可以参加的会议数目](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README.md) -- [1354. 多次求和构造目标数组](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README.md) - -#### 第 175 场周赛(2020-02-09 10:30, 90 分钟) 参赛人数 2048 - -- [1346. 检查整数及其两倍数是否存在](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README.md) -- [1347. 制造字母异位词的最小步骤数](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README.md) -- [1348. 推文计数](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README.md) -- [1349. 参加考试的最大学生数](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README.md) - -#### 第 19 场双周赛(2020-02-08 22:30, 90 分钟) 参赛人数 1120 - -- [1342. 将数字变成 0 的操作次数](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README.md) -- [1343. 大小为 K 且平均值大于等于阈值的子数组数目](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README.md) -- [1344. 时钟指针的夹角](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README.md) -- [1345. 跳跃游戏 IV](/solution/1300-1399/1345.Jump%20Game%20IV/README.md) - -#### 第 174 场周赛(2020-02-02 10:30, 90 分钟) 参赛人数 1660 - -- [1337. 矩阵中战斗力最弱的 K 行](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README.md) -- [1338. 数组大小减半](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README.md) -- [1339. 分裂二叉树的最大乘积](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README.md) -- [1340. 跳跃游戏 V](/solution/1300-1399/1340.Jump%20Game%20V/README.md) - -#### 第 173 场周赛(2020-01-26 10:30, 90 分钟) 参赛人数 1072 - -- [1332. 删除回文子序列](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README.md) -- [1333. 餐厅过滤器](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README.md) -- [1334. 阈值距离内邻居最少的城市](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README.md) -- [1335. 工作计划的最低难度](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README.md) - -#### 第 18 场双周赛(2020-01-25 22:30, 90 分钟) 参赛人数 587 - -- [1331. 数组序号转换](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README.md) -- [1328. 破坏回文串](/solution/1300-1399/1328.Break%20a%20Palindrome/README.md) -- [1329. 将矩阵按对角线排序](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README.md) -- [1330. 翻转子数组得到最大的数组值](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md) - -#### 第 172 场周赛(2020-01-19 10:30, 90 分钟) 参赛人数 1415 - -- [1323. 6 和 9 组成的最大数字](/solution/1300-1399/1323.Maximum%2069%20Number/README.md) -- [1324. 竖直打印单词](/solution/1300-1399/1324.Print%20Words%20Vertically/README.md) -- [1325. 删除给定值的叶子节点](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README.md) -- [1326. 灌溉花园的最少水龙头数目](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md) - -#### 第 171 场周赛(2020-01-12 10:30, 90 分钟) 参赛人数 1708 - -- [1317. 将整数转换为两个无零整数的和](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README.md) -- [1318. 或运算的最小翻转次数](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README.md) -- [1319. 连通网络的操作次数](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README.md) -- [1320. 二指输入的的最小距离](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README.md) - -#### 第 17 场双周赛(2020-01-11 22:30, 90 分钟) 参赛人数 897 - -- [1313. 解压缩编码列表](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README.md) -- [1314. 矩阵区域和](/solution/1300-1399/1314.Matrix%20Block%20Sum/README.md) -- [1315. 祖父节点值为偶数的节点和](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README.md) -- [1316. 不同的循环子字符串](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README.md) - -#### 第 170 场周赛(2020-01-05 10:30, 90 分钟) 参赛人数 1649 - -- [1309. 解码字母到整数映射](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README.md) -- [1310. 子数组异或查询](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README.md) -- [1311. 获取你好友已观看的视频](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README.md) -- [1312. 让字符串成为回文串的最少插入次数](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md) - -#### 第 169 场周赛(2019-12-29 10:30, 90 分钟) 参赛人数 1568 - -- [1304. 和为零的 N 个不同整数](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README.md) -- [1305. 两棵二叉搜索树中的所有元素](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README.md) -- [1306. 跳跃游戏 III](/solution/1300-1399/1306.Jump%20Game%20III/README.md) -- [1307. 口算难题](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README.md) - -#### 第 16 场双周赛(2019-12-28 22:30, 90 分钟) 参赛人数 822 - -- [1299. 将每个元素替换为右侧最大元素](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README.md) -- [1300. 转变数组后最接近目标值的数组和](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README.md) -- [1302. 层数最深叶子节点的和](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README.md) -- [1301. 最大得分的路径数目](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README.md) - -#### 第 168 场周赛(2019-12-22 10:30, 90 分钟) 参赛人数 1553 - -- [1295. 统计位数为偶数的数字](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README.md) -- [1296. 划分数组为连续数字的集合](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README.md) -- [1297. 子串的最大出现次数](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README.md) -- [1298. 你能从盒子里获得的最大糖果数](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README.md) - -#### 第 167 场周赛(2019-12-15 10:30, 90 分钟) 参赛人数 1537 - -- [1290. 二进制链表转整数](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README.md) -- [1291. 顺次数](/solution/1200-1299/1291.Sequential%20Digits/README.md) -- [1292. 元素和小于等于阈值的正方形的最大边长](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README.md) -- [1293. 网格中的最短路径](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md) - -#### 第 15 场双周赛(2019-12-14 22:30, 90 分钟) 参赛人数 797 - -- [1287. 有序数组中出现次数超过 25%的元素](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README.md) -- [1288. 删除被覆盖区间](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README.md) -- [1286. 字母组合迭代器](/solution/1200-1299/1286.Iterator%20for%20Combination/README.md) -- [1289. 下降路径最小和 II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README.md) - -#### 第 166 场周赛(2019-12-08 10:30, 90 分钟) 参赛人数 1676 - -- [1281. 整数的各位积和之差](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README.md) -- [1282. 用户分组](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README.md) -- [1283. 使结果不超过阈值的最小除数](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README.md) -- [1284. 转化为全零矩阵的最少反转次数](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README.md) - -#### 第 165 场周赛(2019-12-01 10:30, 90 分钟) 参赛人数 1660 - -- [1275. 找出井字棋的获胜者](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README.md) -- [1276. 不浪费原料的汉堡制作方案](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README.md) -- [1277. 统计全为 1 的正方形子矩阵](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README.md) -- [1278. 分割回文串 III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README.md) - -#### 第 14 场双周赛(2019-11-30 22:30, 90 分钟) 参赛人数 871 - -- [1271. 十六进制魔术数字](/solution/1200-1299/1271.Hexspeak/README.md) -- [1272. 删除区间](/solution/1200-1299/1272.Remove%20Interval/README.md) -- [1273. 删除树节点](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md) -- [1274. 矩形内船只的数目](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md) - -#### 第 164 场周赛(2019-11-24 10:30, 90 分钟) 参赛人数 1676 - -- [1266. 访问所有点的最小时间](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README.md) -- [1267. 统计参与通信的服务器](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README.md) -- [1268. 搜索推荐系统](/solution/1200-1299/1268.Search%20Suggestions%20System/README.md) -- [1269. 停在原地的方案数](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README.md) - -#### 第 163 场周赛(2019-11-17 10:30, 90 分钟) 参赛人数 1605 - -- [1260. 二维网格迁移](/solution/1200-1299/1260.Shift%202D%20Grid/README.md) -- [1261. 在受污染的二叉树中查找元素](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README.md) -- [1262. 可被三整除的最大和](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README.md) -- [1263. 推箱子](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README.md) - -#### 第 13 场双周赛(2019-11-16 22:30, 90 分钟) 参赛人数 810 - -- [1256. 加密数字](/solution/1200-1299/1256.Encode%20Number/README.md) -- [1257. 最小公共区域](/solution/1200-1299/1257.Smallest%20Common%20Region/README.md) -- [1258. 近义词句子](/solution/1200-1299/1258.Synonymous%20Sentences/README.md) -- [1259. 不相交的握手](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md) - -#### 第 162 场周赛(2019-11-10 10:30, 90 分钟) 参赛人数 1569 - -- [1252. 奇数值单元格的数目](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README.md) -- [1253. 重构 2 行二进制矩阵](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README.md) -- [1254. 统计封闭岛屿的数目](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README.md) -- [1255. 得分最高的单词集合](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README.md) - -#### 第 161 场周赛(2019-11-03 10:30, 90 分钟) 参赛人数 1610 - -- [1247. 交换字符使得字符串相同](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README.md) -- [1248. 统计「优美子数组」](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README.md) -- [1249. 移除无效的括号](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md) -- [1250. 检查「好数组」](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README.md) - -#### 第 12 场双周赛(2019-11-02 22:30, 90 分钟) 参赛人数 911 - -- [1244. 力扣排行榜](/solution/1200-1299/1244.Design%20A%20Leaderboard/README.md) -- [1243. 数组变换](/solution/1200-1299/1243.Array%20Transformation/README.md) -- [1245. 树的直径](/solution/1200-1299/1245.Tree%20Diameter/README.md) -- [1246. 删除回文子数组](/solution/1200-1299/1246.Palindrome%20Removal/README.md) - -#### 第 160 场周赛(2019-10-27 10:30, 90 分钟) 参赛人数 1692 - -- [1237. 找出给定方程的正整数解](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README.md) -- [1238. 循环码排列](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README.md) -- [1239. 串联字符串的最大长度](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README.md) -- [1240. 铺瓷砖](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README.md) - -#### 第 159 场周赛(2019-10-20 10:30, 90 分钟) 参赛人数 1634 - -- [1232. 缀点成线](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README.md) -- [1233. 删除子文件夹](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README.md) -- [1234. 替换子串得到平衡字符串](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README.md) -- [1235. 规划兼职工作](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md) - -#### 第 11 场双周赛(2019-10-19 22:30, 90 分钟) 参赛人数 913 - -- [1228. 等差数列中缺失的数字](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md) -- [1229. 安排会议日程](/solution/1200-1299/1229.Meeting%20Scheduler/README.md) -- [1230. 抛掷硬币](/solution/1200-1299/1230.Toss%20Strange%20Coins/README.md) -- [1231. 分享巧克力](/solution/1200-1299/1231.Divide%20Chocolate/README.md) - -#### 第 158 场周赛(2019-10-13 10:30, 90 分钟) 参赛人数 1716 - -- [1221. 分割平衡字符串](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README.md) -- [1222. 可以攻击国王的皇后](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README.md) -- [1223. 掷骰子模拟](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README.md) -- [1224. 最大相等频率](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README.md) - -#### 第 157 场周赛(2019-10-06 10:30, 90 分钟) 参赛人数 1217 - -- [1217. 玩筹码](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README.md) -- [1218. 最长定差子序列](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README.md) -- [1219. 黄金矿工](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md) -- [1220. 统计元音字母序列的数目](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README.md) - -#### 第 10 场双周赛(2019-10-05 22:30, 90 分钟) 参赛人数 738 - -- [1213. 三个有序数组的交集](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md) -- [1214. 查找两棵二叉搜索树之和](/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md) -- [1215. 步进数](/solution/1200-1299/1215.Stepping%20Numbers/README.md) -- [1216. 验证回文串 III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README.md) - -#### 第 156 场周赛(2019-09-29 10:30, 90 分钟) 参赛人数 1433 - -- [1207. 独一无二的出现次数](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README.md) -- [1208. 尽可能使字符串相等](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README.md) -- [1209. 删除字符串中的所有相邻重复项 II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README.md) -- [1210. 穿过迷宫的最少移动次数](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README.md) - -#### 第 155 场周赛(2019-09-22 10:30, 90 分钟) 参赛人数 1603 - -- [1200. 最小绝对差](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README.md) -- [1201. 丑数 III](/solution/1200-1299/1201.Ugly%20Number%20III/README.md) -- [1202. 交换字符串中的元素](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md) -- [1203. 项目管理](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README.md) - -#### 第 9 场双周赛(2019-09-21 22:30, 95 分钟) 参赛人数 929 - -- [1196. 最多可以买到的苹果数量](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md) -- [1197. 进击的骑士](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md) -- [1198. 找出所有行中最小公共元素](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md) -- [1199. 建造街区的最短时间](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README.md) - -#### 第 154 场周赛(2019-09-15 10:30, 90 分钟) 参赛人数 1299 - -- [1189. “气球” 的最大数量](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README.md) -- [1190. 反转每对括号间的子串](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README.md) -- [1191. K 次串联后最大子数组之和](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README.md) -- [1192. 查找集群内的关键连接](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README.md) - -#### 第 153 场周赛(2019-09-08 10:30, 90 分钟) 参赛人数 1434 - -- [1184. 公交站间的距离](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README.md) -- [1185. 一周中的第几天](/solution/1100-1199/1185.Day%20of%20the%20Week/README.md) -- [1186. 删除一次得到子数组最大和](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README.md) -- [1187. 使数组严格递增](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README.md) - -#### 第 8 场双周赛(2019-09-07 22:30, 90 分钟) 参赛人数 630 - -- [1180. 统计只含单一字母的子串](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md) -- [1181. 前后拼接](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md) -- [1182. 与目标颜色间的最短距离](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md) -- [1183. 矩阵中 1 的最大数量](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md) - -#### 第 152 场周赛(2019-09-01 10:30, 90 分钟) 参赛人数 1367 - -- [1175. 质数排列](/solution/1100-1199/1175.Prime%20Arrangements/README.md) -- [1176. 健身计划评估](/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md) -- [1177. 构建回文串检测](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README.md) -- [1178. 猜字谜](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README.md) - -#### 第 151 场周赛(2019-08-25 10:30, 90 分钟) 参赛人数 1341 - -- [1169. 查询无效交易](/solution/1100-1199/1169.Invalid%20Transactions/README.md) -- [1170. 比较字符串最小字母出现频次](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README.md) -- [1171. 从链表中删去总和值为零的连续节点](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README.md) -- [1172. 餐盘栈](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README.md) - -#### 第 7 场双周赛(2019-08-24 22:30, 90 分钟) 参赛人数 561 - -- [1165. 单行键盘](/solution/1100-1199/1165.Single-Row%20Keyboard/README.md) -- [1166. 设计文件系统](/solution/1100-1199/1166.Design%20File%20System/README.md) -- [1167. 连接木棍的最低费用](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md) -- [1168. 水资源分配优化](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md) - -#### 第 150 场周赛(2019-08-18 10:30, 90 分钟) 参赛人数 1473 - -- [1160. 拼写单词](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README.md) -- [1161. 最大层内元素和](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README.md) -- [1162. 地图分析](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README.md) -- [1163. 按字典序排在最后的子串](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README.md) - -#### 第 149 场周赛(2019-08-11 10:30, 90 分钟) 参赛人数 1351 - -- [1154. 一年中的第几天](/solution/1100-1199/1154.Day%20of%20the%20Year/README.md) -- [1155. 掷骰子等于目标和的方法数](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md) -- [1156. 单字符重复子串的最大长度](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README.md) -- [1157. 子数组中占绝大多数的元素](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README.md) - -#### 第 6 场双周赛(2019-08-10 22:30, 90 分钟) 参赛人数 513 - -- [1150. 检查一个数是否在数组中占绝大多数](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md) -- [1151. 最少交换次数来组合所有的 1](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md) -- [1152. 用户网站访问行为分析](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md) -- [1153. 字符串转化](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README.md) - -#### 第 148 场周赛(2019-08-04 10:30, 90 分钟) 参赛人数 1251 - -- [1144. 递减元素使数组呈锯齿状](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README.md) -- [1145. 二叉树着色游戏](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README.md) -- [1146. 快照数组](/solution/1100-1199/1146.Snapshot%20Array/README.md) -- [1147. 段式回文](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README.md) - -#### 第 147 场周赛(2019-07-28 10:30, 90 分钟) 参赛人数 1132 - -- [1137. 第 N 个泰波那契数](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md) -- [1138. 字母板上的路径](/solution/1100-1199/1138.Alphabet%20Board%20Path/README.md) -- [1139. 最大的以 1 为边界的正方形](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md) -- [1140. 石子游戏 II](/solution/1100-1199/1140.Stone%20Game%20II/README.md) - -#### 第 5 场双周赛(2019-07-27 22:30, 90 分钟) 参赛人数 495 - -- [1133. 最大唯一数](/solution/1100-1199/1133.Largest%20Unique%20Number/README.md) -- [1134. 阿姆斯特朗数](/solution/1100-1199/1134.Armstrong%20Number/README.md) -- [1135. 最低成本连通所有城市](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md) -- [1136. 并行课程](/solution/1100-1199/1136.Parallel%20Courses/README.md) - -#### 第 146 场周赛(2019-07-21 10:30, 90 分钟) 参赛人数 1189 - -- [1128. 等价多米诺骨牌对的数量](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README.md) -- [1129. 颜色交替的最短路径](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README.md) -- [1130. 叶值的最小代价生成树](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README.md) -- [1131. 绝对值表达式的最大值](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md) - -#### 第 145 场周赛(2019-07-14 10:30, 90 分钟) 参赛人数 1114 - -- [1122. 数组的相对排序](/solution/1100-1199/1122.Relative%20Sort%20Array/README.md) -- [1123. 最深叶节点的最近公共祖先](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README.md) -- [1124. 表现良好的最长时间段](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README.md) -- [1125. 最小的必要团队](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README.md) - -#### 第 4 场双周赛(2019-07-13 22:30, 90 分钟) 参赛人数 438 - -- [1118. 一月有多少天](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md) -- [1119. 删去字符串中的元音](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md) -- [1120. 子树的最大平均值](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md) -- [1121. 将数组分成几个递增序列](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README.md) - -#### 第 144 场周赛(2019-07-07 10:30, 90 分钟) 参赛人数 777 - -- [1108. IP 地址无效化](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README.md) -- [1109. 航班预订统计](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README.md) -- [1110. 删点成林](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README.md) -- [1111. 有效括号的嵌套深度](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README.md) - -#### 第 143 场周赛(2019-06-30 10:30, 90 分钟) 参赛人数 803 - -- [1103. 分糖果 II](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README.md) -- [1104. 二叉树寻路](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README.md) -- [1105. 填充书架](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README.md) -- [1106. 解析布尔表达式](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README.md) - -#### 第 3 场双周赛(2019-06-29 22:30, 90 分钟) 参赛人数 312 - -- [1099. 小于 K 的两数之和](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md) -- [1100. 长度为 K 的无重复字符子串](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md) -- [1101. 彼此熟识的最早时间](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md) -- [1102. 得分最高的路径](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md) - -#### 第 142 场周赛(2019-06-23 10:30, 90 分钟) 参赛人数 801 - -- [1093. 大样本统计](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README.md) -- [1094. 拼车](/solution/1000-1099/1094.Car%20Pooling/README.md) -- [1095. 山脉数组中查找目标值](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README.md) -- [1096. 花括号展开 II](/solution/1000-1099/1096.Brace%20Expansion%20II/README.md) - -#### 第 141 场周赛(2019-06-16 10:30, 90 分钟) 参赛人数 763 - -- [1089. 复写零](/solution/1000-1099/1089.Duplicate%20Zeros/README.md) -- [1090. 受标签影响的最大值](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README.md) -- [1091. 二进制矩阵中的最短路径](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md) -- [1092. 最短公共超序列](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README.md) - -#### 第 2 场双周赛(2019-06-15 22:30, 90 分钟) 参赛人数 256 - -- [1085. 最小元素各数位之和](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md) -- [1086. 前五科的均分](/solution/1000-1099/1086.High%20Five/README.md) -- [1087. 花括号展开](/solution/1000-1099/1087.Brace%20Expansion/README.md) -- [1088. 易混淆数 II](/solution/1000-1099/1088.Confusing%20Number%20II/README.md) - -#### 第 140 场周赛(2019-06-09 10:30, 90 分钟) 参赛人数 660 - -- [1078. Bigram 分词](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README.md) -- [1079. 活字印刷](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README.md) -- [1080. 根到叶路径上的不足节点](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README.md) -- [1081. 不同字符的最小子序列](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README.md) - -#### 第 139 场周赛(2019-06-02 10:30, 90 分钟) 参赛人数 785 - -- [1071. 字符串的最大公因子](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README.md) -- [1072. 按列翻转得到最大值等行数](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md) -- [1073. 负二进制数相加](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md) -- [1074. 元素和为目标值的子矩阵数量](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md) - -#### 第 1 场双周赛(2019-06-01 22:30, 120 分钟) 参赛人数 197 - -- [1064. 不动点](/solution/1000-1099/1064.Fixed%20Point/README.md) -- [1065. 字符串的索引对](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md) -- [1066. 校园自行车分配 II](/solution/1000-1099/1066.Campus%20Bikes%20II/README.md) -- [1067. 范围内的数字计数](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README.md) - -#### 第 138 场周赛(2019-05-26 10:30, 90 分钟) 参赛人数 752 - -- [1051. 高度检查器](/solution/1000-1099/1051.Height%20Checker/README.md) -- [1052. 爱生气的书店老板](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README.md) -- [1053. 交换一次的先前排列](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README.md) -- [1054. 距离相等的条形码](/solution/1000-1099/1054.Distant%20Barcodes/README.md) - -#### 第 137 场周赛(2019-05-19 10:30, 90 分钟) 参赛人数 766 - -- [1046. 最后一块石头的重量](/solution/1000-1099/1046.Last%20Stone%20Weight/README.md) -- [1047. 删除字符串中的所有相邻重复项](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README.md) -- [1048. 最长字符串链](/solution/1000-1099/1048.Longest%20String%20Chain/README.md) -- [1049. 最后一块石头的重量 II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md) - -#### 第 136 场周赛(2019-05-12 10:30, 90 分钟) 参赛人数 790 - -- [1041. 困于环中的机器人](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README.md) -- [1042. 不邻接植花](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README.md) -- [1043. 分隔数组以得到最大和](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README.md) -- [1044. 最长重复子串](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md) - -#### 第 135 场周赛(2019-05-05 10:30, 90 分钟) 参赛人数 548 - -- [1037. 有效的回旋镖](/solution/1000-1099/1037.Valid%20Boomerang/README.md) -- [1038. 从二叉搜索树到更大和树](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README.md) -- [1039. 多边形三角剖分的最低得分](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md) -- [1040. 移动石子直到连续 II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README.md) - -#### 第 134 场周赛(2019-04-28 10:30, 90 分钟) 参赛人数 728 - -- [1033. 移动石子直到连续](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README.md) -- [1034. 边界着色](/solution/1000-1099/1034.Coloring%20A%20Border/README.md) -- [1035. 不相交的线](/solution/1000-1099/1035.Uncrossed%20Lines/README.md) -- [1036. 逃离大迷宫](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README.md) - -#### 第 133 场周赛(2019-04-21 10:30, 90 分钟) 参赛人数 999 - -- [1029. 两地调度](/solution/1000-1099/1029.Two%20City%20Scheduling/README.md) -- [1030. 距离顺序排列矩阵单元格](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README.md) -- [1031. 两个非重叠子数组的最大和](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README.md) -- [1032. 字符流](/solution/1000-1099/1032.Stream%20of%20Characters/README.md) - -#### 第 132 场周赛(2019-04-14 10:30, 90 分钟) 参赛人数 1050 - -- [1025. 除数博弈](/solution/1000-1099/1025.Divisor%20Game/README.md) -- [1026. 节点与其祖先之间的最大差值](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README.md) -- [1027. 最长等差数列](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README.md) -- [1028. 从先序遍历还原二叉树](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README.md) - -#### 第 131 场周赛(2019-04-07 10:30, 90 分钟) 参赛人数 918 - -- [1021. 删除最外层的括号](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md) -- [1022. 从根到叶的二进制数之和](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README.md) -- [1023. 驼峰式匹配](/solution/1000-1099/1023.Camelcase%20Matching/README.md) -- [1024. 视频拼接](/solution/1000-1099/1024.Video%20Stitching/README.md) - -#### 第 130 场周赛(2019-03-31 10:30, 90 分钟) 参赛人数 1294 - -- [1018. 可被 5 整除的二进制前缀](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README.md) -- [1017. 负二进制转换](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md) -- [1019. 链表中的下一个更大节点](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README.md) -- [1020. 飞地的数量](/solution/1000-1099/1020.Number%20of%20Enclaves/README.md) - -#### 第 129 场周赛(2019-03-24 09:30, 90 分钟) 参赛人数 759 - -- [1013. 将数组分成和相等的三个部分](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README.md) -- [1015. 可被 K 整除的最小整数](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README.md) -- [1014. 最佳观光组合](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README.md) -- [1016. 子串能表示从 1 到 N 数字的二进制串](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README.md) - -#### 第 128 场周赛(2019-03-17 10:30, 90 分钟) 参赛人数 1251 - -- [1009. 十进制整数的反码](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README.md) -- [1010. 总持续时间可被 60 整除的歌曲](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README.md) -- [1011. 在 D 天内送达包裹的能力](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README.md) -- [1012. 至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md) - -#### 第 127 场周赛(2019-03-10 10:30, 90 分钟) 参赛人数 664 - -- [1005. K 次取反后最大化的数组和](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README.md) -- [1006. 笨阶乘](/solution/1000-1099/1006.Clumsy%20Factorial/README.md) -- [1007. 行相等的最少多米诺旋转](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README.md) -- [1008. 前序遍历构造二叉搜索树](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README.md) - -#### 第 126 场周赛(2019-03-03 10:30, 90 分钟) 参赛人数 591 - -- [1002. 查找共用字符](/solution/1000-1099/1002.Find%20Common%20Characters/README.md) -- [1003. 检查替换后的词是否有效](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README.md) -- [1004. 最大连续 1 的个数 III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md) -- [1000. 合并石头的最低成本](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README.md) - -#### 第 125 场周赛(2019-02-24 10:30, 90 分钟) 参赛人数 469 - -- [0997. 找到小镇的法官](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README.md) -- [0999. 可以被一步捕获的棋子数](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README.md) -- [0998. 最大二叉树 II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README.md) -- [1001. 网格照明](/solution/1000-1099/1001.Grid%20Illumination/README.md) - -#### 第 124 场周赛(2019-02-17 10:30, 90 分钟) 参赛人数 417 - -- [0993. 二叉树的堂兄弟节点](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README.md) -- [0994. 腐烂的橘子](/solution/0900-0999/0994.Rotting%20Oranges/README.md) -- [0995. K 连续位的最小翻转次数](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README.md) -- [0996. 平方数组的数目](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README.md) - -#### 第 123 场周赛(2019-02-10 10:30, 90 分钟) 参赛人数 247 - -- [0989. 数组形式的整数加法](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md) -- [0990. 等式方程的可满足性](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md) -- [0991. 坏了的计算器](/solution/0900-0999/0991.Broken%20Calculator/README.md) -- [0992. K 个不同整数的子数组](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md) - -#### 第 122 场周赛(2019-02-03 10:30, 90 分钟) 参赛人数 280 - -- [0985. 查询后的偶数和](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README.md) -- [0988. 从叶结点开始的最小字符串](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md) -- [0986. 区间列表的交集](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md) -- [0987. 二叉树的垂序遍历](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md) - -#### 第 121 场周赛(2019-01-27 10:30, 90 分钟) 参赛人数 384 - -- [0984. 不含 AAA 或 BBB 的字符串](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README.md) -- [0981. 基于时间的键值存储](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README.md) -- [0983. 最低票价](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README.md) -- [0982. 按位与为零的三元组](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README.md) - -#### 第 120 场周赛(2019-01-20 10:30, 90 分钟) 参赛人数 382 - -- [0977. 有序数组的平方](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README.md) -- [0978. 最长湍流子数组](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README.md) -- [0979. 在二叉树中分配硬币](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README.md) -- [0980. 不同路径 III](/solution/0900-0999/0980.Unique%20Paths%20III/README.md) - -#### 第 119 场周赛(2019-01-13 10:30, 90 分钟) 参赛人数 513 - -- [0973. 最接近原点的 K 个点](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README.md) -- [0976. 三角形的最大周长](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README.md) -- [0974. 和可被 K 整除的子数组](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README.md) -- [0975. 奇偶跳](/solution/0900-0999/0975.Odd%20Even%20Jump/README.md) - -#### 第 118 场周赛(2019-01-06 10:30, 90 分钟) 参赛人数 383 - -- [0970. 强整数](/solution/0900-0999/0970.Powerful%20Integers/README.md) -- [0969. 煎饼排序](/solution/0900-0999/0969.Pancake%20Sorting/README.md) -- [0971. 翻转二叉树以匹配先序遍历](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README.md) -- [0972. 相等的有理数](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README.md) - -#### 第 117 场周赛(2018-12-30 10:30, 90 分钟) 参赛人数 657 - -- [0965. 单值二叉树](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README.md) -- [0967. 连续差相同的数字](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README.md) -- [0966. 元音拼写检查器](/solution/0900-0999/0966.Vowel%20Spellchecker/README.md) -- [0968. 监控二叉树](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README.md) - -#### 第 116 场周赛(2018-12-23 10:30, 90 分钟) 参赛人数 369 - -- [0961. 在长度 2N 的数组中找出重复 N 次的元素](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README.md) -- [0962. 最大宽度坡](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md) -- [0963. 最小面积矩形 II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README.md) -- [0964. 表示数字的最少运算符](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README.md) - -#### 第 115 场周赛(2018-12-16 10:30, 90 分钟) 参赛人数 383 - -- [0957. N 天后的牢房](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README.md) -- [0958. 二叉树的完全性检验](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README.md) -- [0959. 由斜杠划分区域](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md) -- [0960. 删列造序 III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md) - -#### 第 114 场周赛(2018-12-09 10:30, 90 分钟) 参赛人数 391 - -- [0953. 验证外星语词典](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README.md) -- [0954. 二倍数对数组](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README.md) -- [0955. 删列造序 II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README.md) -- [0956. 最高的广告牌](/solution/0900-0999/0956.Tallest%20Billboard/README.md) - -#### 第 113 场周赛(2018-12-02 10:30, 90 分钟) 参赛人数 462 - -- [0949. 给定数字能组成的最大时间](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README.md) -- [0951. 翻转等价二叉树](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README.md) -- [0950. 按递增顺序显示卡牌](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README.md) -- [0952. 按公因数计算最大组件大小](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README.md) - -#### 第 112 场周赛(2018-11-25 10:30, 90 分钟) 参赛人数 299 - -- [0945. 使数组唯一的最小增量](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README.md) -- [0946. 验证栈序列](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README.md) -- [0947. 移除最多的同行或同列石头](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README.md) -- [0948. 令牌放置](/solution/0900-0999/0948.Bag%20of%20Tokens/README.md) - -#### 第 111 场周赛(2018-11-18 10:30, 90 分钟) 参赛人数 353 - -- [0941. 有效的山脉数组](/solution/0900-0999/0941.Valid%20Mountain%20Array/README.md) -- [0944. 删列造序](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README.md) -- [0942. 增减字符串匹配](/solution/0900-0999/0942.DI%20String%20Match/README.md) -- [0943. 最短超级串](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README.md) - -#### 第 110 场周赛(2018-11-11 10:30, 90 分钟) 参赛人数 346 - -- [0937. 重新排列日志文件](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README.md) -- [0938. 二叉搜索树的范围和](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README.md) -- [0939. 最小面积矩形](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README.md) -- [0940. 不同的子序列 II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md) - -#### 第 109 场周赛(2018-11-04 09:30, 90 分钟) 参赛人数 439 - -- [0933. 最近的请求次数](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md) -- [0935. 骑士拨号器](/solution/0900-0999/0935.Knight%20Dialer/README.md) -- [0934. 最短的桥](/solution/0900-0999/0934.Shortest%20Bridge/README.md) -- [0936. 戳印序列](/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md) - -#### 第 108 场周赛(2018-10-28 09:30, 90 分钟) 参赛人数 524 - -- [0929. 独特的电子邮件地址](/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md) -- [0930. 和相同的二元子数组](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md) -- [0931. 下降路径最小和](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md) -- [0932. 漂亮数组](/solution/0900-0999/0932.Beautiful%20Array/README.md) - -#### 第 107 场周赛(2018-10-21 09:30, 90 分钟) 参赛人数 504 - -- [0925. 长按键入](/solution/0900-0999/0925.Long%20Pressed%20Name/README.md) -- [0926. 将字符串翻转到单调递增](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md) -- [0927. 三等分](/solution/0900-0999/0927.Three%20Equal%20Parts/README.md) -- [0928. 尽量减少恶意软件的传播 II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md) - -#### 第 106 场周赛(2018-10-14 09:30, 90 分钟) 参赛人数 369 - -- [0922. 按奇偶排序数组 II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README.md) -- [0921. 使括号有效的最少添加](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README.md) -- [0923. 三数之和的多种可能](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md) -- [0924. 尽量减少恶意软件的传播](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md) - -#### 第 105 场周赛(2018-10-07 09:30, 90 分钟) 参赛人数 393 - -- [0917. 仅仅反转字母](/solution/0900-0999/0917.Reverse%20Only%20Letters/README.md) -- [0918. 环形子数组的最大和](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md) -- [0919. 完全二叉树插入器](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README.md) -- [0920. 播放列表的数量](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README.md) - -#### 第 104 场周赛(2018-09-30 09:30, 90 分钟) 参赛人数 354 - -- [0914. 卡牌分组](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md) -- [0915. 分割数组](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md) -- [0916. 单词子集](/solution/0900-0999/0916.Word%20Subsets/README.md) -- [0913. 猫和老鼠](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md) - -#### 第 103 场周赛(2018-09-23 09:30, 90 分钟) 参赛人数 575 - -- [0908. 最小差值 I](/solution/0900-0999/0908.Smallest%20Range%20I/README.md) -- [0909. 蛇梯棋](/solution/0900-0999/0909.Snakes%20and%20Ladders/README.md) -- [0910. 最小差值 II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md) -- [0911. 在线选举](/solution/0900-0999/0911.Online%20Election/README.md) - -#### 第 102 场周赛(2018-09-16 09:30, 90 分钟) 参赛人数 660 - -- [0905. 按奇偶排序数组](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README.md) -- [0904. 水果成篮](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README.md) -- [0907. 子数组的最小值之和](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md) -- [0906. 超级回文数](/solution/0900-0999/0906.Super%20Palindromes/README.md) - -#### 第 101 场周赛(2018-09-09 09:30, 105 分钟) 参赛人数 854 - -- [0900. RLE 迭代器](/solution/0900-0999/0900.RLE%20Iterator/README.md) -- [0901. 股票价格跨度](/solution/0900-0999/0901.Online%20Stock%20Span/README.md) -- [0902. 最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md) -- [0903. DI 序列的有效排列](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README.md) - -#### 第 100 场周赛(2018-09-02 09:30, 90 分钟) 参赛人数 718 - -- [0896. 单调数列](/solution/0800-0899/0896.Monotonic%20Array/README.md) -- [0897. 递增顺序搜索树](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README.md) -- [0898. 子数组按位或操作](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README.md) -- [0899. 有序队列](/solution/0800-0899/0899.Orderly%20Queue/README.md) - -#### 第 99 场周赛(2018-08-26 09:30, 90 分钟) 参赛人数 725 - -- [0892. 三维形体的表面积](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README.md) -- [0893. 特殊等价字符串组](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README.md) -- [0894. 所有可能的真二叉树](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README.md) -- [0895. 最大频率栈](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README.md) - -#### 第 98 场周赛(2018-08-19 09:30, 90 分钟) 参赛人数 670 - -- [0888. 公平的糖果交换](/solution/0800-0899/0888.Fair%20Candy%20Swap/README.md) -- [0890. 查找和替换模式](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README.md) -- [0889. 根据前序和后序遍历构造二叉树](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README.md) -- [0891. 子序列宽度之和](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README.md) - -#### 第 97 场周赛(2018-08-12 09:30, 90 分钟) 参赛人数 635 - -- [0884. 两句话中的不常见单词](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README.md) -- [0885. 螺旋矩阵 III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README.md) -- [0886. 可能的二分法](/solution/0800-0899/0886.Possible%20Bipartition/README.md) -- [0887. 鸡蛋掉落](/solution/0800-0899/0887.Super%20Egg%20Drop/README.md) - -#### 第 96 场周赛(2018-08-05 09:30, 90 分钟) 参赛人数 789 - -- [0883. 三维形体投影面积](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README.md) -- [0881. 救生艇](/solution/0800-0899/0881.Boats%20to%20Save%20People/README.md) -- [0880. 索引处的解码字符串](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README.md) -- [0882. 细分图中的可到达节点](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README.md) - -#### 第 95 场周赛(2018-07-29 09:30, 90 分钟) 参赛人数 831 - -- [0876. 链表的中间结点](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README.md) -- [0877. 石子游戏](/solution/0800-0899/0877.Stone%20Game/README.md) -- [0878. 第 N 个神奇数字](/solution/0800-0899/0878.Nth%20Magical%20Number/README.md) -- [0879. 盈利计划](/solution/0800-0899/0879.Profitable%20Schemes/README.md) - -#### 第 94 场周赛(2018-07-22 09:30, 90 分钟) 参赛人数 733 - -- [0872. 叶子相似的树](/solution/0800-0899/0872.Leaf-Similar%20Trees/README.md) -- [0874. 模拟行走机器人](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README.md) -- [0875. 爱吃香蕉的珂珂](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README.md) -- [0873. 最长的斐波那契子序列的长度](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README.md) - -#### 第 93 场周赛(2018-07-15 09:30, 90 分钟) 参赛人数 732 - -- [0868. 二进制间距](/solution/0800-0899/0868.Binary%20Gap/README.md) -- [0869. 重新排序得到 2 的幂](/solution/0800-0899/0869.Reordered%20Power%20of%202/README.md) -- [0870. 优势洗牌](/solution/0800-0899/0870.Advantage%20Shuffle/README.md) -- [0871. 最低加油次数](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README.md) - -#### 第 92 场周赛(2018-07-08 09:30, 90 分钟) 参赛人数 610 - -- [0867. 转置矩阵](/solution/0800-0899/0867.Transpose%20Matrix/README.md) -- [0865. 具有所有最深节点的最小子树](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README.md) -- [0866. 回文质数](/solution/0800-0899/0866.Prime%20Palindrome/README.md) -- [0864. 获取所有钥匙的最短路径](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README.md) - -#### 第 91 场周赛(2018-07-01 09:30, 90 分钟) 参赛人数 578 - -- [0860. 柠檬水找零](/solution/0800-0899/0860.Lemonade%20Change/README.md) -- [0863. 二叉树中所有距离为 K 的结点](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README.md) -- [0861. 翻转矩阵后的得分](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README.md) -- [0862. 和至少为 K 的最短子数组](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md) - -#### 第 90 场周赛(2018-06-24 09:30, 90 分钟) 参赛人数 573 - -- [0859. 亲密字符串](/solution/0800-0899/0859.Buddy%20Strings/README.md) -- [0856. 括号的分数](/solution/0800-0899/0856.Score%20of%20Parentheses/README.md) -- [0858. 镜面反射](/solution/0800-0899/0858.Mirror%20Reflection/README.md) -- [0857. 雇佣 K 名工人的最低成本](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md) - -#### 第 89 场周赛(2018-06-17 09:30, 90 分钟) 参赛人数 491 - -- [0852. 山脉数组的峰顶索引](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README.md) -- [0853. 车队](/solution/0800-0899/0853.Car%20Fleet/README.md) -- [0855. 考场就座](/solution/0800-0899/0855.Exam%20Room/README.md) -- [0854. 相似度为 K 的字符串](/solution/0800-0899/0854.K-Similar%20Strings/README.md) - -#### 第 88 场周赛(2018-06-10 09:30, 90 分钟) 参赛人数 404 - -- [0848. 字母移位](/solution/0800-0899/0848.Shifting%20Letters/README.md) -- [0849. 到最近的人的最大距离](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README.md) -- [0851. 喧闹和富有](/solution/0800-0899/0851.Loud%20and%20Rich/README.md) -- [0850. 矩形面积 II](/solution/0800-0899/0850.Rectangle%20Area%20II/README.md) - -#### 第 87 场周赛(2018-06-03 09:30, 90 分钟) 参赛人数 343 - -- [0844. 比较含退格的字符串](/solution/0800-0899/0844.Backspace%20String%20Compare/README.md) -- [0845. 数组中的最长山脉](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README.md) -- [0846. 一手顺子](/solution/0800-0899/0846.Hand%20of%20Straights/README.md) -- [0847. 访问所有节点的最短路径](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md) - -#### 第 86 场周赛(2018-05-27 09:30, 90 分钟) 参赛人数 377 - -- [0840. 矩阵中的幻方](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README.md) -- [0841. 钥匙和房间](/solution/0800-0899/0841.Keys%20and%20Rooms/README.md) -- [0842. 将数组拆分成斐波那契序列](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README.md) -- [0843. 猜猜这个单词](/solution/0800-0899/0843.Guess%20the%20Word/README.md) - -#### 第 85 场周赛(2018-05-20 09:30, 90 分钟) 参赛人数 467 - -- [0836. 矩形重叠](/solution/0800-0899/0836.Rectangle%20Overlap/README.md) -- [0838. 推多米诺](/solution/0800-0899/0838.Push%20Dominoes/README.md) -- [0837. 新 21 点](/solution/0800-0899/0837.New%2021%20Game/README.md) -- [0839. 相似字符串组](/solution/0800-0899/0839.Similar%20String%20Groups/README.md) - -#### 第 84 场周赛(2018-05-13 09:30, 90 分钟) 参赛人数 656 - -- [0832. 翻转图像](/solution/0800-0899/0832.Flipping%20an%20Image/README.md) -- [0833. 字符串中的查找与替换](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README.md) -- [0835. 图像重叠](/solution/0800-0899/0835.Image%20Overlap/README.md) -- [0834. 树中距离之和](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md) - -#### 第 83 场周赛(2018-05-06 09:30, 90 分钟) 参赛人数 58 - -- [0830. 较大分组的位置](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README.md) -- [0831. 隐藏个人信息](/solution/0800-0899/0831.Masking%20Personal%20Information/README.md) -- [0829. 连续整数求和](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README.md) -- [0828. 统计子串中的唯一字符](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README.md) +--- +comments: true +--- + +# 力扣竞赛 + +[English Version](/solution/CONTEST_README_EN.md) + +## 段位与荣誉勋章 + +竞赛排名根据竞赛积分（周赛和双周赛）进行计算，注册新用户的基础分值为 1500 分，在竞赛积分 ≥1600 的用户中，根据比例 5%, 20%, 75% 设定三档段位，段位每周比赛结束后计算一次。 + +如果竞赛积分处于段位的临界值，在每周比赛结束重新计算后会出现段位升级或降级的情况。段位升级或降级后会自动替换对应的荣誉勋章。 + +| 段位 | 比例 | 段位名 | 国服分数线 | 勋章 | +| ---- | ---- | -------- | ----------- | ----------------------------------------------------------------------------------------------------------------------- | +| LV3 | 5% | Guardian | ≥2278.34 |

| +| LV2 | 20% | Knight | ≥1889.36 |

| +| LV1 | 75% | - | - | - | + +力扣竞赛 **全国排名前 10** 的用户，全站用户名展示为品牌橙色。 + +## 赛后估分网站 + +如果你想在比赛结束后估算自己的积分变化，可以访问网站 [LeetCode Contest Rating Predictor](https://lccn.lbao.site/)。 + +## 往期竞赛 + +#### 第 402 场周赛(2024-06-16 10:30, 90 分钟) 参赛人数 3283 + +- [3184. 构成整天的下标对数目 I](/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README.md) +- [3185. 构成整天的下标对数目 II](/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README.md) +- [3186. 施咒的最大总伤害](/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README.md) +- [3187. 数组中的峰值](/solution/3100-3199/3187.Peaks%20in%20Array/README.md) + +#### 第 401 场周赛(2024-06-09 10:30, 90 分钟) 参赛人数 3160 + +- [3178. 找出 K 秒后拿着球的孩子](/solution/3100-3199/3178.Find%20the%20Child%20Who%20Has%20the%20Ball%20After%20K%20Seconds/README.md) +- [3179. K 秒后第 N 个元素的值](/solution/3100-3199/3179.Find%20the%20N-th%20Value%20After%20K%20Seconds/README.md) +- [3180. 执行操作可获得的最大总奖励 I](/solution/3100-3199/3180.Maximum%20Total%20Reward%20Using%20Operations%20I/README.md) +- [3181. 执行操作可获得的最大总奖励 II](/solution/3100-3199/3181.Maximum%20Total%20Reward%20Using%20Operations%20II/README.md) + +#### 第 132 场双周赛(2024-06-08 22:30, 90 分钟) 参赛人数 2457 + +- [3174. 清除数字](/solution/3100-3199/3174.Clear%20Digits/README.md) +- [3175. 找到连续赢 K 场比赛的第一位玩家](/solution/3100-3199/3175.Find%20The%20First%20Player%20to%20win%20K%20Games%20in%20a%20Row/README.md) +- [3176. 求出最长好子序列 I](/solution/3100-3199/3176.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20I/README.md) +- [3177. 求出最长好子序列 II](/solution/3100-3199/3177.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20II/README.md) + +#### 第 400 场周赛(2024-06-02 10:30, 90 分钟) 参赛人数 3534 + +- [3168. 候诊室中的最少椅子数](/solution/3100-3199/3168.Minimum%20Number%20of%20Chairs%20in%20a%20Waiting%20Room/README.md) +- [3169. 无需开会的工作日](/solution/3100-3199/3169.Count%20Days%20Without%20Meetings/README.md) +- [3170. 删除星号以后字典序最小的字符串](/solution/3100-3199/3170.Lexicographically%20Minimum%20String%20After%20Removing%20Stars/README.md) +- [3171. 找到按位或最接近 K 的子数组](/solution/3100-3199/3171.Find%20Subarray%20With%20Bitwise%20OR%20Closest%20to%20K/README.md) + +#### 第 399 场周赛(2024-05-26 10:30, 90 分钟) 参赛人数 3424 + +- [3162. 优质数对的总数 I](/solution/3100-3199/3162.Find%20the%20Number%20of%20Good%20Pairs%20I/README.md) +- [3163. 压缩字符串 III](/solution/3100-3199/3163.String%20Compression%20III/README.md) +- [3164. 优质数对的总数 II](/solution/3100-3199/3164.Find%20the%20Number%20of%20Good%20Pairs%20II/README.md) +- [3165. 不包含相邻元素的子序列的最大和](/solution/3100-3199/3165.Maximum%20Sum%20of%20Subsequence%20With%20Non-adjacent%20Elements/README.md) + +#### 第 131 场双周赛(2024-05-25 22:30, 90 分钟) 参赛人数 2537 + +- [3158. 求出出现两次数字的 XOR 值](/solution/3100-3199/3158.Find%20the%20XOR%20of%20Numbers%20Which%20Appear%20Twice/README.md) +- [3159. 查询数组中元素的出现位置](/solution/3100-3199/3159.Find%20Occurrences%20of%20an%20Element%20in%20an%20Array/README.md) +- [3160. 所有球里面不同颜色的数目](/solution/3100-3199/3160.Find%20the%20Number%20of%20Distinct%20Colors%20Among%20the%20Balls/README.md) +- [3161. 物块放置查询](/solution/3100-3199/3161.Block%20Placement%20Queries/README.md) + +#### 第 398 场周赛(2024-05-19 10:30, 90 分钟) 参赛人数 3606 + +- [3151. 特殊数组 I](/solution/3100-3199/3151.Special%20Array%20I/README.md) +- [3152. 特殊数组 II](/solution/3100-3199/3152.Special%20Array%20II/README.md) +- [3153. 所有数对中数位不同之和](/solution/3100-3199/3153.Sum%20of%20Digit%20Differences%20of%20All%20Pairs/README.md) +- [3154. 到达第 K 级台阶的方案数](/solution/3100-3199/3154.Find%20Number%20of%20Ways%20to%20Reach%20the%20K-th%20Stair/README.md) + +#### 第 397 场周赛(2024-05-12 10:30, 90 分钟) 参赛人数 3365 + +- [3146. 两个字符串的排列差](/solution/3100-3199/3146.Permutation%20Difference%20between%20Two%20Strings/README.md) +- [3147. 从魔法师身上吸取的最大能量](/solution/3100-3199/3147.Taking%20Maximum%20Energy%20From%20the%20Mystic%20Dungeon/README.md) +- [3148. 矩阵中的最大得分](/solution/3100-3199/3148.Maximum%20Difference%20Score%20in%20a%20Grid/README.md) +- [3149. 找出分数最低的排列](/solution/3100-3199/3149.Find%20the%20Minimum%20Cost%20Array%20Permutation/README.md) + +#### 第 130 场双周赛(2024-05-11 22:30, 90 分钟) 参赛人数 2604 + +- [3142. 判断矩阵是否满足条件](/solution/3100-3199/3142.Check%20if%20Grid%20Satisfies%20Conditions/README.md) +- [3143. 正方形中的最多点数](/solution/3100-3199/3143.Maximum%20Points%20Inside%20the%20Square/README.md) +- [3144. 分割字符频率相等的最少子字符串](/solution/3100-3199/3144.Minimum%20Substring%20Partition%20of%20Equal%20Character%20Frequency/README.md) +- [3145. 大数组元素的乘积](/solution/3100-3199/3145.Find%20Products%20of%20Elements%20of%20Big%20Array/README.md) + +#### 第 396 场周赛(2024-05-05 10:30, 90 分钟) 参赛人数 2932 + +- [3136. 有效单词](/solution/3100-3199/3136.Valid%20Word/README.md) +- [3137. K 周期字符串需要的最少操作次数](/solution/3100-3199/3137.Minimum%20Number%20of%20Operations%20to%20Make%20Word%20K-Periodic/README.md) +- [3138. 同位字符串连接的最小长度](/solution/3100-3199/3138.Minimum%20Length%20of%20Anagram%20Concatenation/README.md) +- [3139. 使数组中所有元素相等的最小开销](/solution/3100-3199/3139.Minimum%20Cost%20to%20Equalize%20Array/README.md) + +#### 第 395 场周赛(2024-04-28 10:30, 90 分钟) 参赛人数 2968 + +- [3131. 找出与数组相加的整数 I](/solution/3100-3199/3131.Find%20the%20Integer%20Added%20to%20Array%20I/README.md) +- [3132. 找出与数组相加的整数 II](/solution/3100-3199/3132.Find%20the%20Integer%20Added%20to%20Array%20II/README.md) +- [3133. 数组最后一个元素的最小值](/solution/3100-3199/3133.Minimum%20Array%20End/README.md) +- [3134. 找出唯一性数组的中位数](/solution/3100-3199/3134.Find%20the%20Median%20of%20the%20Uniqueness%20Array/README.md) + +#### 第 129 场双周赛(2024-04-27 22:30, 90 分钟) 参赛人数 2510 + +- [3127. 构造相同颜色的正方形](/solution/3100-3199/3127.Make%20a%20Square%20with%20the%20Same%20Color/README.md) +- [3128. 直角三角形](/solution/3100-3199/3128.Right%20Triangles/README.md) +- [3129. 找出所有稳定的二进制数组 I](/solution/3100-3199/3129.Find%20All%20Possible%20Stable%20Binary%20Arrays%20I/README.md) +- [3130. 找出所有稳定的二进制数组 II](/solution/3100-3199/3130.Find%20All%20Possible%20Stable%20Binary%20Arrays%20II/README.md) + +#### 第 394 场周赛(2024-04-21 10:30, 90 分钟) 参赛人数 3957 + +- [3120. 统计特殊字母的数量 I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README.md) +- [3121. 统计特殊字母的数量 II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README.md) +- [3122. 使矩阵满足条件的最少操作次数](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README.md) +- [3123. 最短路径中的边](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README.md) + +#### 第 393 场周赛(2024-04-14 10:30, 90 分钟) 参赛人数 4218 + +- [3114. 替换字符可以得到的最晚时间](/solution/3100-3199/3114.Latest%20Time%20You%20Can%20Obtain%20After%20Replacing%20Characters/README.md) +- [3115. 质数的最大距离](/solution/3100-3199/3115.Maximum%20Prime%20Difference/README.md) +- [3116. 单面值组合的第 K 小金额](/solution/3100-3199/3116.Kth%20Smallest%20Amount%20With%20Single%20Denomination%20Combination/README.md) +- [3117. 划分数组得到最小的值之和](/solution/3100-3199/3117.Minimum%20Sum%20of%20Values%20by%20Dividing%20Array/README.md) + +#### 第 128 场双周赛(2024-04-13 22:30, 90 分钟) 参赛人数 2653 + +- [3110. 字符串的分数](/solution/3100-3199/3110.Score%20of%20a%20String/README.md) +- [3111. 覆盖所有点的最少矩形数目](/solution/3100-3199/3111.Minimum%20Rectangles%20to%20Cover%20Points/README.md) +- [3112. 访问消失节点的最少时间](/solution/3100-3199/3112.Minimum%20Time%20to%20Visit%20Disappearing%20Nodes/README.md) +- [3113. 边界元素是最大值的子数组数目](/solution/3100-3199/3113.Find%20the%20Number%20of%20Subarrays%20Where%20Boundary%20Elements%20Are%20Maximum/README.md) + +#### 第 392 场周赛(2024-04-07 10:30, 90 分钟) 参赛人数 3193 + +- [3105. 最长的严格递增或递减子数组](/solution/3100-3199/3105.Longest%20Strictly%20Increasing%20or%20Strictly%20Decreasing%20Subarray/README.md) +- [3106. 满足距离约束且字典序最小的字符串](/solution/3100-3199/3106.Lexicographically%20Smallest%20String%20After%20Operations%20With%20Constraint/README.md) +- [3107. 使数组中位数等于 K 的最少操作数](/solution/3100-3199/3107.Minimum%20Operations%20to%20Make%20Median%20of%20Array%20Equal%20to%20K/README.md) +- [3108. 带权图里旅途的最小代价](/solution/3100-3199/3108.Minimum%20Cost%20Walk%20in%20Weighted%20Graph/README.md) + +#### 第 391 场周赛(2024-03-31 10:30, 90 分钟) 参赛人数 4180 + +- [3099. 哈沙德数](/solution/3000-3099/3099.Harshad%20Number/README.md) +- [3100. 换水问题 II](/solution/3100-3199/3100.Water%20Bottles%20II/README.md) +- [3101. 交替子数组计数](/solution/3100-3199/3101.Count%20Alternating%20Subarrays/README.md) +- [3102. 最小化曼哈顿距离](/solution/3100-3199/3102.Minimize%20Manhattan%20Distances/README.md) + +#### 第 127 场双周赛(2024-03-30 22:30, 90 分钟) 参赛人数 2950 + +- [3095. 或值至少 K 的最短子数组 I](/solution/3000-3099/3095.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20I/README.md) +- [3096. 得到更多分数的最少关卡数目](/solution/3000-3099/3096.Minimum%20Levels%20to%20Gain%20More%20Points/README.md) +- [3097. 或值至少为 K 的最短子数组 II](/solution/3000-3099/3097.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20II/README.md) +- [3098. 求出所有子序列的能量和](/solution/3000-3099/3098.Find%20the%20Sum%20of%20Subsequence%20Powers/README.md) + +#### 第 390 场周赛(2024-03-24 10:30, 90 分钟) 参赛人数 4817 + +- [3090. 每个字符最多出现两次的最长子字符串](/solution/3000-3099/3090.Maximum%20Length%20Substring%20With%20Two%20Occurrences/README.md) +- [3091. 执行操作使数据元素之和大于等于 K](/solution/3000-3099/3091.Apply%20Operations%20to%20Make%20Sum%20of%20Array%20Greater%20Than%20or%20Equal%20to%20k/README.md) +- [3092. 最高频率的 ID](/solution/3000-3099/3092.Most%20Frequent%20IDs/README.md) +- [3093. 最长公共后缀查询](/solution/3000-3099/3093.Longest%20Common%20Suffix%20Queries/README.md) + +#### 第 389 场周赛(2024-03-17 10:30, 90 分钟) 参赛人数 4561 + +- [3083. 字符串及其反转中是否存在同一子字符串](/solution/3000-3099/3083.Existence%20of%20a%20Substring%20in%20a%20String%20and%20Its%20Reverse/README.md) +- [3084. 统计以给定字符开头和结尾的子字符串总数](/solution/3000-3099/3084.Count%20Substrings%20Starting%20and%20Ending%20with%20Given%20Character/README.md) +- [3085. 成为 K 特殊字符串需要删除的最少字符数](/solution/3000-3099/3085.Minimum%20Deletions%20to%20Make%20String%20K-Special/README.md) +- [3086. 拾起 K 个 1 需要的最少行动次数](/solution/3000-3099/3086.Minimum%20Moves%20to%20Pick%20K%20Ones/README.md) + +#### 第 126 场双周赛(2024-03-16 22:30, 90 分钟) 参赛人数 3234 + +- [3079. 求出加密整数的和](/solution/3000-3099/3079.Find%20the%20Sum%20of%20Encrypted%20Integers/README.md) +- [3080. 执行操作标记数组中的元素](/solution/3000-3099/3080.Mark%20Elements%20on%20Array%20by%20Performing%20Queries/README.md) +- [3081. 替换字符串中的问号使分数最小](/solution/3000-3099/3081.Replace%20Question%20Marks%20in%20String%20to%20Minimize%20Its%20Value/README.md) +- [3082. 求出所有子序列的能量和](/solution/3000-3099/3082.Find%20the%20Sum%20of%20the%20Power%20of%20All%20Subsequences/README.md) + +#### 第 388 场周赛(2024-03-10 10:30, 90 分钟) 参赛人数 4291 + +- [3074. 重新分装苹果](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README.md) +- [3075. 幸福值最大化的选择方案](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README.md) +- [3076. 数组中的最短非公共子字符串](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README.md) +- [3077. K 个不相交子数组的最大能量值](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README.md) + +#### 第 387 场周赛(2024-03-03 10:30, 90 分钟) 参赛人数 3694 + +- [3069. 将元素分配到两个数组中 I](/solution/3000-3099/3069.Distribute%20Elements%20Into%20Two%20Arrays%20I/README.md) +- [3070. 元素和小于等于 k 的子矩阵的数目](/solution/3000-3099/3070.Count%20Submatrices%20with%20Top-Left%20Element%20and%20Sum%20Less%20Than%20k/README.md) +- [3071. 在矩阵上写出字母 Y 所需的最少操作次数](/solution/3000-3099/3071.Minimum%20Operations%20to%20Write%20the%20Letter%20Y%20on%20a%20Grid/README.md) +- [3072. 将元素分配到两个数组中 II](/solution/3000-3099/3072.Distribute%20Elements%20Into%20Two%20Arrays%20II/README.md) + +#### 第 125 场双周赛(2024-03-02 22:30, 90 分钟) 参赛人数 2599 + +- [3065. 超过阈值的最少操作数 I](/solution/3000-3099/3065.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20I/README.md) +- [3066. 超过阈值的最少操作数 II](/solution/3000-3099/3066.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20II/README.md) +- [3067. 在带权树网络中统计可连接服务器对数目](/solution/3000-3099/3067.Count%20Pairs%20of%20Connectable%20Servers%20in%20a%20Weighted%20Tree%20Network/README.md) +- [3068. 最大节点价值之和](/solution/3000-3099/3068.Find%20the%20Maximum%20Sum%20of%20Node%20Values/README.md) + +#### 第 386 场周赛(2024-02-25 10:30, 90 分钟) 参赛人数 2731 + +- [3046. 分割数组](/solution/3000-3099/3046.Split%20the%20Array/README.md) +- [3047. 求交集区域内的最大正方形面积](/solution/3000-3099/3047.Find%20the%20Largest%20Area%20of%20Square%20Inside%20Two%20Rectangles/README.md) +- [3048. 标记所有下标的最早秒数 I](/solution/3000-3099/3048.Earliest%20Second%20to%20Mark%20Indices%20I/README.md) +- [3049. 标记所有下标的最早秒数 II](/solution/3000-3099/3049.Earliest%20Second%20to%20Mark%20Indices%20II/README.md) + +#### 第 385 场周赛(2024-02-18 10:30, 90 分钟) 参赛人数 2382 + +- [3042. 统计前后缀下标对 I](/solution/3000-3099/3042.Count%20Prefix%20and%20Suffix%20Pairs%20I/README.md) +- [3043. 最长公共前缀的长度](/solution/3000-3099/3043.Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/README.md) +- [3044. 出现频率最高的质数](/solution/3000-3099/3044.Most%20Frequent%20Prime/README.md) +- [3045. 统计前后缀下标对 II](/solution/3000-3099/3045.Count%20Prefix%20and%20Suffix%20Pairs%20II/README.md) + +#### 第 124 场双周赛(2024-02-17 22:30, 90 分钟) 参赛人数 1861 + +- [3038. 相同分数的最大操作数目 I](/solution/3000-3099/3038.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20I/README.md) +- [3039. 进行操作使字符串为空](/solution/3000-3099/3039.Apply%20Operations%20to%20Make%20String%20Empty/README.md) +- [3040. 相同分数的最大操作数目 II](/solution/3000-3099/3040.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20II/README.md) +- [3041. 修改数组后最大化数组中的连续元素数目](/solution/3000-3099/3041.Maximize%20Consecutive%20Elements%20in%20an%20Array%20After%20Modification/README.md) + +#### 第 384 场周赛(2024-02-11 10:30, 90 分钟) 参赛人数 1652 + +- [3033. 修改矩阵](/solution/3000-3099/3033.Modify%20the%20Matrix/README.md) +- [3034. 匹配模式数组的子数组数目 I](/solution/3000-3099/3034.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20I/README.md) +- [3035. 回文字符串的最大数量](/solution/3000-3099/3035.Maximum%20Palindromes%20After%20Operations/README.md) +- [3036. 匹配模式数组的子数组数目 II](/solution/3000-3099/3036.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20II/README.md) + +#### 第 383 场周赛(2024-02-04 10:30, 90 分钟) 参赛人数 2691 + +- [3028. 边界上的蚂蚁](/solution/3000-3099/3028.Ant%20on%20the%20Boundary/README.md) +- [3029. 将单词恢复初始状态所需的最短时间 I](/solution/3000-3099/3029.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20I/README.md) +- [3030. 找出网格的区域平均强度](/solution/3000-3099/3030.Find%20the%20Grid%20of%20Region%20Average/README.md) +- [3031. 将单词恢复初始状态所需的最短时间 II](/solution/3000-3099/3031.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20II/README.md) + +#### 第 123 场双周赛(2024-02-03 22:30, 90 分钟) 参赛人数 2209 + +- [3024. 三角形类型](/solution/3000-3099/3024.Type%20of%20Triangle/README.md) +- [3025. 人员站位的方案数 I](/solution/3000-3099/3025.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20I/README.md) +- [3026. 最大好子数组和](/solution/3000-3099/3026.Maximum%20Good%20Subarray%20Sum/README.md) +- [3027. 人员站位的方案数 II](/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/README.md) + +#### 第 382 场周赛(2024-01-28 10:30, 90 分钟) 参赛人数 3134 + +- [3019. 按键变更的次数](/solution/3000-3099/3019.Number%20of%20Changing%20Keys/README.md) +- [3020. 子集中元素的最大数量](/solution/3000-3099/3020.Find%20the%20Maximum%20Number%20of%20Elements%20in%20Subset/README.md) +- [3021. Alice 和 Bob 玩鲜花游戏](/solution/3000-3099/3021.Alice%20and%20Bob%20Playing%20Flower%20Game/README.md) +- [3022. 给定操作次数内使剩余元素的或值最小](/solution/3000-3099/3022.Minimize%20OR%20of%20Remaining%20Elements%20Using%20Operations/README.md) + +#### 第 381 场周赛(2024-01-21 10:30, 90 分钟) 参赛人数 3737 + +- [3014. 输入单词需要的最少按键次数 I](/solution/3000-3099/3014.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20I/README.md) +- [3015. 按距离统计房屋对数目 I](/solution/3000-3099/3015.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20I/README.md) +- [3016. 输入单词需要的最少按键次数 II](/solution/3000-3099/3016.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20II/README.md) +- [3017. 按距离统计房屋对数目 II](/solution/3000-3099/3017.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20II/README.md) + +#### 第 122 场双周赛(2024-01-20 22:30, 90 分钟) 参赛人数 2547 + +- [3010. 将数组分成最小总代价的子数组 I](/solution/3000-3099/3010.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20I/README.md) +- [3011. 判断一个数组是否可以变为有序](/solution/3000-3099/3011.Find%20if%20Array%20Can%20Be%20Sorted/README.md) +- [3012. 通过操作使数组长度最小](/solution/3000-3099/3012.Minimize%20Length%20of%20Array%20Using%20Operations/README.md) +- [3013. 将数组分成最小总代价的子数组 II](/solution/3000-3099/3013.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20II/README.md) + +#### 第 380 场周赛(2024-01-14 10:30, 90 分钟) 参赛人数 3325 + +- [3005. 最大频率元素计数](/solution/3000-3099/3005.Count%20Elements%20With%20Maximum%20Frequency/README.md) +- [3006. 找出数组中的美丽下标 I](/solution/3000-3099/3006.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I/README.md) +- [3007. 价值和小于等于 K 的最大数字](/solution/3000-3099/3007.Maximum%20Number%20That%20Sum%20of%20the%20Prices%20Is%20Less%20Than%20or%20Equal%20to%20K/README.md) +- [3008. 找出数组中的美丽下标 II](/solution/3000-3099/3008.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20II/README.md) + +#### 第 379 场周赛(2024-01-07 10:30, 90 分钟) 参赛人数 3117 + +- [3000. 对角线最长的矩形的面积](/solution/3000-3099/3000.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README.md) +- [3001. 捕获黑皇后需要的最少移动次数](/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/README.md) +- [3002. 移除后集合的最多元素数](/solution/3000-3099/3002.Maximum%20Size%20of%20a%20Set%20After%20Removals/README.md) +- [3003. 执行操作后的最大分割数量](/solution/3000-3099/3003.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README.md) + +#### 第 121 场双周赛(2024-01-06 22:30, 90 分钟) 参赛人数 2218 + +- [2996. 大于等于顺序前缀和的最小缺失整数](/solution/2900-2999/2996.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README.md) +- [2997. 使数组异或和等于 K 的最少操作次数](/solution/2900-2999/2997.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README.md) +- [2998. 使 X 和 Y 相等的最少操作次数](/solution/2900-2999/2998.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README.md) +- [2999. 统计强大整数的数目](/solution/2900-2999/2999.Count%20the%20Number%20of%20Powerful%20Integers/README.md) + +#### 第 378 场周赛(2023-12-31 10:30, 90 分钟) 参赛人数 2747 + +- [2980. 检查按位或是否存在尾随零](/solution/2900-2999/2980.Check%20if%20Bitwise%20OR%20Has%20Trailing%20Zeros/README.md) +- [2981. 找出出现至少三次的最长特殊子字符串 I](/solution/2900-2999/2981.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20I/README.md) +- [2982. 找出出现至少三次的最长特殊子字符串 II](/solution/2900-2999/2982.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20II/README.md) +- [2983. 回文串重新排列查询](/solution/2900-2999/2983.Palindrome%20Rearrangement%20Queries/README.md) + +#### 第 377 场周赛(2023-12-24 10:30, 90 分钟) 参赛人数 3148 + +- [2974. 最小数字游戏](/solution/2900-2999/2974.Minimum%20Number%20Game/README.md) +- [2975. 移除栅栏得到的正方形田地的最大面积](/solution/2900-2999/2975.Maximum%20Square%20Area%20by%20Removing%20Fences%20From%20a%20Field/README.md) +- [2976. 转换字符串的最小成本 I](/solution/2900-2999/2976.Minimum%20Cost%20to%20Convert%20String%20I/README.md) +- [2977. 转换字符串的最小成本 II](/solution/2900-2999/2977.Minimum%20Cost%20to%20Convert%20String%20II/README.md) + +#### 第 120 场双周赛(2023-12-23 22:30, 90 分钟) 参赛人数 2542 + +- [2970. 统计移除递增子数组的数目 I](/solution/2900-2999/2970.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README.md) +- [2971. 找到最大周长的多边形](/solution/2900-2999/2971.Find%20Polygon%20With%20the%20Largest%20Perimeter/README.md) +- [2972. 统计移除递增子数组的数目 II](/solution/2900-2999/2972.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README.md) +- [2973. 树中每个节点放置的金币数目](/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README.md) + +#### 第 376 场周赛(2023-12-17 10:30, 90 分钟) 参赛人数 3409 + +- [2965. 找出缺失和重复的数字](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README.md) +- [2966. 划分数组并满足最大差限制](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README.md) +- [2967. 使数组成为等数数组的最小代价](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README.md) +- [2968. 执行操作使频率分数最大](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README.md) + +#### 第 375 场周赛(2023-12-10 10:30, 90 分钟) 参赛人数 3518 + +- [2960. 统计已测试设备](/solution/2900-2999/2960.Count%20Tested%20Devices%20After%20Test%20Operations/README.md) +- [2961. 双模幂运算](/solution/2900-2999/2961.Double%20Modular%20Exponentiation/README.md) +- [2962. 统计最大元素出现至少 K 次的子数组](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README.md) +- [2963. 统计好分割方案的数目](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README.md) + +#### 第 119 场双周赛(2023-12-09 22:30, 90 分钟) 参赛人数 2472 + +- [2956. 找到两个数组中的公共元素](/solution/2900-2999/2956.Find%20Common%20Elements%20Between%20Two%20Arrays/README.md) +- [2957. 消除相邻近似相等字符](/solution/2900-2999/2957.Remove%20Adjacent%20Almost-Equal%20Characters/README.md) +- [2958. 最多 K 个重复元素的最长子数组](/solution/2900-2999/2958.Length%20of%20Longest%20Subarray%20With%20at%20Most%20K%20Frequency/README.md) +- [2959. 关闭分部的可行集合数目](/solution/2900-2999/2959.Number%20of%20Possible%20Sets%20of%20Closing%20Branches/README.md) + +#### 第 374 场周赛(2023-12-03 10:30, 90 分钟) 参赛人数 4053 + +- [2951. 找出峰值](/solution/2900-2999/2951.Find%20the%20Peaks/README.md) +- [2952. 需要添加的硬币的最小数量](/solution/2900-2999/2952.Minimum%20Number%20of%20Coins%20to%20be%20Added/README.md) +- [2953. 统计完全子字符串](/solution/2900-2999/2953.Count%20Complete%20Substrings/README.md) +- [2954. 统计感冒序列的数目](/solution/2900-2999/2954.Count%20the%20Number%20of%20Infection%20Sequences/README.md) + +#### 第 373 场周赛(2023-11-26 10:30, 90 分钟) 参赛人数 3577 + +- [2946. 循环移位后的矩阵相似检查](/solution/2900-2999/2946.Matrix%20Similarity%20After%20Cyclic%20Shifts/README.md) +- [2947. 统计美丽子字符串 I](/solution/2900-2999/2947.Count%20Beautiful%20Substrings%20I/README.md) +- [2948. 交换得到字典序最小的数组](/solution/2900-2999/2948.Make%20Lexicographically%20Smallest%20Array%20by%20Swapping%20Elements/README.md) +- [2949. 统计美丽子字符串 II](/solution/2900-2999/2949.Count%20Beautiful%20Substrings%20II/README.md) + +#### 第 118 场双周赛(2023-11-25 22:30, 90 分钟) 参赛人数 2425 + +- [2942. 查找包含给定字符的单词](/solution/2900-2999/2942.Find%20Words%20Containing%20Character/README.md) +- [2943. 最大化网格图中正方形空洞的面积](/solution/2900-2999/2943.Maximize%20Area%20of%20Square%20Hole%20in%20Grid/README.md) +- [2944. 购买水果需要的最少金币数](/solution/2900-2999/2944.Minimum%20Number%20of%20Coins%20for%20Fruits/README.md) +- [2945. 找到最大非递减数组的长度](/solution/2900-2999/2945.Find%20Maximum%20Non-decreasing%20Array%20Length/README.md) + +#### 第 372 场周赛(2023-11-19 10:30, 90 分钟) 参赛人数 3920 + +- [2937. 使三个字符串相等](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README.md) +- [2938. 区分黑球与白球](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README.md) +- [2939. 最大异或乘积](/solution/2900-2999/2939.Maximum%20Xor%20Product/README.md) +- [2940. 找到 Alice 和 Bob 可以相遇的建筑](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README.md) + +#### 第 371 场周赛(2023-11-12 10:30, 90 分钟) 参赛人数 3638 + +- [2932. 找出强数对的最大异或值 I](/solution/2900-2999/2932.Maximum%20Strong%20Pair%20XOR%20I/README.md) +- [2933. 高访问员工](/solution/2900-2999/2933.High-Access%20Employees/README.md) +- [2934. 最大化数组末位元素的最少操作次数](/solution/2900-2999/2934.Minimum%20Operations%20to%20Maximize%20Last%20Elements%20in%20Arrays/README.md) +- [2935. 找出强数对的最大异或值 II](/solution/2900-2999/2935.Maximum%20Strong%20Pair%20XOR%20II/README.md) + +#### 第 117 场双周赛(2023-11-11 22:30, 90 分钟) 参赛人数 2629 + +- [2928. 给小朋友们分糖果 I](/solution/2900-2999/2928.Distribute%20Candies%20Among%20Children%20I/README.md) +- [2929. 给小朋友们分糖果 II](/solution/2900-2999/2929.Distribute%20Candies%20Among%20Children%20II/README.md) +- [2930. 重新排列后包含指定子字符串的字符串数目](/solution/2900-2999/2930.Number%20of%20Strings%20Which%20Can%20Be%20Rearranged%20to%20Contain%20Substring/README.md) +- [2931. 购买物品的最大开销](/solution/2900-2999/2931.Maximum%20Spending%20After%20Buying%20Items/README.md) + +#### 第 370 场周赛(2023-11-05 10:30, 90 分钟) 参赛人数 3983 + +- [2923. 找到冠军 I](/solution/2900-2999/2923.Find%20Champion%20I/README.md) +- [2924. 找到冠军 II](/solution/2900-2999/2924.Find%20Champion%20II/README.md) +- [2925. 在树上执行操作以后得到的最大分数](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README.md) +- [2926. 平衡子序列的最大和](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README.md) + +#### 第 369 场周赛(2023-10-29 10:30, 90 分钟) 参赛人数 4121 + +- [2917. 找出数组中的 K-or 值](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README.md) +- [2918. 数组的最小相等和](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README.md) +- [2919. 使数组变美的最小增量运算数](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README.md) +- [2920. 收集所有金币可获得的最大积分](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README.md) + +#### 第 116 场双周赛(2023-10-28 22:30, 90 分钟) 参赛人数 2904 + +- [2913. 子数组不同元素数目的平方和 I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README.md) +- [2914. 使二进制字符串变美丽的最少修改次数](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README.md) +- [2915. 和为目标值的最长子序列的长度](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README.md) +- [2916. 子数组不同元素数目的平方和 II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README.md) + +#### 第 368 场周赛(2023-10-22 10:30, 90 分钟) 参赛人数 5002 + +- [2908. 元素和最小的山形三元组 I](/solution/2900-2999/2908.Minimum%20Sum%20of%20Mountain%20Triplets%20I/README.md) +- [2909. 元素和最小的山形三元组 II](/solution/2900-2999/2909.Minimum%20Sum%20of%20Mountain%20Triplets%20II/README.md) +- [2910. 合法分组的最少组数](/solution/2900-2999/2910.Minimum%20Number%20of%20Groups%20to%20Create%20a%20Valid%20Assignment/README.md) +- [2911. 得到 K 个半回文串的最少修改次数](/solution/2900-2999/2911.Minimum%20Changes%20to%20Make%20K%20Semi-palindromes/README.md) + +#### 第 367 场周赛(2023-10-15 10:30, 90 分钟) 参赛人数 4317 + +- [2903. 找出满足差值条件的下标 I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README.md) +- [2904. 最短且字典序最小的美丽子字符串](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README.md) +- [2905. 找出满足差值条件的下标 II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README.md) +- [2906. 构造乘积矩阵](/solution/2900-2999/2906.Construct%20Product%20Matrix/README.md) + +#### 第 115 场双周赛(2023-10-14 22:30, 90 分钟) 参赛人数 2809 + +- [2899. 上一个遍历的整数](/solution/2800-2899/2899.Last%20Visited%20Integers/README.md) +- [2900. 最长相邻不相等子序列 I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README.md) +- [2901. 最长相邻不相等子序列 II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README.md) +- [2902. 和带限制的子多重集合的数目](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README.md) + +#### 第 366 场周赛(2023-10-08 10:30, 90 分钟) 参赛人数 2790 + +- [2894. 分类求和并作差](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README.md) +- [2895. 最小处理时间](/solution/2800-2899/2895.Minimum%20Processing%20Time/README.md) +- [2896. 执行操作使两个字符串相等](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README.md) +- [2897. 对数组执行操作使平方和最大](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README.md) + +#### 第 365 场周赛(2023-10-01 10:30, 90 分钟) 参赛人数 2909 + +- [2873. 有序三元组中的最大值 I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README.md) +- [2874. 有序三元组中的最大值 II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README.md) +- [2875. 无限数组的最短子数组](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README.md) +- [2876. 有向图访问计数](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README.md) + +#### 第 114 场双周赛(2023-09-30 22:30, 90 分钟) 参赛人数 2406 + +- [2869. 收集元素的最少操作次数](/solution/2800-2899/2869.Minimum%20Operations%20to%20Collect%20Elements/README.md) +- [2870. 使数组为空的最少操作次数](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README.md) +- [2871. 将数组分割成最多数目的子数组](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README.md) +- [2872. 可以被 K 整除连通块的最大数目](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README.md) + +#### 第 364 场周赛(2023-09-24 10:30, 90 分钟) 参赛人数 4304 + +- [2864. 最大二进制奇数](/solution/2800-2899/2864.Maximum%20Odd%20Binary%20Number/README.md) +- [2865. 美丽塔 I](/solution/2800-2899/2865.Beautiful%20Towers%20I/README.md) +- [2866. 美丽塔 II](/solution/2800-2899/2866.Beautiful%20Towers%20II/README.md) +- [2867. 统计树中的合法路径数目](/solution/2800-2899/2867.Count%20Valid%20Paths%20in%20a%20Tree/README.md) + +#### 第 363 场周赛(2023-09-17 10:30, 90 分钟) 参赛人数 4768 + +- [2859. 计算 K 置位下标对应元素的和](/solution/2800-2899/2859.Sum%20of%20Values%20at%20Indices%20With%20K%20Set%20Bits/README.md) +- [2860. 让所有学生保持开心的分组方法数](/solution/2800-2899/2860.Happy%20Students/README.md) +- [2861. 最大合金数](/solution/2800-2899/2861.Maximum%20Number%20of%20Alloys/README.md) +- [2862. 完全子集的最大元素和](/solution/2800-2899/2862.Maximum%20Element-Sum%20of%20a%20Complete%20Subset%20of%20Indices/README.md) + +#### 第 113 场双周赛(2023-09-16 22:30, 90 分钟) 参赛人数 3028 + +- [2855. 使数组成为递增数组的最少右移次数](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README.md) +- [2856. 删除数对后的最小数组长度](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README.md) +- [2857. 统计距离为 k 的点对](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README.md) +- [2858. 可以到达每一个节点的最少边反转次数](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README.md) + +#### 第 362 场周赛(2023-09-10 10:30, 90 分钟) 参赛人数 4800 + +- [2848. 与车相交的点](/solution/2800-2899/2848.Points%20That%20Intersect%20With%20Cars/README.md) +- [2849. 判断能否在给定时间到达单元格](/solution/2800-2899/2849.Determine%20if%20a%20Cell%20Is%20Reachable%20at%20a%20Given%20Time/README.md) +- [2850. 将石头分散到网格图的最少移动次数](/solution/2800-2899/2850.Minimum%20Moves%20to%20Spread%20Stones%20Over%20Grid/README.md) +- [2851. 字符串转换](/solution/2800-2899/2851.String%20Transformation/README.md) + +#### 第 361 场周赛(2023-09-03 10:30, 90 分钟) 参赛人数 4170 + +- [2843. 统计对称整数的数目](/solution/2800-2899/2843.Count%20Symmetric%20Integers/README.md) +- [2844. 生成特殊数字的最少操作](/solution/2800-2899/2844.Minimum%20Operations%20to%20Make%20a%20Special%20Number/README.md) +- [2845. 统计趣味子数组的数目](/solution/2800-2899/2845.Count%20of%20Interesting%20Subarrays/README.md) +- [2846. 边权重均等查询](/solution/2800-2899/2846.Minimum%20Edge%20Weight%20Equilibrium%20Queries%20in%20a%20Tree/README.md) + +#### 第 112 场双周赛(2023-09-02 22:30, 90 分钟) 参赛人数 2900 + +- [2839. 判断通过操作能否让字符串相等 I](/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README.md) +- [2840. 判断通过操作能否让字符串相等 II](/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README.md) +- [2841. 几乎唯一子数组的最大和](/solution/2800-2899/2841.Maximum%20Sum%20of%20Almost%20Unique%20Subarray/README.md) +- [2842. 统计一个字符串的 k 子序列美丽值最大的数目](/solution/2800-2899/2842.Count%20K-Subsequences%20of%20a%20String%20With%20Maximum%20Beauty/README.md) + +#### 第 360 场周赛(2023-08-27 10:30, 90 分钟) 参赛人数 4496 + +- [2833. 距离原点最远的点](/solution/2800-2899/2833.Furthest%20Point%20From%20Origin/README.md) +- [2834. 找出美丽数组的最小和](/solution/2800-2899/2834.Find%20the%20Minimum%20Possible%20Sum%20of%20a%20Beautiful%20Array/README.md) +- [2835. 使子序列的和等于目标的最少操作次数](/solution/2800-2899/2835.Minimum%20Operations%20to%20Form%20Subsequence%20With%20Target%20Sum/README.md) +- [2836. 在传球游戏中最大化函数值](/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README.md) + +#### 第 359 场周赛(2023-08-20 10:30, 90 分钟) 参赛人数 4101 + +- [2828. 判别首字母缩略词](/solution/2800-2899/2828.Check%20if%20a%20String%20Is%20an%20Acronym%20of%20Words/README.md) +- [2829. k-avoiding 数组的最小总和](/solution/2800-2899/2829.Determine%20the%20Minimum%20Sum%20of%20a%20k-avoiding%20Array/README.md) +- [2830. 销售利润最大化](/solution/2800-2899/2830.Maximize%20the%20Profit%20as%20the%20Salesman/README.md) +- [2831. 找出最长等值子数组](/solution/2800-2899/2831.Find%20the%20Longest%20Equal%20Subarray/README.md) + +#### 第 111 场双周赛(2023-08-19 22:30, 90 分钟) 参赛人数 2787 + +- [2824. 统计和小于目标的下标对数目](/solution/2800-2899/2824.Count%20Pairs%20Whose%20Sum%20is%20Less%20than%20Target/README.md) +- [2825. 循环增长使字符串子序列等于另一个字符串](/solution/2800-2899/2825.Make%20String%20a%20Subsequence%20Using%20Cyclic%20Increments/README.md) +- [2826. 将三个组排序](/solution/2800-2899/2826.Sorting%20Three%20Groups/README.md) +- [2827. 范围中美丽整数的数目](/solution/2800-2899/2827.Number%20of%20Beautiful%20Integers%20in%20the%20Range/README.md) + +#### 第 358 场周赛(2023-08-13 10:30, 90 分钟) 参赛人数 4475 + +- [2815. 数组中的最大数对和](/solution/2800-2899/2815.Max%20Pair%20Sum%20in%20an%20Array/README.md) +- [2816. 翻倍以链表形式表示的数字](/solution/2800-2899/2816.Double%20a%20Number%20Represented%20as%20a%20Linked%20List/README.md) +- [2817. 限制条件下元素之间的最小绝对差](/solution/2800-2899/2817.Minimum%20Absolute%20Difference%20Between%20Elements%20With%20Constraint/README.md) +- [2818. 操作使得分最大](/solution/2800-2899/2818.Apply%20Operations%20to%20Maximize%20Score/README.md) + +#### 第 357 场周赛(2023-08-06 10:30, 90 分钟) 参赛人数 4265 + +- [2810. 故障键盘](/solution/2800-2899/2810.Faulty%20Keyboard/README.md) +- [2811. 判断是否能拆分数组](/solution/2800-2899/2811.Check%20if%20it%20is%20Possible%20to%20Split%20Array/README.md) +- [2812. 找出最安全路径](/solution/2800-2899/2812.Find%20the%20Safest%20Path%20in%20a%20Grid/README.md) +- [2813. 子序列最大优雅度](/solution/2800-2899/2813.Maximum%20Elegance%20of%20a%20K-Length%20Subsequence/README.md) + +#### 第 110 场双周赛(2023-08-05 22:30, 90 分钟) 参赛人数 2546 + +- [2806. 取整购买后的账户余额](/solution/2800-2899/2806.Account%20Balance%20After%20Rounded%20Purchase/README.md) +- [2807. 在链表中插入最大公约数](/solution/2800-2899/2807.Insert%20Greatest%20Common%20Divisors%20in%20Linked%20List/README.md) +- [2808. 使循环数组所有元素相等的最少秒数](/solution/2800-2899/2808.Minimum%20Seconds%20to%20Equalize%20a%20Circular%20Array/README.md) +- [2809. 使数组和小于等于 x 的最少时间](/solution/2800-2899/2809.Minimum%20Time%20to%20Make%20Array%20Sum%20At%20Most%20x/README.md) + +#### 第 356 场周赛(2023-07-30 10:30, 90 分钟) 参赛人数 4082 + +- [2798. 满足目标工作时长的员工数目](/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README.md) +- [2799. 统计完全子数组的数目](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README.md) +- [2800. 包含三个字符串的最短字符串](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README.md) +- [2801. 统计范围内的步进数字数目](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README.md) + +#### 第 355 场周赛(2023-07-23 10:30, 90 分钟) 参赛人数 4112 + +- [2788. 按分隔符拆分字符串](/solution/2700-2799/2788.Split%20Strings%20by%20Separator/README.md) +- [2789. 合并后数组中的最大元素](/solution/2700-2799/2789.Largest%20Element%20in%20an%20Array%20after%20Merge%20Operations/README.md) +- [2790. 长度递增组的最大数目](/solution/2700-2799/2790.Maximum%20Number%20of%20Groups%20With%20Increasing%20Length/README.md) +- [2791. 树中可以形成回文的路径数](/solution/2700-2799/2791.Count%20Paths%20That%20Can%20Form%20a%20Palindrome%20in%20a%20Tree/README.md) + +#### 第 109 场双周赛(2023-07-22 22:30, 90 分钟) 参赛人数 2461 + +- [2784. 检查数组是否是好的](/solution/2700-2799/2784.Check%20if%20Array%20is%20Good/README.md) +- [2785. 将字符串中的元音字母排序](/solution/2700-2799/2785.Sort%20Vowels%20in%20a%20String/README.md) +- [2786. 访问数组中的位置使分数最大](/solution/2700-2799/2786.Visit%20Array%20Positions%20to%20Maximize%20Score/README.md) +- [2787. 将一个数字表示成幂的和的方案数](/solution/2700-2799/2787.Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers/README.md) + +#### 第 354 场周赛(2023-07-16 10:30, 90 分钟) 参赛人数 3957 + +- [2778. 特殊元素平方和](/solution/2700-2799/2778.Sum%20of%20Squares%20of%20Special%20Elements/README.md) +- [2779. 数组的最大美丽值](/solution/2700-2799/2779.Maximum%20Beauty%20of%20an%20Array%20After%20Applying%20Operation/README.md) +- [2780. 合法分割的最小下标](/solution/2700-2799/2780.Minimum%20Index%20of%20a%20Valid%20Split/README.md) +- [2781. 最长合法子字符串的长度](/solution/2700-2799/2781.Length%20of%20the%20Longest%20Valid%20Substring/README.md) + +#### 第 353 场周赛(2023-07-09 10:30, 90 分钟) 参赛人数 4113 + +- [2769. 找出最大的可达成数字](/solution/2700-2799/2769.Find%20the%20Maximum%20Achievable%20Number/README.md) +- [2770. 达到末尾下标所需的最大跳跃次数](/solution/2700-2799/2770.Maximum%20Number%20of%20Jumps%20to%20Reach%20the%20Last%20Index/README.md) +- [2771. 构造最长非递减子数组](/solution/2700-2799/2771.Longest%20Non-decreasing%20Subarray%20From%20Two%20Arrays/README.md) +- [2772. 使数组中的所有元素都等于零](/solution/2700-2799/2772.Apply%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%20Zero/README.md) + +#### 第 108 场双周赛(2023-07-08 22:30, 90 分钟) 参赛人数 2349 + +- [2765. 最长交替子数组](/solution/2700-2799/2765.Longest%20Alternating%20Subarray/README.md) +- [2766. 重新放置石块](/solution/2700-2799/2766.Relocate%20Marbles/README.md) +- [2767. 将字符串分割为最少的美丽子字符串](/solution/2700-2799/2767.Partition%20String%20Into%20Minimum%20Beautiful%20Substrings/README.md) +- [2768. 黑格子的数目](/solution/2700-2799/2768.Number%20of%20Black%20Blocks/README.md) + +#### 第 352 场周赛(2023-07-02 10:30, 90 分钟) 参赛人数 3437 + +- [2760. 最长奇偶子数组](/solution/2700-2799/2760.Longest%20Even%20Odd%20Subarray%20With%20Threshold/README.md) +- [2761. 和等于目标值的质数对](/solution/2700-2799/2761.Prime%20Pairs%20With%20Target%20Sum/README.md) +- [2762. 不间断子数组](/solution/2700-2799/2762.Continuous%20Subarrays/README.md) +- [2763. 所有子数组中不平衡数字之和](/solution/2700-2799/2763.Sum%20of%20Imbalance%20Numbers%20of%20All%20Subarrays/README.md) + +#### 第 351 场周赛(2023-06-25 10:30, 90 分钟) 参赛人数 2471 + +- [2748. 美丽下标对的数目](/solution/2700-2799/2748.Number%20of%20Beautiful%20Pairs/README.md) +- [2749. 得到整数零需要执行的最少操作数](/solution/2700-2799/2749.Minimum%20Operations%20to%20Make%20the%20Integer%20Zero/README.md) +- [2750. 将数组划分成若干好子数组的方式](/solution/2700-2799/2750.Ways%20to%20Split%20Array%20Into%20Good%20Subarrays/README.md) +- [2751. 机器人碰撞](/solution/2700-2799/2751.Robot%20Collisions/README.md) + +#### 第 107 场双周赛(2023-06-24 22:30, 90 分钟) 参赛人数 1870 + +- [2744. 最大字符串配对数目](/solution/2700-2799/2744.Find%20Maximum%20Number%20of%20String%20Pairs/README.md) +- [2745. 构造最长的新字符串](/solution/2700-2799/2745.Construct%20the%20Longest%20New%20String/README.md) +- [2746. 字符串连接删减字母](/solution/2700-2799/2746.Decremental%20String%20Concatenation/README.md) +- [2747. 统计没有收到请求的服务器数目](/solution/2700-2799/2747.Count%20Zero%20Request%20Servers/README.md) + +#### 第 350 场周赛(2023-06-18 10:30, 90 分钟) 参赛人数 3580 + +- [2739. 总行驶距离](/solution/2700-2799/2739.Total%20Distance%20Traveled/README.md) +- [2740. 找出分区值](/solution/2700-2799/2740.Find%20the%20Value%20of%20the%20Partition/README.md) +- [2741. 特别的排列](/solution/2700-2799/2741.Special%20Permutations/README.md) +- [2742. 给墙壁刷油漆](/solution/2700-2799/2742.Painting%20the%20Walls/README.md) + +#### 第 349 场周赛(2023-06-11 10:30, 90 分钟) 参赛人数 3714 + +- [2733. 既不是最小值也不是最大值](/solution/2700-2799/2733.Neither%20Minimum%20nor%20Maximum/README.md) +- [2734. 执行子串操作后的字典序最小字符串](/solution/2700-2799/2734.Lexicographically%20Smallest%20String%20After%20Substring%20Operation/README.md) +- [2735. 收集巧克力](/solution/2700-2799/2735.Collecting%20Chocolates/README.md) +- [2736. 最大和查询](/solution/2700-2799/2736.Maximum%20Sum%20Queries/README.md) + +#### 第 106 场双周赛(2023-06-10 22:30, 90 分钟) 参赛人数 2346 + +- [2729. 判断一个数是否迷人](/solution/2700-2799/2729.Check%20if%20The%20Number%20is%20Fascinating/README.md) +- [2730. 找到最长的半重复子字符串](/solution/2700-2799/2730.Find%20the%20Longest%20Semi-Repetitive%20Substring/README.md) +- [2731. 移动机器人](/solution/2700-2799/2731.Movement%20of%20Robots/README.md) +- [2732. 找到矩阵中的好子集](/solution/2700-2799/2732.Find%20a%20Good%20Subset%20of%20the%20Matrix/README.md) + +#### 第 348 场周赛(2023-06-04 10:30, 90 分钟) 参赛人数 3909 + +- [2716. 最小化字符串长度](/solution/2700-2799/2716.Minimize%20String%20Length/README.md) +- [2717. 半有序排列](/solution/2700-2799/2717.Semi-Ordered%20Permutation/README.md) +- [2718. 查询后矩阵的和](/solution/2700-2799/2718.Sum%20of%20Matrix%20After%20Queries/README.md) +- [2719. 统计整数数目](/solution/2700-2799/2719.Count%20of%20Integers/README.md) + +#### 第 347 场周赛(2023-05-28 10:30, 90 分钟) 参赛人数 3836 + +- [2710. 移除字符串中的尾随零](/solution/2700-2799/2710.Remove%20Trailing%20Zeros%20From%20a%20String/README.md) +- [2711. 对角线上不同值的数量差](/solution/2700-2799/2711.Difference%20of%20Number%20of%20Distinct%20Values%20on%20Diagonals/README.md) +- [2712. 使所有字符相等的最小成本](/solution/2700-2799/2712.Minimum%20Cost%20to%20Make%20All%20Characters%20Equal/README.md) +- [2713. 矩阵中严格递增的单元格数](/solution/2700-2799/2713.Maximum%20Strictly%20Increasing%20Cells%20in%20a%20Matrix/README.md) + +#### 第 105 场双周赛(2023-05-27 22:30, 90 分钟) 参赛人数 2604 + +- [2706. 购买两块巧克力](/solution/2700-2799/2706.Buy%20Two%20Chocolates/README.md) +- [2707. 字符串中的额外字符](/solution/2700-2799/2707.Extra%20Characters%20in%20a%20String/README.md) +- [2708. 一个小组的最大实力值](/solution/2700-2799/2708.Maximum%20Strength%20of%20a%20Group/README.md) +- [2709. 最大公约数遍历](/solution/2700-2799/2709.Greatest%20Common%20Divisor%20Traversal/README.md) + +#### 第 346 场周赛(2023-05-21 10:30, 90 分钟) 参赛人数 4035 + +- [2696. 删除子串后的字符串最小长度](/solution/2600-2699/2696.Minimum%20String%20Length%20After%20Removing%20Substrings/README.md) +- [2697. 字典序最小回文串](/solution/2600-2699/2697.Lexicographically%20Smallest%20Palindrome/README.md) +- [2698. 求一个整数的惩罚数](/solution/2600-2699/2698.Find%20the%20Punishment%20Number%20of%20an%20Integer/README.md) +- [2699. 修改图中的边权](/solution/2600-2699/2699.Modify%20Graph%20Edge%20Weights/README.md) + +#### 第 345 场周赛(2023-05-14 10:30, 90 分钟) 参赛人数 4165 + +- [2682. 找出转圈游戏输家](/solution/2600-2699/2682.Find%20the%20Losers%20of%20the%20Circular%20Game/README.md) +- [2683. 相邻值的按位异或](/solution/2600-2699/2683.Neighboring%20Bitwise%20XOR/README.md) +- [2684. 矩阵中移动的最大次数](/solution/2600-2699/2684.Maximum%20Number%20of%20Moves%20in%20a%20Grid/README.md) +- [2685. 统计完全连通分量的数量](/solution/2600-2699/2685.Count%20the%20Number%20of%20Complete%20Components/README.md) + +#### 第 104 场双周赛(2023-05-13 22:30, 90 分钟) 参赛人数 2519 + +- [2678. 老人的数目](/solution/2600-2699/2678.Number%20of%20Senior%20Citizens/README.md) +- [2679. 矩阵中的和](/solution/2600-2699/2679.Sum%20in%20a%20Matrix/README.md) +- [2680. 最大或值](/solution/2600-2699/2680.Maximum%20OR/README.md) +- [2681. 英雄的力量](/solution/2600-2699/2681.Power%20of%20Heroes/README.md) + +#### 第 344 场周赛(2023-05-07 10:30, 90 分钟) 参赛人数 3986 + +- [2670. 找出不同元素数目差数组](/solution/2600-2699/2670.Find%20the%20Distinct%20Difference%20Array/README.md) +- [2671. 频率跟踪器](/solution/2600-2699/2671.Frequency%20Tracker/README.md) +- [2672. 有相同颜色的相邻元素数目](/solution/2600-2699/2672.Number%20of%20Adjacent%20Elements%20With%20the%20Same%20Color/README.md) +- [2673. 使二叉树所有路径值相等的最小代价](/solution/2600-2699/2673.Make%20Costs%20of%20Paths%20Equal%20in%20a%20Binary%20Tree/README.md) + +#### 第 343 场周赛(2023-04-30 10:30, 90 分钟) 参赛人数 3313 + +- [2660. 保龄球游戏的获胜者](/solution/2600-2699/2660.Determine%20the%20Winner%20of%20a%20Bowling%20Game/README.md) +- [2661. 找出叠涂元素](/solution/2600-2699/2661.First%20Completely%20Painted%20Row%20or%20Column/README.md) +- [2662. 前往目标的最小代价](/solution/2600-2699/2662.Minimum%20Cost%20of%20a%20Path%20With%20Special%20Roads/README.md) +- [2663. 字典序最小的美丽字符串](/solution/2600-2699/2663.Lexicographically%20Smallest%20Beautiful%20String/README.md) + +#### 第 103 场双周赛(2023-04-29 22:30, 90 分钟) 参赛人数 2299 + +- [2656. K 个元素的最大和](/solution/2600-2699/2656.Maximum%20Sum%20With%20Exactly%20K%20Elements/README.md) +- [2657. 找到两个数组的前缀公共数组](/solution/2600-2699/2657.Find%20the%20Prefix%20Common%20Array%20of%20Two%20Arrays/README.md) +- [2658. 网格图中鱼的最大数目](/solution/2600-2699/2658.Maximum%20Number%20of%20Fish%20in%20a%20Grid/README.md) +- [2659. 将数组清空](/solution/2600-2699/2659.Make%20Array%20Empty/README.md) + +#### 第 342 场周赛(2023-04-23 10:30, 90 分钟) 参赛人数 3702 + +- [2651. 计算列车到站时间](/solution/2600-2699/2651.Calculate%20Delayed%20Arrival%20Time/README.md) +- [2652. 倍数求和](/solution/2600-2699/2652.Sum%20Multiples/README.md) +- [2653. 滑动子数组的美丽值](/solution/2600-2699/2653.Sliding%20Subarray%20Beauty/README.md) +- [2654. 使数组所有元素变成 1 的最少操作次数](/solution/2600-2699/2654.Minimum%20Number%20of%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%201/README.md) + +#### 第 341 场周赛(2023-04-16 10:30, 90 分钟) 参赛人数 4792 + +- [2643. 一最多的行](/solution/2600-2699/2643.Row%20With%20Maximum%20Ones/README.md) +- [2644. 找出可整除性得分最大的整数](/solution/2600-2699/2644.Find%20the%20Maximum%20Divisibility%20Score/README.md) +- [2645. 构造有效字符串的最少插入数](/solution/2600-2699/2645.Minimum%20Additions%20to%20Make%20Valid%20String/README.md) +- [2646. 最小化旅行的价格总和](/solution/2600-2699/2646.Minimize%20the%20Total%20Price%20of%20the%20Trips/README.md) + +#### 第 102 场双周赛(2023-04-15 22:30, 90 分钟) 参赛人数 3058 + +- [2639. 查询网格图中每一列的宽度](/solution/2600-2699/2639.Find%20the%20Width%20of%20Columns%20of%20a%20Grid/README.md) +- [2640. 一个数组所有前缀的分数](/solution/2600-2699/2640.Find%20the%20Score%20of%20All%20Prefixes%20of%20an%20Array/README.md) +- [2641. 二叉树的堂兄弟节点 II](/solution/2600-2699/2641.Cousins%20in%20Binary%20Tree%20II/README.md) +- [2642. 设计可以求最短路径的图类](/solution/2600-2699/2642.Design%20Graph%20With%20Shortest%20Path%20Calculator/README.md) + +#### 第 340 场周赛(2023-04-09 10:30, 90 分钟) 参赛人数 4937 + +- [2614. 对角线上的质数](/solution/2600-2699/2614.Prime%20In%20Diagonal/README.md) +- [2615. 等值距离和](/solution/2600-2699/2615.Sum%20of%20Distances/README.md) +- [2616. 最小化数对的最大差值](/solution/2600-2699/2616.Minimize%20the%20Maximum%20Difference%20of%20Pairs/README.md) +- [2617. 网格图中最少访问的格子数](/solution/2600-2699/2617.Minimum%20Number%20of%20Visited%20Cells%20in%20a%20Grid/README.md) + +#### 第 339 场周赛(2023-04-02 10:30, 90 分钟) 参赛人数 5180 + +- [2609. 最长平衡子字符串](/solution/2600-2699/2609.Find%20the%20Longest%20Balanced%20Substring%20of%20a%20Binary%20String/README.md) +- [2610. 转换二维数组](/solution/2600-2699/2610.Convert%20an%20Array%20Into%20a%202D%20Array%20With%20Conditions/README.md) +- [2611. 老鼠和奶酪](/solution/2600-2699/2611.Mice%20and%20Cheese/README.md) +- [2612. 最少翻转操作数](/solution/2600-2699/2612.Minimum%20Reverse%20Operations/README.md) + +#### 第 101 场双周赛(2023-04-01 22:30, 90 分钟) 参赛人数 3353 + +- [2605. 从两个数字数组里生成最小数字](/solution/2600-2699/2605.Form%20Smallest%20Number%20From%20Two%20Digit%20Arrays/README.md) +- [2606. 找到最大开销的子字符串](/solution/2600-2699/2606.Find%20the%20Substring%20With%20Maximum%20Cost/README.md) +- [2607. 使子数组元素和相等](/solution/2600-2699/2607.Make%20K-Subarray%20Sums%20Equal/README.md) +- [2608. 图中的最短环](/solution/2600-2699/2608.Shortest%20Cycle%20in%20a%20Graph/README.md) + +#### 第 338 场周赛(2023-03-26 10:30, 90 分钟) 参赛人数 5594 + +- [2600. K 件物品的最大和](/solution/2600-2699/2600.K%20Items%20With%20the%20Maximum%20Sum/README.md) +- [2601. 质数减法运算](/solution/2600-2699/2601.Prime%20Subtraction%20Operation/README.md) +- [2602. 使数组元素全部相等的最少操作次数](/solution/2600-2699/2602.Minimum%20Operations%20to%20Make%20All%20Array%20Elements%20Equal/README.md) +- [2603. 收集树中金币](/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README.md) + +#### 第 337 场周赛(2023-03-19 10:30, 90 分钟) 参赛人数 5628 + +- [2595. 奇偶位数](/solution/2500-2599/2595.Number%20of%20Even%20and%20Odd%20Bits/README.md) +- [2596. 检查骑士巡视方案](/solution/2500-2599/2596.Check%20Knight%20Tour%20Configuration/README.md) +- [2597. 美丽子集的数目](/solution/2500-2599/2597.The%20Number%20of%20Beautiful%20Subsets/README.md) +- [2598. 执行操作后的最大 MEX](/solution/2500-2599/2598.Smallest%20Missing%20Non-negative%20Integer%20After%20Operations/README.md) + +#### 第 100 场双周赛(2023-03-18 22:30, 90 分钟) 参赛人数 3639 + +- [2591. 将钱分给最多的儿童](/solution/2500-2599/2591.Distribute%20Money%20to%20Maximum%20Children/README.md) +- [2592. 最大化数组的伟大值](/solution/2500-2599/2592.Maximize%20Greatness%20of%20an%20Array/README.md) +- [2593. 标记所有元素后数组的分数](/solution/2500-2599/2593.Find%20Score%20of%20an%20Array%20After%20Marking%20All%20Elements/README.md) +- [2594. 修车的最少时间](/solution/2500-2599/2594.Minimum%20Time%20to%20Repair%20Cars/README.md) + +#### 第 336 场周赛(2023-03-12 10:30, 90 分钟) 参赛人数 5897 + +- [2586. 统计范围内的元音字符串数](/solution/2500-2599/2586.Count%20the%20Number%20of%20Vowel%20Strings%20in%20Range/README.md) +- [2587. 重排数组以得到最大前缀分数](/solution/2500-2599/2587.Rearrange%20Array%20to%20Maximize%20Prefix%20Score/README.md) +- [2588. 统计美丽子数组数目](/solution/2500-2599/2588.Count%20the%20Number%20of%20Beautiful%20Subarrays/README.md) +- [2589. 完成所有任务的最少时间](/solution/2500-2599/2589.Minimum%20Time%20to%20Complete%20All%20Tasks/README.md) + +#### 第 335 场周赛(2023-03-05 10:30, 90 分钟) 参赛人数 6019 + +- [2582. 递枕头](/solution/2500-2599/2582.Pass%20the%20Pillow/README.md) +- [2583. 二叉树中的第 K 大层和](/solution/2500-2599/2583.Kth%20Largest%20Sum%20in%20a%20Binary%20Tree/README.md) +- [2584. 分割数组使乘积互质](/solution/2500-2599/2584.Split%20the%20Array%20to%20Make%20Coprime%20Products/README.md) +- [2585. 获得分数的方法数](/solution/2500-2599/2585.Number%20of%20Ways%20to%20Earn%20Points/README.md) + +#### 第 99 场双周赛(2023-03-04 22:30, 90 分钟) 参赛人数 3467 + +- [2578. 最小和分割](/solution/2500-2599/2578.Split%20With%20Minimum%20Sum/README.md) +- [2579. 统计染色格子数](/solution/2500-2599/2579.Count%20Total%20Number%20of%20Colored%20Cells/README.md) +- [2580. 统计将重叠区间合并成组的方案数](/solution/2500-2599/2580.Count%20Ways%20to%20Group%20Overlapping%20Ranges/README.md) +- [2581. 统计可能的树根数目](/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README.md) + +#### 第 334 场周赛(2023-02-26 10:30, 90 分钟) 参赛人数 5501 + +- [2574. 左右元素和的差值](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README.md) +- [2575. 找出字符串的可整除数组](/solution/2500-2599/2575.Find%20the%20Divisibility%20Array%20of%20a%20String/README.md) +- [2576. 求出最多标记下标](/solution/2500-2599/2576.Find%20the%20Maximum%20Number%20of%20Marked%20Indices/README.md) +- [2577. 在网格图中访问一个格子的最少时间](/solution/2500-2599/2577.Minimum%20Time%20to%20Visit%20a%20Cell%20In%20a%20Grid/README.md) + +#### 第 333 场周赛(2023-02-19 10:30, 90 分钟) 参赛人数 4969 + +- [2570. 合并两个二维数组 - 求和法](/solution/2500-2599/2570.Merge%20Two%202D%20Arrays%20by%20Summing%20Values/README.md) +- [2571. 将整数减少到零需要的最少操作数](/solution/2500-2599/2571.Minimum%20Operations%20to%20Reduce%20an%20Integer%20to%200/README.md) +- [2572. 无平方子集计数](/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README.md) +- [2573. 找出对应 LCP 矩阵的字符串](/solution/2500-2599/2573.Find%20the%20String%20with%20LCP/README.md) + +#### 第 98 场双周赛(2023-02-18 22:30, 90 分钟) 参赛人数 3250 + +- [2566. 替换一个数字后的最大差值](/solution/2500-2599/2566.Maximum%20Difference%20by%20Remapping%20a%20Digit/README.md) +- [2567. 修改两个元素的最小分数](/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README.md) +- [2568. 最小无法得到的或值](/solution/2500-2599/2568.Minimum%20Impossible%20OR/README.md) +- [2569. 更新数组后处理求和查询](/solution/2500-2599/2569.Handling%20Sum%20Queries%20After%20Update/README.md) + +#### 第 332 场周赛(2023-02-12 10:30, 90 分钟) 参赛人数 4547 + +- [2562. 找出数组的串联值](/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README.md) +- [2563. 统计公平数对的数目](/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README.md) +- [2564. 子字符串异或查询](/solution/2500-2599/2564.Substring%20XOR%20Queries/README.md) +- [2565. 最少得分子序列](/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README.md) + +#### 第 331 场周赛(2023-02-05 10:30, 90 分钟) 参赛人数 4256 + +- [2558. 从数量最多的堆取走礼物](/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README.md) +- [2559. 统计范围内的元音字符串数](/solution/2500-2599/2559.Count%20Vowel%20Strings%20in%20Ranges/README.md) +- [2560. 打家劫舍 IV](/solution/2500-2599/2560.House%20Robber%20IV/README.md) +- [2561. 重排水果](/solution/2500-2599/2561.Rearranging%20Fruits/README.md) + +#### 第 97 场双周赛(2023-02-04 22:30, 90 分钟) 参赛人数 2631 + +- [2553. 分割数组中数字的数位](/solution/2500-2599/2553.Separate%20the%20Digits%20in%20an%20Array/README.md) +- [2554. 从一个范围内选择最多整数 I](/solution/2500-2599/2554.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20I/README.md) +- [2555. 两个线段获得的最多奖品](/solution/2500-2599/2555.Maximize%20Win%20From%20Two%20Segments/README.md) +- [2556. 二进制矩阵中翻转最多一次使路径不连通](/solution/2500-2599/2556.Disconnect%20Path%20in%20a%20Binary%20Matrix%20by%20at%20Most%20One%20Flip/README.md) + +#### 第 330 场周赛(2023-01-29 10:30, 90 分钟) 参赛人数 3399 + +- [2549. 统计桌面上的不同数字](/solution/2500-2599/2549.Count%20Distinct%20Numbers%20on%20Board/README.md) +- [2550. 猴子碰撞的方法数](/solution/2500-2599/2550.Count%20Collisions%20of%20Monkeys%20on%20a%20Polygon/README.md) +- [2551. 将珠子放入背包中](/solution/2500-2599/2551.Put%20Marbles%20in%20Bags/README.md) +- [2552. 统计上升四元组](/solution/2500-2599/2552.Count%20Increasing%20Quadruplets/README.md) + +#### 第 329 场周赛(2023-01-22 10:30, 90 分钟) 参赛人数 2591 + +- [2544. 交替数字和](/solution/2500-2599/2544.Alternating%20Digit%20Sum/README.md) +- [2545. 根据第 K 场考试的分数排序](/solution/2500-2599/2545.Sort%20the%20Students%20by%20Their%20Kth%20Score/README.md) +- [2546. 执行逐位运算使字符串相等](/solution/2500-2599/2546.Apply%20Bitwise%20Operations%20to%20Make%20Strings%20Equal/README.md) +- [2547. 拆分数组的最小代价](/solution/2500-2599/2547.Minimum%20Cost%20to%20Split%20an%20Array/README.md) + +#### 第 96 场双周赛(2023-01-21 22:30, 90 分钟) 参赛人数 2103 + +- [2540. 最小公共值](/solution/2500-2599/2540.Minimum%20Common%20Value/README.md) +- [2541. 使数组中所有元素相等的最小操作数 II](/solution/2500-2599/2541.Minimum%20Operations%20to%20Make%20Array%20Equal%20II/README.md) +- [2542. 最大子序列的分数](/solution/2500-2599/2542.Maximum%20Subsequence%20Score/README.md) +- [2543. 判断一个点是否可以到达](/solution/2500-2599/2543.Check%20if%20Point%20Is%20Reachable/README.md) + +#### 第 328 场周赛(2023-01-15 10:30, 90 分钟) 参赛人数 4776 + +- [2535. 数组元素和与数字和的绝对差](/solution/2500-2599/2535.Difference%20Between%20Element%20Sum%20and%20Digit%20Sum%20of%20an%20Array/README.md) +- [2536. 子矩阵元素加 1](/solution/2500-2599/2536.Increment%20Submatrices%20by%20One/README.md) +- [2537. 统计好子数组的数目](/solution/2500-2599/2537.Count%20the%20Number%20of%20Good%20Subarrays/README.md) +- [2538. 最大价值和与最小价值和的差值](/solution/2500-2599/2538.Difference%20Between%20Maximum%20and%20Minimum%20Price%20Sum/README.md) + +#### 第 327 场周赛(2023-01-08 10:30, 90 分钟) 参赛人数 4518 + +- [2529. 正整数和负整数的最大计数](/solution/2500-2599/2529.Maximum%20Count%20of%20Positive%20Integer%20and%20Negative%20Integer/README.md) +- [2530. 执行 K 次操作后的最大分数](/solution/2500-2599/2530.Maximal%20Score%20After%20Applying%20K%20Operations/README.md) +- [2531. 使字符串中不同字符的数目相等](/solution/2500-2599/2531.Make%20Number%20of%20Distinct%20Characters%20Equal/README.md) +- [2532. 过桥的时间](/solution/2500-2599/2532.Time%20to%20Cross%20a%20Bridge/README.md) + +#### 第 95 场双周赛(2023-01-07 22:30, 90 分钟) 参赛人数 2880 + +- [2525. 根据规则将箱子分类](/solution/2500-2599/2525.Categorize%20Box%20According%20to%20Criteria/README.md) +- [2526. 找到数据流中的连续整数](/solution/2500-2599/2526.Find%20Consecutive%20Integers%20from%20a%20Data%20Stream/README.md) +- [2527. 查询数组异或美丽值](/solution/2500-2599/2527.Find%20Xor-Beauty%20of%20Array/README.md) +- [2528. 最大化城市的最小电量](/solution/2500-2599/2528.Maximize%20the%20Minimum%20Powered%20City/README.md) + +#### 第 326 场周赛(2023-01-01 10:30, 90 分钟) 参赛人数 3873 + +- [2520. 统计能整除数字的位数](/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README.md) +- [2521. 数组乘积中的不同质因数数目](/solution/2500-2599/2521.Distinct%20Prime%20Factors%20of%20Product%20of%20Array/README.md) +- [2522. 将字符串分割成值不超过 K 的子字符串](/solution/2500-2599/2522.Partition%20String%20Into%20Substrings%20With%20Values%20at%20Most%20K/README.md) +- [2523. 范围内最接近的两个质数](/solution/2500-2599/2523.Closest%20Prime%20Numbers%20in%20Range/README.md) + +#### 第 325 场周赛(2022-12-25 10:30, 90 分钟) 参赛人数 3530 + +- [2515. 到目标字符串的最短距离](/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README.md) +- [2516. 每种字符至少取 K 个](/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README.md) +- [2517. 礼盒的最大甜蜜度](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README.md) +- [2518. 好分区的数目](/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README.md) + +#### 第 94 场双周赛(2022-12-24 22:30, 90 分钟) 参赛人数 2298 + +- [2511. 最多可以摧毁的敌人城堡数目](/solution/2500-2599/2511.Maximum%20Enemy%20Forts%20That%20Can%20Be%20Captured/README.md) +- [2512. 奖励最顶尖的 K 名学生](/solution/2500-2599/2512.Reward%20Top%20K%20Students/README.md) +- [2513. 最小化两个数组中的最大值](/solution/2500-2599/2513.Minimize%20the%20Maximum%20of%20Two%20Arrays/README.md) +- [2514. 统计同位异构字符串数目](/solution/2500-2599/2514.Count%20Anagrams/README.md) + +#### 第 324 场周赛(2022-12-18 10:30, 90 分钟) 参赛人数 4167 + +- [2506. 统计相似字符串对的数目](/solution/2500-2599/2506.Count%20Pairs%20Of%20Similar%20Strings/README.md) +- [2507. 使用质因数之和替换后可以取到的最小值](/solution/2500-2599/2507.Smallest%20Value%20After%20Replacing%20With%20Sum%20of%20Prime%20Factors/README.md) +- [2508. 添加边使所有节点度数都为偶数](/solution/2500-2599/2508.Add%20Edges%20to%20Make%20Degrees%20of%20All%20Nodes%20Even/README.md) +- [2509. 查询树中环的长度](/solution/2500-2599/2509.Cycle%20Length%20Queries%20in%20a%20Tree/README.md) + +#### 第 323 场周赛(2022-12-11 10:30, 90 分钟) 参赛人数 4671 + +- [2500. 删除每行中的最大值](/solution/2500-2599/2500.Delete%20Greatest%20Value%20in%20Each%20Row/README.md) +- [2501. 数组中最长的方波](/solution/2500-2599/2501.Longest%20Square%20Streak%20in%20an%20Array/README.md) +- [2502. 设计内存分配器](/solution/2500-2599/2502.Design%20Memory%20Allocator/README.md) +- [2503. 矩阵查询可获得的最大分数](/solution/2500-2599/2503.Maximum%20Number%20of%20Points%20From%20Grid%20Queries/README.md) + +#### 第 93 场双周赛(2022-12-10 22:30, 90 分钟) 参赛人数 2929 + +- [2496. 数组中字符串的最大值](/solution/2400-2499/2496.Maximum%20Value%20of%20a%20String%20in%20an%20Array/README.md) +- [2497. 图中最大星和](/solution/2400-2499/2497.Maximum%20Star%20Sum%20of%20a%20Graph/README.md) +- [2498. 青蛙过河 II](/solution/2400-2499/2498.Frog%20Jump%20II/README.md) +- [2499. 让数组不相等的最小总代价](/solution/2400-2499/2499.Minimum%20Total%20Cost%20to%20Make%20Arrays%20Unequal/README.md) + +#### 第 322 场周赛(2022-12-04 10:30, 90 分钟) 参赛人数 5085 + +- [2490. 回环句](/solution/2400-2499/2490.Circular%20Sentence/README.md) +- [2491. 划分技能点相等的团队](/solution/2400-2499/2491.Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/README.md) +- [2492. 两个城市间路径的最小分数](/solution/2400-2499/2492.Minimum%20Score%20of%20a%20Path%20Between%20Two%20Cities/README.md) +- [2493. 将节点分成尽可能多的组](/solution/2400-2499/2493.Divide%20Nodes%20Into%20the%20Maximum%20Number%20of%20Groups/README.md) + +#### 第 321 场周赛(2022-11-27 10:30, 90 分钟) 参赛人数 5115 + +- [2485. 找出中枢整数](/solution/2400-2499/2485.Find%20the%20Pivot%20Integer/README.md) +- [2486. 追加字符以获得子序列](/solution/2400-2499/2486.Append%20Characters%20to%20String%20to%20Make%20Subsequence/README.md) +- [2487. 从链表中移除节点](/solution/2400-2499/2487.Remove%20Nodes%20From%20Linked%20List/README.md) +- [2488. 统计中位数为 K 的子数组](/solution/2400-2499/2488.Count%20Subarrays%20With%20Median%20K/README.md) + +#### 第 92 场双周赛(2022-11-26 22:30, 90 分钟) 参赛人数 3055 + +- [2481. 分割圆的最少切割次数](/solution/2400-2499/2481.Minimum%20Cuts%20to%20Divide%20a%20Circle/README.md) +- [2482. 行和列中一和零的差值](/solution/2400-2499/2482.Difference%20Between%20Ones%20and%20Zeros%20in%20Row%20and%20Column/README.md) +- [2483. 商店的最少代价](/solution/2400-2499/2483.Minimum%20Penalty%20for%20a%20Shop/README.md) +- [2484. 统计回文子序列数目](/solution/2400-2499/2484.Count%20Palindromic%20Subsequences/README.md) + +#### 第 320 场周赛(2022-11-20 10:30, 90 分钟) 参赛人数 5678 + +- [2475. 数组中不等三元组的数目](/solution/2400-2499/2475.Number%20of%20Unequal%20Triplets%20in%20Array/README.md) +- [2476. 二叉搜索树最近节点查询](/solution/2400-2499/2476.Closest%20Nodes%20Queries%20in%20a%20Binary%20Search%20Tree/README.md) +- [2477. 到达首都的最少油耗](/solution/2400-2499/2477.Minimum%20Fuel%20Cost%20to%20Report%20to%20the%20Capital/README.md) +- [2478. 完美分割的方案数](/solution/2400-2499/2478.Number%20of%20Beautiful%20Partitions/README.md) + +#### 第 319 场周赛(2022-11-13 10:30, 90 分钟) 参赛人数 6175 + +- [2469. 温度转换](/solution/2400-2499/2469.Convert%20the%20Temperature/README.md) +- [2470. 最小公倍数为 K 的子数组数目](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README.md) +- [2471. 逐层排序二叉树所需的最少操作数目](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README.md) +- [2472. 不重叠回文子字符串的最大数目](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README.md) + +#### 第 91 场双周赛(2022-11-12 22:30, 90 分钟) 参赛人数 3535 + +- [2465. 不同的平均值数目](/solution/2400-2499/2465.Number%20of%20Distinct%20Averages/README.md) +- [2466. 统计构造好字符串的方案数](/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README.md) +- [2467. 树上最大得分和路径](/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README.md) +- [2468. 根据限制分割消息](/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README.md) + +#### 第 318 场周赛(2022-11-06 10:30, 90 分钟) 参赛人数 5670 + +- [2460. 对数组执行操作](/solution/2400-2499/2460.Apply%20Operations%20to%20an%20Array/README.md) +- [2461. 长度为 K 子数组中的最大和](/solution/2400-2499/2461.Maximum%20Sum%20of%20Distinct%20Subarrays%20With%20Length%20K/README.md) +- [2462. 雇佣 K 位工人的总代价](/solution/2400-2499/2462.Total%20Cost%20to%20Hire%20K%20Workers/README.md) +- [2463. 最小移动总距离](/solution/2400-2499/2463.Minimum%20Total%20Distance%20Traveled/README.md) + +#### 第 317 场周赛(2022-10-30 10:30, 90 分钟) 参赛人数 5660 + +- [2455. 可被三整除的偶数的平均值](/solution/2400-2499/2455.Average%20Value%20of%20Even%20Numbers%20That%20Are%20Divisible%20by%20Three/README.md) +- [2456. 最流行的视频创作者](/solution/2400-2499/2456.Most%20Popular%20Video%20Creator/README.md) +- [2457. 美丽整数的最小增量](/solution/2400-2499/2457.Minimum%20Addition%20to%20Make%20Integer%20Beautiful/README.md) +- [2458. 移除子树后的二叉树高度](/solution/2400-2499/2458.Height%20of%20Binary%20Tree%20After%20Subtree%20Removal%20Queries/README.md) + +#### 第 90 场双周赛(2022-10-29 22:30, 90 分钟) 参赛人数 3624 + +- [2451. 差值数组不同的字符串](/solution/2400-2499/2451.Odd%20String%20Difference/README.md) +- [2452. 距离字典两次编辑以内的单词](/solution/2400-2499/2452.Words%20Within%20Two%20Edits%20of%20Dictionary/README.md) +- [2453. 摧毁一系列目标](/solution/2400-2499/2453.Destroy%20Sequential%20Targets/README.md) +- [2454. 下一个更大元素 IV](/solution/2400-2499/2454.Next%20Greater%20Element%20IV/README.md) + +#### 第 316 场周赛(2022-10-23 10:30, 90 分钟) 参赛人数 6387 + +- [2446. 判断两个事件是否存在冲突](/solution/2400-2499/2446.Determine%20if%20Two%20Events%20Have%20Conflict/README.md) +- [2447. 最大公因数等于 K 的子数组数目](/solution/2400-2499/2447.Number%20of%20Subarrays%20With%20GCD%20Equal%20to%20K/README.md) +- [2448. 使数组相等的最小开销](/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README.md) +- [2449. 使数组相似的最少操作次数](/solution/2400-2499/2449.Minimum%20Number%20of%20Operations%20to%20Make%20Arrays%20Similar/README.md) + +#### 第 315 场周赛(2022-10-16 10:30, 90 分钟) 参赛人数 6490 + +- [2441. 与对应负数同时存在的最大正整数](/solution/2400-2499/2441.Largest%20Positive%20Integer%20That%20Exists%20With%20Its%20Negative/README.md) +- [2442. 反转之后不同整数的数目](/solution/2400-2499/2442.Count%20Number%20of%20Distinct%20Integers%20After%20Reverse%20Operations/README.md) +- [2443. 反转之后的数字和](/solution/2400-2499/2443.Sum%20of%20Number%20and%20Its%20Reverse/README.md) +- [2444. 统计定界子数组的数目](/solution/2400-2499/2444.Count%20Subarrays%20With%20Fixed%20Bounds/README.md) + +#### 第 89 场双周赛(2022-10-15 22:30, 90 分钟) 参赛人数 3984 + +- [2437. 有效时间的数目](/solution/2400-2499/2437.Number%20of%20Valid%20Clock%20Times/README.md) +- [2438. 二的幂数组中查询范围内的乘积](/solution/2400-2499/2438.Range%20Product%20Queries%20of%20Powers/README.md) +- [2439. 最小化数组中的最大值](/solution/2400-2499/2439.Minimize%20Maximum%20of%20Array/README.md) +- [2440. 创建价值相同的连通块](/solution/2400-2499/2440.Create%20Components%20With%20Same%20Value/README.md) + +#### 第 314 场周赛(2022-10-09 10:30, 90 分钟) 参赛人数 4838 + +- [2432. 处理用时最长的那个任务的员工](/solution/2400-2499/2432.The%20Employee%20That%20Worked%20on%20the%20Longest%20Task/README.md) +- [2433. 找出前缀异或的原始数组](/solution/2400-2499/2433.Find%20The%20Original%20Array%20of%20Prefix%20Xor/README.md) +- [2434. 使用机器人打印字典序最小的字符串](/solution/2400-2499/2434.Using%20a%20Robot%20to%20Print%20the%20Lexicographically%20Smallest%20String/README.md) +- [2435. 矩阵中和能被 K 整除的路径](/solution/2400-2499/2435.Paths%20in%20Matrix%20Whose%20Sum%20Is%20Divisible%20by%20K/README.md) + +#### 第 313 场周赛(2022-10-02 10:30, 90 分钟) 参赛人数 5445 + +- [2427. 公因子的数目](/solution/2400-2499/2427.Number%20of%20Common%20Factors/README.md) +- [2428. 沙漏的最大总和](/solution/2400-2499/2428.Maximum%20Sum%20of%20an%20Hourglass/README.md) +- [2429. 最小异或](/solution/2400-2499/2429.Minimize%20XOR/README.md) +- [2430. 对字母串可执行的最大删除数](/solution/2400-2499/2430.Maximum%20Deletions%20on%20a%20String/README.md) + +#### 第 88 场双周赛(2022-10-01 22:30, 90 分钟) 参赛人数 3905 + +- [2423. 删除字符使频率相同](/solution/2400-2499/2423.Remove%20Letter%20To%20Equalize%20Frequency/README.md) +- [2424. 最长上传前缀](/solution/2400-2499/2424.Longest%20Uploaded%20Prefix/README.md) +- [2425. 所有数对的异或和](/solution/2400-2499/2425.Bitwise%20XOR%20of%20All%20Pairings/README.md) +- [2426. 满足不等式的数对数目](/solution/2400-2499/2426.Number%20of%20Pairs%20Satisfying%20Inequality/README.md) + +#### 第 312 场周赛(2022-09-25 10:30, 90 分钟) 参赛人数 6638 + +- [2418. 按身高排序](/solution/2400-2499/2418.Sort%20the%20People/README.md) +- [2419. 按位与最大的最长子数组](/solution/2400-2499/2419.Longest%20Subarray%20With%20Maximum%20Bitwise%20AND/README.md) +- [2420. 找到所有好下标](/solution/2400-2499/2420.Find%20All%20Good%20Indices/README.md) +- [2421. 好路径的数目](/solution/2400-2499/2421.Number%20of%20Good%20Paths/README.md) + +#### 第 311 场周赛(2022-09-18 10:30, 90 分钟) 参赛人数 6710 + +- [2413. 最小偶倍数](/solution/2400-2499/2413.Smallest%20Even%20Multiple/README.md) +- [2414. 最长的字母序连续子字符串的长度](/solution/2400-2499/2414.Length%20of%20the%20Longest%20Alphabetical%20Continuous%20Substring/README.md) +- [2415. 反转二叉树的奇数层](/solution/2400-2499/2415.Reverse%20Odd%20Levels%20of%20Binary%20Tree/README.md) +- [2416. 字符串的前缀分数和](/solution/2400-2499/2416.Sum%20of%20Prefix%20Scores%20of%20Strings/README.md) + +#### 第 87 场双周赛(2022-09-17 22:30, 90 分钟) 参赛人数 4005 + +- [2409. 统计共同度过的日子数](/solution/2400-2499/2409.Count%20Days%20Spent%20Together/README.md) +- [2410. 运动员和训练师的最大匹配数](/solution/2400-2499/2410.Maximum%20Matching%20of%20Players%20With%20Trainers/README.md) +- [2411. 按位或最大的最小子数组长度](/solution/2400-2499/2411.Smallest%20Subarrays%20With%20Maximum%20Bitwise%20OR/README.md) +- [2412. 完成所有交易的初始最少钱数](/solution/2400-2499/2412.Minimum%20Money%20Required%20Before%20Transactions/README.md) + +#### 第 310 场周赛(2022-09-11 10:30, 90 分钟) 参赛人数 6081 + +- [2404. 出现最频繁的偶数元素](/solution/2400-2499/2404.Most%20Frequent%20Even%20Element/README.md) +- [2405. 子字符串的最优划分](/solution/2400-2499/2405.Optimal%20Partition%20of%20String/README.md) +- [2406. 将区间分为最少组数](/solution/2400-2499/2406.Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/README.md) +- [2407. 最长递增子序列 II](/solution/2400-2499/2407.Longest%20Increasing%20Subsequence%20II/README.md) + +#### 第 309 场周赛(2022-09-04 10:30, 90 分钟) 参赛人数 7972 + +- [2399. 检查相同字母间的距离](/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README.md) +- [2400. 恰好移动 k 步到达某一位置的方法数目](/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README.md) +- [2401. 最长优雅子数组](/solution/2400-2499/2401.Longest%20Nice%20Subarray/README.md) +- [2402. 会议室 III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README.md) + +#### 第 86 场双周赛(2022-09-03 22:30, 90 分钟) 参赛人数 4401 + +- [2395. 和相等的子数组](/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README.md) +- [2396. 严格回文的数字](/solution/2300-2399/2396.Strictly%20Palindromic%20Number/README.md) +- [2397. 被列覆盖的最多行数](/solution/2300-2399/2397.Maximum%20Rows%20Covered%20by%20Columns/README.md) +- [2398. 预算内的最多机器人数目](/solution/2300-2399/2398.Maximum%20Number%20of%20Robots%20Within%20Budget/README.md) + +#### 第 308 场周赛(2022-08-28 10:30, 90 分钟) 参赛人数 6394 + +- [2389. 和有限的最长子序列](/solution/2300-2399/2389.Longest%20Subsequence%20With%20Limited%20Sum/README.md) +- [2390. 从字符串中移除星号](/solution/2300-2399/2390.Removing%20Stars%20From%20a%20String/README.md) +- [2391. 收集垃圾的最少总时间](/solution/2300-2399/2391.Minimum%20Amount%20of%20Time%20to%20Collect%20Garbage/README.md) +- [2392. 给定条件下构造矩阵](/solution/2300-2399/2392.Build%20a%20Matrix%20With%20Conditions/README.md) + +#### 第 307 场周赛(2022-08-21 10:30, 90 分钟) 参赛人数 7064 + +- [2383. 赢得比赛需要的最少训练时长](/solution/2300-2399/2383.Minimum%20Hours%20of%20Training%20to%20Win%20a%20Competition/README.md) +- [2384. 最大回文数字](/solution/2300-2399/2384.Largest%20Palindromic%20Number/README.md) +- [2385. 感染二叉树需要的总时间](/solution/2300-2399/2385.Amount%20of%20Time%20for%20Binary%20Tree%20to%20Be%20Infected/README.md) +- [2386. 找出数组的第 K 大和](/solution/2300-2399/2386.Find%20the%20K-Sum%20of%20an%20Array/README.md) + +#### 第 85 场双周赛(2022-08-20 22:30, 90 分钟) 参赛人数 4193 + +- [2379. 得到 K 个黑块的最少涂色次数](/solution/2300-2399/2379.Minimum%20Recolors%20to%20Get%20K%20Consecutive%20Black%20Blocks/README.md) +- [2380. 二进制字符串重新安排顺序需要的时间](/solution/2300-2399/2380.Time%20Needed%20to%20Rearrange%20a%20Binary%20String/README.md) +- [2381. 字母移位 II](/solution/2300-2399/2381.Shifting%20Letters%20II/README.md) +- [2382. 删除操作后的最大子段和](/solution/2300-2399/2382.Maximum%20Segment%20Sum%20After%20Removals/README.md) + +#### 第 306 场周赛(2022-08-14 10:30, 90 分钟) 参赛人数 7500 + +- [2373. 矩阵中的局部最大值](/solution/2300-2399/2373.Largest%20Local%20Values%20in%20a%20Matrix/README.md) +- [2374. 边积分最高的节点](/solution/2300-2399/2374.Node%20With%20Highest%20Edge%20Score/README.md) +- [2375. 根据模式串构造最小数字](/solution/2300-2399/2375.Construct%20Smallest%20Number%20From%20DI%20String/README.md) +- [2376. 统计特殊整数](/solution/2300-2399/2376.Count%20Special%20Integers/README.md) + +#### 第 305 场周赛(2022-08-07 10:30, 90 分钟) 参赛人数 7465 + +- [2367. 算术三元组的数目](/solution/2300-2399/2367.Number%20of%20Arithmetic%20Triplets/README.md) +- [2368. 受限条件下可到达节点的数目](/solution/2300-2399/2368.Reachable%20Nodes%20With%20Restrictions/README.md) +- [2369. 检查数组是否存在有效划分](/solution/2300-2399/2369.Check%20if%20There%20is%20a%20Valid%20Partition%20For%20The%20Array/README.md) +- [2370. 最长理想子序列](/solution/2300-2399/2370.Longest%20Ideal%20Subsequence/README.md) + +#### 第 84 场双周赛(2022-08-06 22:30, 90 分钟) 参赛人数 4574 + +- [2363. 合并相似的物品](/solution/2300-2399/2363.Merge%20Similar%20Items/README.md) +- [2364. 统计坏数对的数目](/solution/2300-2399/2364.Count%20Number%20of%20Bad%20Pairs/README.md) +- [2365. 任务调度器 II](/solution/2300-2399/2365.Task%20Scheduler%20II/README.md) +- [2366. 将数组排序的最少替换次数](/solution/2300-2399/2366.Minimum%20Replacements%20to%20Sort%20the%20Array/README.md) + +#### 第 304 场周赛(2022-07-31 10:30, 90 分钟) 参赛人数 7372 + +- [2357. 使数组中所有元素都等于零](/solution/2300-2399/2357.Make%20Array%20Zero%20by%20Subtracting%20Equal%20Amounts/README.md) +- [2358. 分组的最大数量](/solution/2300-2399/2358.Maximum%20Number%20of%20Groups%20Entering%20a%20Competition/README.md) +- [2359. 找到离给定两个节点最近的节点](/solution/2300-2399/2359.Find%20Closest%20Node%20to%20Given%20Two%20Nodes/README.md) +- [2360. 图中的最长环](/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README.md) + +#### 第 303 场周赛(2022-07-24 10:30, 90 分钟) 参赛人数 7032 + +- [2351. 第一个出现两次的字母](/solution/2300-2399/2351.First%20Letter%20to%20Appear%20Twice/README.md) +- [2352. 相等行列对](/solution/2300-2399/2352.Equal%20Row%20and%20Column%20Pairs/README.md) +- [2353. 设计食物评分系统](/solution/2300-2399/2353.Design%20a%20Food%20Rating%20System/README.md) +- [2354. 优质数对的数目](/solution/2300-2399/2354.Number%20of%20Excellent%20Pairs/README.md) + +#### 第 83 场双周赛(2022-07-23 22:30, 90 分钟) 参赛人数 4437 + +- [2347. 最好的扑克手牌](/solution/2300-2399/2347.Best%20Poker%20Hand/README.md) +- [2348. 全 0 子数组的数目](/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README.md) +- [2349. 设计数字容器系统](/solution/2300-2399/2349.Design%20a%20Number%20Container%20System/README.md) +- [2350. 不可能得到的最短骰子序列](/solution/2300-2399/2350.Shortest%20Impossible%20Sequence%20of%20Rolls/README.md) + +#### 第 302 场周赛(2022-07-17 10:30, 90 分钟) 参赛人数 7092 + +- [2341. 数组能形成多少数对](/solution/2300-2399/2341.Maximum%20Number%20of%20Pairs%20in%20Array/README.md) +- [2342. 数位和相等数对的最大和](/solution/2300-2399/2342.Max%20Sum%20of%20a%20Pair%20With%20Equal%20Sum%20of%20Digits/README.md) +- [2343. 裁剪数字后查询第 K 小的数字](/solution/2300-2399/2343.Query%20Kth%20Smallest%20Trimmed%20Number/README.md) +- [2344. 使数组可以被整除的最少删除次数](/solution/2300-2399/2344.Minimum%20Deletions%20to%20Make%20Array%20Divisible/README.md) + +#### 第 301 场周赛(2022-07-10 10:30, 90 分钟) 参赛人数 7133 + +- [2335. 装满杯子需要的最短总时长](/solution/2300-2399/2335.Minimum%20Amount%20of%20Time%20to%20Fill%20Cups/README.md) +- [2336. 无限集中的最小数字](/solution/2300-2399/2336.Smallest%20Number%20in%20Infinite%20Set/README.md) +- [2337. 移动片段得到字符串](/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README.md) +- [2338. 统计理想数组的数目](/solution/2300-2399/2338.Count%20the%20Number%20of%20Ideal%20Arrays/README.md) + +#### 第 82 场双周赛(2022-07-09 22:30, 90 分钟) 参赛人数 4144 + +- [2331. 计算布尔二叉树的值](/solution/2300-2399/2331.Evaluate%20Boolean%20Binary%20Tree/README.md) +- [2332. 坐上公交的最晚时间](/solution/2300-2399/2332.The%20Latest%20Time%20to%20Catch%20a%20Bus/README.md) +- [2333. 最小差值平方和](/solution/2300-2399/2333.Minimum%20Sum%20of%20Squared%20Difference/README.md) +- [2334. 元素值大于变化阈值的子数组](/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README.md) + +#### 第 300 场周赛(2022-07-03 10:30, 90 分钟) 参赛人数 6792 + +- [2325. 解密消息](/solution/2300-2399/2325.Decode%20the%20Message/README.md) +- [2326. 螺旋矩阵 IV](/solution/2300-2399/2326.Spiral%20Matrix%20IV/README.md) +- [2327. 知道秘密的人数](/solution/2300-2399/2327.Number%20of%20People%20Aware%20of%20a%20Secret/README.md) +- [2328. 网格图中递增路径的数目](/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README.md) + +#### 第 299 场周赛(2022-06-26 10:30, 90 分钟) 参赛人数 6108 + +- [2319. 判断矩阵是否是一个 X 矩阵](/solution/2300-2399/2319.Check%20if%20Matrix%20Is%20X-Matrix/README.md) +- [2320. 统计放置房子的方式数](/solution/2300-2399/2320.Count%20Number%20of%20Ways%20to%20Place%20Houses/README.md) +- [2321. 拼接数组的最大分数](/solution/2300-2399/2321.Maximum%20Score%20Of%20Spliced%20Array/README.md) +- [2322. 从树中删除边的最小分数](/solution/2300-2399/2322.Minimum%20Score%20After%20Removals%20on%20a%20Tree/README.md) + +#### 第 81 场双周赛(2022-06-25 22:30, 90 分钟) 参赛人数 3847 + +- [2315. 统计星号](/solution/2300-2399/2315.Count%20Asterisks/README.md) +- [2316. 统计无向图中无法互相到达点对数](/solution/2300-2399/2316.Count%20Unreachable%20Pairs%20of%20Nodes%20in%20an%20Undirected%20Graph/README.md) +- [2317. 操作后的最大异或和](/solution/2300-2399/2317.Maximum%20XOR%20After%20Operations/README.md) +- [2318. 不同骰子序列的数目](/solution/2300-2399/2318.Number%20of%20Distinct%20Roll%20Sequences/README.md) + +#### 第 298 场周赛(2022-06-19 10:30, 90 分钟) 参赛人数 6228 + +- [2309. 兼具大小写的最好英文字母](/solution/2300-2399/2309.Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case/README.md) +- [2310. 个位数字为 K 的整数之和](/solution/2300-2399/2310.Sum%20of%20Numbers%20With%20Units%20Digit%20K/README.md) +- [2311. 小于等于 K 的最长二进制子序列](/solution/2300-2399/2311.Longest%20Binary%20Subsequence%20Less%20Than%20or%20Equal%20to%20K/README.md) +- [2312. 卖木头块](/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README.md) + +#### 第 297 场周赛(2022-06-12 10:30, 90 分钟) 参赛人数 5915 + +- [2303. 计算应缴税款总额](/solution/2300-2399/2303.Calculate%20Amount%20Paid%20in%20Taxes/README.md) +- [2304. 网格中的最小路径代价](/solution/2300-2399/2304.Minimum%20Path%20Cost%20in%20a%20Grid/README.md) +- [2305. 公平分发饼干](/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README.md) +- [2306. 公司命名](/solution/2300-2399/2306.Naming%20a%20Company/README.md) + +#### 第 80 场双周赛(2022-06-11 22:30, 90 分钟) 参赛人数 3949 + +- [2299. 强密码检验器 II](/solution/2200-2299/2299.Strong%20Password%20Checker%20II/README.md) +- [2300. 咒语和药水的成功对数](/solution/2300-2399/2300.Successful%20Pairs%20of%20Spells%20and%20Potions/README.md) +- [2301. 替换字符后匹配](/solution/2300-2399/2301.Match%20Substring%20After%20Replacement/README.md) +- [2302. 统计得分小于 K 的子数组数目](/solution/2300-2399/2302.Count%20Subarrays%20With%20Score%20Less%20Than%20K/README.md) + +#### 第 296 场周赛(2022-06-05 10:30, 90 分钟) 参赛人数 5721 + +- [2293. 极大极小游戏](/solution/2200-2299/2293.Min%20Max%20Game/README.md) +- [2294. 划分数组使最大差为 K](/solution/2200-2299/2294.Partition%20Array%20Such%20That%20Maximum%20Difference%20Is%20K/README.md) +- [2295. 替换数组中的元素](/solution/2200-2299/2295.Replace%20Elements%20in%20an%20Array/README.md) +- [2296. 设计一个文本编辑器](/solution/2200-2299/2296.Design%20a%20Text%20Editor/README.md) + +#### 第 295 场周赛(2022-05-29 10:30, 90 分钟) 参赛人数 6447 + +- [2287. 重排字符形成目标字符串](/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README.md) +- [2288. 价格减免](/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README.md) +- [2289. 使数组按非递减顺序排列](/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README.md) +- [2290. 到达角落需要移除障碍物的最小数目](/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README.md) + +#### 第 79 场双周赛(2022-05-28 22:30, 90 分钟) 参赛人数 4250 + +- [2283. 判断一个数的数字计数是否等于数位的值](/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README.md) +- [2284. 最多单词数的发件人](/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README.md) +- [2285. 道路的最大总重要性](/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README.md) +- [2286. 以组为单位订音乐会的门票](/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README.md) + +#### 第 294 场周赛(2022-05-22 10:30, 90 分钟) 参赛人数 6640 + +- [2278. 字母在字符串中的百分比](/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README.md) +- [2279. 装满石头的背包的最大数量](/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README.md) +- [2280. 表示一个折线图的最少线段数](/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README.md) +- [2281. 巫师的总力量和](/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README.md) + +#### 第 293 场周赛(2022-05-15 10:30, 90 分钟) 参赛人数 7357 + +- [2273. 移除字母异位词后的结果数组](/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README.md) +- [2274. 不含特殊楼层的最大连续楼层数](/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README.md) +- [2275. 按位与结果大于零的最长组合](/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README.md) +- [2276. 统计区间中的整数数目](/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README.md) + +#### 第 78 场双周赛(2022-05-14 22:30, 90 分钟) 参赛人数 4347 + +- [2269. 找到一个数字的 K 美丽值](/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README.md) +- [2270. 分割数组的方案数](/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README.md) +- [2271. 毯子覆盖的最多白色砖块数](/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README.md) +- [2272. 最大波动的子字符串](/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README.md) + +#### 第 292 场周赛(2022-05-08 10:30, 90 分钟) 参赛人数 6884 + +- [2264. 字符串中最大的 3 位相同数字](/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README.md) +- [2265. 统计值等于子树平均值的节点数](/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README.md) +- [2266. 统计打字方案数](/solution/2200-2299/2266.Count%20Number%20of%20Texts/README.md) +- [2267. 检查是否有合法括号字符串路径](/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README.md) + +#### 第 291 场周赛(2022-05-01 10:30, 90 分钟) 参赛人数 6574 + +- [2259. 移除指定数字得到的最大结果](/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README.md) +- [2260. 必须拿起的最小连续卡牌数](/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README.md) +- [2261. 含最多 K 个可整除元素的子数组](/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README.md) +- [2262. 字符串的总引力](/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README.md) + +#### 第 77 场双周赛(2022-04-30 22:30, 90 分钟) 参赛人数 4211 + +- [2255. 统计是给定字符串前缀的字符串数目](/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README.md) +- [2256. 最小平均差](/solution/2200-2299/2256.Minimum%20Average%20Difference/README.md) +- [2257. 统计网格图中没有被保卫的格子数](/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README.md) +- [2258. 逃离火灾](/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README.md) + +#### 第 290 场周赛(2022-04-24 10:30, 90 分钟) 参赛人数 6275 + +- [2248. 多个数组求交集](/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README.md) +- [2249. 统计圆内格点数目](/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README.md) +- [2250. 统计包含每个点的矩形数目](/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README.md) +- [2251. 花期内花的数目](/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README.md) + +#### 第 289 场周赛(2022-04-17 10:30, 90 分钟) 参赛人数 7293 + +- [2243. 计算字符串的数字和](/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README.md) +- [2244. 完成所有任务需要的最少轮数](/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README.md) +- [2245. 转角路径的乘积中最多能有几个尾随零](/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README.md) +- [2246. 相邻字符不同的最长路径](/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README.md) + +#### 第 76 场双周赛(2022-04-16 22:30, 90 分钟) 参赛人数 4477 + +- [2239. 找到最接近 0 的数字](/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README.md) +- [2240. 买钢笔和铅笔的方案数](/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README.md) +- [2241. 设计一个 ATM 机器](/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README.md) +- [2242. 节点序列的最大得分](/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README.md) + +#### 第 288 场周赛(2022-04-10 10:30, 90 分钟) 参赛人数 6926 + +- [2231. 按奇偶性交换后的最大数字](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md) +- [2232. 向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md) +- [2233. K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md) +- [2234. 花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md) + +#### 第 287 场周赛(2022-04-03 10:30, 90 分钟) 参赛人数 6811 + +- [2224. 转化时间需要的最少操作数](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README.md) +- [2225. 找出输掉零场或一场比赛的玩家](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README.md) +- [2226. 每个小孩最多能分到多少糖果](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README.md) +- [2227. 加密解密字符串](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README.md) + +#### 第 75 场双周赛(2022-04-02 22:30, 90 分钟) 参赛人数 4335 + +- [2220. 转换数字的最少位翻转次数](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README.md) +- [2221. 数组的三角和](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README.md) +- [2222. 选择建筑的方案数](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README.md) +- [2223. 构造字符串的总得分和](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README.md) + +#### 第 286 场周赛(2022-03-27 10:30, 90 分钟) 参赛人数 7248 + +- [2215. 找出两数组的不同](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README.md) +- [2216. 美化数组的最少删除数](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README.md) +- [2217. 找到指定长度的回文数](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README.md) +- [2218. 从栈中取出 K 个硬币的最大面值和](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README.md) + +#### 第 285 场周赛(2022-03-20 10:30, 90 分钟) 参赛人数 7501 + +- [2210. 统计数组中峰和谷的数量](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README.md) +- [2211. 统计道路上的碰撞次数](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README.md) +- [2212. 射箭比赛中的最大得分](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README.md) +- [2213. 由单个字符重复的最长子字符串](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README.md) + +#### 第 74 场双周赛(2022-03-19 22:30, 90 分钟) 参赛人数 5442 + +- [2206. 将数组划分成相等数对](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README.md) +- [2207. 字符串中最多数目的子序列](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README.md) +- [2208. 将数组和减半的最少操作次数](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README.md) +- [2209. 用地毯覆盖后的最少白色砖块](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README.md) + +#### 第 284 场周赛(2022-03-13 10:30, 90 分钟) 参赛人数 8483 + +- [2200. 找出数组中的所有 K 近邻下标](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README.md) +- [2201. 统计可以提取的工件](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README.md) +- [2202. K 次操作后最大化顶端元素](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README.md) +- [2203. 得到要求路径的最小带权子图](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md) + +#### 第 283 场周赛(2022-03-06 10:30, 90 分钟) 参赛人数 7817 + +- [2194. Excel 表中某个范围内的单元格](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README.md) +- [2195. 向数组中追加 K 个整数](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README.md) +- [2196. 根据描述创建二叉树](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README.md) +- [2197. 替换数组中的非互质数](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README.md) + +#### 第 73 场双周赛(2022-03-05 22:30, 90 分钟) 参赛人数 5132 + +- [2190. 数组中紧跟 key 之后出现最频繁的数字](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README.md) +- [2191. 将杂乱无章的数字排序](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README.md) +- [2192. 有向无环图中一个节点的所有祖先](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README.md) +- [2193. 得到回文串的最少操作次数](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README.md) + +#### 第 282 场周赛(2022-02-27 10:30, 90 分钟) 参赛人数 7164 + +- [2185. 统计包含给定前缀的字符串](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README.md) +- [2186. 制造字母异位词的最小步骤数 II](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README.md) +- [2187. 完成旅途的最少时间](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README.md) +- [2188. 完成比赛的最少时间](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README.md) + +#### 第 281 场周赛(2022-02-20 10:30, 100 分钟) 参赛人数 6005 + +- [2180. 统计各位数字之和为偶数的整数个数](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README.md) +- [2181. 合并零之间的节点](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README.md) +- [2182. 构造限制重复的字符串](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README.md) +- [2183. 统计可以被 K 整除的下标对数目](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README.md) + +#### 第 72 场双周赛(2022-02-19 22:30, 90 分钟) 参赛人数 4400 + +- [2176. 统计数组中相等且可以被整除的数对](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README.md) +- [2177. 找到和为给定整数的三个连续整数](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README.md) +- [2178. 拆分成最多数目的正偶数之和](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README.md) +- [2179. 统计数组中好三元组数目](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README.md) + +#### 第 280 场周赛(2022-02-13 10:30, 90 分钟) 参赛人数 5834 + +- [2169. 得到 0 的操作数](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README.md) +- [2170. 使数组变成交替数组的最少操作数](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README.md) +- [2171. 拿出最少数目的魔法豆](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README.md) +- [2172. 数组的最大与和](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README.md) + +#### 第 279 场周赛(2022-02-06 10:30, 90 分钟) 参赛人数 4132 + +- [2164. 对奇偶下标分别排序](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README.md) +- [2165. 重排数字的最小值](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README.md) +- [2166. 设计位集](/solution/2100-2199/2166.Design%20Bitset/README.md) +- [2167. 移除所有载有违禁货物车厢所需的最少时间](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README.md) + +#### 第 71 场双周赛(2022-02-05 22:30, 90 分钟) 参赛人数 3028 + +- [2160. 拆分数位后四位数字的最小和](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README.md) +- [2161. 根据给定数字划分数组](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README.md) +- [2162. 设置时间的最少代价](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README.md) +- [2163. 删除元素后和的最小差值](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README.md) + +#### 第 278 场周赛(2022-01-30 10:30, 90 分钟) 参赛人数 4643 + +- [2154. 将找到的值乘以 2](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README.md) +- [2155. 分组得分最高的所有下标](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README.md) +- [2156. 查找给定哈希值的子串](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README.md) +- [2157. 字符串分组](/solution/2100-2199/2157.Groups%20of%20Strings/README.md) + +#### 第 277 场周赛(2022-01-23 10:30, 90 分钟) 参赛人数 5060 + +- [2148. 元素计数](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README.md) +- [2149. 按符号重排数组](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README.md) +- [2150. 找出数组中的所有孤独数字](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README.md) +- [2151. 基于陈述统计最多好人数](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README.md) + +#### 第 70 场双周赛(2022-01-22 22:30, 90 分钟) 参赛人数 3640 + +- [2144. 打折购买糖果的最小开销](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README.md) +- [2145. 统计隐藏数组数目](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README.md) +- [2146. 价格范围内最高排名的 K 样物品](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README.md) +- [2147. 分隔长廊的方案数](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README.md) + +#### 第 276 场周赛(2022-01-16 10:30, 90 分钟) 参赛人数 5244 + +- [2138. 将字符串拆分为若干长度为 k 的组](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README.md) +- [2139. 得到目标值的最少行动次数](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README.md) +- [2140. 解决智力问题](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README.md) +- [2141. 同时运行 N 台电脑的最长时间](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README.md) + +#### 第 275 场周赛(2022-01-09 10:30, 90 分钟) 参赛人数 4787 + +- [2133. 检查是否每一行每一列都包含全部整数](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README.md) +- [2134. 最少交换次数来组合所有的 1 II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README.md) +- [2135. 统计追加字母可以获得的单词数](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README.md) +- [2136. 全部开花的最早一天](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README.md) + +#### 第 69 场双周赛(2022-01-08 22:30, 90 分钟) 参赛人数 3360 + +- [2129. 将标题首字母大写](/solution/2100-2199/2129.Capitalize%20the%20Title/README.md) +- [2130. 链表最大孪生和](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md) +- [2131. 连接两字母单词得到的最长回文串](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README.md) +- [2132. 用邮票贴满网格图](/solution/2100-2199/2132.Stamping%20the%20Grid/README.md) + +#### 第 274 场周赛(2022-01-02 10:30, 90 分钟) 参赛人数 4109 + +- [2124. 检查是否所有 A 都在 B 之前](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md) +- [2125. 银行中的激光束数量](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md) +- [2126. 摧毁小行星](/solution/2100-2199/2126.Destroying%20Asteroids/README.md) +- [2127. 参加会议的最多员工数](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md) + +#### 第 273 场周赛(2021-12-26 10:30, 90 分钟) 参赛人数 4368 + +- [2119. 反转两次的数字](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README.md) +- [2120. 执行所有后缀指令](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README.md) +- [2121. 相同元素的间隔之和](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README.md) +- [2122. 还原原数组](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README.md) + +#### 第 68 场双周赛(2021-12-25 22:30, 90 分钟) 参赛人数 2854 + +- [2114. 句子中的最多单词数](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README.md) +- [2115. 从给定原材料中找到所有可以做出的菜](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README.md) +- [2116. 判断一个括号字符串是否有效](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md) +- [2117. 一个区间内所有数乘积的缩写](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README.md) + +#### 第 272 场周赛(2021-12-19 10:30, 90 分钟) 参赛人数 4698 + +- [2108. 找出数组中的第一个回文字符串](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README.md) +- [2109. 向字符串添加空格](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README.md) +- [2110. 股票平滑下跌阶段的数目](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README.md) +- [2111. 使数组 K 递增的最少操作次数](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README.md) + +#### 第 271 场周赛(2021-12-12 10:30, 90 分钟) 参赛人数 4562 + +- [2103. 环和杆](/solution/2100-2199/2103.Rings%20and%20Rods/README.md) +- [2104. 子数组范围和](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README.md) +- [2105. 给植物浇水 II](/solution/2100-2199/2105.Watering%20Plants%20II/README.md) +- [2106. 摘水果](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README.md) + +#### 第 67 场双周赛(2021-12-11 22:30, 90 分钟) 参赛人数 2923 + +- [2099. 找到和最大的长度为 K 的子序列](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README.md) +- [2100. 适合野炊的日子](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README.md) +- [2101. 引爆最多的炸弹](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README.md) +- [2102. 序列顺序查询](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README.md) + +#### 第 270 场周赛(2021-12-05 10:30, 90 分钟) 参赛人数 4748 + +- [2094. 找出 3 位偶数](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README.md) +- [2095. 删除链表的中间节点](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README.md) +- [2096. 从二叉树一个节点到另一个节点每一步的方向](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README.md) +- [2097. 合法重新排列数对](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README.md) + +#### 第 269 场周赛(2021-11-28 10:30, 90 分钟) 参赛人数 4293 + +- [2089. 找出数组排序后的目标下标](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README.md) +- [2090. 半径为 k 的子数组平均值](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README.md) +- [2091. 从数组中移除最大值和最小值](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README.md) +- [2092. 找出知晓秘密的所有专家](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README.md) + +#### 第 66 场双周赛(2021-11-27 22:30, 90 分钟) 参赛人数 2803 + +- [2085. 统计出现过一次的公共字符串](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README.md) +- [2086. 喂食仓鼠的最小食物桶数](/solution/2000-2099/2086.Minimum%20Number%20of%20Food%20Buckets%20to%20Feed%20the%20Hamsters/README.md) +- [2087. 网格图中机器人回家的最小代价](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README.md) +- [2088. 统计农场中肥沃金字塔的数目](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README.md) + +#### 第 268 场周赛(2021-11-21 10:30, 90 分钟) 参赛人数 4398 + +- [2078. 两栋颜色不同且距离最远的房子](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README.md) +- [2079. 给植物浇水](/solution/2000-2099/2079.Watering%20Plants/README.md) +- [2080. 区间内查询数字的频率](/solution/2000-2099/2080.Range%20Frequency%20Queries/README.md) +- [2081. k 镜像数字的和](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README.md) + +#### 第 267 场周赛(2021-11-14 10:30, 90 分钟) 参赛人数 4365 + +- [2073. 买票需要的时间](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README.md) +- [2074. 反转偶数长度组的节点](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README.md) +- [2075. 解码斜向换位密码](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README.md) +- [2076. 处理含限制条件的好友请求](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README.md) + +#### 第 65 场双周赛(2021-11-13 22:30, 90 分钟) 参赛人数 2676 + +- [2068. 检查两个字符串是否几乎相等](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README.md) +- [2069. 模拟行走机器人 II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README.md) +- [2070. 每一个查询的最大美丽值](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README.md) +- [2071. 你可以安排的最多任务数目](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README.md) + +#### 第 266 场周赛(2021-11-07 10:30, 90 分钟) 参赛人数 4385 + +- [2062. 统计字符串中的元音子字符串](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README.md) +- [2063. 所有子字符串中的元音](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README.md) +- [2064. 分配给商店的最多商品的最小值](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README.md) +- [2065. 最大化一张图中的路径价值](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README.md) + +#### 第 265 场周赛(2021-10-31 10:30, 90 分钟) 参赛人数 4182 + +- [2057. 值相等的最小索引](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README.md) +- [2058. 找出临界点之间的最小和最大距离](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README.md) +- [2059. 转化数字的最小运算数](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README.md) +- [2060. 同源字符串检测](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README.md) + +#### 第 64 场双周赛(2021-10-30 22:30, 90 分钟) 参赛人数 2838 + +- [2053. 数组中第 K 个独一无二的字符串](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README.md) +- [2054. 两个最好的不重叠活动](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README.md) +- [2055. 蜡烛之间的盘子](/solution/2000-2099/2055.Plates%20Between%20Candles/README.md) +- [2056. 棋盘上有效移动组合的数目](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README.md) + +#### 第 264 场周赛(2021-10-24 10:30, 90 分钟) 参赛人数 4659 + +- [2047. 句子中的有效单词数](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README.md) +- [2048. 下一个更大的数值平衡数](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README.md) +- [2049. 统计最高分的节点数目](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README.md) +- [2050. 并行课程 III](/solution/2000-2099/2050.Parallel%20Courses%20III/README.md) + +#### 第 263 场周赛(2021-10-17 10:30, 90 分钟) 参赛人数 4572 + +- [2042. 检查句子中的数字是否递增](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README.md) +- [2043. 简易银行系统](/solution/2000-2099/2043.Simple%20Bank%20System/README.md) +- [2044. 统计按位或能得到最大值的子集数目](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README.md) +- [2045. 到达目的地的第二短时间](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README.md) + +#### 第 63 场双周赛(2021-10-16 22:30, 90 分钟) 参赛人数 2828 + +- [2037. 使每位学生都有座位的最少移动次数](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README.md) +- [2038. 如果相邻两个颜色均相同则删除当前颜色](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README.md) +- [2039. 网络空闲的时刻](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README.md) +- [2040. 两个有序数组的第 K 小乘积](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README.md) + +#### 第 262 场周赛(2021-10-10 10:30, 90 分钟) 参赛人数 4261 + +- [2032. 至少在两个数组中出现的值](/solution/2000-2099/2032.Two%20Out%20of%20Three/README.md) +- [2033. 获取单值网格的最小操作数](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README.md) +- [2034. 股票价格波动](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README.md) +- [2035. 将数组分成两个数组并最小化数组和的差](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README.md) + +#### 第 261 场周赛(2021-10-03 10:30, 90 分钟) 参赛人数 3368 + +- [2027. 转换字符串的最少操作次数](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README.md) +- [2028. 找出缺失的观测数据](/solution/2000-2099/2028.Find%20Missing%20Observations/README.md) +- [2029. 石子游戏 IX](/solution/2000-2099/2029.Stone%20Game%20IX/README.md) +- [2030. 含特定字母的最小子序列](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README.md) + +#### 第 62 场双周赛(2021-10-02 22:30, 90 分钟) 参赛人数 2619 + +- [2022. 将一维数组转变成二维数组](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README.md) +- [2023. 连接后等于目标字符串的字符串对](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README.md) +- [2024. 考试的最大困扰度](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README.md) +- [2025. 分割数组的最多方案数](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README.md) + +#### 第 260 场周赛(2021-09-26 10:30, 90 分钟) 参赛人数 3654 + +- [2016. 增量元素之间的最大差值](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README.md) +- [2017. 网格游戏](/solution/2000-2099/2017.Grid%20Game/README.md) +- [2018. 判断单词是否能放入填字游戏内](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README.md) +- [2019. 解出数学表达式的学生分数](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README.md) + +#### 第 259 场周赛(2021-09-19 10:30, 90 分钟) 参赛人数 3775 + +- [2011. 执行操作后的变量值](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README.md) +- [2012. 数组美丽值求和](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README.md) +- [2013. 检测正方形](/solution/2000-2099/2013.Detect%20Squares/README.md) +- [2014. 重复 K 次的最长子序列](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README.md) + +#### 第 61 场双周赛(2021-09-18 22:30, 90 分钟) 参赛人数 2534 + +- [2006. 差的绝对值为 K 的数对数目](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README.md) +- [2007. 从双倍数组中还原原数组](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README.md) +- [2008. 出租车的最大盈利](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md) +- [2009. 使数组连续的最少操作数](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README.md) + +#### 第 258 场周赛(2021-09-12 10:30, 90 分钟) 参赛人数 4519 + +- [2000. 反转单词前缀](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README.md) +- [2001. 可互换矩形的组数](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README.md) +- [2002. 两个回文子序列长度的最大乘积](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README.md) +- [2003. 每棵子树内缺失的最小基因值](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README.md) + +#### 第 257 场周赛(2021-09-05 10:30, 90 分钟) 参赛人数 4278 + +- [1995. 统计特殊四元组](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README.md) +- [1996. 游戏中弱角色的数量](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README.md) +- [1997. 访问完所有房间的第一天](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README.md) +- [1998. 数组的最大公因数排序](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README.md) + +#### 第 60 场双周赛(2021-09-04 22:30, 90 分钟) 参赛人数 2848 + +- [1991. 找到数组的中间位置](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md) +- [1992. 找到所有的农场组](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README.md) +- [1993. 树上的操作](/solution/1900-1999/1993.Operations%20on%20Tree/README.md) +- [1994. 好子集的数目](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README.md) + +#### 第 256 场周赛(2021-08-29 10:30, 90 分钟) 参赛人数 4136 + +- [1984. 学生分数的最小差值](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README.md) +- [1985. 找出数组中的第 K 大整数](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README.md) +- [1986. 完成任务的最少工作时间段](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README.md) +- [1987. 不同的好子序列数目](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README.md) + +#### 第 255 场周赛(2021-08-22 10:30, 90 分钟) 参赛人数 4333 + +- [1979. 找出数组的最大公约数](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README.md) +- [1980. 找出不同的二进制字符串](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README.md) +- [1981. 最小化目标值与所选元素的差](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README.md) +- [1982. 从子集的和还原数组](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README.md) + +#### 第 59 场双周赛(2021-08-21 22:30, 90 分钟) 参赛人数 3030 + +- [1974. 使用特殊打字机键入单词的最少时间](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README.md) +- [1975. 最大方阵和](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README.md) +- [1976. 到达目的地的方案数](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README.md) +- [1977. 划分数字的方案数](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README.md) + +#### 第 254 场周赛(2021-08-15 10:30, 90 分钟) 参赛人数 4349 + +- [1967. 作为子字符串出现在单词中的字符串数目](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README.md) +- [1968. 构造元素不等于两相邻元素平均值的数组](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README.md) +- [1969. 数组元素的最小非零乘积](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README.md) +- [1970. 你能穿过矩阵的最后一天](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README.md) + +#### 第 253 场周赛(2021-08-08 10:30, 90 分钟) 参赛人数 4570 + +- [1961. 检查字符串是否为数组前缀](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README.md) +- [1962. 移除石子使总数最小](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README.md) +- [1963. 使字符串平衡的最小交换次数](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README.md) +- [1964. 找出到每个位置为止最长的有效障碍赛跑路线](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README.md) + +#### 第 58 场双周赛(2021-08-07 22:30, 90 分钟) 参赛人数 2889 + +- [1957. 删除字符使字符串变好](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README.md) +- [1958. 检查操作是否合法](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README.md) +- [1959. K 次调整数组大小浪费的最小总空间](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README.md) +- [1960. 两个回文子字符串长度的最大乘积](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README.md) + +#### 第 252 场周赛(2021-08-01 10:30, 90 分钟) 参赛人数 4647 + +- [1952. 三除数](/solution/1900-1999/1952.Three%20Divisors/README.md) +- [1953. 你可以工作的最大周数](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README.md) +- [1954. 收集足够苹果的最小花园周长](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README.md) +- [1955. 统计特殊子序列的数目](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README.md) + +#### 第 251 场周赛(2021-07-25 10:30, 90 分钟) 参赛人数 4747 + +- [1945. 字符串转化后的各位数字之和](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README.md) +- [1946. 子字符串突变后可能得到的最大整数](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README.md) +- [1947. 最大兼容性评分和](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README.md) +- [1948. 删除系统中的重复文件夹](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README.md) + +#### 第 57 场双周赛(2021-07-24 22:30, 90 分钟) 参赛人数 2933 + +- [1941. 检查是否所有字符出现次数相同](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README.md) +- [1942. 最小未被占据椅子的编号](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README.md) +- [1943. 描述绘画结果](/solution/1900-1999/1943.Describe%20the%20Painting/README.md) +- [1944. 队列中可以看到的人数](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README.md) + +#### 第 250 场周赛(2021-07-18 10:30, 90 分钟) 参赛人数 4315 + +- [1935. 可以输入的最大单词数](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README.md) +- [1936. 新增的最少台阶数](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README.md) +- [1937. 扣分后的最大得分](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README.md) +- [1938. 查询最大基因差](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README.md) + +#### 第 249 场周赛(2021-07-11 10:30, 90 分钟) 参赛人数 4335 + +- [1929. 数组串联](/solution/1900-1999/1929.Concatenation%20of%20Array/README.md) +- [1930. 长度为 3 的不同回文子序列](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README.md) +- [1931. 用三种不同颜色为网格涂色](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README.md) +- [1932. 合并多棵二叉搜索树](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README.md) + +#### 第 56 场双周赛(2021-07-10 22:30, 90 分钟) 参赛人数 2760 + +- [1925. 统计平方和三元组的数目](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README.md) +- [1926. 迷宫中离入口最近的出口](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README.md) +- [1927. 求和游戏](/solution/1900-1999/1927.Sum%20Game/README.md) +- [1928. 规定时间内到达终点的最小花费](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README.md) + +#### 第 248 场周赛(2021-07-04 10:30, 90 分钟) 参赛人数 4451 + +- [1920. 基于排列构建数组](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README.md) +- [1921. 消灭怪物的最大数量](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README.md) +- [1922. 统计好数字的数目](/solution/1900-1999/1922.Count%20Good%20Numbers/README.md) +- [1923. 最长公共子路径](/solution/1900-1999/1923.Longest%20Common%20Subpath/README.md) + +#### 第 247 场周赛(2021-06-27 10:30, 90 分钟) 参赛人数 3981 + +- [1913. 两个数对之间的最大乘积差](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README.md) +- [1914. 循环轮转矩阵](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README.md) +- [1915. 最美子字符串的数目](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README.md) +- [1916. 统计为蚁群构筑房间的不同顺序](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README.md) + +#### 第 55 场双周赛(2021-06-26 22:30, 90 分钟) 参赛人数 3277 + +- [1909. 删除一个元素使数组严格递增](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README.md) +- [1910. 删除一个字符串中所有出现的给定子字符串](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README.md) +- [1911. 最大子序列交替和](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README.md) +- [1912. 设计电影租借系统](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README.md) + +#### 第 246 场周赛(2021-06-20 10:30, 90 分钟) 参赛人数 4136 + +- [1903. 字符串中的最大奇数](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README.md) +- [1904. 你完成的完整对局数](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README.md) +- [1905. 统计子岛屿](/solution/1900-1999/1905.Count%20Sub%20Islands/README.md) +- [1906. 查询差绝对值的最小值](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README.md) + +#### 第 245 场周赛(2021-06-13 10:30, 90 分钟) 参赛人数 4271 + +- [1897. 重新分配字符使所有字符串都相等](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README.md) +- [1898. 可移除字符的最大数目](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md) +- [1899. 合并若干三元组以形成目标三元组](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README.md) +- [1900. 最佳运动员的比拼回合](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README.md) + +#### 第 54 场双周赛(2021-06-12 22:30, 90 分钟) 参赛人数 2479 + +- [1893. 检查是否区域内所有整数都被覆盖](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README.md) +- [1894. 找到需要补充粉笔的学生编号](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md) +- [1895. 最大的幻方](/solution/1800-1899/1895.Largest%20Magic%20Square/README.md) +- [1896. 反转表达式值的最少操作次数](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README.md) + +#### 第 244 场周赛(2021-06-06 10:30, 90 分钟) 参赛人数 4430 + +- [1886. 判断矩阵经轮转后是否一致](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README.md) +- [1887. 使数组元素相等的减少操作次数](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README.md) +- [1888. 使二进制字符串字符交替的最少反转次数](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README.md) +- [1889. 装包裹的最小浪费空间](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README.md) + +#### 第 243 场周赛(2021-05-30 10:30, 90 分钟) 参赛人数 4493 + +- [1880. 检查某单词是否等于两单词之和](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README.md) +- [1881. 插入后的最大值](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README.md) +- [1882. 使用服务器处理任务](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md) +- [1883. 准时抵达会议现场的最小跳过休息次数](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README.md) + +#### 第 53 场双周赛(2021-05-29 22:30, 90 分钟) 参赛人数 3069 + +- [1876. 长度为三且各字符不同的子字符串](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README.md) +- [1877. 数组中最大数对和的最小值](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README.md) +- [1878. 矩阵中最大的三个菱形和](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README.md) +- [1879. 两个数组最小的异或值之和](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README.md) + +#### 第 242 场周赛(2021-05-23 10:30, 90 分钟) 参赛人数 4306 + +- [1869. 哪种连续子字符串更长](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README.md) +- [1870. 准时到达的列车最小时速](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md) +- [1871. 跳跃游戏 VII](/solution/1800-1899/1871.Jump%20Game%20VII/README.md) +- [1872. 石子游戏 VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README.md) + +#### 第 241 场周赛(2021-05-16 10:30, 90 分钟) 参赛人数 4491 + +- [1863. 找出所有子集的异或总和再求和](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README.md) +- [1864. 构成交替字符串需要的最小交换次数](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README.md) +- [1865. 找出和为指定值的下标对](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README.md) +- [1866. 恰有 K 根木棍可以看到的排列数目](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README.md) + +#### 第 52 场双周赛(2021-05-15 22:30, 90 分钟) 参赛人数 2930 + +- [1859. 将句子排序](/solution/1800-1899/1859.Sorting%20the%20Sentence/README.md) +- [1860. 增长的内存泄露](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README.md) +- [1861. 旋转盒子](/solution/1800-1899/1861.Rotating%20the%20Box/README.md) +- [1862. 向下取整数对和](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README.md) + +#### 第 240 场周赛(2021-05-09 10:30, 90 分钟) 参赛人数 4307 + +- [1854. 人口最多的年份](/solution/1800-1899/1854.Maximum%20Population%20Year/README.md) +- [1855. 下标对中的最大距离](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README.md) +- [1856. 子数组最小乘积的最大值](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README.md) +- [1857. 有向图中最大颜色值](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README.md) + +#### 第 239 场周赛(2021-05-02 10:30, 90 分钟) 参赛人数 3907 + +- [1848. 到目标元素的最小距离](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README.md) +- [1849. 将字符串拆分为递减的连续值](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README.md) +- [1850. 邻位交换的最小次数](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README.md) +- [1851. 包含每个查询的最小区间](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README.md) + +#### 第 51 场双周赛(2021-05-01 22:30, 90 分钟) 参赛人数 2675 + +- [1844. 将所有数字用字符替换](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README.md) +- [1845. 座位预约管理系统](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README.md) +- [1846. 减小和重新排列数组后的最大元素](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README.md) +- [1847. 最近的房间](/solution/1800-1899/1847.Closest%20Room/README.md) + +#### 第 238 场周赛(2021-04-25 10:30, 90 分钟) 参赛人数 3978 + +- [1837. K 进制表示下的各位数字总和](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README.md) +- [1838. 最高频元素的频数](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README.md) +- [1839. 所有元音按顺序排布的最长子字符串](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README.md) +- [1840. 最高建筑高度](/solution/1800-1899/1840.Maximum%20Building%20Height/README.md) + +#### 第 237 场周赛(2021-04-18 10:30, 90 分钟) 参赛人数 4577 + +- [1832. 判断句子是否为全字母句](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README.md) +- [1833. 雪糕的最大数量](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README.md) +- [1834. 单线程 CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README.md) +- [1835. 所有数对按位与结果的异或和](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README.md) + +#### 第 50 场双周赛(2021-04-17 22:30, 90 分钟) 参赛人数 3608 + +- [1827. 最少操作使数组递增](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README.md) +- [1828. 统计一个圆中点的数目](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README.md) +- [1829. 每个查询的最大异或值](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README.md) +- [1830. 使字符串有序的最少操作次数](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README.md) + +#### 第 236 场周赛(2021-04-11 10:30, 90 分钟) 参赛人数 5113 + +- [1822. 数组元素积的符号](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README.md) +- [1823. 找出游戏的获胜者](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README.md) +- [1824. 最少侧跳次数](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README.md) +- [1825. 求出 MK 平均值](/solution/1800-1899/1825.Finding%20MK%20Average/README.md) + +#### 第 235 场周赛(2021-04-04 10:30, 90 分钟) 参赛人数 4494 + +- [1816. 截断句子](/solution/1800-1899/1816.Truncate%20Sentence/README.md) +- [1817. 查找用户活跃分钟数](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README.md) +- [1818. 绝对差值和](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README.md) +- [1819. 序列中不同最大公约数的数目](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README.md) + +#### 第 49 场双周赛(2021-04-03 22:30, 90 分钟) 参赛人数 3193 + +- [1812. 判断国际象棋棋盘中一个格子的颜色](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README.md) +- [1813. 句子相似性 III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README.md) +- [1814. 统计一个数组中好对子的数目](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README.md) +- [1815. 得到新鲜甜甜圈的最多组数](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README.md) + +#### 第 234 场周赛(2021-03-28 10:30, 90 分钟) 参赛人数 4998 + +- [1805. 字符串中不同整数的数目](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README.md) +- [1806. 还原排列的最少操作步数](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README.md) +- [1807. 替换字符串中的括号内容](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README.md) +- [1808. 好因子的最大数目](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README.md) + +#### 第 233 场周赛(2021-03-21 10:30, 90 分钟) 参赛人数 5010 + +- [1800. 最大升序子数组和](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README.md) +- [1801. 积压订单中的订单总数](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README.md) +- [1802. 有界数组中指定下标处的最大值](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README.md) +- [1803. 统计异或值在范围内的数对有多少](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README.md) + +#### 第 48 场双周赛(2021-03-20 22:30, 90 分钟) 参赛人数 2853 + +- [1796. 字符串中第二大的数字](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README.md) +- [1797. 设计一个验证系统](/solution/1700-1799/1797.Design%20Authentication%20Manager/README.md) +- [1798. 你能构造出连续值的最大数目](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README.md) +- [1799. N 次操作后的最大分数和](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README.md) + +#### 第 232 场周赛(2021-03-14 10:30, 90 分钟) 参赛人数 4802 + +- [1790. 仅执行一次字符串交换能否使两个字符串相等](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README.md) +- [1791. 找出星型图的中心节点](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README.md) +- [1792. 最大平均通过率](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README.md) +- [1793. 好子数组的最大分数](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README.md) + +#### 第 231 场周赛(2021-03-07 10:30, 90 分钟) 参赛人数 4668 + +- [1784. 检查二进制字符串字段](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README.md) +- [1785. 构成特定和需要添加的最少元素](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README.md) +- [1786. 从第一个节点出发到最后一个节点的受限路径数](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README.md) +- [1787. 使所有区间的异或结果为零](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README.md) + +#### 第 47 场双周赛(2021-03-06 22:30, 90 分钟) 参赛人数 3085 + +- [1779. 找到最近的有相同 X 或 Y 坐标的点](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README.md) +- [1780. 判断一个数字是否可以表示成三的幂的和](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README.md) +- [1781. 所有子字符串美丽值之和](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README.md) +- [1782. 统计点对的数目](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README.md) + +#### 第 230 场周赛(2021-02-28 10:30, 90 分钟) 参赛人数 3728 + +- [1773. 统计匹配检索规则的物品数量](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README.md) +- [1774. 最接近目标价格的甜点成本](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md) +- [1775. 通过最少操作次数使数组的和相等](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README.md) +- [1776. 车队 II](/solution/1700-1799/1776.Car%20Fleet%20II/README.md) + +#### 第 229 场周赛(2021-02-21 10:30, 90 分钟) 参赛人数 3484 + +- [1768. 交替合并字符串](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README.md) +- [1769. 移动所有球到每个盒子所需的最小操作数](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README.md) +- [1770. 执行乘法运算的最大分数](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README.md) +- [1771. 由子序列构造的最长回文串的长度](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README.md) + +#### 第 46 场双周赛(2021-02-20 22:30, 90 分钟) 参赛人数 1647 + +- [1763. 最长的美好子字符串](/solution/1700-1799/1763.Longest%20Nice%20Substring/README.md) +- [1764. 通过连接另一个数组的子数组得到一个数组](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README.md) +- [1765. 地图中的最高点](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md) +- [1766. 互质树](/solution/1700-1799/1766.Tree%20of%20Coprimes/README.md) + +#### 第 228 场周赛(2021-02-14 10:30, 90 分钟) 参赛人数 2484 + +- [1758. 生成交替二进制字符串的最少操作数](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README.md) +- [1759. 统计同质子字符串的数目](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README.md) +- [1760. 袋子里最少数目的球](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README.md) +- [1761. 一个图中连通三元组的最小度数](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README.md) + +#### 第 227 场周赛(2021-02-07 10:30, 90 分钟) 参赛人数 3546 + +- [1752. 检查数组是否经排序和轮转得到](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md) +- [1753. 移除石子的最大得分](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md) +- [1754. 构造字典序最大的合并字符串](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md) +- [1755. 最接近目标值的子序列和](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md) + +#### 第 45 场双周赛(2021-02-06 22:30, 90 分钟) 参赛人数 1676 + +- [1748. 唯一元素的和](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md) +- [1749. 任意子数组和的绝对值的最大值](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md) +- [1750. 删除字符串两端相同字符后的最短长度](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md) +- [1751. 最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md) + +#### 第 226 场周赛(2021-01-31 10:30, 90 分钟) 参赛人数 4034 + +- [1742. 盒子中小球的最大数量](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md) +- [1743. 从相邻元素对还原数组](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md) +- [1744. 你能在你最喜欢的那天吃到你最喜欢的糖果吗？](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md) +- [1745. 分割回文串 IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md) + +#### 第 225 场周赛(2021-01-24 10:30, 90 分钟) 参赛人数 3853 + +- [1736. 替换隐藏数字得到的最晚时间](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md) +- [1737. 满足三条件之一需改变的最少字符数](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md) +- [1738. 找出第 K 大的异或坐标值](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md) +- [1739. 放置盒子](/solution/1700-1799/1739.Building%20Boxes/README.md) + +#### 第 44 场双周赛(2021-01-23 22:30, 90 分钟) 参赛人数 1826 + +- [1732. 找到最高海拔](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md) +- [1733. 需要教语言的最少人数](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md) +- [1734. 解码异或后的排列](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md) +- [1735. 生成乘积数组的方案数](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md) + +#### 第 224 场周赛(2021-01-17 10:30, 90 分钟) 参赛人数 3795 + +- [1725. 可以形成最大正方形的矩形数目](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README.md) +- [1726. 同积元组](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README.md) +- [1727. 重新排列后的最大子矩阵](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README.md) +- [1728. 猫和老鼠 II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README.md) + +#### 第 223 场周赛(2021-01-10 10:30, 90 分钟) 参赛人数 3872 + +- [1720. 解码异或后的数组](/solution/1700-1799/1720.Decode%20XORed%20Array/README.md) +- [1721. 交换链表中的节点](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README.md) +- [1722. 执行交换操作后的最小汉明距离](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README.md) +- [1723. 完成所有工作的最短时间](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md) + +#### 第 43 场双周赛(2021-01-09 22:30, 90 分钟) 参赛人数 1631 + +- [1716. 计算力扣银行的钱](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README.md) +- [1717. 删除子字符串的最大得分](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README.md) +- [1718. 构建字典序最大的可行序列](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README.md) +- [1719. 重构一棵树的方案数](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README.md) + +#### 第 222 场周赛(2021-01-03 10:30, 90 分钟) 参赛人数 3119 + +- [1710. 卡车上的最大单元数](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README.md) +- [1711. 大餐计数](/solution/1700-1799/1711.Count%20Good%20Meals/README.md) +- [1712. 将数组分成三个子数组的方案数](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README.md) +- [1713. 得到子序列的最少操作次数](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README.md) + +#### 第 221 场周赛(2020-12-27 10:30, 90 分钟) 参赛人数 3398 + +- [1704. 判断字符串的两半是否相似](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README.md) +- [1705. 吃苹果的最大数目](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README.md) +- [1706. 球会落何处](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README.md) +- [1707. 与数组中元素的最大异或值](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README.md) + +#### 第 42 场双周赛(2020-12-26 22:30, 90 分钟) 参赛人数 1578 + +- [1700. 无法吃午餐的学生数量](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md) +- [1701. 平均等待时间](/solution/1700-1799/1701.Average%20Waiting%20Time/README.md) +- [1702. 修改后的最大二进制字符串](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README.md) +- [1703. 得到连续 K 个 1 的最少相邻交换次数](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README.md) + +#### 第 220 场周赛(2020-12-20 10:30, 90 分钟) 参赛人数 3691 + +- [1694. 重新格式化电话号码](/solution/1600-1699/1694.Reformat%20Phone%20Number/README.md) +- [1695. 删除子数组的最大得分](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md) +- [1696. 跳跃游戏 VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md) +- [1697. 检查边长度限制的路径是否存在](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md) + +#### 第 219 场周赛(2020-12-13 10:30, 90 分钟) 参赛人数 3710 + +- [1688. 比赛中的配对次数](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README.md) +- [1689. 十-二进制数的最少数目](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README.md) +- [1690. 石子游戏 VII](/solution/1600-1699/1690.Stone%20Game%20VII/README.md) +- [1691. 堆叠长方体的最大高度](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md) + +#### 第 41 场双周赛(2020-12-12 22:30, 90 分钟) 参赛人数 1660 + +- [1684. 统计一致字符串的数目](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README.md) +- [1685. 有序数组中差绝对值之和](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README.md) +- [1686. 石子游戏 VI](/solution/1600-1699/1686.Stone%20Game%20VI/README.md) +- [1687. 从仓库到码头运输箱子](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README.md) + +#### 第 218 场周赛(2020-12-06 10:30, 90 分钟) 参赛人数 3762 + +- [1678. 设计 Goal 解析器](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md) +- [1679. K 和数对的最大数目](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md) +- [1680. 连接连续二进制数字](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README.md) +- [1681. 最小不兼容性](/solution/1600-1699/1681.Minimum%20Incompatibility/README.md) + +#### 第 217 场周赛(2020-11-29 10:30, 90 分钟) 参赛人数 3745 + +- [1672. 最富有客户的资产总量](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README.md) +- [1673. 找出最具竞争力的子序列](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README.md) +- [1674. 使数组互补的最少操作次数](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README.md) +- [1675. 数组的最小偏移量](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README.md) + +#### 第 40 场双周赛(2020-11-28 22:30, 90 分钟) 参赛人数 1891 + +- [1668. 最大重复子字符串](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README.md) +- [1669. 合并两个链表](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README.md) +- [1670. 设计前中后队列](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README.md) +- [1671. 得到山形数组的最少删除次数](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README.md) + +#### 第 216 场周赛(2020-11-22 10:30, 90 分钟) 参赛人数 3857 + +- [1662. 检查两个字符串数组是否相等](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README.md) +- [1663. 具有给定数值的最小字符串](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README.md) +- [1664. 生成平衡数组的方案数](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README.md) +- [1665. 完成所有任务的最少初始能量](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README.md) + +#### 第 215 场周赛(2020-11-15 10:30, 90 分钟) 参赛人数 4429 + +- [1656. 设计有序流](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README.md) +- [1657. 确定两个字符串是否接近](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README.md) +- [1658. 将 x 减到 0 的最小操作数](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README.md) +- [1659. 最大化网格幸福感](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README.md) + +#### 第 39 场双周赛(2020-11-14 22:30, 90 分钟) 参赛人数 2069 + +- [1652. 拆炸弹](/solution/1600-1699/1652.Defuse%20the%20Bomb/README.md) +- [1653. 使字符串平衡的最少删除次数](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README.md) +- [1654. 到家的最少跳跃次数](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README.md) +- [1655. 分配重复整数](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README.md) + +#### 第 214 场周赛(2020-11-08 10:30, 90 分钟) 参赛人数 3598 + +- [1646. 获取生成数组中的最大值](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README.md) +- [1647. 字符频次唯一的最小删除次数](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README.md) +- [1648. 销售价值减少的颜色球](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README.md) +- [1649. 通过指令创建有序数组](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md) + +#### 第 213 场周赛(2020-11-01 10:30, 90 分钟) 参赛人数 3827 + +- [1640. 能否连接形成数组](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README.md) +- [1641. 统计字典序元音字符串的数目](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README.md) +- [1642. 可以到达的最远建筑](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README.md) +- [1643. 第 K 条最小指令](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README.md) + +#### 第 38 场双周赛(2020-10-31 22:30, 90 分钟) 参赛人数 2004 + +- [1636. 按照频率将数组升序排序](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README.md) +- [1637. 两点之间不包含任何点的最宽垂直区域](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README.md) +- [1638. 统计只差一个字符的子串数目](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README.md) +- [1639. 通过给定词典构造目标字符串的方案数](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README.md) + +#### 第 212 场周赛(2020-10-25 10:30, 90 分钟) 参赛人数 4227 + +- [1629. 按键持续时间最长的键](/solution/1600-1699/1629.Slowest%20Key/README.md) +- [1630. 等差子数组](/solution/1600-1699/1630.Arithmetic%20Subarrays/README.md) +- [1631. 最小体力消耗路径](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README.md) +- [1632. 矩阵转换后的秩](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README.md) + +#### 第 211 场周赛(2020-10-18 10:30, 90 分钟) 参赛人数 4034 + +- [1624. 两个相同字符之间的最长子字符串](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README.md) +- [1625. 执行操作后字典序最小的字符串](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README.md) +- [1626. 无矛盾的最佳球队](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md) +- [1627. 带阈值的图连通性](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README.md) + +#### 第 37 场双周赛(2020-10-17 22:30, 90 分钟) 参赛人数 2104 + +- [1619. 删除某些元素后的数组均值](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README.md) +- [1620. 网络信号最好的坐标](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README.md) +- [1621. 大小为 K 的不重叠线段的数目](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README.md) +- [1622. 奇妙序列](/solution/1600-1699/1622.Fancy%20Sequence/README.md) + +#### 第 210 场周赛(2020-10-11 10:30, 90 分钟) 参赛人数 4007 + +- [1614. 括号的最大嵌套深度](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README.md) +- [1615. 最大网络秩](/solution/1600-1699/1615.Maximal%20Network%20Rank/README.md) +- [1616. 分割两个字符串得到回文串](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README.md) +- [1617. 统计子树中城市之间最大距离](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README.md) + +#### 第 209 场周赛(2020-10-04 10:30, 90 分钟) 参赛人数 4023 + +- [1608. 特殊数组的特征值](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README.md) +- [1609. 奇偶树](/solution/1600-1699/1609.Even%20Odd%20Tree/README.md) +- [1610. 可见点的最大数目](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README.md) +- [1611. 使整数变为 0 的最少操作次数](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README.md) + +#### 第 36 场双周赛(2020-10-03 22:30, 90 分钟) 参赛人数 2204 + +- [1603. 设计停车系统](/solution/1600-1699/1603.Design%20Parking%20System/README.md) +- [1604. 警告一小时内使用相同员工卡大于等于三次的人](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README.md) +- [1605. 给定行和列的和求可行矩阵](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README.md) +- [1606. 找到处理最多请求的服务器](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README.md) + +#### 第 208 场周赛(2020-09-27 10:30, 90 分钟) 参赛人数 3582 + +- [1598. 文件夹操作日志搜集器](/solution/1500-1599/1598.Crawler%20Log%20Folder/README.md) +- [1599. 经营摩天轮的最大利润](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README.md) +- [1600. 王位继承顺序](/solution/1600-1699/1600.Throne%20Inheritance/README.md) +- [1601. 最多可达成的换楼请求数目](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README.md) + +#### 第 207 场周赛(2020-09-20 10:30, 90 分钟) 参赛人数 4116 + +- [1592. 重新排列单词间的空格](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README.md) +- [1593. 拆分字符串使唯一子字符串的数目最大](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README.md) +- [1594. 矩阵的最大非负积](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README.md) +- [1595. 连通两组点的最小成本](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README.md) + +#### 第 35 场双周赛(2020-09-19 22:30, 90 分钟) 参赛人数 2839 + +- [1588. 所有奇数长度子数组的和](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README.md) +- [1589. 所有排列中的最大和](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README.md) +- [1590. 使数组和能被 P 整除](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README.md) +- [1591. 奇怪的打印机 II](/solution/1500-1599/1591.Strange%20Printer%20II/README.md) + +#### 第 206 场周赛(2020-09-13 10:30, 90 分钟) 参赛人数 4493 + +- [1582. 二进制矩阵中的特殊位置](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README.md) +- [1583. 统计不开心的朋友](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README.md) +- [1584. 连接所有点的最小费用](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md) +- [1585. 检查字符串是否可以通过排序子字符串得到另一个字符串](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README.md) + +#### 第 205 场周赛(2020-09-06 10:30, 90 分钟) 参赛人数 4176 + +- [1576. 替换所有的问号](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md) +- [1577. 数的平方等于两数乘积的方法数](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md) +- [1578. 使绳子变成彩色的最短时间](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README.md) +- [1579. 保证图可完全遍历](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md) + +#### 第 34 场双周赛(2020-09-05 22:30, 90 分钟) 参赛人数 2842 + +- [1572. 矩阵对角线元素的和](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README.md) +- [1573. 分割字符串的方案数](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md) +- [1574. 删除最短的子数组使剩余数组有序](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md) +- [1575. 统计所有可行路径](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md) + +#### 第 204 场周赛(2020-08-30 10:30, 90 分钟) 参赛人数 4487 + +- [1566. 重复至少 K 次且长度为 M 的模式](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README.md) +- [1567. 乘积为正数的最长子数组长度](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README.md) +- [1568. 使陆地分离的最少天数](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README.md) +- [1569. 将子数组重新排序得到同一个二叉搜索树的方案数](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README.md) + +#### 第 203 场周赛(2020-08-23 10:30, 90 分钟) 参赛人数 5285 + +- [1560. 圆形赛道上经过次数最多的扇区](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README.md) +- [1561. 你可以获得的最大硬币数目](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README.md) +- [1562. 查找大小为 M 的最新分组](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README.md) +- [1563. 石子游戏 V](/solution/1500-1599/1563.Stone%20Game%20V/README.md) + +#### 第 33 场双周赛(2020-08-22 22:30, 90 分钟) 参赛人数 3304 + +- [1556. 千位分隔数](/solution/1500-1599/1556.Thousand%20Separator/README.md) +- [1557. 可以到达所有点的最少点数目](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README.md) +- [1558. 得到目标数组的最少函数调用次数](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README.md) +- [1559. 二维网格图中探测环](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md) + +#### 第 202 场周赛(2020-08-16 10:30, 90 分钟) 参赛人数 4990 + +- [1550. 存在连续三个奇数的数组](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README.md) +- [1551. 使数组中所有元素相等的最小操作数](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README.md) +- [1552. 两球之间的磁力](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README.md) +- [1553. 吃掉 N 个橘子的最少天数](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README.md) + +#### 第 201 场周赛(2020-08-09 10:30, 90 分钟) 参赛人数 5615 + +- [1544. 整理字符串](/solution/1500-1599/1544.Make%20The%20String%20Great/README.md) +- [1545. 找出第 N 个二进制字符串中的第 K 位](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README.md) +- [1546. 和为目标值且不重叠的非空子数组的最大数目](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README.md) +- [1547. 切棍子的最小成本](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README.md) + +#### 第 32 场双周赛(2020-08-08 22:30, 90 分钟) 参赛人数 2957 + +- [1539. 第 k 个缺失的正整数](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README.md) +- [1540. K 次操作转变字符串](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README.md) +- [1541. 平衡括号字符串的最少插入次数](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md) +- [1542. 找出最长的超赞子字符串](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README.md) + +#### 第 200 场周赛(2020-08-02 10:30, 90 分钟) 参赛人数 5476 + +- [1534. 统计好三元组](/solution/1500-1599/1534.Count%20Good%20Triplets/README.md) +- [1535. 找出数组游戏的赢家](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README.md) +- [1536. 排布二进制网格的最少交换次数](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README.md) +- [1537. 最大得分](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README.md) + +#### 第 199 场周赛(2020-07-26 10:30, 90 分钟) 参赛人数 5232 + +- [1528. 重新排列字符串](/solution/1500-1599/1528.Shuffle%20String/README.md) +- [1529. 最少的后缀翻转次数](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README.md) +- [1530. 好叶子节点对的数量](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README.md) +- [1531. 压缩字符串 II](/solution/1500-1599/1531.String%20Compression%20II/README.md) + +#### 第 31 场双周赛(2020-07-25 22:30, 90 分钟) 参赛人数 2767 + +- [1523. 在区间范围内统计奇数数目](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README.md) +- [1524. 和为奇数的子数组数目](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README.md) +- [1525. 字符串的好分割数目](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README.md) +- [1526. 形成目标数组的子数组最少增加次数](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README.md) + +#### 第 198 场周赛(2020-07-19 10:30, 90 分钟) 参赛人数 5780 + +- [1518. 换水问题](/solution/1500-1599/1518.Water%20Bottles/README.md) +- [1519. 子树中标签相同的节点数](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README.md) +- [1520. 最多的不重叠子字符串](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README.md) +- [1521. 找到最接近目标值的函数值](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README.md) + +#### 第 197 场周赛(2020-07-12 10:30, 90 分钟) 参赛人数 5275 + +- [1512. 好数对的数目](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README.md) +- [1513. 仅含 1 的子串数](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md) +- [1514. 概率最大的路径](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README.md) +- [1515. 服务中心的最佳位置](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README.md) + +#### 第 30 场双周赛(2020-07-11 22:30, 90 分钟) 参赛人数 2545 + +- [1507. 转变日期格式](/solution/1500-1599/1507.Reformat%20Date/README.md) +- [1508. 子数组和排序后的区间和](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README.md) +- [1509. 三次操作后最大值与最小值的最小差](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README.md) +- [1510. 石子游戏 IV](/solution/1500-1599/1510.Stone%20Game%20IV/README.md) + +#### 第 196 场周赛(2020-07-05 10:30, 90 分钟) 参赛人数 5507 + +- [1502. 判断能否形成等差数列](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README.md) +- [1503. 所有蚂蚁掉下来前的最后一刻](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README.md) +- [1504. 统计全 1 子矩形](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README.md) +- [1505. 最多 K 次交换相邻数位后得到的最小整数](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README.md) + +#### 第 195 场周赛(2020-06-28 10:30, 90 分钟) 参赛人数 3401 + +- [1496. 判断路径是否相交](/solution/1400-1499/1496.Path%20Crossing/README.md) +- [1497. 检查数组对是否可以被 k 整除](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README.md) +- [1498. 满足条件的子序列数目](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README.md) +- [1499. 满足不等式的最大值](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README.md) + +#### 第 29 场双周赛(2020-06-27 22:30, 90 分钟) 参赛人数 2260 + +- [1491. 去掉最低工资和最高工资后的工资平均值](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README.md) +- [1492. n 的第 k 个因子](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README.md) +- [1493. 删掉一个元素以后全为 1 的最长子数组](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README.md) +- [1494. 并行课程 II](/solution/1400-1499/1494.Parallel%20Courses%20II/README.md) + +#### 第 194 场周赛(2020-06-21 10:30, 90 分钟) 参赛人数 4378 + +- [1486. 数组异或操作](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README.md) +- [1487. 保证文件名唯一](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README.md) +- [1488. 避免洪水泛滥](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README.md) +- [1489. 找到最小生成树里的关键边和伪关键边](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README.md) + +#### 第 193 场周赛(2020-06-14 10:30, 90 分钟) 参赛人数 3804 + +- [1480. 一维数组的动态和](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README.md) +- [1481. 不同整数的最少数目](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README.md) +- [1482. 制作 m 束花所需的最少天数](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README.md) +- [1483. 树节点的第 K 个祖先](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md) + +#### 第 28 场双周赛(2020-06-13 22:30, 90 分钟) 参赛人数 2144 + +- [1475. 商品折扣后的最终价格](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README.md) +- [1476. 子矩形查询](/solution/1400-1499/1476.Subrectangle%20Queries/README.md) +- [1477. 找两个和为目标值且不重叠的子数组](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README.md) +- [1478. 安排邮筒](/solution/1400-1499/1478.Allocate%20Mailboxes/README.md) + +#### 第 192 场周赛(2020-06-07 10:30, 90 分钟) 参赛人数 3615 + +- [1470. 重新排列数组](/solution/1400-1499/1470.Shuffle%20the%20Array/README.md) +- [1471. 数组中的 k 个最强值](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README.md) +- [1472. 设计浏览器历史记录](/solution/1400-1499/1472.Design%20Browser%20History/README.md) +- [1473. 粉刷房子 III](/solution/1400-1499/1473.Paint%20House%20III/README.md) + +#### 第 191 场周赛(2020-05-31 10:30, 90 分钟) 参赛人数 3687 + +- [1464. 数组中两元素的最大乘积](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README.md) +- [1465. 切割后面积最大的蛋糕](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README.md) +- [1466. 重新规划路线](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README.md) +- [1467. 两个盒子中球的颜色数相同的概率](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README.md) + +#### 第 27 场双周赛(2020-05-30 22:30, 90 分钟) 参赛人数 1966 + +- [1460. 通过翻转子数组使两个数组相等](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README.md) +- [1461. 检查一个字符串是否包含所有长度为 K 的二进制子串](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README.md) +- [1462. 课程表 IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README.md) +- [1463. 摘樱桃 II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README.md) + +#### 第 190 场周赛(2020-05-24 10:30, 90 分钟) 参赛人数 3352 + +- [1455. 检查单词是否为句中其他单词的前缀](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README.md) +- [1456. 定长子串中元音的最大数目](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README.md) +- [1457. 二叉树中的伪回文路径](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README.md) +- [1458. 两个子序列的最大点积](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README.md) + +#### 第 189 场周赛(2020-05-17 10:30, 90 分钟) 参赛人数 3692 + +- [1450. 在既定时间做作业的学生人数](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README.md) +- [1451. 重新排列句子中的单词](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README.md) +- [1452. 收藏清单](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README.md) +- [1453. 圆形靶内的最大飞镖数量](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README.md) + +#### 第 26 场双周赛(2020-05-16 22:30, 90 分钟) 参赛人数 1971 + +- [1446. 连续字符](/solution/1400-1499/1446.Consecutive%20Characters/README.md) +- [1447. 最简分数](/solution/1400-1499/1447.Simplified%20Fractions/README.md) +- [1448. 统计二叉树中好节点的数目](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README.md) +- [1449. 数位成本和为目标值的最大数字](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README.md) + +#### 第 188 场周赛(2020-05-10 10:30, 90 分钟) 参赛人数 3982 + +- [1441. 用栈操作构建数组](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README.md) +- [1442. 形成两个异或相等数组的三元组数目](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README.md) +- [1443. 收集树上所有苹果的最少时间](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README.md) +- [1444. 切披萨的方案数](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md) + +#### 第 187 场周赛(2020-05-03 10:30, 90 分钟) 参赛人数 3109 + +- [1436. 旅行终点站](/solution/1400-1499/1436.Destination%20City/README.md) +- [1437. 是否所有 1 都至少相隔 k 个元素](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README.md) +- [1438. 绝对差不超过限制的最长连续子数组](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README.md) +- [1439. 有序矩阵中的第 k 个最小数组和](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README.md) + +#### 第 25 场双周赛(2020-05-02 22:30, 90 分钟) 参赛人数 1832 + +- [1431. 拥有最多糖果的孩子](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README.md) +- [1432. 改变一个整数能得到的最大差值](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README.md) +- [1433. 检查一个字符串是否可以打破另一个字符串](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README.md) +- [1434. 每个人戴不同帽子的方案数](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README.md) + +#### 第 186 场周赛(2020-04-26 10:30, 90 分钟) 参赛人数 3108 + +- [1422. 分割字符串的最大得分](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README.md) +- [1423. 可获得的最大点数](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README.md) +- [1424. 对角线遍历 II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README.md) +- [1425. 带限制的子序列和](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md) + +#### 第 185 场周赛(2020-04-19 10:30, 90 分钟) 参赛人数 5004 + +- [1417. 重新格式化字符串](/solution/1400-1499/1417.Reformat%20The%20String/README.md) +- [1418. 点菜展示表](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README.md) +- [1419. 数青蛙](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README.md) +- [1420. 生成数组](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README.md) + +#### 第 24 场双周赛(2020-04-18 22:30, 90 分钟) 参赛人数 1898 + +- [1413. 逐步求和得到正数的最小值](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README.md) +- [1414. 和为 K 的最少斐波那契数字数目](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README.md) +- [1415. 长度为 n 的开心字符串中字典序第 k 小的字符串](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README.md) +- [1416. 恢复数组](/solution/1400-1499/1416.Restore%20The%20Array/README.md) + +#### 第 184 场周赛(2020-04-12 10:30, 90 分钟) 参赛人数 3847 + +- [1408. 数组中的字符串匹配](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README.md) +- [1409. 查询带键的排列](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README.md) +- [1410. HTML 实体解析器](/solution/1400-1499/1410.HTML%20Entity%20Parser/README.md) +- [1411. 给 N x 3 网格图涂色的方案数](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README.md) + +#### 第 183 场周赛(2020-04-05 10:30, 90 分钟) 参赛人数 3756 + +- [1403. 非递增顺序的最小子序列](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md) +- [1404. 将二进制表示减到 1 的步骤数](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md) +- [1405. 最长快乐字符串](/solution/1400-1499/1405.Longest%20Happy%20String/README.md) +- [1406. 石子游戏 III](/solution/1400-1499/1406.Stone%20Game%20III/README.md) + +#### 第 23 场双周赛(2020-04-04 22:30, 90 分钟) 参赛人数 2045 + +- [1399. 统计最大组的数目](/solution/1300-1399/1399.Count%20Largest%20Group/README.md) +- [1400. 构造 K 个回文字符串](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md) +- [1401. 圆和矩形是否有重叠](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md) +- [1402. 做菜顺序](/solution/1400-1499/1402.Reducing%20Dishes/README.md) + +#### 第 182 场周赛(2020-03-29 10:30, 90 分钟) 参赛人数 3911 + +- [1394. 找出数组中的幸运数](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README.md) +- [1395. 统计作战单位数](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README.md) +- [1396. 设计地铁系统](/solution/1300-1399/1396.Design%20Underground%20System/README.md) +- [1397. 找到所有好字符串](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README.md) + +#### 第 181 场周赛(2020-03-22 10:30, 90 分钟) 参赛人数 4149 + +- [1389. 按既定顺序创建目标数组](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README.md) +- [1390. 四因数](/solution/1300-1399/1390.Four%20Divisors/README.md) +- [1391. 检查网格中是否存在有效路径](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README.md) +- [1392. 最长快乐前缀](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README.md) + +#### 第 22 场双周赛(2020-03-21 22:30, 90 分钟) 参赛人数 2042 + +- [1385. 两个数组间的距离值](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README.md) +- [1386. 安排电影院座位](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README.md) +- [1387. 将整数按权重排序](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README.md) +- [1388. 3n 块披萨](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README.md) + +#### 第 180 场周赛(2020-03-15 10:30, 90 分钟) 参赛人数 3715 + +- [1380. 矩阵中的幸运数](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md) +- [1381. 设计一个支持增量操作的栈](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md) +- [1382. 将二叉搜索树变平衡](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md) +- [1383. 最大的团队表现值](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md) + +#### 第 179 场周赛(2020-03-08 10:30, 90 分钟) 参赛人数 3606 + +- [1374. 生成每种字符都是奇数个的字符串](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README.md) +- [1375. 二进制字符串前缀一致的次数](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README.md) +- [1376. 通知所有员工所需的时间](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md) +- [1377. T 秒后青蛙的位置](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md) + +#### 第 21 场双周赛(2020-03-07 22:30, 90 分钟) 参赛人数 1913 + +- [1370. 上升下降字符串](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README.md) +- [1371. 每个元音包含偶数次的最长子字符串](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md) +- [1372. 二叉树中的最长交错路径](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README.md) +- [1373. 二叉搜索子树的最大键值和](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README.md) + +#### 第 178 场周赛(2020-03-01 10:30, 90 分钟) 参赛人数 3305 + +- [1365. 有多少小于当前数字的数字](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README.md) +- [1366. 通过投票对团队排名](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README.md) +- [1367. 二叉树中的链表](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README.md) +- [1368. 使网格图至少有一条有效路径的最小代价](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md) + +#### 第 177 场周赛(2020-02-23 10:30, 90 分钟) 参赛人数 2986 + +- [1360. 日期之间隔几天](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README.md) +- [1361. 验证二叉树](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README.md) +- [1362. 最接近的因数](/solution/1300-1399/1362.Closest%20Divisors/README.md) +- [1363. 形成三的最大倍数](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README.md) + +#### 第 20 场双周赛(2020-02-22 22:30, 90 分钟) 参赛人数 1541 + +- [1356. 根据数字二进制下 1 的数目排序](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README.md) +- [1357. 每隔 n 个顾客打折](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README.md) +- [1358. 包含所有三种字符的子字符串数目](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README.md) +- [1359. 有效的快递序列数目](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README.md) + +#### 第 176 场周赛(2020-02-16 10:30, 90 分钟) 参赛人数 2410 + +- [1351. 统计有序矩阵中的负数](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README.md) +- [1352. 最后 K 个数的乘积](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README.md) +- [1353. 最多可以参加的会议数目](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README.md) +- [1354. 多次求和构造目标数组](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README.md) + +#### 第 175 场周赛(2020-02-09 10:30, 90 分钟) 参赛人数 2048 + +- [1346. 检查整数及其两倍数是否存在](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README.md) +- [1347. 制造字母异位词的最小步骤数](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README.md) +- [1348. 推文计数](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README.md) +- [1349. 参加考试的最大学生数](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README.md) + +#### 第 19 场双周赛(2020-02-08 22:30, 90 分钟) 参赛人数 1120 + +- [1342. 将数字变成 0 的操作次数](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README.md) +- [1343. 大小为 K 且平均值大于等于阈值的子数组数目](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README.md) +- [1344. 时钟指针的夹角](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README.md) +- [1345. 跳跃游戏 IV](/solution/1300-1399/1345.Jump%20Game%20IV/README.md) + +#### 第 174 场周赛(2020-02-02 10:30, 90 分钟) 参赛人数 1660 + +- [1337. 矩阵中战斗力最弱的 K 行](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README.md) +- [1338. 数组大小减半](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README.md) +- [1339. 分裂二叉树的最大乘积](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README.md) +- [1340. 跳跃游戏 V](/solution/1300-1399/1340.Jump%20Game%20V/README.md) + +#### 第 173 场周赛(2020-01-26 10:30, 90 分钟) 参赛人数 1072 + +- [1332. 删除回文子序列](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README.md) +- [1333. 餐厅过滤器](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README.md) +- [1334. 阈值距离内邻居最少的城市](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README.md) +- [1335. 工作计划的最低难度](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README.md) + +#### 第 18 场双周赛(2020-01-25 22:30, 90 分钟) 参赛人数 587 + +- [1331. 数组序号转换](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README.md) +- [1328. 破坏回文串](/solution/1300-1399/1328.Break%20a%20Palindrome/README.md) +- [1329. 将矩阵按对角线排序](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README.md) +- [1330. 翻转子数组得到最大的数组值](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md) + +#### 第 172 场周赛(2020-01-19 10:30, 90 分钟) 参赛人数 1415 + +- [1323. 6 和 9 组成的最大数字](/solution/1300-1399/1323.Maximum%2069%20Number/README.md) +- [1324. 竖直打印单词](/solution/1300-1399/1324.Print%20Words%20Vertically/README.md) +- [1325. 删除给定值的叶子节点](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README.md) +- [1326. 灌溉花园的最少水龙头数目](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md) + +#### 第 171 场周赛(2020-01-12 10:30, 90 分钟) 参赛人数 1708 + +- [1317. 将整数转换为两个无零整数的和](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README.md) +- [1318. 或运算的最小翻转次数](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README.md) +- [1319. 连通网络的操作次数](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README.md) +- [1320. 二指输入的的最小距离](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README.md) + +#### 第 17 场双周赛(2020-01-11 22:30, 90 分钟) 参赛人数 897 + +- [1313. 解压缩编码列表](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README.md) +- [1314. 矩阵区域和](/solution/1300-1399/1314.Matrix%20Block%20Sum/README.md) +- [1315. 祖父节点值为偶数的节点和](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README.md) +- [1316. 不同的循环子字符串](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README.md) + +#### 第 170 场周赛(2020-01-05 10:30, 90 分钟) 参赛人数 1649 + +- [1309. 解码字母到整数映射](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README.md) +- [1310. 子数组异或查询](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README.md) +- [1311. 获取你好友已观看的视频](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README.md) +- [1312. 让字符串成为回文串的最少插入次数](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md) + +#### 第 169 场周赛(2019-12-29 10:30, 90 分钟) 参赛人数 1568 + +- [1304. 和为零的 N 个不同整数](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README.md) +- [1305. 两棵二叉搜索树中的所有元素](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README.md) +- [1306. 跳跃游戏 III](/solution/1300-1399/1306.Jump%20Game%20III/README.md) +- [1307. 口算难题](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README.md) + +#### 第 16 场双周赛(2019-12-28 22:30, 90 分钟) 参赛人数 822 + +- [1299. 将每个元素替换为右侧最大元素](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README.md) +- [1300. 转变数组后最接近目标值的数组和](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README.md) +- [1302. 层数最深叶子节点的和](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README.md) +- [1301. 最大得分的路径数目](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README.md) + +#### 第 168 场周赛(2019-12-22 10:30, 90 分钟) 参赛人数 1553 + +- [1295. 统计位数为偶数的数字](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README.md) +- [1296. 划分数组为连续数字的集合](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README.md) +- [1297. 子串的最大出现次数](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README.md) +- [1298. 你能从盒子里获得的最大糖果数](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README.md) + +#### 第 167 场周赛(2019-12-15 10:30, 90 分钟) 参赛人数 1537 + +- [1290. 二进制链表转整数](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README.md) +- [1291. 顺次数](/solution/1200-1299/1291.Sequential%20Digits/README.md) +- [1292. 元素和小于等于阈值的正方形的最大边长](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README.md) +- [1293. 网格中的最短路径](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md) + +#### 第 15 场双周赛(2019-12-14 22:30, 90 分钟) 参赛人数 797 + +- [1287. 有序数组中出现次数超过 25%的元素](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README.md) +- [1288. 删除被覆盖区间](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README.md) +- [1286. 字母组合迭代器](/solution/1200-1299/1286.Iterator%20for%20Combination/README.md) +- [1289. 下降路径最小和 II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README.md) + +#### 第 166 场周赛(2019-12-08 10:30, 90 分钟) 参赛人数 1676 + +- [1281. 整数的各位积和之差](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README.md) +- [1282. 用户分组](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README.md) +- [1283. 使结果不超过阈值的最小除数](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README.md) +- [1284. 转化为全零矩阵的最少反转次数](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README.md) + +#### 第 165 场周赛(2019-12-01 10:30, 90 分钟) 参赛人数 1660 + +- [1275. 找出井字棋的获胜者](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README.md) +- [1276. 不浪费原料的汉堡制作方案](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README.md) +- [1277. 统计全为 1 的正方形子矩阵](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README.md) +- [1278. 分割回文串 III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README.md) + +#### 第 14 场双周赛(2019-11-30 22:30, 90 分钟) 参赛人数 871 + +- [1271. 十六进制魔术数字](/solution/1200-1299/1271.Hexspeak/README.md) +- [1272. 删除区间](/solution/1200-1299/1272.Remove%20Interval/README.md) +- [1273. 删除树节点](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md) +- [1274. 矩形内船只的数目](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md) + +#### 第 164 场周赛(2019-11-24 10:30, 90 分钟) 参赛人数 1676 + +- [1266. 访问所有点的最小时间](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README.md) +- [1267. 统计参与通信的服务器](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README.md) +- [1268. 搜索推荐系统](/solution/1200-1299/1268.Search%20Suggestions%20System/README.md) +- [1269. 停在原地的方案数](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README.md) + +#### 第 163 场周赛(2019-11-17 10:30, 90 分钟) 参赛人数 1605 + +- [1260. 二维网格迁移](/solution/1200-1299/1260.Shift%202D%20Grid/README.md) +- [1261. 在受污染的二叉树中查找元素](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README.md) +- [1262. 可被三整除的最大和](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README.md) +- [1263. 推箱子](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README.md) + +#### 第 13 场双周赛(2019-11-16 22:30, 90 分钟) 参赛人数 810 + +- [1256. 加密数字](/solution/1200-1299/1256.Encode%20Number/README.md) +- [1257. 最小公共区域](/solution/1200-1299/1257.Smallest%20Common%20Region/README.md) +- [1258. 近义词句子](/solution/1200-1299/1258.Synonymous%20Sentences/README.md) +- [1259. 不相交的握手](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md) + +#### 第 162 场周赛(2019-11-10 10:30, 90 分钟) 参赛人数 1569 + +- [1252. 奇数值单元格的数目](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README.md) +- [1253. 重构 2 行二进制矩阵](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README.md) +- [1254. 统计封闭岛屿的数目](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README.md) +- [1255. 得分最高的单词集合](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README.md) + +#### 第 161 场周赛(2019-11-03 10:30, 90 分钟) 参赛人数 1610 + +- [1247. 交换字符使得字符串相同](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README.md) +- [1248. 统计「优美子数组」](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README.md) +- [1249. 移除无效的括号](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md) +- [1250. 检查「好数组」](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README.md) + +#### 第 12 场双周赛(2019-11-02 22:30, 90 分钟) 参赛人数 911 + +- [1244. 力扣排行榜](/solution/1200-1299/1244.Design%20A%20Leaderboard/README.md) +- [1243. 数组变换](/solution/1200-1299/1243.Array%20Transformation/README.md) +- [1245. 树的直径](/solution/1200-1299/1245.Tree%20Diameter/README.md) +- [1246. 删除回文子数组](/solution/1200-1299/1246.Palindrome%20Removal/README.md) + +#### 第 160 场周赛(2019-10-27 10:30, 90 分钟) 参赛人数 1692 + +- [1237. 找出给定方程的正整数解](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README.md) +- [1238. 循环码排列](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README.md) +- [1239. 串联字符串的最大长度](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README.md) +- [1240. 铺瓷砖](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README.md) + +#### 第 159 场周赛(2019-10-20 10:30, 90 分钟) 参赛人数 1634 + +- [1232. 缀点成线](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README.md) +- [1233. 删除子文件夹](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README.md) +- [1234. 替换子串得到平衡字符串](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README.md) +- [1235. 规划兼职工作](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md) + +#### 第 11 场双周赛(2019-10-19 22:30, 90 分钟) 参赛人数 913 + +- [1228. 等差数列中缺失的数字](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md) +- [1229. 安排会议日程](/solution/1200-1299/1229.Meeting%20Scheduler/README.md) +- [1230. 抛掷硬币](/solution/1200-1299/1230.Toss%20Strange%20Coins/README.md) +- [1231. 分享巧克力](/solution/1200-1299/1231.Divide%20Chocolate/README.md) + +#### 第 158 场周赛(2019-10-13 10:30, 90 分钟) 参赛人数 1716 + +- [1221. 分割平衡字符串](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README.md) +- [1222. 可以攻击国王的皇后](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README.md) +- [1223. 掷骰子模拟](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README.md) +- [1224. 最大相等频率](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README.md) + +#### 第 157 场周赛(2019-10-06 10:30, 90 分钟) 参赛人数 1217 + +- [1217. 玩筹码](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README.md) +- [1218. 最长定差子序列](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README.md) +- [1219. 黄金矿工](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md) +- [1220. 统计元音字母序列的数目](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README.md) + +#### 第 10 场双周赛(2019-10-05 22:30, 90 分钟) 参赛人数 738 + +- [1213. 三个有序数组的交集](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md) +- [1214. 查找两棵二叉搜索树之和](/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md) +- [1215. 步进数](/solution/1200-1299/1215.Stepping%20Numbers/README.md) +- [1216. 验证回文串 III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README.md) + +#### 第 156 场周赛(2019-09-29 10:30, 90 分钟) 参赛人数 1433 + +- [1207. 独一无二的出现次数](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README.md) +- [1208. 尽可能使字符串相等](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README.md) +- [1209. 删除字符串中的所有相邻重复项 II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README.md) +- [1210. 穿过迷宫的最少移动次数](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README.md) + +#### 第 155 场周赛(2019-09-22 10:30, 90 分钟) 参赛人数 1603 + +- [1200. 最小绝对差](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README.md) +- [1201. 丑数 III](/solution/1200-1299/1201.Ugly%20Number%20III/README.md) +- [1202. 交换字符串中的元素](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md) +- [1203. 项目管理](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README.md) + +#### 第 9 场双周赛(2019-09-21 22:30, 95 分钟) 参赛人数 929 + +- [1196. 最多可以买到的苹果数量](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md) +- [1197. 进击的骑士](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md) +- [1198. 找出所有行中最小公共元素](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md) +- [1199. 建造街区的最短时间](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README.md) + +#### 第 154 场周赛(2019-09-15 10:30, 90 分钟) 参赛人数 1299 + +- [1189. “气球” 的最大数量](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README.md) +- [1190. 反转每对括号间的子串](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README.md) +- [1191. K 次串联后最大子数组之和](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README.md) +- [1192. 查找集群内的关键连接](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README.md) + +#### 第 153 场周赛(2019-09-08 10:30, 90 分钟) 参赛人数 1434 + +- [1184. 公交站间的距离](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README.md) +- [1185. 一周中的第几天](/solution/1100-1199/1185.Day%20of%20the%20Week/README.md) +- [1186. 删除一次得到子数组最大和](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README.md) +- [1187. 使数组严格递增](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README.md) + +#### 第 8 场双周赛(2019-09-07 22:30, 90 分钟) 参赛人数 630 + +- [1180. 统计只含单一字母的子串](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md) +- [1181. 前后拼接](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md) +- [1182. 与目标颜色间的最短距离](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md) +- [1183. 矩阵中 1 的最大数量](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md) + +#### 第 152 场周赛(2019-09-01 10:30, 90 分钟) 参赛人数 1367 + +- [1175. 质数排列](/solution/1100-1199/1175.Prime%20Arrangements/README.md) +- [1176. 健身计划评估](/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md) +- [1177. 构建回文串检测](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README.md) +- [1178. 猜字谜](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README.md) + +#### 第 151 场周赛(2019-08-25 10:30, 90 分钟) 参赛人数 1341 + +- [1169. 查询无效交易](/solution/1100-1199/1169.Invalid%20Transactions/README.md) +- [1170. 比较字符串最小字母出现频次](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README.md) +- [1171. 从链表中删去总和值为零的连续节点](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README.md) +- [1172. 餐盘栈](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README.md) + +#### 第 7 场双周赛(2019-08-24 22:30, 90 分钟) 参赛人数 561 + +- [1165. 单行键盘](/solution/1100-1199/1165.Single-Row%20Keyboard/README.md) +- [1166. 设计文件系统](/solution/1100-1199/1166.Design%20File%20System/README.md) +- [1167. 连接木棍的最低费用](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md) +- [1168. 水资源分配优化](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md) + +#### 第 150 场周赛(2019-08-18 10:30, 90 分钟) 参赛人数 1473 + +- [1160. 拼写单词](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README.md) +- [1161. 最大层内元素和](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README.md) +- [1162. 地图分析](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README.md) +- [1163. 按字典序排在最后的子串](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README.md) + +#### 第 149 场周赛(2019-08-11 10:30, 90 分钟) 参赛人数 1351 + +- [1154. 一年中的第几天](/solution/1100-1199/1154.Day%20of%20the%20Year/README.md) +- [1155. 掷骰子等于目标和的方法数](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md) +- [1156. 单字符重复子串的最大长度](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README.md) +- [1157. 子数组中占绝大多数的元素](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README.md) + +#### 第 6 场双周赛(2019-08-10 22:30, 90 分钟) 参赛人数 513 + +- [1150. 检查一个数是否在数组中占绝大多数](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md) +- [1151. 最少交换次数来组合所有的 1](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md) +- [1152. 用户网站访问行为分析](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md) +- [1153. 字符串转化](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README.md) + +#### 第 148 场周赛(2019-08-04 10:30, 90 分钟) 参赛人数 1251 + +- [1144. 递减元素使数组呈锯齿状](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README.md) +- [1145. 二叉树着色游戏](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README.md) +- [1146. 快照数组](/solution/1100-1199/1146.Snapshot%20Array/README.md) +- [1147. 段式回文](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README.md) + +#### 第 147 场周赛(2019-07-28 10:30, 90 分钟) 参赛人数 1132 + +- [1137. 第 N 个泰波那契数](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md) +- [1138. 字母板上的路径](/solution/1100-1199/1138.Alphabet%20Board%20Path/README.md) +- [1139. 最大的以 1 为边界的正方形](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md) +- [1140. 石子游戏 II](/solution/1100-1199/1140.Stone%20Game%20II/README.md) + +#### 第 5 场双周赛(2019-07-27 22:30, 90 分钟) 参赛人数 495 + +- [1133. 最大唯一数](/solution/1100-1199/1133.Largest%20Unique%20Number/README.md) +- [1134. 阿姆斯特朗数](/solution/1100-1199/1134.Armstrong%20Number/README.md) +- [1135. 最低成本连通所有城市](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md) +- [1136. 并行课程](/solution/1100-1199/1136.Parallel%20Courses/README.md) + +#### 第 146 场周赛(2019-07-21 10:30, 90 分钟) 参赛人数 1189 + +- [1128. 等价多米诺骨牌对的数量](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README.md) +- [1129. 颜色交替的最短路径](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README.md) +- [1130. 叶值的最小代价生成树](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README.md) +- [1131. 绝对值表达式的最大值](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md) + +#### 第 145 场周赛(2019-07-14 10:30, 90 分钟) 参赛人数 1114 + +- [1122. 数组的相对排序](/solution/1100-1199/1122.Relative%20Sort%20Array/README.md) +- [1123. 最深叶节点的最近公共祖先](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README.md) +- [1124. 表现良好的最长时间段](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README.md) +- [1125. 最小的必要团队](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README.md) + +#### 第 4 场双周赛(2019-07-13 22:30, 90 分钟) 参赛人数 438 + +- [1118. 一月有多少天](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md) +- [1119. 删去字符串中的元音](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md) +- [1120. 子树的最大平均值](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md) +- [1121. 将数组分成几个递增序列](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README.md) + +#### 第 144 场周赛(2019-07-07 10:30, 90 分钟) 参赛人数 777 + +- [1108. IP 地址无效化](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README.md) +- [1109. 航班预订统计](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README.md) +- [1110. 删点成林](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README.md) +- [1111. 有效括号的嵌套深度](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README.md) + +#### 第 143 场周赛(2019-06-30 10:30, 90 分钟) 参赛人数 803 + +- [1103. 分糖果 II](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README.md) +- [1104. 二叉树寻路](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README.md) +- [1105. 填充书架](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README.md) +- [1106. 解析布尔表达式](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README.md) + +#### 第 3 场双周赛(2019-06-29 22:30, 90 分钟) 参赛人数 312 + +- [1099. 小于 K 的两数之和](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md) +- [1100. 长度为 K 的无重复字符子串](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md) +- [1101. 彼此熟识的最早时间](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md) +- [1102. 得分最高的路径](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md) + +#### 第 142 场周赛(2019-06-23 10:30, 90 分钟) 参赛人数 801 + +- [1093. 大样本统计](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README.md) +- [1094. 拼车](/solution/1000-1099/1094.Car%20Pooling/README.md) +- [1095. 山脉数组中查找目标值](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README.md) +- [1096. 花括号展开 II](/solution/1000-1099/1096.Brace%20Expansion%20II/README.md) + +#### 第 141 场周赛(2019-06-16 10:30, 90 分钟) 参赛人数 763 + +- [1089. 复写零](/solution/1000-1099/1089.Duplicate%20Zeros/README.md) +- [1090. 受标签影响的最大值](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README.md) +- [1091. 二进制矩阵中的最短路径](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md) +- [1092. 最短公共超序列](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README.md) + +#### 第 2 场双周赛(2019-06-15 22:30, 90 分钟) 参赛人数 256 + +- [1085. 最小元素各数位之和](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md) +- [1086. 前五科的均分](/solution/1000-1099/1086.High%20Five/README.md) +- [1087. 花括号展开](/solution/1000-1099/1087.Brace%20Expansion/README.md) +- [1088. 易混淆数 II](/solution/1000-1099/1088.Confusing%20Number%20II/README.md) + +#### 第 140 场周赛(2019-06-09 10:30, 90 分钟) 参赛人数 660 + +- [1078. Bigram 分词](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README.md) +- [1079. 活字印刷](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README.md) +- [1080. 根到叶路径上的不足节点](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README.md) +- [1081. 不同字符的最小子序列](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README.md) + +#### 第 139 场周赛(2019-06-02 10:30, 90 分钟) 参赛人数 785 + +- [1071. 字符串的最大公因子](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README.md) +- [1072. 按列翻转得到最大值等行数](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md) +- [1073. 负二进制数相加](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md) +- [1074. 元素和为目标值的子矩阵数量](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md) + +#### 第 1 场双周赛(2019-06-01 22:30, 120 分钟) 参赛人数 197 + +- [1064. 不动点](/solution/1000-1099/1064.Fixed%20Point/README.md) +- [1065. 字符串的索引对](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md) +- [1066. 校园自行车分配 II](/solution/1000-1099/1066.Campus%20Bikes%20II/README.md) +- [1067. 范围内的数字计数](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README.md) + +#### 第 138 场周赛(2019-05-26 10:30, 90 分钟) 参赛人数 752 + +- [1051. 高度检查器](/solution/1000-1099/1051.Height%20Checker/README.md) +- [1052. 爱生气的书店老板](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README.md) +- [1053. 交换一次的先前排列](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README.md) +- [1054. 距离相等的条形码](/solution/1000-1099/1054.Distant%20Barcodes/README.md) + +#### 第 137 场周赛(2019-05-19 10:30, 90 分钟) 参赛人数 766 + +- [1046. 最后一块石头的重量](/solution/1000-1099/1046.Last%20Stone%20Weight/README.md) +- [1047. 删除字符串中的所有相邻重复项](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README.md) +- [1048. 最长字符串链](/solution/1000-1099/1048.Longest%20String%20Chain/README.md) +- [1049. 最后一块石头的重量 II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md) + +#### 第 136 场周赛(2019-05-12 10:30, 90 分钟) 参赛人数 790 + +- [1041. 困于环中的机器人](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README.md) +- [1042. 不邻接植花](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README.md) +- [1043. 分隔数组以得到最大和](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README.md) +- [1044. 最长重复子串](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md) + +#### 第 135 场周赛(2019-05-05 10:30, 90 分钟) 参赛人数 548 + +- [1037. 有效的回旋镖](/solution/1000-1099/1037.Valid%20Boomerang/README.md) +- [1038. 从二叉搜索树到更大和树](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README.md) +- [1039. 多边形三角剖分的最低得分](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md) +- [1040. 移动石子直到连续 II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README.md) + +#### 第 134 场周赛(2019-04-28 10:30, 90 分钟) 参赛人数 728 + +- [1033. 移动石子直到连续](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README.md) +- [1034. 边界着色](/solution/1000-1099/1034.Coloring%20A%20Border/README.md) +- [1035. 不相交的线](/solution/1000-1099/1035.Uncrossed%20Lines/README.md) +- [1036. 逃离大迷宫](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README.md) + +#### 第 133 场周赛(2019-04-21 10:30, 90 分钟) 参赛人数 999 + +- [1029. 两地调度](/solution/1000-1099/1029.Two%20City%20Scheduling/README.md) +- [1030. 距离顺序排列矩阵单元格](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README.md) +- [1031. 两个非重叠子数组的最大和](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README.md) +- [1032. 字符流](/solution/1000-1099/1032.Stream%20of%20Characters/README.md) + +#### 第 132 场周赛(2019-04-14 10:30, 90 分钟) 参赛人数 1050 + +- [1025. 除数博弈](/solution/1000-1099/1025.Divisor%20Game/README.md) +- [1026. 节点与其祖先之间的最大差值](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README.md) +- [1027. 最长等差数列](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README.md) +- [1028. 从先序遍历还原二叉树](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README.md) + +#### 第 131 场周赛(2019-04-07 10:30, 90 分钟) 参赛人数 918 + +- [1021. 删除最外层的括号](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md) +- [1022. 从根到叶的二进制数之和](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README.md) +- [1023. 驼峰式匹配](/solution/1000-1099/1023.Camelcase%20Matching/README.md) +- [1024. 视频拼接](/solution/1000-1099/1024.Video%20Stitching/README.md) + +#### 第 130 场周赛(2019-03-31 10:30, 90 分钟) 参赛人数 1294 + +- [1018. 可被 5 整除的二进制前缀](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README.md) +- [1017. 负二进制转换](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md) +- [1019. 链表中的下一个更大节点](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README.md) +- [1020. 飞地的数量](/solution/1000-1099/1020.Number%20of%20Enclaves/README.md) + +#### 第 129 场周赛(2019-03-24 09:30, 90 分钟) 参赛人数 759 + +- [1013. 将数组分成和相等的三个部分](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README.md) +- [1015. 可被 K 整除的最小整数](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README.md) +- [1014. 最佳观光组合](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README.md) +- [1016. 子串能表示从 1 到 N 数字的二进制串](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README.md) + +#### 第 128 场周赛(2019-03-17 10:30, 90 分钟) 参赛人数 1251 + +- [1009. 十进制整数的反码](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README.md) +- [1010. 总持续时间可被 60 整除的歌曲](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README.md) +- [1011. 在 D 天内送达包裹的能力](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README.md) +- [1012. 至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md) + +#### 第 127 场周赛(2019-03-10 10:30, 90 分钟) 参赛人数 664 + +- [1005. K 次取反后最大化的数组和](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README.md) +- [1006. 笨阶乘](/solution/1000-1099/1006.Clumsy%20Factorial/README.md) +- [1007. 行相等的最少多米诺旋转](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README.md) +- [1008. 前序遍历构造二叉搜索树](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README.md) + +#### 第 126 场周赛(2019-03-03 10:30, 90 分钟) 参赛人数 591 + +- [1002. 查找共用字符](/solution/1000-1099/1002.Find%20Common%20Characters/README.md) +- [1003. 检查替换后的词是否有效](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README.md) +- [1004. 最大连续 1 的个数 III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md) +- [1000. 合并石头的最低成本](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README.md) + +#### 第 125 场周赛(2019-02-24 10:30, 90 分钟) 参赛人数 469 + +- [0997. 找到小镇的法官](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README.md) +- [0999. 可以被一步捕获的棋子数](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README.md) +- [0998. 最大二叉树 II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README.md) +- [1001. 网格照明](/solution/1000-1099/1001.Grid%20Illumination/README.md) + +#### 第 124 场周赛(2019-02-17 10:30, 90 分钟) 参赛人数 417 + +- [0993. 二叉树的堂兄弟节点](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README.md) +- [0994. 腐烂的橘子](/solution/0900-0999/0994.Rotting%20Oranges/README.md) +- [0995. K 连续位的最小翻转次数](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README.md) +- [0996. 平方数组的数目](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README.md) + +#### 第 123 场周赛(2019-02-10 10:30, 90 分钟) 参赛人数 247 + +- [0989. 数组形式的整数加法](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md) +- [0990. 等式方程的可满足性](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md) +- [0991. 坏了的计算器](/solution/0900-0999/0991.Broken%20Calculator/README.md) +- [0992. K 个不同整数的子数组](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md) + +#### 第 122 场周赛(2019-02-03 10:30, 90 分钟) 参赛人数 280 + +- [0985. 查询后的偶数和](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README.md) +- [0988. 从叶结点开始的最小字符串](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md) +- [0986. 区间列表的交集](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md) +- [0987. 二叉树的垂序遍历](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md) + +#### 第 121 场周赛(2019-01-27 10:30, 90 分钟) 参赛人数 384 + +- [0984. 不含 AAA 或 BBB 的字符串](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README.md) +- [0981. 基于时间的键值存储](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README.md) +- [0983. 最低票价](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README.md) +- [0982. 按位与为零的三元组](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README.md) + +#### 第 120 场周赛(2019-01-20 10:30, 90 分钟) 参赛人数 382 + +- [0977. 有序数组的平方](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README.md) +- [0978. 最长湍流子数组](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README.md) +- [0979. 在二叉树中分配硬币](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README.md) +- [0980. 不同路径 III](/solution/0900-0999/0980.Unique%20Paths%20III/README.md) + +#### 第 119 场周赛(2019-01-13 10:30, 90 分钟) 参赛人数 513 + +- [0973. 最接近原点的 K 个点](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README.md) +- [0976. 三角形的最大周长](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README.md) +- [0974. 和可被 K 整除的子数组](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README.md) +- [0975. 奇偶跳](/solution/0900-0999/0975.Odd%20Even%20Jump/README.md) + +#### 第 118 场周赛(2019-01-06 10:30, 90 分钟) 参赛人数 383 + +- [0970. 强整数](/solution/0900-0999/0970.Powerful%20Integers/README.md) +- [0969. 煎饼排序](/solution/0900-0999/0969.Pancake%20Sorting/README.md) +- [0971. 翻转二叉树以匹配先序遍历](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README.md) +- [0972. 相等的有理数](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README.md) + +#### 第 117 场周赛(2018-12-30 10:30, 90 分钟) 参赛人数 657 + +- [0965. 单值二叉树](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README.md) +- [0967. 连续差相同的数字](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README.md) +- [0966. 元音拼写检查器](/solution/0900-0999/0966.Vowel%20Spellchecker/README.md) +- [0968. 监控二叉树](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README.md) + +#### 第 116 场周赛(2018-12-23 10:30, 90 分钟) 参赛人数 369 + +- [0961. 在长度 2N 的数组中找出重复 N 次的元素](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README.md) +- [0962. 最大宽度坡](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md) +- [0963. 最小面积矩形 II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README.md) +- [0964. 表示数字的最少运算符](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README.md) + +#### 第 115 场周赛(2018-12-16 10:30, 90 分钟) 参赛人数 383 + +- [0957. N 天后的牢房](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README.md) +- [0958. 二叉树的完全性检验](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README.md) +- [0959. 由斜杠划分区域](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md) +- [0960. 删列造序 III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md) + +#### 第 114 场周赛(2018-12-09 10:30, 90 分钟) 参赛人数 391 + +- [0953. 验证外星语词典](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README.md) +- [0954. 二倍数对数组](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README.md) +- [0955. 删列造序 II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README.md) +- [0956. 最高的广告牌](/solution/0900-0999/0956.Tallest%20Billboard/README.md) + +#### 第 113 场周赛(2018-12-02 10:30, 90 分钟) 参赛人数 462 + +- [0949. 给定数字能组成的最大时间](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README.md) +- [0951. 翻转等价二叉树](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README.md) +- [0950. 按递增顺序显示卡牌](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README.md) +- [0952. 按公因数计算最大组件大小](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README.md) + +#### 第 112 场周赛(2018-11-25 10:30, 90 分钟) 参赛人数 299 + +- [0945. 使数组唯一的最小增量](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README.md) +- [0946. 验证栈序列](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README.md) +- [0947. 移除最多的同行或同列石头](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README.md) +- [0948. 令牌放置](/solution/0900-0999/0948.Bag%20of%20Tokens/README.md) + +#### 第 111 场周赛(2018-11-18 10:30, 90 分钟) 参赛人数 353 + +- [0941. 有效的山脉数组](/solution/0900-0999/0941.Valid%20Mountain%20Array/README.md) +- [0944. 删列造序](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README.md) +- [0942. 增减字符串匹配](/solution/0900-0999/0942.DI%20String%20Match/README.md) +- [0943. 最短超级串](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README.md) + +#### 第 110 场周赛(2018-11-11 10:30, 90 分钟) 参赛人数 346 + +- [0937. 重新排列日志文件](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README.md) +- [0938. 二叉搜索树的范围和](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README.md) +- [0939. 最小面积矩形](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README.md) +- [0940. 不同的子序列 II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md) + +#### 第 109 场周赛(2018-11-04 09:30, 90 分钟) 参赛人数 439 + +- [0933. 最近的请求次数](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md) +- [0935. 骑士拨号器](/solution/0900-0999/0935.Knight%20Dialer/README.md) +- [0934. 最短的桥](/solution/0900-0999/0934.Shortest%20Bridge/README.md) +- [0936. 戳印序列](/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md) + +#### 第 108 场周赛(2018-10-28 09:30, 90 分钟) 参赛人数 524 + +- [0929. 独特的电子邮件地址](/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md) +- [0930. 和相同的二元子数组](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md) +- [0931. 下降路径最小和](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md) +- [0932. 漂亮数组](/solution/0900-0999/0932.Beautiful%20Array/README.md) + +#### 第 107 场周赛(2018-10-21 09:30, 90 分钟) 参赛人数 504 + +- [0925. 长按键入](/solution/0900-0999/0925.Long%20Pressed%20Name/README.md) +- [0926. 将字符串翻转到单调递增](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md) +- [0927. 三等分](/solution/0900-0999/0927.Three%20Equal%20Parts/README.md) +- [0928. 尽量减少恶意软件的传播 II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md) + +#### 第 106 场周赛(2018-10-14 09:30, 90 分钟) 参赛人数 369 + +- [0922. 按奇偶排序数组 II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README.md) +- [0921. 使括号有效的最少添加](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README.md) +- [0923. 三数之和的多种可能](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md) +- [0924. 尽量减少恶意软件的传播](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md) + +#### 第 105 场周赛(2018-10-07 09:30, 90 分钟) 参赛人数 393 + +- [0917. 仅仅反转字母](/solution/0900-0999/0917.Reverse%20Only%20Letters/README.md) +- [0918. 环形子数组的最大和](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md) +- [0919. 完全二叉树插入器](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README.md) +- [0920. 播放列表的数量](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README.md) + +#### 第 104 场周赛(2018-09-30 09:30, 90 分钟) 参赛人数 354 + +- [0914. 卡牌分组](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md) +- [0915. 分割数组](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md) +- [0916. 单词子集](/solution/0900-0999/0916.Word%20Subsets/README.md) +- [0913. 猫和老鼠](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md) + +#### 第 103 场周赛(2018-09-23 09:30, 90 分钟) 参赛人数 575 + +- [0908. 最小差值 I](/solution/0900-0999/0908.Smallest%20Range%20I/README.md) +- [0909. 蛇梯棋](/solution/0900-0999/0909.Snakes%20and%20Ladders/README.md) +- [0910. 最小差值 II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md) +- [0911. 在线选举](/solution/0900-0999/0911.Online%20Election/README.md) + +#### 第 102 场周赛(2018-09-16 09:30, 90 分钟) 参赛人数 660 + +- [0905. 按奇偶排序数组](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README.md) +- [0904. 水果成篮](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README.md) +- [0907. 子数组的最小值之和](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md) +- [0906. 超级回文数](/solution/0900-0999/0906.Super%20Palindromes/README.md) + +#### 第 101 场周赛(2018-09-09 09:30, 105 分钟) 参赛人数 854 + +- [0900. RLE 迭代器](/solution/0900-0999/0900.RLE%20Iterator/README.md) +- [0901. 股票价格跨度](/solution/0900-0999/0901.Online%20Stock%20Span/README.md) +- [0902. 最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md) +- [0903. DI 序列的有效排列](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README.md) + +#### 第 100 场周赛(2018-09-02 09:30, 90 分钟) 参赛人数 718 + +- [0896. 单调数列](/solution/0800-0899/0896.Monotonic%20Array/README.md) +- [0897. 递增顺序搜索树](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README.md) +- [0898. 子数组按位或操作](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README.md) +- [0899. 有序队列](/solution/0800-0899/0899.Orderly%20Queue/README.md) + +#### 第 99 场周赛(2018-08-26 09:30, 90 分钟) 参赛人数 725 + +- [0892. 三维形体的表面积](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README.md) +- [0893. 特殊等价字符串组](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README.md) +- [0894. 所有可能的真二叉树](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README.md) +- [0895. 最大频率栈](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README.md) + +#### 第 98 场周赛(2018-08-19 09:30, 90 分钟) 参赛人数 670 + +- [0888. 公平的糖果交换](/solution/0800-0899/0888.Fair%20Candy%20Swap/README.md) +- [0890. 查找和替换模式](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README.md) +- [0889. 根据前序和后序遍历构造二叉树](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README.md) +- [0891. 子序列宽度之和](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README.md) + +#### 第 97 场周赛(2018-08-12 09:30, 90 分钟) 参赛人数 635 + +- [0884. 两句话中的不常见单词](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README.md) +- [0885. 螺旋矩阵 III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README.md) +- [0886. 可能的二分法](/solution/0800-0899/0886.Possible%20Bipartition/README.md) +- [0887. 鸡蛋掉落](/solution/0800-0899/0887.Super%20Egg%20Drop/README.md) + +#### 第 96 场周赛(2018-08-05 09:30, 90 分钟) 参赛人数 789 + +- [0883. 三维形体投影面积](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README.md) +- [0881. 救生艇](/solution/0800-0899/0881.Boats%20to%20Save%20People/README.md) +- [0880. 索引处的解码字符串](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README.md) +- [0882. 细分图中的可到达节点](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README.md) + +#### 第 95 场周赛(2018-07-29 09:30, 90 分钟) 参赛人数 831 + +- [0876. 链表的中间结点](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README.md) +- [0877. 石子游戏](/solution/0800-0899/0877.Stone%20Game/README.md) +- [0878. 第 N 个神奇数字](/solution/0800-0899/0878.Nth%20Magical%20Number/README.md) +- [0879. 盈利计划](/solution/0800-0899/0879.Profitable%20Schemes/README.md) + +#### 第 94 场周赛(2018-07-22 09:30, 90 分钟) 参赛人数 733 + +- [0872. 叶子相似的树](/solution/0800-0899/0872.Leaf-Similar%20Trees/README.md) +- [0874. 模拟行走机器人](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README.md) +- [0875. 爱吃香蕉的珂珂](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README.md) +- [0873. 最长的斐波那契子序列的长度](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README.md) + +#### 第 93 场周赛(2018-07-15 09:30, 90 分钟) 参赛人数 732 + +- [0868. 二进制间距](/solution/0800-0899/0868.Binary%20Gap/README.md) +- [0869. 重新排序得到 2 的幂](/solution/0800-0899/0869.Reordered%20Power%20of%202/README.md) +- [0870. 优势洗牌](/solution/0800-0899/0870.Advantage%20Shuffle/README.md) +- [0871. 最低加油次数](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README.md) + +#### 第 92 场周赛(2018-07-08 09:30, 90 分钟) 参赛人数 610 + +- [0867. 转置矩阵](/solution/0800-0899/0867.Transpose%20Matrix/README.md) +- [0865. 具有所有最深节点的最小子树](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README.md) +- [0866. 回文质数](/solution/0800-0899/0866.Prime%20Palindrome/README.md) +- [0864. 获取所有钥匙的最短路径](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README.md) + +#### 第 91 场周赛(2018-07-01 09:30, 90 分钟) 参赛人数 578 + +- [0860. 柠檬水找零](/solution/0800-0899/0860.Lemonade%20Change/README.md) +- [0863. 二叉树中所有距离为 K 的结点](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README.md) +- [0861. 翻转矩阵后的得分](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README.md) +- [0862. 和至少为 K 的最短子数组](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md) + +#### 第 90 场周赛(2018-06-24 09:30, 90 分钟) 参赛人数 573 + +- [0859. 亲密字符串](/solution/0800-0899/0859.Buddy%20Strings/README.md) +- [0856. 括号的分数](/solution/0800-0899/0856.Score%20of%20Parentheses/README.md) +- [0858. 镜面反射](/solution/0800-0899/0858.Mirror%20Reflection/README.md) +- [0857. 雇佣 K 名工人的最低成本](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md) + +#### 第 89 场周赛(2018-06-17 09:30, 90 分钟) 参赛人数 491 + +- [0852. 山脉数组的峰顶索引](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README.md) +- [0853. 车队](/solution/0800-0899/0853.Car%20Fleet/README.md) +- [0855. 考场就座](/solution/0800-0899/0855.Exam%20Room/README.md) +- [0854. 相似度为 K 的字符串](/solution/0800-0899/0854.K-Similar%20Strings/README.md) + +#### 第 88 场周赛(2018-06-10 09:30, 90 分钟) 参赛人数 404 + +- [0848. 字母移位](/solution/0800-0899/0848.Shifting%20Letters/README.md) +- [0849. 到最近的人的最大距离](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README.md) +- [0851. 喧闹和富有](/solution/0800-0899/0851.Loud%20and%20Rich/README.md) +- [0850. 矩形面积 II](/solution/0800-0899/0850.Rectangle%20Area%20II/README.md) + +#### 第 87 场周赛(2018-06-03 09:30, 90 分钟) 参赛人数 343 + +- [0844. 比较含退格的字符串](/solution/0800-0899/0844.Backspace%20String%20Compare/README.md) +- [0845. 数组中的最长山脉](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README.md) +- [0846. 一手顺子](/solution/0800-0899/0846.Hand%20of%20Straights/README.md) +- [0847. 访问所有节点的最短路径](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md) + +#### 第 86 场周赛(2018-05-27 09:30, 90 分钟) 参赛人数 377 + +- [0840. 矩阵中的幻方](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README.md) +- [0841. 钥匙和房间](/solution/0800-0899/0841.Keys%20and%20Rooms/README.md) +- [0842. 将数组拆分成斐波那契序列](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README.md) +- [0843. 猜猜这个单词](/solution/0800-0899/0843.Guess%20the%20Word/README.md) + +#### 第 85 场周赛(2018-05-20 09:30, 90 分钟) 参赛人数 467 + +- [0836. 矩形重叠](/solution/0800-0899/0836.Rectangle%20Overlap/README.md) +- [0838. 推多米诺](/solution/0800-0899/0838.Push%20Dominoes/README.md) +- [0837. 新 21 点](/solution/0800-0899/0837.New%2021%20Game/README.md) +- [0839. 相似字符串组](/solution/0800-0899/0839.Similar%20String%20Groups/README.md) + +#### 第 84 场周赛(2018-05-13 09:30, 90 分钟) 参赛人数 656 + +- [0832. 翻转图像](/solution/0800-0899/0832.Flipping%20an%20Image/README.md) +- [0833. 字符串中的查找与替换](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README.md) +- [0835. 图像重叠](/solution/0800-0899/0835.Image%20Overlap/README.md) +- [0834. 树中距离之和](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md) + +#### 第 83 场周赛(2018-05-06 09:30, 90 分钟) 参赛人数 58 + +- [0830. 较大分组的位置](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README.md) +- [0831. 隐藏个人信息](/solution/0800-0899/0831.Masking%20Personal%20Information/README.md) +- [0829. 连续整数求和](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README.md) +- [0828. 统计子串中的唯一字符](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README.md) diff --git a/solution/CONTEST_README_EN.md b/solution/CONTEST_README_EN.md index 408d71b7a5f82..38689dea32a14 100644 --- a/solution/CONTEST_README_EN.md +++ b/solution/CONTEST_README_EN.md @@ -1,3194 +1,3194 @@ ---- -comments: true ---- - -# LeetCode Contest - -[中文文档](/solution/CONTEST_README.md) - -## Contest Rating & Badge - -The contest badge is calculated based on the contest rating. - -For LeetCoders with rating >=1600, -If you are in the top 5% of the contest rating, you’ll get the “Guardian” badge. - -If you are in the top 25% of the contest rating, you’ll get the “Knight” badge. - -| Level | Proportion | Badge | Rating | | -| ----- | ---------- | -------- | ----------- | ----------------------------------------------------------------------------------------------------------------------- | -| LV3 | 5\% | Guardian | ≥2228.90 |

| -| LV2 | 20\% | Knight | ≥1842.73 |

| -| LV1 | 75\% | - | - | - | - -For top 10 users (excluding LCCN users), your LeetCode ID will be colored orange on the ranking board. You'll also have the honor with you when you post/comment under discuss. - -## Rating Predictor - -If you want to estimate your score changes after the contest ends, you can visit the website [LeetCode Contest Rating Predictor](https://lccn.lbao.site/). - -## Past Contests - -#### Weekly Contest 402 - -- [3184. Count Pairs That Form a Complete Day I](/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README_EN.md) -- [3185. Count Pairs That Form a Complete Day II](/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README_EN.md) -- [3186. Maximum Total Damage With Spell Casting](/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README_EN.md) -- [3187. Peaks in Array](/solution/3100-3199/3187.Peaks%20in%20Array/README_EN.md) - -#### Weekly Contest 401 - -- [3178. Find the Child Who Has the Ball After K Seconds](/solution/3100-3199/3178.Find%20the%20Child%20Who%20Has%20the%20Ball%20After%20K%20Seconds/README_EN.md) -- [3179. Find the N-th Value After K Seconds](/solution/3100-3199/3179.Find%20the%20N-th%20Value%20After%20K%20Seconds/README_EN.md) -- [3180. Maximum Total Reward Using Operations I](/solution/3100-3199/3180.Maximum%20Total%20Reward%20Using%20Operations%20I/README_EN.md) -- [3181. Maximum Total Reward Using Operations II](/solution/3100-3199/3181.Maximum%20Total%20Reward%20Using%20Operations%20II/README_EN.md) - -#### Biweekly Contest 132 - -- [3174. Clear Digits](/solution/3100-3199/3174.Clear%20Digits/README_EN.md) -- [3175. Find The First Player to win K Games in a Row](/solution/3100-3199/3175.Find%20The%20First%20Player%20to%20win%20K%20Games%20in%20a%20Row/README_EN.md) -- [3176. Find the Maximum Length of a Good Subsequence I](/solution/3100-3199/3176.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20I/README_EN.md) -- [3177. Find the Maximum Length of a Good Subsequence II](/solution/3100-3199/3177.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20II/README_EN.md) - -#### Weekly Contest 400 - -- [3168. Minimum Number of Chairs in a Waiting Room](/solution/3100-3199/3168.Minimum%20Number%20of%20Chairs%20in%20a%20Waiting%20Room/README_EN.md) -- [3169. Count Days Without Meetings](/solution/3100-3199/3169.Count%20Days%20Without%20Meetings/README_EN.md) -- [3170. Lexicographically Minimum String After Removing Stars](/solution/3100-3199/3170.Lexicographically%20Minimum%20String%20After%20Removing%20Stars/README_EN.md) -- [3171. Find Subarray With Bitwise OR Closest to K](/solution/3100-3199/3171.Find%20Subarray%20With%20Bitwise%20OR%20Closest%20to%20K/README_EN.md) - -#### Weekly Contest 399 - -- [3162. Find the Number of Good Pairs I](/solution/3100-3199/3162.Find%20the%20Number%20of%20Good%20Pairs%20I/README_EN.md) -- [3163. String Compression III](/solution/3100-3199/3163.String%20Compression%20III/README_EN.md) -- [3164. Find the Number of Good Pairs II](/solution/3100-3199/3164.Find%20the%20Number%20of%20Good%20Pairs%20II/README_EN.md) -- [3165. Maximum Sum of Subsequence With Non-adjacent Elements](/solution/3100-3199/3165.Maximum%20Sum%20of%20Subsequence%20With%20Non-adjacent%20Elements/README_EN.md) - -#### Biweekly Contest 131 - -- [3158. Find the XOR of Numbers Which Appear Twice](/solution/3100-3199/3158.Find%20the%20XOR%20of%20Numbers%20Which%20Appear%20Twice/README_EN.md) -- [3159. Find Occurrences of an Element in an Array](/solution/3100-3199/3159.Find%20Occurrences%20of%20an%20Element%20in%20an%20Array/README_EN.md) -- [3160. Find the Number of Distinct Colors Among the Balls](/solution/3100-3199/3160.Find%20the%20Number%20of%20Distinct%20Colors%20Among%20the%20Balls/README_EN.md) -- [3161. Block Placement Queries](/solution/3100-3199/3161.Block%20Placement%20Queries/README_EN.md) - -#### Weekly Contest 398 - -- [3151. Special Array I](/solution/3100-3199/3151.Special%20Array%20I/README_EN.md) -- [3152. Special Array II](/solution/3100-3199/3152.Special%20Array%20II/README_EN.md) -- [3153. Sum of Digit Differences of All Pairs](/solution/3100-3199/3153.Sum%20of%20Digit%20Differences%20of%20All%20Pairs/README_EN.md) -- [3154. Find Number of Ways to Reach the K-th Stair](/solution/3100-3199/3154.Find%20Number%20of%20Ways%20to%20Reach%20the%20K-th%20Stair/README_EN.md) - -#### Weekly Contest 397 - -- [3146. Permutation Difference between Two Strings](/solution/3100-3199/3146.Permutation%20Difference%20between%20Two%20Strings/README_EN.md) -- [3147. Taking Maximum Energy From the Mystic Dungeon](/solution/3100-3199/3147.Taking%20Maximum%20Energy%20From%20the%20Mystic%20Dungeon/README_EN.md) -- [3148. Maximum Difference Score in a Grid](/solution/3100-3199/3148.Maximum%20Difference%20Score%20in%20a%20Grid/README_EN.md) -- [3149. Find the Minimum Cost Array Permutation](/solution/3100-3199/3149.Find%20the%20Minimum%20Cost%20Array%20Permutation/README_EN.md) - -#### Biweekly Contest 130 - -- [3142. Check if Grid Satisfies Conditions](/solution/3100-3199/3142.Check%20if%20Grid%20Satisfies%20Conditions/README_EN.md) -- [3143. Maximum Points Inside the Square](/solution/3100-3199/3143.Maximum%20Points%20Inside%20the%20Square/README_EN.md) -- [3144. Minimum Substring Partition of Equal Character Frequency](/solution/3100-3199/3144.Minimum%20Substring%20Partition%20of%20Equal%20Character%20Frequency/README_EN.md) -- [3145. Find Products of Elements of Big Array](/solution/3100-3199/3145.Find%20Products%20of%20Elements%20of%20Big%20Array/README_EN.md) - -#### Weekly Contest 396 - -- [3136. Valid Word](/solution/3100-3199/3136.Valid%20Word/README_EN.md) -- [3137. Minimum Number of Operations to Make Word K-Periodic](/solution/3100-3199/3137.Minimum%20Number%20of%20Operations%20to%20Make%20Word%20K-Periodic/README_EN.md) -- [3138. Minimum Length of Anagram Concatenation](/solution/3100-3199/3138.Minimum%20Length%20of%20Anagram%20Concatenation/README_EN.md) -- [3139. Minimum Cost to Equalize Array](/solution/3100-3199/3139.Minimum%20Cost%20to%20Equalize%20Array/README_EN.md) - -#### Weekly Contest 395 - -- [3131. Find the Integer Added to Array I](/solution/3100-3199/3131.Find%20the%20Integer%20Added%20to%20Array%20I/README_EN.md) -- [3132. Find the Integer Added to Array II](/solution/3100-3199/3132.Find%20the%20Integer%20Added%20to%20Array%20II/README_EN.md) -- [3133. Minimum Array End](/solution/3100-3199/3133.Minimum%20Array%20End/README_EN.md) -- [3134. Find the Median of the Uniqueness Array](/solution/3100-3199/3134.Find%20the%20Median%20of%20the%20Uniqueness%20Array/README_EN.md) - -#### Biweekly Contest 129 - -- [3127. Make a Square with the Same Color](/solution/3100-3199/3127.Make%20a%20Square%20with%20the%20Same%20Color/README_EN.md) -- [3128. Right Triangles](/solution/3100-3199/3128.Right%20Triangles/README_EN.md) -- [3129. Find All Possible Stable Binary Arrays I](/solution/3100-3199/3129.Find%20All%20Possible%20Stable%20Binary%20Arrays%20I/README_EN.md) -- [3130. Find All Possible Stable Binary Arrays II](/solution/3100-3199/3130.Find%20All%20Possible%20Stable%20Binary%20Arrays%20II/README_EN.md) - -#### Weekly Contest 394 - -- [3120. Count the Number of Special Characters I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README_EN.md) -- [3121. Count the Number of Special Characters II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README_EN.md) -- [3122. Minimum Number of Operations to Satisfy Conditions](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README_EN.md) -- [3123. Find Edges in Shortest Paths](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README_EN.md) - -#### Weekly Contest 393 - -- [3114. Latest Time You Can Obtain After Replacing Characters](/solution/3100-3199/3114.Latest%20Time%20You%20Can%20Obtain%20After%20Replacing%20Characters/README_EN.md) -- [3115. Maximum Prime Difference](/solution/3100-3199/3115.Maximum%20Prime%20Difference/README_EN.md) -- [3116. Kth Smallest Amount With Single Denomination Combination](/solution/3100-3199/3116.Kth%20Smallest%20Amount%20With%20Single%20Denomination%20Combination/README_EN.md) -- [3117. Minimum Sum of Values by Dividing Array](/solution/3100-3199/3117.Minimum%20Sum%20of%20Values%20by%20Dividing%20Array/README_EN.md) - -#### Biweekly Contest 128 - -- [3110. Score of a String](/solution/3100-3199/3110.Score%20of%20a%20String/README_EN.md) -- [3111. Minimum Rectangles to Cover Points](/solution/3100-3199/3111.Minimum%20Rectangles%20to%20Cover%20Points/README_EN.md) -- [3112. Minimum Time to Visit Disappearing Nodes](/solution/3100-3199/3112.Minimum%20Time%20to%20Visit%20Disappearing%20Nodes/README_EN.md) -- [3113. Find the Number of Subarrays Where Boundary Elements Are Maximum](/solution/3100-3199/3113.Find%20the%20Number%20of%20Subarrays%20Where%20Boundary%20Elements%20Are%20Maximum/README_EN.md) - -#### Weekly Contest 392 - -- [3105. Longest Strictly Increasing or Strictly Decreasing Subarray](/solution/3100-3199/3105.Longest%20Strictly%20Increasing%20or%20Strictly%20Decreasing%20Subarray/README_EN.md) -- [3106. Lexicographically Smallest String After Operations With Constraint](/solution/3100-3199/3106.Lexicographically%20Smallest%20String%20After%20Operations%20With%20Constraint/README_EN.md) -- [3107. Minimum Operations to Make Median of Array Equal to K](/solution/3100-3199/3107.Minimum%20Operations%20to%20Make%20Median%20of%20Array%20Equal%20to%20K/README_EN.md) -- [3108. Minimum Cost Walk in Weighted Graph](/solution/3100-3199/3108.Minimum%20Cost%20Walk%20in%20Weighted%20Graph/README_EN.md) - -#### Weekly Contest 391 - -- [3099. Harshad Number](/solution/3000-3099/3099.Harshad%20Number/README_EN.md) -- [3100. Water Bottles II](/solution/3100-3199/3100.Water%20Bottles%20II/README_EN.md) -- [3101. Count Alternating Subarrays](/solution/3100-3199/3101.Count%20Alternating%20Subarrays/README_EN.md) -- [3102. Minimize Manhattan Distances](/solution/3100-3199/3102.Minimize%20Manhattan%20Distances/README_EN.md) - -#### Biweekly Contest 127 - -- [3095. Shortest Subarray With OR at Least K I](/solution/3000-3099/3095.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20I/README_EN.md) -- [3096. Minimum Levels to Gain More Points](/solution/3000-3099/3096.Minimum%20Levels%20to%20Gain%20More%20Points/README_EN.md) -- [3097. Shortest Subarray With OR at Least K II](/solution/3000-3099/3097.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20II/README_EN.md) -- [3098. Find the Sum of Subsequence Powers](/solution/3000-3099/3098.Find%20the%20Sum%20of%20Subsequence%20Powers/README_EN.md) - -#### Weekly Contest 390 - -- [3090. Maximum Length Substring With Two Occurrences](/solution/3000-3099/3090.Maximum%20Length%20Substring%20With%20Two%20Occurrences/README_EN.md) -- [3091. Apply Operations to Make Sum of Array Greater Than or Equal to k](/solution/3000-3099/3091.Apply%20Operations%20to%20Make%20Sum%20of%20Array%20Greater%20Than%20or%20Equal%20to%20k/README_EN.md) -- [3092. Most Frequent IDs](/solution/3000-3099/3092.Most%20Frequent%20IDs/README_EN.md) -- [3093. Longest Common Suffix Queries](/solution/3000-3099/3093.Longest%20Common%20Suffix%20Queries/README_EN.md) - -#### Weekly Contest 389 - -- [3083. Existence of a Substring in a String and Its Reverse](/solution/3000-3099/3083.Existence%20of%20a%20Substring%20in%20a%20String%20and%20Its%20Reverse/README_EN.md) -- [3084. Count Substrings Starting and Ending with Given Character](/solution/3000-3099/3084.Count%20Substrings%20Starting%20and%20Ending%20with%20Given%20Character/README_EN.md) -- [3085. Minimum Deletions to Make String K-Special](/solution/3000-3099/3085.Minimum%20Deletions%20to%20Make%20String%20K-Special/README_EN.md) -- [3086. Minimum Moves to Pick K Ones](/solution/3000-3099/3086.Minimum%20Moves%20to%20Pick%20K%20Ones/README_EN.md) - -#### Biweekly Contest 126 - -- [3079. Find the Sum of Encrypted Integers](/solution/3000-3099/3079.Find%20the%20Sum%20of%20Encrypted%20Integers/README_EN.md) -- [3080. Mark Elements on Array by Performing Queries](/solution/3000-3099/3080.Mark%20Elements%20on%20Array%20by%20Performing%20Queries/README_EN.md) -- [3081. Replace Question Marks in String to Minimize Its Value](/solution/3000-3099/3081.Replace%20Question%20Marks%20in%20String%20to%20Minimize%20Its%20Value/README_EN.md) -- [3082. Find the Sum of the Power of All Subsequences](/solution/3000-3099/3082.Find%20the%20Sum%20of%20the%20Power%20of%20All%20Subsequences/README_EN.md) - -#### Weekly Contest 388 - -- [3074. Apple Redistribution into Boxes](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README_EN.md) -- [3075. Maximize Happiness of Selected Children](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README_EN.md) -- [3076. Shortest Uncommon Substring in an Array](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README_EN.md) -- [3077. Maximum Strength of K Disjoint Subarrays](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README_EN.md) - -#### Weekly Contest 387 - -- [3069. Distribute Elements Into Two Arrays I](/solution/3000-3099/3069.Distribute%20Elements%20Into%20Two%20Arrays%20I/README_EN.md) -- [3070. Count Submatrices with Top-Left Element and Sum Less Than k](/solution/3000-3099/3070.Count%20Submatrices%20with%20Top-Left%20Element%20and%20Sum%20Less%20Than%20k/README_EN.md) -- [3071. Minimum Operations to Write the Letter Y on a Grid](/solution/3000-3099/3071.Minimum%20Operations%20to%20Write%20the%20Letter%20Y%20on%20a%20Grid/README_EN.md) -- [3072. Distribute Elements Into Two Arrays II](/solution/3000-3099/3072.Distribute%20Elements%20Into%20Two%20Arrays%20II/README_EN.md) - -#### Biweekly Contest 125 - -- [3065. Minimum Operations to Exceed Threshold Value I](/solution/3000-3099/3065.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20I/README_EN.md) -- [3066. Minimum Operations to Exceed Threshold Value II](/solution/3000-3099/3066.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20II/README_EN.md) -- [3067. Count Pairs of Connectable Servers in a Weighted Tree Network](/solution/3000-3099/3067.Count%20Pairs%20of%20Connectable%20Servers%20in%20a%20Weighted%20Tree%20Network/README_EN.md) -- [3068. Find the Maximum Sum of Node Values](/solution/3000-3099/3068.Find%20the%20Maximum%20Sum%20of%20Node%20Values/README_EN.md) - -#### Weekly Contest 386 - -- [3046. Split the Array](/solution/3000-3099/3046.Split%20the%20Array/README_EN.md) -- [3047. Find the Largest Area of Square Inside Two Rectangles](/solution/3000-3099/3047.Find%20the%20Largest%20Area%20of%20Square%20Inside%20Two%20Rectangles/README_EN.md) -- [3048. Earliest Second to Mark Indices I](/solution/3000-3099/3048.Earliest%20Second%20to%20Mark%20Indices%20I/README_EN.md) -- [3049. Earliest Second to Mark Indices II](/solution/3000-3099/3049.Earliest%20Second%20to%20Mark%20Indices%20II/README_EN.md) - -#### Weekly Contest 385 - -- [3042. Count Prefix and Suffix Pairs I](/solution/3000-3099/3042.Count%20Prefix%20and%20Suffix%20Pairs%20I/README_EN.md) -- [3043. Find the Length of the Longest Common Prefix](/solution/3000-3099/3043.Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/README_EN.md) -- [3044. Most Frequent Prime](/solution/3000-3099/3044.Most%20Frequent%20Prime/README_EN.md) -- [3045. Count Prefix and Suffix Pairs II](/solution/3000-3099/3045.Count%20Prefix%20and%20Suffix%20Pairs%20II/README_EN.md) - -#### Biweekly Contest 124 - -- [3038. Maximum Number of Operations With the Same Score I](/solution/3000-3099/3038.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20I/README_EN.md) -- [3039. Apply Operations to Make String Empty](/solution/3000-3099/3039.Apply%20Operations%20to%20Make%20String%20Empty/README_EN.md) -- [3040. Maximum Number of Operations With the Same Score II](/solution/3000-3099/3040.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20II/README_EN.md) -- [3041. Maximize Consecutive Elements in an Array After Modification](/solution/3000-3099/3041.Maximize%20Consecutive%20Elements%20in%20an%20Array%20After%20Modification/README_EN.md) - -#### Weekly Contest 384 - -- [3033. Modify the Matrix](/solution/3000-3099/3033.Modify%20the%20Matrix/README_EN.md) -- [3034. Number of Subarrays That Match a Pattern I](/solution/3000-3099/3034.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20I/README_EN.md) -- [3035. Maximum Palindromes After Operations](/solution/3000-3099/3035.Maximum%20Palindromes%20After%20Operations/README_EN.md) -- [3036. Number of Subarrays That Match a Pattern II](/solution/3000-3099/3036.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20II/README_EN.md) - -#### Weekly Contest 383 - -- [3028. Ant on the Boundary](/solution/3000-3099/3028.Ant%20on%20the%20Boundary/README_EN.md) -- [3029. Minimum Time to Revert Word to Initial State I](/solution/3000-3099/3029.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20I/README_EN.md) -- [3030. Find the Grid of Region Average](/solution/3000-3099/3030.Find%20the%20Grid%20of%20Region%20Average/README_EN.md) -- [3031. Minimum Time to Revert Word to Initial State II](/solution/3000-3099/3031.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20II/README_EN.md) - -#### Biweekly Contest 123 - -- [3024. Type of Triangle](/solution/3000-3099/3024.Type%20of%20Triangle/README_EN.md) -- [3025. Find the Number of Ways to Place People I](/solution/3000-3099/3025.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20I/README_EN.md) -- [3026. Maximum Good Subarray Sum](/solution/3000-3099/3026.Maximum%20Good%20Subarray%20Sum/README_EN.md) -- [3027. Find the Number of Ways to Place People II](/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/README_EN.md) - -#### Weekly Contest 382 - -- [3019. Number of Changing Keys](/solution/3000-3099/3019.Number%20of%20Changing%20Keys/README_EN.md) -- [3020. Find the Maximum Number of Elements in Subset](/solution/3000-3099/3020.Find%20the%20Maximum%20Number%20of%20Elements%20in%20Subset/README_EN.md) -- [3021. Alice and Bob Playing Flower Game](/solution/3000-3099/3021.Alice%20and%20Bob%20Playing%20Flower%20Game/README_EN.md) -- [3022. Minimize OR of Remaining Elements Using Operations](/solution/3000-3099/3022.Minimize%20OR%20of%20Remaining%20Elements%20Using%20Operations/README_EN.md) - -#### Weekly Contest 381 - -- [3014. Minimum Number of Pushes to Type Word I](/solution/3000-3099/3014.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20I/README_EN.md) -- [3015. Count the Number of Houses at a Certain Distance I](/solution/3000-3099/3015.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20I/README_EN.md) -- [3016. Minimum Number of Pushes to Type Word II](/solution/3000-3099/3016.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20II/README_EN.md) -- [3017. Count the Number of Houses at a Certain Distance II](/solution/3000-3099/3017.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20II/README_EN.md) - -#### Biweekly Contest 122 - -- [3010. Divide an Array Into Subarrays With Minimum Cost I](/solution/3000-3099/3010.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20I/README_EN.md) -- [3011. Find if Array Can Be Sorted](/solution/3000-3099/3011.Find%20if%20Array%20Can%20Be%20Sorted/README_EN.md) -- [3012. Minimize Length of Array Using Operations](/solution/3000-3099/3012.Minimize%20Length%20of%20Array%20Using%20Operations/README_EN.md) -- [3013. Divide an Array Into Subarrays With Minimum Cost II](/solution/3000-3099/3013.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20II/README_EN.md) - -#### Weekly Contest 380 - -- [3005. Count Elements With Maximum Frequency](/solution/3000-3099/3005.Count%20Elements%20With%20Maximum%20Frequency/README_EN.md) -- [3006. Find Beautiful Indices in the Given Array I](/solution/3000-3099/3006.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I/README_EN.md) -- [3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K](/solution/3000-3099/3007.Maximum%20Number%20That%20Sum%20of%20the%20Prices%20Is%20Less%20Than%20or%20Equal%20to%20K/README_EN.md) -- [3008. Find Beautiful Indices in the Given Array II](/solution/3000-3099/3008.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20II/README_EN.md) - -#### Weekly Contest 379 - -- [3000. Maximum Area of Longest Diagonal Rectangle](/solution/3000-3099/3000.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README_EN.md) -- [3001. Minimum Moves to Capture The Queen](/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/README_EN.md) -- [3002. Maximum Size of a Set After Removals](/solution/3000-3099/3002.Maximum%20Size%20of%20a%20Set%20After%20Removals/README_EN.md) -- [3003. Maximize the Number of Partitions After Operations](/solution/3000-3099/3003.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README_EN.md) - -#### Biweekly Contest 121 - -- [2996. Smallest Missing Integer Greater Than Sequential Prefix Sum](/solution/2900-2999/2996.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README_EN.md) -- [2997. Minimum Number of Operations to Make Array XOR Equal to K](/solution/2900-2999/2997.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README_EN.md) -- [2998. Minimum Number of Operations to Make X and Y Equal](/solution/2900-2999/2998.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README_EN.md) -- [2999. Count the Number of Powerful Integers](/solution/2900-2999/2999.Count%20the%20Number%20of%20Powerful%20Integers/README_EN.md) - -#### Weekly Contest 378 - -- [2980. Check if Bitwise OR Has Trailing Zeros](/solution/2900-2999/2980.Check%20if%20Bitwise%20OR%20Has%20Trailing%20Zeros/README_EN.md) -- [2981. Find Longest Special Substring That Occurs Thrice I](/solution/2900-2999/2981.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20I/README_EN.md) -- [2982. Find Longest Special Substring That Occurs Thrice II](/solution/2900-2999/2982.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20II/README_EN.md) -- [2983. Palindrome Rearrangement Queries](/solution/2900-2999/2983.Palindrome%20Rearrangement%20Queries/README_EN.md) - -#### Weekly Contest 377 - -- [2974. Minimum Number Game](/solution/2900-2999/2974.Minimum%20Number%20Game/README_EN.md) -- [2975. Maximum Square Area by Removing Fences From a Field](/solution/2900-2999/2975.Maximum%20Square%20Area%20by%20Removing%20Fences%20From%20a%20Field/README_EN.md) -- [2976. Minimum Cost to Convert String I](/solution/2900-2999/2976.Minimum%20Cost%20to%20Convert%20String%20I/README_EN.md) -- [2977. Minimum Cost to Convert String II](/solution/2900-2999/2977.Minimum%20Cost%20to%20Convert%20String%20II/README_EN.md) - -#### Biweekly Contest 120 - -- [2970. Count the Number of Incremovable Subarrays I](/solution/2900-2999/2970.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README_EN.md) -- [2971. Find Polygon With the Largest Perimeter](/solution/2900-2999/2971.Find%20Polygon%20With%20the%20Largest%20Perimeter/README_EN.md) -- [2972. Count the Number of Incremovable Subarrays II](/solution/2900-2999/2972.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README_EN.md) -- [2973. Find Number of Coins to Place in Tree Nodes](/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README_EN.md) - -#### Weekly Contest 376 - -- [2965. Find Missing and Repeated Values](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README_EN.md) -- [2966. Divide Array Into Arrays With Max Difference](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README_EN.md) -- [2967. Minimum Cost to Make Array Equalindromic](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README_EN.md) -- [2968. Apply Operations to Maximize Frequency Score](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README_EN.md) - -#### Weekly Contest 375 - -- [2960. Count Tested Devices After Test Operations](/solution/2900-2999/2960.Count%20Tested%20Devices%20After%20Test%20Operations/README_EN.md) -- [2961. Double Modular Exponentiation](/solution/2900-2999/2961.Double%20Modular%20Exponentiation/README_EN.md) -- [2962. Count Subarrays Where Max Element Appears at Least K Times](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README_EN.md) -- [2963. Count the Number of Good Partitions](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README_EN.md) - -#### Biweekly Contest 119 - -- [2956. Find Common Elements Between Two Arrays](/solution/2900-2999/2956.Find%20Common%20Elements%20Between%20Two%20Arrays/README_EN.md) -- [2957. Remove Adjacent Almost-Equal Characters](/solution/2900-2999/2957.Remove%20Adjacent%20Almost-Equal%20Characters/README_EN.md) -- [2958. Length of Longest Subarray With at Most K Frequency](/solution/2900-2999/2958.Length%20of%20Longest%20Subarray%20With%20at%20Most%20K%20Frequency/README_EN.md) -- [2959. Number of Possible Sets of Closing Branches](/solution/2900-2999/2959.Number%20of%20Possible%20Sets%20of%20Closing%20Branches/README_EN.md) - -#### Weekly Contest 374 - -- [2951. Find the Peaks](/solution/2900-2999/2951.Find%20the%20Peaks/README_EN.md) -- [2952. Minimum Number of Coins to be Added](/solution/2900-2999/2952.Minimum%20Number%20of%20Coins%20to%20be%20Added/README_EN.md) -- [2953. Count Complete Substrings](/solution/2900-2999/2953.Count%20Complete%20Substrings/README_EN.md) -- [2954. Count the Number of Infection Sequences](/solution/2900-2999/2954.Count%20the%20Number%20of%20Infection%20Sequences/README_EN.md) - -#### Weekly Contest 373 - -- [2946. Matrix Similarity After Cyclic Shifts](/solution/2900-2999/2946.Matrix%20Similarity%20After%20Cyclic%20Shifts/README_EN.md) -- [2947. Count Beautiful Substrings I](/solution/2900-2999/2947.Count%20Beautiful%20Substrings%20I/README_EN.md) -- [2948. Make Lexicographically Smallest Array by Swapping Elements](/solution/2900-2999/2948.Make%20Lexicographically%20Smallest%20Array%20by%20Swapping%20Elements/README_EN.md) -- [2949. Count Beautiful Substrings II](/solution/2900-2999/2949.Count%20Beautiful%20Substrings%20II/README_EN.md) - -#### Biweekly Contest 118 - -- [2942. Find Words Containing Character](/solution/2900-2999/2942.Find%20Words%20Containing%20Character/README_EN.md) -- [2943. Maximize Area of Square Hole in Grid](/solution/2900-2999/2943.Maximize%20Area%20of%20Square%20Hole%20in%20Grid/README_EN.md) -- [2944. Minimum Number of Coins for Fruits](/solution/2900-2999/2944.Minimum%20Number%20of%20Coins%20for%20Fruits/README_EN.md) -- [2945. Find Maximum Non-decreasing Array Length](/solution/2900-2999/2945.Find%20Maximum%20Non-decreasing%20Array%20Length/README_EN.md) - -#### Weekly Contest 372 - -- [2937. Make Three Strings Equal](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README_EN.md) -- [2938. Separate Black and White Balls](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README_EN.md) -- [2939. Maximum Xor Product](/solution/2900-2999/2939.Maximum%20Xor%20Product/README_EN.md) -- [2940. Find Building Where Alice and Bob Can Meet](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README_EN.md) - -#### Weekly Contest 371 - -- [2932. Maximum Strong Pair XOR I](/solution/2900-2999/2932.Maximum%20Strong%20Pair%20XOR%20I/README_EN.md) -- [2933. High-Access Employees](/solution/2900-2999/2933.High-Access%20Employees/README_EN.md) -- [2934. Minimum Operations to Maximize Last Elements in Arrays](/solution/2900-2999/2934.Minimum%20Operations%20to%20Maximize%20Last%20Elements%20in%20Arrays/README_EN.md) -- [2935. Maximum Strong Pair XOR II](/solution/2900-2999/2935.Maximum%20Strong%20Pair%20XOR%20II/README_EN.md) - -#### Biweekly Contest 117 - -- [2928. Distribute Candies Among Children I](/solution/2900-2999/2928.Distribute%20Candies%20Among%20Children%20I/README_EN.md) -- [2929. Distribute Candies Among Children II](/solution/2900-2999/2929.Distribute%20Candies%20Among%20Children%20II/README_EN.md) -- [2930. Number of Strings Which Can Be Rearranged to Contain Substring](/solution/2900-2999/2930.Number%20of%20Strings%20Which%20Can%20Be%20Rearranged%20to%20Contain%20Substring/README_EN.md) -- [2931. Maximum Spending After Buying Items](/solution/2900-2999/2931.Maximum%20Spending%20After%20Buying%20Items/README_EN.md) - -#### Weekly Contest 370 - -- [2923. Find Champion I](/solution/2900-2999/2923.Find%20Champion%20I/README_EN.md) -- [2924. Find Champion II](/solution/2900-2999/2924.Find%20Champion%20II/README_EN.md) -- [2925. Maximum Score After Applying Operations on a Tree](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README_EN.md) -- [2926. Maximum Balanced Subsequence Sum](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README_EN.md) - -#### Weekly Contest 369 - -- [2917. Find the K-or of an Array](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README_EN.md) -- [2918. Minimum Equal Sum of Two Arrays After Replacing Zeros](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README_EN.md) -- [2919. Minimum Increment Operations to Make Array Beautiful](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README_EN.md) -- [2920. Maximum Points After Collecting Coins From All Nodes](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README_EN.md) - -#### Biweekly Contest 116 - -- [2913. Subarrays Distinct Element Sum of Squares I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README_EN.md) -- [2914. Minimum Number of Changes to Make Binary String Beautiful](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README_EN.md) -- [2915. Length of the Longest Subsequence That Sums to Target](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README_EN.md) -- [2916. Subarrays Distinct Element Sum of Squares II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README_EN.md) - -#### Weekly Contest 368 - -- [2908. Minimum Sum of Mountain Triplets I](/solution/2900-2999/2908.Minimum%20Sum%20of%20Mountain%20Triplets%20I/README_EN.md) -- [2909. Minimum Sum of Mountain Triplets II](/solution/2900-2999/2909.Minimum%20Sum%20of%20Mountain%20Triplets%20II/README_EN.md) -- [2910. Minimum Number of Groups to Create a Valid Assignment](/solution/2900-2999/2910.Minimum%20Number%20of%20Groups%20to%20Create%20a%20Valid%20Assignment/README_EN.md) -- [2911. Minimum Changes to Make K Semi-palindromes](/solution/2900-2999/2911.Minimum%20Changes%20to%20Make%20K%20Semi-palindromes/README_EN.md) - -#### Weekly Contest 367 - -- [2903. Find Indices With Index and Value Difference I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README_EN.md) -- [2904. Shortest and Lexicographically Smallest Beautiful String](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) -- [2905. Find Indices With Index and Value Difference II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README_EN.md) -- [2906. Construct Product Matrix](/solution/2900-2999/2906.Construct%20Product%20Matrix/README_EN.md) - -#### Biweekly Contest 115 - -- [2899. Last Visited Integers](/solution/2800-2899/2899.Last%20Visited%20Integers/README_EN.md) -- [2900. Longest Unequal Adjacent Groups Subsequence I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README_EN.md) -- [2901. Longest Unequal Adjacent Groups Subsequence II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README_EN.md) -- [2902. Count of Sub-Multisets With Bounded Sum](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README_EN.md) - -#### Weekly Contest 366 - -- [2894. Divisible and Non-divisible Sums Difference](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README_EN.md) -- [2895. Minimum Processing Time](/solution/2800-2899/2895.Minimum%20Processing%20Time/README_EN.md) -- [2896. Apply Operations to Make Two Strings Equal](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README_EN.md) -- [2897. Apply Operations on Array to Maximize Sum of Squares](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README_EN.md) - -#### Weekly Contest 365 - -- [2873. Maximum Value of an Ordered Triplet I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README_EN.md) -- [2874. Maximum Value of an Ordered Triplet II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README_EN.md) -- [2875. Minimum Size Subarray in Infinite Array](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README_EN.md) -- [2876. Count Visited Nodes in a Directed Graph](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README_EN.md) - -#### Biweekly Contest 114 - -- [2869. Minimum Operations to Collect Elements](/solution/2800-2899/2869.Minimum%20Operations%20to%20Collect%20Elements/README_EN.md) -- [2870. Minimum Number of Operations to Make Array Empty](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README_EN.md) -- [2871. Split Array Into Maximum Number of Subarrays](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README_EN.md) -- [2872. Maximum Number of K-Divisible Components](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README_EN.md) - -#### Weekly Contest 364 - -- [2864. Maximum Odd Binary Number](/solution/2800-2899/2864.Maximum%20Odd%20Binary%20Number/README_EN.md) -- [2865. Beautiful Towers I](/solution/2800-2899/2865.Beautiful%20Towers%20I/README_EN.md) -- [2866. Beautiful Towers II](/solution/2800-2899/2866.Beautiful%20Towers%20II/README_EN.md) -- [2867. Count Valid Paths in a Tree](/solution/2800-2899/2867.Count%20Valid%20Paths%20in%20a%20Tree/README_EN.md) - -#### Weekly Contest 363 - -- [2859. Sum of Values at Indices With K Set Bits](/solution/2800-2899/2859.Sum%20of%20Values%20at%20Indices%20With%20K%20Set%20Bits/README_EN.md) -- [2860. Happy Students](/solution/2800-2899/2860.Happy%20Students/README_EN.md) -- [2861. Maximum Number of Alloys](/solution/2800-2899/2861.Maximum%20Number%20of%20Alloys/README_EN.md) -- [2862. Maximum Element-Sum of a Complete Subset of Indices](/solution/2800-2899/2862.Maximum%20Element-Sum%20of%20a%20Complete%20Subset%20of%20Indices/README_EN.md) - -#### Biweekly Contest 113 - -- [2855. Minimum Right Shifts to Sort the Array](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README_EN.md) -- [2856. Minimum Array Length After Pair Removals](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README_EN.md) -- [2857. Count Pairs of Points With Distance k](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README_EN.md) -- [2858. Minimum Edge Reversals So Every Node Is Reachable](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README_EN.md) - -#### Weekly Contest 362 - -- [2848. Points That Intersect With Cars](/solution/2800-2899/2848.Points%20That%20Intersect%20With%20Cars/README_EN.md) -- [2849. Determine if a Cell Is Reachable at a Given Time](/solution/2800-2899/2849.Determine%20if%20a%20Cell%20Is%20Reachable%20at%20a%20Given%20Time/README_EN.md) -- [2850. Minimum Moves to Spread Stones Over Grid](/solution/2800-2899/2850.Minimum%20Moves%20to%20Spread%20Stones%20Over%20Grid/README_EN.md) -- [2851. String Transformation](/solution/2800-2899/2851.String%20Transformation/README_EN.md) - -#### Weekly Contest 361 - -- [2843. Count Symmetric Integers](/solution/2800-2899/2843.Count%20Symmetric%20Integers/README_EN.md) -- [2844. Minimum Operations to Make a Special Number](/solution/2800-2899/2844.Minimum%20Operations%20to%20Make%20a%20Special%20Number/README_EN.md) -- [2845. Count of Interesting Subarrays](/solution/2800-2899/2845.Count%20of%20Interesting%20Subarrays/README_EN.md) -- [2846. Minimum Edge Weight Equilibrium Queries in a Tree](/solution/2800-2899/2846.Minimum%20Edge%20Weight%20Equilibrium%20Queries%20in%20a%20Tree/README_EN.md) - -#### Biweekly Contest 112 - -- [2839. Check if Strings Can be Made Equal With Operations I](/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README_EN.md) -- [2840. Check if Strings Can be Made Equal With Operations II](/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README_EN.md) -- [2841. Maximum Sum of Almost Unique Subarray](/solution/2800-2899/2841.Maximum%20Sum%20of%20Almost%20Unique%20Subarray/README_EN.md) -- [2842. Count K-Subsequences of a String With Maximum Beauty](/solution/2800-2899/2842.Count%20K-Subsequences%20of%20a%20String%20With%20Maximum%20Beauty/README_EN.md) - -#### Weekly Contest 360 - -- [2833. Furthest Point From Origin](/solution/2800-2899/2833.Furthest%20Point%20From%20Origin/README_EN.md) -- [2834. Find the Minimum Possible Sum of a Beautiful Array](/solution/2800-2899/2834.Find%20the%20Minimum%20Possible%20Sum%20of%20a%20Beautiful%20Array/README_EN.md) -- [2835. Minimum Operations to Form Subsequence With Target Sum](/solution/2800-2899/2835.Minimum%20Operations%20to%20Form%20Subsequence%20With%20Target%20Sum/README_EN.md) -- [2836. Maximize Value of Function in a Ball Passing Game](/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README_EN.md) - -#### Weekly Contest 359 - -- [2828. Check if a String Is an Acronym of Words](/solution/2800-2899/2828.Check%20if%20a%20String%20Is%20an%20Acronym%20of%20Words/README_EN.md) -- [2829. Determine the Minimum Sum of a k-avoiding Array](/solution/2800-2899/2829.Determine%20the%20Minimum%20Sum%20of%20a%20k-avoiding%20Array/README_EN.md) -- [2830. Maximize the Profit as the Salesman](/solution/2800-2899/2830.Maximize%20the%20Profit%20as%20the%20Salesman/README_EN.md) -- [2831. Find the Longest Equal Subarray](/solution/2800-2899/2831.Find%20the%20Longest%20Equal%20Subarray/README_EN.md) - -#### Biweekly Contest 111 - -- [2824. Count Pairs Whose Sum is Less than Target](/solution/2800-2899/2824.Count%20Pairs%20Whose%20Sum%20is%20Less%20than%20Target/README_EN.md) -- [2825. Make String a Subsequence Using Cyclic Increments](/solution/2800-2899/2825.Make%20String%20a%20Subsequence%20Using%20Cyclic%20Increments/README_EN.md) -- [2826. Sorting Three Groups](/solution/2800-2899/2826.Sorting%20Three%20Groups/README_EN.md) -- [2827. Number of Beautiful Integers in the Range](/solution/2800-2899/2827.Number%20of%20Beautiful%20Integers%20in%20the%20Range/README_EN.md) - -#### Weekly Contest 358 - -- [2815. Max Pair Sum in an Array](/solution/2800-2899/2815.Max%20Pair%20Sum%20in%20an%20Array/README_EN.md) -- [2816. Double a Number Represented as a Linked List](/solution/2800-2899/2816.Double%20a%20Number%20Represented%20as%20a%20Linked%20List/README_EN.md) -- [2817. Minimum Absolute Difference Between Elements With Constraint](/solution/2800-2899/2817.Minimum%20Absolute%20Difference%20Between%20Elements%20With%20Constraint/README_EN.md) -- [2818. Apply Operations to Maximize Score](/solution/2800-2899/2818.Apply%20Operations%20to%20Maximize%20Score/README_EN.md) - -#### Weekly Contest 357 - -- [2810. Faulty Keyboard](/solution/2800-2899/2810.Faulty%20Keyboard/README_EN.md) -- [2811. Check if it is Possible to Split Array](/solution/2800-2899/2811.Check%20if%20it%20is%20Possible%20to%20Split%20Array/README_EN.md) -- [2812. Find the Safest Path in a Grid](/solution/2800-2899/2812.Find%20the%20Safest%20Path%20in%20a%20Grid/README_EN.md) -- [2813. Maximum Elegance of a K-Length Subsequence](/solution/2800-2899/2813.Maximum%20Elegance%20of%20a%20K-Length%20Subsequence/README_EN.md) - -#### Biweekly Contest 110 - -- [2806. Account Balance After Rounded Purchase](/solution/2800-2899/2806.Account%20Balance%20After%20Rounded%20Purchase/README_EN.md) -- [2807. Insert Greatest Common Divisors in Linked List](/solution/2800-2899/2807.Insert%20Greatest%20Common%20Divisors%20in%20Linked%20List/README_EN.md) -- [2808. Minimum Seconds to Equalize a Circular Array](/solution/2800-2899/2808.Minimum%20Seconds%20to%20Equalize%20a%20Circular%20Array/README_EN.md) -- [2809. Minimum Time to Make Array Sum At Most x](/solution/2800-2899/2809.Minimum%20Time%20to%20Make%20Array%20Sum%20At%20Most%20x/README_EN.md) - -#### Weekly Contest 356 - -- [2798. Number of Employees Who Met the Target](/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README_EN.md) -- [2799. Count Complete Subarrays in an Array](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README_EN.md) -- [2800. Shortest String That Contains Three Strings](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README_EN.md) -- [2801. Count Stepping Numbers in Range](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README_EN.md) - -#### Weekly Contest 355 - -- [2788. Split Strings by Separator](/solution/2700-2799/2788.Split%20Strings%20by%20Separator/README_EN.md) -- [2789. Largest Element in an Array after Merge Operations](/solution/2700-2799/2789.Largest%20Element%20in%20an%20Array%20after%20Merge%20Operations/README_EN.md) -- [2790. Maximum Number of Groups With Increasing Length](/solution/2700-2799/2790.Maximum%20Number%20of%20Groups%20With%20Increasing%20Length/README_EN.md) -- [2791. Count Paths That Can Form a Palindrome in a Tree](/solution/2700-2799/2791.Count%20Paths%20That%20Can%20Form%20a%20Palindrome%20in%20a%20Tree/README_EN.md) - -#### Biweekly Contest 109 - -- [2784. Check if Array is Good](/solution/2700-2799/2784.Check%20if%20Array%20is%20Good/README_EN.md) -- [2785. Sort Vowels in a String](/solution/2700-2799/2785.Sort%20Vowels%20in%20a%20String/README_EN.md) -- [2786. Visit Array Positions to Maximize Score](/solution/2700-2799/2786.Visit%20Array%20Positions%20to%20Maximize%20Score/README_EN.md) -- [2787. Ways to Express an Integer as Sum of Powers](/solution/2700-2799/2787.Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers/README_EN.md) - -#### Weekly Contest 354 - -- [2778. Sum of Squares of Special Elements](/solution/2700-2799/2778.Sum%20of%20Squares%20of%20Special%20Elements/README_EN.md) -- [2779. Maximum Beauty of an Array After Applying Operation](/solution/2700-2799/2779.Maximum%20Beauty%20of%20an%20Array%20After%20Applying%20Operation/README_EN.md) -- [2780. Minimum Index of a Valid Split](/solution/2700-2799/2780.Minimum%20Index%20of%20a%20Valid%20Split/README_EN.md) -- [2781. Length of the Longest Valid Substring](/solution/2700-2799/2781.Length%20of%20the%20Longest%20Valid%20Substring/README_EN.md) - -#### Weekly Contest 353 - -- [2769. Find the Maximum Achievable Number](/solution/2700-2799/2769.Find%20the%20Maximum%20Achievable%20Number/README_EN.md) -- [2770. Maximum Number of Jumps to Reach the Last Index](/solution/2700-2799/2770.Maximum%20Number%20of%20Jumps%20to%20Reach%20the%20Last%20Index/README_EN.md) -- [2771. Longest Non-decreasing Subarray From Two Arrays](/solution/2700-2799/2771.Longest%20Non-decreasing%20Subarray%20From%20Two%20Arrays/README_EN.md) -- [2772. Apply Operations to Make All Array Elements Equal to Zero](/solution/2700-2799/2772.Apply%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%20Zero/README_EN.md) - -#### Biweekly Contest 108 - -- [2765. Longest Alternating Subarray](/solution/2700-2799/2765.Longest%20Alternating%20Subarray/README_EN.md) -- [2766. Relocate Marbles](/solution/2700-2799/2766.Relocate%20Marbles/README_EN.md) -- [2767. Partition String Into Minimum Beautiful Substrings](/solution/2700-2799/2767.Partition%20String%20Into%20Minimum%20Beautiful%20Substrings/README_EN.md) -- [2768. Number of Black Blocks](/solution/2700-2799/2768.Number%20of%20Black%20Blocks/README_EN.md) - -#### Weekly Contest 352 - -- [2760. Longest Even Odd Subarray With Threshold](/solution/2700-2799/2760.Longest%20Even%20Odd%20Subarray%20With%20Threshold/README_EN.md) -- [2761. Prime Pairs With Target Sum](/solution/2700-2799/2761.Prime%20Pairs%20With%20Target%20Sum/README_EN.md) -- [2762. Continuous Subarrays](/solution/2700-2799/2762.Continuous%20Subarrays/README_EN.md) -- [2763. Sum of Imbalance Numbers of All Subarrays](/solution/2700-2799/2763.Sum%20of%20Imbalance%20Numbers%20of%20All%20Subarrays/README_EN.md) - -#### Weekly Contest 351 - -- [2748. Number of Beautiful Pairs](/solution/2700-2799/2748.Number%20of%20Beautiful%20Pairs/README_EN.md) -- [2749. Minimum Operations to Make the Integer Zero](/solution/2700-2799/2749.Minimum%20Operations%20to%20Make%20the%20Integer%20Zero/README_EN.md) -- [2750. Ways to Split Array Into Good Subarrays](/solution/2700-2799/2750.Ways%20to%20Split%20Array%20Into%20Good%20Subarrays/README_EN.md) -- [2751. Robot Collisions](/solution/2700-2799/2751.Robot%20Collisions/README_EN.md) - -#### Biweekly Contest 107 - -- [2744. Find Maximum Number of String Pairs](/solution/2700-2799/2744.Find%20Maximum%20Number%20of%20String%20Pairs/README_EN.md) -- [2745. Construct the Longest New String](/solution/2700-2799/2745.Construct%20the%20Longest%20New%20String/README_EN.md) -- [2746. Decremental String Concatenation](/solution/2700-2799/2746.Decremental%20String%20Concatenation/README_EN.md) -- [2747. Count Zero Request Servers](/solution/2700-2799/2747.Count%20Zero%20Request%20Servers/README_EN.md) - -#### Weekly Contest 350 - -- [2739. Total Distance Traveled](/solution/2700-2799/2739.Total%20Distance%20Traveled/README_EN.md) -- [2740. Find the Value of the Partition](/solution/2700-2799/2740.Find%20the%20Value%20of%20the%20Partition/README_EN.md) -- [2741. Special Permutations](/solution/2700-2799/2741.Special%20Permutations/README_EN.md) -- [2742. Painting the Walls](/solution/2700-2799/2742.Painting%20the%20Walls/README_EN.md) - -#### Weekly Contest 349 - -- [2733. Neither Minimum nor Maximum](/solution/2700-2799/2733.Neither%20Minimum%20nor%20Maximum/README_EN.md) -- [2734. Lexicographically Smallest String After Substring Operation](/solution/2700-2799/2734.Lexicographically%20Smallest%20String%20After%20Substring%20Operation/README_EN.md) -- [2735. Collecting Chocolates](/solution/2700-2799/2735.Collecting%20Chocolates/README_EN.md) -- [2736. Maximum Sum Queries](/solution/2700-2799/2736.Maximum%20Sum%20Queries/README_EN.md) - -#### Biweekly Contest 106 - -- [2729. Check if The Number is Fascinating](/solution/2700-2799/2729.Check%20if%20The%20Number%20is%20Fascinating/README_EN.md) -- [2730. Find the Longest Semi-Repetitive Substring](/solution/2700-2799/2730.Find%20the%20Longest%20Semi-Repetitive%20Substring/README_EN.md) -- [2731. Movement of Robots](/solution/2700-2799/2731.Movement%20of%20Robots/README_EN.md) -- [2732. Find a Good Subset of the Matrix](/solution/2700-2799/2732.Find%20a%20Good%20Subset%20of%20the%20Matrix/README_EN.md) - -#### Weekly Contest 348 - -- [2716. Minimize String Length](/solution/2700-2799/2716.Minimize%20String%20Length/README_EN.md) -- [2717. Semi-Ordered Permutation](/solution/2700-2799/2717.Semi-Ordered%20Permutation/README_EN.md) -- [2718. Sum of Matrix After Queries](/solution/2700-2799/2718.Sum%20of%20Matrix%20After%20Queries/README_EN.md) -- [2719. Count of Integers](/solution/2700-2799/2719.Count%20of%20Integers/README_EN.md) - -#### Weekly Contest 347 - -- [2710. Remove Trailing Zeros From a String](/solution/2700-2799/2710.Remove%20Trailing%20Zeros%20From%20a%20String/README_EN.md) -- [2711. Difference of Number of Distinct Values on Diagonals](/solution/2700-2799/2711.Difference%20of%20Number%20of%20Distinct%20Values%20on%20Diagonals/README_EN.md) -- [2712. Minimum Cost to Make All Characters Equal](/solution/2700-2799/2712.Minimum%20Cost%20to%20Make%20All%20Characters%20Equal/README_EN.md) -- [2713. Maximum Strictly Increasing Cells in a Matrix](/solution/2700-2799/2713.Maximum%20Strictly%20Increasing%20Cells%20in%20a%20Matrix/README_EN.md) - -#### Biweekly Contest 105 - -- [2706. Buy Two Chocolates](/solution/2700-2799/2706.Buy%20Two%20Chocolates/README_EN.md) -- [2707. Extra Characters in a String](/solution/2700-2799/2707.Extra%20Characters%20in%20a%20String/README_EN.md) -- [2708. Maximum Strength of a Group](/solution/2700-2799/2708.Maximum%20Strength%20of%20a%20Group/README_EN.md) -- [2709. Greatest Common Divisor Traversal](/solution/2700-2799/2709.Greatest%20Common%20Divisor%20Traversal/README_EN.md) - -#### Weekly Contest 346 - -- [2696. Minimum String Length After Removing Substrings](/solution/2600-2699/2696.Minimum%20String%20Length%20After%20Removing%20Substrings/README_EN.md) -- [2697. Lexicographically Smallest Palindrome](/solution/2600-2699/2697.Lexicographically%20Smallest%20Palindrome/README_EN.md) -- [2698. Find the Punishment Number of an Integer](/solution/2600-2699/2698.Find%20the%20Punishment%20Number%20of%20an%20Integer/README_EN.md) -- [2699. Modify Graph Edge Weights](/solution/2600-2699/2699.Modify%20Graph%20Edge%20Weights/README_EN.md) - -#### Weekly Contest 345 - -- [2682. Find the Losers of the Circular Game](/solution/2600-2699/2682.Find%20the%20Losers%20of%20the%20Circular%20Game/README_EN.md) -- [2683. Neighboring Bitwise XOR](/solution/2600-2699/2683.Neighboring%20Bitwise%20XOR/README_EN.md) -- [2684. Maximum Number of Moves in a Grid](/solution/2600-2699/2684.Maximum%20Number%20of%20Moves%20in%20a%20Grid/README_EN.md) -- [2685. Count the Number of Complete Components](/solution/2600-2699/2685.Count%20the%20Number%20of%20Complete%20Components/README_EN.md) - -#### Biweekly Contest 104 - -- [2678. Number of Senior Citizens](/solution/2600-2699/2678.Number%20of%20Senior%20Citizens/README_EN.md) -- [2679. Sum in a Matrix](/solution/2600-2699/2679.Sum%20in%20a%20Matrix/README_EN.md) -- [2680. Maximum OR](/solution/2600-2699/2680.Maximum%20OR/README_EN.md) -- [2681. Power of Heroes](/solution/2600-2699/2681.Power%20of%20Heroes/README_EN.md) - -#### Weekly Contest 344 - -- [2670. Find the Distinct Difference Array](/solution/2600-2699/2670.Find%20the%20Distinct%20Difference%20Array/README_EN.md) -- [2671. Frequency Tracker](/solution/2600-2699/2671.Frequency%20Tracker/README_EN.md) -- [2672. Number of Adjacent Elements With the Same Color](/solution/2600-2699/2672.Number%20of%20Adjacent%20Elements%20With%20the%20Same%20Color/README_EN.md) -- [2673. Make Costs of Paths Equal in a Binary Tree](/solution/2600-2699/2673.Make%20Costs%20of%20Paths%20Equal%20in%20a%20Binary%20Tree/README_EN.md) - -#### Weekly Contest 343 - -- [2660. Determine the Winner of a Bowling Game](/solution/2600-2699/2660.Determine%20the%20Winner%20of%20a%20Bowling%20Game/README_EN.md) -- [2661. First Completely Painted Row or Column](/solution/2600-2699/2661.First%20Completely%20Painted%20Row%20or%20Column/README_EN.md) -- [2662. Minimum Cost of a Path With Special Roads](/solution/2600-2699/2662.Minimum%20Cost%20of%20a%20Path%20With%20Special%20Roads/README_EN.md) -- [2663. Lexicographically Smallest Beautiful String](/solution/2600-2699/2663.Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) - -#### Biweekly Contest 103 - -- [2656. Maximum Sum With Exactly K Elements](/solution/2600-2699/2656.Maximum%20Sum%20With%20Exactly%20K%20Elements/README_EN.md) -- [2657. Find the Prefix Common Array of Two Arrays](/solution/2600-2699/2657.Find%20the%20Prefix%20Common%20Array%20of%20Two%20Arrays/README_EN.md) -- [2658. Maximum Number of Fish in a Grid](/solution/2600-2699/2658.Maximum%20Number%20of%20Fish%20in%20a%20Grid/README_EN.md) -- [2659. Make Array Empty](/solution/2600-2699/2659.Make%20Array%20Empty/README_EN.md) - -#### Weekly Contest 342 - -- [2651. Calculate Delayed Arrival Time](/solution/2600-2699/2651.Calculate%20Delayed%20Arrival%20Time/README_EN.md) -- [2652. Sum Multiples](/solution/2600-2699/2652.Sum%20Multiples/README_EN.md) -- [2653. Sliding Subarray Beauty](/solution/2600-2699/2653.Sliding%20Subarray%20Beauty/README_EN.md) -- [2654. Minimum Number of Operations to Make All Array Elements Equal to 1](/solution/2600-2699/2654.Minimum%20Number%20of%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%201/README_EN.md) - -#### Weekly Contest 341 - -- [2643. Row With Maximum Ones](/solution/2600-2699/2643.Row%20With%20Maximum%20Ones/README_EN.md) -- [2644. Find the Maximum Divisibility Score](/solution/2600-2699/2644.Find%20the%20Maximum%20Divisibility%20Score/README_EN.md) -- [2645. Minimum Additions to Make Valid String](/solution/2600-2699/2645.Minimum%20Additions%20to%20Make%20Valid%20String/README_EN.md) -- [2646. Minimize the Total Price of the Trips](/solution/2600-2699/2646.Minimize%20the%20Total%20Price%20of%20the%20Trips/README_EN.md) - -#### Biweekly Contest 102 - -- [2639. Find the Width of Columns of a Grid](/solution/2600-2699/2639.Find%20the%20Width%20of%20Columns%20of%20a%20Grid/README_EN.md) -- [2640. Find the Score of All Prefixes of an Array](/solution/2600-2699/2640.Find%20the%20Score%20of%20All%20Prefixes%20of%20an%20Array/README_EN.md) -- [2641. Cousins in Binary Tree II](/solution/2600-2699/2641.Cousins%20in%20Binary%20Tree%20II/README_EN.md) -- [2642. Design Graph With Shortest Path Calculator](/solution/2600-2699/2642.Design%20Graph%20With%20Shortest%20Path%20Calculator/README_EN.md) - -#### Weekly Contest 340 - -- [2614. Prime In Diagonal](/solution/2600-2699/2614.Prime%20In%20Diagonal/README_EN.md) -- [2615. Sum of Distances](/solution/2600-2699/2615.Sum%20of%20Distances/README_EN.md) -- [2616. Minimize the Maximum Difference of Pairs](/solution/2600-2699/2616.Minimize%20the%20Maximum%20Difference%20of%20Pairs/README_EN.md) -- [2617. Minimum Number of Visited Cells in a Grid](/solution/2600-2699/2617.Minimum%20Number%20of%20Visited%20Cells%20in%20a%20Grid/README_EN.md) - -#### Weekly Contest 339 - -- [2609. Find the Longest Balanced Substring of a Binary String](/solution/2600-2699/2609.Find%20the%20Longest%20Balanced%20Substring%20of%20a%20Binary%20String/README_EN.md) -- [2610. Convert an Array Into a 2D Array With Conditions](/solution/2600-2699/2610.Convert%20an%20Array%20Into%20a%202D%20Array%20With%20Conditions/README_EN.md) -- [2611. Mice and Cheese](/solution/2600-2699/2611.Mice%20and%20Cheese/README_EN.md) -- [2612. Minimum Reverse Operations](/solution/2600-2699/2612.Minimum%20Reverse%20Operations/README_EN.md) - -#### Biweekly Contest 101 - -- [2605. Form Smallest Number From Two Digit Arrays](/solution/2600-2699/2605.Form%20Smallest%20Number%20From%20Two%20Digit%20Arrays/README_EN.md) -- [2606. Find the Substring With Maximum Cost](/solution/2600-2699/2606.Find%20the%20Substring%20With%20Maximum%20Cost/README_EN.md) -- [2607. Make K-Subarray Sums Equal](/solution/2600-2699/2607.Make%20K-Subarray%20Sums%20Equal/README_EN.md) -- [2608. Shortest Cycle in a Graph](/solution/2600-2699/2608.Shortest%20Cycle%20in%20a%20Graph/README_EN.md) - -#### Weekly Contest 338 - -- [2600. K Items With the Maximum Sum](/solution/2600-2699/2600.K%20Items%20With%20the%20Maximum%20Sum/README_EN.md) -- [2601. Prime Subtraction Operation](/solution/2600-2699/2601.Prime%20Subtraction%20Operation/README_EN.md) -- [2602. Minimum Operations to Make All Array Elements Equal](/solution/2600-2699/2602.Minimum%20Operations%20to%20Make%20All%20Array%20Elements%20Equal/README_EN.md) -- [2603. Collect Coins in a Tree](/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README_EN.md) - -#### Weekly Contest 337 - -- [2595. Number of Even and Odd Bits](/solution/2500-2599/2595.Number%20of%20Even%20and%20Odd%20Bits/README_EN.md) -- [2596. Check Knight Tour Configuration](/solution/2500-2599/2596.Check%20Knight%20Tour%20Configuration/README_EN.md) -- [2597. The Number of Beautiful Subsets](/solution/2500-2599/2597.The%20Number%20of%20Beautiful%20Subsets/README_EN.md) -- [2598. Smallest Missing Non-negative Integer After Operations](/solution/2500-2599/2598.Smallest%20Missing%20Non-negative%20Integer%20After%20Operations/README_EN.md) - -#### Biweekly Contest 100 - -- [2591. Distribute Money to Maximum Children](/solution/2500-2599/2591.Distribute%20Money%20to%20Maximum%20Children/README_EN.md) -- [2592. Maximize Greatness of an Array](/solution/2500-2599/2592.Maximize%20Greatness%20of%20an%20Array/README_EN.md) -- [2593. Find Score of an Array After Marking All Elements](/solution/2500-2599/2593.Find%20Score%20of%20an%20Array%20After%20Marking%20All%20Elements/README_EN.md) -- [2594. Minimum Time to Repair Cars](/solution/2500-2599/2594.Minimum%20Time%20to%20Repair%20Cars/README_EN.md) - -#### Weekly Contest 336 - -- [2586. Count the Number of Vowel Strings in Range](/solution/2500-2599/2586.Count%20the%20Number%20of%20Vowel%20Strings%20in%20Range/README_EN.md) -- [2587. Rearrange Array to Maximize Prefix Score](/solution/2500-2599/2587.Rearrange%20Array%20to%20Maximize%20Prefix%20Score/README_EN.md) -- [2588. Count the Number of Beautiful Subarrays](/solution/2500-2599/2588.Count%20the%20Number%20of%20Beautiful%20Subarrays/README_EN.md) -- [2589. Minimum Time to Complete All Tasks](/solution/2500-2599/2589.Minimum%20Time%20to%20Complete%20All%20Tasks/README_EN.md) - -#### Weekly Contest 335 - -- [2582. Pass the Pillow](/solution/2500-2599/2582.Pass%20the%20Pillow/README_EN.md) -- [2583. Kth Largest Sum in a Binary Tree](/solution/2500-2599/2583.Kth%20Largest%20Sum%20in%20a%20Binary%20Tree/README_EN.md) -- [2584. Split the Array to Make Coprime Products](/solution/2500-2599/2584.Split%20the%20Array%20to%20Make%20Coprime%20Products/README_EN.md) -- [2585. Number of Ways to Earn Points](/solution/2500-2599/2585.Number%20of%20Ways%20to%20Earn%20Points/README_EN.md) - -#### Biweekly Contest 99 - -- [2578. Split With Minimum Sum](/solution/2500-2599/2578.Split%20With%20Minimum%20Sum/README_EN.md) -- [2579. Count Total Number of Colored Cells](/solution/2500-2599/2579.Count%20Total%20Number%20of%20Colored%20Cells/README_EN.md) -- [2580. Count Ways to Group Overlapping Ranges](/solution/2500-2599/2580.Count%20Ways%20to%20Group%20Overlapping%20Ranges/README_EN.md) -- [2581. Count Number of Possible Root Nodes](/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README_EN.md) - -#### Weekly Contest 334 - -- [2574. Left and Right Sum Differences](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README_EN.md) -- [2575. Find the Divisibility Array of a String](/solution/2500-2599/2575.Find%20the%20Divisibility%20Array%20of%20a%20String/README_EN.md) -- [2576. Find the Maximum Number of Marked Indices](/solution/2500-2599/2576.Find%20the%20Maximum%20Number%20of%20Marked%20Indices/README_EN.md) -- [2577. Minimum Time to Visit a Cell In a Grid](/solution/2500-2599/2577.Minimum%20Time%20to%20Visit%20a%20Cell%20In%20a%20Grid/README_EN.md) - -#### Weekly Contest 333 - -- [2570. Merge Two 2D Arrays by Summing Values](/solution/2500-2599/2570.Merge%20Two%202D%20Arrays%20by%20Summing%20Values/README_EN.md) -- [2571. Minimum Operations to Reduce an Integer to 0](/solution/2500-2599/2571.Minimum%20Operations%20to%20Reduce%20an%20Integer%20to%200/README_EN.md) -- [2572. Count the Number of Square-Free Subsets](/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README_EN.md) -- [2573. Find the String with LCP](/solution/2500-2599/2573.Find%20the%20String%20with%20LCP/README_EN.md) - -#### Biweekly Contest 98 - -- [2566. Maximum Difference by Remapping a Digit](/solution/2500-2599/2566.Maximum%20Difference%20by%20Remapping%20a%20Digit/README_EN.md) -- [2567. Minimum Score by Changing Two Elements](/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README_EN.md) -- [2568. Minimum Impossible OR](/solution/2500-2599/2568.Minimum%20Impossible%20OR/README_EN.md) -- [2569. Handling Sum Queries After Update](/solution/2500-2599/2569.Handling%20Sum%20Queries%20After%20Update/README_EN.md) - -#### Weekly Contest 332 - -- [2562. Find the Array Concatenation Value](/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README_EN.md) -- [2563. Count the Number of Fair Pairs](/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README_EN.md) -- [2564. Substring XOR Queries](/solution/2500-2599/2564.Substring%20XOR%20Queries/README_EN.md) -- [2565. Subsequence With the Minimum Score](/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README_EN.md) - -#### Weekly Contest 331 - -- [2558. Take Gifts From the Richest Pile](/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README_EN.md) -- [2559. Count Vowel Strings in Ranges](/solution/2500-2599/2559.Count%20Vowel%20Strings%20in%20Ranges/README_EN.md) -- [2560. House Robber IV](/solution/2500-2599/2560.House%20Robber%20IV/README_EN.md) -- [2561. Rearranging Fruits](/solution/2500-2599/2561.Rearranging%20Fruits/README_EN.md) - -#### Biweekly Contest 97 - -- [2553. Separate the Digits in an Array](/solution/2500-2599/2553.Separate%20the%20Digits%20in%20an%20Array/README_EN.md) -- [2554. Maximum Number of Integers to Choose From a Range I](/solution/2500-2599/2554.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20I/README_EN.md) -- [2555. Maximize Win From Two Segments](/solution/2500-2599/2555.Maximize%20Win%20From%20Two%20Segments/README_EN.md) -- [2556. Disconnect Path in a Binary Matrix by at Most One Flip](/solution/2500-2599/2556.Disconnect%20Path%20in%20a%20Binary%20Matrix%20by%20at%20Most%20One%20Flip/README_EN.md) - -#### Weekly Contest 330 - -- [2549. Count Distinct Numbers on Board](/solution/2500-2599/2549.Count%20Distinct%20Numbers%20on%20Board/README_EN.md) -- [2550. Count Collisions of Monkeys on a Polygon](/solution/2500-2599/2550.Count%20Collisions%20of%20Monkeys%20on%20a%20Polygon/README_EN.md) -- [2551. Put Marbles in Bags](/solution/2500-2599/2551.Put%20Marbles%20in%20Bags/README_EN.md) -- [2552. Count Increasing Quadruplets](/solution/2500-2599/2552.Count%20Increasing%20Quadruplets/README_EN.md) - -#### Weekly Contest 329 - -- [2544. Alternating Digit Sum](/solution/2500-2599/2544.Alternating%20Digit%20Sum/README_EN.md) -- [2545. Sort the Students by Their Kth Score](/solution/2500-2599/2545.Sort%20the%20Students%20by%20Their%20Kth%20Score/README_EN.md) -- [2546. Apply Bitwise Operations to Make Strings Equal](/solution/2500-2599/2546.Apply%20Bitwise%20Operations%20to%20Make%20Strings%20Equal/README_EN.md) -- [2547. Minimum Cost to Split an Array](/solution/2500-2599/2547.Minimum%20Cost%20to%20Split%20an%20Array/README_EN.md) - -#### Biweekly Contest 96 - -- [2540. Minimum Common Value](/solution/2500-2599/2540.Minimum%20Common%20Value/README_EN.md) -- [2541. Minimum Operations to Make Array Equal II](/solution/2500-2599/2541.Minimum%20Operations%20to%20Make%20Array%20Equal%20II/README_EN.md) -- [2542. Maximum Subsequence Score](/solution/2500-2599/2542.Maximum%20Subsequence%20Score/README_EN.md) -- [2543. Check if Point Is Reachable](/solution/2500-2599/2543.Check%20if%20Point%20Is%20Reachable/README_EN.md) - -#### Weekly Contest 328 - -- [2535. Difference Between Element Sum and Digit Sum of an Array](/solution/2500-2599/2535.Difference%20Between%20Element%20Sum%20and%20Digit%20Sum%20of%20an%20Array/README_EN.md) -- [2536. Increment Submatrices by One](/solution/2500-2599/2536.Increment%20Submatrices%20by%20One/README_EN.md) -- [2537. Count the Number of Good Subarrays](/solution/2500-2599/2537.Count%20the%20Number%20of%20Good%20Subarrays/README_EN.md) -- [2538. Difference Between Maximum and Minimum Price Sum](/solution/2500-2599/2538.Difference%20Between%20Maximum%20and%20Minimum%20Price%20Sum/README_EN.md) - -#### Weekly Contest 327 - -- [2529. Maximum Count of Positive Integer and Negative Integer](/solution/2500-2599/2529.Maximum%20Count%20of%20Positive%20Integer%20and%20Negative%20Integer/README_EN.md) -- [2530. Maximal Score After Applying K Operations](/solution/2500-2599/2530.Maximal%20Score%20After%20Applying%20K%20Operations/README_EN.md) -- [2531. Make Number of Distinct Characters Equal](/solution/2500-2599/2531.Make%20Number%20of%20Distinct%20Characters%20Equal/README_EN.md) -- [2532. Time to Cross a Bridge](/solution/2500-2599/2532.Time%20to%20Cross%20a%20Bridge/README_EN.md) - -#### Biweekly Contest 95 - -- [2525. Categorize Box According to Criteria](/solution/2500-2599/2525.Categorize%20Box%20According%20to%20Criteria/README_EN.md) -- [2526. Find Consecutive Integers from a Data Stream](/solution/2500-2599/2526.Find%20Consecutive%20Integers%20from%20a%20Data%20Stream/README_EN.md) -- [2527. Find Xor-Beauty of Array](/solution/2500-2599/2527.Find%20Xor-Beauty%20of%20Array/README_EN.md) -- [2528. Maximize the Minimum Powered City](/solution/2500-2599/2528.Maximize%20the%20Minimum%20Powered%20City/README_EN.md) - -#### Weekly Contest 326 - -- [2520. Count the Digits That Divide a Number](/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README_EN.md) -- [2521. Distinct Prime Factors of Product of Array](/solution/2500-2599/2521.Distinct%20Prime%20Factors%20of%20Product%20of%20Array/README_EN.md) -- [2522. Partition String Into Substrings With Values at Most K](/solution/2500-2599/2522.Partition%20String%20Into%20Substrings%20With%20Values%20at%20Most%20K/README_EN.md) -- [2523. Closest Prime Numbers in Range](/solution/2500-2599/2523.Closest%20Prime%20Numbers%20in%20Range/README_EN.md) - -#### Weekly Contest 325 - -- [2515. Shortest Distance to Target String in a Circular Array](/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README_EN.md) -- [2516. Take K of Each Character From Left and Right](/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README_EN.md) -- [2517. Maximum Tastiness of Candy Basket](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README_EN.md) -- [2518. Number of Great Partitions](/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README_EN.md) - -#### Biweekly Contest 94 - -- [2511. Maximum Enemy Forts That Can Be Captured](/solution/2500-2599/2511.Maximum%20Enemy%20Forts%20That%20Can%20Be%20Captured/README_EN.md) -- [2512. Reward Top K Students](/solution/2500-2599/2512.Reward%20Top%20K%20Students/README_EN.md) -- [2513. Minimize the Maximum of Two Arrays](/solution/2500-2599/2513.Minimize%20the%20Maximum%20of%20Two%20Arrays/README_EN.md) -- [2514. Count Anagrams](/solution/2500-2599/2514.Count%20Anagrams/README_EN.md) - -#### Weekly Contest 324 - -- [2506. Count Pairs Of Similar Strings](/solution/2500-2599/2506.Count%20Pairs%20Of%20Similar%20Strings/README_EN.md) -- [2507. Smallest Value After Replacing With Sum of Prime Factors](/solution/2500-2599/2507.Smallest%20Value%20After%20Replacing%20With%20Sum%20of%20Prime%20Factors/README_EN.md) -- [2508. Add Edges to Make Degrees of All Nodes Even](/solution/2500-2599/2508.Add%20Edges%20to%20Make%20Degrees%20of%20All%20Nodes%20Even/README_EN.md) -- [2509. Cycle Length Queries in a Tree](/solution/2500-2599/2509.Cycle%20Length%20Queries%20in%20a%20Tree/README_EN.md) - -#### Weekly Contest 323 - -- [2500. Delete Greatest Value in Each Row](/solution/2500-2599/2500.Delete%20Greatest%20Value%20in%20Each%20Row/README_EN.md) -- [2501. Longest Square Streak in an Array](/solution/2500-2599/2501.Longest%20Square%20Streak%20in%20an%20Array/README_EN.md) -- [2502. Design Memory Allocator](/solution/2500-2599/2502.Design%20Memory%20Allocator/README_EN.md) -- [2503. Maximum Number of Points From Grid Queries](/solution/2500-2599/2503.Maximum%20Number%20of%20Points%20From%20Grid%20Queries/README_EN.md) - -#### Biweekly Contest 93 - -- [2496. Maximum Value of a String in an Array](/solution/2400-2499/2496.Maximum%20Value%20of%20a%20String%20in%20an%20Array/README_EN.md) -- [2497. Maximum Star Sum of a Graph](/solution/2400-2499/2497.Maximum%20Star%20Sum%20of%20a%20Graph/README_EN.md) -- [2498. Frog Jump II](/solution/2400-2499/2498.Frog%20Jump%20II/README_EN.md) -- [2499. Minimum Total Cost to Make Arrays Unequal](/solution/2400-2499/2499.Minimum%20Total%20Cost%20to%20Make%20Arrays%20Unequal/README_EN.md) - -#### Weekly Contest 322 - -- [2490. Circular Sentence](/solution/2400-2499/2490.Circular%20Sentence/README_EN.md) -- [2491. Divide Players Into Teams of Equal Skill](/solution/2400-2499/2491.Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/README_EN.md) -- [2492. Minimum Score of a Path Between Two Cities](/solution/2400-2499/2492.Minimum%20Score%20of%20a%20Path%20Between%20Two%20Cities/README_EN.md) -- [2493. Divide Nodes Into the Maximum Number of Groups](/solution/2400-2499/2493.Divide%20Nodes%20Into%20the%20Maximum%20Number%20of%20Groups/README_EN.md) - -#### Weekly Contest 321 - -- [2485. Find the Pivot Integer](/solution/2400-2499/2485.Find%20the%20Pivot%20Integer/README_EN.md) -- [2486. Append Characters to String to Make Subsequence](/solution/2400-2499/2486.Append%20Characters%20to%20String%20to%20Make%20Subsequence/README_EN.md) -- [2487. Remove Nodes From Linked List](/solution/2400-2499/2487.Remove%20Nodes%20From%20Linked%20List/README_EN.md) -- [2488. Count Subarrays With Median K](/solution/2400-2499/2488.Count%20Subarrays%20With%20Median%20K/README_EN.md) - -#### Biweekly Contest 92 - -- [2481. Minimum Cuts to Divide a Circle](/solution/2400-2499/2481.Minimum%20Cuts%20to%20Divide%20a%20Circle/README_EN.md) -- [2482. Difference Between Ones and Zeros in Row and Column](/solution/2400-2499/2482.Difference%20Between%20Ones%20and%20Zeros%20in%20Row%20and%20Column/README_EN.md) -- [2483. Minimum Penalty for a Shop](/solution/2400-2499/2483.Minimum%20Penalty%20for%20a%20Shop/README_EN.md) -- [2484. Count Palindromic Subsequences](/solution/2400-2499/2484.Count%20Palindromic%20Subsequences/README_EN.md) - -#### Weekly Contest 320 - -- [2475. Number of Unequal Triplets in Array](/solution/2400-2499/2475.Number%20of%20Unequal%20Triplets%20in%20Array/README_EN.md) -- [2476. Closest Nodes Queries in a Binary Search Tree](/solution/2400-2499/2476.Closest%20Nodes%20Queries%20in%20a%20Binary%20Search%20Tree/README_EN.md) -- [2477. Minimum Fuel Cost to Report to the Capital](/solution/2400-2499/2477.Minimum%20Fuel%20Cost%20to%20Report%20to%20the%20Capital/README_EN.md) -- [2478. Number of Beautiful Partitions](/solution/2400-2499/2478.Number%20of%20Beautiful%20Partitions/README_EN.md) - -#### Weekly Contest 319 - -- [2469. Convert the Temperature](/solution/2400-2499/2469.Convert%20the%20Temperature/README_EN.md) -- [2470. Number of Subarrays With LCM Equal to K](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README_EN.md) -- [2471. Minimum Number of Operations to Sort a Binary Tree by Level](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README_EN.md) -- [2472. Maximum Number of Non-overlapping Palindrome Substrings](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README_EN.md) - -#### Biweekly Contest 91 - -- [2465. Number of Distinct Averages](/solution/2400-2499/2465.Number%20of%20Distinct%20Averages/README_EN.md) -- [2466. Count Ways To Build Good Strings](/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README_EN.md) -- [2467. Most Profitable Path in a Tree](/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README_EN.md) -- [2468. Split Message Based on Limit](/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README_EN.md) - -#### Weekly Contest 318 - -- [2460. Apply Operations to an Array](/solution/2400-2499/2460.Apply%20Operations%20to%20an%20Array/README_EN.md) -- [2461. Maximum Sum of Distinct Subarrays With Length K](/solution/2400-2499/2461.Maximum%20Sum%20of%20Distinct%20Subarrays%20With%20Length%20K/README_EN.md) -- [2462. Total Cost to Hire K Workers](/solution/2400-2499/2462.Total%20Cost%20to%20Hire%20K%20Workers/README_EN.md) -- [2463. Minimum Total Distance Traveled](/solution/2400-2499/2463.Minimum%20Total%20Distance%20Traveled/README_EN.md) - -#### Weekly Contest 317 - -- [2455. Average Value of Even Numbers That Are Divisible by Three](/solution/2400-2499/2455.Average%20Value%20of%20Even%20Numbers%20That%20Are%20Divisible%20by%20Three/README_EN.md) -- [2456. Most Popular Video Creator](/solution/2400-2499/2456.Most%20Popular%20Video%20Creator/README_EN.md) -- [2457. Minimum Addition to Make Integer Beautiful](/solution/2400-2499/2457.Minimum%20Addition%20to%20Make%20Integer%20Beautiful/README_EN.md) -- [2458. Height of Binary Tree After Subtree Removal Queries](/solution/2400-2499/2458.Height%20of%20Binary%20Tree%20After%20Subtree%20Removal%20Queries/README_EN.md) - -#### Biweekly Contest 90 - -- [2451. Odd String Difference](/solution/2400-2499/2451.Odd%20String%20Difference/README_EN.md) -- [2452. Words Within Two Edits of Dictionary](/solution/2400-2499/2452.Words%20Within%20Two%20Edits%20of%20Dictionary/README_EN.md) -- [2453. Destroy Sequential Targets](/solution/2400-2499/2453.Destroy%20Sequential%20Targets/README_EN.md) -- [2454. Next Greater Element IV](/solution/2400-2499/2454.Next%20Greater%20Element%20IV/README_EN.md) - -#### Weekly Contest 316 - -- [2446. Determine if Two Events Have Conflict](/solution/2400-2499/2446.Determine%20if%20Two%20Events%20Have%20Conflict/README_EN.md) -- [2447. Number of Subarrays With GCD Equal to K](/solution/2400-2499/2447.Number%20of%20Subarrays%20With%20GCD%20Equal%20to%20K/README_EN.md) -- [2448. Minimum Cost to Make Array Equal](/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README_EN.md) -- [2449. Minimum Number of Operations to Make Arrays Similar](/solution/2400-2499/2449.Minimum%20Number%20of%20Operations%20to%20Make%20Arrays%20Similar/README_EN.md) - -#### Weekly Contest 315 - -- [2441. Largest Positive Integer That Exists With Its Negative](/solution/2400-2499/2441.Largest%20Positive%20Integer%20That%20Exists%20With%20Its%20Negative/README_EN.md) -- [2442. Count Number of Distinct Integers After Reverse Operations](/solution/2400-2499/2442.Count%20Number%20of%20Distinct%20Integers%20After%20Reverse%20Operations/README_EN.md) -- [2443. Sum of Number and Its Reverse](/solution/2400-2499/2443.Sum%20of%20Number%20and%20Its%20Reverse/README_EN.md) -- [2444. Count Subarrays With Fixed Bounds](/solution/2400-2499/2444.Count%20Subarrays%20With%20Fixed%20Bounds/README_EN.md) - -#### Biweekly Contest 89 - -- [2437. Number of Valid Clock Times](/solution/2400-2499/2437.Number%20of%20Valid%20Clock%20Times/README_EN.md) -- [2438. Range Product Queries of Powers](/solution/2400-2499/2438.Range%20Product%20Queries%20of%20Powers/README_EN.md) -- [2439. Minimize Maximum of Array](/solution/2400-2499/2439.Minimize%20Maximum%20of%20Array/README_EN.md) -- [2440. Create Components With Same Value](/solution/2400-2499/2440.Create%20Components%20With%20Same%20Value/README_EN.md) - -#### Weekly Contest 314 - -- [2432. The Employee That Worked on the Longest Task](/solution/2400-2499/2432.The%20Employee%20That%20Worked%20on%20the%20Longest%20Task/README_EN.md) -- [2433. Find The Original Array of Prefix Xor](/solution/2400-2499/2433.Find%20The%20Original%20Array%20of%20Prefix%20Xor/README_EN.md) -- [2434. Using a Robot to Print the Lexicographically Smallest String](/solution/2400-2499/2434.Using%20a%20Robot%20to%20Print%20the%20Lexicographically%20Smallest%20String/README_EN.md) -- [2435. Paths in Matrix Whose Sum Is Divisible by K](/solution/2400-2499/2435.Paths%20in%20Matrix%20Whose%20Sum%20Is%20Divisible%20by%20K/README_EN.md) - -#### Weekly Contest 313 - -- [2427. Number of Common Factors](/solution/2400-2499/2427.Number%20of%20Common%20Factors/README_EN.md) -- [2428. Maximum Sum of an Hourglass](/solution/2400-2499/2428.Maximum%20Sum%20of%20an%20Hourglass/README_EN.md) -- [2429. Minimize XOR](/solution/2400-2499/2429.Minimize%20XOR/README_EN.md) -- [2430. Maximum Deletions on a String](/solution/2400-2499/2430.Maximum%20Deletions%20on%20a%20String/README_EN.md) - -#### Biweekly Contest 88 - -- [2423. Remove Letter To Equalize Frequency](/solution/2400-2499/2423.Remove%20Letter%20To%20Equalize%20Frequency/README_EN.md) -- [2424. Longest Uploaded Prefix](/solution/2400-2499/2424.Longest%20Uploaded%20Prefix/README_EN.md) -- [2425. Bitwise XOR of All Pairings](/solution/2400-2499/2425.Bitwise%20XOR%20of%20All%20Pairings/README_EN.md) -- [2426. Number of Pairs Satisfying Inequality](/solution/2400-2499/2426.Number%20of%20Pairs%20Satisfying%20Inequality/README_EN.md) - -#### Weekly Contest 312 - -- [2418. Sort the People](/solution/2400-2499/2418.Sort%20the%20People/README_EN.md) -- [2419. Longest Subarray With Maximum Bitwise AND](/solution/2400-2499/2419.Longest%20Subarray%20With%20Maximum%20Bitwise%20AND/README_EN.md) -- [2420. Find All Good Indices](/solution/2400-2499/2420.Find%20All%20Good%20Indices/README_EN.md) -- [2421. Number of Good Paths](/solution/2400-2499/2421.Number%20of%20Good%20Paths/README_EN.md) - -#### Weekly Contest 311 - -- [2413. Smallest Even Multiple](/solution/2400-2499/2413.Smallest%20Even%20Multiple/README_EN.md) -- [2414. Length of the Longest Alphabetical Continuous Substring](/solution/2400-2499/2414.Length%20of%20the%20Longest%20Alphabetical%20Continuous%20Substring/README_EN.md) -- [2415. Reverse Odd Levels of Binary Tree](/solution/2400-2499/2415.Reverse%20Odd%20Levels%20of%20Binary%20Tree/README_EN.md) -- [2416. Sum of Prefix Scores of Strings](/solution/2400-2499/2416.Sum%20of%20Prefix%20Scores%20of%20Strings/README_EN.md) - -#### Biweekly Contest 87 - -- [2409. Count Days Spent Together](/solution/2400-2499/2409.Count%20Days%20Spent%20Together/README_EN.md) -- [2410. Maximum Matching of Players With Trainers](/solution/2400-2499/2410.Maximum%20Matching%20of%20Players%20With%20Trainers/README_EN.md) -- [2411. Smallest Subarrays With Maximum Bitwise OR](/solution/2400-2499/2411.Smallest%20Subarrays%20With%20Maximum%20Bitwise%20OR/README_EN.md) -- [2412. Minimum Money Required Before Transactions](/solution/2400-2499/2412.Minimum%20Money%20Required%20Before%20Transactions/README_EN.md) - -#### Weekly Contest 310 - -- [2404. Most Frequent Even Element](/solution/2400-2499/2404.Most%20Frequent%20Even%20Element/README_EN.md) -- [2405. Optimal Partition of String](/solution/2400-2499/2405.Optimal%20Partition%20of%20String/README_EN.md) -- [2406. Divide Intervals Into Minimum Number of Groups](/solution/2400-2499/2406.Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/README_EN.md) -- [2407. Longest Increasing Subsequence II](/solution/2400-2499/2407.Longest%20Increasing%20Subsequence%20II/README_EN.md) - -#### Weekly Contest 309 - -- [2399. Check Distances Between Same Letters](/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README_EN.md) -- [2400. Number of Ways to Reach a Position After Exactly k Steps](/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README_EN.md) -- [2401. Longest Nice Subarray](/solution/2400-2499/2401.Longest%20Nice%20Subarray/README_EN.md) -- [2402. Meeting Rooms III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README_EN.md) - -#### Biweekly Contest 86 - -- [2395. Find Subarrays With Equal Sum](/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README_EN.md) -- [2396. Strictly Palindromic Number](/solution/2300-2399/2396.Strictly%20Palindromic%20Number/README_EN.md) -- [2397. Maximum Rows Covered by Columns](/solution/2300-2399/2397.Maximum%20Rows%20Covered%20by%20Columns/README_EN.md) -- [2398. Maximum Number of Robots Within Budget](/solution/2300-2399/2398.Maximum%20Number%20of%20Robots%20Within%20Budget/README_EN.md) - -#### Weekly Contest 308 - -- [2389. Longest Subsequence With Limited Sum](/solution/2300-2399/2389.Longest%20Subsequence%20With%20Limited%20Sum/README_EN.md) -- [2390. Removing Stars From a String](/solution/2300-2399/2390.Removing%20Stars%20From%20a%20String/README_EN.md) -- [2391. Minimum Amount of Time to Collect Garbage](/solution/2300-2399/2391.Minimum%20Amount%20of%20Time%20to%20Collect%20Garbage/README_EN.md) -- [2392. Build a Matrix With Conditions](/solution/2300-2399/2392.Build%20a%20Matrix%20With%20Conditions/README_EN.md) - -#### Weekly Contest 307 - -- [2383. Minimum Hours of Training to Win a Competition](/solution/2300-2399/2383.Minimum%20Hours%20of%20Training%20to%20Win%20a%20Competition/README_EN.md) -- [2384. Largest Palindromic Number](/solution/2300-2399/2384.Largest%20Palindromic%20Number/README_EN.md) -- [2385. Amount of Time for Binary Tree to Be Infected](/solution/2300-2399/2385.Amount%20of%20Time%20for%20Binary%20Tree%20to%20Be%20Infected/README_EN.md) -- [2386. Find the K-Sum of an Array](/solution/2300-2399/2386.Find%20the%20K-Sum%20of%20an%20Array/README_EN.md) - -#### Biweekly Contest 85 - -- [2379. Minimum Recolors to Get K Consecutive Black Blocks](/solution/2300-2399/2379.Minimum%20Recolors%20to%20Get%20K%20Consecutive%20Black%20Blocks/README_EN.md) -- [2380. Time Needed to Rearrange a Binary String](/solution/2300-2399/2380.Time%20Needed%20to%20Rearrange%20a%20Binary%20String/README_EN.md) -- [2381. Shifting Letters II](/solution/2300-2399/2381.Shifting%20Letters%20II/README_EN.md) -- [2382. Maximum Segment Sum After Removals](/solution/2300-2399/2382.Maximum%20Segment%20Sum%20After%20Removals/README_EN.md) - -#### Weekly Contest 306 - -- [2373. Largest Local Values in a Matrix](/solution/2300-2399/2373.Largest%20Local%20Values%20in%20a%20Matrix/README_EN.md) -- [2374. Node With Highest Edge Score](/solution/2300-2399/2374.Node%20With%20Highest%20Edge%20Score/README_EN.md) -- [2375. Construct Smallest Number From DI String](/solution/2300-2399/2375.Construct%20Smallest%20Number%20From%20DI%20String/README_EN.md) -- [2376. Count Special Integers](/solution/2300-2399/2376.Count%20Special%20Integers/README_EN.md) - -#### Weekly Contest 305 - -- [2367. Number of Arithmetic Triplets](/solution/2300-2399/2367.Number%20of%20Arithmetic%20Triplets/README_EN.md) -- [2368. Reachable Nodes With Restrictions](/solution/2300-2399/2368.Reachable%20Nodes%20With%20Restrictions/README_EN.md) -- [2369. Check if There is a Valid Partition For The Array](/solution/2300-2399/2369.Check%20if%20There%20is%20a%20Valid%20Partition%20For%20The%20Array/README_EN.md) -- [2370. Longest Ideal Subsequence](/solution/2300-2399/2370.Longest%20Ideal%20Subsequence/README_EN.md) - -#### Biweekly Contest 84 - -- [2363. Merge Similar Items](/solution/2300-2399/2363.Merge%20Similar%20Items/README_EN.md) -- [2364. Count Number of Bad Pairs](/solution/2300-2399/2364.Count%20Number%20of%20Bad%20Pairs/README_EN.md) -- [2365. Task Scheduler II](/solution/2300-2399/2365.Task%20Scheduler%20II/README_EN.md) -- [2366. Minimum Replacements to Sort the Array](/solution/2300-2399/2366.Minimum%20Replacements%20to%20Sort%20the%20Array/README_EN.md) - -#### Weekly Contest 304 - -- [2357. Make Array Zero by Subtracting Equal Amounts](/solution/2300-2399/2357.Make%20Array%20Zero%20by%20Subtracting%20Equal%20Amounts/README_EN.md) -- [2358. Maximum Number of Groups Entering a Competition](/solution/2300-2399/2358.Maximum%20Number%20of%20Groups%20Entering%20a%20Competition/README_EN.md) -- [2359. Find Closest Node to Given Two Nodes](/solution/2300-2399/2359.Find%20Closest%20Node%20to%20Given%20Two%20Nodes/README_EN.md) -- [2360. Longest Cycle in a Graph](/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README_EN.md) - -#### Weekly Contest 303 - -- [2351. First Letter to Appear Twice](/solution/2300-2399/2351.First%20Letter%20to%20Appear%20Twice/README_EN.md) -- [2352. Equal Row and Column Pairs](/solution/2300-2399/2352.Equal%20Row%20and%20Column%20Pairs/README_EN.md) -- [2353. Design a Food Rating System](/solution/2300-2399/2353.Design%20a%20Food%20Rating%20System/README_EN.md) -- [2354. Number of Excellent Pairs](/solution/2300-2399/2354.Number%20of%20Excellent%20Pairs/README_EN.md) - -#### Biweekly Contest 83 - -- [2347. Best Poker Hand](/solution/2300-2399/2347.Best%20Poker%20Hand/README_EN.md) -- [2348. Number of Zero-Filled Subarrays](/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README_EN.md) -- [2349. Design a Number Container System](/solution/2300-2399/2349.Design%20a%20Number%20Container%20System/README_EN.md) -- [2350. Shortest Impossible Sequence of Rolls](/solution/2300-2399/2350.Shortest%20Impossible%20Sequence%20of%20Rolls/README_EN.md) - -#### Weekly Contest 302 - -- [2341. Maximum Number of Pairs in Array](/solution/2300-2399/2341.Maximum%20Number%20of%20Pairs%20in%20Array/README_EN.md) -- [2342. Max Sum of a Pair With Equal Sum of Digits](/solution/2300-2399/2342.Max%20Sum%20of%20a%20Pair%20With%20Equal%20Sum%20of%20Digits/README_EN.md) -- [2343. Query Kth Smallest Trimmed Number](/solution/2300-2399/2343.Query%20Kth%20Smallest%20Trimmed%20Number/README_EN.md) -- [2344. Minimum Deletions to Make Array Divisible](/solution/2300-2399/2344.Minimum%20Deletions%20to%20Make%20Array%20Divisible/README_EN.md) - -#### Weekly Contest 301 - -- [2335. Minimum Amount of Time to Fill Cups](/solution/2300-2399/2335.Minimum%20Amount%20of%20Time%20to%20Fill%20Cups/README_EN.md) -- [2336. Smallest Number in Infinite Set](/solution/2300-2399/2336.Smallest%20Number%20in%20Infinite%20Set/README_EN.md) -- [2337. Move Pieces to Obtain a String](/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README_EN.md) -- [2338. Count the Number of Ideal Arrays](/solution/2300-2399/2338.Count%20the%20Number%20of%20Ideal%20Arrays/README_EN.md) - -#### Biweekly Contest 82 - -- [2331. Evaluate Boolean Binary Tree](/solution/2300-2399/2331.Evaluate%20Boolean%20Binary%20Tree/README_EN.md) -- [2332. The Latest Time to Catch a Bus](/solution/2300-2399/2332.The%20Latest%20Time%20to%20Catch%20a%20Bus/README_EN.md) -- [2333. Minimum Sum of Squared Difference](/solution/2300-2399/2333.Minimum%20Sum%20of%20Squared%20Difference/README_EN.md) -- [2334. Subarray With Elements Greater Than Varying Threshold](/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README_EN.md) - -#### Weekly Contest 300 - -- [2325. Decode the Message](/solution/2300-2399/2325.Decode%20the%20Message/README_EN.md) -- [2326. Spiral Matrix IV](/solution/2300-2399/2326.Spiral%20Matrix%20IV/README_EN.md) -- [2327. Number of People Aware of a Secret](/solution/2300-2399/2327.Number%20of%20People%20Aware%20of%20a%20Secret/README_EN.md) -- [2328. Number of Increasing Paths in a Grid](/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README_EN.md) - -#### Weekly Contest 299 - -- [2319. Check if Matrix Is X-Matrix](/solution/2300-2399/2319.Check%20if%20Matrix%20Is%20X-Matrix/README_EN.md) -- [2320. Count Number of Ways to Place Houses](/solution/2300-2399/2320.Count%20Number%20of%20Ways%20to%20Place%20Houses/README_EN.md) -- [2321. Maximum Score Of Spliced Array](/solution/2300-2399/2321.Maximum%20Score%20Of%20Spliced%20Array/README_EN.md) -- [2322. Minimum Score After Removals on a Tree](/solution/2300-2399/2322.Minimum%20Score%20After%20Removals%20on%20a%20Tree/README_EN.md) - -#### Biweekly Contest 81 - -- [2315. Count Asterisks](/solution/2300-2399/2315.Count%20Asterisks/README_EN.md) -- [2316. Count Unreachable Pairs of Nodes in an Undirected Graph](/solution/2300-2399/2316.Count%20Unreachable%20Pairs%20of%20Nodes%20in%20an%20Undirected%20Graph/README_EN.md) -- [2317. Maximum XOR After Operations](/solution/2300-2399/2317.Maximum%20XOR%20After%20Operations/README_EN.md) -- [2318. Number of Distinct Roll Sequences](/solution/2300-2399/2318.Number%20of%20Distinct%20Roll%20Sequences/README_EN.md) - -#### Weekly Contest 298 - -- [2309. Greatest English Letter in Upper and Lower Case](/solution/2300-2399/2309.Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case/README_EN.md) -- [2310. Sum of Numbers With Units Digit K](/solution/2300-2399/2310.Sum%20of%20Numbers%20With%20Units%20Digit%20K/README_EN.md) -- [2311. Longest Binary Subsequence Less Than or Equal to K](/solution/2300-2399/2311.Longest%20Binary%20Subsequence%20Less%20Than%20or%20Equal%20to%20K/README_EN.md) -- [2312. Selling Pieces of Wood](/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README_EN.md) - -#### Weekly Contest 297 - -- [2303. Calculate Amount Paid in Taxes](/solution/2300-2399/2303.Calculate%20Amount%20Paid%20in%20Taxes/README_EN.md) -- [2304. Minimum Path Cost in a Grid](/solution/2300-2399/2304.Minimum%20Path%20Cost%20in%20a%20Grid/README_EN.md) -- [2305. Fair Distribution of Cookies](/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README_EN.md) -- [2306. Naming a Company](/solution/2300-2399/2306.Naming%20a%20Company/README_EN.md) - -#### Biweekly Contest 80 - -- [2299. Strong Password Checker II](/solution/2200-2299/2299.Strong%20Password%20Checker%20II/README_EN.md) -- [2300. Successful Pairs of Spells and Potions](/solution/2300-2399/2300.Successful%20Pairs%20of%20Spells%20and%20Potions/README_EN.md) -- [2301. Match Substring After Replacement](/solution/2300-2399/2301.Match%20Substring%20After%20Replacement/README_EN.md) -- [2302. Count Subarrays With Score Less Than K](/solution/2300-2399/2302.Count%20Subarrays%20With%20Score%20Less%20Than%20K/README_EN.md) - -#### Weekly Contest 296 - -- [2293. Min Max Game](/solution/2200-2299/2293.Min%20Max%20Game/README_EN.md) -- [2294. Partition Array Such That Maximum Difference Is K](/solution/2200-2299/2294.Partition%20Array%20Such%20That%20Maximum%20Difference%20Is%20K/README_EN.md) -- [2295. Replace Elements in an Array](/solution/2200-2299/2295.Replace%20Elements%20in%20an%20Array/README_EN.md) -- [2296. Design a Text Editor](/solution/2200-2299/2296.Design%20a%20Text%20Editor/README_EN.md) - -#### Weekly Contest 295 - -- [2287. Rearrange Characters to Make Target String](/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README_EN.md) -- [2288. Apply Discount to Prices](/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README_EN.md) -- [2289. Steps to Make Array Non-decreasing](/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README_EN.md) -- [2290. Minimum Obstacle Removal to Reach Corner](/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README_EN.md) - -#### Biweekly Contest 79 - -- [2283. Check if Number Has Equal Digit Count and Digit Value](/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README_EN.md) -- [2284. Sender With Largest Word Count](/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README_EN.md) -- [2285. Maximum Total Importance of Roads](/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README_EN.md) -- [2286. Booking Concert Tickets in Groups](/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README_EN.md) - -#### Weekly Contest 294 - -- [2278. Percentage of Letter in String](/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README_EN.md) -- [2279. Maximum Bags With Full Capacity of Rocks](/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README_EN.md) -- [2280. Minimum Lines to Represent a Line Chart](/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README_EN.md) -- [2281. Sum of Total Strength of Wizards](/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README_EN.md) - -#### Weekly Contest 293 - -- [2273. Find Resultant Array After Removing Anagrams](/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README_EN.md) -- [2274. Maximum Consecutive Floors Without Special Floors](/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README_EN.md) -- [2275. Largest Combination With Bitwise AND Greater Than Zero](/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README_EN.md) -- [2276. Count Integers in Intervals](/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README_EN.md) - -#### Biweekly Contest 78 - -- [2269. Find the K-Beauty of a Number](/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README_EN.md) -- [2270. Number of Ways to Split Array](/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README_EN.md) -- [2271. Maximum White Tiles Covered by a Carpet](/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README_EN.md) -- [2272. Substring With Largest Variance](/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README_EN.md) - -#### Weekly Contest 292 - -- [2264. Largest 3-Same-Digit Number in String](/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README_EN.md) -- [2265. Count Nodes Equal to Average of Subtree](/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README_EN.md) -- [2266. Count Number of Texts](/solution/2200-2299/2266.Count%20Number%20of%20Texts/README_EN.md) -- [2267. Check if There Is a Valid Parentheses String Path](/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README_EN.md) - -#### Weekly Contest 291 - -- [2259. Remove Digit From Number to Maximize Result](/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README_EN.md) -- [2260. Minimum Consecutive Cards to Pick Up](/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README_EN.md) -- [2261. K Divisible Elements Subarrays](/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README_EN.md) -- [2262. Total Appeal of A String](/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README_EN.md) - -#### Biweekly Contest 77 - -- [2255. Count Prefixes of a Given String](/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README_EN.md) -- [2256. Minimum Average Difference](/solution/2200-2299/2256.Minimum%20Average%20Difference/README_EN.md) -- [2257. Count Unguarded Cells in the Grid](/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README_EN.md) -- [2258. Escape the Spreading Fire](/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README_EN.md) - -#### Weekly Contest 290 - -- [2248. Intersection of Multiple Arrays](/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README_EN.md) -- [2249. Count Lattice Points Inside a Circle](/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README_EN.md) -- [2250. Count Number of Rectangles Containing Each Point](/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README_EN.md) -- [2251. Number of Flowers in Full Bloom](/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README_EN.md) - -#### Weekly Contest 289 - -- [2243. Calculate Digit Sum of a String](/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README_EN.md) -- [2244. Minimum Rounds to Complete All Tasks](/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README_EN.md) -- [2245. Maximum Trailing Zeros in a Cornered Path](/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README_EN.md) -- [2246. Longest Path With Different Adjacent Characters](/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README_EN.md) - -#### Biweekly Contest 76 - -- [2239. Find Closest Number to Zero](/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README_EN.md) -- [2240. Number of Ways to Buy Pens and Pencils](/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README_EN.md) -- [2241. Design an ATM Machine](/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README_EN.md) -- [2242. Maximum Score of a Node Sequence](/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README_EN.md) - -#### Weekly Contest 288 - -- [2231. Largest Number After Digit Swaps by Parity](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README_EN.md) -- [2232. Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md) -- [2233. Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md) -- [2234. Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md) - -#### Weekly Contest 287 - -- [2224. Minimum Number of Operations to Convert Time](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README_EN.md) -- [2225. Find Players With Zero or One Losses](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README_EN.md) -- [2226. Maximum Candies Allocated to K Children](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README_EN.md) -- [2227. Encrypt and Decrypt Strings](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README_EN.md) - -#### Biweekly Contest 75 - -- [2220. Minimum Bit Flips to Convert Number](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README_EN.md) -- [2221. Find Triangular Sum of an Array](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README_EN.md) -- [2222. Number of Ways to Select Buildings](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README_EN.md) -- [2223. Sum of Scores of Built Strings](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README_EN.md) - -#### Weekly Contest 286 - -- [2215. Find the Difference of Two Arrays](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README_EN.md) -- [2216. Minimum Deletions to Make Array Beautiful](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README_EN.md) -- [2217. Find Palindrome With Fixed Length](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README_EN.md) -- [2218. Maximum Value of K Coins From Piles](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README_EN.md) - -#### Weekly Contest 285 - -- [2210. Count Hills and Valleys in an Array](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README_EN.md) -- [2211. Count Collisions on a Road](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README_EN.md) -- [2212. Maximum Points in an Archery Competition](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README_EN.md) -- [2213. Longest Substring of One Repeating Character](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README_EN.md) - -#### Biweekly Contest 74 - -- [2206. Divide Array Into Equal Pairs](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README_EN.md) -- [2207. Maximize Number of Subsequences in a String](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README_EN.md) -- [2208. Minimum Operations to Halve Array Sum](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README_EN.md) -- [2209. Minimum White Tiles After Covering With Carpets](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README_EN.md) - -#### Weekly Contest 284 - -- [2200. Find All K-Distant Indices in an Array](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README_EN.md) -- [2201. Count Artifacts That Can Be Extracted](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README_EN.md) -- [2202. Maximize the Topmost Element After K Moves](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README_EN.md) -- [2203. Minimum Weighted Subgraph With the Required Paths](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README_EN.md) - -#### Weekly Contest 283 - -- [2194. Cells in a Range on an Excel Sheet](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README_EN.md) -- [2195. Append K Integers With Minimal Sum](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README_EN.md) -- [2196. Create Binary Tree From Descriptions](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README_EN.md) -- [2197. Replace Non-Coprime Numbers in Array](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README_EN.md) - -#### Biweekly Contest 73 - -- [2190. Most Frequent Number Following Key In an Array](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README_EN.md) -- [2191. Sort the Jumbled Numbers](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README_EN.md) -- [2192. All Ancestors of a Node in a Directed Acyclic Graph](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README_EN.md) -- [2193. Minimum Number of Moves to Make Palindrome](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README_EN.md) - -#### Weekly Contest 282 - -- [2185. Counting Words With a Given Prefix](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README_EN.md) -- [2186. Minimum Number of Steps to Make Two Strings Anagram II](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README_EN.md) -- [2187. Minimum Time to Complete Trips](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README_EN.md) -- [2188. Minimum Time to Finish the Race](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README_EN.md) - -#### Weekly Contest 281 - -- [2180. Count Integers With Even Digit Sum](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README_EN.md) -- [2181. Merge Nodes in Between Zeros](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README_EN.md) -- [2182. Construct String With Repeat Limit](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README_EN.md) -- [2183. Count Array Pairs Divisible by K](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README_EN.md) - -#### Biweekly Contest 72 - -- [2176. Count Equal and Divisible Pairs in an Array](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README_EN.md) -- [2177. Find Three Consecutive Integers That Sum to a Given Number](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README_EN.md) -- [2178. Maximum Split of Positive Even Integers](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README_EN.md) -- [2179. Count Good Triplets in an Array](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README_EN.md) - -#### Weekly Contest 280 - -- [2169. Count Operations to Obtain Zero](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README_EN.md) -- [2170. Minimum Operations to Make the Array Alternating](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README_EN.md) -- [2171. Removing Minimum Number of Magic Beans](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README_EN.md) -- [2172. Maximum AND Sum of Array](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README_EN.md) - -#### Weekly Contest 279 - -- [2164. Sort Even and Odd Indices Independently](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README_EN.md) -- [2165. Smallest Value of the Rearranged Number](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README_EN.md) -- [2166. Design Bitset](/solution/2100-2199/2166.Design%20Bitset/README_EN.md) -- [2167. Minimum Time to Remove All Cars Containing Illegal Goods](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README_EN.md) - -#### Biweekly Contest 71 - -- [2160. Minimum Sum of Four Digit Number After Splitting Digits](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README_EN.md) -- [2161. Partition Array According to Given Pivot](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README_EN.md) -- [2162. Minimum Cost to Set Cooking Time](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README_EN.md) -- [2163. Minimum Difference in Sums After Removal of Elements](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README_EN.md) - -#### Weekly Contest 278 - -- [2154. Keep Multiplying Found Values by Two](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README_EN.md) -- [2155. All Divisions With the Highest Score of a Binary Array](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README_EN.md) -- [2156. Find Substring With Given Hash Value](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README_EN.md) -- [2157. Groups of Strings](/solution/2100-2199/2157.Groups%20of%20Strings/README_EN.md) - -#### Weekly Contest 277 - -- [2148. Count Elements With Strictly Smaller and Greater Elements](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README_EN.md) -- [2149. Rearrange Array Elements by Sign](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README_EN.md) -- [2150. Find All Lonely Numbers in the Array](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README_EN.md) -- [2151. Maximum Good People Based on Statements](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README_EN.md) - -#### Biweekly Contest 70 - -- [2144. Minimum Cost of Buying Candies With Discount](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README_EN.md) -- [2145. Count the Hidden Sequences](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README_EN.md) -- [2146. K Highest Ranked Items Within a Price Range](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README_EN.md) -- [2147. Number of Ways to Divide a Long Corridor](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README_EN.md) - -#### Weekly Contest 276 - -- [2138. Divide a String Into Groups of Size k](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README_EN.md) -- [2139. Minimum Moves to Reach Target Score](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README_EN.md) -- [2140. Solving Questions With Brainpower](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README_EN.md) -- [2141. Maximum Running Time of N Computers](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README_EN.md) - -#### Weekly Contest 275 - -- [2133. Check if Every Row and Column Contains All Numbers](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README_EN.md) -- [2134. Minimum Swaps to Group All 1's Together II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README_EN.md) -- [2135. Count Words Obtained After Adding a Letter](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README_EN.md) -- [2136. Earliest Possible Day of Full Bloom](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README_EN.md) - -#### Biweekly Contest 69 - -- [2129. Capitalize the Title](/solution/2100-2199/2129.Capitalize%20the%20Title/README_EN.md) -- [2130. Maximum Twin Sum of a Linked List](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README_EN.md) -- [2131. Longest Palindrome by Concatenating Two Letter Words](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README_EN.md) -- [2132. Stamping the Grid](/solution/2100-2199/2132.Stamping%20the%20Grid/README_EN.md) - -#### Weekly Contest 274 - -- [2124. Check if All A's Appears Before All B's](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README_EN.md) -- [2125. Number of Laser Beams in a Bank](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README_EN.md) -- [2126. Destroying Asteroids](/solution/2100-2199/2126.Destroying%20Asteroids/README_EN.md) -- [2127. Maximum Employees to Be Invited to a Meeting](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README_EN.md) - -#### Weekly Contest 273 - -- [2119. A Number After a Double Reversal](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README_EN.md) -- [2120. Execution of All Suffix Instructions Staying in a Grid](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README_EN.md) -- [2121. Intervals Between Identical Elements](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README_EN.md) -- [2122. Recover the Original Array](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README_EN.md) - -#### Biweekly Contest 68 - -- [2114. Maximum Number of Words Found in Sentences](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README_EN.md) -- [2115. Find All Possible Recipes from Given Supplies](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README_EN.md) -- [2116. Check if a Parentheses String Can Be Valid](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README_EN.md) -- [2117. Abbreviating the Product of a Range](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README_EN.md) - -#### Weekly Contest 272 - -- [2108. Find First Palindromic String in the Array](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README_EN.md) -- [2109. Adding Spaces to a String](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README_EN.md) -- [2110. Number of Smooth Descent Periods of a Stock](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README_EN.md) -- [2111. Minimum Operations to Make the Array K-Increasing](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README_EN.md) - -#### Weekly Contest 271 - -- [2103. Rings and Rods](/solution/2100-2199/2103.Rings%20and%20Rods/README_EN.md) -- [2104. Sum of Subarray Ranges](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README_EN.md) -- [2105. Watering Plants II](/solution/2100-2199/2105.Watering%20Plants%20II/README_EN.md) -- [2106. Maximum Fruits Harvested After at Most K Steps](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README_EN.md) - -#### Biweekly Contest 67 - -- [2099. Find Subsequence of Length K With the Largest Sum](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README_EN.md) -- [2100. Find Good Days to Rob the Bank](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README_EN.md) -- [2101. Detonate the Maximum Bombs](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README_EN.md) -- [2102. Sequentially Ordinal Rank Tracker](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README_EN.md) - -#### Weekly Contest 270 - -- [2094. Finding 3-Digit Even Numbers](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README_EN.md) -- [2095. Delete the Middle Node of a Linked List](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README_EN.md) -- [2096. Step-By-Step Directions From a Binary Tree Node to Another](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README_EN.md) -- [2097. Valid Arrangement of Pairs](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README_EN.md) - -#### Weekly Contest 269 - -- [2089. Find Target Indices After Sorting Array](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README_EN.md) -- [2090. K Radius Subarray Averages](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README_EN.md) -- [2091. Removing Minimum and Maximum From Array](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README_EN.md) -- [2092. Find All People With Secret](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README_EN.md) - -#### Biweekly Contest 66 - -- [2085. Count Common Words With One Occurrence](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README_EN.md) -- [2086. Minimum Number of Food Buckets to Feed the Hamsters](/solution/2000-2099/2086.Minimum%20Number%20of%20Food%20Buckets%20to%20Feed%20the%20Hamsters/README_EN.md) -- [2087. Minimum Cost Homecoming of a Robot in a Grid](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README_EN.md) -- [2088. Count Fertile Pyramids in a Land](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README_EN.md) - -#### Weekly Contest 268 - -- [2078. Two Furthest Houses With Different Colors](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README_EN.md) -- [2079. Watering Plants](/solution/2000-2099/2079.Watering%20Plants/README_EN.md) -- [2080. Range Frequency Queries](/solution/2000-2099/2080.Range%20Frequency%20Queries/README_EN.md) -- [2081. Sum of k-Mirror Numbers](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README_EN.md) - -#### Weekly Contest 267 - -- [2073. Time Needed to Buy Tickets](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README_EN.md) -- [2074. Reverse Nodes in Even Length Groups](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README_EN.md) -- [2075. Decode the Slanted Ciphertext](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README_EN.md) -- [2076. Process Restricted Friend Requests](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README_EN.md) - -#### Biweekly Contest 65 - -- [2068. Check Whether Two Strings are Almost Equivalent](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README_EN.md) -- [2069. Walking Robot Simulation II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README_EN.md) -- [2070. Most Beautiful Item for Each Query](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README_EN.md) -- [2071. Maximum Number of Tasks You Can Assign](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README_EN.md) - -#### Weekly Contest 266 - -- [2062. Count Vowel Substrings of a String](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README_EN.md) -- [2063. Vowels of All Substrings](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README_EN.md) -- [2064. Minimized Maximum of Products Distributed to Any Store](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README_EN.md) -- [2065. Maximum Path Quality of a Graph](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README_EN.md) - -#### Weekly Contest 265 - -- [2057. Smallest Index With Equal Value](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README_EN.md) -- [2058. Find the Minimum and Maximum Number of Nodes Between Critical Points](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README_EN.md) -- [2059. Minimum Operations to Convert Number](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README_EN.md) -- [2060. Check if an Original String Exists Given Two Encoded Strings](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README_EN.md) - -#### Biweekly Contest 64 - -- [2053. Kth Distinct String in an Array](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README_EN.md) -- [2054. Two Best Non-Overlapping Events](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README_EN.md) -- [2055. Plates Between Candles](/solution/2000-2099/2055.Plates%20Between%20Candles/README_EN.md) -- [2056. Number of Valid Move Combinations On Chessboard](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README_EN.md) - -#### Weekly Contest 264 - -- [2047. Number of Valid Words in a Sentence](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README_EN.md) -- [2048. Next Greater Numerically Balanced Number](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README_EN.md) -- [2049. Count Nodes With the Highest Score](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README_EN.md) -- [2050. Parallel Courses III](/solution/2000-2099/2050.Parallel%20Courses%20III/README_EN.md) - -#### Weekly Contest 263 - -- [2042. Check if Numbers Are Ascending in a Sentence](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README_EN.md) -- [2043. Simple Bank System](/solution/2000-2099/2043.Simple%20Bank%20System/README_EN.md) -- [2044. Count Number of Maximum Bitwise-OR Subsets](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README_EN.md) -- [2045. Second Minimum Time to Reach Destination](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README_EN.md) - -#### Biweekly Contest 63 - -- [2037. Minimum Number of Moves to Seat Everyone](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README_EN.md) -- [2038. Remove Colored Pieces if Both Neighbors are the Same Color](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README_EN.md) -- [2039. The Time When the Network Becomes Idle](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README_EN.md) -- [2040. Kth Smallest Product of Two Sorted Arrays](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README_EN.md) - -#### Weekly Contest 262 - -- [2032. Two Out of Three](/solution/2000-2099/2032.Two%20Out%20of%20Three/README_EN.md) -- [2033. Minimum Operations to Make a Uni-Value Grid](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README_EN.md) -- [2034. Stock Price Fluctuation](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README_EN.md) -- [2035. Partition Array Into Two Arrays to Minimize Sum Difference](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README_EN.md) - -#### Weekly Contest 261 - -- [2027. Minimum Moves to Convert String](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README_EN.md) -- [2028. Find Missing Observations](/solution/2000-2099/2028.Find%20Missing%20Observations/README_EN.md) -- [2029. Stone Game IX](/solution/2000-2099/2029.Stone%20Game%20IX/README_EN.md) -- [2030. Smallest K-Length Subsequence With Occurrences of a Letter](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README_EN.md) - -#### Biweekly Contest 62 - -- [2022. Convert 1D Array Into 2D Array](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README_EN.md) -- [2023. Number of Pairs of Strings With Concatenation Equal to Target](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README_EN.md) -- [2024. Maximize the Confusion of an Exam](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README_EN.md) -- [2025. Maximum Number of Ways to Partition an Array](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README_EN.md) - -#### Weekly Contest 260 - -- [2016. Maximum Difference Between Increasing Elements](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README_EN.md) -- [2017. Grid Game](/solution/2000-2099/2017.Grid%20Game/README_EN.md) -- [2018. Check if Word Can Be Placed In Crossword](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README_EN.md) -- [2019. The Score of Students Solving Math Expression](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README_EN.md) - -#### Weekly Contest 259 - -- [2011. Final Value of Variable After Performing Operations](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README_EN.md) -- [2012. Sum of Beauty in the Array](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README_EN.md) -- [2013. Detect Squares](/solution/2000-2099/2013.Detect%20Squares/README_EN.md) -- [2014. Longest Subsequence Repeated k Times](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README_EN.md) - -#### Biweekly Contest 61 - -- [2006. Count Number of Pairs With Absolute Difference K](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README_EN.md) -- [2007. Find Original Array From Doubled Array](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README_EN.md) -- [2008. Maximum Earnings From Taxi](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README_EN.md) -- [2009. Minimum Number of Operations to Make Array Continuous](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README_EN.md) - -#### Weekly Contest 258 - -- [2000. Reverse Prefix of Word](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README_EN.md) -- [2001. Number of Pairs of Interchangeable Rectangles](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README_EN.md) -- [2002. Maximum Product of the Length of Two Palindromic Subsequences](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README_EN.md) -- [2003. Smallest Missing Genetic Value in Each Subtree](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README_EN.md) - -#### Weekly Contest 257 - -- [1995. Count Special Quadruplets](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README_EN.md) -- [1996. The Number of Weak Characters in the Game](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README_EN.md) -- [1997. First Day Where You Have Been in All the Rooms](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README_EN.md) -- [1998. GCD Sort of an Array](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README_EN.md) - -#### Biweekly Contest 60 - -- [1991. Find the Middle Index in Array](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README_EN.md) -- [1992. Find All Groups of Farmland](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README_EN.md) -- [1993. Operations on Tree](/solution/1900-1999/1993.Operations%20on%20Tree/README_EN.md) -- [1994. The Number of Good Subsets](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README_EN.md) - -#### Weekly Contest 256 - -- [1984. Minimum Difference Between Highest and Lowest of K Scores](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README_EN.md) -- [1985. Find the Kth Largest Integer in the Array](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README_EN.md) -- [1986. Minimum Number of Work Sessions to Finish the Tasks](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README_EN.md) -- [1987. Number of Unique Good Subsequences](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README_EN.md) - -#### Weekly Contest 255 - -- [1979. Find Greatest Common Divisor of Array](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README_EN.md) -- [1980. Find Unique Binary String](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README_EN.md) -- [1981. Minimize the Difference Between Target and Chosen Elements](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README_EN.md) -- [1982. Find Array Given Subset Sums](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README_EN.md) - -#### Biweekly Contest 59 - -- [1974. Minimum Time to Type Word Using Special Typewriter](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README_EN.md) -- [1975. Maximum Matrix Sum](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README_EN.md) -- [1976. Number of Ways to Arrive at Destination](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README_EN.md) -- [1977. Number of Ways to Separate Numbers](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README_EN.md) - -#### Weekly Contest 254 - -- [1967. Number of Strings That Appear as Substrings in Word](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README_EN.md) -- [1968. Array With Elements Not Equal to Average of Neighbors](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README_EN.md) -- [1969. Minimum Non-Zero Product of the Array Elements](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README_EN.md) -- [1970. Last Day Where You Can Still Cross](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README_EN.md) - -#### Weekly Contest 253 - -- [1961. Check If String Is a Prefix of Array](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README_EN.md) -- [1962. Remove Stones to Minimize the Total](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README_EN.md) -- [1963. Minimum Number of Swaps to Make the String Balanced](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README_EN.md) -- [1964. Find the Longest Valid Obstacle Course at Each Position](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README_EN.md) - -#### Biweekly Contest 58 - -- [1957. Delete Characters to Make Fancy String](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README_EN.md) -- [1958. Check if Move is Legal](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README_EN.md) -- [1959. Minimum Total Space Wasted With K Resizing Operations](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README_EN.md) -- [1960. Maximum Product of the Length of Two Palindromic Substrings](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README_EN.md) - -#### Weekly Contest 252 - -- [1952. Three Divisors](/solution/1900-1999/1952.Three%20Divisors/README_EN.md) -- [1953. Maximum Number of Weeks for Which You Can Work](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README_EN.md) -- [1954. Minimum Garden Perimeter to Collect Enough Apples](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README_EN.md) -- [1955. Count Number of Special Subsequences](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README_EN.md) - -#### Weekly Contest 251 - -- [1945. Sum of Digits of String After Convert](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README_EN.md) -- [1946. Largest Number After Mutating Substring](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README_EN.md) -- [1947. Maximum Compatibility Score Sum](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README_EN.md) -- [1948. Delete Duplicate Folders in System](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README_EN.md) - -#### Biweekly Contest 57 - -- [1941. Check if All Characters Have Equal Number of Occurrences](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README_EN.md) -- [1942. The Number of the Smallest Unoccupied Chair](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README_EN.md) -- [1943. Describe the Painting](/solution/1900-1999/1943.Describe%20the%20Painting/README_EN.md) -- [1944. Number of Visible People in a Queue](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README_EN.md) - -#### Weekly Contest 250 - -- [1935. Maximum Number of Words You Can Type](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README_EN.md) -- [1936. Add Minimum Number of Rungs](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README_EN.md) -- [1937. Maximum Number of Points with Cost](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README_EN.md) -- [1938. Maximum Genetic Difference Query](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README_EN.md) - -#### Weekly Contest 249 - -- [1929. Concatenation of Array](/solution/1900-1999/1929.Concatenation%20of%20Array/README_EN.md) -- [1930. Unique Length-3 Palindromic Subsequences](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README_EN.md) -- [1931. Painting a Grid With Three Different Colors](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README_EN.md) -- [1932. Merge BSTs to Create Single BST](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README_EN.md) - -#### Biweekly Contest 56 - -- [1925. Count Square Sum Triples](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README_EN.md) -- [1926. Nearest Exit from Entrance in Maze](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README_EN.md) -- [1927. Sum Game](/solution/1900-1999/1927.Sum%20Game/README_EN.md) -- [1928. Minimum Cost to Reach Destination in Time](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README_EN.md) - -#### Weekly Contest 248 - -- [1920. Build Array from Permutation](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README_EN.md) -- [1921. Eliminate Maximum Number of Monsters](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README_EN.md) -- [1922. Count Good Numbers](/solution/1900-1999/1922.Count%20Good%20Numbers/README_EN.md) -- [1923. Longest Common Subpath](/solution/1900-1999/1923.Longest%20Common%20Subpath/README_EN.md) - -#### Weekly Contest 247 - -- [1913. Maximum Product Difference Between Two Pairs](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README_EN.md) -- [1914. Cyclically Rotating a Grid](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README_EN.md) -- [1915. Number of Wonderful Substrings](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README_EN.md) -- [1916. Count Ways to Build Rooms in an Ant Colony](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README_EN.md) - -#### Biweekly Contest 55 - -- [1909. Remove One Element to Make the Array Strictly Increasing](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README_EN.md) -- [1910. Remove All Occurrences of a Substring](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README_EN.md) -- [1911. Maximum Alternating Subsequence Sum](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README_EN.md) -- [1912. Design Movie Rental System](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README_EN.md) - -#### Weekly Contest 246 - -- [1903. Largest Odd Number in String](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README_EN.md) -- [1904. The Number of Full Rounds You Have Played](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README_EN.md) -- [1905. Count Sub Islands](/solution/1900-1999/1905.Count%20Sub%20Islands/README_EN.md) -- [1906. Minimum Absolute Difference Queries](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README_EN.md) - -#### Weekly Contest 245 - -- [1897. Redistribute Characters to Make All Strings Equal](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README_EN.md) -- [1898. Maximum Number of Removable Characters](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README_EN.md) -- [1899. Merge Triplets to Form Target Triplet](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README_EN.md) -- [1900. The Earliest and Latest Rounds Where Players Compete](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README_EN.md) - -#### Biweekly Contest 54 - -- [1893. Check if All the Integers in a Range Are Covered](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README_EN.md) -- [1894. Find the Student that Will Replace the Chalk](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README_EN.md) -- [1895. Largest Magic Square](/solution/1800-1899/1895.Largest%20Magic%20Square/README_EN.md) -- [1896. Minimum Cost to Change the Final Value of Expression](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README_EN.md) - -#### Weekly Contest 244 - -- [1886. Determine Whether Matrix Can Be Obtained By Rotation](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README_EN.md) -- [1887. Reduction Operations to Make the Array Elements Equal](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README_EN.md) -- [1888. Minimum Number of Flips to Make the Binary String Alternating](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md) -- [1889. Minimum Space Wasted From Packaging](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README_EN.md) - -#### Weekly Contest 243 - -- [1880. Check if Word Equals Summation of Two Words](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README_EN.md) -- [1881. Maximum Value after Insertion](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README_EN.md) -- [1882. Process Tasks Using Servers](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README_EN.md) -- [1883. Minimum Skips to Arrive at Meeting On Time](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README_EN.md) - -#### Biweekly Contest 53 - -- [1876. Substrings of Size Three with Distinct Characters](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README_EN.md) -- [1877. Minimize Maximum Pair Sum in Array](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README_EN.md) -- [1878. Get Biggest Three Rhombus Sums in a Grid](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README_EN.md) -- [1879. Minimum XOR Sum of Two Arrays](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README_EN.md) - -#### Weekly Contest 242 - -- [1869. Longer Contiguous Segments of Ones than Zeros](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README_EN.md) -- [1870. Minimum Speed to Arrive on Time](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README_EN.md) -- [1871. Jump Game VII](/solution/1800-1899/1871.Jump%20Game%20VII/README_EN.md) -- [1872. Stone Game VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README_EN.md) - -#### Weekly Contest 241 - -- [1863. Sum of All Subset XOR Totals](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README_EN.md) -- [1864. Minimum Number of Swaps to Make the Binary String Alternating](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md) -- [1865. Finding Pairs With a Certain Sum](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README_EN.md) -- [1866. Number of Ways to Rearrange Sticks With K Sticks Visible](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README_EN.md) - -#### Biweekly Contest 52 - -- [1859. Sorting the Sentence](/solution/1800-1899/1859.Sorting%20the%20Sentence/README_EN.md) -- [1860. Incremental Memory Leak](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README_EN.md) -- [1861. Rotating the Box](/solution/1800-1899/1861.Rotating%20the%20Box/README_EN.md) -- [1862. Sum of Floored Pairs](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README_EN.md) - -#### Weekly Contest 240 - -- [1854. Maximum Population Year](/solution/1800-1899/1854.Maximum%20Population%20Year/README_EN.md) -- [1855. Maximum Distance Between a Pair of Values](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README_EN.md) -- [1856. Maximum Subarray Min-Product](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README_EN.md) -- [1857. Largest Color Value in a Directed Graph](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README_EN.md) - -#### Weekly Contest 239 - -- [1848. Minimum Distance to the Target Element](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README_EN.md) -- [1849. Splitting a String Into Descending Consecutive Values](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README_EN.md) -- [1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README_EN.md) -- [1851. Minimum Interval to Include Each Query](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README_EN.md) - -#### Biweekly Contest 51 - -- [1844. Replace All Digits with Characters](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README_EN.md) -- [1845. Seat Reservation Manager](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README_EN.md) -- [1846. Maximum Element After Decreasing and Rearranging](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README_EN.md) -- [1847. Closest Room](/solution/1800-1899/1847.Closest%20Room/README_EN.md) - -#### Weekly Contest 238 - -- [1837. Sum of Digits in Base K](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README_EN.md) -- [1838. Frequency of the Most Frequent Element](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README_EN.md) -- [1839. Longest Substring Of All Vowels in Order](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README_EN.md) -- [1840. Maximum Building Height](/solution/1800-1899/1840.Maximum%20Building%20Height/README_EN.md) - -#### Weekly Contest 237 - -- [1832. Check if the Sentence Is Pangram](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README_EN.md) -- [1833. Maximum Ice Cream Bars](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README_EN.md) -- [1834. Single-Threaded CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README_EN.md) -- [1835. Find XOR Sum of All Pairs Bitwise AND](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README_EN.md) - -#### Biweekly Contest 50 - -- [1827. Minimum Operations to Make the Array Increasing](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README_EN.md) -- [1828. Queries on Number of Points Inside a Circle](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README_EN.md) -- [1829. Maximum XOR for Each Query](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README_EN.md) -- [1830. Minimum Number of Operations to Make String Sorted](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README_EN.md) - -#### Weekly Contest 236 - -- [1822. Sign of the Product of an Array](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README_EN.md) -- [1823. Find the Winner of the Circular Game](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README_EN.md) -- [1824. Minimum Sideway Jumps](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README_EN.md) -- [1825. Finding MK Average](/solution/1800-1899/1825.Finding%20MK%20Average/README_EN.md) - -#### Weekly Contest 235 - -- [1816. Truncate Sentence](/solution/1800-1899/1816.Truncate%20Sentence/README_EN.md) -- [1817. Finding the Users Active Minutes](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README_EN.md) -- [1818. Minimum Absolute Sum Difference](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README_EN.md) -- [1819. Number of Different Subsequences GCDs](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README_EN.md) - -#### Biweekly Contest 49 - -- [1812. Determine Color of a Chessboard Square](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README_EN.md) -- [1813. Sentence Similarity III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README_EN.md) -- [1814. Count Nice Pairs in an Array](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README_EN.md) -- [1815. Maximum Number of Groups Getting Fresh Donuts](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README_EN.md) - -#### Weekly Contest 234 - -- [1805. Number of Different Integers in a String](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README_EN.md) -- [1806. Minimum Number of Operations to Reinitialize a Permutation](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README_EN.md) -- [1807. Evaluate the Bracket Pairs of a String](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README_EN.md) -- [1808. Maximize Number of Nice Divisors](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README_EN.md) - -#### Weekly Contest 233 - -- [1800. Maximum Ascending Subarray Sum](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README_EN.md) -- [1801. Number of Orders in the Backlog](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README_EN.md) -- [1802. Maximum Value at a Given Index in a Bounded Array](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README_EN.md) -- [1803. Count Pairs With XOR in a Range](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README_EN.md) - -#### Biweekly Contest 48 - -- [1796. Second Largest Digit in a String](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README_EN.md) -- [1797. Design Authentication Manager](/solution/1700-1799/1797.Design%20Authentication%20Manager/README_EN.md) -- [1798. Maximum Number of Consecutive Values You Can Make](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README_EN.md) -- [1799. Maximize Score After N Operations](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README_EN.md) - -#### Weekly Contest 232 - -- [1790. Check if One String Swap Can Make Strings Equal](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README_EN.md) -- [1791. Find Center of Star Graph](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README_EN.md) -- [1792. Maximum Average Pass Ratio](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README_EN.md) -- [1793. Maximum Score of a Good Subarray](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README_EN.md) - -#### Weekly Contest 231 - -- [1784. Check if Binary String Has at Most One Segment of Ones](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README_EN.md) -- [1785. Minimum Elements to Add to Form a Given Sum](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README_EN.md) -- [1786. Number of Restricted Paths From First to Last Node](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README_EN.md) -- [1787. Make the XOR of All Segments Equal to Zero](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README_EN.md) - -#### Biweekly Contest 47 - -- [1779. Find Nearest Point That Has the Same X or Y Coordinate](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README_EN.md) -- [1780. Check if Number is a Sum of Powers of Three](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README_EN.md) -- [1781. Sum of Beauty of All Substrings](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README_EN.md) -- [1782. Count Pairs Of Nodes](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README_EN.md) - -#### Weekly Contest 230 - -- [1773. Count Items Matching a Rule](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README_EN.md) -- [1774. Closest Dessert Cost](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README_EN.md) -- [1775. Equal Sum Arrays With Minimum Number of Operations](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README_EN.md) -- [1776. Car Fleet II](/solution/1700-1799/1776.Car%20Fleet%20II/README_EN.md) - -#### Weekly Contest 229 - -- [1768. Merge Strings Alternately](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README_EN.md) -- [1769. Minimum Number of Operations to Move All Balls to Each Box](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README_EN.md) -- [1770. Maximum Score from Performing Multiplication Operations](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README_EN.md) -- [1771. Maximize Palindrome Length From Subsequences](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README_EN.md) - -#### Biweekly Contest 46 - -- [1763. Longest Nice Substring](/solution/1700-1799/1763.Longest%20Nice%20Substring/README_EN.md) -- [1764. Form Array by Concatenating Subarrays of Another Array](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README_EN.md) -- [1765. Map of Highest Peak](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README_EN.md) -- [1766. Tree of Coprimes](/solution/1700-1799/1766.Tree%20of%20Coprimes/README_EN.md) - -#### Weekly Contest 228 - -- [1758. Minimum Changes To Make Alternating Binary String](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README_EN.md) -- [1759. Count Number of Homogenous Substrings](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README_EN.md) -- [1760. Minimum Limit of Balls in a Bag](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README_EN.md) -- [1761. Minimum Degree of a Connected Trio in a Graph](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README_EN.md) - -#### Weekly Contest 227 - -- [1752. Check if Array Is Sorted and Rotated](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README_EN.md) -- [1753. Maximum Score From Removing Stones](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README_EN.md) -- [1754. Largest Merge Of Two Strings](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README_EN.md) -- [1755. Closest Subsequence Sum](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README_EN.md) - -#### Biweekly Contest 45 - -- [1748. Sum of Unique Elements](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README_EN.md) -- [1749. Maximum Absolute Sum of Any Subarray](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README_EN.md) -- [1750. Minimum Length of String After Deleting Similar Ends](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README_EN.md) -- [1751. Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README_EN.md) - -#### Weekly Contest 226 - -- [1742. Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README_EN.md) -- [1743. Restore the Array From Adjacent Pairs](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README_EN.md) -- [1744. Can You Eat Your Favorite Candy on Your Favorite Day](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README_EN.md) -- [1745. Palindrome Partitioning IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README_EN.md) - -#### Weekly Contest 225 - -- [1736. Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README_EN.md) -- [1737. Change Minimum Characters to Satisfy One of Three Conditions](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README_EN.md) -- [1738. Find Kth Largest XOR Coordinate Value](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README_EN.md) -- [1739. Building Boxes](/solution/1700-1799/1739.Building%20Boxes/README_EN.md) - -#### Biweekly Contest 44 - -- [1732. Find the Highest Altitude](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README_EN.md) -- [1733. Minimum Number of People to Teach](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README_EN.md) -- [1734. Decode XORed Permutation](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README_EN.md) -- [1735. Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README_EN.md) - -#### Weekly Contest 224 - -- [1725. Number Of Rectangles That Can Form The Largest Square](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README_EN.md) -- [1726. Tuple with Same Product](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README_EN.md) -- [1727. Largest Submatrix With Rearrangements](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README_EN.md) -- [1728. Cat and Mouse II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README_EN.md) - -#### Weekly Contest 223 - -- [1720. Decode XORed Array](/solution/1700-1799/1720.Decode%20XORed%20Array/README_EN.md) -- [1721. Swapping Nodes in a Linked List](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README_EN.md) -- [1722. Minimize Hamming Distance After Swap Operations](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README_EN.md) -- [1723. Find Minimum Time to Finish All Jobs](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README_EN.md) - -#### Biweekly Contest 43 - -- [1716. Calculate Money in Leetcode Bank](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README_EN.md) -- [1717. Maximum Score From Removing Substrings](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README_EN.md) -- [1718. Construct the Lexicographically Largest Valid Sequence](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README_EN.md) -- [1719. Number Of Ways To Reconstruct A Tree](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README_EN.md) - -#### Weekly Contest 222 - -- [1710. Maximum Units on a Truck](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README_EN.md) -- [1711. Count Good Meals](/solution/1700-1799/1711.Count%20Good%20Meals/README_EN.md) -- [1712. Ways to Split Array Into Three Subarrays](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README_EN.md) -- [1713. Minimum Operations to Make a Subsequence](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README_EN.md) - -#### Weekly Contest 221 - -- [1704. Determine if String Halves Are Alike](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README_EN.md) -- [1705. Maximum Number of Eaten Apples](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README_EN.md) -- [1706. Where Will the Ball Fall](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README_EN.md) -- [1707. Maximum XOR With an Element From Array](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README_EN.md) - -#### Biweekly Contest 42 - -- [1700. Number of Students Unable to Eat Lunch](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README_EN.md) -- [1701. Average Waiting Time](/solution/1700-1799/1701.Average%20Waiting%20Time/README_EN.md) -- [1702. Maximum Binary String After Change](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README_EN.md) -- [1703. Minimum Adjacent Swaps for K Consecutive Ones](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README_EN.md) - -#### Weekly Contest 220 - -- [1694. Reformat Phone Number](/solution/1600-1699/1694.Reformat%20Phone%20Number/README_EN.md) -- [1695. Maximum Erasure Value](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README_EN.md) -- [1696. Jump Game VI](/solution/1600-1699/1696.Jump%20Game%20VI/README_EN.md) -- [1697. Checking Existence of Edge Length Limited Paths](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README_EN.md) - -#### Weekly Contest 219 - -- [1688. Count of Matches in Tournament](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README_EN.md) -- [1689. Partitioning Into Minimum Number Of Deci-Binary Numbers](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README_EN.md) -- [1690. Stone Game VII](/solution/1600-1699/1690.Stone%20Game%20VII/README_EN.md) -- [1691. Maximum Height by Stacking Cuboids](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README_EN.md) - -#### Biweekly Contest 41 - -- [1684. Count the Number of Consistent Strings](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README_EN.md) -- [1685. Sum of Absolute Differences in a Sorted Array](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README_EN.md) -- [1686. Stone Game VI](/solution/1600-1699/1686.Stone%20Game%20VI/README_EN.md) -- [1687. Delivering Boxes from Storage to Ports](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README_EN.md) - -#### Weekly Contest 218 - -- [1678. Goal Parser Interpretation](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README_EN.md) -- [1679. Max Number of K-Sum Pairs](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README_EN.md) -- [1680. Concatenation of Consecutive Binary Numbers](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README_EN.md) -- [1681. Minimum Incompatibility](/solution/1600-1699/1681.Minimum%20Incompatibility/README_EN.md) - -#### Weekly Contest 217 - -- [1672. Richest Customer Wealth](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README_EN.md) -- [1673. Find the Most Competitive Subsequence](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README_EN.md) -- [1674. Minimum Moves to Make Array Complementary](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README_EN.md) -- [1675. Minimize Deviation in Array](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README_EN.md) - -#### Biweekly Contest 40 - -- [1668. Maximum Repeating Substring](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README_EN.md) -- [1669. Merge In Between Linked Lists](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README_EN.md) -- [1670. Design Front Middle Back Queue](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README_EN.md) -- [1671. Minimum Number of Removals to Make Mountain Array](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README_EN.md) - -#### Weekly Contest 216 - -- [1662. Check If Two String Arrays are Equivalent](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README_EN.md) -- [1663. Smallest String With A Given Numeric Value](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README_EN.md) -- [1664. Ways to Make a Fair Array](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README_EN.md) -- [1665. Minimum Initial Energy to Finish Tasks](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README_EN.md) - -#### Weekly Contest 215 - -- [1656. Design an Ordered Stream](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README_EN.md) -- [1657. Determine if Two Strings Are Close](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README_EN.md) -- [1658. Minimum Operations to Reduce X to Zero](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README_EN.md) -- [1659. Maximize Grid Happiness](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README_EN.md) - -#### Biweekly Contest 39 - -- [1652. Defuse the Bomb](/solution/1600-1699/1652.Defuse%20the%20Bomb/README_EN.md) -- [1653. Minimum Deletions to Make String Balanced](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README_EN.md) -- [1654. Minimum Jumps to Reach Home](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README_EN.md) -- [1655. Distribute Repeating Integers](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README_EN.md) - -#### Weekly Contest 214 - -- [1646. Get Maximum in Generated Array](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README_EN.md) -- [1647. Minimum Deletions to Make Character Frequencies Unique](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README_EN.md) -- [1648. Sell Diminishing-Valued Colored Balls](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README_EN.md) -- [1649. Create Sorted Array through Instructions](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README_EN.md) - -#### Weekly Contest 213 - -- [1640. Check Array Formation Through Concatenation](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README_EN.md) -- [1641. Count Sorted Vowel Strings](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README_EN.md) -- [1642. Furthest Building You Can Reach](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README_EN.md) -- [1643. Kth Smallest Instructions](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README_EN.md) - -#### Biweekly Contest 38 - -- [1636. Sort Array by Increasing Frequency](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README_EN.md) -- [1637. Widest Vertical Area Between Two Points Containing No Points](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README_EN.md) -- [1638. Count Substrings That Differ by One Character](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README_EN.md) -- [1639. Number of Ways to Form a Target String Given a Dictionary](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README_EN.md) - -#### Weekly Contest 212 - -- [1629. Slowest Key](/solution/1600-1699/1629.Slowest%20Key/README_EN.md) -- [1630. Arithmetic Subarrays](/solution/1600-1699/1630.Arithmetic%20Subarrays/README_EN.md) -- [1631. Path With Minimum Effort](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README_EN.md) -- [1632. Rank Transform of a Matrix](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README_EN.md) - -#### Weekly Contest 211 - -- [1624. Largest Substring Between Two Equal Characters](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README_EN.md) -- [1625. Lexicographically Smallest String After Applying Operations](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README_EN.md) -- [1626. Best Team With No Conflicts](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README_EN.md) -- [1627. Graph Connectivity With Threshold](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README_EN.md) - -#### Biweekly Contest 37 - -- [1619. Mean of Array After Removing Some Elements](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README_EN.md) -- [1620. Coordinate With Maximum Network Quality](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README_EN.md) -- [1621. Number of Sets of K Non-Overlapping Line Segments](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README_EN.md) -- [1622. Fancy Sequence](/solution/1600-1699/1622.Fancy%20Sequence/README_EN.md) - -#### Weekly Contest 210 - -- [1614. Maximum Nesting Depth of the Parentheses](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README_EN.md) -- [1615. Maximal Network Rank](/solution/1600-1699/1615.Maximal%20Network%20Rank/README_EN.md) -- [1616. Split Two Strings to Make Palindrome](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README_EN.md) -- [1617. Count Subtrees With Max Distance Between Cities](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README_EN.md) - -#### Weekly Contest 209 - -- [1608. Special Array With X Elements Greater Than or Equal X](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README_EN.md) -- [1609. Even Odd Tree](/solution/1600-1699/1609.Even%20Odd%20Tree/README_EN.md) -- [1610. Maximum Number of Visible Points](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README_EN.md) -- [1611. Minimum One Bit Operations to Make Integers Zero](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README_EN.md) - -#### Biweekly Contest 36 - -- [1603. Design Parking System](/solution/1600-1699/1603.Design%20Parking%20System/README_EN.md) -- [1604. Alert Using Same Key-Card Three or More Times in a One Hour Period](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README_EN.md) -- [1605. Find Valid Matrix Given Row and Column Sums](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README_EN.md) -- [1606. Find Servers That Handled Most Number of Requests](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README_EN.md) - -#### Weekly Contest 208 - -- [1598. Crawler Log Folder](/solution/1500-1599/1598.Crawler%20Log%20Folder/README_EN.md) -- [1599. Maximum Profit of Operating a Centennial Wheel](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README_EN.md) -- [1600. Throne Inheritance](/solution/1600-1699/1600.Throne%20Inheritance/README_EN.md) -- [1601. Maximum Number of Achievable Transfer Requests](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README_EN.md) - -#### Weekly Contest 207 - -- [1592. Rearrange Spaces Between Words](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README_EN.md) -- [1593. Split a String Into the Max Number of Unique Substrings](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README_EN.md) -- [1594. Maximum Non Negative Product in a Matrix](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README_EN.md) -- [1595. Minimum Cost to Connect Two Groups of Points](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README_EN.md) - -#### Biweekly Contest 35 - -- [1588. Sum of All Odd Length Subarrays](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README_EN.md) -- [1589. Maximum Sum Obtained of Any Permutation](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README_EN.md) -- [1590. Make Sum Divisible by P](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README_EN.md) -- [1591. Strange Printer II](/solution/1500-1599/1591.Strange%20Printer%20II/README_EN.md) - -#### Weekly Contest 206 - -- [1582. Special Positions in a Binary Matrix](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README_EN.md) -- [1583. Count Unhappy Friends](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README_EN.md) -- [1584. Min Cost to Connect All Points](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README_EN.md) -- [1585. Check If String Is Transformable With Substring Sort Operations](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README_EN.md) - -#### Weekly Contest 205 - -- [1576. Replace All 's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md) -- [1577. Number of Ways Where Square of Number Is Equal to Product of Two Numbers](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README_EN.md) -- [1578. Minimum Time to Make Rope Colorful](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README_EN.md) -- [1579. Remove Max Number of Edges to Keep Graph Fully Traversable](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README_EN.md) - -#### Biweekly Contest 34 - -- [1572. Matrix Diagonal Sum](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README_EN.md) -- [1573. Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README_EN.md) -- [1574. Shortest Subarray to be Removed to Make Array Sorted](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README_EN.md) -- [1575. Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README_EN.md) - -#### Weekly Contest 204 - -- [1566. Detect Pattern of Length M Repeated K or More Times](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README_EN.md) -- [1567. Maximum Length of Subarray With Positive Product](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README_EN.md) -- [1568. Minimum Number of Days to Disconnect Island](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README_EN.md) -- [1569. Number of Ways to Reorder Array to Get Same BST](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README_EN.md) - -#### Weekly Contest 203 - -- [1560. Most Visited Sector in a Circular Track](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README_EN.md) -- [1561. Maximum Number of Coins You Can Get](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README_EN.md) -- [1562. Find Latest Group of Size M](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README_EN.md) -- [1563. Stone Game V](/solution/1500-1599/1563.Stone%20Game%20V/README_EN.md) - -#### Biweekly Contest 33 - -- [1556. Thousand Separator](/solution/1500-1599/1556.Thousand%20Separator/README_EN.md) -- [1557. Minimum Number of Vertices to Reach All Nodes](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README_EN.md) -- [1558. Minimum Numbers of Function Calls to Make Target Array](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README_EN.md) -- [1559. Detect Cycles in 2D Grid](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README_EN.md) - -#### Weekly Contest 202 - -- [1550. Three Consecutive Odds](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README_EN.md) -- [1551. Minimum Operations to Make Array Equal](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README_EN.md) -- [1552. Magnetic Force Between Two Balls](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README_EN.md) -- [1553. Minimum Number of Days to Eat N Oranges](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README_EN.md) - -#### Weekly Contest 201 - -- [1544. Make The String Great](/solution/1500-1599/1544.Make%20The%20String%20Great/README_EN.md) -- [1545. Find Kth Bit in Nth Binary String](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README_EN.md) -- [1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README_EN.md) -- [1547. Minimum Cost to Cut a Stick](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README_EN.md) - -#### Biweekly Contest 32 - -- [1539. Kth Missing Positive Number](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README_EN.md) -- [1540. Can Convert String in K Moves](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README_EN.md) -- [1541. Minimum Insertions to Balance a Parentheses String](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README_EN.md) -- [1542. Find Longest Awesome Substring](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README_EN.md) - -#### Weekly Contest 200 - -- [1534. Count Good Triplets](/solution/1500-1599/1534.Count%20Good%20Triplets/README_EN.md) -- [1535. Find the Winner of an Array Game](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README_EN.md) -- [1536. Minimum Swaps to Arrange a Binary Grid](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README_EN.md) -- [1537. Get the Maximum Score](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README_EN.md) - -#### Weekly Contest 199 - -- [1528. Shuffle String](/solution/1500-1599/1528.Shuffle%20String/README_EN.md) -- [1529. Minimum Suffix Flips](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README_EN.md) -- [1530. Number of Good Leaf Nodes Pairs](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README_EN.md) -- [1531. String Compression II](/solution/1500-1599/1531.String%20Compression%20II/README_EN.md) - -#### Biweekly Contest 31 - -- [1523. Count Odd Numbers in an Interval Range](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README_EN.md) -- [1524. Number of Sub-arrays With Odd Sum](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README_EN.md) -- [1525. Number of Good Ways to Split a String](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README_EN.md) -- [1526. Minimum Number of Increments on Subarrays to Form a Target Array](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README_EN.md) - -#### Weekly Contest 198 - -- [1518. Water Bottles](/solution/1500-1599/1518.Water%20Bottles/README_EN.md) -- [1519. Number of Nodes in the Sub-Tree With the Same Label](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README_EN.md) -- [1520. Maximum Number of Non-Overlapping Substrings](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README_EN.md) -- [1521. Find a Value of a Mysterious Function Closest to Target](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README_EN.md) - -#### Weekly Contest 197 - -- [1512. Number of Good Pairs](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README_EN.md) -- [1513. Number of Substrings With Only 1s](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README_EN.md) -- [1514. Path with Maximum Probability](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README_EN.md) -- [1515. Best Position for a Service Centre](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README_EN.md) - -#### Biweekly Contest 30 - -- [1507. Reformat Date](/solution/1500-1599/1507.Reformat%20Date/README_EN.md) -- [1508. Range Sum of Sorted Subarray Sums](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README_EN.md) -- [1509. Minimum Difference Between Largest and Smallest Value in Three Moves](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README_EN.md) -- [1510. Stone Game IV](/solution/1500-1599/1510.Stone%20Game%20IV/README_EN.md) - -#### Weekly Contest 196 - -- [1502. Can Make Arithmetic Progression From Sequence](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README_EN.md) -- [1503. Last Moment Before All Ants Fall Out of a Plank](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README_EN.md) -- [1504. Count Submatrices With All Ones](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README_EN.md) -- [1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README_EN.md) - -#### Weekly Contest 195 - -- [1496. Path Crossing](/solution/1400-1499/1496.Path%20Crossing/README_EN.md) -- [1497. Check If Array Pairs Are Divisible by k](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README_EN.md) -- [1498. Number of Subsequences That Satisfy the Given Sum Condition](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README_EN.md) -- [1499. Max Value of Equation](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README_EN.md) - -#### Biweekly Contest 29 - -- [1491. Average Salary Excluding the Minimum and Maximum Salary](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README_EN.md) -- [1492. The kth Factor of n](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README_EN.md) -- [1493. Longest Subarray of 1's After Deleting One Element](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README_EN.md) -- [1494. Parallel Courses II](/solution/1400-1499/1494.Parallel%20Courses%20II/README_EN.md) - -#### Weekly Contest 194 - -- [1486. XOR Operation in an Array](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README_EN.md) -- [1487. Making File Names Unique](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README_EN.md) -- [1488. Avoid Flood in The City](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README_EN.md) -- [1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README_EN.md) - -#### Weekly Contest 193 - -- [1480. Running Sum of 1d Array](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README_EN.md) -- [1481. Least Number of Unique Integers after K Removals](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README_EN.md) -- [1482. Minimum Number of Days to Make m Bouquets](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README_EN.md) -- [1483. Kth Ancestor of a Tree Node](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README_EN.md) - -#### Biweekly Contest 28 - -- [1475. Final Prices With a Special Discount in a Shop](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README_EN.md) -- [1476. Subrectangle Queries](/solution/1400-1499/1476.Subrectangle%20Queries/README_EN.md) -- [1477. Find Two Non-overlapping Sub-arrays Each With Target Sum](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README_EN.md) -- [1478. Allocate Mailboxes](/solution/1400-1499/1478.Allocate%20Mailboxes/README_EN.md) - -#### Weekly Contest 192 - -- [1470. Shuffle the Array](/solution/1400-1499/1470.Shuffle%20the%20Array/README_EN.md) -- [1471. The k Strongest Values in an Array](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README_EN.md) -- [1472. Design Browser History](/solution/1400-1499/1472.Design%20Browser%20History/README_EN.md) -- [1473. Paint House III](/solution/1400-1499/1473.Paint%20House%20III/README_EN.md) - -#### Weekly Contest 191 - -- [1464. Maximum Product of Two Elements in an Array](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README_EN.md) -- [1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README_EN.md) -- [1466. Reorder Routes to Make All Paths Lead to the City Zero](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README_EN.md) -- [1467. Probability of a Two Boxes Having The Same Number of Distinct Balls](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README_EN.md) - -#### Biweekly Contest 27 - -- [1460. Make Two Arrays Equal by Reversing Subarrays](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README_EN.md) -- [1461. Check If a String Contains All Binary Codes of Size K](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README_EN.md) -- [1462. Course Schedule IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README_EN.md) -- [1463. Cherry Pickup II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README_EN.md) - -#### Weekly Contest 190 - -- [1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README_EN.md) -- [1456. Maximum Number of Vowels in a Substring of Given Length](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README_EN.md) -- [1457. Pseudo-Palindromic Paths in a Binary Tree](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README_EN.md) -- [1458. Max Dot Product of Two Subsequences](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README_EN.md) - -#### Weekly Contest 189 - -- [1450. Number of Students Doing Homework at a Given Time](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README_EN.md) -- [1451. Rearrange Words in a Sentence](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README_EN.md) -- [1452. People Whose List of Favorite Companies Is Not a Subset of Another List](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README_EN.md) -- [1453. Maximum Number of Darts Inside of a Circular Dartboard](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README_EN.md) - -#### Biweekly Contest 26 - -- [1446. Consecutive Characters](/solution/1400-1499/1446.Consecutive%20Characters/README_EN.md) -- [1447. Simplified Fractions](/solution/1400-1499/1447.Simplified%20Fractions/README_EN.md) -- [1448. Count Good Nodes in Binary Tree](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README_EN.md) -- [1449. Form Largest Integer With Digits That Add up to Target](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README_EN.md) - -#### Weekly Contest 188 - -- [1441. Build an Array With Stack Operations](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README_EN.md) -- [1442. Count Triplets That Can Form Two Arrays of Equal XOR](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README_EN.md) -- [1443. Minimum Time to Collect All Apples in a Tree](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README_EN.md) -- [1444. Number of Ways of Cutting a Pizza](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README_EN.md) - -#### Weekly Contest 187 - -- [1436. Destination City](/solution/1400-1499/1436.Destination%20City/README_EN.md) -- [1437. Check If All 1's Are at Least Length K Places Away](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README_EN.md) -- [1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README_EN.md) -- [1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README_EN.md) - -#### Biweekly Contest 25 - -- [1431. Kids With the Greatest Number of Candies](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README_EN.md) -- [1432. Max Difference You Can Get From Changing an Integer](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README_EN.md) -- [1433. Check If a String Can Break Another String](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README_EN.md) -- [1434. Number of Ways to Wear Different Hats to Each Other](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README_EN.md) - -#### Weekly Contest 186 - -- [1422. Maximum Score After Splitting a String](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README_EN.md) -- [1423. Maximum Points You Can Obtain from Cards](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README_EN.md) -- [1424. Diagonal Traverse II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README_EN.md) -- [1425. Constrained Subsequence Sum](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README_EN.md) - -#### Weekly Contest 185 - -- [1417. Reformat The String](/solution/1400-1499/1417.Reformat%20The%20String/README_EN.md) -- [1418. Display Table of Food Orders in a Restaurant](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README_EN.md) -- [1419. Minimum Number of Frogs Croaking](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README_EN.md) -- [1420. Build Array Where You Can Find The Maximum Exactly K Comparisons](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README_EN.md) - -#### Biweekly Contest 24 - -- [1413. Minimum Value to Get Positive Step by Step Sum](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README_EN.md) -- [1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README_EN.md) -- [1415. The k-th Lexicographical String of All Happy Strings of Length n](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README_EN.md) -- [1416. Restore The Array](/solution/1400-1499/1416.Restore%20The%20Array/README_EN.md) - -#### Weekly Contest 184 - -- [1408. String Matching in an Array](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README_EN.md) -- [1409. Queries on a Permutation With Key](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README_EN.md) -- [1410. HTML Entity Parser](/solution/1400-1499/1410.HTML%20Entity%20Parser/README_EN.md) -- [1411. Number of Ways to Paint N × 3 Grid](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README_EN.md) - -#### Weekly Contest 183 - -- [1403. Minimum Subsequence in Non-Increasing Order](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README_EN.md) -- [1404. Number of Steps to Reduce a Number in Binary Representation to One](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README_EN.md) -- [1405. Longest Happy String](/solution/1400-1499/1405.Longest%20Happy%20String/README_EN.md) -- [1406. Stone Game III](/solution/1400-1499/1406.Stone%20Game%20III/README_EN.md) - -#### Biweekly Contest 23 - -- [1399. Count Largest Group](/solution/1300-1399/1399.Count%20Largest%20Group/README_EN.md) -- [1400. Construct K Palindrome Strings](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README_EN.md) -- [1401. Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README_EN.md) -- [1402. Reducing Dishes](/solution/1400-1499/1402.Reducing%20Dishes/README_EN.md) - -#### Weekly Contest 182 - -- [1394. Find Lucky Integer in an Array](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README_EN.md) -- [1395. Count Number of Teams](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README_EN.md) -- [1396. Design Underground System](/solution/1300-1399/1396.Design%20Underground%20System/README_EN.md) -- [1397. Find All Good Strings](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README_EN.md) - -#### Weekly Contest 181 - -- [1389. Create Target Array in the Given Order](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README_EN.md) -- [1390. Four Divisors](/solution/1300-1399/1390.Four%20Divisors/README_EN.md) -- [1391. Check if There is a Valid Path in a Grid](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README_EN.md) -- [1392. Longest Happy Prefix](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README_EN.md) - -#### Biweekly Contest 22 - -- [1385. Find the Distance Value Between Two Arrays](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README_EN.md) -- [1386. Cinema Seat Allocation](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README_EN.md) -- [1387. Sort Integers by The Power Value](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README_EN.md) -- [1388. Pizza With 3n Slices](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README_EN.md) - -#### Weekly Contest 180 - -- [1380. Lucky Numbers in a Matrix](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README_EN.md) -- [1381. Design a Stack With Increment Operation](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README_EN.md) -- [1382. Balance a Binary Search Tree](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README_EN.md) -- [1383. Maximum Performance of a Team](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README_EN.md) - -#### Weekly Contest 179 - -- [1374. Generate a String With Characters That Have Odd Counts](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README_EN.md) -- [1375. Number of Times Binary String Is Prefix-Aligned](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README_EN.md) -- [1376. Time Needed to Inform All Employees](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README_EN.md) -- [1377. Frog Position After T Seconds](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README_EN.md) - -#### Biweekly Contest 21 - -- [1370. Increasing Decreasing String](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README_EN.md) -- [1371. Find the Longest Substring Containing Vowels in Even Counts](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README_EN.md) -- [1372. Longest ZigZag Path in a Binary Tree](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README_EN.md) -- [1373. Maximum Sum BST in Binary Tree](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README_EN.md) - -#### Weekly Contest 178 - -- [1365. How Many Numbers Are Smaller Than the Current Number](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README_EN.md) -- [1366. Rank Teams by Votes](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README_EN.md) -- [1367. Linked List in Binary Tree](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README_EN.md) -- [1368. Minimum Cost to Make at Least One Valid Path in a Grid](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README_EN.md) - -#### Weekly Contest 177 - -- [1360. Number of Days Between Two Dates](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README_EN.md) -- [1361. Validate Binary Tree Nodes](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README_EN.md) -- [1362. Closest Divisors](/solution/1300-1399/1362.Closest%20Divisors/README_EN.md) -- [1363. Largest Multiple of Three](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README_EN.md) - -#### Biweekly Contest 20 - -- [1356. Sort Integers by The Number of 1 Bits](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README_EN.md) -- [1357. Apply Discount Every n Orders](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README_EN.md) -- [1358. Number of Substrings Containing All Three Characters](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README_EN.md) -- [1359. Count All Valid Pickup and Delivery Options](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README_EN.md) - -#### Weekly Contest 176 - -- [1351. Count Negative Numbers in a Sorted Matrix](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README_EN.md) -- [1352. Product of the Last K Numbers](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README_EN.md) -- [1353. Maximum Number of Events That Can Be Attended](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README_EN.md) -- [1354. Construct Target Array With Multiple Sums](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README_EN.md) - -#### Weekly Contest 175 - -- [1346. Check If N and Its Double Exist](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README_EN.md) -- [1347. Minimum Number of Steps to Make Two Strings Anagram](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README_EN.md) -- [1348. Tweet Counts Per Frequency](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README_EN.md) -- [1349. Maximum Students Taking Exam](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README_EN.md) - -#### Biweekly Contest 19 - -- [1342. Number of Steps to Reduce a Number to Zero](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README_EN.md) -- [1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README_EN.md) -- [1344. Angle Between Hands of a Clock](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README_EN.md) -- [1345. Jump Game IV](/solution/1300-1399/1345.Jump%20Game%20IV/README_EN.md) - -#### Weekly Contest 174 - -- [1337. The K Weakest Rows in a Matrix](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README_EN.md) -- [1338. Reduce Array Size to The Half](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README_EN.md) -- [1339. Maximum Product of Splitted Binary Tree](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README_EN.md) -- [1340. Jump Game V](/solution/1300-1399/1340.Jump%20Game%20V/README_EN.md) - -#### Weekly Contest 173 - -- [1332. Remove Palindromic Subsequences](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README_EN.md) -- [1333. Filter Restaurants by Vegan-Friendly, Price and Distance](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README_EN.md) -- [1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README_EN.md) -- [1335. Minimum Difficulty of a Job Schedule](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README_EN.md) - -#### Biweekly Contest 18 - -- [1331. Rank Transform of an Array](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README_EN.md) -- [1328. Break a Palindrome](/solution/1300-1399/1328.Break%20a%20Palindrome/README_EN.md) -- [1329. Sort the Matrix Diagonally](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README_EN.md) -- [1330. Reverse Subarray To Maximize Array Value](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README_EN.md) - -#### Weekly Contest 172 - -- [1323. Maximum 69 Number](/solution/1300-1399/1323.Maximum%2069%20Number/README_EN.md) -- [1324. Print Words Vertically](/solution/1300-1399/1324.Print%20Words%20Vertically/README_EN.md) -- [1325. Delete Leaves With a Given Value](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README_EN.md) -- [1326. Minimum Number of Taps to Open to Water a Garden](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README_EN.md) - -#### Weekly Contest 171 - -- [1317. Convert Integer to the Sum of Two No-Zero Integers](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README_EN.md) -- [1318. Minimum Flips to Make a OR b Equal to c](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README_EN.md) -- [1319. Number of Operations to Make Network Connected](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README_EN.md) -- [1320. Minimum Distance to Type a Word Using Two Fingers](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README_EN.md) - -#### Biweekly Contest 17 - -- [1313. Decompress Run-Length Encoded List](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README_EN.md) -- [1314. Matrix Block Sum](/solution/1300-1399/1314.Matrix%20Block%20Sum/README_EN.md) -- [1315. Sum of Nodes with Even-Valued Grandparent](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README_EN.md) -- [1316. Distinct Echo Substrings](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README_EN.md) - -#### Weekly Contest 170 - -- [1309. Decrypt String from Alphabet to Integer Mapping](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README_EN.md) -- [1310. XOR Queries of a Subarray](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README_EN.md) -- [1311. Get Watched Videos by Your Friends](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README_EN.md) -- [1312. Minimum Insertion Steps to Make a String Palindrome](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README_EN.md) - -#### Weekly Contest 169 - -- [1304. Find N Unique Integers Sum up to Zero](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README_EN.md) -- [1305. All Elements in Two Binary Search Trees](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README_EN.md) -- [1306. Jump Game III](/solution/1300-1399/1306.Jump%20Game%20III/README_EN.md) -- [1307. Verbal Arithmetic Puzzle](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README_EN.md) - -#### Biweekly Contest 16 - -- [1299. Replace Elements with Greatest Element on Right Side](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README_EN.md) -- [1300. Sum of Mutated Array Closest to Target](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README_EN.md) -- [1302. Deepest Leaves Sum](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README_EN.md) -- [1301. Number of Paths with Max Score](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README_EN.md) - -#### Weekly Contest 168 - -- [1295. Find Numbers with Even Number of Digits](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README_EN.md) -- [1296. Divide Array in Sets of K Consecutive Numbers](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README_EN.md) -- [1297. Maximum Number of Occurrences of a Substring](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README_EN.md) -- [1298. Maximum Candies You Can Get from Boxes](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README_EN.md) - -#### Weekly Contest 167 - -- [1290. Convert Binary Number in a Linked List to Integer](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README_EN.md) -- [1291. Sequential Digits](/solution/1200-1299/1291.Sequential%20Digits/README_EN.md) -- [1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README_EN.md) -- [1293. Shortest Path in a Grid with Obstacles Elimination](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README_EN.md) - -#### Biweekly Contest 15 - -- [1287. Element Appearing More Than 25% In Sorted Array](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README_EN.md) -- [1288. Remove Covered Intervals](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README_EN.md) -- [1286. Iterator for Combination](/solution/1200-1299/1286.Iterator%20for%20Combination/README_EN.md) -- [1289. Minimum Falling Path Sum II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README_EN.md) - -#### Weekly Contest 166 - -- [1281. Subtract the Product and Sum of Digits of an Integer](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README_EN.md) -- [1282. Group the People Given the Group Size They Belong To](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README_EN.md) -- [1283. Find the Smallest Divisor Given a Threshold](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README_EN.md) -- [1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README_EN.md) - -#### Weekly Contest 165 - -- [1275. Find Winner on a Tic Tac Toe Game](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README_EN.md) -- [1276. Number of Burgers with No Waste of Ingredients](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README_EN.md) -- [1277. Count Square Submatrices with All Ones](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README_EN.md) -- [1278. Palindrome Partitioning III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README_EN.md) - -#### Biweekly Contest 14 - -- [1271. Hexspeak](/solution/1200-1299/1271.Hexspeak/README_EN.md) -- [1272. Remove Interval](/solution/1200-1299/1272.Remove%20Interval/README_EN.md) -- [1273. Delete Tree Nodes](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README_EN.md) -- [1274. Number of Ships in a Rectangle](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README_EN.md) - -#### Weekly Contest 164 - -- [1266. Minimum Time Visiting All Points](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README_EN.md) -- [1267. Count Servers that Communicate](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README_EN.md) -- [1268. Search Suggestions System](/solution/1200-1299/1268.Search%20Suggestions%20System/README_EN.md) -- [1269. Number of Ways to Stay in the Same Place After Some Steps](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README_EN.md) - -#### Weekly Contest 163 - -- [1260. Shift 2D Grid](/solution/1200-1299/1260.Shift%202D%20Grid/README_EN.md) -- [1261. Find Elements in a Contaminated Binary Tree](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README_EN.md) -- [1262. Greatest Sum Divisible by Three](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README_EN.md) -- [1263. Minimum Moves to Move a Box to Their Target Location](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README_EN.md) - -#### Biweekly Contest 13 - -- [1256. Encode Number](/solution/1200-1299/1256.Encode%20Number/README_EN.md) -- [1257. Smallest Common Region](/solution/1200-1299/1257.Smallest%20Common%20Region/README_EN.md) -- [1258. Synonymous Sentences](/solution/1200-1299/1258.Synonymous%20Sentences/README_EN.md) -- [1259. Handshakes That Don't Cross](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README_EN.md) - -#### Weekly Contest 162 - -- [1252. Cells with Odd Values in a Matrix](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README_EN.md) -- [1253. Reconstruct a 2-Row Binary Matrix](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README_EN.md) -- [1254. Number of Closed Islands](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README_EN.md) -- [1255. Maximum Score Words Formed by Letters](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README_EN.md) - -#### Weekly Contest 161 - -- [1247. Minimum Swaps to Make Strings Equal](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README_EN.md) -- [1248. Count Number of Nice Subarrays](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README_EN.md) -- [1249. Minimum Remove to Make Valid Parentheses](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README_EN.md) -- [1250. Check If It Is a Good Array](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README_EN.md) - -#### Biweekly Contest 12 - -- [1244. Design A Leaderboard](/solution/1200-1299/1244.Design%20A%20Leaderboard/README_EN.md) -- [1243. Array Transformation](/solution/1200-1299/1243.Array%20Transformation/README_EN.md) -- [1245. Tree Diameter](/solution/1200-1299/1245.Tree%20Diameter/README_EN.md) -- [1246. Palindrome Removal](/solution/1200-1299/1246.Palindrome%20Removal/README_EN.md) - -#### Weekly Contest 160 - -- [1237. Find Positive Integer Solution for a Given Equation](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README_EN.md) -- [1238. Circular Permutation in Binary Representation](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README_EN.md) -- [1239. Maximum Length of a Concatenated String with Unique Characters](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README_EN.md) -- [1240. Tiling a Rectangle with the Fewest Squares](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README_EN.md) - -#### Weekly Contest 159 - -- [1232. Check If It Is a Straight Line](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README_EN.md) -- [1233. Remove Sub-Folders from the Filesystem](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README_EN.md) -- [1234. Replace the Substring for Balanced String](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README_EN.md) -- [1235. Maximum Profit in Job Scheduling](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README_EN.md) - -#### Biweekly Contest 11 - -- [1228. Missing Number In Arithmetic Progression](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README_EN.md) -- [1229. Meeting Scheduler](/solution/1200-1299/1229.Meeting%20Scheduler/README_EN.md) -- [1230. Toss Strange Coins](/solution/1200-1299/1230.Toss%20Strange%20Coins/README_EN.md) -- [1231. Divide Chocolate](/solution/1200-1299/1231.Divide%20Chocolate/README_EN.md) - -#### Weekly Contest 158 - -- [1221. Split a String in Balanced Strings](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README_EN.md) -- [1222. Queens That Can Attack the King](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README_EN.md) -- [1223. Dice Roll Simulation](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README_EN.md) -- [1224. Maximum Equal Frequency](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README_EN.md) - -#### Weekly Contest 157 - -- [1217. Minimum Cost to Move Chips to The Same Position](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README_EN.md) -- [1218. Longest Arithmetic Subsequence of Given Difference](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README_EN.md) -- [1219. Path with Maximum Gold](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README_EN.md) -- [1220. Count Vowels Permutation](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README_EN.md) - -#### Biweekly Contest 10 - -- [1213. Intersection of Three Sorted Arrays](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README_EN.md) -- [1214. Two Sum BSTs](/solution/1200-1299/1214.Two%20Sum%20BSTs/README_EN.md) -- [1215. Stepping Numbers](/solution/1200-1299/1215.Stepping%20Numbers/README_EN.md) -- [1216. Valid Palindrome III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README_EN.md) - -#### Weekly Contest 156 - -- [1207. Unique Number of Occurrences](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README_EN.md) -- [1208. Get Equal Substrings Within Budget](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README_EN.md) -- [1209. Remove All Adjacent Duplicates in String II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README_EN.md) -- [1210. Minimum Moves to Reach Target with Rotations](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README_EN.md) - -#### Weekly Contest 155 - -- [1200. Minimum Absolute Difference](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README_EN.md) -- [1201. Ugly Number III](/solution/1200-1299/1201.Ugly%20Number%20III/README_EN.md) -- [1202. Smallest String With Swaps](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README_EN.md) -- [1203. Sort Items by Groups Respecting Dependencies](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README_EN.md) - -#### Biweekly Contest 9 - -- [1196. How Many Apples Can You Put into the Basket](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README_EN.md) -- [1197. Minimum Knight Moves](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README_EN.md) -- [1198. Find Smallest Common Element in All Rows](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README_EN.md) -- [1199. Minimum Time to Build Blocks](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README_EN.md) - -#### Weekly Contest 154 - -- [1189. Maximum Number of Balloons](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README_EN.md) -- [1190. Reverse Substrings Between Each Pair of Parentheses](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README_EN.md) -- [1191. K-Concatenation Maximum Sum](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README_EN.md) -- [1192. Critical Connections in a Network](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README_EN.md) - -#### Weekly Contest 153 - -- [1184. Distance Between Bus Stops](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README_EN.md) -- [1185. Day of the Week](/solution/1100-1199/1185.Day%20of%20the%20Week/README_EN.md) -- [1186. Maximum Subarray Sum with One Deletion](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README_EN.md) -- [1187. Make Array Strictly Increasing](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README_EN.md) - -#### Biweekly Contest 8 - -- [1180. Count Substrings with Only One Distinct Letter](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README_EN.md) -- [1181. Before and After Puzzle](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README_EN.md) -- [1182. Shortest Distance to Target Color](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README_EN.md) -- [1183. Maximum Number of Ones](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README_EN.md) - -#### Weekly Contest 152 - -- [1175. Prime Arrangements](/solution/1100-1199/1175.Prime%20Arrangements/README_EN.md) -- [1176. Diet Plan Performance](/solution/1100-1199/1176.Diet%20Plan%20Performance/README_EN.md) -- [1177. Can Make Palindrome from Substring](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README_EN.md) -- [1178. Number of Valid Words for Each Puzzle](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README_EN.md) - -#### Weekly Contest 151 - -- [1169. Invalid Transactions](/solution/1100-1199/1169.Invalid%20Transactions/README_EN.md) -- [1170. Compare Strings by Frequency of the Smallest Character](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README_EN.md) -- [1171. Remove Zero Sum Consecutive Nodes from Linked List](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README_EN.md) -- [1172. Dinner Plate Stacks](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README_EN.md) - -#### Biweekly Contest 7 - -- [1165. Single-Row Keyboard](/solution/1100-1199/1165.Single-Row%20Keyboard/README_EN.md) -- [1166. Design File System](/solution/1100-1199/1166.Design%20File%20System/README_EN.md) -- [1167. Minimum Cost to Connect Sticks](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README_EN.md) -- [1168. Optimize Water Distribution in a Village](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README_EN.md) - -#### Weekly Contest 150 - -- [1160. Find Words That Can Be Formed by Characters](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README_EN.md) -- [1161. Maximum Level Sum of a Binary Tree](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README_EN.md) -- [1162. As Far from Land as Possible](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README_EN.md) -- [1163. Last Substring in Lexicographical Order](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README_EN.md) - -#### Weekly Contest 149 - -- [1154. Day of the Year](/solution/1100-1199/1154.Day%20of%20the%20Year/README_EN.md) -- [1155. Number of Dice Rolls With Target Sum](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README_EN.md) -- [1156. Swap For Longest Repeated Character Substring](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README_EN.md) -- [1157. Online Majority Element In Subarray](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README_EN.md) - -#### Biweekly Contest 6 - -- [1150. Check If a Number Is Majority Element in a Sorted Array](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README_EN.md) -- [1151. Minimum Swaps to Group All 1's Together](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README_EN.md) -- [1152. Analyze User Website Visit Pattern](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README_EN.md) -- [1153. String Transforms Into Another String](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README_EN.md) - -#### Weekly Contest 148 - -- [1144. Decrease Elements To Make Array Zigzag](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README_EN.md) -- [1145. Binary Tree Coloring Game](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README_EN.md) -- [1146. Snapshot Array](/solution/1100-1199/1146.Snapshot%20Array/README_EN.md) -- [1147. Longest Chunked Palindrome Decomposition](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README_EN.md) - -#### Weekly Contest 147 - -- [1137. N-th Tribonacci Number](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README_EN.md) -- [1138. Alphabet Board Path](/solution/1100-1199/1138.Alphabet%20Board%20Path/README_EN.md) -- [1139. Largest 1-Bordered Square](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README_EN.md) -- [1140. Stone Game II](/solution/1100-1199/1140.Stone%20Game%20II/README_EN.md) - -#### Biweekly Contest 5 - -- [1133. Largest Unique Number](/solution/1100-1199/1133.Largest%20Unique%20Number/README_EN.md) -- [1134. Armstrong Number](/solution/1100-1199/1134.Armstrong%20Number/README_EN.md) -- [1135. Connecting Cities With Minimum Cost](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README_EN.md) -- [1136. Parallel Courses](/solution/1100-1199/1136.Parallel%20Courses/README_EN.md) - -#### Weekly Contest 146 - -- [1128. Number of Equivalent Domino Pairs](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README_EN.md) -- [1129. Shortest Path with Alternating Colors](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README_EN.md) -- [1130. Minimum Cost Tree From Leaf Values](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README_EN.md) -- [1131. Maximum of Absolute Value Expression](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README_EN.md) - -#### Weekly Contest 145 - -- [1122. Relative Sort Array](/solution/1100-1199/1122.Relative%20Sort%20Array/README_EN.md) -- [1123. Lowest Common Ancestor of Deepest Leaves](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README_EN.md) -- [1124. Longest Well-Performing Interval](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README_EN.md) -- [1125. Smallest Sufficient Team](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README_EN.md) - -#### Biweekly Contest 4 - -- [1118. Number of Days in a Month](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README_EN.md) -- [1119. Remove Vowels from a String](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README_EN.md) -- [1120. Maximum Average Subtree](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README_EN.md) -- [1121. Divide Array Into Increasing Sequences](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README_EN.md) - -#### Weekly Contest 144 - -- [1108. Defanging an IP Address](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README_EN.md) -- [1109. Corporate Flight Bookings](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README_EN.md) -- [1110. Delete Nodes And Return Forest](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README_EN.md) -- [1111. Maximum Nesting Depth of Two Valid Parentheses Strings](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README_EN.md) - -#### Weekly Contest 143 - -- [1103. Distribute Candies to People](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README_EN.md) -- [1104. Path In Zigzag Labelled Binary Tree](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README_EN.md) -- [1105. Filling Bookcase Shelves](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README_EN.md) -- [1106. Parsing A Boolean Expression](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README_EN.md) - -#### Biweekly Contest 3 - -- [1099. Two Sum Less Than K](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README_EN.md) -- [1100. Find K-Length Substrings With No Repeated Characters](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README_EN.md) -- [1101. The Earliest Moment When Everyone Become Friends](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README_EN.md) -- [1102. Path With Maximum Minimum Value](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README_EN.md) - -#### Weekly Contest 142 - -- [1093. Statistics from a Large Sample](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README_EN.md) -- [1094. Car Pooling](/solution/1000-1099/1094.Car%20Pooling/README_EN.md) -- [1095. Find in Mountain Array](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README_EN.md) -- [1096. Brace Expansion II](/solution/1000-1099/1096.Brace%20Expansion%20II/README_EN.md) - -#### Weekly Contest 141 - -- [1089. Duplicate Zeros](/solution/1000-1099/1089.Duplicate%20Zeros/README_EN.md) -- [1090. Largest Values From Labels](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README_EN.md) -- [1091. Shortest Path in Binary Matrix](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README_EN.md) -- [1092. Shortest Common Supersequence](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README_EN.md) - -#### Biweekly Contest 2 - -- [1085. Sum of Digits in the Minimum Number](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README_EN.md) -- [1086. High Five](/solution/1000-1099/1086.High%20Five/README_EN.md) -- [1087. Brace Expansion](/solution/1000-1099/1087.Brace%20Expansion/README_EN.md) -- [1088. Confusing Number II](/solution/1000-1099/1088.Confusing%20Number%20II/README_EN.md) - -#### Weekly Contest 140 - -- [1078. Occurrences After Bigram](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README_EN.md) -- [1079. Letter Tile Possibilities](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README_EN.md) -- [1080. Insufficient Nodes in Root to Leaf Paths](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README_EN.md) -- [1081. Smallest Subsequence of Distinct Characters](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README_EN.md) - -#### Weekly Contest 139 - -- [1071. Greatest Common Divisor of Strings](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README_EN.md) -- [1072. Flip Columns For Maximum Number of Equal Rows](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README_EN.md) -- [1073. Adding Two Negabinary Numbers](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README_EN.md) -- [1074. Number of Submatrices That Sum to Target](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README_EN.md) - -#### Biweekly Contest 1 - -- [1064. Fixed Point](/solution/1000-1099/1064.Fixed%20Point/README_EN.md) -- [1065. Index Pairs of a String](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README_EN.md) -- [1066. Campus Bikes II](/solution/1000-1099/1066.Campus%20Bikes%20II/README_EN.md) -- [1067. Digit Count in Range](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README_EN.md) - -#### Weekly Contest 138 - -- [1051. Height Checker](/solution/1000-1099/1051.Height%20Checker/README_EN.md) -- [1052. Grumpy Bookstore Owner](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README_EN.md) -- [1053. Previous Permutation With One Swap](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README_EN.md) -- [1054. Distant Barcodes](/solution/1000-1099/1054.Distant%20Barcodes/README_EN.md) - -#### Weekly Contest 137 - -- [1046. Last Stone Weight](/solution/1000-1099/1046.Last%20Stone%20Weight/README_EN.md) -- [1047. Remove All Adjacent Duplicates In String](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README_EN.md) -- [1048. Longest String Chain](/solution/1000-1099/1048.Longest%20String%20Chain/README_EN.md) -- [1049. Last Stone Weight II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README_EN.md) - -#### Weekly Contest 136 - -- [1041. Robot Bounded In Circle](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README_EN.md) -- [1042. Flower Planting With No Adjacent](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README_EN.md) -- [1043. Partition Array for Maximum Sum](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README_EN.md) -- [1044. Longest Duplicate Substring](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README_EN.md) - -#### Weekly Contest 135 - -- [1037. Valid Boomerang](/solution/1000-1099/1037.Valid%20Boomerang/README_EN.md) -- [1038. Binary Search Tree to Greater Sum Tree](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README_EN.md) -- [1039. Minimum Score Triangulation of Polygon](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README_EN.md) -- [1040. Moving Stones Until Consecutive II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README_EN.md) - -#### Weekly Contest 134 - -- [1033. Moving Stones Until Consecutive](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README_EN.md) -- [1034. Coloring A Border](/solution/1000-1099/1034.Coloring%20A%20Border/README_EN.md) -- [1035. Uncrossed Lines](/solution/1000-1099/1035.Uncrossed%20Lines/README_EN.md) -- [1036. Escape a Large Maze](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README_EN.md) - -#### Weekly Contest 133 - -- [1029. Two City Scheduling](/solution/1000-1099/1029.Two%20City%20Scheduling/README_EN.md) -- [1030. Matrix Cells in Distance Order](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README_EN.md) -- [1031. Maximum Sum of Two Non-Overlapping Subarrays](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README_EN.md) -- [1032. Stream of Characters](/solution/1000-1099/1032.Stream%20of%20Characters/README_EN.md) - -#### Weekly Contest 132 - -- [1025. Divisor Game](/solution/1000-1099/1025.Divisor%20Game/README_EN.md) -- [1026. Maximum Difference Between Node and Ancestor](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README_EN.md) -- [1027. Longest Arithmetic Subsequence](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README_EN.md) -- [1028. Recover a Tree From Preorder Traversal](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README_EN.md) - -#### Weekly Contest 131 - -- [1021. Remove Outermost Parentheses](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README_EN.md) -- [1022. Sum of Root To Leaf Binary Numbers](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README_EN.md) -- [1023. Camelcase Matching](/solution/1000-1099/1023.Camelcase%20Matching/README_EN.md) -- [1024. Video Stitching](/solution/1000-1099/1024.Video%20Stitching/README_EN.md) - -#### Weekly Contest 130 - -- [1018. Binary Prefix Divisible By 5](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README_EN.md) -- [1017. Convert to Base -2](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README_EN.md) -- [1019. Next Greater Node In Linked List](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README_EN.md) -- [1020. Number of Enclaves](/solution/1000-1099/1020.Number%20of%20Enclaves/README_EN.md) - -#### Weekly Contest 129 - -- [1013. Partition Array Into Three Parts With Equal Sum](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README_EN.md) -- [1015. Smallest Integer Divisible by K](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README_EN.md) -- [1014. Best Sightseeing Pair](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README_EN.md) -- [1016. Binary String With Substrings Representing 1 To N](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README_EN.md) - -#### Weekly Contest 128 - -- [1009. Complement of Base 10 Integer](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README_EN.md) -- [1010. Pairs of Songs With Total Durations Divisible by 60](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README_EN.md) -- [1011. Capacity To Ship Packages Within D Days](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README_EN.md) -- [1012. Numbers With Repeated Digits](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README_EN.md) - -#### Weekly Contest 127 - -- [1005. Maximize Sum Of Array After K Negations](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README_EN.md) -- [1006. Clumsy Factorial](/solution/1000-1099/1006.Clumsy%20Factorial/README_EN.md) -- [1007. Minimum Domino Rotations For Equal Row](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README_EN.md) -- [1008. Construct Binary Search Tree from Preorder Traversal](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README_EN.md) - -#### Weekly Contest 126 - -- [1002. Find Common Characters](/solution/1000-1099/1002.Find%20Common%20Characters/README_EN.md) -- [1003. Check If Word Is Valid After Substitutions](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README_EN.md) -- [1004. Max Consecutive Ones III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README_EN.md) -- [1000. Minimum Cost to Merge Stones](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README_EN.md) - -#### Weekly Contest 125 - -- [0997. Find the Town Judge](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README_EN.md) -- [0999. Available Captures for Rook](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README_EN.md) -- [0998. Maximum Binary Tree II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README_EN.md) -- [1001. Grid Illumination](/solution/1000-1099/1001.Grid%20Illumination/README_EN.md) - -#### Weekly Contest 124 - -- [0993. Cousins in Binary Tree](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README_EN.md) -- [0994. Rotting Oranges](/solution/0900-0999/0994.Rotting%20Oranges/README_EN.md) -- [0995. Minimum Number of K Consecutive Bit Flips](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README_EN.md) -- [0996. Number of Squareful Arrays](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README_EN.md) - -#### Weekly Contest 123 - -- [0989. Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README_EN.md) -- [0990. Satisfiability of Equality Equations](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README_EN.md) -- [0991. Broken Calculator](/solution/0900-0999/0991.Broken%20Calculator/README_EN.md) -- [0992. Subarrays with K Different Integers](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README_EN.md) - -#### Weekly Contest 122 - -- [0985. Sum of Even Numbers After Queries](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README_EN.md) -- [0988. Smallest String Starting From Leaf](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README_EN.md) -- [0986. Interval List Intersections](/solution/0900-0999/0986.Interval%20List%20Intersections/README_EN.md) -- [0987. Vertical Order Traversal of a Binary Tree](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README_EN.md) - -#### Weekly Contest 121 - -- [0984. String Without AAA or BBB](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README_EN.md) -- [0981. Time Based Key-Value Store](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README_EN.md) -- [0983. Minimum Cost For Tickets](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README_EN.md) -- [0982. Triples with Bitwise AND Equal To Zero](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README_EN.md) - -#### Weekly Contest 120 - -- [0977. Squares of a Sorted Array](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README_EN.md) -- [0978. Longest Turbulent Subarray](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README_EN.md) -- [0979. Distribute Coins in Binary Tree](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README_EN.md) -- [0980. Unique Paths III](/solution/0900-0999/0980.Unique%20Paths%20III/README_EN.md) - -#### Weekly Contest 119 - -- [0973. K Closest Points to Origin](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README_EN.md) -- [0976. Largest Perimeter Triangle](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README_EN.md) -- [0974. Subarray Sums Divisible by K](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README_EN.md) -- [0975. Odd Even Jump](/solution/0900-0999/0975.Odd%20Even%20Jump/README_EN.md) - -#### Weekly Contest 118 - -- [0970. Powerful Integers](/solution/0900-0999/0970.Powerful%20Integers/README_EN.md) -- [0969. Pancake Sorting](/solution/0900-0999/0969.Pancake%20Sorting/README_EN.md) -- [0971. Flip Binary Tree To Match Preorder Traversal](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README_EN.md) -- [0972. Equal Rational Numbers](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README_EN.md) - -#### Weekly Contest 117 - -- [0965. Univalued Binary Tree](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README_EN.md) -- [0967. Numbers With Same Consecutive Differences](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README_EN.md) -- [0966. Vowel Spellchecker](/solution/0900-0999/0966.Vowel%20Spellchecker/README_EN.md) -- [0968. Binary Tree Cameras](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README_EN.md) - -#### Weekly Contest 116 - -- [0961. N-Repeated Element in Size 2N Array](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README_EN.md) -- [0962. Maximum Width Ramp](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README_EN.md) -- [0963. Minimum Area Rectangle II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README_EN.md) -- [0964. Least Operators to Express Number](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README_EN.md) - -#### Weekly Contest 115 - -- [0957. Prison Cells After N Days](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README_EN.md) -- [0958. Check Completeness of a Binary Tree](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README_EN.md) -- [0959. Regions Cut By Slashes](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README_EN.md) -- [0960. Delete Columns to Make Sorted III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README_EN.md) - -#### Weekly Contest 114 - -- [0953. Verifying an Alien Dictionary](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README_EN.md) -- [0954. Array of Doubled Pairs](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README_EN.md) -- [0955. Delete Columns to Make Sorted II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README_EN.md) -- [0956. Tallest Billboard](/solution/0900-0999/0956.Tallest%20Billboard/README_EN.md) - -#### Weekly Contest 113 - -- [0949. Largest Time for Given Digits](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README_EN.md) -- [0951. Flip Equivalent Binary Trees](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README_EN.md) -- [0950. Reveal Cards In Increasing Order](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README_EN.md) -- [0952. Largest Component Size by Common Factor](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README_EN.md) - -#### Weekly Contest 112 - -- [0945. Minimum Increment to Make Array Unique](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README_EN.md) -- [0946. Validate Stack Sequences](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README_EN.md) -- [0947. Most Stones Removed with Same Row or Column](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README_EN.md) -- [0948. Bag of Tokens](/solution/0900-0999/0948.Bag%20of%20Tokens/README_EN.md) - -#### Weekly Contest 111 - -- [0941. Valid Mountain Array](/solution/0900-0999/0941.Valid%20Mountain%20Array/README_EN.md) -- [0944. Delete Columns to Make Sorted](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README_EN.md) -- [0942. DI String Match](/solution/0900-0999/0942.DI%20String%20Match/README_EN.md) -- [0943. Find the Shortest Superstring](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README_EN.md) - -#### Weekly Contest 110 - -- [0937. Reorder Data in Log Files](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README_EN.md) -- [0938. Range Sum of BST](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README_EN.md) -- [0939. Minimum Area Rectangle](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README_EN.md) -- [0940. Distinct Subsequences II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README_EN.md) - -#### Weekly Contest 109 - -- [0933. Number of Recent Calls](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README_EN.md) -- [0935. Knight Dialer](/solution/0900-0999/0935.Knight%20Dialer/README_EN.md) -- [0934. Shortest Bridge](/solution/0900-0999/0934.Shortest%20Bridge/README_EN.md) -- [0936. Stamping The Sequence](/solution/0900-0999/0936.Stamping%20The%20Sequence/README_EN.md) - -#### Weekly Contest 108 - -- [0929. Unique Email Addresses](/solution/0900-0999/0929.Unique%20Email%20Addresses/README_EN.md) -- [0930. Binary Subarrays With Sum](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README_EN.md) -- [0931. Minimum Falling Path Sum](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README_EN.md) -- [0932. Beautiful Array](/solution/0900-0999/0932.Beautiful%20Array/README_EN.md) - -#### Weekly Contest 107 - -- [0925. Long Pressed Name](/solution/0900-0999/0925.Long%20Pressed%20Name/README_EN.md) -- [0926. Flip String to Monotone Increasing](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README_EN.md) -- [0927. Three Equal Parts](/solution/0900-0999/0927.Three%20Equal%20Parts/README_EN.md) -- [0928. Minimize Malware Spread II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README_EN.md) - -#### Weekly Contest 106 - -- [0922. Sort Array By Parity II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README_EN.md) -- [0921. Minimum Add to Make Parentheses Valid](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README_EN.md) -- [0923. 3Sum With Multiplicity](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README_EN.md) -- [0924. Minimize Malware Spread](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README_EN.md) - -#### Weekly Contest 105 - -- [0917. Reverse Only Letters](/solution/0900-0999/0917.Reverse%20Only%20Letters/README_EN.md) -- [0918. Maximum Sum Circular Subarray](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README_EN.md) -- [0919. Complete Binary Tree Inserter](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README_EN.md) -- [0920. Number of Music Playlists](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README_EN.md) - -#### Weekly Contest 104 - -- [0914. X of a Kind in a Deck of Cards](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README_EN.md) -- [0915. Partition Array into Disjoint Intervals](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README_EN.md) -- [0916. Word Subsets](/solution/0900-0999/0916.Word%20Subsets/README_EN.md) -- [0913. Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README_EN.md) - -#### Weekly Contest 103 - -- [0908. Smallest Range I](/solution/0900-0999/0908.Smallest%20Range%20I/README_EN.md) -- [0909. Snakes and Ladders](/solution/0900-0999/0909.Snakes%20and%20Ladders/README_EN.md) -- [0910. Smallest Range II](/solution/0900-0999/0910.Smallest%20Range%20II/README_EN.md) -- [0911. Online Election](/solution/0900-0999/0911.Online%20Election/README_EN.md) - -#### Weekly Contest 102 - -- [0905. Sort Array By Parity](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README_EN.md) -- [0904. Fruit Into Baskets](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README_EN.md) -- [0907. Sum of Subarray Minimums](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README_EN.md) -- [0906. Super Palindromes](/solution/0900-0999/0906.Super%20Palindromes/README_EN.md) - -#### Weekly Contest 101 - -- [0900. RLE Iterator](/solution/0900-0999/0900.RLE%20Iterator/README_EN.md) -- [0901. Online Stock Span](/solution/0900-0999/0901.Online%20Stock%20Span/README_EN.md) -- [0902. Numbers At Most N Given Digit Set](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README_EN.md) -- [0903. Valid Permutations for DI Sequence](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README_EN.md) - -#### Weekly Contest 100 - -- [0896. Monotonic Array](/solution/0800-0899/0896.Monotonic%20Array/README_EN.md) -- [0897. Increasing Order Search Tree](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README_EN.md) -- [0898. Bitwise ORs of Subarrays](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README_EN.md) -- [0899. Orderly Queue](/solution/0800-0899/0899.Orderly%20Queue/README_EN.md) - -#### Weekly Contest 99 - -- [0892. Surface Area of 3D Shapes](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README_EN.md) -- [0893. Groups of Special-Equivalent Strings](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README_EN.md) -- [0894. All Possible Full Binary Trees](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README_EN.md) -- [0895. Maximum Frequency Stack](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README_EN.md) - -#### Weekly Contest 98 - -- [0888. Fair Candy Swap](/solution/0800-0899/0888.Fair%20Candy%20Swap/README_EN.md) -- [0890. Find and Replace Pattern](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README_EN.md) -- [0889. Construct Binary Tree from Preorder and Postorder Traversal](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README_EN.md) -- [0891. Sum of Subsequence Widths](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README_EN.md) - -#### Weekly Contest 97 - -- [0884. Uncommon Words from Two Sentences](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README_EN.md) -- [0885. Spiral Matrix III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README_EN.md) -- [0886. Possible Bipartition](/solution/0800-0899/0886.Possible%20Bipartition/README_EN.md) -- [0887. Super Egg Drop](/solution/0800-0899/0887.Super%20Egg%20Drop/README_EN.md) - -#### Weekly Contest 96 - -- [0883. Projection Area of 3D Shapes](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README_EN.md) -- [0881. Boats to Save People](/solution/0800-0899/0881.Boats%20to%20Save%20People/README_EN.md) -- [0880. Decoded String at Index](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README_EN.md) -- [0882. Reachable Nodes In Subdivided Graph](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README_EN.md) - -#### Weekly Contest 95 - -- [0876. Middle of the Linked List](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README_EN.md) -- [0877. Stone Game](/solution/0800-0899/0877.Stone%20Game/README_EN.md) -- [0878. Nth Magical Number](/solution/0800-0899/0878.Nth%20Magical%20Number/README_EN.md) -- [0879. Profitable Schemes](/solution/0800-0899/0879.Profitable%20Schemes/README_EN.md) - -#### Weekly Contest 94 - -- [0872. Leaf-Similar Trees](/solution/0800-0899/0872.Leaf-Similar%20Trees/README_EN.md) -- [0874. Walking Robot Simulation](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README_EN.md) -- [0875. Koko Eating Bananas](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README_EN.md) -- [0873. Length of Longest Fibonacci Subsequence](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README_EN.md) - -#### Weekly Contest 93 - -- [0868. Binary Gap](/solution/0800-0899/0868.Binary%20Gap/README_EN.md) -- [0869. Reordered Power of 2](/solution/0800-0899/0869.Reordered%20Power%20of%202/README_EN.md) -- [0870. Advantage Shuffle](/solution/0800-0899/0870.Advantage%20Shuffle/README_EN.md) -- [0871. Minimum Number of Refueling Stops](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README_EN.md) - -#### Weekly Contest 92 - -- [0867. Transpose Matrix](/solution/0800-0899/0867.Transpose%20Matrix/README_EN.md) -- [0865. Smallest Subtree with all the Deepest Nodes](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README_EN.md) -- [0866. Prime Palindrome](/solution/0800-0899/0866.Prime%20Palindrome/README_EN.md) -- [0864. Shortest Path to Get All Keys](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README_EN.md) - -#### Weekly Contest 91 - -- [0860. Lemonade Change](/solution/0800-0899/0860.Lemonade%20Change/README_EN.md) -- [0863. All Nodes Distance K in Binary Tree](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README_EN.md) -- [0861. Score After Flipping Matrix](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README_EN.md) -- [0862. Shortest Subarray with Sum at Least K](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README_EN.md) - -#### Weekly Contest 90 - -- [0859. Buddy Strings](/solution/0800-0899/0859.Buddy%20Strings/README_EN.md) -- [0856. Score of Parentheses](/solution/0800-0899/0856.Score%20of%20Parentheses/README_EN.md) -- [0858. Mirror Reflection](/solution/0800-0899/0858.Mirror%20Reflection/README_EN.md) -- [0857. Minimum Cost to Hire K Workers](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README_EN.md) - -#### Weekly Contest 89 - -- [0852. Peak Index in a Mountain Array](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README_EN.md) -- [0853. Car Fleet](/solution/0800-0899/0853.Car%20Fleet/README_EN.md) -- [0855. Exam Room](/solution/0800-0899/0855.Exam%20Room/README_EN.md) -- [0854. K-Similar Strings](/solution/0800-0899/0854.K-Similar%20Strings/README_EN.md) - -#### Weekly Contest 88 - -- [0848. Shifting Letters](/solution/0800-0899/0848.Shifting%20Letters/README_EN.md) -- [0849. Maximize Distance to Closest Person](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README_EN.md) -- [0851. Loud and Rich](/solution/0800-0899/0851.Loud%20and%20Rich/README_EN.md) -- [0850. Rectangle Area II](/solution/0800-0899/0850.Rectangle%20Area%20II/README_EN.md) - -#### Weekly Contest 87 - -- [0844. Backspace String Compare](/solution/0800-0899/0844.Backspace%20String%20Compare/README_EN.md) -- [0845. Longest Mountain in Array](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README_EN.md) -- [0846. Hand of Straights](/solution/0800-0899/0846.Hand%20of%20Straights/README_EN.md) -- [0847. Shortest Path Visiting All Nodes](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README_EN.md) - -#### Weekly Contest 86 - -- [0840. Magic Squares In Grid](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README_EN.md) -- [0841. Keys and Rooms](/solution/0800-0899/0841.Keys%20and%20Rooms/README_EN.md) -- [0842. Split Array into Fibonacci Sequence](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README_EN.md) -- [0843. Guess the Word](/solution/0800-0899/0843.Guess%20the%20Word/README_EN.md) - -#### Weekly Contest 85 - -- [0836. Rectangle Overlap](/solution/0800-0899/0836.Rectangle%20Overlap/README_EN.md) -- [0838. Push Dominoes](/solution/0800-0899/0838.Push%20Dominoes/README_EN.md) -- [0837. New 21 Game](/solution/0800-0899/0837.New%2021%20Game/README_EN.md) -- [0839. Similar String Groups](/solution/0800-0899/0839.Similar%20String%20Groups/README_EN.md) - -#### Weekly Contest 84 - -- [0832. Flipping an Image](/solution/0800-0899/0832.Flipping%20an%20Image/README_EN.md) -- [0833. Find And Replace in String](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README_EN.md) -- [0835. Image Overlap](/solution/0800-0899/0835.Image%20Overlap/README_EN.md) -- [0834. Sum of Distances in Tree](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README_EN.md) - -#### Weekly Contest 83 - -- [0830. Positions of Large Groups](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README_EN.md) -- [0831. Masking Personal Information](/solution/0800-0899/0831.Masking%20Personal%20Information/README_EN.md) -- [0829. Consecutive Numbers Sum](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README_EN.md) -- [0828. Count Unique Characters of All Substrings of a Given String](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README_EN.md) +--- +comments: true +--- + +# LeetCode Contest + +[中文文档](/solution/CONTEST_README.md) + +## Contest Rating & Badge + +The contest badge is calculated based on the contest rating. + +For LeetCoders with rating >=1600, +If you are in the top 5% of the contest rating, you’ll get the “Guardian” badge. + +If you are in the top 25% of the contest rating, you’ll get the “Knight” badge. + +| Level | Proportion | Badge | Rating | | +| ----- | ---------- | -------- | ----------- | ----------------------------------------------------------------------------------------------------------------------- | +| LV3 | 5\% | Guardian | ≥2228.90 |

| +| LV2 | 20\% | Knight | ≥1842.73 |

| +| LV1 | 75\% | - | - | - | + +For top 10 users (excluding LCCN users), your LeetCode ID will be colored orange on the ranking board. You'll also have the honor with you when you post/comment under discuss. + +## Rating Predictor + +If you want to estimate your score changes after the contest ends, you can visit the website [LeetCode Contest Rating Predictor](https://lccn.lbao.site/). + +## Past Contests + +#### Weekly Contest 402 + +- [3184. Count Pairs That Form a Complete Day I](/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README_EN.md) +- [3185. Count Pairs That Form a Complete Day II](/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README_EN.md) +- [3186. Maximum Total Damage With Spell Casting](/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README_EN.md) +- [3187. Peaks in Array](/solution/3100-3199/3187.Peaks%20in%20Array/README_EN.md) + +#### Weekly Contest 401 + +- [3178. Find the Child Who Has the Ball After K Seconds](/solution/3100-3199/3178.Find%20the%20Child%20Who%20Has%20the%20Ball%20After%20K%20Seconds/README_EN.md) +- [3179. Find the N-th Value After K Seconds](/solution/3100-3199/3179.Find%20the%20N-th%20Value%20After%20K%20Seconds/README_EN.md) +- [3180. Maximum Total Reward Using Operations I](/solution/3100-3199/3180.Maximum%20Total%20Reward%20Using%20Operations%20I/README_EN.md) +- [3181. Maximum Total Reward Using Operations II](/solution/3100-3199/3181.Maximum%20Total%20Reward%20Using%20Operations%20II/README_EN.md) + +#### Biweekly Contest 132 + +- [3174. Clear Digits](/solution/3100-3199/3174.Clear%20Digits/README_EN.md) +- [3175. Find The First Player to win K Games in a Row](/solution/3100-3199/3175.Find%20The%20First%20Player%20to%20win%20K%20Games%20in%20a%20Row/README_EN.md) +- [3176. Find the Maximum Length of a Good Subsequence I](/solution/3100-3199/3176.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20I/README_EN.md) +- [3177. Find the Maximum Length of a Good Subsequence II](/solution/3100-3199/3177.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20II/README_EN.md) + +#### Weekly Contest 400 + +- [3168. Minimum Number of Chairs in a Waiting Room](/solution/3100-3199/3168.Minimum%20Number%20of%20Chairs%20in%20a%20Waiting%20Room/README_EN.md) +- [3169. Count Days Without Meetings](/solution/3100-3199/3169.Count%20Days%20Without%20Meetings/README_EN.md) +- [3170. Lexicographically Minimum String After Removing Stars](/solution/3100-3199/3170.Lexicographically%20Minimum%20String%20After%20Removing%20Stars/README_EN.md) +- [3171. Find Subarray With Bitwise OR Closest to K](/solution/3100-3199/3171.Find%20Subarray%20With%20Bitwise%20OR%20Closest%20to%20K/README_EN.md) + +#### Weekly Contest 399 + +- [3162. Find the Number of Good Pairs I](/solution/3100-3199/3162.Find%20the%20Number%20of%20Good%20Pairs%20I/README_EN.md) +- [3163. String Compression III](/solution/3100-3199/3163.String%20Compression%20III/README_EN.md) +- [3164. Find the Number of Good Pairs II](/solution/3100-3199/3164.Find%20the%20Number%20of%20Good%20Pairs%20II/README_EN.md) +- [3165. Maximum Sum of Subsequence With Non-adjacent Elements](/solution/3100-3199/3165.Maximum%20Sum%20of%20Subsequence%20With%20Non-adjacent%20Elements/README_EN.md) + +#### Biweekly Contest 131 + +- [3158. Find the XOR of Numbers Which Appear Twice](/solution/3100-3199/3158.Find%20the%20XOR%20of%20Numbers%20Which%20Appear%20Twice/README_EN.md) +- [3159. Find Occurrences of an Element in an Array](/solution/3100-3199/3159.Find%20Occurrences%20of%20an%20Element%20in%20an%20Array/README_EN.md) +- [3160. Find the Number of Distinct Colors Among the Balls](/solution/3100-3199/3160.Find%20the%20Number%20of%20Distinct%20Colors%20Among%20the%20Balls/README_EN.md) +- [3161. Block Placement Queries](/solution/3100-3199/3161.Block%20Placement%20Queries/README_EN.md) + +#### Weekly Contest 398 + +- [3151. Special Array I](/solution/3100-3199/3151.Special%20Array%20I/README_EN.md) +- [3152. Special Array II](/solution/3100-3199/3152.Special%20Array%20II/README_EN.md) +- [3153. Sum of Digit Differences of All Pairs](/solution/3100-3199/3153.Sum%20of%20Digit%20Differences%20of%20All%20Pairs/README_EN.md) +- [3154. Find Number of Ways to Reach the K-th Stair](/solution/3100-3199/3154.Find%20Number%20of%20Ways%20to%20Reach%20the%20K-th%20Stair/README_EN.md) + +#### Weekly Contest 397 + +- [3146. Permutation Difference between Two Strings](/solution/3100-3199/3146.Permutation%20Difference%20between%20Two%20Strings/README_EN.md) +- [3147. Taking Maximum Energy From the Mystic Dungeon](/solution/3100-3199/3147.Taking%20Maximum%20Energy%20From%20the%20Mystic%20Dungeon/README_EN.md) +- [3148. Maximum Difference Score in a Grid](/solution/3100-3199/3148.Maximum%20Difference%20Score%20in%20a%20Grid/README_EN.md) +- [3149. Find the Minimum Cost Array Permutation](/solution/3100-3199/3149.Find%20the%20Minimum%20Cost%20Array%20Permutation/README_EN.md) + +#### Biweekly Contest 130 + +- [3142. Check if Grid Satisfies Conditions](/solution/3100-3199/3142.Check%20if%20Grid%20Satisfies%20Conditions/README_EN.md) +- [3143. Maximum Points Inside the Square](/solution/3100-3199/3143.Maximum%20Points%20Inside%20the%20Square/README_EN.md) +- [3144. Minimum Substring Partition of Equal Character Frequency](/solution/3100-3199/3144.Minimum%20Substring%20Partition%20of%20Equal%20Character%20Frequency/README_EN.md) +- [3145. Find Products of Elements of Big Array](/solution/3100-3199/3145.Find%20Products%20of%20Elements%20of%20Big%20Array/README_EN.md) + +#### Weekly Contest 396 + +- [3136. Valid Word](/solution/3100-3199/3136.Valid%20Word/README_EN.md) +- [3137. Minimum Number of Operations to Make Word K-Periodic](/solution/3100-3199/3137.Minimum%20Number%20of%20Operations%20to%20Make%20Word%20K-Periodic/README_EN.md) +- [3138. Minimum Length of Anagram Concatenation](/solution/3100-3199/3138.Minimum%20Length%20of%20Anagram%20Concatenation/README_EN.md) +- [3139. Minimum Cost to Equalize Array](/solution/3100-3199/3139.Minimum%20Cost%20to%20Equalize%20Array/README_EN.md) + +#### Weekly Contest 395 + +- [3131. Find the Integer Added to Array I](/solution/3100-3199/3131.Find%20the%20Integer%20Added%20to%20Array%20I/README_EN.md) +- [3132. Find the Integer Added to Array II](/solution/3100-3199/3132.Find%20the%20Integer%20Added%20to%20Array%20II/README_EN.md) +- [3133. Minimum Array End](/solution/3100-3199/3133.Minimum%20Array%20End/README_EN.md) +- [3134. Find the Median of the Uniqueness Array](/solution/3100-3199/3134.Find%20the%20Median%20of%20the%20Uniqueness%20Array/README_EN.md) + +#### Biweekly Contest 129 + +- [3127. Make a Square with the Same Color](/solution/3100-3199/3127.Make%20a%20Square%20with%20the%20Same%20Color/README_EN.md) +- [3128. Right Triangles](/solution/3100-3199/3128.Right%20Triangles/README_EN.md) +- [3129. Find All Possible Stable Binary Arrays I](/solution/3100-3199/3129.Find%20All%20Possible%20Stable%20Binary%20Arrays%20I/README_EN.md) +- [3130. Find All Possible Stable Binary Arrays II](/solution/3100-3199/3130.Find%20All%20Possible%20Stable%20Binary%20Arrays%20II/README_EN.md) + +#### Weekly Contest 394 + +- [3120. Count the Number of Special Characters I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README_EN.md) +- [3121. Count the Number of Special Characters II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README_EN.md) +- [3122. Minimum Number of Operations to Satisfy Conditions](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README_EN.md) +- [3123. Find Edges in Shortest Paths](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README_EN.md) + +#### Weekly Contest 393 + +- [3114. Latest Time You Can Obtain After Replacing Characters](/solution/3100-3199/3114.Latest%20Time%20You%20Can%20Obtain%20After%20Replacing%20Characters/README_EN.md) +- [3115. Maximum Prime Difference](/solution/3100-3199/3115.Maximum%20Prime%20Difference/README_EN.md) +- [3116. Kth Smallest Amount With Single Denomination Combination](/solution/3100-3199/3116.Kth%20Smallest%20Amount%20With%20Single%20Denomination%20Combination/README_EN.md) +- [3117. Minimum Sum of Values by Dividing Array](/solution/3100-3199/3117.Minimum%20Sum%20of%20Values%20by%20Dividing%20Array/README_EN.md) + +#### Biweekly Contest 128 + +- [3110. Score of a String](/solution/3100-3199/3110.Score%20of%20a%20String/README_EN.md) +- [3111. Minimum Rectangles to Cover Points](/solution/3100-3199/3111.Minimum%20Rectangles%20to%20Cover%20Points/README_EN.md) +- [3112. Minimum Time to Visit Disappearing Nodes](/solution/3100-3199/3112.Minimum%20Time%20to%20Visit%20Disappearing%20Nodes/README_EN.md) +- [3113. Find the Number of Subarrays Where Boundary Elements Are Maximum](/solution/3100-3199/3113.Find%20the%20Number%20of%20Subarrays%20Where%20Boundary%20Elements%20Are%20Maximum/README_EN.md) + +#### Weekly Contest 392 + +- [3105. Longest Strictly Increasing or Strictly Decreasing Subarray](/solution/3100-3199/3105.Longest%20Strictly%20Increasing%20or%20Strictly%20Decreasing%20Subarray/README_EN.md) +- [3106. Lexicographically Smallest String After Operations With Constraint](/solution/3100-3199/3106.Lexicographically%20Smallest%20String%20After%20Operations%20With%20Constraint/README_EN.md) +- [3107. Minimum Operations to Make Median of Array Equal to K](/solution/3100-3199/3107.Minimum%20Operations%20to%20Make%20Median%20of%20Array%20Equal%20to%20K/README_EN.md) +- [3108. Minimum Cost Walk in Weighted Graph](/solution/3100-3199/3108.Minimum%20Cost%20Walk%20in%20Weighted%20Graph/README_EN.md) + +#### Weekly Contest 391 + +- [3099. Harshad Number](/solution/3000-3099/3099.Harshad%20Number/README_EN.md) +- [3100. Water Bottles II](/solution/3100-3199/3100.Water%20Bottles%20II/README_EN.md) +- [3101. Count Alternating Subarrays](/solution/3100-3199/3101.Count%20Alternating%20Subarrays/README_EN.md) +- [3102. Minimize Manhattan Distances](/solution/3100-3199/3102.Minimize%20Manhattan%20Distances/README_EN.md) + +#### Biweekly Contest 127 + +- [3095. Shortest Subarray With OR at Least K I](/solution/3000-3099/3095.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20I/README_EN.md) +- [3096. Minimum Levels to Gain More Points](/solution/3000-3099/3096.Minimum%20Levels%20to%20Gain%20More%20Points/README_EN.md) +- [3097. Shortest Subarray With OR at Least K II](/solution/3000-3099/3097.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20II/README_EN.md) +- [3098. Find the Sum of Subsequence Powers](/solution/3000-3099/3098.Find%20the%20Sum%20of%20Subsequence%20Powers/README_EN.md) + +#### Weekly Contest 390 + +- [3090. Maximum Length Substring With Two Occurrences](/solution/3000-3099/3090.Maximum%20Length%20Substring%20With%20Two%20Occurrences/README_EN.md) +- [3091. Apply Operations to Make Sum of Array Greater Than or Equal to k](/solution/3000-3099/3091.Apply%20Operations%20to%20Make%20Sum%20of%20Array%20Greater%20Than%20or%20Equal%20to%20k/README_EN.md) +- [3092. Most Frequent IDs](/solution/3000-3099/3092.Most%20Frequent%20IDs/README_EN.md) +- [3093. Longest Common Suffix Queries](/solution/3000-3099/3093.Longest%20Common%20Suffix%20Queries/README_EN.md) + +#### Weekly Contest 389 + +- [3083. Existence of a Substring in a String and Its Reverse](/solution/3000-3099/3083.Existence%20of%20a%20Substring%20in%20a%20String%20and%20Its%20Reverse/README_EN.md) +- [3084. Count Substrings Starting and Ending with Given Character](/solution/3000-3099/3084.Count%20Substrings%20Starting%20and%20Ending%20with%20Given%20Character/README_EN.md) +- [3085. Minimum Deletions to Make String K-Special](/solution/3000-3099/3085.Minimum%20Deletions%20to%20Make%20String%20K-Special/README_EN.md) +- [3086. Minimum Moves to Pick K Ones](/solution/3000-3099/3086.Minimum%20Moves%20to%20Pick%20K%20Ones/README_EN.md) + +#### Biweekly Contest 126 + +- [3079. Find the Sum of Encrypted Integers](/solution/3000-3099/3079.Find%20the%20Sum%20of%20Encrypted%20Integers/README_EN.md) +- [3080. Mark Elements on Array by Performing Queries](/solution/3000-3099/3080.Mark%20Elements%20on%20Array%20by%20Performing%20Queries/README_EN.md) +- [3081. Replace Question Marks in String to Minimize Its Value](/solution/3000-3099/3081.Replace%20Question%20Marks%20in%20String%20to%20Minimize%20Its%20Value/README_EN.md) +- [3082. Find the Sum of the Power of All Subsequences](/solution/3000-3099/3082.Find%20the%20Sum%20of%20the%20Power%20of%20All%20Subsequences/README_EN.md) + +#### Weekly Contest 388 + +- [3074. Apple Redistribution into Boxes](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README_EN.md) +- [3075. Maximize Happiness of Selected Children](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README_EN.md) +- [3076. Shortest Uncommon Substring in an Array](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README_EN.md) +- [3077. Maximum Strength of K Disjoint Subarrays](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README_EN.md) + +#### Weekly Contest 387 + +- [3069. Distribute Elements Into Two Arrays I](/solution/3000-3099/3069.Distribute%20Elements%20Into%20Two%20Arrays%20I/README_EN.md) +- [3070. Count Submatrices with Top-Left Element and Sum Less Than k](/solution/3000-3099/3070.Count%20Submatrices%20with%20Top-Left%20Element%20and%20Sum%20Less%20Than%20k/README_EN.md) +- [3071. Minimum Operations to Write the Letter Y on a Grid](/solution/3000-3099/3071.Minimum%20Operations%20to%20Write%20the%20Letter%20Y%20on%20a%20Grid/README_EN.md) +- [3072. Distribute Elements Into Two Arrays II](/solution/3000-3099/3072.Distribute%20Elements%20Into%20Two%20Arrays%20II/README_EN.md) + +#### Biweekly Contest 125 + +- [3065. Minimum Operations to Exceed Threshold Value I](/solution/3000-3099/3065.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20I/README_EN.md) +- [3066. Minimum Operations to Exceed Threshold Value II](/solution/3000-3099/3066.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20II/README_EN.md) +- [3067. Count Pairs of Connectable Servers in a Weighted Tree Network](/solution/3000-3099/3067.Count%20Pairs%20of%20Connectable%20Servers%20in%20a%20Weighted%20Tree%20Network/README_EN.md) +- [3068. Find the Maximum Sum of Node Values](/solution/3000-3099/3068.Find%20the%20Maximum%20Sum%20of%20Node%20Values/README_EN.md) + +#### Weekly Contest 386 + +- [3046. Split the Array](/solution/3000-3099/3046.Split%20the%20Array/README_EN.md) +- [3047. Find the Largest Area of Square Inside Two Rectangles](/solution/3000-3099/3047.Find%20the%20Largest%20Area%20of%20Square%20Inside%20Two%20Rectangles/README_EN.md) +- [3048. Earliest Second to Mark Indices I](/solution/3000-3099/3048.Earliest%20Second%20to%20Mark%20Indices%20I/README_EN.md) +- [3049. Earliest Second to Mark Indices II](/solution/3000-3099/3049.Earliest%20Second%20to%20Mark%20Indices%20II/README_EN.md) + +#### Weekly Contest 385 + +- [3042. Count Prefix and Suffix Pairs I](/solution/3000-3099/3042.Count%20Prefix%20and%20Suffix%20Pairs%20I/README_EN.md) +- [3043. Find the Length of the Longest Common Prefix](/solution/3000-3099/3043.Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/README_EN.md) +- [3044. Most Frequent Prime](/solution/3000-3099/3044.Most%20Frequent%20Prime/README_EN.md) +- [3045. Count Prefix and Suffix Pairs II](/solution/3000-3099/3045.Count%20Prefix%20and%20Suffix%20Pairs%20II/README_EN.md) + +#### Biweekly Contest 124 + +- [3038. Maximum Number of Operations With the Same Score I](/solution/3000-3099/3038.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20I/README_EN.md) +- [3039. Apply Operations to Make String Empty](/solution/3000-3099/3039.Apply%20Operations%20to%20Make%20String%20Empty/README_EN.md) +- [3040. Maximum Number of Operations With the Same Score II](/solution/3000-3099/3040.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20II/README_EN.md) +- [3041. Maximize Consecutive Elements in an Array After Modification](/solution/3000-3099/3041.Maximize%20Consecutive%20Elements%20in%20an%20Array%20After%20Modification/README_EN.md) + +#### Weekly Contest 384 + +- [3033. Modify the Matrix](/solution/3000-3099/3033.Modify%20the%20Matrix/README_EN.md) +- [3034. Number of Subarrays That Match a Pattern I](/solution/3000-3099/3034.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20I/README_EN.md) +- [3035. Maximum Palindromes After Operations](/solution/3000-3099/3035.Maximum%20Palindromes%20After%20Operations/README_EN.md) +- [3036. Number of Subarrays That Match a Pattern II](/solution/3000-3099/3036.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20II/README_EN.md) + +#### Weekly Contest 383 + +- [3028. Ant on the Boundary](/solution/3000-3099/3028.Ant%20on%20the%20Boundary/README_EN.md) +- [3029. Minimum Time to Revert Word to Initial State I](/solution/3000-3099/3029.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20I/README_EN.md) +- [3030. Find the Grid of Region Average](/solution/3000-3099/3030.Find%20the%20Grid%20of%20Region%20Average/README_EN.md) +- [3031. Minimum Time to Revert Word to Initial State II](/solution/3000-3099/3031.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20II/README_EN.md) + +#### Biweekly Contest 123 + +- [3024. Type of Triangle](/solution/3000-3099/3024.Type%20of%20Triangle/README_EN.md) +- [3025. Find the Number of Ways to Place People I](/solution/3000-3099/3025.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20I/README_EN.md) +- [3026. Maximum Good Subarray Sum](/solution/3000-3099/3026.Maximum%20Good%20Subarray%20Sum/README_EN.md) +- [3027. Find the Number of Ways to Place People II](/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/README_EN.md) + +#### Weekly Contest 382 + +- [3019. Number of Changing Keys](/solution/3000-3099/3019.Number%20of%20Changing%20Keys/README_EN.md) +- [3020. Find the Maximum Number of Elements in Subset](/solution/3000-3099/3020.Find%20the%20Maximum%20Number%20of%20Elements%20in%20Subset/README_EN.md) +- [3021. Alice and Bob Playing Flower Game](/solution/3000-3099/3021.Alice%20and%20Bob%20Playing%20Flower%20Game/README_EN.md) +- [3022. Minimize OR of Remaining Elements Using Operations](/solution/3000-3099/3022.Minimize%20OR%20of%20Remaining%20Elements%20Using%20Operations/README_EN.md) + +#### Weekly Contest 381 + +- [3014. Minimum Number of Pushes to Type Word I](/solution/3000-3099/3014.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20I/README_EN.md) +- [3015. Count the Number of Houses at a Certain Distance I](/solution/3000-3099/3015.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20I/README_EN.md) +- [3016. Minimum Number of Pushes to Type Word II](/solution/3000-3099/3016.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20II/README_EN.md) +- [3017. Count the Number of Houses at a Certain Distance II](/solution/3000-3099/3017.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20II/README_EN.md) + +#### Biweekly Contest 122 + +- [3010. Divide an Array Into Subarrays With Minimum Cost I](/solution/3000-3099/3010.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20I/README_EN.md) +- [3011. Find if Array Can Be Sorted](/solution/3000-3099/3011.Find%20if%20Array%20Can%20Be%20Sorted/README_EN.md) +- [3012. Minimize Length of Array Using Operations](/solution/3000-3099/3012.Minimize%20Length%20of%20Array%20Using%20Operations/README_EN.md) +- [3013. Divide an Array Into Subarrays With Minimum Cost II](/solution/3000-3099/3013.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20II/README_EN.md) + +#### Weekly Contest 380 + +- [3005. Count Elements With Maximum Frequency](/solution/3000-3099/3005.Count%20Elements%20With%20Maximum%20Frequency/README_EN.md) +- [3006. Find Beautiful Indices in the Given Array I](/solution/3000-3099/3006.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I/README_EN.md) +- [3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K](/solution/3000-3099/3007.Maximum%20Number%20That%20Sum%20of%20the%20Prices%20Is%20Less%20Than%20or%20Equal%20to%20K/README_EN.md) +- [3008. Find Beautiful Indices in the Given Array II](/solution/3000-3099/3008.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20II/README_EN.md) + +#### Weekly Contest 379 + +- [3000. Maximum Area of Longest Diagonal Rectangle](/solution/3000-3099/3000.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README_EN.md) +- [3001. Minimum Moves to Capture The Queen](/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/README_EN.md) +- [3002. Maximum Size of a Set After Removals](/solution/3000-3099/3002.Maximum%20Size%20of%20a%20Set%20After%20Removals/README_EN.md) +- [3003. Maximize the Number of Partitions After Operations](/solution/3000-3099/3003.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README_EN.md) + +#### Biweekly Contest 121 + +- [2996. Smallest Missing Integer Greater Than Sequential Prefix Sum](/solution/2900-2999/2996.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README_EN.md) +- [2997. Minimum Number of Operations to Make Array XOR Equal to K](/solution/2900-2999/2997.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README_EN.md) +- [2998. Minimum Number of Operations to Make X and Y Equal](/solution/2900-2999/2998.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README_EN.md) +- [2999. Count the Number of Powerful Integers](/solution/2900-2999/2999.Count%20the%20Number%20of%20Powerful%20Integers/README_EN.md) + +#### Weekly Contest 378 + +- [2980. Check if Bitwise OR Has Trailing Zeros](/solution/2900-2999/2980.Check%20if%20Bitwise%20OR%20Has%20Trailing%20Zeros/README_EN.md) +- [2981. Find Longest Special Substring That Occurs Thrice I](/solution/2900-2999/2981.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20I/README_EN.md) +- [2982. Find Longest Special Substring That Occurs Thrice II](/solution/2900-2999/2982.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20II/README_EN.md) +- [2983. Palindrome Rearrangement Queries](/solution/2900-2999/2983.Palindrome%20Rearrangement%20Queries/README_EN.md) + +#### Weekly Contest 377 + +- [2974. Minimum Number Game](/solution/2900-2999/2974.Minimum%20Number%20Game/README_EN.md) +- [2975. Maximum Square Area by Removing Fences From a Field](/solution/2900-2999/2975.Maximum%20Square%20Area%20by%20Removing%20Fences%20From%20a%20Field/README_EN.md) +- [2976. Minimum Cost to Convert String I](/solution/2900-2999/2976.Minimum%20Cost%20to%20Convert%20String%20I/README_EN.md) +- [2977. Minimum Cost to Convert String II](/solution/2900-2999/2977.Minimum%20Cost%20to%20Convert%20String%20II/README_EN.md) + +#### Biweekly Contest 120 + +- [2970. Count the Number of Incremovable Subarrays I](/solution/2900-2999/2970.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README_EN.md) +- [2971. Find Polygon With the Largest Perimeter](/solution/2900-2999/2971.Find%20Polygon%20With%20the%20Largest%20Perimeter/README_EN.md) +- [2972. Count the Number of Incremovable Subarrays II](/solution/2900-2999/2972.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README_EN.md) +- [2973. Find Number of Coins to Place in Tree Nodes](/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README_EN.md) + +#### Weekly Contest 376 + +- [2965. Find Missing and Repeated Values](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README_EN.md) +- [2966. Divide Array Into Arrays With Max Difference](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README_EN.md) +- [2967. Minimum Cost to Make Array Equalindromic](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README_EN.md) +- [2968. Apply Operations to Maximize Frequency Score](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README_EN.md) + +#### Weekly Contest 375 + +- [2960. Count Tested Devices After Test Operations](/solution/2900-2999/2960.Count%20Tested%20Devices%20After%20Test%20Operations/README_EN.md) +- [2961. Double Modular Exponentiation](/solution/2900-2999/2961.Double%20Modular%20Exponentiation/README_EN.md) +- [2962. Count Subarrays Where Max Element Appears at Least K Times](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README_EN.md) +- [2963. Count the Number of Good Partitions](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README_EN.md) + +#### Biweekly Contest 119 + +- [2956. Find Common Elements Between Two Arrays](/solution/2900-2999/2956.Find%20Common%20Elements%20Between%20Two%20Arrays/README_EN.md) +- [2957. Remove Adjacent Almost-Equal Characters](/solution/2900-2999/2957.Remove%20Adjacent%20Almost-Equal%20Characters/README_EN.md) +- [2958. Length of Longest Subarray With at Most K Frequency](/solution/2900-2999/2958.Length%20of%20Longest%20Subarray%20With%20at%20Most%20K%20Frequency/README_EN.md) +- [2959. Number of Possible Sets of Closing Branches](/solution/2900-2999/2959.Number%20of%20Possible%20Sets%20of%20Closing%20Branches/README_EN.md) + +#### Weekly Contest 374 + +- [2951. Find the Peaks](/solution/2900-2999/2951.Find%20the%20Peaks/README_EN.md) +- [2952. Minimum Number of Coins to be Added](/solution/2900-2999/2952.Minimum%20Number%20of%20Coins%20to%20be%20Added/README_EN.md) +- [2953. Count Complete Substrings](/solution/2900-2999/2953.Count%20Complete%20Substrings/README_EN.md) +- [2954. Count the Number of Infection Sequences](/solution/2900-2999/2954.Count%20the%20Number%20of%20Infection%20Sequences/README_EN.md) + +#### Weekly Contest 373 + +- [2946. Matrix Similarity After Cyclic Shifts](/solution/2900-2999/2946.Matrix%20Similarity%20After%20Cyclic%20Shifts/README_EN.md) +- [2947. Count Beautiful Substrings I](/solution/2900-2999/2947.Count%20Beautiful%20Substrings%20I/README_EN.md) +- [2948. Make Lexicographically Smallest Array by Swapping Elements](/solution/2900-2999/2948.Make%20Lexicographically%20Smallest%20Array%20by%20Swapping%20Elements/README_EN.md) +- [2949. Count Beautiful Substrings II](/solution/2900-2999/2949.Count%20Beautiful%20Substrings%20II/README_EN.md) + +#### Biweekly Contest 118 + +- [2942. Find Words Containing Character](/solution/2900-2999/2942.Find%20Words%20Containing%20Character/README_EN.md) +- [2943. Maximize Area of Square Hole in Grid](/solution/2900-2999/2943.Maximize%20Area%20of%20Square%20Hole%20in%20Grid/README_EN.md) +- [2944. Minimum Number of Coins for Fruits](/solution/2900-2999/2944.Minimum%20Number%20of%20Coins%20for%20Fruits/README_EN.md) +- [2945. Find Maximum Non-decreasing Array Length](/solution/2900-2999/2945.Find%20Maximum%20Non-decreasing%20Array%20Length/README_EN.md) + +#### Weekly Contest 372 + +- [2937. Make Three Strings Equal](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README_EN.md) +- [2938. Separate Black and White Balls](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README_EN.md) +- [2939. Maximum Xor Product](/solution/2900-2999/2939.Maximum%20Xor%20Product/README_EN.md) +- [2940. Find Building Where Alice and Bob Can Meet](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README_EN.md) + +#### Weekly Contest 371 + +- [2932. Maximum Strong Pair XOR I](/solution/2900-2999/2932.Maximum%20Strong%20Pair%20XOR%20I/README_EN.md) +- [2933. High-Access Employees](/solution/2900-2999/2933.High-Access%20Employees/README_EN.md) +- [2934. Minimum Operations to Maximize Last Elements in Arrays](/solution/2900-2999/2934.Minimum%20Operations%20to%20Maximize%20Last%20Elements%20in%20Arrays/README_EN.md) +- [2935. Maximum Strong Pair XOR II](/solution/2900-2999/2935.Maximum%20Strong%20Pair%20XOR%20II/README_EN.md) + +#### Biweekly Contest 117 + +- [2928. Distribute Candies Among Children I](/solution/2900-2999/2928.Distribute%20Candies%20Among%20Children%20I/README_EN.md) +- [2929. Distribute Candies Among Children II](/solution/2900-2999/2929.Distribute%20Candies%20Among%20Children%20II/README_EN.md) +- [2930. Number of Strings Which Can Be Rearranged to Contain Substring](/solution/2900-2999/2930.Number%20of%20Strings%20Which%20Can%20Be%20Rearranged%20to%20Contain%20Substring/README_EN.md) +- [2931. Maximum Spending After Buying Items](/solution/2900-2999/2931.Maximum%20Spending%20After%20Buying%20Items/README_EN.md) + +#### Weekly Contest 370 + +- [2923. Find Champion I](/solution/2900-2999/2923.Find%20Champion%20I/README_EN.md) +- [2924. Find Champion II](/solution/2900-2999/2924.Find%20Champion%20II/README_EN.md) +- [2925. Maximum Score After Applying Operations on a Tree](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README_EN.md) +- [2926. Maximum Balanced Subsequence Sum](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README_EN.md) + +#### Weekly Contest 369 + +- [2917. Find the K-or of an Array](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README_EN.md) +- [2918. Minimum Equal Sum of Two Arrays After Replacing Zeros](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README_EN.md) +- [2919. Minimum Increment Operations to Make Array Beautiful](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README_EN.md) +- [2920. Maximum Points After Collecting Coins From All Nodes](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README_EN.md) + +#### Biweekly Contest 116 + +- [2913. Subarrays Distinct Element Sum of Squares I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README_EN.md) +- [2914. Minimum Number of Changes to Make Binary String Beautiful](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README_EN.md) +- [2915. Length of the Longest Subsequence That Sums to Target](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README_EN.md) +- [2916. Subarrays Distinct Element Sum of Squares II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README_EN.md) + +#### Weekly Contest 368 + +- [2908. Minimum Sum of Mountain Triplets I](/solution/2900-2999/2908.Minimum%20Sum%20of%20Mountain%20Triplets%20I/README_EN.md) +- [2909. Minimum Sum of Mountain Triplets II](/solution/2900-2999/2909.Minimum%20Sum%20of%20Mountain%20Triplets%20II/README_EN.md) +- [2910. Minimum Number of Groups to Create a Valid Assignment](/solution/2900-2999/2910.Minimum%20Number%20of%20Groups%20to%20Create%20a%20Valid%20Assignment/README_EN.md) +- [2911. Minimum Changes to Make K Semi-palindromes](/solution/2900-2999/2911.Minimum%20Changes%20to%20Make%20K%20Semi-palindromes/README_EN.md) + +#### Weekly Contest 367 + +- [2903. Find Indices With Index and Value Difference I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README_EN.md) +- [2904. Shortest and Lexicographically Smallest Beautiful String](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) +- [2905. Find Indices With Index and Value Difference II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README_EN.md) +- [2906. Construct Product Matrix](/solution/2900-2999/2906.Construct%20Product%20Matrix/README_EN.md) + +#### Biweekly Contest 115 + +- [2899. Last Visited Integers](/solution/2800-2899/2899.Last%20Visited%20Integers/README_EN.md) +- [2900. Longest Unequal Adjacent Groups Subsequence I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README_EN.md) +- [2901. Longest Unequal Adjacent Groups Subsequence II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README_EN.md) +- [2902. Count of Sub-Multisets With Bounded Sum](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README_EN.md) + +#### Weekly Contest 366 + +- [2894. Divisible and Non-divisible Sums Difference](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README_EN.md) +- [2895. Minimum Processing Time](/solution/2800-2899/2895.Minimum%20Processing%20Time/README_EN.md) +- [2896. Apply Operations to Make Two Strings Equal](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README_EN.md) +- [2897. Apply Operations on Array to Maximize Sum of Squares](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README_EN.md) + +#### Weekly Contest 365 + +- [2873. Maximum Value of an Ordered Triplet I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README_EN.md) +- [2874. Maximum Value of an Ordered Triplet II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README_EN.md) +- [2875. Minimum Size Subarray in Infinite Array](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README_EN.md) +- [2876. Count Visited Nodes in a Directed Graph](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README_EN.md) + +#### Biweekly Contest 114 + +- [2869. Minimum Operations to Collect Elements](/solution/2800-2899/2869.Minimum%20Operations%20to%20Collect%20Elements/README_EN.md) +- [2870. Minimum Number of Operations to Make Array Empty](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README_EN.md) +- [2871. Split Array Into Maximum Number of Subarrays](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README_EN.md) +- [2872. Maximum Number of K-Divisible Components](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README_EN.md) + +#### Weekly Contest 364 + +- [2864. Maximum Odd Binary Number](/solution/2800-2899/2864.Maximum%20Odd%20Binary%20Number/README_EN.md) +- [2865. Beautiful Towers I](/solution/2800-2899/2865.Beautiful%20Towers%20I/README_EN.md) +- [2866. Beautiful Towers II](/solution/2800-2899/2866.Beautiful%20Towers%20II/README_EN.md) +- [2867. Count Valid Paths in a Tree](/solution/2800-2899/2867.Count%20Valid%20Paths%20in%20a%20Tree/README_EN.md) + +#### Weekly Contest 363 + +- [2859. Sum of Values at Indices With K Set Bits](/solution/2800-2899/2859.Sum%20of%20Values%20at%20Indices%20With%20K%20Set%20Bits/README_EN.md) +- [2860. Happy Students](/solution/2800-2899/2860.Happy%20Students/README_EN.md) +- [2861. Maximum Number of Alloys](/solution/2800-2899/2861.Maximum%20Number%20of%20Alloys/README_EN.md) +- [2862. Maximum Element-Sum of a Complete Subset of Indices](/solution/2800-2899/2862.Maximum%20Element-Sum%20of%20a%20Complete%20Subset%20of%20Indices/README_EN.md) + +#### Biweekly Contest 113 + +- [2855. Minimum Right Shifts to Sort the Array](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README_EN.md) +- [2856. Minimum Array Length After Pair Removals](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README_EN.md) +- [2857. Count Pairs of Points With Distance k](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README_EN.md) +- [2858. Minimum Edge Reversals So Every Node Is Reachable](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README_EN.md) + +#### Weekly Contest 362 + +- [2848. Points That Intersect With Cars](/solution/2800-2899/2848.Points%20That%20Intersect%20With%20Cars/README_EN.md) +- [2849. Determine if a Cell Is Reachable at a Given Time](/solution/2800-2899/2849.Determine%20if%20a%20Cell%20Is%20Reachable%20at%20a%20Given%20Time/README_EN.md) +- [2850. Minimum Moves to Spread Stones Over Grid](/solution/2800-2899/2850.Minimum%20Moves%20to%20Spread%20Stones%20Over%20Grid/README_EN.md) +- [2851. String Transformation](/solution/2800-2899/2851.String%20Transformation/README_EN.md) + +#### Weekly Contest 361 + +- [2843. Count Symmetric Integers](/solution/2800-2899/2843.Count%20Symmetric%20Integers/README_EN.md) +- [2844. Minimum Operations to Make a Special Number](/solution/2800-2899/2844.Minimum%20Operations%20to%20Make%20a%20Special%20Number/README_EN.md) +- [2845. Count of Interesting Subarrays](/solution/2800-2899/2845.Count%20of%20Interesting%20Subarrays/README_EN.md) +- [2846. Minimum Edge Weight Equilibrium Queries in a Tree](/solution/2800-2899/2846.Minimum%20Edge%20Weight%20Equilibrium%20Queries%20in%20a%20Tree/README_EN.md) + +#### Biweekly Contest 112 + +- [2839. Check if Strings Can be Made Equal With Operations I](/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README_EN.md) +- [2840. Check if Strings Can be Made Equal With Operations II](/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README_EN.md) +- [2841. Maximum Sum of Almost Unique Subarray](/solution/2800-2899/2841.Maximum%20Sum%20of%20Almost%20Unique%20Subarray/README_EN.md) +- [2842. Count K-Subsequences of a String With Maximum Beauty](/solution/2800-2899/2842.Count%20K-Subsequences%20of%20a%20String%20With%20Maximum%20Beauty/README_EN.md) + +#### Weekly Contest 360 + +- [2833. Furthest Point From Origin](/solution/2800-2899/2833.Furthest%20Point%20From%20Origin/README_EN.md) +- [2834. Find the Minimum Possible Sum of a Beautiful Array](/solution/2800-2899/2834.Find%20the%20Minimum%20Possible%20Sum%20of%20a%20Beautiful%20Array/README_EN.md) +- [2835. Minimum Operations to Form Subsequence With Target Sum](/solution/2800-2899/2835.Minimum%20Operations%20to%20Form%20Subsequence%20With%20Target%20Sum/README_EN.md) +- [2836. Maximize Value of Function in a Ball Passing Game](/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README_EN.md) + +#### Weekly Contest 359 + +- [2828. Check if a String Is an Acronym of Words](/solution/2800-2899/2828.Check%20if%20a%20String%20Is%20an%20Acronym%20of%20Words/README_EN.md) +- [2829. Determine the Minimum Sum of a k-avoiding Array](/solution/2800-2899/2829.Determine%20the%20Minimum%20Sum%20of%20a%20k-avoiding%20Array/README_EN.md) +- [2830. Maximize the Profit as the Salesman](/solution/2800-2899/2830.Maximize%20the%20Profit%20as%20the%20Salesman/README_EN.md) +- [2831. Find the Longest Equal Subarray](/solution/2800-2899/2831.Find%20the%20Longest%20Equal%20Subarray/README_EN.md) + +#### Biweekly Contest 111 + +- [2824. Count Pairs Whose Sum is Less than Target](/solution/2800-2899/2824.Count%20Pairs%20Whose%20Sum%20is%20Less%20than%20Target/README_EN.md) +- [2825. Make String a Subsequence Using Cyclic Increments](/solution/2800-2899/2825.Make%20String%20a%20Subsequence%20Using%20Cyclic%20Increments/README_EN.md) +- [2826. Sorting Three Groups](/solution/2800-2899/2826.Sorting%20Three%20Groups/README_EN.md) +- [2827. Number of Beautiful Integers in the Range](/solution/2800-2899/2827.Number%20of%20Beautiful%20Integers%20in%20the%20Range/README_EN.md) + +#### Weekly Contest 358 + +- [2815. Max Pair Sum in an Array](/solution/2800-2899/2815.Max%20Pair%20Sum%20in%20an%20Array/README_EN.md) +- [2816. Double a Number Represented as a Linked List](/solution/2800-2899/2816.Double%20a%20Number%20Represented%20as%20a%20Linked%20List/README_EN.md) +- [2817. Minimum Absolute Difference Between Elements With Constraint](/solution/2800-2899/2817.Minimum%20Absolute%20Difference%20Between%20Elements%20With%20Constraint/README_EN.md) +- [2818. Apply Operations to Maximize Score](/solution/2800-2899/2818.Apply%20Operations%20to%20Maximize%20Score/README_EN.md) + +#### Weekly Contest 357 + +- [2810. Faulty Keyboard](/solution/2800-2899/2810.Faulty%20Keyboard/README_EN.md) +- [2811. Check if it is Possible to Split Array](/solution/2800-2899/2811.Check%20if%20it%20is%20Possible%20to%20Split%20Array/README_EN.md) +- [2812. Find the Safest Path in a Grid](/solution/2800-2899/2812.Find%20the%20Safest%20Path%20in%20a%20Grid/README_EN.md) +- [2813. Maximum Elegance of a K-Length Subsequence](/solution/2800-2899/2813.Maximum%20Elegance%20of%20a%20K-Length%20Subsequence/README_EN.md) + +#### Biweekly Contest 110 + +- [2806. Account Balance After Rounded Purchase](/solution/2800-2899/2806.Account%20Balance%20After%20Rounded%20Purchase/README_EN.md) +- [2807. Insert Greatest Common Divisors in Linked List](/solution/2800-2899/2807.Insert%20Greatest%20Common%20Divisors%20in%20Linked%20List/README_EN.md) +- [2808. Minimum Seconds to Equalize a Circular Array](/solution/2800-2899/2808.Minimum%20Seconds%20to%20Equalize%20a%20Circular%20Array/README_EN.md) +- [2809. Minimum Time to Make Array Sum At Most x](/solution/2800-2899/2809.Minimum%20Time%20to%20Make%20Array%20Sum%20At%20Most%20x/README_EN.md) + +#### Weekly Contest 356 + +- [2798. Number of Employees Who Met the Target](/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README_EN.md) +- [2799. Count Complete Subarrays in an Array](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README_EN.md) +- [2800. Shortest String That Contains Three Strings](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README_EN.md) +- [2801. Count Stepping Numbers in Range](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README_EN.md) + +#### Weekly Contest 355 + +- [2788. Split Strings by Separator](/solution/2700-2799/2788.Split%20Strings%20by%20Separator/README_EN.md) +- [2789. Largest Element in an Array after Merge Operations](/solution/2700-2799/2789.Largest%20Element%20in%20an%20Array%20after%20Merge%20Operations/README_EN.md) +- [2790. Maximum Number of Groups With Increasing Length](/solution/2700-2799/2790.Maximum%20Number%20of%20Groups%20With%20Increasing%20Length/README_EN.md) +- [2791. Count Paths That Can Form a Palindrome in a Tree](/solution/2700-2799/2791.Count%20Paths%20That%20Can%20Form%20a%20Palindrome%20in%20a%20Tree/README_EN.md) + +#### Biweekly Contest 109 + +- [2784. Check if Array is Good](/solution/2700-2799/2784.Check%20if%20Array%20is%20Good/README_EN.md) +- [2785. Sort Vowels in a String](/solution/2700-2799/2785.Sort%20Vowels%20in%20a%20String/README_EN.md) +- [2786. Visit Array Positions to Maximize Score](/solution/2700-2799/2786.Visit%20Array%20Positions%20to%20Maximize%20Score/README_EN.md) +- [2787. Ways to Express an Integer as Sum of Powers](/solution/2700-2799/2787.Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers/README_EN.md) + +#### Weekly Contest 354 + +- [2778. Sum of Squares of Special Elements](/solution/2700-2799/2778.Sum%20of%20Squares%20of%20Special%20Elements/README_EN.md) +- [2779. Maximum Beauty of an Array After Applying Operation](/solution/2700-2799/2779.Maximum%20Beauty%20of%20an%20Array%20After%20Applying%20Operation/README_EN.md) +- [2780. Minimum Index of a Valid Split](/solution/2700-2799/2780.Minimum%20Index%20of%20a%20Valid%20Split/README_EN.md) +- [2781. Length of the Longest Valid Substring](/solution/2700-2799/2781.Length%20of%20the%20Longest%20Valid%20Substring/README_EN.md) + +#### Weekly Contest 353 + +- [2769. Find the Maximum Achievable Number](/solution/2700-2799/2769.Find%20the%20Maximum%20Achievable%20Number/README_EN.md) +- [2770. Maximum Number of Jumps to Reach the Last Index](/solution/2700-2799/2770.Maximum%20Number%20of%20Jumps%20to%20Reach%20the%20Last%20Index/README_EN.md) +- [2771. Longest Non-decreasing Subarray From Two Arrays](/solution/2700-2799/2771.Longest%20Non-decreasing%20Subarray%20From%20Two%20Arrays/README_EN.md) +- [2772. Apply Operations to Make All Array Elements Equal to Zero](/solution/2700-2799/2772.Apply%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%20Zero/README_EN.md) + +#### Biweekly Contest 108 + +- [2765. Longest Alternating Subarray](/solution/2700-2799/2765.Longest%20Alternating%20Subarray/README_EN.md) +- [2766. Relocate Marbles](/solution/2700-2799/2766.Relocate%20Marbles/README_EN.md) +- [2767. Partition String Into Minimum Beautiful Substrings](/solution/2700-2799/2767.Partition%20String%20Into%20Minimum%20Beautiful%20Substrings/README_EN.md) +- [2768. Number of Black Blocks](/solution/2700-2799/2768.Number%20of%20Black%20Blocks/README_EN.md) + +#### Weekly Contest 352 + +- [2760. Longest Even Odd Subarray With Threshold](/solution/2700-2799/2760.Longest%20Even%20Odd%20Subarray%20With%20Threshold/README_EN.md) +- [2761. Prime Pairs With Target Sum](/solution/2700-2799/2761.Prime%20Pairs%20With%20Target%20Sum/README_EN.md) +- [2762. Continuous Subarrays](/solution/2700-2799/2762.Continuous%20Subarrays/README_EN.md) +- [2763. Sum of Imbalance Numbers of All Subarrays](/solution/2700-2799/2763.Sum%20of%20Imbalance%20Numbers%20of%20All%20Subarrays/README_EN.md) + +#### Weekly Contest 351 + +- [2748. Number of Beautiful Pairs](/solution/2700-2799/2748.Number%20of%20Beautiful%20Pairs/README_EN.md) +- [2749. Minimum Operations to Make the Integer Zero](/solution/2700-2799/2749.Minimum%20Operations%20to%20Make%20the%20Integer%20Zero/README_EN.md) +- [2750. Ways to Split Array Into Good Subarrays](/solution/2700-2799/2750.Ways%20to%20Split%20Array%20Into%20Good%20Subarrays/README_EN.md) +- [2751. Robot Collisions](/solution/2700-2799/2751.Robot%20Collisions/README_EN.md) + +#### Biweekly Contest 107 + +- [2744. Find Maximum Number of String Pairs](/solution/2700-2799/2744.Find%20Maximum%20Number%20of%20String%20Pairs/README_EN.md) +- [2745. Construct the Longest New String](/solution/2700-2799/2745.Construct%20the%20Longest%20New%20String/README_EN.md) +- [2746. Decremental String Concatenation](/solution/2700-2799/2746.Decremental%20String%20Concatenation/README_EN.md) +- [2747. Count Zero Request Servers](/solution/2700-2799/2747.Count%20Zero%20Request%20Servers/README_EN.md) + +#### Weekly Contest 350 + +- [2739. Total Distance Traveled](/solution/2700-2799/2739.Total%20Distance%20Traveled/README_EN.md) +- [2740. Find the Value of the Partition](/solution/2700-2799/2740.Find%20the%20Value%20of%20the%20Partition/README_EN.md) +- [2741. Special Permutations](/solution/2700-2799/2741.Special%20Permutations/README_EN.md) +- [2742. Painting the Walls](/solution/2700-2799/2742.Painting%20the%20Walls/README_EN.md) + +#### Weekly Contest 349 + +- [2733. Neither Minimum nor Maximum](/solution/2700-2799/2733.Neither%20Minimum%20nor%20Maximum/README_EN.md) +- [2734. Lexicographically Smallest String After Substring Operation](/solution/2700-2799/2734.Lexicographically%20Smallest%20String%20After%20Substring%20Operation/README_EN.md) +- [2735. Collecting Chocolates](/solution/2700-2799/2735.Collecting%20Chocolates/README_EN.md) +- [2736. Maximum Sum Queries](/solution/2700-2799/2736.Maximum%20Sum%20Queries/README_EN.md) + +#### Biweekly Contest 106 + +- [2729. Check if The Number is Fascinating](/solution/2700-2799/2729.Check%20if%20The%20Number%20is%20Fascinating/README_EN.md) +- [2730. Find the Longest Semi-Repetitive Substring](/solution/2700-2799/2730.Find%20the%20Longest%20Semi-Repetitive%20Substring/README_EN.md) +- [2731. Movement of Robots](/solution/2700-2799/2731.Movement%20of%20Robots/README_EN.md) +- [2732. Find a Good Subset of the Matrix](/solution/2700-2799/2732.Find%20a%20Good%20Subset%20of%20the%20Matrix/README_EN.md) + +#### Weekly Contest 348 + +- [2716. Minimize String Length](/solution/2700-2799/2716.Minimize%20String%20Length/README_EN.md) +- [2717. Semi-Ordered Permutation](/solution/2700-2799/2717.Semi-Ordered%20Permutation/README_EN.md) +- [2718. Sum of Matrix After Queries](/solution/2700-2799/2718.Sum%20of%20Matrix%20After%20Queries/README_EN.md) +- [2719. Count of Integers](/solution/2700-2799/2719.Count%20of%20Integers/README_EN.md) + +#### Weekly Contest 347 + +- [2710. Remove Trailing Zeros From a String](/solution/2700-2799/2710.Remove%20Trailing%20Zeros%20From%20a%20String/README_EN.md) +- [2711. Difference of Number of Distinct Values on Diagonals](/solution/2700-2799/2711.Difference%20of%20Number%20of%20Distinct%20Values%20on%20Diagonals/README_EN.md) +- [2712. Minimum Cost to Make All Characters Equal](/solution/2700-2799/2712.Minimum%20Cost%20to%20Make%20All%20Characters%20Equal/README_EN.md) +- [2713. Maximum Strictly Increasing Cells in a Matrix](/solution/2700-2799/2713.Maximum%20Strictly%20Increasing%20Cells%20in%20a%20Matrix/README_EN.md) + +#### Biweekly Contest 105 + +- [2706. Buy Two Chocolates](/solution/2700-2799/2706.Buy%20Two%20Chocolates/README_EN.md) +- [2707. Extra Characters in a String](/solution/2700-2799/2707.Extra%20Characters%20in%20a%20String/README_EN.md) +- [2708. Maximum Strength of a Group](/solution/2700-2799/2708.Maximum%20Strength%20of%20a%20Group/README_EN.md) +- [2709. Greatest Common Divisor Traversal](/solution/2700-2799/2709.Greatest%20Common%20Divisor%20Traversal/README_EN.md) + +#### Weekly Contest 346 + +- [2696. Minimum String Length After Removing Substrings](/solution/2600-2699/2696.Minimum%20String%20Length%20After%20Removing%20Substrings/README_EN.md) +- [2697. Lexicographically Smallest Palindrome](/solution/2600-2699/2697.Lexicographically%20Smallest%20Palindrome/README_EN.md) +- [2698. Find the Punishment Number of an Integer](/solution/2600-2699/2698.Find%20the%20Punishment%20Number%20of%20an%20Integer/README_EN.md) +- [2699. Modify Graph Edge Weights](/solution/2600-2699/2699.Modify%20Graph%20Edge%20Weights/README_EN.md) + +#### Weekly Contest 345 + +- [2682. Find the Losers of the Circular Game](/solution/2600-2699/2682.Find%20the%20Losers%20of%20the%20Circular%20Game/README_EN.md) +- [2683. Neighboring Bitwise XOR](/solution/2600-2699/2683.Neighboring%20Bitwise%20XOR/README_EN.md) +- [2684. Maximum Number of Moves in a Grid](/solution/2600-2699/2684.Maximum%20Number%20of%20Moves%20in%20a%20Grid/README_EN.md) +- [2685. Count the Number of Complete Components](/solution/2600-2699/2685.Count%20the%20Number%20of%20Complete%20Components/README_EN.md) + +#### Biweekly Contest 104 + +- [2678. Number of Senior Citizens](/solution/2600-2699/2678.Number%20of%20Senior%20Citizens/README_EN.md) +- [2679. Sum in a Matrix](/solution/2600-2699/2679.Sum%20in%20a%20Matrix/README_EN.md) +- [2680. Maximum OR](/solution/2600-2699/2680.Maximum%20OR/README_EN.md) +- [2681. Power of Heroes](/solution/2600-2699/2681.Power%20of%20Heroes/README_EN.md) + +#### Weekly Contest 344 + +- [2670. Find the Distinct Difference Array](/solution/2600-2699/2670.Find%20the%20Distinct%20Difference%20Array/README_EN.md) +- [2671. Frequency Tracker](/solution/2600-2699/2671.Frequency%20Tracker/README_EN.md) +- [2672. Number of Adjacent Elements With the Same Color](/solution/2600-2699/2672.Number%20of%20Adjacent%20Elements%20With%20the%20Same%20Color/README_EN.md) +- [2673. Make Costs of Paths Equal in a Binary Tree](/solution/2600-2699/2673.Make%20Costs%20of%20Paths%20Equal%20in%20a%20Binary%20Tree/README_EN.md) + +#### Weekly Contest 343 + +- [2660. Determine the Winner of a Bowling Game](/solution/2600-2699/2660.Determine%20the%20Winner%20of%20a%20Bowling%20Game/README_EN.md) +- [2661. First Completely Painted Row or Column](/solution/2600-2699/2661.First%20Completely%20Painted%20Row%20or%20Column/README_EN.md) +- [2662. Minimum Cost of a Path With Special Roads](/solution/2600-2699/2662.Minimum%20Cost%20of%20a%20Path%20With%20Special%20Roads/README_EN.md) +- [2663. Lexicographically Smallest Beautiful String](/solution/2600-2699/2663.Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) + +#### Biweekly Contest 103 + +- [2656. Maximum Sum With Exactly K Elements](/solution/2600-2699/2656.Maximum%20Sum%20With%20Exactly%20K%20Elements/README_EN.md) +- [2657. Find the Prefix Common Array of Two Arrays](/solution/2600-2699/2657.Find%20the%20Prefix%20Common%20Array%20of%20Two%20Arrays/README_EN.md) +- [2658. Maximum Number of Fish in a Grid](/solution/2600-2699/2658.Maximum%20Number%20of%20Fish%20in%20a%20Grid/README_EN.md) +- [2659. Make Array Empty](/solution/2600-2699/2659.Make%20Array%20Empty/README_EN.md) + +#### Weekly Contest 342 + +- [2651. Calculate Delayed Arrival Time](/solution/2600-2699/2651.Calculate%20Delayed%20Arrival%20Time/README_EN.md) +- [2652. Sum Multiples](/solution/2600-2699/2652.Sum%20Multiples/README_EN.md) +- [2653. Sliding Subarray Beauty](/solution/2600-2699/2653.Sliding%20Subarray%20Beauty/README_EN.md) +- [2654. Minimum Number of Operations to Make All Array Elements Equal to 1](/solution/2600-2699/2654.Minimum%20Number%20of%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%201/README_EN.md) + +#### Weekly Contest 341 + +- [2643. Row With Maximum Ones](/solution/2600-2699/2643.Row%20With%20Maximum%20Ones/README_EN.md) +- [2644. Find the Maximum Divisibility Score](/solution/2600-2699/2644.Find%20the%20Maximum%20Divisibility%20Score/README_EN.md) +- [2645. Minimum Additions to Make Valid String](/solution/2600-2699/2645.Minimum%20Additions%20to%20Make%20Valid%20String/README_EN.md) +- [2646. Minimize the Total Price of the Trips](/solution/2600-2699/2646.Minimize%20the%20Total%20Price%20of%20the%20Trips/README_EN.md) + +#### Biweekly Contest 102 + +- [2639. Find the Width of Columns of a Grid](/solution/2600-2699/2639.Find%20the%20Width%20of%20Columns%20of%20a%20Grid/README_EN.md) +- [2640. Find the Score of All Prefixes of an Array](/solution/2600-2699/2640.Find%20the%20Score%20of%20All%20Prefixes%20of%20an%20Array/README_EN.md) +- [2641. Cousins in Binary Tree II](/solution/2600-2699/2641.Cousins%20in%20Binary%20Tree%20II/README_EN.md) +- [2642. Design Graph With Shortest Path Calculator](/solution/2600-2699/2642.Design%20Graph%20With%20Shortest%20Path%20Calculator/README_EN.md) + +#### Weekly Contest 340 + +- [2614. Prime In Diagonal](/solution/2600-2699/2614.Prime%20In%20Diagonal/README_EN.md) +- [2615. Sum of Distances](/solution/2600-2699/2615.Sum%20of%20Distances/README_EN.md) +- [2616. Minimize the Maximum Difference of Pairs](/solution/2600-2699/2616.Minimize%20the%20Maximum%20Difference%20of%20Pairs/README_EN.md) +- [2617. Minimum Number of Visited Cells in a Grid](/solution/2600-2699/2617.Minimum%20Number%20of%20Visited%20Cells%20in%20a%20Grid/README_EN.md) + +#### Weekly Contest 339 + +- [2609. Find the Longest Balanced Substring of a Binary String](/solution/2600-2699/2609.Find%20the%20Longest%20Balanced%20Substring%20of%20a%20Binary%20String/README_EN.md) +- [2610. Convert an Array Into a 2D Array With Conditions](/solution/2600-2699/2610.Convert%20an%20Array%20Into%20a%202D%20Array%20With%20Conditions/README_EN.md) +- [2611. Mice and Cheese](/solution/2600-2699/2611.Mice%20and%20Cheese/README_EN.md) +- [2612. Minimum Reverse Operations](/solution/2600-2699/2612.Minimum%20Reverse%20Operations/README_EN.md) + +#### Biweekly Contest 101 + +- [2605. Form Smallest Number From Two Digit Arrays](/solution/2600-2699/2605.Form%20Smallest%20Number%20From%20Two%20Digit%20Arrays/README_EN.md) +- [2606. Find the Substring With Maximum Cost](/solution/2600-2699/2606.Find%20the%20Substring%20With%20Maximum%20Cost/README_EN.md) +- [2607. Make K-Subarray Sums Equal](/solution/2600-2699/2607.Make%20K-Subarray%20Sums%20Equal/README_EN.md) +- [2608. Shortest Cycle in a Graph](/solution/2600-2699/2608.Shortest%20Cycle%20in%20a%20Graph/README_EN.md) + +#### Weekly Contest 338 + +- [2600. K Items With the Maximum Sum](/solution/2600-2699/2600.K%20Items%20With%20the%20Maximum%20Sum/README_EN.md) +- [2601. Prime Subtraction Operation](/solution/2600-2699/2601.Prime%20Subtraction%20Operation/README_EN.md) +- [2602. Minimum Operations to Make All Array Elements Equal](/solution/2600-2699/2602.Minimum%20Operations%20to%20Make%20All%20Array%20Elements%20Equal/README_EN.md) +- [2603. Collect Coins in a Tree](/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README_EN.md) + +#### Weekly Contest 337 + +- [2595. Number of Even and Odd Bits](/solution/2500-2599/2595.Number%20of%20Even%20and%20Odd%20Bits/README_EN.md) +- [2596. Check Knight Tour Configuration](/solution/2500-2599/2596.Check%20Knight%20Tour%20Configuration/README_EN.md) +- [2597. The Number of Beautiful Subsets](/solution/2500-2599/2597.The%20Number%20of%20Beautiful%20Subsets/README_EN.md) +- [2598. Smallest Missing Non-negative Integer After Operations](/solution/2500-2599/2598.Smallest%20Missing%20Non-negative%20Integer%20After%20Operations/README_EN.md) + +#### Biweekly Contest 100 + +- [2591. Distribute Money to Maximum Children](/solution/2500-2599/2591.Distribute%20Money%20to%20Maximum%20Children/README_EN.md) +- [2592. Maximize Greatness of an Array](/solution/2500-2599/2592.Maximize%20Greatness%20of%20an%20Array/README_EN.md) +- [2593. Find Score of an Array After Marking All Elements](/solution/2500-2599/2593.Find%20Score%20of%20an%20Array%20After%20Marking%20All%20Elements/README_EN.md) +- [2594. Minimum Time to Repair Cars](/solution/2500-2599/2594.Minimum%20Time%20to%20Repair%20Cars/README_EN.md) + +#### Weekly Contest 336 + +- [2586. Count the Number of Vowel Strings in Range](/solution/2500-2599/2586.Count%20the%20Number%20of%20Vowel%20Strings%20in%20Range/README_EN.md) +- [2587. Rearrange Array to Maximize Prefix Score](/solution/2500-2599/2587.Rearrange%20Array%20to%20Maximize%20Prefix%20Score/README_EN.md) +- [2588. Count the Number of Beautiful Subarrays](/solution/2500-2599/2588.Count%20the%20Number%20of%20Beautiful%20Subarrays/README_EN.md) +- [2589. Minimum Time to Complete All Tasks](/solution/2500-2599/2589.Minimum%20Time%20to%20Complete%20All%20Tasks/README_EN.md) + +#### Weekly Contest 335 + +- [2582. Pass the Pillow](/solution/2500-2599/2582.Pass%20the%20Pillow/README_EN.md) +- [2583. Kth Largest Sum in a Binary Tree](/solution/2500-2599/2583.Kth%20Largest%20Sum%20in%20a%20Binary%20Tree/README_EN.md) +- [2584. Split the Array to Make Coprime Products](/solution/2500-2599/2584.Split%20the%20Array%20to%20Make%20Coprime%20Products/README_EN.md) +- [2585. Number of Ways to Earn Points](/solution/2500-2599/2585.Number%20of%20Ways%20to%20Earn%20Points/README_EN.md) + +#### Biweekly Contest 99 + +- [2578. Split With Minimum Sum](/solution/2500-2599/2578.Split%20With%20Minimum%20Sum/README_EN.md) +- [2579. Count Total Number of Colored Cells](/solution/2500-2599/2579.Count%20Total%20Number%20of%20Colored%20Cells/README_EN.md) +- [2580. Count Ways to Group Overlapping Ranges](/solution/2500-2599/2580.Count%20Ways%20to%20Group%20Overlapping%20Ranges/README_EN.md) +- [2581. Count Number of Possible Root Nodes](/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README_EN.md) + +#### Weekly Contest 334 + +- [2574. Left and Right Sum Differences](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README_EN.md) +- [2575. Find the Divisibility Array of a String](/solution/2500-2599/2575.Find%20the%20Divisibility%20Array%20of%20a%20String/README_EN.md) +- [2576. Find the Maximum Number of Marked Indices](/solution/2500-2599/2576.Find%20the%20Maximum%20Number%20of%20Marked%20Indices/README_EN.md) +- [2577. Minimum Time to Visit a Cell In a Grid](/solution/2500-2599/2577.Minimum%20Time%20to%20Visit%20a%20Cell%20In%20a%20Grid/README_EN.md) + +#### Weekly Contest 333 + +- [2570. Merge Two 2D Arrays by Summing Values](/solution/2500-2599/2570.Merge%20Two%202D%20Arrays%20by%20Summing%20Values/README_EN.md) +- [2571. Minimum Operations to Reduce an Integer to 0](/solution/2500-2599/2571.Minimum%20Operations%20to%20Reduce%20an%20Integer%20to%200/README_EN.md) +- [2572. Count the Number of Square-Free Subsets](/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README_EN.md) +- [2573. Find the String with LCP](/solution/2500-2599/2573.Find%20the%20String%20with%20LCP/README_EN.md) + +#### Biweekly Contest 98 + +- [2566. Maximum Difference by Remapping a Digit](/solution/2500-2599/2566.Maximum%20Difference%20by%20Remapping%20a%20Digit/README_EN.md) +- [2567. Minimum Score by Changing Two Elements](/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README_EN.md) +- [2568. Minimum Impossible OR](/solution/2500-2599/2568.Minimum%20Impossible%20OR/README_EN.md) +- [2569. Handling Sum Queries After Update](/solution/2500-2599/2569.Handling%20Sum%20Queries%20After%20Update/README_EN.md) + +#### Weekly Contest 332 + +- [2562. Find the Array Concatenation Value](/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README_EN.md) +- [2563. Count the Number of Fair Pairs](/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README_EN.md) +- [2564. Substring XOR Queries](/solution/2500-2599/2564.Substring%20XOR%20Queries/README_EN.md) +- [2565. Subsequence With the Minimum Score](/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README_EN.md) + +#### Weekly Contest 331 + +- [2558. Take Gifts From the Richest Pile](/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README_EN.md) +- [2559. Count Vowel Strings in Ranges](/solution/2500-2599/2559.Count%20Vowel%20Strings%20in%20Ranges/README_EN.md) +- [2560. House Robber IV](/solution/2500-2599/2560.House%20Robber%20IV/README_EN.md) +- [2561. Rearranging Fruits](/solution/2500-2599/2561.Rearranging%20Fruits/README_EN.md) + +#### Biweekly Contest 97 + +- [2553. Separate the Digits in an Array](/solution/2500-2599/2553.Separate%20the%20Digits%20in%20an%20Array/README_EN.md) +- [2554. Maximum Number of Integers to Choose From a Range I](/solution/2500-2599/2554.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20I/README_EN.md) +- [2555. Maximize Win From Two Segments](/solution/2500-2599/2555.Maximize%20Win%20From%20Two%20Segments/README_EN.md) +- [2556. Disconnect Path in a Binary Matrix by at Most One Flip](/solution/2500-2599/2556.Disconnect%20Path%20in%20a%20Binary%20Matrix%20by%20at%20Most%20One%20Flip/README_EN.md) + +#### Weekly Contest 330 + +- [2549. Count Distinct Numbers on Board](/solution/2500-2599/2549.Count%20Distinct%20Numbers%20on%20Board/README_EN.md) +- [2550. Count Collisions of Monkeys on a Polygon](/solution/2500-2599/2550.Count%20Collisions%20of%20Monkeys%20on%20a%20Polygon/README_EN.md) +- [2551. Put Marbles in Bags](/solution/2500-2599/2551.Put%20Marbles%20in%20Bags/README_EN.md) +- [2552. Count Increasing Quadruplets](/solution/2500-2599/2552.Count%20Increasing%20Quadruplets/README_EN.md) + +#### Weekly Contest 329 + +- [2544. Alternating Digit Sum](/solution/2500-2599/2544.Alternating%20Digit%20Sum/README_EN.md) +- [2545. Sort the Students by Their Kth Score](/solution/2500-2599/2545.Sort%20the%20Students%20by%20Their%20Kth%20Score/README_EN.md) +- [2546. Apply Bitwise Operations to Make Strings Equal](/solution/2500-2599/2546.Apply%20Bitwise%20Operations%20to%20Make%20Strings%20Equal/README_EN.md) +- [2547. Minimum Cost to Split an Array](/solution/2500-2599/2547.Minimum%20Cost%20to%20Split%20an%20Array/README_EN.md) + +#### Biweekly Contest 96 + +- [2540. Minimum Common Value](/solution/2500-2599/2540.Minimum%20Common%20Value/README_EN.md) +- [2541. Minimum Operations to Make Array Equal II](/solution/2500-2599/2541.Minimum%20Operations%20to%20Make%20Array%20Equal%20II/README_EN.md) +- [2542. Maximum Subsequence Score](/solution/2500-2599/2542.Maximum%20Subsequence%20Score/README_EN.md) +- [2543. Check if Point Is Reachable](/solution/2500-2599/2543.Check%20if%20Point%20Is%20Reachable/README_EN.md) + +#### Weekly Contest 328 + +- [2535. Difference Between Element Sum and Digit Sum of an Array](/solution/2500-2599/2535.Difference%20Between%20Element%20Sum%20and%20Digit%20Sum%20of%20an%20Array/README_EN.md) +- [2536. Increment Submatrices by One](/solution/2500-2599/2536.Increment%20Submatrices%20by%20One/README_EN.md) +- [2537. Count the Number of Good Subarrays](/solution/2500-2599/2537.Count%20the%20Number%20of%20Good%20Subarrays/README_EN.md) +- [2538. Difference Between Maximum and Minimum Price Sum](/solution/2500-2599/2538.Difference%20Between%20Maximum%20and%20Minimum%20Price%20Sum/README_EN.md) + +#### Weekly Contest 327 + +- [2529. Maximum Count of Positive Integer and Negative Integer](/solution/2500-2599/2529.Maximum%20Count%20of%20Positive%20Integer%20and%20Negative%20Integer/README_EN.md) +- [2530. Maximal Score After Applying K Operations](/solution/2500-2599/2530.Maximal%20Score%20After%20Applying%20K%20Operations/README_EN.md) +- [2531. Make Number of Distinct Characters Equal](/solution/2500-2599/2531.Make%20Number%20of%20Distinct%20Characters%20Equal/README_EN.md) +- [2532. Time to Cross a Bridge](/solution/2500-2599/2532.Time%20to%20Cross%20a%20Bridge/README_EN.md) + +#### Biweekly Contest 95 + +- [2525. Categorize Box According to Criteria](/solution/2500-2599/2525.Categorize%20Box%20According%20to%20Criteria/README_EN.md) +- [2526. Find Consecutive Integers from a Data Stream](/solution/2500-2599/2526.Find%20Consecutive%20Integers%20from%20a%20Data%20Stream/README_EN.md) +- [2527. Find Xor-Beauty of Array](/solution/2500-2599/2527.Find%20Xor-Beauty%20of%20Array/README_EN.md) +- [2528. Maximize the Minimum Powered City](/solution/2500-2599/2528.Maximize%20the%20Minimum%20Powered%20City/README_EN.md) + +#### Weekly Contest 326 + +- [2520. Count the Digits That Divide a Number](/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README_EN.md) +- [2521. Distinct Prime Factors of Product of Array](/solution/2500-2599/2521.Distinct%20Prime%20Factors%20of%20Product%20of%20Array/README_EN.md) +- [2522. Partition String Into Substrings With Values at Most K](/solution/2500-2599/2522.Partition%20String%20Into%20Substrings%20With%20Values%20at%20Most%20K/README_EN.md) +- [2523. Closest Prime Numbers in Range](/solution/2500-2599/2523.Closest%20Prime%20Numbers%20in%20Range/README_EN.md) + +#### Weekly Contest 325 + +- [2515. Shortest Distance to Target String in a Circular Array](/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README_EN.md) +- [2516. Take K of Each Character From Left and Right](/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README_EN.md) +- [2517. Maximum Tastiness of Candy Basket](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README_EN.md) +- [2518. Number of Great Partitions](/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README_EN.md) + +#### Biweekly Contest 94 + +- [2511. Maximum Enemy Forts That Can Be Captured](/solution/2500-2599/2511.Maximum%20Enemy%20Forts%20That%20Can%20Be%20Captured/README_EN.md) +- [2512. Reward Top K Students](/solution/2500-2599/2512.Reward%20Top%20K%20Students/README_EN.md) +- [2513. Minimize the Maximum of Two Arrays](/solution/2500-2599/2513.Minimize%20the%20Maximum%20of%20Two%20Arrays/README_EN.md) +- [2514. Count Anagrams](/solution/2500-2599/2514.Count%20Anagrams/README_EN.md) + +#### Weekly Contest 324 + +- [2506. Count Pairs Of Similar Strings](/solution/2500-2599/2506.Count%20Pairs%20Of%20Similar%20Strings/README_EN.md) +- [2507. Smallest Value After Replacing With Sum of Prime Factors](/solution/2500-2599/2507.Smallest%20Value%20After%20Replacing%20With%20Sum%20of%20Prime%20Factors/README_EN.md) +- [2508. Add Edges to Make Degrees of All Nodes Even](/solution/2500-2599/2508.Add%20Edges%20to%20Make%20Degrees%20of%20All%20Nodes%20Even/README_EN.md) +- [2509. Cycle Length Queries in a Tree](/solution/2500-2599/2509.Cycle%20Length%20Queries%20in%20a%20Tree/README_EN.md) + +#### Weekly Contest 323 + +- [2500. Delete Greatest Value in Each Row](/solution/2500-2599/2500.Delete%20Greatest%20Value%20in%20Each%20Row/README_EN.md) +- [2501. Longest Square Streak in an Array](/solution/2500-2599/2501.Longest%20Square%20Streak%20in%20an%20Array/README_EN.md) +- [2502. Design Memory Allocator](/solution/2500-2599/2502.Design%20Memory%20Allocator/README_EN.md) +- [2503. Maximum Number of Points From Grid Queries](/solution/2500-2599/2503.Maximum%20Number%20of%20Points%20From%20Grid%20Queries/README_EN.md) + +#### Biweekly Contest 93 + +- [2496. Maximum Value of a String in an Array](/solution/2400-2499/2496.Maximum%20Value%20of%20a%20String%20in%20an%20Array/README_EN.md) +- [2497. Maximum Star Sum of a Graph](/solution/2400-2499/2497.Maximum%20Star%20Sum%20of%20a%20Graph/README_EN.md) +- [2498. Frog Jump II](/solution/2400-2499/2498.Frog%20Jump%20II/README_EN.md) +- [2499. Minimum Total Cost to Make Arrays Unequal](/solution/2400-2499/2499.Minimum%20Total%20Cost%20to%20Make%20Arrays%20Unequal/README_EN.md) + +#### Weekly Contest 322 + +- [2490. Circular Sentence](/solution/2400-2499/2490.Circular%20Sentence/README_EN.md) +- [2491. Divide Players Into Teams of Equal Skill](/solution/2400-2499/2491.Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/README_EN.md) +- [2492. Minimum Score of a Path Between Two Cities](/solution/2400-2499/2492.Minimum%20Score%20of%20a%20Path%20Between%20Two%20Cities/README_EN.md) +- [2493. Divide Nodes Into the Maximum Number of Groups](/solution/2400-2499/2493.Divide%20Nodes%20Into%20the%20Maximum%20Number%20of%20Groups/README_EN.md) + +#### Weekly Contest 321 + +- [2485. Find the Pivot Integer](/solution/2400-2499/2485.Find%20the%20Pivot%20Integer/README_EN.md) +- [2486. Append Characters to String to Make Subsequence](/solution/2400-2499/2486.Append%20Characters%20to%20String%20to%20Make%20Subsequence/README_EN.md) +- [2487. Remove Nodes From Linked List](/solution/2400-2499/2487.Remove%20Nodes%20From%20Linked%20List/README_EN.md) +- [2488. Count Subarrays With Median K](/solution/2400-2499/2488.Count%20Subarrays%20With%20Median%20K/README_EN.md) + +#### Biweekly Contest 92 + +- [2481. Minimum Cuts to Divide a Circle](/solution/2400-2499/2481.Minimum%20Cuts%20to%20Divide%20a%20Circle/README_EN.md) +- [2482. Difference Between Ones and Zeros in Row and Column](/solution/2400-2499/2482.Difference%20Between%20Ones%20and%20Zeros%20in%20Row%20and%20Column/README_EN.md) +- [2483. Minimum Penalty for a Shop](/solution/2400-2499/2483.Minimum%20Penalty%20for%20a%20Shop/README_EN.md) +- [2484. Count Palindromic Subsequences](/solution/2400-2499/2484.Count%20Palindromic%20Subsequences/README_EN.md) + +#### Weekly Contest 320 + +- [2475. Number of Unequal Triplets in Array](/solution/2400-2499/2475.Number%20of%20Unequal%20Triplets%20in%20Array/README_EN.md) +- [2476. Closest Nodes Queries in a Binary Search Tree](/solution/2400-2499/2476.Closest%20Nodes%20Queries%20in%20a%20Binary%20Search%20Tree/README_EN.md) +- [2477. Minimum Fuel Cost to Report to the Capital](/solution/2400-2499/2477.Minimum%20Fuel%20Cost%20to%20Report%20to%20the%20Capital/README_EN.md) +- [2478. Number of Beautiful Partitions](/solution/2400-2499/2478.Number%20of%20Beautiful%20Partitions/README_EN.md) + +#### Weekly Contest 319 + +- [2469. Convert the Temperature](/solution/2400-2499/2469.Convert%20the%20Temperature/README_EN.md) +- [2470. Number of Subarrays With LCM Equal to K](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README_EN.md) +- [2471. Minimum Number of Operations to Sort a Binary Tree by Level](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README_EN.md) +- [2472. Maximum Number of Non-overlapping Palindrome Substrings](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README_EN.md) + +#### Biweekly Contest 91 + +- [2465. Number of Distinct Averages](/solution/2400-2499/2465.Number%20of%20Distinct%20Averages/README_EN.md) +- [2466. Count Ways To Build Good Strings](/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README_EN.md) +- [2467. Most Profitable Path in a Tree](/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README_EN.md) +- [2468. Split Message Based on Limit](/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README_EN.md) + +#### Weekly Contest 318 + +- [2460. Apply Operations to an Array](/solution/2400-2499/2460.Apply%20Operations%20to%20an%20Array/README_EN.md) +- [2461. Maximum Sum of Distinct Subarrays With Length K](/solution/2400-2499/2461.Maximum%20Sum%20of%20Distinct%20Subarrays%20With%20Length%20K/README_EN.md) +- [2462. Total Cost to Hire K Workers](/solution/2400-2499/2462.Total%20Cost%20to%20Hire%20K%20Workers/README_EN.md) +- [2463. Minimum Total Distance Traveled](/solution/2400-2499/2463.Minimum%20Total%20Distance%20Traveled/README_EN.md) + +#### Weekly Contest 317 + +- [2455. Average Value of Even Numbers That Are Divisible by Three](/solution/2400-2499/2455.Average%20Value%20of%20Even%20Numbers%20That%20Are%20Divisible%20by%20Three/README_EN.md) +- [2456. Most Popular Video Creator](/solution/2400-2499/2456.Most%20Popular%20Video%20Creator/README_EN.md) +- [2457. Minimum Addition to Make Integer Beautiful](/solution/2400-2499/2457.Minimum%20Addition%20to%20Make%20Integer%20Beautiful/README_EN.md) +- [2458. Height of Binary Tree After Subtree Removal Queries](/solution/2400-2499/2458.Height%20of%20Binary%20Tree%20After%20Subtree%20Removal%20Queries/README_EN.md) + +#### Biweekly Contest 90 + +- [2451. Odd String Difference](/solution/2400-2499/2451.Odd%20String%20Difference/README_EN.md) +- [2452. Words Within Two Edits of Dictionary](/solution/2400-2499/2452.Words%20Within%20Two%20Edits%20of%20Dictionary/README_EN.md) +- [2453. Destroy Sequential Targets](/solution/2400-2499/2453.Destroy%20Sequential%20Targets/README_EN.md) +- [2454. Next Greater Element IV](/solution/2400-2499/2454.Next%20Greater%20Element%20IV/README_EN.md) + +#### Weekly Contest 316 + +- [2446. Determine if Two Events Have Conflict](/solution/2400-2499/2446.Determine%20if%20Two%20Events%20Have%20Conflict/README_EN.md) +- [2447. Number of Subarrays With GCD Equal to K](/solution/2400-2499/2447.Number%20of%20Subarrays%20With%20GCD%20Equal%20to%20K/README_EN.md) +- [2448. Minimum Cost to Make Array Equal](/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README_EN.md) +- [2449. Minimum Number of Operations to Make Arrays Similar](/solution/2400-2499/2449.Minimum%20Number%20of%20Operations%20to%20Make%20Arrays%20Similar/README_EN.md) + +#### Weekly Contest 315 + +- [2441. Largest Positive Integer That Exists With Its Negative](/solution/2400-2499/2441.Largest%20Positive%20Integer%20That%20Exists%20With%20Its%20Negative/README_EN.md) +- [2442. Count Number of Distinct Integers After Reverse Operations](/solution/2400-2499/2442.Count%20Number%20of%20Distinct%20Integers%20After%20Reverse%20Operations/README_EN.md) +- [2443. Sum of Number and Its Reverse](/solution/2400-2499/2443.Sum%20of%20Number%20and%20Its%20Reverse/README_EN.md) +- [2444. Count Subarrays With Fixed Bounds](/solution/2400-2499/2444.Count%20Subarrays%20With%20Fixed%20Bounds/README_EN.md) + +#### Biweekly Contest 89 + +- [2437. Number of Valid Clock Times](/solution/2400-2499/2437.Number%20of%20Valid%20Clock%20Times/README_EN.md) +- [2438. Range Product Queries of Powers](/solution/2400-2499/2438.Range%20Product%20Queries%20of%20Powers/README_EN.md) +- [2439. Minimize Maximum of Array](/solution/2400-2499/2439.Minimize%20Maximum%20of%20Array/README_EN.md) +- [2440. Create Components With Same Value](/solution/2400-2499/2440.Create%20Components%20With%20Same%20Value/README_EN.md) + +#### Weekly Contest 314 + +- [2432. The Employee That Worked on the Longest Task](/solution/2400-2499/2432.The%20Employee%20That%20Worked%20on%20the%20Longest%20Task/README_EN.md) +- [2433. Find The Original Array of Prefix Xor](/solution/2400-2499/2433.Find%20The%20Original%20Array%20of%20Prefix%20Xor/README_EN.md) +- [2434. Using a Robot to Print the Lexicographically Smallest String](/solution/2400-2499/2434.Using%20a%20Robot%20to%20Print%20the%20Lexicographically%20Smallest%20String/README_EN.md) +- [2435. Paths in Matrix Whose Sum Is Divisible by K](/solution/2400-2499/2435.Paths%20in%20Matrix%20Whose%20Sum%20Is%20Divisible%20by%20K/README_EN.md) + +#### Weekly Contest 313 + +- [2427. Number of Common Factors](/solution/2400-2499/2427.Number%20of%20Common%20Factors/README_EN.md) +- [2428. Maximum Sum of an Hourglass](/solution/2400-2499/2428.Maximum%20Sum%20of%20an%20Hourglass/README_EN.md) +- [2429. Minimize XOR](/solution/2400-2499/2429.Minimize%20XOR/README_EN.md) +- [2430. Maximum Deletions on a String](/solution/2400-2499/2430.Maximum%20Deletions%20on%20a%20String/README_EN.md) + +#### Biweekly Contest 88 + +- [2423. Remove Letter To Equalize Frequency](/solution/2400-2499/2423.Remove%20Letter%20To%20Equalize%20Frequency/README_EN.md) +- [2424. Longest Uploaded Prefix](/solution/2400-2499/2424.Longest%20Uploaded%20Prefix/README_EN.md) +- [2425. Bitwise XOR of All Pairings](/solution/2400-2499/2425.Bitwise%20XOR%20of%20All%20Pairings/README_EN.md) +- [2426. Number of Pairs Satisfying Inequality](/solution/2400-2499/2426.Number%20of%20Pairs%20Satisfying%20Inequality/README_EN.md) + +#### Weekly Contest 312 + +- [2418. Sort the People](/solution/2400-2499/2418.Sort%20the%20People/README_EN.md) +- [2419. Longest Subarray With Maximum Bitwise AND](/solution/2400-2499/2419.Longest%20Subarray%20With%20Maximum%20Bitwise%20AND/README_EN.md) +- [2420. Find All Good Indices](/solution/2400-2499/2420.Find%20All%20Good%20Indices/README_EN.md) +- [2421. Number of Good Paths](/solution/2400-2499/2421.Number%20of%20Good%20Paths/README_EN.md) + +#### Weekly Contest 311 + +- [2413. Smallest Even Multiple](/solution/2400-2499/2413.Smallest%20Even%20Multiple/README_EN.md) +- [2414. Length of the Longest Alphabetical Continuous Substring](/solution/2400-2499/2414.Length%20of%20the%20Longest%20Alphabetical%20Continuous%20Substring/README_EN.md) +- [2415. Reverse Odd Levels of Binary Tree](/solution/2400-2499/2415.Reverse%20Odd%20Levels%20of%20Binary%20Tree/README_EN.md) +- [2416. Sum of Prefix Scores of Strings](/solution/2400-2499/2416.Sum%20of%20Prefix%20Scores%20of%20Strings/README_EN.md) + +#### Biweekly Contest 87 + +- [2409. Count Days Spent Together](/solution/2400-2499/2409.Count%20Days%20Spent%20Together/README_EN.md) +- [2410. Maximum Matching of Players With Trainers](/solution/2400-2499/2410.Maximum%20Matching%20of%20Players%20With%20Trainers/README_EN.md) +- [2411. Smallest Subarrays With Maximum Bitwise OR](/solution/2400-2499/2411.Smallest%20Subarrays%20With%20Maximum%20Bitwise%20OR/README_EN.md) +- [2412. Minimum Money Required Before Transactions](/solution/2400-2499/2412.Minimum%20Money%20Required%20Before%20Transactions/README_EN.md) + +#### Weekly Contest 310 + +- [2404. Most Frequent Even Element](/solution/2400-2499/2404.Most%20Frequent%20Even%20Element/README_EN.md) +- [2405. Optimal Partition of String](/solution/2400-2499/2405.Optimal%20Partition%20of%20String/README_EN.md) +- [2406. Divide Intervals Into Minimum Number of Groups](/solution/2400-2499/2406.Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/README_EN.md) +- [2407. Longest Increasing Subsequence II](/solution/2400-2499/2407.Longest%20Increasing%20Subsequence%20II/README_EN.md) + +#### Weekly Contest 309 + +- [2399. Check Distances Between Same Letters](/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README_EN.md) +- [2400. Number of Ways to Reach a Position After Exactly k Steps](/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README_EN.md) +- [2401. Longest Nice Subarray](/solution/2400-2499/2401.Longest%20Nice%20Subarray/README_EN.md) +- [2402. Meeting Rooms III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README_EN.md) + +#### Biweekly Contest 86 + +- [2395. Find Subarrays With Equal Sum](/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README_EN.md) +- [2396. Strictly Palindromic Number](/solution/2300-2399/2396.Strictly%20Palindromic%20Number/README_EN.md) +- [2397. Maximum Rows Covered by Columns](/solution/2300-2399/2397.Maximum%20Rows%20Covered%20by%20Columns/README_EN.md) +- [2398. Maximum Number of Robots Within Budget](/solution/2300-2399/2398.Maximum%20Number%20of%20Robots%20Within%20Budget/README_EN.md) + +#### Weekly Contest 308 + +- [2389. Longest Subsequence With Limited Sum](/solution/2300-2399/2389.Longest%20Subsequence%20With%20Limited%20Sum/README_EN.md) +- [2390. Removing Stars From a String](/solution/2300-2399/2390.Removing%20Stars%20From%20a%20String/README_EN.md) +- [2391. Minimum Amount of Time to Collect Garbage](/solution/2300-2399/2391.Minimum%20Amount%20of%20Time%20to%20Collect%20Garbage/README_EN.md) +- [2392. Build a Matrix With Conditions](/solution/2300-2399/2392.Build%20a%20Matrix%20With%20Conditions/README_EN.md) + +#### Weekly Contest 307 + +- [2383. Minimum Hours of Training to Win a Competition](/solution/2300-2399/2383.Minimum%20Hours%20of%20Training%20to%20Win%20a%20Competition/README_EN.md) +- [2384. Largest Palindromic Number](/solution/2300-2399/2384.Largest%20Palindromic%20Number/README_EN.md) +- [2385. Amount of Time for Binary Tree to Be Infected](/solution/2300-2399/2385.Amount%20of%20Time%20for%20Binary%20Tree%20to%20Be%20Infected/README_EN.md) +- [2386. Find the K-Sum of an Array](/solution/2300-2399/2386.Find%20the%20K-Sum%20of%20an%20Array/README_EN.md) + +#### Biweekly Contest 85 + +- [2379. Minimum Recolors to Get K Consecutive Black Blocks](/solution/2300-2399/2379.Minimum%20Recolors%20to%20Get%20K%20Consecutive%20Black%20Blocks/README_EN.md) +- [2380. Time Needed to Rearrange a Binary String](/solution/2300-2399/2380.Time%20Needed%20to%20Rearrange%20a%20Binary%20String/README_EN.md) +- [2381. Shifting Letters II](/solution/2300-2399/2381.Shifting%20Letters%20II/README_EN.md) +- [2382. Maximum Segment Sum After Removals](/solution/2300-2399/2382.Maximum%20Segment%20Sum%20After%20Removals/README_EN.md) + +#### Weekly Contest 306 + +- [2373. Largest Local Values in a Matrix](/solution/2300-2399/2373.Largest%20Local%20Values%20in%20a%20Matrix/README_EN.md) +- [2374. Node With Highest Edge Score](/solution/2300-2399/2374.Node%20With%20Highest%20Edge%20Score/README_EN.md) +- [2375. Construct Smallest Number From DI String](/solution/2300-2399/2375.Construct%20Smallest%20Number%20From%20DI%20String/README_EN.md) +- [2376. Count Special Integers](/solution/2300-2399/2376.Count%20Special%20Integers/README_EN.md) + +#### Weekly Contest 305 + +- [2367. Number of Arithmetic Triplets](/solution/2300-2399/2367.Number%20of%20Arithmetic%20Triplets/README_EN.md) +- [2368. Reachable Nodes With Restrictions](/solution/2300-2399/2368.Reachable%20Nodes%20With%20Restrictions/README_EN.md) +- [2369. Check if There is a Valid Partition For The Array](/solution/2300-2399/2369.Check%20if%20There%20is%20a%20Valid%20Partition%20For%20The%20Array/README_EN.md) +- [2370. Longest Ideal Subsequence](/solution/2300-2399/2370.Longest%20Ideal%20Subsequence/README_EN.md) + +#### Biweekly Contest 84 + +- [2363. Merge Similar Items](/solution/2300-2399/2363.Merge%20Similar%20Items/README_EN.md) +- [2364. Count Number of Bad Pairs](/solution/2300-2399/2364.Count%20Number%20of%20Bad%20Pairs/README_EN.md) +- [2365. Task Scheduler II](/solution/2300-2399/2365.Task%20Scheduler%20II/README_EN.md) +- [2366. Minimum Replacements to Sort the Array](/solution/2300-2399/2366.Minimum%20Replacements%20to%20Sort%20the%20Array/README_EN.md) + +#### Weekly Contest 304 + +- [2357. Make Array Zero by Subtracting Equal Amounts](/solution/2300-2399/2357.Make%20Array%20Zero%20by%20Subtracting%20Equal%20Amounts/README_EN.md) +- [2358. Maximum Number of Groups Entering a Competition](/solution/2300-2399/2358.Maximum%20Number%20of%20Groups%20Entering%20a%20Competition/README_EN.md) +- [2359. Find Closest Node to Given Two Nodes](/solution/2300-2399/2359.Find%20Closest%20Node%20to%20Given%20Two%20Nodes/README_EN.md) +- [2360. Longest Cycle in a Graph](/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README_EN.md) + +#### Weekly Contest 303 + +- [2351. First Letter to Appear Twice](/solution/2300-2399/2351.First%20Letter%20to%20Appear%20Twice/README_EN.md) +- [2352. Equal Row and Column Pairs](/solution/2300-2399/2352.Equal%20Row%20and%20Column%20Pairs/README_EN.md) +- [2353. Design a Food Rating System](/solution/2300-2399/2353.Design%20a%20Food%20Rating%20System/README_EN.md) +- [2354. Number of Excellent Pairs](/solution/2300-2399/2354.Number%20of%20Excellent%20Pairs/README_EN.md) + +#### Biweekly Contest 83 + +- [2347. Best Poker Hand](/solution/2300-2399/2347.Best%20Poker%20Hand/README_EN.md) +- [2348. Number of Zero-Filled Subarrays](/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README_EN.md) +- [2349. Design a Number Container System](/solution/2300-2399/2349.Design%20a%20Number%20Container%20System/README_EN.md) +- [2350. Shortest Impossible Sequence of Rolls](/solution/2300-2399/2350.Shortest%20Impossible%20Sequence%20of%20Rolls/README_EN.md) + +#### Weekly Contest 302 + +- [2341. Maximum Number of Pairs in Array](/solution/2300-2399/2341.Maximum%20Number%20of%20Pairs%20in%20Array/README_EN.md) +- [2342. Max Sum of a Pair With Equal Sum of Digits](/solution/2300-2399/2342.Max%20Sum%20of%20a%20Pair%20With%20Equal%20Sum%20of%20Digits/README_EN.md) +- [2343. Query Kth Smallest Trimmed Number](/solution/2300-2399/2343.Query%20Kth%20Smallest%20Trimmed%20Number/README_EN.md) +- [2344. Minimum Deletions to Make Array Divisible](/solution/2300-2399/2344.Minimum%20Deletions%20to%20Make%20Array%20Divisible/README_EN.md) + +#### Weekly Contest 301 + +- [2335. Minimum Amount of Time to Fill Cups](/solution/2300-2399/2335.Minimum%20Amount%20of%20Time%20to%20Fill%20Cups/README_EN.md) +- [2336. Smallest Number in Infinite Set](/solution/2300-2399/2336.Smallest%20Number%20in%20Infinite%20Set/README_EN.md) +- [2337. Move Pieces to Obtain a String](/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README_EN.md) +- [2338. Count the Number of Ideal Arrays](/solution/2300-2399/2338.Count%20the%20Number%20of%20Ideal%20Arrays/README_EN.md) + +#### Biweekly Contest 82 + +- [2331. Evaluate Boolean Binary Tree](/solution/2300-2399/2331.Evaluate%20Boolean%20Binary%20Tree/README_EN.md) +- [2332. The Latest Time to Catch a Bus](/solution/2300-2399/2332.The%20Latest%20Time%20to%20Catch%20a%20Bus/README_EN.md) +- [2333. Minimum Sum of Squared Difference](/solution/2300-2399/2333.Minimum%20Sum%20of%20Squared%20Difference/README_EN.md) +- [2334. Subarray With Elements Greater Than Varying Threshold](/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README_EN.md) + +#### Weekly Contest 300 + +- [2325. Decode the Message](/solution/2300-2399/2325.Decode%20the%20Message/README_EN.md) +- [2326. Spiral Matrix IV](/solution/2300-2399/2326.Spiral%20Matrix%20IV/README_EN.md) +- [2327. Number of People Aware of a Secret](/solution/2300-2399/2327.Number%20of%20People%20Aware%20of%20a%20Secret/README_EN.md) +- [2328. Number of Increasing Paths in a Grid](/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README_EN.md) + +#### Weekly Contest 299 + +- [2319. Check if Matrix Is X-Matrix](/solution/2300-2399/2319.Check%20if%20Matrix%20Is%20X-Matrix/README_EN.md) +- [2320. Count Number of Ways to Place Houses](/solution/2300-2399/2320.Count%20Number%20of%20Ways%20to%20Place%20Houses/README_EN.md) +- [2321. Maximum Score Of Spliced Array](/solution/2300-2399/2321.Maximum%20Score%20Of%20Spliced%20Array/README_EN.md) +- [2322. Minimum Score After Removals on a Tree](/solution/2300-2399/2322.Minimum%20Score%20After%20Removals%20on%20a%20Tree/README_EN.md) + +#### Biweekly Contest 81 + +- [2315. Count Asterisks](/solution/2300-2399/2315.Count%20Asterisks/README_EN.md) +- [2316. Count Unreachable Pairs of Nodes in an Undirected Graph](/solution/2300-2399/2316.Count%20Unreachable%20Pairs%20of%20Nodes%20in%20an%20Undirected%20Graph/README_EN.md) +- [2317. Maximum XOR After Operations](/solution/2300-2399/2317.Maximum%20XOR%20After%20Operations/README_EN.md) +- [2318. Number of Distinct Roll Sequences](/solution/2300-2399/2318.Number%20of%20Distinct%20Roll%20Sequences/README_EN.md) + +#### Weekly Contest 298 + +- [2309. Greatest English Letter in Upper and Lower Case](/solution/2300-2399/2309.Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case/README_EN.md) +- [2310. Sum of Numbers With Units Digit K](/solution/2300-2399/2310.Sum%20of%20Numbers%20With%20Units%20Digit%20K/README_EN.md) +- [2311. Longest Binary Subsequence Less Than or Equal to K](/solution/2300-2399/2311.Longest%20Binary%20Subsequence%20Less%20Than%20or%20Equal%20to%20K/README_EN.md) +- [2312. Selling Pieces of Wood](/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README_EN.md) + +#### Weekly Contest 297 + +- [2303. Calculate Amount Paid in Taxes](/solution/2300-2399/2303.Calculate%20Amount%20Paid%20in%20Taxes/README_EN.md) +- [2304. Minimum Path Cost in a Grid](/solution/2300-2399/2304.Minimum%20Path%20Cost%20in%20a%20Grid/README_EN.md) +- [2305. Fair Distribution of Cookies](/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README_EN.md) +- [2306. Naming a Company](/solution/2300-2399/2306.Naming%20a%20Company/README_EN.md) + +#### Biweekly Contest 80 + +- [2299. Strong Password Checker II](/solution/2200-2299/2299.Strong%20Password%20Checker%20II/README_EN.md) +- [2300. Successful Pairs of Spells and Potions](/solution/2300-2399/2300.Successful%20Pairs%20of%20Spells%20and%20Potions/README_EN.md) +- [2301. Match Substring After Replacement](/solution/2300-2399/2301.Match%20Substring%20After%20Replacement/README_EN.md) +- [2302. Count Subarrays With Score Less Than K](/solution/2300-2399/2302.Count%20Subarrays%20With%20Score%20Less%20Than%20K/README_EN.md) + +#### Weekly Contest 296 + +- [2293. Min Max Game](/solution/2200-2299/2293.Min%20Max%20Game/README_EN.md) +- [2294. Partition Array Such That Maximum Difference Is K](/solution/2200-2299/2294.Partition%20Array%20Such%20That%20Maximum%20Difference%20Is%20K/README_EN.md) +- [2295. Replace Elements in an Array](/solution/2200-2299/2295.Replace%20Elements%20in%20an%20Array/README_EN.md) +- [2296. Design a Text Editor](/solution/2200-2299/2296.Design%20a%20Text%20Editor/README_EN.md) + +#### Weekly Contest 295 + +- [2287. Rearrange Characters to Make Target String](/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README_EN.md) +- [2288. Apply Discount to Prices](/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README_EN.md) +- [2289. Steps to Make Array Non-decreasing](/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README_EN.md) +- [2290. Minimum Obstacle Removal to Reach Corner](/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README_EN.md) + +#### Biweekly Contest 79 + +- [2283. Check if Number Has Equal Digit Count and Digit Value](/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README_EN.md) +- [2284. Sender With Largest Word Count](/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README_EN.md) +- [2285. Maximum Total Importance of Roads](/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README_EN.md) +- [2286. Booking Concert Tickets in Groups](/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README_EN.md) + +#### Weekly Contest 294 + +- [2278. Percentage of Letter in String](/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README_EN.md) +- [2279. Maximum Bags With Full Capacity of Rocks](/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README_EN.md) +- [2280. Minimum Lines to Represent a Line Chart](/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README_EN.md) +- [2281. Sum of Total Strength of Wizards](/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README_EN.md) + +#### Weekly Contest 293 + +- [2273. Find Resultant Array After Removing Anagrams](/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README_EN.md) +- [2274. Maximum Consecutive Floors Without Special Floors](/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README_EN.md) +- [2275. Largest Combination With Bitwise AND Greater Than Zero](/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README_EN.md) +- [2276. Count Integers in Intervals](/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README_EN.md) + +#### Biweekly Contest 78 + +- [2269. Find the K-Beauty of a Number](/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README_EN.md) +- [2270. Number of Ways to Split Array](/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README_EN.md) +- [2271. Maximum White Tiles Covered by a Carpet](/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README_EN.md) +- [2272. Substring With Largest Variance](/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README_EN.md) + +#### Weekly Contest 292 + +- [2264. Largest 3-Same-Digit Number in String](/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README_EN.md) +- [2265. Count Nodes Equal to Average of Subtree](/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README_EN.md) +- [2266. Count Number of Texts](/solution/2200-2299/2266.Count%20Number%20of%20Texts/README_EN.md) +- [2267. Check if There Is a Valid Parentheses String Path](/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README_EN.md) + +#### Weekly Contest 291 + +- [2259. Remove Digit From Number to Maximize Result](/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README_EN.md) +- [2260. Minimum Consecutive Cards to Pick Up](/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README_EN.md) +- [2261. K Divisible Elements Subarrays](/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README_EN.md) +- [2262. Total Appeal of A String](/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README_EN.md) + +#### Biweekly Contest 77 + +- [2255. Count Prefixes of a Given String](/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README_EN.md) +- [2256. Minimum Average Difference](/solution/2200-2299/2256.Minimum%20Average%20Difference/README_EN.md) +- [2257. Count Unguarded Cells in the Grid](/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README_EN.md) +- [2258. Escape the Spreading Fire](/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README_EN.md) + +#### Weekly Contest 290 + +- [2248. Intersection of Multiple Arrays](/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README_EN.md) +- [2249. Count Lattice Points Inside a Circle](/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README_EN.md) +- [2250. Count Number of Rectangles Containing Each Point](/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README_EN.md) +- [2251. Number of Flowers in Full Bloom](/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README_EN.md) + +#### Weekly Contest 289 + +- [2243. Calculate Digit Sum of a String](/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README_EN.md) +- [2244. Minimum Rounds to Complete All Tasks](/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README_EN.md) +- [2245. Maximum Trailing Zeros in a Cornered Path](/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README_EN.md) +- [2246. Longest Path With Different Adjacent Characters](/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README_EN.md) + +#### Biweekly Contest 76 + +- [2239. Find Closest Number to Zero](/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README_EN.md) +- [2240. Number of Ways to Buy Pens and Pencils](/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README_EN.md) +- [2241. Design an ATM Machine](/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README_EN.md) +- [2242. Maximum Score of a Node Sequence](/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README_EN.md) + +#### Weekly Contest 288 + +- [2231. Largest Number After Digit Swaps by Parity](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README_EN.md) +- [2232. Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md) +- [2233. Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md) +- [2234. Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md) + +#### Weekly Contest 287 + +- [2224. Minimum Number of Operations to Convert Time](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README_EN.md) +- [2225. Find Players With Zero or One Losses](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README_EN.md) +- [2226. Maximum Candies Allocated to K Children](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README_EN.md) +- [2227. Encrypt and Decrypt Strings](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README_EN.md) + +#### Biweekly Contest 75 + +- [2220. Minimum Bit Flips to Convert Number](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README_EN.md) +- [2221. Find Triangular Sum of an Array](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README_EN.md) +- [2222. Number of Ways to Select Buildings](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README_EN.md) +- [2223. Sum of Scores of Built Strings](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README_EN.md) + +#### Weekly Contest 286 + +- [2215. Find the Difference of Two Arrays](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README_EN.md) +- [2216. Minimum Deletions to Make Array Beautiful](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README_EN.md) +- [2217. Find Palindrome With Fixed Length](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README_EN.md) +- [2218. Maximum Value of K Coins From Piles](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README_EN.md) + +#### Weekly Contest 285 + +- [2210. Count Hills and Valleys in an Array](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README_EN.md) +- [2211. Count Collisions on a Road](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README_EN.md) +- [2212. Maximum Points in an Archery Competition](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README_EN.md) +- [2213. Longest Substring of One Repeating Character](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README_EN.md) + +#### Biweekly Contest 74 + +- [2206. Divide Array Into Equal Pairs](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README_EN.md) +- [2207. Maximize Number of Subsequences in a String](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README_EN.md) +- [2208. Minimum Operations to Halve Array Sum](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README_EN.md) +- [2209. Minimum White Tiles After Covering With Carpets](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README_EN.md) + +#### Weekly Contest 284 + +- [2200. Find All K-Distant Indices in an Array](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README_EN.md) +- [2201. Count Artifacts That Can Be Extracted](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README_EN.md) +- [2202. Maximize the Topmost Element After K Moves](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README_EN.md) +- [2203. Minimum Weighted Subgraph With the Required Paths](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README_EN.md) + +#### Weekly Contest 283 + +- [2194. Cells in a Range on an Excel Sheet](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README_EN.md) +- [2195. Append K Integers With Minimal Sum](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README_EN.md) +- [2196. Create Binary Tree From Descriptions](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README_EN.md) +- [2197. Replace Non-Coprime Numbers in Array](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README_EN.md) + +#### Biweekly Contest 73 + +- [2190. Most Frequent Number Following Key In an Array](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README_EN.md) +- [2191. Sort the Jumbled Numbers](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README_EN.md) +- [2192. All Ancestors of a Node in a Directed Acyclic Graph](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README_EN.md) +- [2193. Minimum Number of Moves to Make Palindrome](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README_EN.md) + +#### Weekly Contest 282 + +- [2185. Counting Words With a Given Prefix](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README_EN.md) +- [2186. Minimum Number of Steps to Make Two Strings Anagram II](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README_EN.md) +- [2187. Minimum Time to Complete Trips](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README_EN.md) +- [2188. Minimum Time to Finish the Race](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README_EN.md) + +#### Weekly Contest 281 + +- [2180. Count Integers With Even Digit Sum](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README_EN.md) +- [2181. Merge Nodes in Between Zeros](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README_EN.md) +- [2182. Construct String With Repeat Limit](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README_EN.md) +- [2183. Count Array Pairs Divisible by K](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README_EN.md) + +#### Biweekly Contest 72 + +- [2176. Count Equal and Divisible Pairs in an Array](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README_EN.md) +- [2177. Find Three Consecutive Integers That Sum to a Given Number](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README_EN.md) +- [2178. Maximum Split of Positive Even Integers](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README_EN.md) +- [2179. Count Good Triplets in an Array](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README_EN.md) + +#### Weekly Contest 280 + +- [2169. Count Operations to Obtain Zero](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README_EN.md) +- [2170. Minimum Operations to Make the Array Alternating](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README_EN.md) +- [2171. Removing Minimum Number of Magic Beans](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README_EN.md) +- [2172. Maximum AND Sum of Array](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README_EN.md) + +#### Weekly Contest 279 + +- [2164. Sort Even and Odd Indices Independently](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README_EN.md) +- [2165. Smallest Value of the Rearranged Number](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README_EN.md) +- [2166. Design Bitset](/solution/2100-2199/2166.Design%20Bitset/README_EN.md) +- [2167. Minimum Time to Remove All Cars Containing Illegal Goods](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README_EN.md) + +#### Biweekly Contest 71 + +- [2160. Minimum Sum of Four Digit Number After Splitting Digits](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README_EN.md) +- [2161. Partition Array According to Given Pivot](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README_EN.md) +- [2162. Minimum Cost to Set Cooking Time](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README_EN.md) +- [2163. Minimum Difference in Sums After Removal of Elements](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README_EN.md) + +#### Weekly Contest 278 + +- [2154. Keep Multiplying Found Values by Two](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README_EN.md) +- [2155. All Divisions With the Highest Score of a Binary Array](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README_EN.md) +- [2156. Find Substring With Given Hash Value](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README_EN.md) +- [2157. Groups of Strings](/solution/2100-2199/2157.Groups%20of%20Strings/README_EN.md) + +#### Weekly Contest 277 + +- [2148. Count Elements With Strictly Smaller and Greater Elements](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README_EN.md) +- [2149. Rearrange Array Elements by Sign](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README_EN.md) +- [2150. Find All Lonely Numbers in the Array](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README_EN.md) +- [2151. Maximum Good People Based on Statements](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README_EN.md) + +#### Biweekly Contest 70 + +- [2144. Minimum Cost of Buying Candies With Discount](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README_EN.md) +- [2145. Count the Hidden Sequences](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README_EN.md) +- [2146. K Highest Ranked Items Within a Price Range](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README_EN.md) +- [2147. Number of Ways to Divide a Long Corridor](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README_EN.md) + +#### Weekly Contest 276 + +- [2138. Divide a String Into Groups of Size k](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README_EN.md) +- [2139. Minimum Moves to Reach Target Score](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README_EN.md) +- [2140. Solving Questions With Brainpower](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README_EN.md) +- [2141. Maximum Running Time of N Computers](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README_EN.md) + +#### Weekly Contest 275 + +- [2133. Check if Every Row and Column Contains All Numbers](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README_EN.md) +- [2134. Minimum Swaps to Group All 1's Together II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README_EN.md) +- [2135. Count Words Obtained After Adding a Letter](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README_EN.md) +- [2136. Earliest Possible Day of Full Bloom](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README_EN.md) + +#### Biweekly Contest 69 + +- [2129. Capitalize the Title](/solution/2100-2199/2129.Capitalize%20the%20Title/README_EN.md) +- [2130. Maximum Twin Sum of a Linked List](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README_EN.md) +- [2131. Longest Palindrome by Concatenating Two Letter Words](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README_EN.md) +- [2132. Stamping the Grid](/solution/2100-2199/2132.Stamping%20the%20Grid/README_EN.md) + +#### Weekly Contest 274 + +- [2124. Check if All A's Appears Before All B's](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README_EN.md) +- [2125. Number of Laser Beams in a Bank](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README_EN.md) +- [2126. Destroying Asteroids](/solution/2100-2199/2126.Destroying%20Asteroids/README_EN.md) +- [2127. Maximum Employees to Be Invited to a Meeting](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README_EN.md) + +#### Weekly Contest 273 + +- [2119. A Number After a Double Reversal](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README_EN.md) +- [2120. Execution of All Suffix Instructions Staying in a Grid](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README_EN.md) +- [2121. Intervals Between Identical Elements](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README_EN.md) +- [2122. Recover the Original Array](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README_EN.md) + +#### Biweekly Contest 68 + +- [2114. Maximum Number of Words Found in Sentences](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README_EN.md) +- [2115. Find All Possible Recipes from Given Supplies](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README_EN.md) +- [2116. Check if a Parentheses String Can Be Valid](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README_EN.md) +- [2117. Abbreviating the Product of a Range](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README_EN.md) + +#### Weekly Contest 272 + +- [2108. Find First Palindromic String in the Array](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README_EN.md) +- [2109. Adding Spaces to a String](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README_EN.md) +- [2110. Number of Smooth Descent Periods of a Stock](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README_EN.md) +- [2111. Minimum Operations to Make the Array K-Increasing](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README_EN.md) + +#### Weekly Contest 271 + +- [2103. Rings and Rods](/solution/2100-2199/2103.Rings%20and%20Rods/README_EN.md) +- [2104. Sum of Subarray Ranges](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README_EN.md) +- [2105. Watering Plants II](/solution/2100-2199/2105.Watering%20Plants%20II/README_EN.md) +- [2106. Maximum Fruits Harvested After at Most K Steps](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README_EN.md) + +#### Biweekly Contest 67 + +- [2099. Find Subsequence of Length K With the Largest Sum](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README_EN.md) +- [2100. Find Good Days to Rob the Bank](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README_EN.md) +- [2101. Detonate the Maximum Bombs](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README_EN.md) +- [2102. Sequentially Ordinal Rank Tracker](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README_EN.md) + +#### Weekly Contest 270 + +- [2094. Finding 3-Digit Even Numbers](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README_EN.md) +- [2095. Delete the Middle Node of a Linked List](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README_EN.md) +- [2096. Step-By-Step Directions From a Binary Tree Node to Another](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README_EN.md) +- [2097. Valid Arrangement of Pairs](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README_EN.md) + +#### Weekly Contest 269 + +- [2089. Find Target Indices After Sorting Array](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README_EN.md) +- [2090. K Radius Subarray Averages](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README_EN.md) +- [2091. Removing Minimum and Maximum From Array](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README_EN.md) +- [2092. Find All People With Secret](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README_EN.md) + +#### Biweekly Contest 66 + +- [2085. Count Common Words With One Occurrence](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README_EN.md) +- [2086. Minimum Number of Food Buckets to Feed the Hamsters](/solution/2000-2099/2086.Minimum%20Number%20of%20Food%20Buckets%20to%20Feed%20the%20Hamsters/README_EN.md) +- [2087. Minimum Cost Homecoming of a Robot in a Grid](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README_EN.md) +- [2088. Count Fertile Pyramids in a Land](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README_EN.md) + +#### Weekly Contest 268 + +- [2078. Two Furthest Houses With Different Colors](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README_EN.md) +- [2079. Watering Plants](/solution/2000-2099/2079.Watering%20Plants/README_EN.md) +- [2080. Range Frequency Queries](/solution/2000-2099/2080.Range%20Frequency%20Queries/README_EN.md) +- [2081. Sum of k-Mirror Numbers](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README_EN.md) + +#### Weekly Contest 267 + +- [2073. Time Needed to Buy Tickets](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README_EN.md) +- [2074. Reverse Nodes in Even Length Groups](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README_EN.md) +- [2075. Decode the Slanted Ciphertext](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README_EN.md) +- [2076. Process Restricted Friend Requests](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README_EN.md) + +#### Biweekly Contest 65 + +- [2068. Check Whether Two Strings are Almost Equivalent](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README_EN.md) +- [2069. Walking Robot Simulation II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README_EN.md) +- [2070. Most Beautiful Item for Each Query](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README_EN.md) +- [2071. Maximum Number of Tasks You Can Assign](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README_EN.md) + +#### Weekly Contest 266 + +- [2062. Count Vowel Substrings of a String](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README_EN.md) +- [2063. Vowels of All Substrings](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README_EN.md) +- [2064. Minimized Maximum of Products Distributed to Any Store](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README_EN.md) +- [2065. Maximum Path Quality of a Graph](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README_EN.md) + +#### Weekly Contest 265 + +- [2057. Smallest Index With Equal Value](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README_EN.md) +- [2058. Find the Minimum and Maximum Number of Nodes Between Critical Points](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README_EN.md) +- [2059. Minimum Operations to Convert Number](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README_EN.md) +- [2060. Check if an Original String Exists Given Two Encoded Strings](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README_EN.md) + +#### Biweekly Contest 64 + +- [2053. Kth Distinct String in an Array](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README_EN.md) +- [2054. Two Best Non-Overlapping Events](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README_EN.md) +- [2055. Plates Between Candles](/solution/2000-2099/2055.Plates%20Between%20Candles/README_EN.md) +- [2056. Number of Valid Move Combinations On Chessboard](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README_EN.md) + +#### Weekly Contest 264 + +- [2047. Number of Valid Words in a Sentence](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README_EN.md) +- [2048. Next Greater Numerically Balanced Number](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README_EN.md) +- [2049. Count Nodes With the Highest Score](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README_EN.md) +- [2050. Parallel Courses III](/solution/2000-2099/2050.Parallel%20Courses%20III/README_EN.md) + +#### Weekly Contest 263 + +- [2042. Check if Numbers Are Ascending in a Sentence](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README_EN.md) +- [2043. Simple Bank System](/solution/2000-2099/2043.Simple%20Bank%20System/README_EN.md) +- [2044. Count Number of Maximum Bitwise-OR Subsets](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README_EN.md) +- [2045. Second Minimum Time to Reach Destination](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README_EN.md) + +#### Biweekly Contest 63 + +- [2037. Minimum Number of Moves to Seat Everyone](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README_EN.md) +- [2038. Remove Colored Pieces if Both Neighbors are the Same Color](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README_EN.md) +- [2039. The Time When the Network Becomes Idle](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README_EN.md) +- [2040. Kth Smallest Product of Two Sorted Arrays](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README_EN.md) + +#### Weekly Contest 262 + +- [2032. Two Out of Three](/solution/2000-2099/2032.Two%20Out%20of%20Three/README_EN.md) +- [2033. Minimum Operations to Make a Uni-Value Grid](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README_EN.md) +- [2034. Stock Price Fluctuation](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README_EN.md) +- [2035. Partition Array Into Two Arrays to Minimize Sum Difference](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README_EN.md) + +#### Weekly Contest 261 + +- [2027. Minimum Moves to Convert String](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README_EN.md) +- [2028. Find Missing Observations](/solution/2000-2099/2028.Find%20Missing%20Observations/README_EN.md) +- [2029. Stone Game IX](/solution/2000-2099/2029.Stone%20Game%20IX/README_EN.md) +- [2030. Smallest K-Length Subsequence With Occurrences of a Letter](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README_EN.md) + +#### Biweekly Contest 62 + +- [2022. Convert 1D Array Into 2D Array](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README_EN.md) +- [2023. Number of Pairs of Strings With Concatenation Equal to Target](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README_EN.md) +- [2024. Maximize the Confusion of an Exam](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README_EN.md) +- [2025. Maximum Number of Ways to Partition an Array](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README_EN.md) + +#### Weekly Contest 260 + +- [2016. Maximum Difference Between Increasing Elements](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README_EN.md) +- [2017. Grid Game](/solution/2000-2099/2017.Grid%20Game/README_EN.md) +- [2018. Check if Word Can Be Placed In Crossword](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README_EN.md) +- [2019. The Score of Students Solving Math Expression](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README_EN.md) + +#### Weekly Contest 259 + +- [2011. Final Value of Variable After Performing Operations](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README_EN.md) +- [2012. Sum of Beauty in the Array](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README_EN.md) +- [2013. Detect Squares](/solution/2000-2099/2013.Detect%20Squares/README_EN.md) +- [2014. Longest Subsequence Repeated k Times](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README_EN.md) + +#### Biweekly Contest 61 + +- [2006. Count Number of Pairs With Absolute Difference K](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README_EN.md) +- [2007. Find Original Array From Doubled Array](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README_EN.md) +- [2008. Maximum Earnings From Taxi](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README_EN.md) +- [2009. Minimum Number of Operations to Make Array Continuous](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README_EN.md) + +#### Weekly Contest 258 + +- [2000. Reverse Prefix of Word](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README_EN.md) +- [2001. Number of Pairs of Interchangeable Rectangles](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README_EN.md) +- [2002. Maximum Product of the Length of Two Palindromic Subsequences](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README_EN.md) +- [2003. Smallest Missing Genetic Value in Each Subtree](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README_EN.md) + +#### Weekly Contest 257 + +- [1995. Count Special Quadruplets](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README_EN.md) +- [1996. The Number of Weak Characters in the Game](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README_EN.md) +- [1997. First Day Where You Have Been in All the Rooms](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README_EN.md) +- [1998. GCD Sort of an Array](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README_EN.md) + +#### Biweekly Contest 60 + +- [1991. Find the Middle Index in Array](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README_EN.md) +- [1992. Find All Groups of Farmland](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README_EN.md) +- [1993. Operations on Tree](/solution/1900-1999/1993.Operations%20on%20Tree/README_EN.md) +- [1994. The Number of Good Subsets](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README_EN.md) + +#### Weekly Contest 256 + +- [1984. Minimum Difference Between Highest and Lowest of K Scores](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README_EN.md) +- [1985. Find the Kth Largest Integer in the Array](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README_EN.md) +- [1986. Minimum Number of Work Sessions to Finish the Tasks](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README_EN.md) +- [1987. Number of Unique Good Subsequences](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README_EN.md) + +#### Weekly Contest 255 + +- [1979. Find Greatest Common Divisor of Array](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README_EN.md) +- [1980. Find Unique Binary String](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README_EN.md) +- [1981. Minimize the Difference Between Target and Chosen Elements](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README_EN.md) +- [1982. Find Array Given Subset Sums](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README_EN.md) + +#### Biweekly Contest 59 + +- [1974. Minimum Time to Type Word Using Special Typewriter](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README_EN.md) +- [1975. Maximum Matrix Sum](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README_EN.md) +- [1976. Number of Ways to Arrive at Destination](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README_EN.md) +- [1977. Number of Ways to Separate Numbers](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README_EN.md) + +#### Weekly Contest 254 + +- [1967. Number of Strings That Appear as Substrings in Word](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README_EN.md) +- [1968. Array With Elements Not Equal to Average of Neighbors](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README_EN.md) +- [1969. Minimum Non-Zero Product of the Array Elements](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README_EN.md) +- [1970. Last Day Where You Can Still Cross](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README_EN.md) + +#### Weekly Contest 253 + +- [1961. Check If String Is a Prefix of Array](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README_EN.md) +- [1962. Remove Stones to Minimize the Total](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README_EN.md) +- [1963. Minimum Number of Swaps to Make the String Balanced](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README_EN.md) +- [1964. Find the Longest Valid Obstacle Course at Each Position](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README_EN.md) + +#### Biweekly Contest 58 + +- [1957. Delete Characters to Make Fancy String](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README_EN.md) +- [1958. Check if Move is Legal](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README_EN.md) +- [1959. Minimum Total Space Wasted With K Resizing Operations](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README_EN.md) +- [1960. Maximum Product of the Length of Two Palindromic Substrings](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README_EN.md) + +#### Weekly Contest 252 + +- [1952. Three Divisors](/solution/1900-1999/1952.Three%20Divisors/README_EN.md) +- [1953. Maximum Number of Weeks for Which You Can Work](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README_EN.md) +- [1954. Minimum Garden Perimeter to Collect Enough Apples](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README_EN.md) +- [1955. Count Number of Special Subsequences](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README_EN.md) + +#### Weekly Contest 251 + +- [1945. Sum of Digits of String After Convert](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README_EN.md) +- [1946. Largest Number After Mutating Substring](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README_EN.md) +- [1947. Maximum Compatibility Score Sum](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README_EN.md) +- [1948. Delete Duplicate Folders in System](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README_EN.md) + +#### Biweekly Contest 57 + +- [1941. Check if All Characters Have Equal Number of Occurrences](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README_EN.md) +- [1942. The Number of the Smallest Unoccupied Chair](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README_EN.md) +- [1943. Describe the Painting](/solution/1900-1999/1943.Describe%20the%20Painting/README_EN.md) +- [1944. Number of Visible People in a Queue](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README_EN.md) + +#### Weekly Contest 250 + +- [1935. Maximum Number of Words You Can Type](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README_EN.md) +- [1936. Add Minimum Number of Rungs](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README_EN.md) +- [1937. Maximum Number of Points with Cost](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README_EN.md) +- [1938. Maximum Genetic Difference Query](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README_EN.md) + +#### Weekly Contest 249 + +- [1929. Concatenation of Array](/solution/1900-1999/1929.Concatenation%20of%20Array/README_EN.md) +- [1930. Unique Length-3 Palindromic Subsequences](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README_EN.md) +- [1931. Painting a Grid With Three Different Colors](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README_EN.md) +- [1932. Merge BSTs to Create Single BST](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README_EN.md) + +#### Biweekly Contest 56 + +- [1925. Count Square Sum Triples](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README_EN.md) +- [1926. Nearest Exit from Entrance in Maze](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README_EN.md) +- [1927. Sum Game](/solution/1900-1999/1927.Sum%20Game/README_EN.md) +- [1928. Minimum Cost to Reach Destination in Time](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README_EN.md) + +#### Weekly Contest 248 + +- [1920. Build Array from Permutation](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README_EN.md) +- [1921. Eliminate Maximum Number of Monsters](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README_EN.md) +- [1922. Count Good Numbers](/solution/1900-1999/1922.Count%20Good%20Numbers/README_EN.md) +- [1923. Longest Common Subpath](/solution/1900-1999/1923.Longest%20Common%20Subpath/README_EN.md) + +#### Weekly Contest 247 + +- [1913. Maximum Product Difference Between Two Pairs](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README_EN.md) +- [1914. Cyclically Rotating a Grid](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README_EN.md) +- [1915. Number of Wonderful Substrings](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README_EN.md) +- [1916. Count Ways to Build Rooms in an Ant Colony](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README_EN.md) + +#### Biweekly Contest 55 + +- [1909. Remove One Element to Make the Array Strictly Increasing](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README_EN.md) +- [1910. Remove All Occurrences of a Substring](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README_EN.md) +- [1911. Maximum Alternating Subsequence Sum](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README_EN.md) +- [1912. Design Movie Rental System](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README_EN.md) + +#### Weekly Contest 246 + +- [1903. Largest Odd Number in String](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README_EN.md) +- [1904. The Number of Full Rounds You Have Played](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README_EN.md) +- [1905. Count Sub Islands](/solution/1900-1999/1905.Count%20Sub%20Islands/README_EN.md) +- [1906. Minimum Absolute Difference Queries](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README_EN.md) + +#### Weekly Contest 245 + +- [1897. Redistribute Characters to Make All Strings Equal](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README_EN.md) +- [1898. Maximum Number of Removable Characters](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README_EN.md) +- [1899. Merge Triplets to Form Target Triplet](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README_EN.md) +- [1900. The Earliest and Latest Rounds Where Players Compete](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README_EN.md) + +#### Biweekly Contest 54 + +- [1893. Check if All the Integers in a Range Are Covered](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README_EN.md) +- [1894. Find the Student that Will Replace the Chalk](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README_EN.md) +- [1895. Largest Magic Square](/solution/1800-1899/1895.Largest%20Magic%20Square/README_EN.md) +- [1896. Minimum Cost to Change the Final Value of Expression](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README_EN.md) + +#### Weekly Contest 244 + +- [1886. Determine Whether Matrix Can Be Obtained By Rotation](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README_EN.md) +- [1887. Reduction Operations to Make the Array Elements Equal](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README_EN.md) +- [1888. Minimum Number of Flips to Make the Binary String Alternating](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md) +- [1889. Minimum Space Wasted From Packaging](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README_EN.md) + +#### Weekly Contest 243 + +- [1880. Check if Word Equals Summation of Two Words](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README_EN.md) +- [1881. Maximum Value after Insertion](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README_EN.md) +- [1882. Process Tasks Using Servers](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README_EN.md) +- [1883. Minimum Skips to Arrive at Meeting On Time](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README_EN.md) + +#### Biweekly Contest 53 + +- [1876. Substrings of Size Three with Distinct Characters](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README_EN.md) +- [1877. Minimize Maximum Pair Sum in Array](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README_EN.md) +- [1878. Get Biggest Three Rhombus Sums in a Grid](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README_EN.md) +- [1879. Minimum XOR Sum of Two Arrays](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README_EN.md) + +#### Weekly Contest 242 + +- [1869. Longer Contiguous Segments of Ones than Zeros](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README_EN.md) +- [1870. Minimum Speed to Arrive on Time](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README_EN.md) +- [1871. Jump Game VII](/solution/1800-1899/1871.Jump%20Game%20VII/README_EN.md) +- [1872. Stone Game VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README_EN.md) + +#### Weekly Contest 241 + +- [1863. Sum of All Subset XOR Totals](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README_EN.md) +- [1864. Minimum Number of Swaps to Make the Binary String Alternating](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md) +- [1865. Finding Pairs With a Certain Sum](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README_EN.md) +- [1866. Number of Ways to Rearrange Sticks With K Sticks Visible](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README_EN.md) + +#### Biweekly Contest 52 + +- [1859. Sorting the Sentence](/solution/1800-1899/1859.Sorting%20the%20Sentence/README_EN.md) +- [1860. Incremental Memory Leak](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README_EN.md) +- [1861. Rotating the Box](/solution/1800-1899/1861.Rotating%20the%20Box/README_EN.md) +- [1862. Sum of Floored Pairs](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README_EN.md) + +#### Weekly Contest 240 + +- [1854. Maximum Population Year](/solution/1800-1899/1854.Maximum%20Population%20Year/README_EN.md) +- [1855. Maximum Distance Between a Pair of Values](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README_EN.md) +- [1856. Maximum Subarray Min-Product](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README_EN.md) +- [1857. Largest Color Value in a Directed Graph](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README_EN.md) + +#### Weekly Contest 239 + +- [1848. Minimum Distance to the Target Element](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README_EN.md) +- [1849. Splitting a String Into Descending Consecutive Values](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README_EN.md) +- [1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README_EN.md) +- [1851. Minimum Interval to Include Each Query](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README_EN.md) + +#### Biweekly Contest 51 + +- [1844. Replace All Digits with Characters](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README_EN.md) +- [1845. Seat Reservation Manager](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README_EN.md) +- [1846. Maximum Element After Decreasing and Rearranging](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README_EN.md) +- [1847. Closest Room](/solution/1800-1899/1847.Closest%20Room/README_EN.md) + +#### Weekly Contest 238 + +- [1837. Sum of Digits in Base K](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README_EN.md) +- [1838. Frequency of the Most Frequent Element](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README_EN.md) +- [1839. Longest Substring Of All Vowels in Order](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README_EN.md) +- [1840. Maximum Building Height](/solution/1800-1899/1840.Maximum%20Building%20Height/README_EN.md) + +#### Weekly Contest 237 + +- [1832. Check if the Sentence Is Pangram](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README_EN.md) +- [1833. Maximum Ice Cream Bars](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README_EN.md) +- [1834. Single-Threaded CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README_EN.md) +- [1835. Find XOR Sum of All Pairs Bitwise AND](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README_EN.md) + +#### Biweekly Contest 50 + +- [1827. Minimum Operations to Make the Array Increasing](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README_EN.md) +- [1828. Queries on Number of Points Inside a Circle](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README_EN.md) +- [1829. Maximum XOR for Each Query](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README_EN.md) +- [1830. Minimum Number of Operations to Make String Sorted](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README_EN.md) + +#### Weekly Contest 236 + +- [1822. Sign of the Product of an Array](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README_EN.md) +- [1823. Find the Winner of the Circular Game](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README_EN.md) +- [1824. Minimum Sideway Jumps](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README_EN.md) +- [1825. Finding MK Average](/solution/1800-1899/1825.Finding%20MK%20Average/README_EN.md) + +#### Weekly Contest 235 + +- [1816. Truncate Sentence](/solution/1800-1899/1816.Truncate%20Sentence/README_EN.md) +- [1817. Finding the Users Active Minutes](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README_EN.md) +- [1818. Minimum Absolute Sum Difference](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README_EN.md) +- [1819. Number of Different Subsequences GCDs](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README_EN.md) + +#### Biweekly Contest 49 + +- [1812. Determine Color of a Chessboard Square](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README_EN.md) +- [1813. Sentence Similarity III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README_EN.md) +- [1814. Count Nice Pairs in an Array](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README_EN.md) +- [1815. Maximum Number of Groups Getting Fresh Donuts](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README_EN.md) + +#### Weekly Contest 234 + +- [1805. Number of Different Integers in a String](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README_EN.md) +- [1806. Minimum Number of Operations to Reinitialize a Permutation](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README_EN.md) +- [1807. Evaluate the Bracket Pairs of a String](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README_EN.md) +- [1808. Maximize Number of Nice Divisors](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README_EN.md) + +#### Weekly Contest 233 + +- [1800. Maximum Ascending Subarray Sum](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README_EN.md) +- [1801. Number of Orders in the Backlog](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README_EN.md) +- [1802. Maximum Value at a Given Index in a Bounded Array](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README_EN.md) +- [1803. Count Pairs With XOR in a Range](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README_EN.md) + +#### Biweekly Contest 48 + +- [1796. Second Largest Digit in a String](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README_EN.md) +- [1797. Design Authentication Manager](/solution/1700-1799/1797.Design%20Authentication%20Manager/README_EN.md) +- [1798. Maximum Number of Consecutive Values You Can Make](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README_EN.md) +- [1799. Maximize Score After N Operations](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README_EN.md) + +#### Weekly Contest 232 + +- [1790. Check if One String Swap Can Make Strings Equal](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README_EN.md) +- [1791. Find Center of Star Graph](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README_EN.md) +- [1792. Maximum Average Pass Ratio](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README_EN.md) +- [1793. Maximum Score of a Good Subarray](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README_EN.md) + +#### Weekly Contest 231 + +- [1784. Check if Binary String Has at Most One Segment of Ones](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README_EN.md) +- [1785. Minimum Elements to Add to Form a Given Sum](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README_EN.md) +- [1786. Number of Restricted Paths From First to Last Node](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README_EN.md) +- [1787. Make the XOR of All Segments Equal to Zero](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README_EN.md) + +#### Biweekly Contest 47 + +- [1779. Find Nearest Point That Has the Same X or Y Coordinate](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README_EN.md) +- [1780. Check if Number is a Sum of Powers of Three](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README_EN.md) +- [1781. Sum of Beauty of All Substrings](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README_EN.md) +- [1782. Count Pairs Of Nodes](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README_EN.md) + +#### Weekly Contest 230 + +- [1773. Count Items Matching a Rule](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README_EN.md) +- [1774. Closest Dessert Cost](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README_EN.md) +- [1775. Equal Sum Arrays With Minimum Number of Operations](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README_EN.md) +- [1776. Car Fleet II](/solution/1700-1799/1776.Car%20Fleet%20II/README_EN.md) + +#### Weekly Contest 229 + +- [1768. Merge Strings Alternately](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README_EN.md) +- [1769. Minimum Number of Operations to Move All Balls to Each Box](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README_EN.md) +- [1770. Maximum Score from Performing Multiplication Operations](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README_EN.md) +- [1771. Maximize Palindrome Length From Subsequences](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README_EN.md) + +#### Biweekly Contest 46 + +- [1763. Longest Nice Substring](/solution/1700-1799/1763.Longest%20Nice%20Substring/README_EN.md) +- [1764. Form Array by Concatenating Subarrays of Another Array](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README_EN.md) +- [1765. Map of Highest Peak](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README_EN.md) +- [1766. Tree of Coprimes](/solution/1700-1799/1766.Tree%20of%20Coprimes/README_EN.md) + +#### Weekly Contest 228 + +- [1758. Minimum Changes To Make Alternating Binary String](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README_EN.md) +- [1759. Count Number of Homogenous Substrings](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README_EN.md) +- [1760. Minimum Limit of Balls in a Bag](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README_EN.md) +- [1761. Minimum Degree of a Connected Trio in a Graph](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README_EN.md) + +#### Weekly Contest 227 + +- [1752. Check if Array Is Sorted and Rotated](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README_EN.md) +- [1753. Maximum Score From Removing Stones](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README_EN.md) +- [1754. Largest Merge Of Two Strings](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README_EN.md) +- [1755. Closest Subsequence Sum](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README_EN.md) + +#### Biweekly Contest 45 + +- [1748. Sum of Unique Elements](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README_EN.md) +- [1749. Maximum Absolute Sum of Any Subarray](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README_EN.md) +- [1750. Minimum Length of String After Deleting Similar Ends](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README_EN.md) +- [1751. Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README_EN.md) + +#### Weekly Contest 226 + +- [1742. Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README_EN.md) +- [1743. Restore the Array From Adjacent Pairs](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README_EN.md) +- [1744. Can You Eat Your Favorite Candy on Your Favorite Day](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README_EN.md) +- [1745. Palindrome Partitioning IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README_EN.md) + +#### Weekly Contest 225 + +- [1736. Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README_EN.md) +- [1737. Change Minimum Characters to Satisfy One of Three Conditions](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README_EN.md) +- [1738. Find Kth Largest XOR Coordinate Value](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README_EN.md) +- [1739. Building Boxes](/solution/1700-1799/1739.Building%20Boxes/README_EN.md) + +#### Biweekly Contest 44 + +- [1732. Find the Highest Altitude](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README_EN.md) +- [1733. Minimum Number of People to Teach](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README_EN.md) +- [1734. Decode XORed Permutation](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README_EN.md) +- [1735. Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README_EN.md) + +#### Weekly Contest 224 + +- [1725. Number Of Rectangles That Can Form The Largest Square](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README_EN.md) +- [1726. Tuple with Same Product](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README_EN.md) +- [1727. Largest Submatrix With Rearrangements](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README_EN.md) +- [1728. Cat and Mouse II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README_EN.md) + +#### Weekly Contest 223 + +- [1720. Decode XORed Array](/solution/1700-1799/1720.Decode%20XORed%20Array/README_EN.md) +- [1721. Swapping Nodes in a Linked List](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README_EN.md) +- [1722. Minimize Hamming Distance After Swap Operations](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README_EN.md) +- [1723. Find Minimum Time to Finish All Jobs](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README_EN.md) + +#### Biweekly Contest 43 + +- [1716. Calculate Money in Leetcode Bank](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README_EN.md) +- [1717. Maximum Score From Removing Substrings](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README_EN.md) +- [1718. Construct the Lexicographically Largest Valid Sequence](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README_EN.md) +- [1719. Number Of Ways To Reconstruct A Tree](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README_EN.md) + +#### Weekly Contest 222 + +- [1710. Maximum Units on a Truck](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README_EN.md) +- [1711. Count Good Meals](/solution/1700-1799/1711.Count%20Good%20Meals/README_EN.md) +- [1712. Ways to Split Array Into Three Subarrays](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README_EN.md) +- [1713. Minimum Operations to Make a Subsequence](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README_EN.md) + +#### Weekly Contest 221 + +- [1704. Determine if String Halves Are Alike](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README_EN.md) +- [1705. Maximum Number of Eaten Apples](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README_EN.md) +- [1706. Where Will the Ball Fall](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README_EN.md) +- [1707. Maximum XOR With an Element From Array](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README_EN.md) + +#### Biweekly Contest 42 + +- [1700. Number of Students Unable to Eat Lunch](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README_EN.md) +- [1701. Average Waiting Time](/solution/1700-1799/1701.Average%20Waiting%20Time/README_EN.md) +- [1702. Maximum Binary String After Change](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README_EN.md) +- [1703. Minimum Adjacent Swaps for K Consecutive Ones](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README_EN.md) + +#### Weekly Contest 220 + +- [1694. Reformat Phone Number](/solution/1600-1699/1694.Reformat%20Phone%20Number/README_EN.md) +- [1695. Maximum Erasure Value](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README_EN.md) +- [1696. Jump Game VI](/solution/1600-1699/1696.Jump%20Game%20VI/README_EN.md) +- [1697. Checking Existence of Edge Length Limited Paths](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README_EN.md) + +#### Weekly Contest 219 + +- [1688. Count of Matches in Tournament](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README_EN.md) +- [1689. Partitioning Into Minimum Number Of Deci-Binary Numbers](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README_EN.md) +- [1690. Stone Game VII](/solution/1600-1699/1690.Stone%20Game%20VII/README_EN.md) +- [1691. Maximum Height by Stacking Cuboids](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README_EN.md) + +#### Biweekly Contest 41 + +- [1684. Count the Number of Consistent Strings](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README_EN.md) +- [1685. Sum of Absolute Differences in a Sorted Array](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README_EN.md) +- [1686. Stone Game VI](/solution/1600-1699/1686.Stone%20Game%20VI/README_EN.md) +- [1687. Delivering Boxes from Storage to Ports](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README_EN.md) + +#### Weekly Contest 218 + +- [1678. Goal Parser Interpretation](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README_EN.md) +- [1679. Max Number of K-Sum Pairs](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README_EN.md) +- [1680. Concatenation of Consecutive Binary Numbers](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README_EN.md) +- [1681. Minimum Incompatibility](/solution/1600-1699/1681.Minimum%20Incompatibility/README_EN.md) + +#### Weekly Contest 217 + +- [1672. Richest Customer Wealth](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README_EN.md) +- [1673. Find the Most Competitive Subsequence](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README_EN.md) +- [1674. Minimum Moves to Make Array Complementary](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README_EN.md) +- [1675. Minimize Deviation in Array](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README_EN.md) + +#### Biweekly Contest 40 + +- [1668. Maximum Repeating Substring](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README_EN.md) +- [1669. Merge In Between Linked Lists](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README_EN.md) +- [1670. Design Front Middle Back Queue](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README_EN.md) +- [1671. Minimum Number of Removals to Make Mountain Array](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README_EN.md) + +#### Weekly Contest 216 + +- [1662. Check If Two String Arrays are Equivalent](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README_EN.md) +- [1663. Smallest String With A Given Numeric Value](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README_EN.md) +- [1664. Ways to Make a Fair Array](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README_EN.md) +- [1665. Minimum Initial Energy to Finish Tasks](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README_EN.md) + +#### Weekly Contest 215 + +- [1656. Design an Ordered Stream](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README_EN.md) +- [1657. Determine if Two Strings Are Close](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README_EN.md) +- [1658. Minimum Operations to Reduce X to Zero](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README_EN.md) +- [1659. Maximize Grid Happiness](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README_EN.md) + +#### Biweekly Contest 39 + +- [1652. Defuse the Bomb](/solution/1600-1699/1652.Defuse%20the%20Bomb/README_EN.md) +- [1653. Minimum Deletions to Make String Balanced](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README_EN.md) +- [1654. Minimum Jumps to Reach Home](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README_EN.md) +- [1655. Distribute Repeating Integers](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README_EN.md) + +#### Weekly Contest 214 + +- [1646. Get Maximum in Generated Array](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README_EN.md) +- [1647. Minimum Deletions to Make Character Frequencies Unique](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README_EN.md) +- [1648. Sell Diminishing-Valued Colored Balls](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README_EN.md) +- [1649. Create Sorted Array through Instructions](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README_EN.md) + +#### Weekly Contest 213 + +- [1640. Check Array Formation Through Concatenation](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README_EN.md) +- [1641. Count Sorted Vowel Strings](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README_EN.md) +- [1642. Furthest Building You Can Reach](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README_EN.md) +- [1643. Kth Smallest Instructions](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README_EN.md) + +#### Biweekly Contest 38 + +- [1636. Sort Array by Increasing Frequency](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README_EN.md) +- [1637. Widest Vertical Area Between Two Points Containing No Points](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README_EN.md) +- [1638. Count Substrings That Differ by One Character](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README_EN.md) +- [1639. Number of Ways to Form a Target String Given a Dictionary](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README_EN.md) + +#### Weekly Contest 212 + +- [1629. Slowest Key](/solution/1600-1699/1629.Slowest%20Key/README_EN.md) +- [1630. Arithmetic Subarrays](/solution/1600-1699/1630.Arithmetic%20Subarrays/README_EN.md) +- [1631. Path With Minimum Effort](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README_EN.md) +- [1632. Rank Transform of a Matrix](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README_EN.md) + +#### Weekly Contest 211 + +- [1624. Largest Substring Between Two Equal Characters](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README_EN.md) +- [1625. Lexicographically Smallest String After Applying Operations](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README_EN.md) +- [1626. Best Team With No Conflicts](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README_EN.md) +- [1627. Graph Connectivity With Threshold](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README_EN.md) + +#### Biweekly Contest 37 + +- [1619. Mean of Array After Removing Some Elements](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README_EN.md) +- [1620. Coordinate With Maximum Network Quality](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README_EN.md) +- [1621. Number of Sets of K Non-Overlapping Line Segments](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README_EN.md) +- [1622. Fancy Sequence](/solution/1600-1699/1622.Fancy%20Sequence/README_EN.md) + +#### Weekly Contest 210 + +- [1614. Maximum Nesting Depth of the Parentheses](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README_EN.md) +- [1615. Maximal Network Rank](/solution/1600-1699/1615.Maximal%20Network%20Rank/README_EN.md) +- [1616. Split Two Strings to Make Palindrome](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README_EN.md) +- [1617. Count Subtrees With Max Distance Between Cities](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README_EN.md) + +#### Weekly Contest 209 + +- [1608. Special Array With X Elements Greater Than or Equal X](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README_EN.md) +- [1609. Even Odd Tree](/solution/1600-1699/1609.Even%20Odd%20Tree/README_EN.md) +- [1610. Maximum Number of Visible Points](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README_EN.md) +- [1611. Minimum One Bit Operations to Make Integers Zero](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README_EN.md) + +#### Biweekly Contest 36 + +- [1603. Design Parking System](/solution/1600-1699/1603.Design%20Parking%20System/README_EN.md) +- [1604. Alert Using Same Key-Card Three or More Times in a One Hour Period](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README_EN.md) +- [1605. Find Valid Matrix Given Row and Column Sums](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README_EN.md) +- [1606. Find Servers That Handled Most Number of Requests](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README_EN.md) + +#### Weekly Contest 208 + +- [1598. Crawler Log Folder](/solution/1500-1599/1598.Crawler%20Log%20Folder/README_EN.md) +- [1599. Maximum Profit of Operating a Centennial Wheel](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README_EN.md) +- [1600. Throne Inheritance](/solution/1600-1699/1600.Throne%20Inheritance/README_EN.md) +- [1601. Maximum Number of Achievable Transfer Requests](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README_EN.md) + +#### Weekly Contest 207 + +- [1592. Rearrange Spaces Between Words](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README_EN.md) +- [1593. Split a String Into the Max Number of Unique Substrings](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README_EN.md) +- [1594. Maximum Non Negative Product in a Matrix](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README_EN.md) +- [1595. Minimum Cost to Connect Two Groups of Points](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README_EN.md) + +#### Biweekly Contest 35 + +- [1588. Sum of All Odd Length Subarrays](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README_EN.md) +- [1589. Maximum Sum Obtained of Any Permutation](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README_EN.md) +- [1590. Make Sum Divisible by P](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README_EN.md) +- [1591. Strange Printer II](/solution/1500-1599/1591.Strange%20Printer%20II/README_EN.md) + +#### Weekly Contest 206 + +- [1582. Special Positions in a Binary Matrix](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README_EN.md) +- [1583. Count Unhappy Friends](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README_EN.md) +- [1584. Min Cost to Connect All Points](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README_EN.md) +- [1585. Check If String Is Transformable With Substring Sort Operations](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README_EN.md) + +#### Weekly Contest 205 + +- [1576. Replace All 's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md) +- [1577. Number of Ways Where Square of Number Is Equal to Product of Two Numbers](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README_EN.md) +- [1578. Minimum Time to Make Rope Colorful](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README_EN.md) +- [1579. Remove Max Number of Edges to Keep Graph Fully Traversable](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README_EN.md) + +#### Biweekly Contest 34 + +- [1572. Matrix Diagonal Sum](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README_EN.md) +- [1573. Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README_EN.md) +- [1574. Shortest Subarray to be Removed to Make Array Sorted](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README_EN.md) +- [1575. Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README_EN.md) + +#### Weekly Contest 204 + +- [1566. Detect Pattern of Length M Repeated K or More Times](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README_EN.md) +- [1567. Maximum Length of Subarray With Positive Product](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README_EN.md) +- [1568. Minimum Number of Days to Disconnect Island](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README_EN.md) +- [1569. Number of Ways to Reorder Array to Get Same BST](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README_EN.md) + +#### Weekly Contest 203 + +- [1560. Most Visited Sector in a Circular Track](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README_EN.md) +- [1561. Maximum Number of Coins You Can Get](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README_EN.md) +- [1562. Find Latest Group of Size M](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README_EN.md) +- [1563. Stone Game V](/solution/1500-1599/1563.Stone%20Game%20V/README_EN.md) + +#### Biweekly Contest 33 + +- [1556. Thousand Separator](/solution/1500-1599/1556.Thousand%20Separator/README_EN.md) +- [1557. Minimum Number of Vertices to Reach All Nodes](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README_EN.md) +- [1558. Minimum Numbers of Function Calls to Make Target Array](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README_EN.md) +- [1559. Detect Cycles in 2D Grid](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README_EN.md) + +#### Weekly Contest 202 + +- [1550. Three Consecutive Odds](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README_EN.md) +- [1551. Minimum Operations to Make Array Equal](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README_EN.md) +- [1552. Magnetic Force Between Two Balls](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README_EN.md) +- [1553. Minimum Number of Days to Eat N Oranges](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README_EN.md) + +#### Weekly Contest 201 + +- [1544. Make The String Great](/solution/1500-1599/1544.Make%20The%20String%20Great/README_EN.md) +- [1545. Find Kth Bit in Nth Binary String](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README_EN.md) +- [1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README_EN.md) +- [1547. Minimum Cost to Cut a Stick](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README_EN.md) + +#### Biweekly Contest 32 + +- [1539. Kth Missing Positive Number](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README_EN.md) +- [1540. Can Convert String in K Moves](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README_EN.md) +- [1541. Minimum Insertions to Balance a Parentheses String](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README_EN.md) +- [1542. Find Longest Awesome Substring](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README_EN.md) + +#### Weekly Contest 200 + +- [1534. Count Good Triplets](/solution/1500-1599/1534.Count%20Good%20Triplets/README_EN.md) +- [1535. Find the Winner of an Array Game](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README_EN.md) +- [1536. Minimum Swaps to Arrange a Binary Grid](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README_EN.md) +- [1537. Get the Maximum Score](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README_EN.md) + +#### Weekly Contest 199 + +- [1528. Shuffle String](/solution/1500-1599/1528.Shuffle%20String/README_EN.md) +- [1529. Minimum Suffix Flips](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README_EN.md) +- [1530. Number of Good Leaf Nodes Pairs](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README_EN.md) +- [1531. String Compression II](/solution/1500-1599/1531.String%20Compression%20II/README_EN.md) + +#### Biweekly Contest 31 + +- [1523. Count Odd Numbers in an Interval Range](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README_EN.md) +- [1524. Number of Sub-arrays With Odd Sum](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README_EN.md) +- [1525. Number of Good Ways to Split a String](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README_EN.md) +- [1526. Minimum Number of Increments on Subarrays to Form a Target Array](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README_EN.md) + +#### Weekly Contest 198 + +- [1518. Water Bottles](/solution/1500-1599/1518.Water%20Bottles/README_EN.md) +- [1519. Number of Nodes in the Sub-Tree With the Same Label](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README_EN.md) +- [1520. Maximum Number of Non-Overlapping Substrings](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README_EN.md) +- [1521. Find a Value of a Mysterious Function Closest to Target](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README_EN.md) + +#### Weekly Contest 197 + +- [1512. Number of Good Pairs](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README_EN.md) +- [1513. Number of Substrings With Only 1s](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README_EN.md) +- [1514. Path with Maximum Probability](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README_EN.md) +- [1515. Best Position for a Service Centre](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README_EN.md) + +#### Biweekly Contest 30 + +- [1507. Reformat Date](/solution/1500-1599/1507.Reformat%20Date/README_EN.md) +- [1508. Range Sum of Sorted Subarray Sums](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README_EN.md) +- [1509. Minimum Difference Between Largest and Smallest Value in Three Moves](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README_EN.md) +- [1510. Stone Game IV](/solution/1500-1599/1510.Stone%20Game%20IV/README_EN.md) + +#### Weekly Contest 196 + +- [1502. Can Make Arithmetic Progression From Sequence](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README_EN.md) +- [1503. Last Moment Before All Ants Fall Out of a Plank](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README_EN.md) +- [1504. Count Submatrices With All Ones](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README_EN.md) +- [1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README_EN.md) + +#### Weekly Contest 195 + +- [1496. Path Crossing](/solution/1400-1499/1496.Path%20Crossing/README_EN.md) +- [1497. Check If Array Pairs Are Divisible by k](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README_EN.md) +- [1498. Number of Subsequences That Satisfy the Given Sum Condition](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README_EN.md) +- [1499. Max Value of Equation](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README_EN.md) + +#### Biweekly Contest 29 + +- [1491. Average Salary Excluding the Minimum and Maximum Salary](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README_EN.md) +- [1492. The kth Factor of n](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README_EN.md) +- [1493. Longest Subarray of 1's After Deleting One Element](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README_EN.md) +- [1494. Parallel Courses II](/solution/1400-1499/1494.Parallel%20Courses%20II/README_EN.md) + +#### Weekly Contest 194 + +- [1486. XOR Operation in an Array](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README_EN.md) +- [1487. Making File Names Unique](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README_EN.md) +- [1488. Avoid Flood in The City](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README_EN.md) +- [1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README_EN.md) + +#### Weekly Contest 193 + +- [1480. Running Sum of 1d Array](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README_EN.md) +- [1481. Least Number of Unique Integers after K Removals](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README_EN.md) +- [1482. Minimum Number of Days to Make m Bouquets](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README_EN.md) +- [1483. Kth Ancestor of a Tree Node](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README_EN.md) + +#### Biweekly Contest 28 + +- [1475. Final Prices With a Special Discount in a Shop](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README_EN.md) +- [1476. Subrectangle Queries](/solution/1400-1499/1476.Subrectangle%20Queries/README_EN.md) +- [1477. Find Two Non-overlapping Sub-arrays Each With Target Sum](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README_EN.md) +- [1478. Allocate Mailboxes](/solution/1400-1499/1478.Allocate%20Mailboxes/README_EN.md) + +#### Weekly Contest 192 + +- [1470. Shuffle the Array](/solution/1400-1499/1470.Shuffle%20the%20Array/README_EN.md) +- [1471. The k Strongest Values in an Array](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README_EN.md) +- [1472. Design Browser History](/solution/1400-1499/1472.Design%20Browser%20History/README_EN.md) +- [1473. Paint House III](/solution/1400-1499/1473.Paint%20House%20III/README_EN.md) + +#### Weekly Contest 191 + +- [1464. Maximum Product of Two Elements in an Array](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README_EN.md) +- [1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README_EN.md) +- [1466. Reorder Routes to Make All Paths Lead to the City Zero](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README_EN.md) +- [1467. Probability of a Two Boxes Having The Same Number of Distinct Balls](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README_EN.md) + +#### Biweekly Contest 27 + +- [1460. Make Two Arrays Equal by Reversing Subarrays](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README_EN.md) +- [1461. Check If a String Contains All Binary Codes of Size K](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README_EN.md) +- [1462. Course Schedule IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README_EN.md) +- [1463. Cherry Pickup II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README_EN.md) + +#### Weekly Contest 190 + +- [1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README_EN.md) +- [1456. Maximum Number of Vowels in a Substring of Given Length](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README_EN.md) +- [1457. Pseudo-Palindromic Paths in a Binary Tree](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README_EN.md) +- [1458. Max Dot Product of Two Subsequences](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README_EN.md) + +#### Weekly Contest 189 + +- [1450. Number of Students Doing Homework at a Given Time](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README_EN.md) +- [1451. Rearrange Words in a Sentence](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README_EN.md) +- [1452. People Whose List of Favorite Companies Is Not a Subset of Another List](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README_EN.md) +- [1453. Maximum Number of Darts Inside of a Circular Dartboard](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README_EN.md) + +#### Biweekly Contest 26 + +- [1446. Consecutive Characters](/solution/1400-1499/1446.Consecutive%20Characters/README_EN.md) +- [1447. Simplified Fractions](/solution/1400-1499/1447.Simplified%20Fractions/README_EN.md) +- [1448. Count Good Nodes in Binary Tree](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README_EN.md) +- [1449. Form Largest Integer With Digits That Add up to Target](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README_EN.md) + +#### Weekly Contest 188 + +- [1441. Build an Array With Stack Operations](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README_EN.md) +- [1442. Count Triplets That Can Form Two Arrays of Equal XOR](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README_EN.md) +- [1443. Minimum Time to Collect All Apples in a Tree](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README_EN.md) +- [1444. Number of Ways of Cutting a Pizza](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README_EN.md) + +#### Weekly Contest 187 + +- [1436. Destination City](/solution/1400-1499/1436.Destination%20City/README_EN.md) +- [1437. Check If All 1's Are at Least Length K Places Away](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README_EN.md) +- [1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README_EN.md) +- [1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README_EN.md) + +#### Biweekly Contest 25 + +- [1431. Kids With the Greatest Number of Candies](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README_EN.md) +- [1432. Max Difference You Can Get From Changing an Integer](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README_EN.md) +- [1433. Check If a String Can Break Another String](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README_EN.md) +- [1434. Number of Ways to Wear Different Hats to Each Other](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README_EN.md) + +#### Weekly Contest 186 + +- [1422. Maximum Score After Splitting a String](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README_EN.md) +- [1423. Maximum Points You Can Obtain from Cards](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README_EN.md) +- [1424. Diagonal Traverse II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README_EN.md) +- [1425. Constrained Subsequence Sum](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README_EN.md) + +#### Weekly Contest 185 + +- [1417. Reformat The String](/solution/1400-1499/1417.Reformat%20The%20String/README_EN.md) +- [1418. Display Table of Food Orders in a Restaurant](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README_EN.md) +- [1419. Minimum Number of Frogs Croaking](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README_EN.md) +- [1420. Build Array Where You Can Find The Maximum Exactly K Comparisons](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README_EN.md) + +#### Biweekly Contest 24 + +- [1413. Minimum Value to Get Positive Step by Step Sum](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README_EN.md) +- [1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README_EN.md) +- [1415. The k-th Lexicographical String of All Happy Strings of Length n](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README_EN.md) +- [1416. Restore The Array](/solution/1400-1499/1416.Restore%20The%20Array/README_EN.md) + +#### Weekly Contest 184 + +- [1408. String Matching in an Array](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README_EN.md) +- [1409. Queries on a Permutation With Key](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README_EN.md) +- [1410. HTML Entity Parser](/solution/1400-1499/1410.HTML%20Entity%20Parser/README_EN.md) +- [1411. Number of Ways to Paint N × 3 Grid](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README_EN.md) + +#### Weekly Contest 183 + +- [1403. Minimum Subsequence in Non-Increasing Order](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README_EN.md) +- [1404. Number of Steps to Reduce a Number in Binary Representation to One](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README_EN.md) +- [1405. Longest Happy String](/solution/1400-1499/1405.Longest%20Happy%20String/README_EN.md) +- [1406. Stone Game III](/solution/1400-1499/1406.Stone%20Game%20III/README_EN.md) + +#### Biweekly Contest 23 + +- [1399. Count Largest Group](/solution/1300-1399/1399.Count%20Largest%20Group/README_EN.md) +- [1400. Construct K Palindrome Strings](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README_EN.md) +- [1401. Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README_EN.md) +- [1402. Reducing Dishes](/solution/1400-1499/1402.Reducing%20Dishes/README_EN.md) + +#### Weekly Contest 182 + +- [1394. Find Lucky Integer in an Array](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README_EN.md) +- [1395. Count Number of Teams](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README_EN.md) +- [1396. Design Underground System](/solution/1300-1399/1396.Design%20Underground%20System/README_EN.md) +- [1397. Find All Good Strings](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README_EN.md) + +#### Weekly Contest 181 + +- [1389. Create Target Array in the Given Order](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README_EN.md) +- [1390. Four Divisors](/solution/1300-1399/1390.Four%20Divisors/README_EN.md) +- [1391. Check if There is a Valid Path in a Grid](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README_EN.md) +- [1392. Longest Happy Prefix](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README_EN.md) + +#### Biweekly Contest 22 + +- [1385. Find the Distance Value Between Two Arrays](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README_EN.md) +- [1386. Cinema Seat Allocation](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README_EN.md) +- [1387. Sort Integers by The Power Value](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README_EN.md) +- [1388. Pizza With 3n Slices](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README_EN.md) + +#### Weekly Contest 180 + +- [1380. Lucky Numbers in a Matrix](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README_EN.md) +- [1381. Design a Stack With Increment Operation](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README_EN.md) +- [1382. Balance a Binary Search Tree](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README_EN.md) +- [1383. Maximum Performance of a Team](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README_EN.md) + +#### Weekly Contest 179 + +- [1374. Generate a String With Characters That Have Odd Counts](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README_EN.md) +- [1375. Number of Times Binary String Is Prefix-Aligned](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README_EN.md) +- [1376. Time Needed to Inform All Employees](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README_EN.md) +- [1377. Frog Position After T Seconds](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README_EN.md) + +#### Biweekly Contest 21 + +- [1370. Increasing Decreasing String](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README_EN.md) +- [1371. Find the Longest Substring Containing Vowels in Even Counts](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README_EN.md) +- [1372. Longest ZigZag Path in a Binary Tree](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README_EN.md) +- [1373. Maximum Sum BST in Binary Tree](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README_EN.md) + +#### Weekly Contest 178 + +- [1365. How Many Numbers Are Smaller Than the Current Number](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README_EN.md) +- [1366. Rank Teams by Votes](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README_EN.md) +- [1367. Linked List in Binary Tree](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README_EN.md) +- [1368. Minimum Cost to Make at Least One Valid Path in a Grid](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README_EN.md) + +#### Weekly Contest 177 + +- [1360. Number of Days Between Two Dates](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README_EN.md) +- [1361. Validate Binary Tree Nodes](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README_EN.md) +- [1362. Closest Divisors](/solution/1300-1399/1362.Closest%20Divisors/README_EN.md) +- [1363. Largest Multiple of Three](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README_EN.md) + +#### Biweekly Contest 20 + +- [1356. Sort Integers by The Number of 1 Bits](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README_EN.md) +- [1357. Apply Discount Every n Orders](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README_EN.md) +- [1358. Number of Substrings Containing All Three Characters](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README_EN.md) +- [1359. Count All Valid Pickup and Delivery Options](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README_EN.md) + +#### Weekly Contest 176 + +- [1351. Count Negative Numbers in a Sorted Matrix](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README_EN.md) +- [1352. Product of the Last K Numbers](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README_EN.md) +- [1353. Maximum Number of Events That Can Be Attended](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README_EN.md) +- [1354. Construct Target Array With Multiple Sums](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README_EN.md) + +#### Weekly Contest 175 + +- [1346. Check If N and Its Double Exist](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README_EN.md) +- [1347. Minimum Number of Steps to Make Two Strings Anagram](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README_EN.md) +- [1348. Tweet Counts Per Frequency](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README_EN.md) +- [1349. Maximum Students Taking Exam](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README_EN.md) + +#### Biweekly Contest 19 + +- [1342. Number of Steps to Reduce a Number to Zero](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README_EN.md) +- [1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README_EN.md) +- [1344. Angle Between Hands of a Clock](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README_EN.md) +- [1345. Jump Game IV](/solution/1300-1399/1345.Jump%20Game%20IV/README_EN.md) + +#### Weekly Contest 174 + +- [1337. The K Weakest Rows in a Matrix](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README_EN.md) +- [1338. Reduce Array Size to The Half](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README_EN.md) +- [1339. Maximum Product of Splitted Binary Tree](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README_EN.md) +- [1340. Jump Game V](/solution/1300-1399/1340.Jump%20Game%20V/README_EN.md) + +#### Weekly Contest 173 + +- [1332. Remove Palindromic Subsequences](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README_EN.md) +- [1333. Filter Restaurants by Vegan-Friendly, Price and Distance](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README_EN.md) +- [1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README_EN.md) +- [1335. Minimum Difficulty of a Job Schedule](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README_EN.md) + +#### Biweekly Contest 18 + +- [1331. Rank Transform of an Array](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README_EN.md) +- [1328. Break a Palindrome](/solution/1300-1399/1328.Break%20a%20Palindrome/README_EN.md) +- [1329. Sort the Matrix Diagonally](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README_EN.md) +- [1330. Reverse Subarray To Maximize Array Value](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README_EN.md) + +#### Weekly Contest 172 + +- [1323. Maximum 69 Number](/solution/1300-1399/1323.Maximum%2069%20Number/README_EN.md) +- [1324. Print Words Vertically](/solution/1300-1399/1324.Print%20Words%20Vertically/README_EN.md) +- [1325. Delete Leaves With a Given Value](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README_EN.md) +- [1326. Minimum Number of Taps to Open to Water a Garden](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README_EN.md) + +#### Weekly Contest 171 + +- [1317. Convert Integer to the Sum of Two No-Zero Integers](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README_EN.md) +- [1318. Minimum Flips to Make a OR b Equal to c](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README_EN.md) +- [1319. Number of Operations to Make Network Connected](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README_EN.md) +- [1320. Minimum Distance to Type a Word Using Two Fingers](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README_EN.md) + +#### Biweekly Contest 17 + +- [1313. Decompress Run-Length Encoded List](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README_EN.md) +- [1314. Matrix Block Sum](/solution/1300-1399/1314.Matrix%20Block%20Sum/README_EN.md) +- [1315. Sum of Nodes with Even-Valued Grandparent](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README_EN.md) +- [1316. Distinct Echo Substrings](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README_EN.md) + +#### Weekly Contest 170 + +- [1309. Decrypt String from Alphabet to Integer Mapping](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README_EN.md) +- [1310. XOR Queries of a Subarray](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README_EN.md) +- [1311. Get Watched Videos by Your Friends](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README_EN.md) +- [1312. Minimum Insertion Steps to Make a String Palindrome](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README_EN.md) + +#### Weekly Contest 169 + +- [1304. Find N Unique Integers Sum up to Zero](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README_EN.md) +- [1305. All Elements in Two Binary Search Trees](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README_EN.md) +- [1306. Jump Game III](/solution/1300-1399/1306.Jump%20Game%20III/README_EN.md) +- [1307. Verbal Arithmetic Puzzle](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README_EN.md) + +#### Biweekly Contest 16 + +- [1299. Replace Elements with Greatest Element on Right Side](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README_EN.md) +- [1300. Sum of Mutated Array Closest to Target](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README_EN.md) +- [1302. Deepest Leaves Sum](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README_EN.md) +- [1301. Number of Paths with Max Score](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README_EN.md) + +#### Weekly Contest 168 + +- [1295. Find Numbers with Even Number of Digits](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README_EN.md) +- [1296. Divide Array in Sets of K Consecutive Numbers](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README_EN.md) +- [1297. Maximum Number of Occurrences of a Substring](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README_EN.md) +- [1298. Maximum Candies You Can Get from Boxes](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README_EN.md) + +#### Weekly Contest 167 + +- [1290. Convert Binary Number in a Linked List to Integer](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README_EN.md) +- [1291. Sequential Digits](/solution/1200-1299/1291.Sequential%20Digits/README_EN.md) +- [1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README_EN.md) +- [1293. Shortest Path in a Grid with Obstacles Elimination](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README_EN.md) + +#### Biweekly Contest 15 + +- [1287. Element Appearing More Than 25% In Sorted Array](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README_EN.md) +- [1288. Remove Covered Intervals](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README_EN.md) +- [1286. Iterator for Combination](/solution/1200-1299/1286.Iterator%20for%20Combination/README_EN.md) +- [1289. Minimum Falling Path Sum II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README_EN.md) + +#### Weekly Contest 166 + +- [1281. Subtract the Product and Sum of Digits of an Integer](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README_EN.md) +- [1282. Group the People Given the Group Size They Belong To](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README_EN.md) +- [1283. Find the Smallest Divisor Given a Threshold](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README_EN.md) +- [1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README_EN.md) + +#### Weekly Contest 165 + +- [1275. Find Winner on a Tic Tac Toe Game](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README_EN.md) +- [1276. Number of Burgers with No Waste of Ingredients](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README_EN.md) +- [1277. Count Square Submatrices with All Ones](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README_EN.md) +- [1278. Palindrome Partitioning III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README_EN.md) + +#### Biweekly Contest 14 + +- [1271. Hexspeak](/solution/1200-1299/1271.Hexspeak/README_EN.md) +- [1272. Remove Interval](/solution/1200-1299/1272.Remove%20Interval/README_EN.md) +- [1273. Delete Tree Nodes](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README_EN.md) +- [1274. Number of Ships in a Rectangle](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README_EN.md) + +#### Weekly Contest 164 + +- [1266. Minimum Time Visiting All Points](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README_EN.md) +- [1267. Count Servers that Communicate](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README_EN.md) +- [1268. Search Suggestions System](/solution/1200-1299/1268.Search%20Suggestions%20System/README_EN.md) +- [1269. Number of Ways to Stay in the Same Place After Some Steps](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README_EN.md) + +#### Weekly Contest 163 + +- [1260. Shift 2D Grid](/solution/1200-1299/1260.Shift%202D%20Grid/README_EN.md) +- [1261. Find Elements in a Contaminated Binary Tree](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README_EN.md) +- [1262. Greatest Sum Divisible by Three](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README_EN.md) +- [1263. Minimum Moves to Move a Box to Their Target Location](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README_EN.md) + +#### Biweekly Contest 13 + +- [1256. Encode Number](/solution/1200-1299/1256.Encode%20Number/README_EN.md) +- [1257. Smallest Common Region](/solution/1200-1299/1257.Smallest%20Common%20Region/README_EN.md) +- [1258. Synonymous Sentences](/solution/1200-1299/1258.Synonymous%20Sentences/README_EN.md) +- [1259. Handshakes That Don't Cross](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README_EN.md) + +#### Weekly Contest 162 + +- [1252. Cells with Odd Values in a Matrix](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README_EN.md) +- [1253. Reconstruct a 2-Row Binary Matrix](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README_EN.md) +- [1254. Number of Closed Islands](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README_EN.md) +- [1255. Maximum Score Words Formed by Letters](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README_EN.md) + +#### Weekly Contest 161 + +- [1247. Minimum Swaps to Make Strings Equal](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README_EN.md) +- [1248. Count Number of Nice Subarrays](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README_EN.md) +- [1249. Minimum Remove to Make Valid Parentheses](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README_EN.md) +- [1250. Check If It Is a Good Array](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README_EN.md) + +#### Biweekly Contest 12 + +- [1244. Design A Leaderboard](/solution/1200-1299/1244.Design%20A%20Leaderboard/README_EN.md) +- [1243. Array Transformation](/solution/1200-1299/1243.Array%20Transformation/README_EN.md) +- [1245. Tree Diameter](/solution/1200-1299/1245.Tree%20Diameter/README_EN.md) +- [1246. Palindrome Removal](/solution/1200-1299/1246.Palindrome%20Removal/README_EN.md) + +#### Weekly Contest 160 + +- [1237. Find Positive Integer Solution for a Given Equation](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README_EN.md) +- [1238. Circular Permutation in Binary Representation](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README_EN.md) +- [1239. Maximum Length of a Concatenated String with Unique Characters](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README_EN.md) +- [1240. Tiling a Rectangle with the Fewest Squares](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README_EN.md) + +#### Weekly Contest 159 + +- [1232. Check If It Is a Straight Line](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README_EN.md) +- [1233. Remove Sub-Folders from the Filesystem](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README_EN.md) +- [1234. Replace the Substring for Balanced String](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README_EN.md) +- [1235. Maximum Profit in Job Scheduling](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README_EN.md) + +#### Biweekly Contest 11 + +- [1228. Missing Number In Arithmetic Progression](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README_EN.md) +- [1229. Meeting Scheduler](/solution/1200-1299/1229.Meeting%20Scheduler/README_EN.md) +- [1230. Toss Strange Coins](/solution/1200-1299/1230.Toss%20Strange%20Coins/README_EN.md) +- [1231. Divide Chocolate](/solution/1200-1299/1231.Divide%20Chocolate/README_EN.md) + +#### Weekly Contest 158 + +- [1221. Split a String in Balanced Strings](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README_EN.md) +- [1222. Queens That Can Attack the King](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README_EN.md) +- [1223. Dice Roll Simulation](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README_EN.md) +- [1224. Maximum Equal Frequency](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README_EN.md) + +#### Weekly Contest 157 + +- [1217. Minimum Cost to Move Chips to The Same Position](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README_EN.md) +- [1218. Longest Arithmetic Subsequence of Given Difference](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README_EN.md) +- [1219. Path with Maximum Gold](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README_EN.md) +- [1220. Count Vowels Permutation](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README_EN.md) + +#### Biweekly Contest 10 + +- [1213. Intersection of Three Sorted Arrays](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README_EN.md) +- [1214. Two Sum BSTs](/solution/1200-1299/1214.Two%20Sum%20BSTs/README_EN.md) +- [1215. Stepping Numbers](/solution/1200-1299/1215.Stepping%20Numbers/README_EN.md) +- [1216. Valid Palindrome III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README_EN.md) + +#### Weekly Contest 156 + +- [1207. Unique Number of Occurrences](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README_EN.md) +- [1208. Get Equal Substrings Within Budget](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README_EN.md) +- [1209. Remove All Adjacent Duplicates in String II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README_EN.md) +- [1210. Minimum Moves to Reach Target with Rotations](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README_EN.md) + +#### Weekly Contest 155 + +- [1200. Minimum Absolute Difference](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README_EN.md) +- [1201. Ugly Number III](/solution/1200-1299/1201.Ugly%20Number%20III/README_EN.md) +- [1202. Smallest String With Swaps](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README_EN.md) +- [1203. Sort Items by Groups Respecting Dependencies](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README_EN.md) + +#### Biweekly Contest 9 + +- [1196. How Many Apples Can You Put into the Basket](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README_EN.md) +- [1197. Minimum Knight Moves](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README_EN.md) +- [1198. Find Smallest Common Element in All Rows](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README_EN.md) +- [1199. Minimum Time to Build Blocks](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README_EN.md) + +#### Weekly Contest 154 + +- [1189. Maximum Number of Balloons](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README_EN.md) +- [1190. Reverse Substrings Between Each Pair of Parentheses](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README_EN.md) +- [1191. K-Concatenation Maximum Sum](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README_EN.md) +- [1192. Critical Connections in a Network](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README_EN.md) + +#### Weekly Contest 153 + +- [1184. Distance Between Bus Stops](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README_EN.md) +- [1185. Day of the Week](/solution/1100-1199/1185.Day%20of%20the%20Week/README_EN.md) +- [1186. Maximum Subarray Sum with One Deletion](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README_EN.md) +- [1187. Make Array Strictly Increasing](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README_EN.md) + +#### Biweekly Contest 8 + +- [1180. Count Substrings with Only One Distinct Letter](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README_EN.md) +- [1181. Before and After Puzzle](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README_EN.md) +- [1182. Shortest Distance to Target Color](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README_EN.md) +- [1183. Maximum Number of Ones](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README_EN.md) + +#### Weekly Contest 152 + +- [1175. Prime Arrangements](/solution/1100-1199/1175.Prime%20Arrangements/README_EN.md) +- [1176. Diet Plan Performance](/solution/1100-1199/1176.Diet%20Plan%20Performance/README_EN.md) +- [1177. Can Make Palindrome from Substring](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README_EN.md) +- [1178. Number of Valid Words for Each Puzzle](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README_EN.md) + +#### Weekly Contest 151 + +- [1169. Invalid Transactions](/solution/1100-1199/1169.Invalid%20Transactions/README_EN.md) +- [1170. Compare Strings by Frequency of the Smallest Character](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README_EN.md) +- [1171. Remove Zero Sum Consecutive Nodes from Linked List](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README_EN.md) +- [1172. Dinner Plate Stacks](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README_EN.md) + +#### Biweekly Contest 7 + +- [1165. Single-Row Keyboard](/solution/1100-1199/1165.Single-Row%20Keyboard/README_EN.md) +- [1166. Design File System](/solution/1100-1199/1166.Design%20File%20System/README_EN.md) +- [1167. Minimum Cost to Connect Sticks](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README_EN.md) +- [1168. Optimize Water Distribution in a Village](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README_EN.md) + +#### Weekly Contest 150 + +- [1160. Find Words That Can Be Formed by Characters](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README_EN.md) +- [1161. Maximum Level Sum of a Binary Tree](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README_EN.md) +- [1162. As Far from Land as Possible](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README_EN.md) +- [1163. Last Substring in Lexicographical Order](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README_EN.md) + +#### Weekly Contest 149 + +- [1154. Day of the Year](/solution/1100-1199/1154.Day%20of%20the%20Year/README_EN.md) +- [1155. Number of Dice Rolls With Target Sum](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README_EN.md) +- [1156. Swap For Longest Repeated Character Substring](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README_EN.md) +- [1157. Online Majority Element In Subarray](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README_EN.md) + +#### Biweekly Contest 6 + +- [1150. Check If a Number Is Majority Element in a Sorted Array](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README_EN.md) +- [1151. Minimum Swaps to Group All 1's Together](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README_EN.md) +- [1152. Analyze User Website Visit Pattern](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README_EN.md) +- [1153. String Transforms Into Another String](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README_EN.md) + +#### Weekly Contest 148 + +- [1144. Decrease Elements To Make Array Zigzag](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README_EN.md) +- [1145. Binary Tree Coloring Game](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README_EN.md) +- [1146. Snapshot Array](/solution/1100-1199/1146.Snapshot%20Array/README_EN.md) +- [1147. Longest Chunked Palindrome Decomposition](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README_EN.md) + +#### Weekly Contest 147 + +- [1137. N-th Tribonacci Number](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README_EN.md) +- [1138. Alphabet Board Path](/solution/1100-1199/1138.Alphabet%20Board%20Path/README_EN.md) +- [1139. Largest 1-Bordered Square](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README_EN.md) +- [1140. Stone Game II](/solution/1100-1199/1140.Stone%20Game%20II/README_EN.md) + +#### Biweekly Contest 5 + +- [1133. Largest Unique Number](/solution/1100-1199/1133.Largest%20Unique%20Number/README_EN.md) +- [1134. Armstrong Number](/solution/1100-1199/1134.Armstrong%20Number/README_EN.md) +- [1135. Connecting Cities With Minimum Cost](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README_EN.md) +- [1136. Parallel Courses](/solution/1100-1199/1136.Parallel%20Courses/README_EN.md) + +#### Weekly Contest 146 + +- [1128. Number of Equivalent Domino Pairs](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README_EN.md) +- [1129. Shortest Path with Alternating Colors](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README_EN.md) +- [1130. Minimum Cost Tree From Leaf Values](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README_EN.md) +- [1131. Maximum of Absolute Value Expression](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README_EN.md) + +#### Weekly Contest 145 + +- [1122. Relative Sort Array](/solution/1100-1199/1122.Relative%20Sort%20Array/README_EN.md) +- [1123. Lowest Common Ancestor of Deepest Leaves](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README_EN.md) +- [1124. Longest Well-Performing Interval](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README_EN.md) +- [1125. Smallest Sufficient Team](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README_EN.md) + +#### Biweekly Contest 4 + +- [1118. Number of Days in a Month](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README_EN.md) +- [1119. Remove Vowels from a String](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README_EN.md) +- [1120. Maximum Average Subtree](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README_EN.md) +- [1121. Divide Array Into Increasing Sequences](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README_EN.md) + +#### Weekly Contest 144 + +- [1108. Defanging an IP Address](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README_EN.md) +- [1109. Corporate Flight Bookings](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README_EN.md) +- [1110. Delete Nodes And Return Forest](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README_EN.md) +- [1111. Maximum Nesting Depth of Two Valid Parentheses Strings](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README_EN.md) + +#### Weekly Contest 143 + +- [1103. Distribute Candies to People](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README_EN.md) +- [1104. Path In Zigzag Labelled Binary Tree](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README_EN.md) +- [1105. Filling Bookcase Shelves](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README_EN.md) +- [1106. Parsing A Boolean Expression](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README_EN.md) + +#### Biweekly Contest 3 + +- [1099. Two Sum Less Than K](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README_EN.md) +- [1100. Find K-Length Substrings With No Repeated Characters](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README_EN.md) +- [1101. The Earliest Moment When Everyone Become Friends](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README_EN.md) +- [1102. Path With Maximum Minimum Value](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README_EN.md) + +#### Weekly Contest 142 + +- [1093. Statistics from a Large Sample](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README_EN.md) +- [1094. Car Pooling](/solution/1000-1099/1094.Car%20Pooling/README_EN.md) +- [1095. Find in Mountain Array](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README_EN.md) +- [1096. Brace Expansion II](/solution/1000-1099/1096.Brace%20Expansion%20II/README_EN.md) + +#### Weekly Contest 141 + +- [1089. Duplicate Zeros](/solution/1000-1099/1089.Duplicate%20Zeros/README_EN.md) +- [1090. Largest Values From Labels](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README_EN.md) +- [1091. Shortest Path in Binary Matrix](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README_EN.md) +- [1092. Shortest Common Supersequence](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README_EN.md) + +#### Biweekly Contest 2 + +- [1085. Sum of Digits in the Minimum Number](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README_EN.md) +- [1086. High Five](/solution/1000-1099/1086.High%20Five/README_EN.md) +- [1087. Brace Expansion](/solution/1000-1099/1087.Brace%20Expansion/README_EN.md) +- [1088. Confusing Number II](/solution/1000-1099/1088.Confusing%20Number%20II/README_EN.md) + +#### Weekly Contest 140 + +- [1078. Occurrences After Bigram](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README_EN.md) +- [1079. Letter Tile Possibilities](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README_EN.md) +- [1080. Insufficient Nodes in Root to Leaf Paths](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README_EN.md) +- [1081. Smallest Subsequence of Distinct Characters](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README_EN.md) + +#### Weekly Contest 139 + +- [1071. Greatest Common Divisor of Strings](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README_EN.md) +- [1072. Flip Columns For Maximum Number of Equal Rows](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README_EN.md) +- [1073. Adding Two Negabinary Numbers](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README_EN.md) +- [1074. Number of Submatrices That Sum to Target](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README_EN.md) + +#### Biweekly Contest 1 + +- [1064. Fixed Point](/solution/1000-1099/1064.Fixed%20Point/README_EN.md) +- [1065. Index Pairs of a String](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README_EN.md) +- [1066. Campus Bikes II](/solution/1000-1099/1066.Campus%20Bikes%20II/README_EN.md) +- [1067. Digit Count in Range](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README_EN.md) + +#### Weekly Contest 138 + +- [1051. Height Checker](/solution/1000-1099/1051.Height%20Checker/README_EN.md) +- [1052. Grumpy Bookstore Owner](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README_EN.md) +- [1053. Previous Permutation With One Swap](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README_EN.md) +- [1054. Distant Barcodes](/solution/1000-1099/1054.Distant%20Barcodes/README_EN.md) + +#### Weekly Contest 137 + +- [1046. Last Stone Weight](/solution/1000-1099/1046.Last%20Stone%20Weight/README_EN.md) +- [1047. Remove All Adjacent Duplicates In String](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README_EN.md) +- [1048. Longest String Chain](/solution/1000-1099/1048.Longest%20String%20Chain/README_EN.md) +- [1049. Last Stone Weight II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README_EN.md) + +#### Weekly Contest 136 + +- [1041. Robot Bounded In Circle](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README_EN.md) +- [1042. Flower Planting With No Adjacent](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README_EN.md) +- [1043. Partition Array for Maximum Sum](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README_EN.md) +- [1044. Longest Duplicate Substring](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README_EN.md) + +#### Weekly Contest 135 + +- [1037. Valid Boomerang](/solution/1000-1099/1037.Valid%20Boomerang/README_EN.md) +- [1038. Binary Search Tree to Greater Sum Tree](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README_EN.md) +- [1039. Minimum Score Triangulation of Polygon](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README_EN.md) +- [1040. Moving Stones Until Consecutive II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README_EN.md) + +#### Weekly Contest 134 + +- [1033. Moving Stones Until Consecutive](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README_EN.md) +- [1034. Coloring A Border](/solution/1000-1099/1034.Coloring%20A%20Border/README_EN.md) +- [1035. Uncrossed Lines](/solution/1000-1099/1035.Uncrossed%20Lines/README_EN.md) +- [1036. Escape a Large Maze](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README_EN.md) + +#### Weekly Contest 133 + +- [1029. Two City Scheduling](/solution/1000-1099/1029.Two%20City%20Scheduling/README_EN.md) +- [1030. Matrix Cells in Distance Order](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README_EN.md) +- [1031. Maximum Sum of Two Non-Overlapping Subarrays](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README_EN.md) +- [1032. Stream of Characters](/solution/1000-1099/1032.Stream%20of%20Characters/README_EN.md) + +#### Weekly Contest 132 + +- [1025. Divisor Game](/solution/1000-1099/1025.Divisor%20Game/README_EN.md) +- [1026. Maximum Difference Between Node and Ancestor](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README_EN.md) +- [1027. Longest Arithmetic Subsequence](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README_EN.md) +- [1028. Recover a Tree From Preorder Traversal](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README_EN.md) + +#### Weekly Contest 131 + +- [1021. Remove Outermost Parentheses](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README_EN.md) +- [1022. Sum of Root To Leaf Binary Numbers](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README_EN.md) +- [1023. Camelcase Matching](/solution/1000-1099/1023.Camelcase%20Matching/README_EN.md) +- [1024. Video Stitching](/solution/1000-1099/1024.Video%20Stitching/README_EN.md) + +#### Weekly Contest 130 + +- [1018. Binary Prefix Divisible By 5](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README_EN.md) +- [1017. Convert to Base -2](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README_EN.md) +- [1019. Next Greater Node In Linked List](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README_EN.md) +- [1020. Number of Enclaves](/solution/1000-1099/1020.Number%20of%20Enclaves/README_EN.md) + +#### Weekly Contest 129 + +- [1013. Partition Array Into Three Parts With Equal Sum](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README_EN.md) +- [1015. Smallest Integer Divisible by K](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README_EN.md) +- [1014. Best Sightseeing Pair](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README_EN.md) +- [1016. Binary String With Substrings Representing 1 To N](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README_EN.md) + +#### Weekly Contest 128 + +- [1009. Complement of Base 10 Integer](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README_EN.md) +- [1010. Pairs of Songs With Total Durations Divisible by 60](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README_EN.md) +- [1011. Capacity To Ship Packages Within D Days](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README_EN.md) +- [1012. Numbers With Repeated Digits](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README_EN.md) + +#### Weekly Contest 127 + +- [1005. Maximize Sum Of Array After K Negations](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README_EN.md) +- [1006. Clumsy Factorial](/solution/1000-1099/1006.Clumsy%20Factorial/README_EN.md) +- [1007. Minimum Domino Rotations For Equal Row](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README_EN.md) +- [1008. Construct Binary Search Tree from Preorder Traversal](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README_EN.md) + +#### Weekly Contest 126 + +- [1002. Find Common Characters](/solution/1000-1099/1002.Find%20Common%20Characters/README_EN.md) +- [1003. Check If Word Is Valid After Substitutions](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README_EN.md) +- [1004. Max Consecutive Ones III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README_EN.md) +- [1000. Minimum Cost to Merge Stones](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README_EN.md) + +#### Weekly Contest 125 + +- [0997. Find the Town Judge](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README_EN.md) +- [0999. Available Captures for Rook](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README_EN.md) +- [0998. Maximum Binary Tree II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README_EN.md) +- [1001. Grid Illumination](/solution/1000-1099/1001.Grid%20Illumination/README_EN.md) + +#### Weekly Contest 124 + +- [0993. Cousins in Binary Tree](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README_EN.md) +- [0994. Rotting Oranges](/solution/0900-0999/0994.Rotting%20Oranges/README_EN.md) +- [0995. Minimum Number of K Consecutive Bit Flips](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README_EN.md) +- [0996. Number of Squareful Arrays](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README_EN.md) + +#### Weekly Contest 123 + +- [0989. Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README_EN.md) +- [0990. Satisfiability of Equality Equations](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README_EN.md) +- [0991. Broken Calculator](/solution/0900-0999/0991.Broken%20Calculator/README_EN.md) +- [0992. Subarrays with K Different Integers](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README_EN.md) + +#### Weekly Contest 122 + +- [0985. Sum of Even Numbers After Queries](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README_EN.md) +- [0988. Smallest String Starting From Leaf](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README_EN.md) +- [0986. Interval List Intersections](/solution/0900-0999/0986.Interval%20List%20Intersections/README_EN.md) +- [0987. Vertical Order Traversal of a Binary Tree](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README_EN.md) + +#### Weekly Contest 121 + +- [0984. String Without AAA or BBB](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README_EN.md) +- [0981. Time Based Key-Value Store](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README_EN.md) +- [0983. Minimum Cost For Tickets](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README_EN.md) +- [0982. Triples with Bitwise AND Equal To Zero](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README_EN.md) + +#### Weekly Contest 120 + +- [0977. Squares of a Sorted Array](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README_EN.md) +- [0978. Longest Turbulent Subarray](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README_EN.md) +- [0979. Distribute Coins in Binary Tree](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README_EN.md) +- [0980. Unique Paths III](/solution/0900-0999/0980.Unique%20Paths%20III/README_EN.md) + +#### Weekly Contest 119 + +- [0973. K Closest Points to Origin](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README_EN.md) +- [0976. Largest Perimeter Triangle](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README_EN.md) +- [0974. Subarray Sums Divisible by K](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README_EN.md) +- [0975. Odd Even Jump](/solution/0900-0999/0975.Odd%20Even%20Jump/README_EN.md) + +#### Weekly Contest 118 + +- [0970. Powerful Integers](/solution/0900-0999/0970.Powerful%20Integers/README_EN.md) +- [0969. Pancake Sorting](/solution/0900-0999/0969.Pancake%20Sorting/README_EN.md) +- [0971. Flip Binary Tree To Match Preorder Traversal](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README_EN.md) +- [0972. Equal Rational Numbers](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README_EN.md) + +#### Weekly Contest 117 + +- [0965. Univalued Binary Tree](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README_EN.md) +- [0967. Numbers With Same Consecutive Differences](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README_EN.md) +- [0966. Vowel Spellchecker](/solution/0900-0999/0966.Vowel%20Spellchecker/README_EN.md) +- [0968. Binary Tree Cameras](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README_EN.md) + +#### Weekly Contest 116 + +- [0961. N-Repeated Element in Size 2N Array](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README_EN.md) +- [0962. Maximum Width Ramp](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README_EN.md) +- [0963. Minimum Area Rectangle II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README_EN.md) +- [0964. Least Operators to Express Number](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README_EN.md) + +#### Weekly Contest 115 + +- [0957. Prison Cells After N Days](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README_EN.md) +- [0958. Check Completeness of a Binary Tree](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README_EN.md) +- [0959. Regions Cut By Slashes](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README_EN.md) +- [0960. Delete Columns to Make Sorted III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README_EN.md) + +#### Weekly Contest 114 + +- [0953. Verifying an Alien Dictionary](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README_EN.md) +- [0954. Array of Doubled Pairs](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README_EN.md) +- [0955. Delete Columns to Make Sorted II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README_EN.md) +- [0956. Tallest Billboard](/solution/0900-0999/0956.Tallest%20Billboard/README_EN.md) + +#### Weekly Contest 113 + +- [0949. Largest Time for Given Digits](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README_EN.md) +- [0951. Flip Equivalent Binary Trees](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README_EN.md) +- [0950. Reveal Cards In Increasing Order](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README_EN.md) +- [0952. Largest Component Size by Common Factor](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README_EN.md) + +#### Weekly Contest 112 + +- [0945. Minimum Increment to Make Array Unique](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README_EN.md) +- [0946. Validate Stack Sequences](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README_EN.md) +- [0947. Most Stones Removed with Same Row or Column](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README_EN.md) +- [0948. Bag of Tokens](/solution/0900-0999/0948.Bag%20of%20Tokens/README_EN.md) + +#### Weekly Contest 111 + +- [0941. Valid Mountain Array](/solution/0900-0999/0941.Valid%20Mountain%20Array/README_EN.md) +- [0944. Delete Columns to Make Sorted](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README_EN.md) +- [0942. DI String Match](/solution/0900-0999/0942.DI%20String%20Match/README_EN.md) +- [0943. Find the Shortest Superstring](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README_EN.md) + +#### Weekly Contest 110 + +- [0937. Reorder Data in Log Files](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README_EN.md) +- [0938. Range Sum of BST](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README_EN.md) +- [0939. Minimum Area Rectangle](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README_EN.md) +- [0940. Distinct Subsequences II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README_EN.md) + +#### Weekly Contest 109 + +- [0933. Number of Recent Calls](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README_EN.md) +- [0935. Knight Dialer](/solution/0900-0999/0935.Knight%20Dialer/README_EN.md) +- [0934. Shortest Bridge](/solution/0900-0999/0934.Shortest%20Bridge/README_EN.md) +- [0936. Stamping The Sequence](/solution/0900-0999/0936.Stamping%20The%20Sequence/README_EN.md) + +#### Weekly Contest 108 + +- [0929. Unique Email Addresses](/solution/0900-0999/0929.Unique%20Email%20Addresses/README_EN.md) +- [0930. Binary Subarrays With Sum](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README_EN.md) +- [0931. Minimum Falling Path Sum](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README_EN.md) +- [0932. Beautiful Array](/solution/0900-0999/0932.Beautiful%20Array/README_EN.md) + +#### Weekly Contest 107 + +- [0925. Long Pressed Name](/solution/0900-0999/0925.Long%20Pressed%20Name/README_EN.md) +- [0926. Flip String to Monotone Increasing](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README_EN.md) +- [0927. Three Equal Parts](/solution/0900-0999/0927.Three%20Equal%20Parts/README_EN.md) +- [0928. Minimize Malware Spread II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README_EN.md) + +#### Weekly Contest 106 + +- [0922. Sort Array By Parity II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README_EN.md) +- [0921. Minimum Add to Make Parentheses Valid](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README_EN.md) +- [0923. 3Sum With Multiplicity](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README_EN.md) +- [0924. Minimize Malware Spread](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README_EN.md) + +#### Weekly Contest 105 + +- [0917. Reverse Only Letters](/solution/0900-0999/0917.Reverse%20Only%20Letters/README_EN.md) +- [0918. Maximum Sum Circular Subarray](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README_EN.md) +- [0919. Complete Binary Tree Inserter](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README_EN.md) +- [0920. Number of Music Playlists](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README_EN.md) + +#### Weekly Contest 104 + +- [0914. X of a Kind in a Deck of Cards](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README_EN.md) +- [0915. Partition Array into Disjoint Intervals](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README_EN.md) +- [0916. Word Subsets](/solution/0900-0999/0916.Word%20Subsets/README_EN.md) +- [0913. Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README_EN.md) + +#### Weekly Contest 103 + +- [0908. Smallest Range I](/solution/0900-0999/0908.Smallest%20Range%20I/README_EN.md) +- [0909. Snakes and Ladders](/solution/0900-0999/0909.Snakes%20and%20Ladders/README_EN.md) +- [0910. Smallest Range II](/solution/0900-0999/0910.Smallest%20Range%20II/README_EN.md) +- [0911. Online Election](/solution/0900-0999/0911.Online%20Election/README_EN.md) + +#### Weekly Contest 102 + +- [0905. Sort Array By Parity](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README_EN.md) +- [0904. Fruit Into Baskets](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README_EN.md) +- [0907. Sum of Subarray Minimums](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README_EN.md) +- [0906. Super Palindromes](/solution/0900-0999/0906.Super%20Palindromes/README_EN.md) + +#### Weekly Contest 101 + +- [0900. RLE Iterator](/solution/0900-0999/0900.RLE%20Iterator/README_EN.md) +- [0901. Online Stock Span](/solution/0900-0999/0901.Online%20Stock%20Span/README_EN.md) +- [0902. Numbers At Most N Given Digit Set](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README_EN.md) +- [0903. Valid Permutations for DI Sequence](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README_EN.md) + +#### Weekly Contest 100 + +- [0896. Monotonic Array](/solution/0800-0899/0896.Monotonic%20Array/README_EN.md) +- [0897. Increasing Order Search Tree](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README_EN.md) +- [0898. Bitwise ORs of Subarrays](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README_EN.md) +- [0899. Orderly Queue](/solution/0800-0899/0899.Orderly%20Queue/README_EN.md) + +#### Weekly Contest 99 + +- [0892. Surface Area of 3D Shapes](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README_EN.md) +- [0893. Groups of Special-Equivalent Strings](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README_EN.md) +- [0894. All Possible Full Binary Trees](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README_EN.md) +- [0895. Maximum Frequency Stack](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README_EN.md) + +#### Weekly Contest 98 + +- [0888. Fair Candy Swap](/solution/0800-0899/0888.Fair%20Candy%20Swap/README_EN.md) +- [0890. Find and Replace Pattern](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README_EN.md) +- [0889. Construct Binary Tree from Preorder and Postorder Traversal](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README_EN.md) +- [0891. Sum of Subsequence Widths](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README_EN.md) + +#### Weekly Contest 97 + +- [0884. Uncommon Words from Two Sentences](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README_EN.md) +- [0885. Spiral Matrix III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README_EN.md) +- [0886. Possible Bipartition](/solution/0800-0899/0886.Possible%20Bipartition/README_EN.md) +- [0887. Super Egg Drop](/solution/0800-0899/0887.Super%20Egg%20Drop/README_EN.md) + +#### Weekly Contest 96 + +- [0883. Projection Area of 3D Shapes](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README_EN.md) +- [0881. Boats to Save People](/solution/0800-0899/0881.Boats%20to%20Save%20People/README_EN.md) +- [0880. Decoded String at Index](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README_EN.md) +- [0882. Reachable Nodes In Subdivided Graph](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README_EN.md) + +#### Weekly Contest 95 + +- [0876. Middle of the Linked List](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README_EN.md) +- [0877. Stone Game](/solution/0800-0899/0877.Stone%20Game/README_EN.md) +- [0878. Nth Magical Number](/solution/0800-0899/0878.Nth%20Magical%20Number/README_EN.md) +- [0879. Profitable Schemes](/solution/0800-0899/0879.Profitable%20Schemes/README_EN.md) + +#### Weekly Contest 94 + +- [0872. Leaf-Similar Trees](/solution/0800-0899/0872.Leaf-Similar%20Trees/README_EN.md) +- [0874. Walking Robot Simulation](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README_EN.md) +- [0875. Koko Eating Bananas](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README_EN.md) +- [0873. Length of Longest Fibonacci Subsequence](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README_EN.md) + +#### Weekly Contest 93 + +- [0868. Binary Gap](/solution/0800-0899/0868.Binary%20Gap/README_EN.md) +- [0869. Reordered Power of 2](/solution/0800-0899/0869.Reordered%20Power%20of%202/README_EN.md) +- [0870. Advantage Shuffle](/solution/0800-0899/0870.Advantage%20Shuffle/README_EN.md) +- [0871. Minimum Number of Refueling Stops](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README_EN.md) + +#### Weekly Contest 92 + +- [0867. Transpose Matrix](/solution/0800-0899/0867.Transpose%20Matrix/README_EN.md) +- [0865. Smallest Subtree with all the Deepest Nodes](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README_EN.md) +- [0866. Prime Palindrome](/solution/0800-0899/0866.Prime%20Palindrome/README_EN.md) +- [0864. Shortest Path to Get All Keys](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README_EN.md) + +#### Weekly Contest 91 + +- [0860. Lemonade Change](/solution/0800-0899/0860.Lemonade%20Change/README_EN.md) +- [0863. All Nodes Distance K in Binary Tree](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README_EN.md) +- [0861. Score After Flipping Matrix](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README_EN.md) +- [0862. Shortest Subarray with Sum at Least K](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README_EN.md) + +#### Weekly Contest 90 + +- [0859. Buddy Strings](/solution/0800-0899/0859.Buddy%20Strings/README_EN.md) +- [0856. Score of Parentheses](/solution/0800-0899/0856.Score%20of%20Parentheses/README_EN.md) +- [0858. Mirror Reflection](/solution/0800-0899/0858.Mirror%20Reflection/README_EN.md) +- [0857. Minimum Cost to Hire K Workers](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README_EN.md) + +#### Weekly Contest 89 + +- [0852. Peak Index in a Mountain Array](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README_EN.md) +- [0853. Car Fleet](/solution/0800-0899/0853.Car%20Fleet/README_EN.md) +- [0855. Exam Room](/solution/0800-0899/0855.Exam%20Room/README_EN.md) +- [0854. K-Similar Strings](/solution/0800-0899/0854.K-Similar%20Strings/README_EN.md) + +#### Weekly Contest 88 + +- [0848. Shifting Letters](/solution/0800-0899/0848.Shifting%20Letters/README_EN.md) +- [0849. Maximize Distance to Closest Person](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README_EN.md) +- [0851. Loud and Rich](/solution/0800-0899/0851.Loud%20and%20Rich/README_EN.md) +- [0850. Rectangle Area II](/solution/0800-0899/0850.Rectangle%20Area%20II/README_EN.md) + +#### Weekly Contest 87 + +- [0844. Backspace String Compare](/solution/0800-0899/0844.Backspace%20String%20Compare/README_EN.md) +- [0845. Longest Mountain in Array](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README_EN.md) +- [0846. Hand of Straights](/solution/0800-0899/0846.Hand%20of%20Straights/README_EN.md) +- [0847. Shortest Path Visiting All Nodes](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README_EN.md) + +#### Weekly Contest 86 + +- [0840. Magic Squares In Grid](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README_EN.md) +- [0841. Keys and Rooms](/solution/0800-0899/0841.Keys%20and%20Rooms/README_EN.md) +- [0842. Split Array into Fibonacci Sequence](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README_EN.md) +- [0843. Guess the Word](/solution/0800-0899/0843.Guess%20the%20Word/README_EN.md) + +#### Weekly Contest 85 + +- [0836. Rectangle Overlap](/solution/0800-0899/0836.Rectangle%20Overlap/README_EN.md) +- [0838. Push Dominoes](/solution/0800-0899/0838.Push%20Dominoes/README_EN.md) +- [0837. New 21 Game](/solution/0800-0899/0837.New%2021%20Game/README_EN.md) +- [0839. Similar String Groups](/solution/0800-0899/0839.Similar%20String%20Groups/README_EN.md) + +#### Weekly Contest 84 + +- [0832. Flipping an Image](/solution/0800-0899/0832.Flipping%20an%20Image/README_EN.md) +- [0833. Find And Replace in String](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README_EN.md) +- [0835. Image Overlap](/solution/0800-0899/0835.Image%20Overlap/README_EN.md) +- [0834. Sum of Distances in Tree](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README_EN.md) + +#### Weekly Contest 83 + +- [0830. Positions of Large Groups](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README_EN.md) +- [0831. Masking Personal Information](/solution/0800-0899/0831.Masking%20Personal%20Information/README_EN.md) +- [0829. Consecutive Numbers Sum](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README_EN.md) +- [0828. Count Unique Characters of All Substrings of a Given String](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README_EN.md) diff --git a/solution/README.md b/solution/README.md index b1172e95b854c..8f755cf07b120 100644 --- a/solution/README.md +++ b/solution/README.md @@ -1,3212 +1,3212 @@ -# LeetCode - -[English Version](/solution/README_EN.md) - -## 题解 - -列表所有题解均由 [开源社区 Doocs](https://github.com/doocs) 贡献者提供，正在完善中，欢迎贡献你的题解！ - -快速搜索题号、题解、标签等，请善用 Control + F（或者 Command + F）。 - -| 题号 | 题解 | 标签 | 难度 | 备注 | -| ---- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------------------------- | ---- | --------------- | -| 0001 | [两数之和](/solution/0000-0099/0001.Two%20Sum/README.md) | `数组`,`哈希表` | 简单 | | -| 0002 | [两数相加](/solution/0000-0099/0002.Add%20Two%20Numbers/README.md) | `递归`,`链表`,`数学` | 中等 | | -| 0003 | [无重复字符的最长子串](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | | -| 0004 | [寻找两个正序数组的中位数](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md) | `数组`,`二分查找`,`分治` | 困难 | | -| 0005 | [最长回文子串](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md) | `双指针`,`字符串`,`动态规划` | 中等 | | -| 0006 | [Z 字形变换](/solution/0000-0099/0006.Zigzag%20Conversion/README.md) | `字符串` | 中等 | | -| 0007 | [整数反转](/solution/0000-0099/0007.Reverse%20Integer/README.md) | `数学` | 中等 | | -| 0008 | [字符串转换整数 (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md) | `字符串` | 中等 | | -| 0009 | [回文数](/solution/0000-0099/0009.Palindrome%20Number/README.md) | `数学` | 简单 | | -| 0010 | [正则表达式匹配](/solution/0000-0099/0010.Regular%20Expression%20Matching/README.md) | `递归`,`字符串`,`动态规划` | 困难 | | -| 0011 | [盛最多水的容器](/solution/0000-0099/0011.Container%20With%20Most%20Water/README.md) | `贪心`,`数组`,`双指针` | 中等 | | -| 0012 | [整数转罗马数字](/solution/0000-0099/0012.Integer%20to%20Roman/README.md) | `哈希表`,`数学`,`字符串` | 中等 | | -| 0013 | [罗马数字转整数](/solution/0000-0099/0013.Roman%20to%20Integer/README.md) | `哈希表`,`数学`,`字符串` | 简单 | | -| 0014 | [最长公共前缀](/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md) | `字典树`,`字符串` | 简单 | | -| 0015 | [三数之和](/solution/0000-0099/0015.3Sum/README.md) | `数组`,`双指针`,`排序` | 中等 | | -| 0016 | [最接近的三数之和](/solution/0000-0099/0016.3Sum%20Closest/README.md) | `数组`,`双指针`,`排序` | 中等 | | -| 0017 | [电话号码的字母组合](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README.md) | `哈希表`,`字符串`,`回溯` | 中等 | | -| 0018 | [四数之和](/solution/0000-0099/0018.4Sum/README.md) | `数组`,`双指针`,`排序` | 中等 | | -| 0019 | [删除链表的倒数第 N 个结点](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README.md) | `链表`,`双指针` | 中等 | | -| 0020 | [有效的括号](/solution/0000-0099/0020.Valid%20Parentheses/README.md) | `栈`,`字符串` | 简单 | | -| 0021 | [合并两个有序链表](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README.md) | `递归`,`链表` | 简单 | | -| 0022 | [括号生成](/solution/0000-0099/0022.Generate%20Parentheses/README.md) | `字符串`,`动态规划`,`回溯` | 中等 | | -| 0023 | [合并 K 个升序链表](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README.md) | `链表`,`分治`,`堆（优先队列）`,`归并排序` | 困难 | | -| 0024 | [两两交换链表中的节点](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README.md) | `递归`,`链表` | 中等 | | -| 0025 | [K 个一组翻转链表](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README.md) | `递归`,`链表` | 困难 | | -| 0026 | [删除有序数组中的重复项](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md) | `数组`,`双指针` | 简单 | | -| 0027 | [移除元素](/solution/0000-0099/0027.Remove%20Element/README.md) | `数组`,`双指针` | 简单 | | -| 0028 | [找出字符串中第一个匹配项的下标](/solution/0000-0099/0028.Find%20the%20Index%20of%20the%20First%20Occurrence%20in%20a%20String/README.md) | `双指针`,`字符串`,`字符串匹配` | 简单 | | -| 0029 | [两数相除](/solution/0000-0099/0029.Divide%20Two%20Integers/README.md) | `位运算`,`数学` | 中等 | | -| 0030 | [串联所有单词的子串](/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README.md) | `哈希表`,`字符串`,`滑动窗口` | 困难 | | -| 0031 | [下一个排列](/solution/0000-0099/0031.Next%20Permutation/README.md) | `数组`,`双指针` | 中等 | | -| 0032 | [最长有效括号](/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README.md) | `栈`,`字符串`,`动态规划` | 困难 | | -| 0033 | [搜索旋转排序数组](/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README.md) | `数组`,`二分查找` | 中等 | | -| 0034 | [在排序数组中查找元素的第一个和最后一个位置](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md) | `数组`,`二分查找` | 中等 | | -| 0035 | [搜索插入位置](/solution/0000-0099/0035.Search%20Insert%20Position/README.md) | `数组`,`二分查找` | 简单 | | -| 0036 | [有效的数独](/solution/0000-0099/0036.Valid%20Sudoku/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | | -| 0037 | [解数独](/solution/0000-0099/0037.Sudoku%20Solver/README.md) | `数组`,`哈希表`,`回溯`,`矩阵` | 困难 | | -| 0038 | [外观数列](/solution/0000-0099/0038.Count%20and%20Say/README.md) | `字符串` | 中等 | | -| 0039 | [组合总和](/solution/0000-0099/0039.Combination%20Sum/README.md) | `数组`,`回溯` | 中等 | | -| 0040 | [组合总和 II](/solution/0000-0099/0040.Combination%20Sum%20II/README.md) | `数组`,`回溯` | 中等 | | -| 0041 | [缺失的第一个正数](/solution/0000-0099/0041.First%20Missing%20Positive/README.md) | `数组`,`哈希表` | 困难 | | -| 0042 | [接雨水](/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md) | `栈`,`数组`,`双指针`,`动态规划`,`单调栈` | 困难 | | -| 0043 | [字符串相乘](/solution/0000-0099/0043.Multiply%20Strings/README.md) | `数学`,`字符串`,`模拟` | 中等 | | -| 0044 | [通配符匹配](/solution/0000-0099/0044.Wildcard%20Matching/README.md) | `贪心`,`递归`,`字符串`,`动态规划` | 困难 | | -| 0045 | [跳跃游戏 II](/solution/0000-0099/0045.Jump%20Game%20II/README.md) | `贪心`,`数组`,`动态规划` | 中等 | | -| 0046 | [全排列](/solution/0000-0099/0046.Permutations/README.md) | `数组`,`回溯` | 中等 | | -| 0047 | [全排列 II](/solution/0000-0099/0047.Permutations%20II/README.md) | `数组`,`回溯` | 中等 | | -| 0048 | [旋转图像](/solution/0000-0099/0048.Rotate%20Image/README.md) | `数组`,`数学`,`矩阵` | 中等 | | -| 0049 | [字母异位词分组](/solution/0000-0099/0049.Group%20Anagrams/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | | -| 0050 | [Pow(x, n)](/solution/0000-0099/0050.Pow%28x%2C%20n%29/README.md) | `递归`,`数学` | 中等 | | -| 0051 | [N 皇后](/solution/0000-0099/0051.N-Queens/README.md) | `数组`,`回溯` | 困难 | | -| 0052 | [N 皇后 II](/solution/0000-0099/0052.N-Queens%20II/README.md) | `回溯` | 困难 | | -| 0053 | [最大子数组和](/solution/0000-0099/0053.Maximum%20Subarray/README.md) | `数组`,`分治`,`动态规划` | 中等 | | -| 0054 | [螺旋矩阵](/solution/0000-0099/0054.Spiral%20Matrix/README.md) | `数组`,`矩阵`,`模拟` | 中等 | | -| 0055 | [跳跃游戏](/solution/0000-0099/0055.Jump%20Game/README.md) | `贪心`,`数组`,`动态规划` | 中等 | | -| 0056 | [合并区间](/solution/0000-0099/0056.Merge%20Intervals/README.md) | `数组`,`排序` | 中等 | | -| 0057 | [插入区间](/solution/0000-0099/0057.Insert%20Interval/README.md) | `数组` | 中等 | | -| 0058 | [最后一个单词的长度](/solution/0000-0099/0058.Length%20of%20Last%20Word/README.md) | `字符串` | 简单 | | -| 0059 | [螺旋矩阵 II](/solution/0000-0099/0059.Spiral%20Matrix%20II/README.md) | `数组`,`矩阵`,`模拟` | 中等 | | -| 0060 | [排列序列](/solution/0000-0099/0060.Permutation%20Sequence/README.md) | `递归`,`数学` | 困难 | | -| 0061 | [旋转链表](/solution/0000-0099/0061.Rotate%20List/README.md) | `链表`,`双指针` | 中等 | | -| 0062 | [不同路径](/solution/0000-0099/0062.Unique%20Paths/README.md) | `数学`,`动态规划`,`组合数学` | 中等 | | -| 0063 | [不同路径 II](/solution/0000-0099/0063.Unique%20Paths%20II/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | | -| 0064 | [最小路径和](/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | | -| 0065 | [有效数字](/solution/0000-0099/0065.Valid%20Number/README.md) | `字符串` | 困难 | | -| 0066 | [加一](/solution/0000-0099/0066.Plus%20One/README.md) | `数组`,`数学` | 简单 | | -| 0067 | [二进制求和](/solution/0000-0099/0067.Add%20Binary/README.md) | `位运算`,`数学`,`字符串`,`模拟` | 简单 | | -| 0068 | [文本左右对齐](/solution/0000-0099/0068.Text%20Justification/README.md) | `数组`,`字符串`,`模拟` | 困难 | | -| 0069 | [x 的平方根 ](/solution/0000-0099/0069.Sqrt%28x%29/README.md) | `数学`,`二分查找` | 简单 | | -| 0070 | [爬楼梯](/solution/0000-0099/0070.Climbing%20Stairs/README.md) | `记忆化搜索`,`数学`,`动态规划` | 简单 | | -| 0071 | [简化路径](/solution/0000-0099/0071.Simplify%20Path/README.md) | `栈`,`字符串` | 中等 | | -| 0072 | [编辑距离](/solution/0000-0099/0072.Edit%20Distance/README.md) | `字符串`,`动态规划` | 中等 | | -| 0073 | [矩阵置零](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | | -| 0074 | [搜索二维矩阵](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README.md) | `数组`,`二分查找`,`矩阵` | 中等 | | -| 0075 | [颜色分类](/solution/0000-0099/0075.Sort%20Colors/README.md) | `数组`,`双指针`,`排序` | 中等 | | -| 0076 | [最小覆盖子串](/solution/0000-0099/0076.Minimum%20Window%20Substring/README.md) | `哈希表`,`字符串`,`滑动窗口` | 困难 | | -| 0077 | [组合](/solution/0000-0099/0077.Combinations/README.md) | `回溯` | 中等 | | -| 0078 | [子集](/solution/0000-0099/0078.Subsets/README.md) | `位运算`,`数组`,`回溯` | 中等 | | -| 0079 | [单词搜索](/solution/0000-0099/0079.Word%20Search/README.md) | `数组`,`字符串`,`回溯`,`矩阵` | 中等 | | -| 0080 | [删除有序数组中的重复项 II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md) | `数组`,`双指针` | 中等 | | -| 0081 | [搜索旋转排序数组 II](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md) | `数组`,`二分查找` | 中等 | | -| 0082 | [删除排序链表中的重复元素 II](/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README.md) | `链表`,`双指针` | 中等 | | -| 0083 | [删除排序链表中的重复元素](/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README.md) | `链表` | 简单 | | -| 0084 | [柱状图中最大的矩形](/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README.md) | `栈`,`数组`,`单调栈` | 困难 | | -| 0085 | [最大矩形](/solution/0000-0099/0085.Maximal%20Rectangle/README.md) | `栈`,`数组`,`动态规划`,`矩阵`,`单调栈` | 困难 | | -| 0086 | [分隔链表](/solution/0000-0099/0086.Partition%20List/README.md) | `链表`,`双指针` | 中等 | | -| 0087 | [扰乱字符串](/solution/0000-0099/0087.Scramble%20String/README.md) | `字符串`,`动态规划` | 困难 | | -| 0088 | [合并两个有序数组](/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md) | `数组`,`双指针`,`排序` | 简单 | | -| 0089 | [格雷编码](/solution/0000-0099/0089.Gray%20Code/README.md) | `位运算`,`数学`,`回溯` | 中等 | | -| 0090 | [子集 II](/solution/0000-0099/0090.Subsets%20II/README.md) | `位运算`,`数组`,`回溯` | 中等 | | -| 0091 | [解码方法](/solution/0000-0099/0091.Decode%20Ways/README.md) | `字符串`,`动态规划` | 中等 | | -| 0092 | [反转链表 II](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README.md) | `链表` | 中等 | | -| 0093 | [复原 IP 地址](/solution/0000-0099/0093.Restore%20IP%20Addresses/README.md) | `字符串`,`回溯` | 中等 | | -| 0094 | [二叉树的中序遍历](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README.md) | `栈`,`树`,`深度优先搜索`,`二叉树` | 简单 | | -| 0095 | [不同的二叉搜索树 II](/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README.md) | `树`,`二叉搜索树`,`动态规划`,`回溯`,`二叉树` | 中等 | | -| 0096 | [不同的二叉搜索树](/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README.md) | `树`,`二叉搜索树`,`数学`,`动态规划`,`二叉树` | 中等 | | -| 0097 | [交错字符串](/solution/0000-0099/0097.Interleaving%20String/README.md) | `字符串`,`动态规划` | 中等 | | -| 0098 | [验证二叉搜索树](/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | -| 0099 | [恢复二叉搜索树](/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | -| 0100 | [相同的树](/solution/0100-0199/0100.Same%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | -| 0101 | [对称二叉树](/solution/0100-0199/0101.Symmetric%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | -| 0102 | [二叉树的层序遍历](/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | | -| 0103 | [二叉树的锯齿形层序遍历](/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | | -| 0104 | [二叉树的最大深度](/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | -| 0105 | [从前序与中序遍历序列构造二叉树](/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README.md) | `树`,`数组`,`哈希表`,`分治`,`二叉树` | 中等 | | -| 0106 | [从中序与后序遍历序列构造二叉树](/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README.md) | `树`,`数组`,`哈希表`,`分治`,`二叉树` | 中等 | | -| 0107 | [二叉树的层序遍历 II](/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | | -| 0108 | [将有序数组转换为二叉搜索树](/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README.md) | `树`,`二叉搜索树`,`数组`,`分治`,`二叉树` | 简单 | | -| 0109 | [有序链表转换二叉搜索树](/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README.md) | `树`,`二叉搜索树`,`链表`,`分治`,`二叉树` | 中等 | | -| 0110 | [平衡二叉树](/solution/0100-0199/0110.Balanced%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | | -| 0111 | [二叉树的最小深度](/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | -| 0112 | [路径总和](/solution/0100-0199/0112.Path%20Sum/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | -| 0113 | [路径总和 II](/solution/0100-0199/0113.Path%20Sum%20II/README.md) | `树`,`深度优先搜索`,`回溯`,`二叉树` | 中等 | | -| 0114 | [二叉树展开为链表](/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README.md) | `栈`,`树`,`深度优先搜索`,`链表`,`二叉树` | 中等 | | -| 0115 | [不同的子序列](/solution/0100-0199/0115.Distinct%20Subsequences/README.md) | `字符串`,`动态规划` | 困难 | | -| 0116 | [填充每个节点的下一个右侧节点指针](/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`链表`,`二叉树` | 中等 | | -| 0117 | [填充每个节点的下一个右侧节点指针 II](/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`链表`,`二叉树` | 中等 | | -| 0118 | [杨辉三角](/solution/0100-0199/0118.Pascal%27s%20Triangle/README.md) | `数组`,`动态规划` | 简单 | | -| 0119 | [杨辉三角 II](/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README.md) | `数组`,`动态规划` | 简单 | | -| 0120 | [三角形最小路径和](/solution/0100-0199/0120.Triangle/README.md) | `数组`,`动态规划` | 中等 | | -| 0121 | [买卖股票的最佳时机](/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README.md) | `数组`,`动态规划` | 简单 | | -| 0122 | [买卖股票的最佳时机 II](/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README.md) | `贪心`,`数组`,`动态规划` | 中等 | | -| 0123 | [买卖股票的最佳时机 III](/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README.md) | `数组`,`动态规划` | 困难 | | -| 0124 | [二叉树中的最大路径和](/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README.md) | `树`,`深度优先搜索`,`动态规划`,`二叉树` | 困难 | | -| 0125 | [验证回文串](/solution/0100-0199/0125.Valid%20Palindrome/README.md) | `双指针`,`字符串` | 简单 | | -| 0126 | [单词接龙 II](/solution/0100-0199/0126.Word%20Ladder%20II/README.md) | `广度优先搜索`,`哈希表`,`字符串`,`回溯` | 困难 | | -| 0127 | [单词接龙](/solution/0100-0199/0127.Word%20Ladder/README.md) | `广度优先搜索`,`哈希表`,`字符串` | 困难 | | -| 0128 | [最长连续序列](/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README.md) | `并查集`,`数组`,`哈希表` | 中等 | | -| 0129 | [求根节点到叶节点数字之和](/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | | -| 0130 | [被围绕的区域](/solution/0100-0199/0130.Surrounded%20Regions/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | | -| 0131 | [分割回文串](/solution/0100-0199/0131.Palindrome%20Partitioning/README.md) | `字符串`,`动态规划`,`回溯` | 中等 | | -| 0132 | [分割回文串 II](/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README.md) | `字符串`,`动态规划` | 困难 | | -| 0133 | [克隆图](/solution/0100-0199/0133.Clone%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`哈希表` | 中等 | | -| 0134 | [加油站](/solution/0100-0199/0134.Gas%20Station/README.md) | `贪心`,`数组` | 中等 | | -| 0135 | [分发糖果](/solution/0100-0199/0135.Candy/README.md) | `贪心`,`数组` | 困难 | | -| 0136 | [只出现一次的数字](/solution/0100-0199/0136.Single%20Number/README.md) | `位运算`,`数组` | 简单 | | -| 0137 | [只出现一次的数字 II](/solution/0100-0199/0137.Single%20Number%20II/README.md) | `位运算`,`数组` | 中等 | | -| 0138 | [随机链表的复制](/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README.md) | `哈希表`,`链表` | 中等 | | -| 0139 | [单词拆分](/solution/0100-0199/0139.Word%20Break/README.md) | `字典树`,`记忆化搜索`,`数组`,`哈希表`,`字符串`,`动态规划` | 中等 | | -| 0140 | [单词拆分 II](/solution/0100-0199/0140.Word%20Break%20II/README.md) | `字典树`,`记忆化搜索`,`数组`,`哈希表`,`字符串`,`动态规划`,`回溯` | 困难 | | -| 0141 | [环形链表](/solution/0100-0199/0141.Linked%20List%20Cycle/README.md) | `哈希表`,`链表`,`双指针` | 简单 | | -| 0142 | [环形链表 II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md) | `哈希表`,`链表`,`双指针` | 中等 | | -| 0143 | [重排链表](/solution/0100-0199/0143.Reorder%20List/README.md) | `栈`,`递归`,`链表`,`双指针` | 中等 | | -| 0144 | [二叉树的前序遍历](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README.md) | `栈`,`树`,`深度优先搜索`,`二叉树` | 简单 | | -| 0145 | [二叉树的后序遍历](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README.md) | `栈`,`树`,`深度优先搜索`,`二叉树` | 简单 | | -| 0146 | [LRU 缓存](/solution/0100-0199/0146.LRU%20Cache/README.md) | `设计`,`哈希表`,`链表`,`双向链表` | 中等 | | -| 0147 | [对链表进行插入排序](/solution/0100-0199/0147.Insertion%20Sort%20List/README.md) | `链表`,`排序` | 中等 | | -| 0148 | [排序链表](/solution/0100-0199/0148.Sort%20List/README.md) | `链表`,`双指针`,`分治`,`排序`,`归并排序` | 中等 | | -| 0149 | [直线上最多的点数](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README.md) | `几何`,`数组`,`哈希表`,`数学` | 困难 | | -| 0150 | [逆波兰表达式求值](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md) | `栈`,`数组`,`数学` | 中等 | | -| 0151 | [反转字符串中的单词](/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README.md) | `双指针`,`字符串` | 中等 | | -| 0152 | [乘积最大子数组](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README.md) | `数组`,`动态规划` | 中等 | | -| 0153 | [寻找旋转排序数组中的最小值](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README.md) | `数组`,`二分查找` | 中等 | | -| 0154 | [寻找旋转排序数组中的最小值 II](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README.md) | `数组`,`二分查找` | 困难 | | -| 0155 | [最小栈](/solution/0100-0199/0155.Min%20Stack/README.md) | `栈`,`设计` | 中等 | | -| 0156 | [上下翻转二叉树](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | -| 0157 | [用 Read4 读取 N 个字符](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README.md) | `数组`,`交互`,`模拟` | 简单 | 🔒 | -| 0158 | [用 Read4 读取 N 个字符 II - 多次调用](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20read4%20II%20-%20Call%20Multiple%20Times/README.md) | `数组`,`交互`,`模拟` | 困难 | 🔒 | -| 0159 | [至多包含两个不同字符的最长子串](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 🔒 | -| 0160 | [相交链表](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README.md) | `哈希表`,`链表`,`双指针` | 简单 | | -| 0161 | [相隔为 1 的编辑距离](/solution/0100-0199/0161.One%20Edit%20Distance/README.md) | `双指针`,`字符串` | 中等 | 🔒 | -| 0162 | [寻找峰值](/solution/0100-0199/0162.Find%20Peak%20Element/README.md) | `数组`,`二分查找` | 中等 | | -| 0163 | [缺失的区间](/solution/0100-0199/0163.Missing%20Ranges/README.md) | `数组` | 简单 | 🔒 | -| 0164 | [最大间距](/solution/0100-0199/0164.Maximum%20Gap/README.md) | `数组`,`桶排序`,`基数排序`,`排序` | 中等 | | -| 0165 | [比较版本号](/solution/0100-0199/0165.Compare%20Version%20Numbers/README.md) | `双指针`,`字符串` | 中等 | | -| 0166 | [分数到小数](/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README.md) | `哈希表`,`数学`,`字符串` | 中等 | | -| 0167 | [两数之和 II - 输入有序数组](/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted/README.md) | `数组`,`双指针`,`二分查找` | 中等 | | -| 0168 | [Excel 表列名称](/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README.md) | `数学`,`字符串` | 简单 | | -| 0169 | [多数元素](/solution/0100-0199/0169.Majority%20Element/README.md) | `数组`,`哈希表`,`分治`,`计数`,`排序` | 简单 | | -| 0170 | [两数之和 III - 数据结构设计](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README.md) | `设计`,`数组`,`哈希表`,`双指针`,`数据流` | 简单 | 🔒 | -| 0171 | [Excel 表列序号](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README.md) | `数学`,`字符串` | 简单 | | -| 0172 | [阶乘后的零](/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README.md) | `数学` | 中等 | | -| 0173 | [二叉搜索树迭代器](/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README.md) | `栈`,`树`,`设计`,`二叉搜索树`,`二叉树`,`迭代器` | 中等 | | -| 0174 | [地下城游戏](/solution/0100-0199/0174.Dungeon%20Game/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | | -| 0175 | [组合两个表](/solution/0100-0199/0175.Combine%20Two%20Tables/README.md) | `数据库` | 简单 | | -| 0176 | [第二高的薪水](/solution/0100-0199/0176.Second%20Highest%20Salary/README.md) | `数据库` | 中等 | | -| 0177 | [第 N 高的薪水](/solution/0100-0199/0177.Nth%20Highest%20Salary/README.md) | `数据库` | 中等 | | -| 0178 | [分数排名](/solution/0100-0199/0178.Rank%20Scores/README.md) | `数据库` | 中等 | | -| 0179 | [最大数](/solution/0100-0199/0179.Largest%20Number/README.md) | `贪心`,`数组`,`字符串`,`排序` | 中等 | | -| 0180 | [连续出现的数字](/solution/0100-0199/0180.Consecutive%20Numbers/README.md) | `数据库` | 中等 | | -| 0181 | [超过经理收入的员工](/solution/0100-0199/0181.Employees%20Earning%20More%20Than%20Their%20Managers/README.md) | `数据库` | 简单 | | -| 0182 | [查找重复的电子邮箱](/solution/0100-0199/0182.Duplicate%20Emails/README.md) | `数据库` | 简单 | | -| 0183 | [从不订购的客户](/solution/0100-0199/0183.Customers%20Who%20Never%20Order/README.md) | `数据库` | 简单 | | -| 0184 | [部门工资最高的员工](/solution/0100-0199/0184.Department%20Highest%20Salary/README.md) | `数据库` | 中等 | | -| 0185 | [部门工资前三高的所有员工](/solution/0100-0199/0185.Department%20Top%20Three%20Salaries/README.md) | `数据库` | 困难 | | -| 0186 | [反转字符串中的单词 II](/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README.md) | `双指针`,`字符串` | 中等 | 🔒 | -| 0187 | [重复的 DNA 序列](/solution/0100-0199/0187.Repeated%20DNA%20Sequences/README.md) | `位运算`,`哈希表`,`字符串`,`滑动窗口`,`哈希函数`,`滚动哈希` | 中等 | | -| 0188 | [买卖股票的最佳时机 IV](/solution/0100-0199/0188.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV/README.md) | `数组`,`动态规划` | 困难 | | -| 0189 | [轮转数组](/solution/0100-0199/0189.Rotate%20Array/README.md) | `数组`,`数学`,`双指针` | 中等 | | -| 0190 | [颠倒二进制位](/solution/0100-0199/0190.Reverse%20Bits/README.md) | `位运算`,`分治` | 简单 | | -| 0191 | [位 1 的个数](/solution/0100-0199/0191.Number%20of%201%20Bits/README.md) | `位运算`,`分治` | 简单 | | -| 0192 | [统计词频](/solution/0100-0199/0192.Word%20Frequency/README.md) | | 中等 | | -| 0193 | [有效电话号码](/solution/0100-0199/0193.Valid%20Phone%20Numbers/README.md) | | 简单 | | -| 0194 | [转置文件](/solution/0100-0199/0194.Transpose%20File/README.md) | | 中等 | | -| 0195 | [第十行](/solution/0100-0199/0195.Tenth%20Line/README.md) | | 简单 | | -| 0196 | [删除重复的电子邮箱](/solution/0100-0199/0196.Delete%20Duplicate%20Emails/README.md) | `数据库` | 简单 | | -| 0197 | [上升的温度](/solution/0100-0199/0197.Rising%20Temperature/README.md) | `数据库` | 简单 | | -| 0198 | [打家劫舍](/solution/0100-0199/0198.House%20Robber/README.md) | `数组`,`动态规划` | 中等 | | -| 0199 | [二叉树的右视图](/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | -| 0200 | [岛屿数量](/solution/0200-0299/0200.Number%20of%20Islands/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | | -| 0201 | [数字范围按位与](/solution/0200-0299/0201.Bitwise%20AND%20of%20Numbers%20Range/README.md) | `位运算` | 中等 | | -| 0202 | [快乐数](/solution/0200-0299/0202.Happy%20Number/README.md) | `哈希表`,`数学`,`双指针` | 简单 | | -| 0203 | [移除链表元素](/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README.md) | `递归`,`链表` | 简单 | | -| 0204 | [计数质数](/solution/0200-0299/0204.Count%20Primes/README.md) | `数组`,`数学`,`枚举`,`数论` | 中等 | | -| 0205 | [同构字符串](/solution/0200-0299/0205.Isomorphic%20Strings/README.md) | `哈希表`,`字符串` | 简单 | | -| 0206 | [反转链表](/solution/0200-0299/0206.Reverse%20Linked%20List/README.md) | `递归`,`链表` | 简单 | | -| 0207 | [课程表](/solution/0200-0299/0207.Course%20Schedule/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | | -| 0208 | [实现 Trie (前缀树)](/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | | -| 0209 | [长度最小的子数组](/solution/0200-0299/0209.Minimum%20Size%20Subarray%20Sum/README.md) | `数组`,`二分查找`,`前缀和`,`滑动窗口` | 中等 | | -| 0210 | [课程表 II](/solution/0200-0299/0210.Course%20Schedule%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | | -| 0211 | [添加与搜索单词 - 数据结构设计](/solution/0200-0299/0211.Design%20Add%20and%20Search%20Words%20Data%20Structure/README.md) | `深度优先搜索`,`设计`,`字典树`,`字符串` | 中等 | | -| 0212 | [单词搜索 II](/solution/0200-0299/0212.Word%20Search%20II/README.md) | `字典树`,`数组`,`字符串`,`回溯`,`矩阵` | 困难 | | -| 0213 | [打家劫舍 II](/solution/0200-0299/0213.House%20Robber%20II/README.md) | `数组`,`动态规划` | 中等 | | -| 0214 | [最短回文串](/solution/0200-0299/0214.Shortest%20Palindrome/README.md) | `字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | | -| 0215 | [数组中的第 K 个最大元素](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README.md) | `数组`,`分治`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | | -| 0216 | [组合总和 III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md) | `数组`,`回溯` | 中等 | | -| 0217 | [存在重复元素](/solution/0200-0299/0217.Contains%20Duplicate/README.md) | `数组`,`哈希表`,`排序` | 简单 | | -| 0218 | [天际线问题](/solution/0200-0299/0218.The%20Skyline%20Problem/README.md) | `树状数组`,`线段树`,`数组`,`分治`,`有序集合`,`扫描线`,`堆（优先队列）` | 困难 | | -| 0219 | [存在重复元素 II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README.md) | `数组`,`哈希表`,`滑动窗口` | 简单 | | -| 0220 | [存在重复元素 III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README.md) | `数组`,`桶排序`,`有序集合`,`排序`,`滑动窗口` | 困难 | | -| 0221 | [最大正方形](/solution/0200-0299/0221.Maximal%20Square/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | | -| 0222 | [完全二叉树的节点个数](/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README.md) | `位运算`,`树`,`二分查找`,`二叉树` | 简单 | | -| 0223 | [矩形面积](/solution/0200-0299/0223.Rectangle%20Area/README.md) | `几何`,`数学` | 中等 | | -| 0224 | [基本计算器](/solution/0200-0299/0224.Basic%20Calculator/README.md) | `栈`,`递归`,`数学`,`字符串` | 困难 | | -| 0225 | [用队列实现栈](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README.md) | `栈`,`设计`,`队列` | 简单 | | -| 0226 | [翻转二叉树](/solution/0200-0299/0226.Invert%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | -| 0227 | [基本计算器 II](/solution/0200-0299/0227.Basic%20Calculator%20II/README.md) | `栈`,`数学`,`字符串` | 中等 | | -| 0228 | [汇总区间](/solution/0200-0299/0228.Summary%20Ranges/README.md) | `数组` | 简单 | | -| 0229 | [多数元素 II](/solution/0200-0299/0229.Majority%20Element%20II/README.md) | `数组`,`哈希表`,`计数`,`排序` | 中等 | | -| 0230 | [二叉搜索树中第 K 小的元素](/solution/0200-0299/0230.Kth%20Smallest%20Element%20in%20a%20BST/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | -| 0231 | [2 的幂](/solution/0200-0299/0231.Power%20of%20Two/README.md) | `位运算`,`递归`,`数学` | 简单 | | -| 0232 | [用栈实现队列](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README.md) | `栈`,`设计`,`队列` | 简单 | | -| 0233 | [数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md) | `递归`,`数学`,`动态规划` | 困难 | | -| 0234 | [回文链表](/solution/0200-0299/0234.Palindrome%20Linked%20List/README.md) | `栈`,`递归`,`链表`,`双指针` | 简单 | | -| 0235 | [二叉搜索树的最近公共祖先](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | -| 0236 | [二叉树的最近公共祖先](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | | -| 0237 | [删除链表中的节点](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README.md) | `链表` | 中等 | | -| 0238 | [除自身以外数组的乘积](/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README.md) | `数组`,`前缀和` | 中等 | | -| 0239 | [滑动窗口最大值](/solution/0200-0299/0239.Sliding%20Window%20Maximum/README.md) | `队列`,`数组`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 困难 | | -| 0240 | [搜索二维矩阵 II](/solution/0200-0299/0240.Search%20a%202D%20Matrix%20II/README.md) | `数组`,`二分查找`,`分治`,`矩阵` | 中等 | | -| 0241 | [为运算表达式设计优先级](/solution/0200-0299/0241.Different%20Ways%20to%20Add%20Parentheses/README.md) | `递归`,`记忆化搜索`,`数学`,`字符串`,`动态规划` | 中等 | | -| 0242 | [有效的字母异位词](/solution/0200-0299/0242.Valid%20Anagram/README.md) | `哈希表`,`字符串`,`排序` | 简单 | | -| 0243 | [最短单词距离](/solution/0200-0299/0243.Shortest%20Word%20Distance/README.md) | `数组`,`字符串` | 简单 | 🔒 | -| 0244 | [最短单词距离 II](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README.md) | `设计`,`数组`,`哈希表`,`双指针`,`字符串` | 中等 | 🔒 | -| 0245 | [最短单词距离 III](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README.md) | `数组`,`字符串` | 中等 | 🔒 | -| 0246 | [中心对称数](/solution/0200-0299/0246.Strobogrammatic%20Number/README.md) | `哈希表`,`双指针`,`字符串` | 简单 | 🔒 | -| 0247 | [中心对称数 II](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README.md) | `递归`,`数组`,`字符串` | 中等 | 🔒 | -| 0248 | [中心对称数 III](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md) | `递归`,`数组`,`字符串` | 困难 | 🔒 | -| 0249 | [移位字符串分组](/solution/0200-0299/0249.Group%20Shifted%20Strings/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 🔒 | -| 0250 | [统计同值子树](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | -| 0251 | [展开二维向量](/solution/0200-0299/0251.Flatten%202D%20Vector/README.md) | `设计`,`数组`,`双指针`,`迭代器` | 中等 | 🔒 | -| 0252 | [会议室](/solution/0200-0299/0252.Meeting%20Rooms/README.md) | `数组`,`排序` | 简单 | 🔒 | -| 0253 | [会议室 II](/solution/0200-0299/0253.Meeting%20Rooms%20II/README.md) | `贪心`,`数组`,`双指针`,`前缀和`,`排序`,`堆（优先队列）` | 中等 | 🔒 | -| 0254 | [因子的组合](/solution/0200-0299/0254.Factor%20Combinations/README.md) | `回溯` | 中等 | 🔒 | -| 0255 | [验证二叉搜索树的前序遍历序列](/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README.md) | `栈`,`树`,`二叉搜索树`,`递归`,`数组`,`二叉树`,`单调栈` | 中等 | 🔒 | -| 0256 | [粉刷房子](/solution/0200-0299/0256.Paint%20House/README.md) | `数组`,`动态规划` | 中等 | 🔒 | -| 0257 | [二叉树的所有路径](/solution/0200-0299/0257.Binary%20Tree%20Paths/README.md) | `树`,`深度优先搜索`,`字符串`,`回溯`,`二叉树` | 简单 | | -| 0258 | [各位相加](/solution/0200-0299/0258.Add%20Digits/README.md) | `数学`,`数论`,`模拟` | 简单 | | -| 0259 | [较小的三数之和](/solution/0200-0299/0259.3Sum%20Smaller/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 🔒 | -| 0260 | [只出现一次的数字 III](/solution/0200-0299/0260.Single%20Number%20III/README.md) | `位运算`,`数组` | 中等 | | -| 0261 | [以图判树](/solution/0200-0299/0261.Graph%20Valid%20Tree/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 🔒 | -| 0262 | [行程和用户](/solution/0200-0299/0262.Trips%20and%20Users/README.md) | `数据库` | 困难 | | -| 0263 | [丑数](/solution/0200-0299/0263.Ugly%20Number/README.md) | `数学` | 简单 | | -| 0264 | [丑数 II](/solution/0200-0299/0264.Ugly%20Number%20II/README.md) | `哈希表`,`数学`,`动态规划`,`堆（优先队列）` | 中等 | | -| 0265 | [粉刷房子 II](/solution/0200-0299/0265.Paint%20House%20II/README.md) | `数组`,`动态规划` | 困难 | 🔒 | -| 0266 | [回文排列](/solution/0200-0299/0266.Palindrome%20Permutation/README.md) | `位运算`,`哈希表`,`字符串` | 简单 | 🔒 | -| 0267 | [回文排列 II](/solution/0200-0299/0267.Palindrome%20Permutation%20II/README.md) | `哈希表`,`字符串`,`回溯` | 中等 | 🔒 | -| 0268 | [丢失的数字](/solution/0200-0299/0268.Missing%20Number/README.md) | `位运算`,`数组`,`哈希表`,`数学`,`二分查找`,`排序` | 简单 | | -| 0269 | [火星词典](/solution/0200-0299/0269.Alien%20Dictionary/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序`,`数组`,`字符串` | 困难 | 🔒 | -| 0270 | [最接近的二叉搜索树值](/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二分查找`,`二叉树` | 简单 | 🔒 | -| 0271 | [字符串的编码与解码](/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README.md) | `设计`,`数组`,`字符串` | 中等 | 🔒 | -| 0272 | [最接近的二叉搜索树值 II](/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README.md) | `栈`,`树`,`深度优先搜索`,`二叉搜索树`,`双指针`,`二叉树`,`堆（优先队列）` | 困难 | 🔒 | -| 0273 | [整数转换英文表示](/solution/0200-0299/0273.Integer%20to%20English%20Words/README.md) | `递归`,`数学`,`字符串` | 困难 | | -| 0274 | [H 指数](/solution/0200-0299/0274.H-Index/README.md) | `数组`,`计数排序`,`排序` | 中等 | | -| 0275 | [H 指数 II](/solution/0200-0299/0275.H-Index%20II/README.md) | `数组`,`二分查找` | 中等 | | -| 0276 | [栅栏涂色](/solution/0200-0299/0276.Paint%20Fence/README.md) | `动态规划` | 中等 | 🔒 | -| 0277 | [搜寻名人](/solution/0200-0299/0277.Find%20the%20Celebrity/README.md) | `图`,`双指针`,`交互` | 中等 | 🔒 | -| 0278 | [第一个错误的版本](/solution/0200-0299/0278.First%20Bad%20Version/README.md) | `二分查找`,`交互` | 简单 | | -| 0279 | [完全平方数](/solution/0200-0299/0279.Perfect%20Squares/README.md) | `广度优先搜索`,`数学`,`动态规划` | 中等 | | -| 0280 | [摆动排序](/solution/0200-0299/0280.Wiggle%20Sort/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | -| 0281 | [锯齿迭代器](/solution/0200-0299/0281.Zigzag%20Iterator/README.md) | `设计`,`队列`,`数组`,`迭代器` | 中等 | 🔒 | -| 0282 | [给表达式添加运算符](/solution/0200-0299/0282.Expression%20Add%20Operators/README.md) | `数学`,`字符串`,`回溯` | 困难 | | -| 0283 | [移动零](/solution/0200-0299/0283.Move%20Zeroes/README.md) | `数组`,`双指针` | 简单 | | -| 0284 | [窥视迭代器](/solution/0200-0299/0284.Peeking%20Iterator/README.md) | `设计`,`数组`,`迭代器` | 中等 | | -| 0285 | [二叉搜索树中的中序后继](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | 🔒 | -| 0286 | [墙与门](/solution/0200-0299/0286.Walls%20and%20Gates/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 🔒 | -| 0287 | [寻找重复数](/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README.md) | `位运算`,`数组`,`双指针`,`二分查找` | 中等 | | -| 0288 | [单词的唯一缩写](/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README.md) | `设计`,`数组`,`哈希表`,`字符串` | 中等 | 🔒 | -| 0289 | [生命游戏](/solution/0200-0299/0289.Game%20of%20Life/README.md) | `数组`,`矩阵`,`模拟` | 中等 | | -| 0290 | [单词规律](/solution/0200-0299/0290.Word%20Pattern/README.md) | `哈希表`,`字符串` | 简单 | | -| 0291 | [单词规律 II](/solution/0200-0299/0291.Word%20Pattern%20II/README.md) | `哈希表`,`字符串`,`回溯` | 中等 | 🔒 | -| 0292 | [Nim 游戏](/solution/0200-0299/0292.Nim%20Game/README.md) | `脑筋急转弯`,`数学`,`博弈` | 简单 | | -| 0293 | [翻转游戏](/solution/0200-0299/0293.Flip%20Game/README.md) | `字符串` | 简单 | 🔒 | -| 0294 | [翻转游戏 II](/solution/0200-0299/0294.Flip%20Game%20II/README.md) | `记忆化搜索`,`数学`,`动态规划`,`回溯`,`博弈` | 中等 | 🔒 | -| 0295 | [数据流的中位数](/solution/0200-0299/0295.Find%20Median%20from%20Data%20Stream/README.md) | `设计`,`双指针`,`数据流`,`排序`,`堆（优先队列）` | 困难 | | -| 0296 | [最佳的碰头地点](/solution/0200-0299/0296.Best%20Meeting%20Point/README.md) | `数组`,`数学`,`矩阵`,`排序` | 困难 | 🔒 | -| 0297 | [二叉树的序列化与反序列化](/solution/0200-0299/0297.Serialize%20and%20Deserialize%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`字符串`,`二叉树` | 困难 | | -| 0298 | [二叉树最长连续序列](/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | -| 0299 | [猜数字游戏](/solution/0200-0299/0299.Bulls%20and%20Cows/README.md) | `哈希表`,`字符串`,`计数` | 中等 | | -| 0300 | [最长递增子序列](/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README.md) | `数组`,`二分查找`,`动态规划` | 中等 | | -| 0301 | [删除无效的括号](/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README.md) | `广度优先搜索`,`字符串`,`回溯` | 困难 | | -| 0302 | [包含全部黑色像素的最小矩形](/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`二分查找`,`矩阵` | 困难 | 🔒 | -| 0303 | [区域和检索 - 数组不可变](/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README.md) | `设计`,`数组`,`前缀和` | 简单 | | -| 0304 | [二维区域和检索 - 矩阵不可变](/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md) | `设计`,`数组`,`矩阵`,`前缀和` | 中等 | | -| 0305 | [岛屿数量 II](/solution/0300-0399/0305.Number%20of%20Islands%20II/README.md) | `并查集`,`数组`,`哈希表` | 困难 | 🔒 | -| 0306 | [累加数](/solution/0300-0399/0306.Additive%20Number/README.md) | `字符串`,`回溯` | 中等 | | -| 0307 | [区域和检索 - 数组可修改](/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README.md) | `设计`,`树状数组`,`线段树`,`数组` | 中等 | | -| 0308 | [二维区域和检索 - 可变](/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README.md) | `设计`,`树状数组`,`线段树`,`数组`,`矩阵` | 困难 | 🔒 | -| 0309 | [买卖股票的最佳时机含冷冻期](/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README.md) | `数组`,`动态规划` | 中等 | | -| 0310 | [最小高度树](/solution/0300-0399/0310.Minimum%20Height%20Trees/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | | -| 0311 | [稀疏矩阵的乘法](/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 🔒 | -| 0312 | [戳气球](/solution/0300-0399/0312.Burst%20Balloons/README.md) | `数组`,`动态规划` | 困难 | | -| 0313 | [超级丑数](/solution/0300-0399/0313.Super%20Ugly%20Number/README.md) | `数组`,`数学`,`动态规划` | 中等 | | -| 0314 | [二叉树的垂直遍历](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树`,`排序` | 中等 | 🔒 | -| 0315 | [计算右侧小于当前元素的个数](/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | | -| 0316 | [去除重复字母](/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README.md) | `栈`,`贪心`,`字符串`,`单调栈` | 中等 | | -| 0317 | [离建筑物最近的距离](/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README.md) | `广度优先搜索`,`数组`,`矩阵` | 困难 | 🔒 | -| 0318 | [最大单词长度乘积](/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README.md) | `位运算`,`数组`,`字符串` | 中等 | | -| 0319 | [灯泡开关](/solution/0300-0399/0319.Bulb%20Switcher/README.md) | `脑筋急转弯`,`数学` | 中等 | | -| 0320 | [列举单词的全部缩写](/solution/0300-0399/0320.Generalized%20Abbreviation/README.md) | `位运算`,`字符串`,`回溯` | 中等 | 🔒 | -| 0321 | [拼接最大数](/solution/0300-0399/0321.Create%20Maximum%20Number/README.md) | `栈`,`贪心`,`数组`,`双指针`,`单调栈` | 困难 | | -| 0322 | [零钱兑换](/solution/0300-0399/0322.Coin%20Change/README.md) | `广度优先搜索`,`数组`,`动态规划` | 中等 | | -| 0323 | [无向图中连通分量的数目](/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 🔒 | -| 0324 | [摆动排序 II](/solution/0300-0399/0324.Wiggle%20Sort%20II/README.md) | `贪心`,`数组`,`分治`,`快速选择`,`排序` | 中等 | | -| 0325 | [和等于 k 的最长子数组长度](/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 🔒 | -| 0326 | [3 的幂](/solution/0300-0399/0326.Power%20of%20Three/README.md) | `递归`,`数学` | 简单 | | -| 0327 | [区间和的个数](/solution/0300-0399/0327.Count%20of%20Range%20Sum/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | | -| 0328 | [奇偶链表](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README.md) | `链表` | 中等 | | -| 0329 | [矩阵中的最长递增路径](/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序`,`记忆化搜索`,`数组`,`动态规划`,`矩阵` | 困难 | | -| 0330 | [按要求补齐数组](/solution/0300-0399/0330.Patching%20Array/README.md) | `贪心`,`数组` | 困难 | | -| 0331 | [验证二叉树的前序序列化](/solution/0300-0399/0331.Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README.md) | `栈`,`树`,`字符串`,`二叉树` | 中等 | | -| 0332 | [重新安排行程](/solution/0300-0399/0332.Reconstruct%20Itinerary/README.md) | `深度优先搜索`,`图`,`欧拉回路` | 困难 | | -| 0333 | [最大二叉搜索子树](/solution/0300-0399/0333.Largest%20BST%20Subtree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`动态规划`,`二叉树` | 中等 | 🔒 | -| 0334 | [递增的三元子序列](/solution/0300-0399/0334.Increasing%20Triplet%20Subsequence/README.md) | `贪心`,`数组` | 中等 | | -| 0335 | [路径交叉](/solution/0300-0399/0335.Self%20Crossing/README.md) | `几何`,`数组`,`数学` | 困难 | | -| 0336 | [回文对](/solution/0300-0399/0336.Palindrome%20Pairs/README.md) | `字典树`,`数组`,`哈希表`,`字符串` | 困难 | | -| 0337 | [打家劫舍 III](/solution/0300-0399/0337.House%20Robber%20III/README.md) | `树`,`深度优先搜索`,`动态规划`,`二叉树` | 中等 | | -| 0338 | [比特位计数](/solution/0300-0399/0338.Counting%20Bits/README.md) | `位运算`,`动态规划` | 简单 | | -| 0339 | [嵌套列表加权和](/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README.md) | `深度优先搜索`,`广度优先搜索` | 中等 | 🔒 | -| 0340 | [至多包含 K 个不同字符的最长子串](/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 🔒 | -| 0341 | [扁平化嵌套列表迭代器](/solution/0300-0399/0341.Flatten%20Nested%20List%20Iterator/README.md) | `栈`,`树`,`深度优先搜索`,`设计`,`队列`,`迭代器` | 中等 | | -| 0342 | [4 的幂](/solution/0300-0399/0342.Power%20of%20Four/README.md) | `位运算`,`递归`,`数学` | 简单 | | -| 0343 | [整数拆分](/solution/0300-0399/0343.Integer%20Break/README.md) | `数学`,`动态规划` | 中等 | | -| 0344 | [反转字符串](/solution/0300-0399/0344.Reverse%20String/README.md) | `双指针`,`字符串` | 简单 | | -| 0345 | [反转字符串中的元音字母](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README.md) | `双指针`,`字符串` | 简单 | | -| 0346 | [数据流中的移动平均值](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README.md) | `设计`,`队列`,`数组`,`数据流` | 简单 | 🔒 | -| 0347 | [前 K 个高频元素](/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README.md) | `数组`,`哈希表`,`分治`,`桶排序`,`计数`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | | -| 0348 | [设计井字棋](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README.md) | `设计`,`数组`,`哈希表`,`矩阵`,`模拟` | 中等 | 🔒 | -| 0349 | [两个数组的交集](/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`排序` | 简单 | | -| 0350 | [两个数组的交集 II](/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`排序` | 简单 | | -| 0351 | [安卓系统手势解锁](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README.md) | `位运算`,`动态规划`,`回溯`,`状态压缩` | 中等 | 🔒 | -| 0352 | [将数据流变为多个不相交区间](/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README.md) | `设计`,`二分查找`,`有序集合` | 困难 | | -| 0353 | [贪吃蛇](/solution/0300-0399/0353.Design%20Snake%20Game/README.md) | `设计`,`队列`,`数组`,`哈希表`,`模拟` | 中等 | 🔒 | -| 0354 | [俄罗斯套娃信封问题](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md) | `数组`,`二分查找`,`动态规划`,`排序` | 困难 | | -| 0355 | [设计推特](/solution/0300-0399/0355.Design%20Twitter/README.md) | `设计`,`哈希表`,`链表`,`堆（优先队列）` | 中等 | | -| 0356 | [直线镜像](/solution/0300-0399/0356.Line%20Reflection/README.md) | `数组`,`哈希表`,`数学` | 中等 | 🔒 | -| 0357 | [统计各位数字都不同的数字个数](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md) | `数学`,`动态规划`,`回溯` | 中等 | | -| 0358 | [K 距离间隔重排字符串](/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序`,`堆（优先队列）` | 困难 | 🔒 | -| 0359 | [日志速率限制器](/solution/0300-0399/0359.Logger%20Rate%20Limiter/README.md) | `设计`,`哈希表`,`数据流` | 简单 | 🔒 | -| 0360 | [有序转化数组](/solution/0300-0399/0360.Sort%20Transformed%20Array/README.md) | `数组`,`数学`,`双指针`,`排序` | 中等 | 🔒 | -| 0361 | [轰炸敌人](/solution/0300-0399/0361.Bomb%20Enemy/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 🔒 | -| 0362 | [敲击计数器](/solution/0300-0399/0362.Design%20Hit%20Counter/README.md) | `设计`,`队列`,`数组`,`二分查找`,`数据流` | 中等 | 🔒 | -| 0363 | [矩形区域不超过 K 的最大数值和](/solution/0300-0399/0363.Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/README.md) | `数组`,`二分查找`,`矩阵`,`有序集合`,`前缀和` | 困难 | | -| 0364 | [嵌套列表加权和 II](/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README.md) | `栈`,`深度优先搜索`,`广度优先搜索` | 中等 | 🔒 | -| 0365 | [水壶问题](/solution/0300-0399/0365.Water%20and%20Jug%20Problem/README.md) | `深度优先搜索`,`广度优先搜索`,`数学` | 中等 | | -| 0366 | [寻找二叉树的叶子节点](/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | -| 0367 | [有效的完全平方数](/solution/0300-0399/0367.Valid%20Perfect%20Square/README.md) | `数学`,`二分查找` | 简单 | | -| 0368 | [最大整除子集](/solution/0300-0399/0368.Largest%20Divisible%20Subset/README.md) | `数组`,`数学`,`动态规划`,`排序` | 中等 | | -| 0369 | [给单链表加一](/solution/0300-0399/0369.Plus%20One%20Linked%20List/README.md) | `链表`,`数学` | 中等 | 🔒 | -| 0370 | [区间加法](/solution/0300-0399/0370.Range%20Addition/README.md) | `数组`,`前缀和` | 中等 | 🔒 | -| 0371 | [两整数之和](/solution/0300-0399/0371.Sum%20of%20Two%20Integers/README.md) | `位运算`,`数学` | 中等 | | -| 0372 | [超级次方](/solution/0300-0399/0372.Super%20Pow/README.md) | `数学`,`分治` | 中等 | | -| 0373 | [查找和最小的 K 对数字](/solution/0300-0399/0373.Find%20K%20Pairs%20with%20Smallest%20Sums/README.md) | `数组`,`堆（优先队列）` | 中等 | | -| 0374 | [猜数字大小](/solution/0300-0399/0374.Guess%20Number%20Higher%20or%20Lower/README.md) | `二分查找`,`交互` | 简单 | | -| 0375 | [猜数字大小 II](/solution/0300-0399/0375.Guess%20Number%20Higher%20or%20Lower%20II/README.md) | `数学`,`动态规划`,`博弈` | 中等 | | -| 0376 | [摆动序列](/solution/0300-0399/0376.Wiggle%20Subsequence/README.md) | `贪心`,`数组`,`动态规划` | 中等 | | -| 0377 | [组合总和 Ⅳ](/solution/0300-0399/0377.Combination%20Sum%20IV/README.md) | `数组`,`动态规划` | 中等 | | -| 0378 | [有序矩阵中第 K 小的元素](/solution/0300-0399/0378.Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/README.md) | `数组`,`二分查找`,`矩阵`,`排序`,`堆（优先队列）` | 中等 | | -| 0379 | [电话目录管理系统](/solution/0300-0399/0379.Design%20Phone%20Directory/README.md) | `设计`,`队列`,`数组`,`哈希表`,`链表` | 中等 | 🔒 | -| 0380 | [O(1) 时间插入、删除和获取随机元素](/solution/0300-0399/0380.Insert%20Delete%20GetRandom%20O%281%29/README.md) | `设计`,`数组`,`哈希表`,`数学`,`随机化` | 中等 | | -| 0381 | [O(1) 时间插入、删除和获取随机元素 - 允许重复](/solution/0300-0399/0381.Insert%20Delete%20GetRandom%20O%281%29%20-%20Duplicates%20allowed/README.md) | `设计`,`数组`,`哈希表`,`数学`,`随机化` | 困难 | | -| 0382 | [链表随机节点](/solution/0300-0399/0382.Linked%20List%20Random%20Node/README.md) | `水塘抽样`,`链表`,`数学`,`随机化` | 中等 | | -| 0383 | [赎金信](/solution/0300-0399/0383.Ransom%20Note/README.md) | `哈希表`,`字符串`,`计数` | 简单 | | -| 0384 | [打乱数组](/solution/0300-0399/0384.Shuffle%20an%20Array/README.md) | `数组`,`数学`,`随机化` | 中等 | | -| 0385 | [迷你语法分析器](/solution/0300-0399/0385.Mini%20Parser/README.md) | `栈`,`深度优先搜索`,`字符串` | 中等 | | -| 0386 | [字典序排数](/solution/0300-0399/0386.Lexicographical%20Numbers/README.md) | `深度优先搜索`,`字典树` | 中等 | | -| 0387 | [字符串中的第一个唯一字符](/solution/0300-0399/0387.First%20Unique%20Character%20in%20a%20String/README.md) | `队列`,`哈希表`,`字符串`,`计数` | 简单 | | -| 0388 | [文件的最长绝对路径](/solution/0300-0399/0388.Longest%20Absolute%20File%20Path/README.md) | `栈`,`深度优先搜索`,`字符串` | 中等 | | -| 0389 | [找不同](/solution/0300-0399/0389.Find%20the%20Difference/README.md) | `位运算`,`哈希表`,`字符串`,`排序` | 简单 | | -| 0390 | [消除游戏](/solution/0300-0399/0390.Elimination%20Game/README.md) | `递归`,`数学` | 中等 | | -| 0391 | [完美矩形](/solution/0300-0399/0391.Perfect%20Rectangle/README.md) | `数组`,`扫描线` | 困难 | | -| 0392 | [判断子序列](/solution/0300-0399/0392.Is%20Subsequence/README.md) | `双指针`,`字符串`,`动态规划` | 简单 | | -| 0393 | [UTF-8 编码验证](/solution/0300-0399/0393.UTF-8%20Validation/README.md) | `位运算`,`数组` | 中等 | | -| 0394 | [字符串解码](/solution/0300-0399/0394.Decode%20String/README.md) | `栈`,`递归`,`字符串` | 中等 | | -| 0395 | [至少有 K 个重复字符的最长子串](/solution/0300-0399/0395.Longest%20Substring%20with%20At%20Least%20K%20Repeating%20Characters/README.md) | `哈希表`,`字符串`,`分治`,`滑动窗口` | 中等 | | -| 0396 | [旋转函数](/solution/0300-0399/0396.Rotate%20Function/README.md) | `数组`,`数学`,`动态规划` | 中等 | | -| 0397 | [整数替换](/solution/0300-0399/0397.Integer%20Replacement/README.md) | `贪心`,`位运算`,`记忆化搜索`,`动态规划` | 中等 | | -| 0398 | [随机数索引](/solution/0300-0399/0398.Random%20Pick%20Index/README.md) | `水塘抽样`,`哈希表`,`数学`,`随机化` | 中等 | | -| 0399 | [除法求值](/solution/0300-0399/0399.Evaluate%20Division/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`数组`,`字符串`,`最短路` | 中等 | | -| 0400 | [第 N 位数字](/solution/0400-0499/0400.Nth%20Digit/README.md) | `数学`,`二分查找` | 中等 | | -| 0401 | [二进制手表](/solution/0400-0499/0401.Binary%20Watch/README.md) | `位运算`,`回溯` | 简单 | | -| 0402 | [移掉 K 位数字](/solution/0400-0499/0402.Remove%20K%20Digits/README.md) | `栈`,`贪心`,`字符串`,`单调栈` | 中等 | | -| 0403 | [青蛙过河](/solution/0400-0499/0403.Frog%20Jump/README.md) | `数组`,`动态规划` | 困难 | | -| 0404 | [左叶子之和](/solution/0400-0499/0404.Sum%20of%20Left%20Leaves/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | -| 0405 | [数字转换为十六进制数](/solution/0400-0499/0405.Convert%20a%20Number%20to%20Hexadecimal/README.md) | `位运算`,`数学` | 简单 | | -| 0406 | [根据身高重建队列](/solution/0400-0499/0406.Queue%20Reconstruction%20by%20Height/README.md) | `树状数组`,`线段树`,`数组`,`排序` | 中等 | | -| 0407 | [接雨水 II](/solution/0400-0499/0407.Trapping%20Rain%20Water%20II/README.md) | `广度优先搜索`,`数组`,`矩阵`,`堆（优先队列）` | 困难 | | -| 0408 | [有效单词缩写](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README.md) | `双指针`,`字符串` | 简单 | 🔒 | -| 0409 | [最长回文串](/solution/0400-0499/0409.Longest%20Palindrome/README.md) | `贪心`,`哈希表`,`字符串` | 简单 | | -| 0410 | [分割数组的最大值](/solution/0400-0499/0410.Split%20Array%20Largest%20Sum/README.md) | `贪心`,`数组`,`二分查找`,`动态规划`,`前缀和` | 困难 | | -| 0411 | [最短独占单词缩写](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README.md) | `位运算`,`字符串`,`回溯` | 困难 | 🔒 | -| 0412 | [Fizz Buzz](/solution/0400-0499/0412.Fizz%20Buzz/README.md) | `数学`,`字符串`,`模拟` | 简单 | | -| 0413 | [等差数列划分](/solution/0400-0499/0413.Arithmetic%20Slices/README.md) | `数组`,`动态规划` | 中等 | | -| 0414 | [第三大的数](/solution/0400-0499/0414.Third%20Maximum%20Number/README.md) | `数组`,`排序` | 简单 | | -| 0415 | [字符串相加](/solution/0400-0499/0415.Add%20Strings/README.md) | `数学`,`字符串`,`模拟` | 简单 | | -| 0416 | [分割等和子集](/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README.md) | `数组`,`动态规划` | 中等 | | -| 0417 | [太平洋大西洋水流问题](/solution/0400-0499/0417.Pacific%20Atlantic%20Water%20Flow/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | | -| 0418 | [屏幕可显示句子的数量](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README.md) | `数组`,`字符串`,`动态规划` | 中等 | 🔒 | -| 0419 | [棋盘上的战舰](/solution/0400-0499/0419.Battleships%20in%20a%20Board/README.md) | `深度优先搜索`,`数组`,`矩阵` | 中等 | | -| 0420 | [强密码检验器](/solution/0400-0499/0420.Strong%20Password%20Checker/README.md) | `贪心`,`字符串`,`堆（优先队列）` | 困难 | | -| 0421 | [数组中两个数的最大异或值](/solution/0400-0499/0421.Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/README.md) | `位运算`,`字典树`,`数组`,`哈希表` | 中等 | | -| 0422 | [有效的单词方块](/solution/0400-0499/0422.Valid%20Word%20Square/README.md) | `数组`,`矩阵` | 简单 | 🔒 | -| 0423 | [从英文中重建数字](/solution/0400-0499/0423.Reconstruct%20Original%20Digits%20from%20English/README.md) | `哈希表`,`数学`,`字符串` | 中等 | | -| 0424 | [替换后的最长重复字符](/solution/0400-0499/0424.Longest%20Repeating%20Character%20Replacement/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | | -| 0425 | [单词方块](/solution/0400-0499/0425.Word%20Squares/README.md) | `字典树`,`数组`,`字符串`,`回溯` | 困难 | 🔒 | -| 0426 | [将二叉搜索树转化为排序的双向链表](/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README.md) | `栈`,`树`,`深度优先搜索`,`二叉搜索树`,`链表`,`二叉树`,`双向链表` | 中等 | 🔒 | -| 0427 | [建立四叉树](/solution/0400-0499/0427.Construct%20Quad%20Tree/README.md) | `树`,`数组`,`分治`,`矩阵` | 中等 | | -| 0428 | [序列化和反序列化 N 叉树](/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`字符串` | 困难 | 🔒 | -| 0429 | [N 叉树的层序遍历](/solution/0400-0499/0429.N-ary%20Tree%20Level%20Order%20Traversal/README.md) | `树`,`广度优先搜索` | 中等 | | -| 0430 | [扁平化多级双向链表](/solution/0400-0499/0430.Flatten%20a%20Multilevel%20Doubly%20Linked%20List/README.md) | `深度优先搜索`,`链表`,`双向链表` | 中等 | | -| 0431 | [将 N 叉树编码为二叉树](/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`二叉树` | 困难 | 🔒 | -| 0432 | [全 O(1) 的数据结构](/solution/0400-0499/0432.All%20O%60one%20Data%20Structure/README.md) | `设计`,`哈希表`,`链表`,`双向链表` | 困难 | | -| 0433 | [最小基因变化](/solution/0400-0499/0433.Minimum%20Genetic%20Mutation/README.md) | `广度优先搜索`,`哈希表`,`字符串` | 中等 | | -| 0434 | [字符串中的单词数](/solution/0400-0499/0434.Number%20of%20Segments%20in%20a%20String/README.md) | `字符串` | 简单 | | -| 0435 | [无重叠区间](/solution/0400-0499/0435.Non-overlapping%20Intervals/README.md) | `贪心`,`数组`,`动态规划`,`排序` | 中等 | | -| 0436 | [寻找右区间](/solution/0400-0499/0436.Find%20Right%20Interval/README.md) | `数组`,`二分查找`,`排序` | 中等 | | -| 0437 | [路径总和 III](/solution/0400-0499/0437.Path%20Sum%20III/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | | -| 0438 | [找到字符串中所有字母异位词](/solution/0400-0499/0438.Find%20All%20Anagrams%20in%20a%20String/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | | -| 0439 | [三元表达式解析器](/solution/0400-0499/0439.Ternary%20Expression%20Parser/README.md) | `栈`,`递归`,`字符串` | 中等 | 🔒 | -| 0440 | [字典序的第 K 小数字](/solution/0400-0499/0440.K-th%20Smallest%20in%20Lexicographical%20Order/README.md) | `字典树` | 困难 | | -| 0441 | [排列硬币](/solution/0400-0499/0441.Arranging%20Coins/README.md) | `数学`,`二分查找` | 简单 | | -| 0442 | [数组中重复的数据](/solution/0400-0499/0442.Find%20All%20Duplicates%20in%20an%20Array/README.md) | `数组`,`哈希表` | 中等 | | -| 0443 | [压缩字符串](/solution/0400-0499/0443.String%20Compression/README.md) | `双指针`,`字符串` | 中等 | | -| 0444 | [序列重建](/solution/0400-0499/0444.Sequence%20Reconstruction/README.md) | `图`,`拓扑排序`,`数组` | 中等 | 🔒 | -| 0445 | [两数相加 II](/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README.md) | `栈`,`链表`,`数学` | 中等 | | -| 0446 | [等差数列划分 II - 子序列](/solution/0400-0499/0446.Arithmetic%20Slices%20II%20-%20Subsequence/README.md) | `数组`,`动态规划` | 困难 | | -| 0447 | [回旋镖的数量](/solution/0400-0499/0447.Number%20of%20Boomerangs/README.md) | `数组`,`哈希表`,`数学` | 中等 | | -| 0448 | [找到所有数组中消失的数字](/solution/0400-0499/0448.Find%20All%20Numbers%20Disappeared%20in%20an%20Array/README.md) | `数组`,`哈希表` | 简单 | | -| 0449 | [序列化和反序列化二叉搜索树](/solution/0400-0499/0449.Serialize%20and%20Deserialize%20BST/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`二叉搜索树`,`字符串`,`二叉树` | 中等 | | -| 0450 | [删除二叉搜索树中的节点](/solution/0400-0499/0450.Delete%20Node%20in%20a%20BST/README.md) | `树`,`二叉搜索树`,`二叉树` | 中等 | | -| 0451 | [根据字符出现频率排序](/solution/0400-0499/0451.Sort%20Characters%20By%20Frequency/README.md) | `哈希表`,`字符串`,`桶排序`,`计数`,`排序`,`堆（优先队列）` | 中等 | | -| 0452 | [用最少数量的箭引爆气球](/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README.md) | `贪心`,`数组`,`排序` | 中等 | | -| 0453 | [最小操作次数使数组元素相等](/solution/0400-0499/0453.Minimum%20Moves%20to%20Equal%20Array%20Elements/README.md) | `数组`,`数学` | 中等 | | -| 0454 | [四数相加 II](/solution/0400-0499/0454.4Sum%20II/README.md) | `数组`,`哈希表` | 中等 | | -| 0455 | [分发饼干](/solution/0400-0499/0455.Assign%20Cookies/README.md) | `贪心`,`数组`,`双指针`,`排序` | 简单 | | -| 0456 | [132 模式](/solution/0400-0499/0456.132%20Pattern/README.md) | `栈`,`数组`,`二分查找`,`有序集合`,`单调栈` | 中等 | | -| 0457 | [环形数组是否存在循环](/solution/0400-0499/0457.Circular%20Array%20Loop/README.md) | `数组`,`哈希表`,`双指针` | 中等 | | -| 0458 | [可怜的小猪](/solution/0400-0499/0458.Poor%20Pigs/README.md) | `数学`,`动态规划`,`组合数学` | 困难 | | -| 0459 | [重复的子字符串](/solution/0400-0499/0459.Repeated%20Substring%20Pattern/README.md) | `字符串`,`字符串匹配` | 简单 | | -| 0460 | [LFU 缓存](/solution/0400-0499/0460.LFU%20Cache/README.md) | `设计`,`哈希表`,`链表`,`双向链表` | 困难 | | -| 0461 | [汉明距离](/solution/0400-0499/0461.Hamming%20Distance/README.md) | `位运算` | 简单 | | -| 0462 | [最小操作次数使数组元素相等 II](/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md) | `数组`,`数学`,`排序` | 中等 | | -| 0463 | [岛屿的周长](/solution/0400-0499/0463.Island%20Perimeter/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 简单 | | -| 0464 | [我能赢吗](/solution/0400-0499/0464.Can%20I%20Win/README.md) | `位运算`,`记忆化搜索`,`数学`,`动态规划`,`状态压缩`,`博弈` | 中等 | | -| 0465 | [最优账单平衡](/solution/0400-0499/0465.Optimal%20Account%20Balancing/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 困难 | 🔒 | -| 0466 | [统计重复个数](/solution/0400-0499/0466.Count%20The%20Repetitions/README.md) | `字符串`,`动态规划` | 困难 | | -| 0467 | [环绕字符串中唯一的子字符串](/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README.md) | `字符串`,`动态规划` | 中等 | | -| 0468 | [验证 IP 地址](/solution/0400-0499/0468.Validate%20IP%20Address/README.md) | `字符串` | 中等 | | -| 0469 | [凸多边形](/solution/0400-0499/0469.Convex%20Polygon/README.md) | `几何`,`数组`,`数学` | 中等 | 🔒 | -| 0470 | [用 Rand7() 实现 Rand10()](/solution/0400-0499/0470.Implement%20Rand10%28%29%20Using%20Rand7%28%29/README.md) | `数学`,`拒绝采样`,`概率与统计`,`随机化` | 中等 | | -| 0471 | [编码最短长度的字符串](/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README.md) | `字符串`,`动态规划` | 困难 | 🔒 | -| 0472 | [连接词](/solution/0400-0499/0472.Concatenated%20Words/README.md) | `深度优先搜索`,`字典树`,`数组`,`字符串`,`动态规划` | 困难 | | -| 0473 | [火柴拼正方形](/solution/0400-0499/0473.Matchsticks%20to%20Square/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | | -| 0474 | [一和零](/solution/0400-0499/0474.Ones%20and%20Zeroes/README.md) | `数组`,`字符串`,`动态规划` | 中等 | | -| 0475 | [供暖器](/solution/0400-0499/0475.Heaters/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | | -| 0476 | [数字的补数](/solution/0400-0499/0476.Number%20Complement/README.md) | `位运算` | 简单 | | -| 0477 | [汉明距离总和](/solution/0400-0499/0477.Total%20Hamming%20Distance/README.md) | `位运算`,`数组`,`数学` | 中等 | | -| 0478 | [在圆内随机生成点](/solution/0400-0499/0478.Generate%20Random%20Point%20in%20a%20Circle/README.md) | `几何`,`数学`,`拒绝采样`,`随机化` | 中等 | | -| 0479 | [最大回文数乘积](/solution/0400-0499/0479.Largest%20Palindrome%20Product/README.md) | `数学`,`枚举` | 困难 | | -| 0480 | [滑动窗口中位数](/solution/0400-0499/0480.Sliding%20Window%20Median/README.md) | `数组`,`哈希表`,`滑动窗口`,`堆（优先队列）` | 困难 | | -| 0481 | [神奇字符串](/solution/0400-0499/0481.Magical%20String/README.md) | `双指针`,`字符串` | 中等 | | -| 0482 | [密钥格式化](/solution/0400-0499/0482.License%20Key%20Formatting/README.md) | `字符串` | 简单 | | -| 0483 | [最小好进制](/solution/0400-0499/0483.Smallest%20Good%20Base/README.md) | `数学`,`二分查找` | 困难 | | -| 0484 | [寻找排列](/solution/0400-0499/0484.Find%20Permutation/README.md) | `栈`,`贪心`,`数组`,`字符串` | 中等 | 🔒 | -| 0485 | [最大连续 1 的个数](/solution/0400-0499/0485.Max%20Consecutive%20Ones/README.md) | `数组` | 简单 | | -| 0486 | [预测赢家](/solution/0400-0499/0486.Predict%20the%20Winner/README.md) | `递归`,`数组`,`数学`,`动态规划`,`博弈` | 中等 | | -| 0487 | [最大连续 1 的个数 II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README.md) | `数组`,`动态规划`,`滑动窗口` | 中等 | 🔒 | -| 0488 | [祖玛游戏](/solution/0400-0499/0488.Zuma%20Game/README.md) | `栈`,`广度优先搜索`,`记忆化搜索`,`字符串`,`动态规划` | 困难 | | -| 0489 | [扫地机器人](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README.md) | `回溯`,`交互` | 困难 | 🔒 | -| 0490 | [迷宫](/solution/0400-0499/0490.The%20Maze/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | 🔒 | -| 0491 | [非递减子序列](/solution/0400-0499/0491.Non-decreasing%20Subsequences/README.md) | `位运算`,`数组`,`哈希表`,`回溯` | 中等 | | -| 0492 | [构造矩形](/solution/0400-0499/0492.Construct%20the%20Rectangle/README.md) | `数学` | 简单 | | -| 0493 | [翻转对](/solution/0400-0499/0493.Reverse%20Pairs/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | | -| 0494 | [目标和](/solution/0400-0499/0494.Target%20Sum/README.md) | `数组`,`动态规划`,`回溯` | 中等 | | -| 0495 | [提莫攻击](/solution/0400-0499/0495.Teemo%20Attacking/README.md) | `数组`,`模拟` | 简单 | | -| 0496 | [下一个更大元素 I](/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md) | `栈`,`数组`,`哈希表`,`单调栈` | 简单 | | -| 0497 | [非重叠矩形中的随机点](/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README.md) | `水塘抽样`,`数组`,`数学`,`二分查找`,`有序集合`,`前缀和`,`随机化` | 中等 | | -| 0498 | [对角线遍历](/solution/0400-0499/0498.Diagonal%20Traverse/README.md) | `数组`,`矩阵`,`模拟` | 中等 | | -| 0499 | [迷宫 III](/solution/0400-0499/0499.The%20Maze%20III/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`数组`,`字符串`,`矩阵`,`最短路`,`堆（优先队列）` | 困难 | 🔒 | -| 0500 | [键盘行](/solution/0500-0599/0500.Keyboard%20Row/README.md) | `数组`,`哈希表`,`字符串` | 简单 | | -| 0501 | [二叉搜索树中的众数](/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 简单 | | -| 0502 | [IPO](/solution/0500-0599/0502.IPO/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 困难 | | -| 0503 | [下一个更大元素 II](/solution/0500-0599/0503.Next%20Greater%20Element%20II/README.md) | `栈`,`数组`,`单调栈` | 中等 | | -| 0504 | [七进制数](/solution/0500-0599/0504.Base%207/README.md) | `数学` | 简单 | | -| 0505 | [迷宫 II](/solution/0500-0599/0505.The%20Maze%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`数组`,`矩阵`,`最短路`,`堆（优先队列）` | 中等 | 🔒 | -| 0506 | [相对名次](/solution/0500-0599/0506.Relative%20Ranks/README.md) | `数组`,`排序`,`堆（优先队列）` | 简单 | | -| 0507 | [完美数](/solution/0500-0599/0507.Perfect%20Number/README.md) | `数学` | 简单 | | -| 0508 | [出现次数最多的子树元素和](/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README.md) | `树`,`深度优先搜索`,`哈希表`,`二叉树` | 中等 | | -| 0509 | [斐波那契数](/solution/0500-0599/0509.Fibonacci%20Number/README.md) | `递归`,`记忆化搜索`,`数学`,`动态规划` | 简单 | | -| 0510 | [二叉搜索树中的中序后继 II](/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README.md) | `树`,`二叉搜索树`,`二叉树` | 中等 | 🔒 | -| 0511 | [游戏玩法分析 I](/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README.md) | `数据库` | 简单 | | -| 0512 | [游戏玩法分析 II](/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README.md) | `数据库` | 简单 | 🔒 | -| 0513 | [找树左下角的值](/solution/0500-0599/0513.Find%20Bottom%20Left%20Tree%20Value/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | -| 0514 | [自由之路](/solution/0500-0599/0514.Freedom%20Trail/README.md) | `深度优先搜索`,`广度优先搜索`,`字符串`,`动态规划` | 困难 | | -| 0515 | [在每个树行中找最大值](/solution/0500-0599/0515.Find%20Largest%20Value%20in%20Each%20Tree%20Row/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | -| 0516 | [最长回文子序列](/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README.md) | `字符串`,`动态规划` | 中等 | | -| 0517 | [超级洗衣机](/solution/0500-0599/0517.Super%20Washing%20Machines/README.md) | `贪心`,`数组` | 困难 | | -| 0518 | [零钱兑换 II](/solution/0500-0599/0518.Coin%20Change%20II/README.md) | `数组`,`动态规划` | 中等 | | -| 0519 | [随机翻转矩阵](/solution/0500-0599/0519.Random%20Flip%20Matrix/README.md) | `水塘抽样`,`哈希表`,`数学`,`随机化` | 中等 | | -| 0520 | [检测大写字母](/solution/0500-0599/0520.Detect%20Capital/README.md) | `字符串` | 简单 | | -| 0521 | [最长特殊序列 Ⅰ](/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README.md) | `字符串` | 简单 | | -| 0522 | [最长特殊序列 II](/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README.md) | `数组`,`哈希表`,`双指针`,`字符串`,`排序` | 中等 | | -| 0523 | [连续的子数组和](/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README.md) | `数组`,`哈希表`,`数学`,`前缀和` | 中等 | | -| 0524 | [通过删除字母匹配到字典里最长单词](/solution/0500-0599/0524.Longest%20Word%20in%20Dictionary%20through%20Deleting/README.md) | `数组`,`双指针`,`字符串`,`排序` | 中等 | | -| 0525 | [连续数组](/solution/0500-0599/0525.Contiguous%20Array/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | | -| 0526 | [优美的排列](/solution/0500-0599/0526.Beautiful%20Arrangement/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | | -| 0527 | [单词缩写](/solution/0500-0599/0527.Word%20Abbreviation/README.md) | `贪心`,`字典树`,`数组`,`字符串`,`排序` | 困难 | 🔒 | -| 0528 | [按权重随机选择](/solution/0500-0599/0528.Random%20Pick%20with%20Weight/README.md) | `数组`,`数学`,`二分查找`,`前缀和`,`随机化` | 中等 | | -| 0529 | [扫雷游戏](/solution/0500-0599/0529.Minesweeper/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | | -| 0530 | [二叉搜索树的最小绝对差](/solution/0500-0599/0530.Minimum%20Absolute%20Difference%20in%20BST/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉搜索树`,`二叉树` | 简单 | | -| 0531 | [孤独像素 I](/solution/0500-0599/0531.Lonely%20Pixel%20I/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 🔒 | -| 0532 | [数组中的 k-diff 数对](/solution/0500-0599/0532.K-diff%20Pairs%20in%20an%20Array/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`排序` | 中等 | | -| 0533 | [孤独像素 II](/solution/0500-0599/0533.Lonely%20Pixel%20II/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 🔒 | -| 0534 | [游戏玩法分析 III](/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README.md) | `数据库` | 中等 | 🔒 | -| 0535 | [TinyURL 的加密与解密](/solution/0500-0599/0535.Encode%20and%20Decode%20TinyURL/README.md) | `设计`,`哈希表`,`字符串`,`哈希函数` | 中等 | | -| 0536 | [从字符串生成二叉树](/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README.md) | `栈`,`树`,`深度优先搜索`,`字符串`,`二叉树` | 中等 | 🔒 | -| 0537 | [复数乘法](/solution/0500-0599/0537.Complex%20Number%20Multiplication/README.md) | `数学`,`字符串`,`模拟` | 中等 | | -| 0538 | [把二叉搜索树转换为累加树](/solution/0500-0599/0538.Convert%20BST%20to%20Greater%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | -| 0539 | [最小时间差](/solution/0500-0599/0539.Minimum%20Time%20Difference/README.md) | `数组`,`数学`,`字符串`,`排序` | 中等 | | -| 0540 | [有序数组中的单一元素](/solution/0500-0599/0540.Single%20Element%20in%20a%20Sorted%20Array/README.md) | `数组`,`二分查找` | 中等 | | -| 0541 | [反转字符串 II](/solution/0500-0599/0541.Reverse%20String%20II/README.md) | `双指针`,`字符串` | 简单 | | -| 0542 | [01 矩阵](/solution/0500-0599/0542.01%20Matrix/README.md) | `广度优先搜索`,`数组`,`动态规划`,`矩阵` | 中等 | | -| 0543 | [二叉树的直径](/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | | -| 0544 | [输出比赛匹配对](/solution/0500-0599/0544.Output%20Contest%20Matches/README.md) | `递归`,`字符串`,`模拟` | 中等 | 🔒 | -| 0545 | [二叉树的边界](/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | -| 0546 | [移除盒子](/solution/0500-0599/0546.Remove%20Boxes/README.md) | `记忆化搜索`,`数组`,`动态规划` | 困难 | | -| 0547 | [省份数量](/solution/0500-0599/0547.Number%20of%20Provinces/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | | -| 0548 | [将数组分割成和相等的子数组](/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README.md) | `数组`,`哈希表`,`前缀和` | 困难 | 🔒 | -| 0549 | [二叉树最长连续序列 II](/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | -| 0550 | [游戏玩法分析 IV](/solution/0500-0599/0550.Game%20Play%20Analysis%20IV/README.md) | `数据库` | 中等 | | -| 0551 | [学生出勤记录 I](/solution/0500-0599/0551.Student%20Attendance%20Record%20I/README.md) | `字符串` | 简单 | | -| 0552 | [学生出勤记录 II](/solution/0500-0599/0552.Student%20Attendance%20Record%20II/README.md) | `动态规划` | 困难 | | -| 0553 | [最优除法](/solution/0500-0599/0553.Optimal%20Division/README.md) | `数组`,`数学`,`动态规划` | 中等 | | -| 0554 | [砖墙](/solution/0500-0599/0554.Brick%20Wall/README.md) | `数组`,`哈希表` | 中等 | | -| 0555 | [分割连接字符串](/solution/0500-0599/0555.Split%20Concatenated%20Strings/README.md) | `贪心`,`数组`,`字符串` | 中等 | 🔒 | -| 0556 | [下一个更大元素 III](/solution/0500-0599/0556.Next%20Greater%20Element%20III/README.md) | `数学`,`双指针`,`字符串` | 中等 | | -| 0557 | [反转字符串中的单词 III](/solution/0500-0599/0557.Reverse%20Words%20in%20a%20String%20III/README.md) | `双指针`,`字符串` | 简单 | | -| 0558 | [四叉树交集](/solution/0500-0599/0558.Logical%20OR%20of%20Two%20Binary%20Grids%20Represented%20as%20Quad-Trees/README.md) | `树`,`分治` | 中等 | | -| 0559 | [N 叉树的最大深度](/solution/0500-0599/0559.Maximum%20Depth%20of%20N-ary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索` | 简单 | | -| 0560 | [和为 K 的子数组](/solution/0500-0599/0560.Subarray%20Sum%20Equals%20K/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | | -| 0561 | [数组拆分](/solution/0500-0599/0561.Array%20Partition/README.md) | `贪心`,`数组`,`计数排序`,`排序` | 简单 | | -| 0562 | [矩阵中最长的连续 1 线段](/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 🔒 | -| 0563 | [二叉树的坡度](/solution/0500-0599/0563.Binary%20Tree%20Tilt/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | | -| 0564 | [寻找最近的回文数](/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README.md) | `数学`,`字符串` | 困难 | | -| 0565 | [数组嵌套](/solution/0500-0599/0565.Array%20Nesting/README.md) | `深度优先搜索`,`数组` | 中等 | | -| 0566 | [重塑矩阵](/solution/0500-0599/0566.Reshape%20the%20Matrix/README.md) | `数组`,`矩阵`,`模拟` | 简单 | | -| 0567 | [字符串的排列](/solution/0500-0599/0567.Permutation%20in%20String/README.md) | `哈希表`,`双指针`,`字符串`,`滑动窗口` | 中等 | | -| 0568 | [最大休假天数](/solution/0500-0599/0568.Maximum%20Vacation%20Days/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 🔒 | -| 0569 | [员工薪水中位数](/solution/0500-0599/0569.Median%20Employee%20Salary/README.md) | `数据库` | 困难 | 🔒 | -| 0570 | [至少有 5 名直接下属的经理](/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README.md) | `数据库` | 中等 | | -| 0571 | [给定数字的频率查询中位数](/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README.md) | `数据库` | 困难 | 🔒 | -| 0572 | [另一棵树的子树](/solution/0500-0599/0572.Subtree%20of%20Another%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树`,`字符串匹配`,`哈希函数` | 简单 | | -| 0573 | [松鼠模拟](/solution/0500-0599/0573.Squirrel%20Simulation/README.md) | `数组`,`数学` | 中等 | 🔒 | -| 0574 | [当选者](/solution/0500-0599/0574.Winning%20Candidate/README.md) | `数据库` | 中等 | 🔒 | -| 0575 | [分糖果](/solution/0500-0599/0575.Distribute%20Candies/README.md) | `数组`,`哈希表` | 简单 | | -| 0576 | [出界的路径数](/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README.md) | `动态规划` | 中等 | | -| 0577 | [员工奖金](/solution/0500-0599/0577.Employee%20Bonus/README.md) | `数据库` | 简单 | | -| 0578 | [查询回答率最高的问题](/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README.md) | `数据库` | 中等 | 🔒 | -| 0579 | [查询员工的累计薪水](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md) | `数据库` | 困难 | 🔒 | -| 0580 | [统计各专业学生人数](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md) | `数据库` | 中等 | 🔒 | -| 0581 | [最短无序连续子数组](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md) | `栈`,`贪心`,`数组`,`双指针`,`排序`,`单调栈` | 中等 | | -| 0582 | [杀掉进程](/solution/0500-0599/0582.Kill%20Process/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组`,`哈希表` | 中等 | 🔒 | -| 0583 | [两个字符串的删除操作](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md) | `字符串`,`动态规划` | 中等 | | -| 0584 | [寻找用户推荐人](/solution/0500-0599/0584.Find%20Customer%20Referee/README.md) | `数据库` | 简单 | | -| 0585 | [2016 年的投资](/solution/0500-0599/0585.Investments%20in%202016/README.md) | `数据库` | 中等 | | -| 0586 | [订单最多的客户](/solution/0500-0599/0586.Customer%20Placing%20the%20Largest%20Number%20of%20Orders/README.md) | `数据库` | 简单 | | -| 0587 | [安装栅栏](/solution/0500-0599/0587.Erect%20the%20Fence/README.md) | `几何`,`数组`,`数学` | 困难 | | -| 0588 | [设计内存文件系统](/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 困难 | 🔒 | -| 0589 | [N 叉树的前序遍历](/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README.md) | `栈`,`树`,`深度优先搜索` | 简单 | | -| 0590 | [N 叉树的后序遍历](/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README.md) | `栈`,`树`,`深度优先搜索` | 简单 | | -| 0591 | [标签验证器](/solution/0500-0599/0591.Tag%20Validator/README.md) | `栈`,`字符串` | 困难 | | -| 0592 | [分数加减运算](/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README.md) | `数学`,`字符串`,`模拟` | 中等 | | -| 0593 | [有效的正方形](/solution/0500-0599/0593.Valid%20Square/README.md) | `几何`,`数学` | 中等 | | -| 0594 | [最长和谐子序列](/solution/0500-0599/0594.Longest%20Harmonious%20Subsequence/README.md) | `数组`,`哈希表`,`计数`,`排序`,`滑动窗口` | 简单 | | -| 0595 | [大的国家](/solution/0500-0599/0595.Big%20Countries/README.md) | `数据库` | 简单 | | -| 0596 | [超过 5 名学生的课](/solution/0500-0599/0596.Classes%20More%20Than%205%20Students/README.md) | `数据库` | 简单 | | -| 0597 | [好友申请 I：总体通过率](/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README.md) | `数据库` | 简单 | 🔒 | -| 0598 | [区间加法 II](/solution/0500-0599/0598.Range%20Addition%20II/README.md) | `数组`,`数学` | 简单 | | -| 0599 | [两个列表的最小索引总和](/solution/0500-0599/0599.Minimum%20Index%20Sum%20of%20Two%20Lists/README.md) | `数组`,`哈希表`,`字符串` | 简单 | | -| 0600 | [不含连续 1 的非负整数](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md) | `动态规划` | 困难 | | -| 0601 | [体育馆的人流量](/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README.md) | `数据库` | 困难 | | -| 0602 | [好友申请 II ：谁有最多的好友](/solution/0600-0699/0602.Friend%20Requests%20II%20Who%20Has%20the%20Most%20Friends/README.md) | `数据库` | 中等 | | -| 0603 | [连续空余座位](/solution/0600-0699/0603.Consecutive%20Available%20Seats/README.md) | `数据库` | 简单 | 🔒 | -| 0604 | [迭代压缩字符串](/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README.md) | `设计`,`数组`,`字符串`,`迭代器` | 简单 | 🔒 | -| 0605 | [种花问题](/solution/0600-0699/0605.Can%20Place%20Flowers/README.md) | `贪心`,`数组` | 简单 | | -| 0606 | [根据二叉树创建字符串](/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`字符串`,`二叉树` | 中等 | | -| 0607 | [销售员](/solution/0600-0699/0607.Sales%20Person/README.md) | `数据库` | 简单 | | -| 0608 | [树节点](/solution/0600-0699/0608.Tree%20Node/README.md) | `数据库` | 中等 | | -| 0609 | [在系统中查找重复文件](/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README.md) | `数组`,`哈希表`,`字符串` | 中等 | | -| 0610 | [判断三角形](/solution/0600-0699/0610.Triangle%20Judgement/README.md) | `数据库` | 简单 | | -| 0611 | [有效三角形的个数](/solution/0600-0699/0611.Valid%20Triangle%20Number/README.md) | `贪心`,`数组`,`双指针`,`二分查找`,`排序` | 中等 | | -| 0612 | [平面上的最近距离](/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README.md) | `数据库` | 中等 | 🔒 | -| 0613 | [直线上的最近距离](/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README.md) | `数据库` | 简单 | 🔒 | -| 0614 | [二级关注者](/solution/0600-0699/0614.Second%20Degree%20Follower/README.md) | `数据库` | 中等 | 🔒 | -| 0615 | [平均工资：部门与公司比较](/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README.md) | `数据库` | 困难 | 🔒 | -| 0616 | [给字符串添加加粗标签](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`字符串匹配` | 中等 | 🔒 | -| 0617 | [合并二叉树](/solution/0600-0699/0617.Merge%20Two%20Binary%20Trees/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | -| 0618 | [学生地理信息报告](/solution/0600-0699/0618.Students%20Report%20By%20Geography/README.md) | `数据库` | 困难 | 🔒 | -| 0619 | [只出现一次的最大数字](/solution/0600-0699/0619.Biggest%20Single%20Number/README.md) | `数据库` | 简单 | | -| 0620 | [有趣的电影](/solution/0600-0699/0620.Not%20Boring%20Movies/README.md) | `数据库` | 简单 | | -| 0621 | [任务调度器](/solution/0600-0699/0621.Task%20Scheduler/README.md) | `贪心`,`数组`,`哈希表`,`计数`,`排序`,`堆（优先队列）` | 中等 | | -| 0622 | [设计循环队列](/solution/0600-0699/0622.Design%20Circular%20Queue/README.md) | `设计`,`队列`,`数组`,`链表` | 中等 | | -| 0623 | [在二叉树中增加一行](/solution/0600-0699/0623.Add%20One%20Row%20to%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | -| 0624 | [数组列表中的最大距离](/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README.md) | `贪心`,`数组` | 中等 | 🔒 | -| 0625 | [最小因式分解](/solution/0600-0699/0625.Minimum%20Factorization/README.md) | `贪心`,`数学` | 中等 | 🔒 | -| 0626 | [换座位](/solution/0600-0699/0626.Exchange%20Seats/README.md) | `数据库` | 中等 | | -| 0627 | [变更性别](/solution/0600-0699/0627.Swap%20Salary/README.md) | `数据库` | 简单 | | -| 0628 | [三个数的最大乘积](/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README.md) | `数组`,`数学`,`排序` | 简单 | | -| 0629 | [K 个逆序对数组](/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README.md) | `动态规划` | 困难 | | -| 0630 | [课程表 III](/solution/0600-0699/0630.Course%20Schedule%20III/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 困难 | | -| 0631 | [设计 Excel 求和公式](/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README.md) | `图`,`设计`,`拓扑排序`,`数组`,`矩阵` | 困难 | 🔒 | -| 0632 | [最小区间](/solution/0600-0699/0632.Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/README.md) | `贪心`,`数组`,`哈希表`,`排序`,`滑动窗口`,`堆（优先队列）` | 困难 | | -| 0633 | [平方数之和](/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README.md) | `数学`,`双指针`,`二分查找` | 中等 | | -| 0634 | [寻找数组的错位排列](/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README.md) | `数学`,`动态规划` | 中等 | 🔒 | -| 0635 | [设计日志存储系统](/solution/0600-0699/0635.Design%20Log%20Storage%20System/README.md) | `设计`,`哈希表`,`字符串`,`有序集合` | 中等 | 🔒 | -| 0636 | [函数的独占时间](/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README.md) | `栈`,`数组` | 中等 | | -| 0637 | [二叉树的层平均值](/solution/0600-0699/0637.Average%20of%20Levels%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | -| 0638 | [大礼包](/solution/0600-0699/0638.Shopping%20Offers/README.md) | `位运算`,`记忆化搜索`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | | -| 0639 | [解码方法 II](/solution/0600-0699/0639.Decode%20Ways%20II/README.md) | `字符串`,`动态规划` | 困难 | | -| 0640 | [求解方程](/solution/0600-0699/0640.Solve%20the%20Equation/README.md) | `数学`,`字符串`,`模拟` | 中等 | | -| 0641 | [设计循环双端队列](/solution/0600-0699/0641.Design%20Circular%20Deque/README.md) | `设计`,`队列`,`数组`,`链表` | 中等 | | -| 0642 | [设计搜索自动补全系统](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md) | `设计`,`字典树`,`字符串`,`数据流`,`排序`,`堆（优先队列）` | 困难 | 🔒 | -| 0643 | [子数组最大平均数 I](/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README.md) | `数组`,`滑动窗口` | 简单 | | -| 0644 | [子数组最大平均数 II](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README.md) | `数组`,`二分查找`,`前缀和` | 困难 | 🔒 | -| 0645 | [错误的集合](/solution/0600-0699/0645.Set%20Mismatch/README.md) | `位运算`,`数组`,`哈希表`,`排序` | 简单 | | -| 0646 | [最长数对链](/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README.md) | `贪心`,`数组`,`动态规划`,`排序` | 中等 | | -| 0647 | [回文子串](/solution/0600-0699/0647.Palindromic%20Substrings/README.md) | `双指针`,`字符串`,`动态规划` | 中等 | | -| 0648 | [单词替换](/solution/0600-0699/0648.Replace%20Words/README.md) | `字典树`,`数组`,`哈希表`,`字符串` | 中等 | | -| 0649 | [Dota2 参议院](/solution/0600-0699/0649.Dota2%20Senate/README.md) | `贪心`,`队列`,`字符串` | 中等 | | -| 0650 | [两个键的键盘](/solution/0600-0699/0650.2%20Keys%20Keyboard/README.md) | `数学`,`动态规划` | 中等 | | -| 0651 | [四个键的键盘](/solution/0600-0699/0651.4%20Keys%20Keyboard/README.md) | `数学`,`动态规划` | 中等 | 🔒 | -| 0652 | [寻找重复的子树](/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README.md) | `树`,`深度优先搜索`,`哈希表`,`二叉树` | 中等 | | -| 0653 | [两数之和 IV - 输入二叉搜索树](/solution/0600-0699/0653.Two%20Sum%20IV%20-%20Input%20is%20a%20BST/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉搜索树`,`哈希表`,`双指针`,`二叉树` | 简单 | | -| 0654 | [最大二叉树](/solution/0600-0699/0654.Maximum%20Binary%20Tree/README.md) | `栈`,`树`,`数组`,`分治`,`二叉树`,`单调栈` | 中等 | | -| 0655 | [输出二叉树](/solution/0600-0699/0655.Print%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | -| 0656 | [成本最小路径](/solution/0600-0699/0656.Coin%20Path/README.md) | `数组`,`动态规划` | 困难 | 🔒 | -| 0657 | [机器人能否返回原点](/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README.md) | `字符串`,`模拟` | 简单 | | -| 0658 | [找到 K 个最接近的元素](/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README.md) | `数组`,`双指针`,`二分查找`,`排序`,`滑动窗口`,`堆（优先队列）` | 中等 | | -| 0659 | [分割数组为连续子序列](/solution/0600-0699/0659.Split%20Array%20into%20Consecutive%20Subsequences/README.md) | `贪心`,`数组`,`哈希表`,`堆（优先队列）` | 中等 | | -| 0660 | [移除 9](/solution/0600-0699/0660.Remove%209/README.md) | `数学` | 困难 | 🔒 | -| 0661 | [图片平滑器](/solution/0600-0699/0661.Image%20Smoother/README.md) | `数组`,`矩阵` | 简单 | | -| 0662 | [二叉树最大宽度](/solution/0600-0699/0662.Maximum%20Width%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | -| 0663 | [均匀树划分](/solution/0600-0699/0663.Equal%20Tree%20Partition/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | -| 0664 | [奇怪的打印机](/solution/0600-0699/0664.Strange%20Printer/README.md) | `字符串`,`动态规划` | 困难 | | -| 0665 | [非递减数列](/solution/0600-0699/0665.Non-decreasing%20Array/README.md) | `数组` | 中等 | | -| 0666 | [路径总和 IV](/solution/0600-0699/0666.Path%20Sum%20IV/README.md) | `树`,`深度优先搜索`,`数组`,`哈希表`,`二叉树` | 中等 | 🔒 | -| 0667 | [优美的排列 II](/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README.md) | `数组`,`数学` | 中等 | | -| 0668 | [乘法表中第 k 小的数](/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README.md) | `数学`,`二分查找` | 困难 | | -| 0669 | [修剪二叉搜索树](/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | -| 0670 | [最大交换](/solution/0600-0699/0670.Maximum%20Swap/README.md) | `贪心`,`数学` | 中等 | | -| 0671 | [二叉树中第二小的节点](/solution/0600-0699/0671.Second%20Minimum%20Node%20In%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | | -| 0672 | [灯泡开关 Ⅱ](/solution/0600-0699/0672.Bulb%20Switcher%20II/README.md) | `位运算`,`深度优先搜索`,`广度优先搜索`,`数学` | 中等 | | -| 0673 | [最长递增子序列的个数](/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README.md) | `树状数组`,`线段树`,`数组`,`动态规划` | 中等 | | -| 0674 | [最长连续递增序列](/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README.md) | `数组` | 简单 | | -| 0675 | [为高尔夫比赛砍树](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md) | `广度优先搜索`,`数组`,`矩阵`,`堆（优先队列）` | 困难 | | -| 0676 | [实现一个魔法字典](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md) | `深度优先搜索`,`设计`,`字典树`,`哈希表`,`字符串` | 中等 | | -| 0677 | [键值映射](/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | | -| 0678 | [有效的括号字符串](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md) | `栈`,`贪心`,`字符串`,`动态规划` | 中等 | | -| 0679 | [24 点游戏](/solution/0600-0699/0679.24%20Game/README.md) | `数组`,`数学`,`回溯` | 困难 | | -| 0680 | [验证回文串 II](/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md) | `贪心`,`双指针`,`字符串` | 简单 | | -| 0681 | [最近时刻](/solution/0600-0699/0681.Next%20Closest%20Time/README.md) | `哈希表`,`字符串`,`回溯`,`枚举` | 中等 | 🔒 | -| 0682 | [棒球比赛](/solution/0600-0699/0682.Baseball%20Game/README.md) | `栈`,`数组`,`模拟` | 简单 | | -| 0683 | [K 个关闭的灯泡](/solution/0600-0699/0683.K%20Empty%20Slots/README.md) | `树状数组`,`数组`,`有序集合`,`滑动窗口` | 困难 | 🔒 | -| 0684 | [冗余连接](/solution/0600-0699/0684.Redundant%20Connection/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | | -| 0685 | [冗余连接 II](/solution/0600-0699/0685.Redundant%20Connection%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 困难 | | -| 0686 | [重复叠加字符串匹配](/solution/0600-0699/0686.Repeated%20String%20Match/README.md) | `字符串`,`字符串匹配` | 中等 | | -| 0687 | [最长同值路径](/solution/0600-0699/0687.Longest%20Univalue%20Path/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | | -| 0688 | [骑士在棋盘上的概率](/solution/0600-0699/0688.Knight%20Probability%20in%20Chessboard/README.md) | `动态规划` | 中等 | | -| 0689 | [三个无重叠子数组的最大和](/solution/0600-0699/0689.Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays/README.md) | `数组`,`动态规划` | 困难 | | -| 0690 | [员工的重要性](/solution/0600-0699/0690.Employee%20Importance/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组`,`哈希表` | 中等 | | -| 0691 | [贴纸拼词](/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README.md) | `位运算`,`数组`,`字符串`,`动态规划`,`回溯`,`状态压缩` | 困难 | | -| 0692 | [前 K 个高频单词](/solution/0600-0699/0692.Top%20K%20Frequent%20Words/README.md) | `字典树`,`哈希表`,`字符串`,`桶排序`,`计数`,`排序`,`堆（优先队列）` | 中等 | | -| 0693 | [交替位二进制数](/solution/0600-0699/0693.Binary%20Number%20with%20Alternating%20Bits/README.md) | `位运算` | 简单 | | -| 0694 | [不同岛屿的数量](/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`哈希表`,`哈希函数` | 中等 | 🔒 | -| 0695 | [岛屿的最大面积](/solution/0600-0699/0695.Max%20Area%20of%20Island/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | | -| 0696 | [计数二进制子串](/solution/0600-0699/0696.Count%20Binary%20Substrings/README.md) | `双指针`,`字符串` | 简单 | | -| 0697 | [数组的度](/solution/0600-0699/0697.Degree%20of%20an%20Array/README.md) | `数组`,`哈希表` | 简单 | | -| 0698 | [划分为 k 个相等的子集](/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README.md) | `位运算`,`记忆化搜索`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | | -| 0699 | [掉落的方块](/solution/0600-0699/0699.Falling%20Squares/README.md) | `线段树`,`数组`,`有序集合` | 困难 | | -| 0700 | [二叉搜索树中的搜索](/solution/0700-0799/0700.Search%20in%20a%20Binary%20Search%20Tree/README.md) | `树`,`二叉搜索树`,`二叉树` | 简单 | | -| 0701 | [二叉搜索树中的插入操作](/solution/0700-0799/0701.Insert%20into%20a%20Binary%20Search%20Tree/README.md) | `树`,`二叉搜索树`,`二叉树` | 中等 | | -| 0702 | [搜索长度未知的有序数组](/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README.md) | `数组`,`二分查找`,`交互` | 中等 | 🔒 | -| 0703 | [数据流中的第 K 大元素](/solution/0700-0799/0703.Kth%20Largest%20Element%20in%20a%20Stream/README.md) | `树`,`设计`,`二叉搜索树`,`二叉树`,`数据流`,`堆（优先队列）` | 简单 | | -| 0704 | [二分查找](/solution/0700-0799/0704.Binary%20Search/README.md) | `数组`,`二分查找` | 简单 | | -| 0705 | [设计哈希集合](/solution/0700-0799/0705.Design%20HashSet/README.md) | `设计`,`数组`,`哈希表`,`链表`,`哈希函数` | 简单 | | -| 0706 | [设计哈希映射](/solution/0700-0799/0706.Design%20HashMap/README.md) | `设计`,`数组`,`哈希表`,`链表`,`哈希函数` | 简单 | | -| 0707 | [设计链表](/solution/0700-0799/0707.Design%20Linked%20List/README.md) | `设计`,`链表` | 中等 | | -| 0708 | [循环有序列表的插入](/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README.md) | `链表` | 中等 | 🔒 | -| 0709 | [转换成小写字母](/solution/0700-0799/0709.To%20Lower%20Case/README.md) | `字符串` | 简单 | | -| 0710 | [黑名单中的随机数](/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README.md) | `数组`,`哈希表`,`数学`,`二分查找`,`排序`,`随机化` | 困难 | | -| 0711 | [不同岛屿的数量 II](/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`哈希表`,`哈希函数` | 困难 | 🔒 | -| 0712 | [两个字符串的最小 ASCII 删除和](/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README.md) | `字符串`,`动态规划` | 中等 | | -| 0713 | [乘积小于 K 的子数组](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md) | `数组`,`滑动窗口` | 中等 | | -| 0714 | [买卖股票的最佳时机含手续费](/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README.md) | `贪心`,`数组`,`动态规划` | 中等 | | -| 0715 | [Range 模块](/solution/0700-0799/0715.Range%20Module/README.md) | `设计`,`线段树`,`有序集合` | 困难 | | -| 0716 | [最大栈](/solution/0700-0799/0716.Max%20Stack/README.md) | `栈`,`设计`,`链表`,`双向链表`,`有序集合` | 困难 | 🔒 | -| 0717 | [1 比特与 2 比特字符](/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README.md) | `数组` | 简单 | | -| 0718 | [最长重复子数组](/solution/0700-0799/0718.Maximum%20Length%20of%20Repeated%20Subarray/README.md) | `数组`,`二分查找`,`动态规划`,`滑动窗口`,`哈希函数`,`滚动哈希` | 中等 | | -| 0719 | [找出第 K 小的数对距离](/solution/0700-0799/0719.Find%20K-th%20Smallest%20Pair%20Distance/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 困难 | | -| 0720 | [词典中最长的单词](/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`排序` | 中等 | | -| 0721 | [账户合并](/solution/0700-0799/0721.Accounts%20Merge/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`字符串`,`排序` | 中等 | | -| 0722 | [删除注释](/solution/0700-0799/0722.Remove%20Comments/README.md) | `数组`,`字符串` | 中等 | | -| 0723 | [粉碎糖果](/solution/0700-0799/0723.Candy%20Crush/README.md) | `数组`,`双指针`,`矩阵`,`模拟` | 中等 | 🔒 | -| 0724 | [寻找数组的中心下标](/solution/0700-0799/0724.Find%20Pivot%20Index/README.md) | `数组`,`前缀和` | 简单 | | -| 0725 | [分隔链表](/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README.md) | `链表` | 中等 | | -| 0726 | [原子的数量](/solution/0700-0799/0726.Number%20of%20Atoms/README.md) | `栈`,`哈希表`,`字符串`,`排序` | 困难 | | -| 0727 | [最小窗口子序列](/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README.md) | `字符串`,`动态规划`,`滑动窗口` | 困难 | 🔒 | -| 0728 | [自除数](/solution/0700-0799/0728.Self%20Dividing%20Numbers/README.md) | `数学` | 简单 | | -| 0729 | [我的日程安排表 I](/solution/0700-0799/0729.My%20Calendar%20I/README.md) | `设计`,`线段树`,`数组`,`二分查找`,`有序集合` | 中等 | | -| 0730 | [统计不同回文子序列](/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README.md) | `字符串`,`动态规划` | 困难 | | -| 0731 | [我的日程安排表 II](/solution/0700-0799/0731.My%20Calendar%20II/README.md) | `设计`,`线段树`,`数组`,`二分查找`,`有序集合`,`前缀和` | 中等 | | -| 0732 | [我的日程安排表 III](/solution/0700-0799/0732.My%20Calendar%20III/README.md) | `设计`,`线段树`,`二分查找`,`有序集合`,`前缀和` | 困难 | | -| 0733 | [图像渲染](/solution/0700-0799/0733.Flood%20Fill/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 简单 | | -| 0734 | [句子相似性](/solution/0700-0799/0734.Sentence%20Similarity/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 🔒 | -| 0735 | [小行星碰撞](/solution/0700-0799/0735.Asteroid%20Collision/README.md) | `栈`,`数组`,`模拟` | 中等 | | -| 0736 | [Lisp 语法解析](/solution/0700-0799/0736.Parse%20Lisp%20Expression/README.md) | `栈`,`递归`,`哈希表`,`字符串` | 困难 | | -| 0737 | [句子相似性 II](/solution/0700-0799/0737.Sentence%20Similarity%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`字符串` | 中等 | 🔒 | -| 0738 | [单调递增的数字](/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README.md) | `贪心`,`数学` | 中等 | | -| 0739 | [每日温度](/solution/0700-0799/0739.Daily%20Temperatures/README.md) | `栈`,`数组`,`单调栈` | 中等 | | -| 0740 | [删除并获得点数](/solution/0700-0799/0740.Delete%20and%20Earn/README.md) | `数组`,`哈希表`,`动态规划` | 中等 | | -| 0741 | [摘樱桃](/solution/0700-0799/0741.Cherry%20Pickup/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | | -| 0742 | [二叉树最近的叶节点](/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | -| 0743 | [网络延迟时间](/solution/0700-0799/0743.Network%20Delay%20Time/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`最短路`,`堆（优先队列）` | 中等 | | -| 0744 | [寻找比目标字母大的最小字母](/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README.md) | `数组`,`二分查找` | 简单 | | -| 0745 | [前缀和后缀搜索](/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README.md) | `设计`,`字典树`,`数组`,`哈希表`,`字符串` | 困难 | | -| 0746 | [使用最小花费爬楼梯](/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README.md) | `数组`,`动态规划` | 简单 | | -| 0747 | [至少是其他数字两倍的最大数](/solution/0700-0799/0747.Largest%20Number%20At%20Least%20Twice%20of%20Others/README.md) | `数组`,`排序` | 简单 | | -| 0748 | [最短补全词](/solution/0700-0799/0748.Shortest%20Completing%20Word/README.md) | `数组`,`哈希表`,`字符串` | 简单 | | -| 0749 | [隔离病毒](/solution/0700-0799/0749.Contain%20Virus/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵`,`模拟` | 困难 | | -| 0750 | [角矩形的数量](/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README.md) | `数组`,`数学`,`动态规划`,`矩阵` | 中等 | 🔒 | -| 0751 | [IP 到 CIDR](/solution/0700-0799/0751.IP%20to%20CIDR/README.md) | `位运算`,`字符串` | 中等 | 🔒 | -| 0752 | [打开转盘锁](/solution/0700-0799/0752.Open%20the%20Lock/README.md) | `广度优先搜索`,`数组`,`哈希表`,`字符串` | 中等 | | -| 0753 | [破解保险箱](/solution/0700-0799/0753.Cracking%20the%20Safe/README.md) | `深度优先搜索`,`图`,`欧拉回路` | 困难 | | -| 0754 | [到达终点数字](/solution/0700-0799/0754.Reach%20a%20Number/README.md) | `数学`,`二分查找` | 中等 | | -| 0755 | [倒水](/solution/0700-0799/0755.Pour%20Water/README.md) | `数组`,`模拟` | 中等 | 🔒 | -| 0756 | [金字塔转换矩阵](/solution/0700-0799/0756.Pyramid%20Transition%20Matrix/README.md) | `位运算`,`深度优先搜索`,`广度优先搜索` | 中等 | | -| 0757 | [设置交集大小至少为 2](/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README.md) | `贪心`,`数组`,`排序` | 困难 | | -| 0758 | [字符串中的加粗单词](/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`字符串匹配` | 中等 | 🔒 | -| 0759 | [员工空闲时间](/solution/0700-0799/0759.Employee%20Free%20Time/README.md) | `数组`,`排序`,`堆（优先队列）` | 困难 | 🔒 | -| 0760 | [找出变位映射](/solution/0700-0799/0760.Find%20Anagram%20Mappings/README.md) | `数组`,`哈希表` | 简单 | 🔒 | -| 0761 | [特殊的二进制序列](/solution/0700-0799/0761.Special%20Binary%20String/README.md) | `递归`,`字符串` | 困难 | | -| 0762 | [二进制表示中质数个计算置位](/solution/0700-0799/0762.Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation/README.md) | `位运算`,`数学` | 简单 | | -| 0763 | [划分字母区间](/solution/0700-0799/0763.Partition%20Labels/README.md) | `贪心`,`哈希表`,`双指针`,`字符串` | 中等 | | -| 0764 | [最大加号标志](/solution/0700-0799/0764.Largest%20Plus%20Sign/README.md) | `数组`,`动态规划` | 中等 | | -| 0765 | [情侣牵手](/solution/0700-0799/0765.Couples%20Holding%20Hands/README.md) | `贪心`,`深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 困难 | | -| 0766 | [托普利茨矩阵](/solution/0700-0799/0766.Toeplitz%20Matrix/README.md) | `数组`,`矩阵` | 简单 | | -| 0767 | [重构字符串](/solution/0700-0799/0767.Reorganize%20String/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序`,`堆（优先队列）` | 中等 | | -| 0768 | [最多能完成排序的块 II](/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README.md) | `栈`,`贪心`,`数组`,`排序`,`单调栈` | 困难 | | -| 0769 | [最多能完成排序的块](/solution/0700-0799/0769.Max%20Chunks%20To%20Make%20Sorted/README.md) | `栈`,`贪心`,`数组`,`排序`,`单调栈` | 中等 | | -| 0770 | [基本计算器 IV](/solution/0700-0799/0770.Basic%20Calculator%20IV/README.md) | `栈`,`递归`,`哈希表`,`数学`,`字符串` | 困难 | | -| 0771 | [宝石与石头](/solution/0700-0799/0771.Jewels%20and%20Stones/README.md) | `哈希表`,`字符串` | 简单 | | -| 0772 | [基本计算器 III](/solution/0700-0799/0772.Basic%20Calculator%20III/README.md) | `栈`,`递归`,`数学`,`字符串` | 困难 | 🔒 | -| 0773 | [滑动谜题](/solution/0700-0799/0773.Sliding%20Puzzle/README.md) | `广度优先搜索`,`数组`,`矩阵` | 困难 | | -| 0774 | [最小化去加油站的最大距离](/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README.md) | `数组`,`二分查找` | 困难 | 🔒 | -| 0775 | [全局倒置与局部倒置](/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README.md) | `数组`,`数学` | 中等 | | -| 0776 | [拆分二叉搜索树](/solution/0700-0799/0776.Split%20BST/README.md) | `树`,`二叉搜索树`,`递归`,`二叉树` | 中等 | 🔒 | -| 0777 | [在 LR 字符串中交换相邻字符](/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README.md) | `双指针`,`字符串` | 中等 | | -| 0778 | [水位上升的泳池中游泳](/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`二分查找`,`矩阵`,`堆（优先队列）` | 困难 | | -| 0779 | [第 K 个语法符号](/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README.md) | `位运算`,`递归`,`数学` | 中等 | | -| 0780 | [到达终点](/solution/0700-0799/0780.Reaching%20Points/README.md) | `数学` | 困难 | | -| 0781 | [森林中的兔子](/solution/0700-0799/0781.Rabbits%20in%20Forest/README.md) | `贪心`,`数组`,`哈希表`,`数学` | 中等 | | -| 0782 | [变为棋盘](/solution/0700-0799/0782.Transform%20to%20Chessboard/README.md) | `位运算`,`数组`,`数学`,`矩阵` | 困难 | | -| 0783 | [二叉搜索树节点最小距离](/solution/0700-0799/0783.Minimum%20Distance%20Between%20BST%20Nodes/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉搜索树`,`二叉树` | 简单 | | -| 0784 | [字母大小写全排列](/solution/0700-0799/0784.Letter%20Case%20Permutation/README.md) | `位运算`,`字符串`,`回溯` | 中等 | | -| 0785 | [判断二分图](/solution/0700-0799/0785.Is%20Graph%20Bipartite/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | | -| 0786 | [第 K 个最小的质数分数](/solution/0700-0799/0786.K-th%20Smallest%20Prime%20Fraction/README.md) | `数组`,`双指针`,`二分查找`,`排序`,`堆（优先队列）` | 中等 | | -| 0787 | [K 站中转内最便宜的航班](/solution/0700-0799/0787.Cheapest%20Flights%20Within%20K%20Stops/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`动态规划`,`最短路`,`堆（优先队列）` | 中等 | | -| 0788 | [旋转数字](/solution/0700-0799/0788.Rotated%20Digits/README.md) | `数学`,`动态规划` | 中等 | | -| 0789 | [逃脱阻碍者](/solution/0700-0799/0789.Escape%20The%20Ghosts/README.md) | `数组`,`数学` | 中等 | | -| 0790 | [多米诺和托米诺平铺](/solution/0700-0799/0790.Domino%20and%20Tromino%20Tiling/README.md) | `动态规划` | 中等 | | -| 0791 | [自定义字符串排序](/solution/0700-0799/0791.Custom%20Sort%20String/README.md) | `哈希表`,`字符串`,`排序` | 中等 | | -| 0792 | [匹配子序列的单词数](/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`二分查找`,`动态规划`,`排序` | 中等 | | -| 0793 | [阶乘函数后 K 个零](/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README.md) | `数学`,`二分查找` | 困难 | | -| 0794 | [有效的井字游戏](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README.md) | `数组`,`矩阵` | 中等 | | -| 0795 | [区间子数组个数](/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README.md) | `数组`,`双指针` | 中等 | | -| 0796 | [旋转字符串](/solution/0700-0799/0796.Rotate%20String/README.md) | `字符串`,`字符串匹配` | 简单 | | -| 0797 | [所有可能的路径](/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`回溯` | 中等 | | -| 0798 | [得分最高的最小轮调](/solution/0700-0799/0798.Smallest%20Rotation%20with%20Highest%20Score/README.md) | `数组`,`前缀和` | 困难 | | -| 0799 | [香槟塔](/solution/0700-0799/0799.Champagne%20Tower/README.md) | `动态规划` | 中等 | | -| 0800 | [相似 RGB 颜色](/solution/0800-0899/0800.Similar%20RGB%20Color/README.md) | `数学`,`字符串`,`枚举` | 简单 | 🔒 | -| 0801 | [使序列递增的最小交换次数](/solution/0800-0899/0801.Minimum%20Swaps%20To%20Make%20Sequences%20Increasing/README.md) | `数组`,`动态规划` | 困难 | | -| 0802 | [找到最终的安全状态](/solution/0800-0899/0802.Find%20Eventual%20Safe%20States/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | | -| 0803 | [打砖块](/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README.md) | `并查集`,`数组`,`矩阵` | 困难 | | -| 0804 | [唯一摩尔斯密码词](/solution/0800-0899/0804.Unique%20Morse%20Code%20Words/README.md) | `数组`,`哈希表`,`字符串` | 简单 | | -| 0805 | [数组的均值分割](/solution/0800-0899/0805.Split%20Array%20With%20Same%20Average/README.md) | `位运算`,`数组`,`数学`,`动态规划`,`状态压缩` | 困难 | | -| 0806 | [写字符串需要的行数](/solution/0800-0899/0806.Number%20of%20Lines%20To%20Write%20String/README.md) | `数组`,`字符串` | 简单 | | -| 0807 | [保持城市天际线](/solution/0800-0899/0807.Max%20Increase%20to%20Keep%20City%20Skyline/README.md) | `贪心`,`数组`,`矩阵` | 中等 | | -| 0808 | [分汤](/solution/0800-0899/0808.Soup%20Servings/README.md) | `数学`,`动态规划`,`概率与统计` | 中等 | | -| 0809 | [情感丰富的文字](/solution/0800-0899/0809.Expressive%20Words/README.md) | `数组`,`双指针`,`字符串` | 中等 | | -| 0810 | [黑板异或游戏](/solution/0800-0899/0810.Chalkboard%20XOR%20Game/README.md) | `位运算`,`脑筋急转弯`,`数组`,`数学`,`博弈` | 困难 | | -| 0811 | [子域名访问计数](/solution/0800-0899/0811.Subdomain%20Visit%20Count/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 中等 | | -| 0812 | [最大三角形面积](/solution/0800-0899/0812.Largest%20Triangle%20Area/README.md) | `几何`,`数组`,`数学` | 简单 | | -| 0813 | [最大平均值和的分组](/solution/0800-0899/0813.Largest%20Sum%20of%20Averages/README.md) | `数组`,`动态规划`,`前缀和` | 中等 | | -| 0814 | [二叉树剪枝](/solution/0800-0899/0814.Binary%20Tree%20Pruning/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | | -| 0815 | [公交路线](/solution/0800-0899/0815.Bus%20Routes/README.md) | `广度优先搜索`,`数组`,`哈希表` | 困难 | | -| 0816 | [模糊坐标](/solution/0800-0899/0816.Ambiguous%20Coordinates/README.md) | `字符串`,`回溯`,`枚举` | 中等 | | -| 0817 | [链表组件](/solution/0800-0899/0817.Linked%20List%20Components/README.md) | `数组`,`哈希表`,`链表` | 中等 | | -| 0818 | [赛车](/solution/0800-0899/0818.Race%20Car/README.md) | `动态规划` | 困难 | | -| 0819 | [最常见的单词](/solution/0800-0899/0819.Most%20Common%20Word/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 简单 | | -| 0820 | [单词的压缩编码](/solution/0800-0899/0820.Short%20Encoding%20of%20Words/README.md) | `字典树`,`数组`,`哈希表`,`字符串` | 中等 | | -| 0821 | [字符的最短距离](/solution/0800-0899/0821.Shortest%20Distance%20to%20a%20Character/README.md) | `数组`,`双指针`,`字符串` | 简单 | | -| 0822 | [翻转卡片游戏](/solution/0800-0899/0822.Card%20Flipping%20Game/README.md) | `数组`,`哈希表` | 中等 | | -| 0823 | [带因子的二叉树](/solution/0800-0899/0823.Binary%20Trees%20With%20Factors/README.md) | `数组`,`哈希表`,`动态规划`,`排序` | 中等 | | -| 0824 | [山羊拉丁文](/solution/0800-0899/0824.Goat%20Latin/README.md) | `字符串` | 简单 | | -| 0825 | [适龄的朋友](/solution/0800-0899/0825.Friends%20Of%20Appropriate%20Ages/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | | -| 0826 | [安排工作以达到最大收益](/solution/0800-0899/0826.Most%20Profit%20Assigning%20Work/README.md) | `贪心`,`数组`,`双指针`,`二分查找`,`排序` | 中等 | | -| 0827 | [最大人工岛](/solution/0800-0899/0827.Making%20A%20Large%20Island/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 困难 | | -| 0828 | [统计子串中的唯一字符](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README.md) | `哈希表`,`字符串`,`动态规划` | 困难 | 第 83 场周赛 | -| 0829 | [连续整数求和](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README.md) | `数学`,`枚举` | 困难 | 第 83 场周赛 | -| 0830 | [较大分组的位置](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README.md) | `字符串` | 简单 | 第 83 场周赛 | -| 0831 | [隐藏个人信息](/solution/0800-0899/0831.Masking%20Personal%20Information/README.md) | `字符串` | 中等 | 第 83 场周赛 | -| 0832 | [翻转图像](/solution/0800-0899/0832.Flipping%20an%20Image/README.md) | `位运算`,`数组`,`双指针`,`矩阵`,`模拟` | 简单 | 第 84 场周赛 | -| 0833 | [字符串中的查找与替换](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README.md) | `数组`,`字符串`,`排序` | 中等 | 第 84 场周赛 | -| 0834 | [树中距离之和](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md) | `树`,`深度优先搜索`,`图`,`动态规划` | 困难 | 第 84 场周赛 | -| 0835 | [图像重叠](/solution/0800-0899/0835.Image%20Overlap/README.md) | `数组`,`矩阵` | 中等 | 第 84 场周赛 | -| 0836 | [矩形重叠](/solution/0800-0899/0836.Rectangle%20Overlap/README.md) | `几何`,`数学` | 简单 | 第 85 场周赛 | -| 0837 | [新 21 点](/solution/0800-0899/0837.New%2021%20Game/README.md) | `数学`,`动态规划`,`滑动窗口`,`概率与统计` | 中等 | 第 85 场周赛 | -| 0838 | [推多米诺](/solution/0800-0899/0838.Push%20Dominoes/README.md) | `双指针`,`字符串`,`动态规划` | 中等 | 第 85 场周赛 | -| 0839 | [相似字符串组](/solution/0800-0899/0839.Similar%20String%20Groups/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`字符串` | 困难 | 第 85 场周赛 | -| 0840 | [矩阵中的幻方](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README.md) | `数组`,`哈希表`,`数学`,`矩阵` | 中等 | 第 86 场周赛 | -| 0841 | [钥匙和房间](/solution/0800-0899/0841.Keys%20and%20Rooms/README.md) | `深度优先搜索`,`广度优先搜索`,`图` | 中等 | 第 86 场周赛 | -| 0842 | [将数组拆分成斐波那契序列](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README.md) | `字符串`,`回溯` | 中等 | 第 86 场周赛 | -| 0843 | [猜猜这个单词](/solution/0800-0899/0843.Guess%20the%20Word/README.md) | `数组`,`数学`,`字符串`,`博弈`,`交互` | 困难 | 第 86 场周赛 | -| 0844 | [比较含退格的字符串](/solution/0800-0899/0844.Backspace%20String%20Compare/README.md) | `栈`,`双指针`,`字符串`,`模拟` | 简单 | 第 87 场周赛 | -| 0845 | [数组中的最长山脉](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README.md) | `数组`,`双指针`,`动态规划`,`枚举` | 中等 | 第 87 场周赛 | -| 0846 | [一手顺子](/solution/0800-0899/0846.Hand%20of%20Straights/README.md) | `贪心`,`数组`,`哈希表`,`排序` | 中等 | 第 87 场周赛 | -| 0847 | [访问所有节点的最短路径](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md) | `位运算`,`广度优先搜索`,`图`,`动态规划`,`状态压缩` | 困难 | 第 87 场周赛 | -| 0848 | [字母移位](/solution/0800-0899/0848.Shifting%20Letters/README.md) | `数组`,`字符串`,`前缀和` | 中等 | 第 88 场周赛 | -| 0849 | [到最近的人的最大距离](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README.md) | `数组` | 中等 | 第 88 场周赛 | -| 0850 | [矩形面积 II](/solution/0800-0899/0850.Rectangle%20Area%20II/README.md) | `线段树`,`数组`,`有序集合`,`扫描线` | 困难 | 第 88 场周赛 | -| 0851 | [喧闹和富有](/solution/0800-0899/0851.Loud%20and%20Rich/README.md) | `深度优先搜索`,`图`,`拓扑排序`,`数组` | 中等 | 第 88 场周赛 | -| 0852 | [山脉数组的峰顶索引](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README.md) | `数组`,`二分查找` | 中等 | 第 89 场周赛 | -| 0853 | [车队](/solution/0800-0899/0853.Car%20Fleet/README.md) | `栈`,`数组`,`排序`,`单调栈` | 中等 | 第 89 场周赛 | -| 0854 | [相似度为 K 的字符串](/solution/0800-0899/0854.K-Similar%20Strings/README.md) | `广度优先搜索`,`字符串` | 困难 | 第 89 场周赛 | -| 0855 | [考场就座](/solution/0800-0899/0855.Exam%20Room/README.md) | `设计`,`有序集合`,`堆（优先队列）` | 中等 | 第 89 场周赛 | -| 0856 | [括号的分数](/solution/0800-0899/0856.Score%20of%20Parentheses/README.md) | `栈`,`字符串` | 中等 | 第 90 场周赛 | -| 0857 | [雇佣 K 名工人的最低成本](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 困难 | 第 90 场周赛 | -| 0858 | [镜面反射](/solution/0800-0899/0858.Mirror%20Reflection/README.md) | `几何`,`数学`,`数论` | 中等 | 第 90 场周赛 | -| 0859 | [亲密字符串](/solution/0800-0899/0859.Buddy%20Strings/README.md) | `哈希表`,`字符串` | 简单 | 第 90 场周赛 | -| 0860 | [柠檬水找零](/solution/0800-0899/0860.Lemonade%20Change/README.md) | `贪心`,`数组` | 简单 | 第 91 场周赛 | -| 0861 | [翻转矩阵后的得分](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README.md) | `贪心`,`位运算`,`数组`,`矩阵` | 中等 | 第 91 场周赛 | -| 0862 | [和至少为 K 的最短子数组](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md) | `队列`,`数组`,`二分查找`,`前缀和`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 困难 | 第 91 场周赛 | -| 0863 | [二叉树中所有距离为 K 的结点](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 第 91 场周赛 | -| 0864 | [获取所有钥匙的最短路径](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README.md) | `位运算`,`广度优先搜索`,`数组`,`矩阵` | 困难 | 第 92 场周赛 | -| 0865 | [具有所有最深节点的最小子树](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 第 92 场周赛 | -| 0866 | [回文质数](/solution/0800-0899/0866.Prime%20Palindrome/README.md) | `数学`,`数论` | 中等 | 第 92 场周赛 | -| 0867 | [转置矩阵](/solution/0800-0899/0867.Transpose%20Matrix/README.md) | `数组`,`矩阵`,`模拟` | 简单 | 第 92 场周赛 | -| 0868 | [二进制间距](/solution/0800-0899/0868.Binary%20Gap/README.md) | `位运算` | 简单 | 第 93 场周赛 | -| 0869 | [重新排序得到 2 的幂](/solution/0800-0899/0869.Reordered%20Power%20of%202/README.md) | `哈希表`,`数学`,`计数`,`枚举`,`排序` | 中等 | 第 93 场周赛 | -| 0870 | [优势洗牌](/solution/0800-0899/0870.Advantage%20Shuffle/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 93 场周赛 | -| 0871 | [最低加油次数](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README.md) | `贪心`,`数组`,`动态规划`,`堆（优先队列）` | 困难 | 第 93 场周赛 | -| 0872 | [叶子相似的树](/solution/0800-0899/0872.Leaf-Similar%20Trees/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | 第 94 场周赛 | -| 0873 | [最长的斐波那契子序列的长度](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README.md) | `数组`,`哈希表`,`动态规划` | 中等 | 第 94 场周赛 | -| 0874 | [模拟行走机器人](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README.md) | `数组`,`哈希表`,`模拟` | 中等 | 第 94 场周赛 | -| 0875 | [爱吃香蕉的珂珂](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README.md) | `数组`,`二分查找` | 中等 | 第 94 场周赛 | -| 0876 | [链表的中间结点](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README.md) | `链表`,`双指针` | 简单 | 第 95 场周赛 | -| 0877 | [石子游戏](/solution/0800-0899/0877.Stone%20Game/README.md) | `数组`,`数学`,`动态规划`,`博弈` | 中等 | 第 95 场周赛 | -| 0878 | [第 N 个神奇数字](/solution/0800-0899/0878.Nth%20Magical%20Number/README.md) | `数学`,`二分查找` | 困难 | 第 95 场周赛 | -| 0879 | [盈利计划](/solution/0800-0899/0879.Profitable%20Schemes/README.md) | `数组`,`动态规划` | 困难 | 第 95 场周赛 | -| 0880 | [索引处的解码字符串](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README.md) | `栈`,`字符串` | 中等 | 第 96 场周赛 | -| 0881 | [救生艇](/solution/0800-0899/0881.Boats%20to%20Save%20People/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 96 场周赛 | -| 0882 | [细分图中的可到达节点](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README.md) | `图`,`最短路`,`堆（优先队列）` | 困难 | 第 96 场周赛 | -| 0883 | [三维形体投影面积](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README.md) | `几何`,`数组`,`数学`,`矩阵` | 简单 | 第 96 场周赛 | -| 0884 | [两句话中的不常见单词](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README.md) | `哈希表`,`字符串` | 简单 | 第 97 场周赛 | -| 0885 | [螺旋矩阵 III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 97 场周赛 | -| 0886 | [可能的二分法](/solution/0800-0899/0886.Possible%20Bipartition/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 第 97 场周赛 | -| 0887 | [鸡蛋掉落](/solution/0800-0899/0887.Super%20Egg%20Drop/README.md) | `数学`,`二分查找`,`动态规划` | 困难 | 第 97 场周赛 | -| 0888 | [公平的糖果交换](/solution/0800-0899/0888.Fair%20Candy%20Swap/README.md) | `数组`,`哈希表`,`二分查找`,`排序` | 简单 | 第 98 场周赛 | -| 0889 | [根据前序和后序遍历构造二叉树](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README.md) | `树`,`数组`,`哈希表`,`分治`,`二叉树` | 中等 | 第 98 场周赛 | -| 0890 | [查找和替换模式](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 98 场周赛 | -| 0891 | [子序列宽度之和](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README.md) | `数组`,`数学`,`排序` | 困难 | 第 98 场周赛 | -| 0892 | [三维形体的表面积](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README.md) | `几何`,`数组`,`数学`,`矩阵` | 简单 | 第 99 场周赛 | -| 0893 | [特殊等价字符串组](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 99 场周赛 | -| 0894 | [所有可能的真二叉树](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README.md) | `树`,`递归`,`记忆化搜索`,`动态规划`,`二叉树` | 中等 | 第 99 场周赛 | -| 0895 | [最大频率栈](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README.md) | `栈`,`设计`,`哈希表`,`有序集合` | 困难 | 第 99 场周赛 | -| 0896 | [单调数列](/solution/0800-0899/0896.Monotonic%20Array/README.md) | `数组` | 简单 | 第 100 场周赛 | -| 0897 | [递增顺序搜索树](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README.md) | `栈`,`树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 简单 | 第 100 场周赛 | -| 0898 | [子数组按位或操作](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README.md) | `位运算`,`数组`,`动态规划` | 中等 | 第 100 场周赛 | -| 0899 | [有序队列](/solution/0800-0899/0899.Orderly%20Queue/README.md) | `数学`,`字符串`,`排序` | 困难 | 第 100 场周赛 | -| 0900 | [RLE 迭代器](/solution/0900-0999/0900.RLE%20Iterator/README.md) | `设计`,`数组`,`计数`,`迭代器` | 中等 | 第 101 场周赛 | -| 0901 | [股票价格跨度](/solution/0900-0999/0901.Online%20Stock%20Span/README.md) | `栈`,`设计`,`数据流`,`单调栈` | 中等 | 第 101 场周赛 | -| 0902 | [最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md) | `数组`,`数学`,`字符串`,`二分查找`,`动态规划` | 困难 | 第 101 场周赛 | -| 0903 | [DI 序列的有效排列](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README.md) | `字符串`,`动态规划`,`前缀和` | 困难 | 第 101 场周赛 | -| 0904 | [水果成篮](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 102 场周赛 | -| 0905 | [按奇偶排序数组](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README.md) | `数组`,`双指针`,`排序` | 简单 | 第 102 场周赛 | -| 0906 | [超级回文数](/solution/0900-0999/0906.Super%20Palindromes/README.md) | `数学`,`枚举` | 困难 | 第 102 场周赛 | -| 0907 | [子数组的最小值之和](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md) | `栈`,`数组`,`动态规划`,`单调栈` | 中等 | 第 102 场周赛 | -| 0908 | [最小差值 I](/solution/0900-0999/0908.Smallest%20Range%20I/README.md) | `数组`,`数学` | 简单 | 第 103 场周赛 | -| 0909 | [蛇梯棋](/solution/0900-0999/0909.Snakes%20and%20Ladders/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 第 103 场周赛 | -| 0910 | [最小差值 II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md) | `贪心`,`数组`,`数学`,`排序` | 中等 | 第 103 场周赛 | -| 0911 | [在线选举](/solution/0900-0999/0911.Online%20Election/README.md) | `设计`,`数组`,`哈希表`,`二分查找` | 中等 | 第 103 场周赛 | -| 0912 | [排序数组](/solution/0900-0999/0912.Sort%20an%20Array/README.md) | `数组`,`分治`,`桶排序`,`计数排序`,`基数排序`,`排序`,`堆（优先队列）`,`归并排序` | 中等 | | -| 0913 | [猫和老鼠](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md) | `图`,`拓扑排序`,`记忆化搜索`,`数学`,`动态规划`,`博弈` | 困难 | 第 104 场周赛 | -| 0914 | [卡牌分组](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md) | `数组`,`哈希表`,`数学`,`计数`,`数论` | 简单 | 第 104 场周赛 | -| 0915 | [分割数组](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md) | `数组` | 中等 | 第 104 场周赛 | -| 0916 | [单词子集](/solution/0900-0999/0916.Word%20Subsets/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 104 场周赛 | -| 0917 | [仅仅反转字母](/solution/0900-0999/0917.Reverse%20Only%20Letters/README.md) | `双指针`,`字符串` | 简单 | 第 105 场周赛 | -| 0918 | [环形子数组的最大和](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md) | `队列`,`数组`,`分治`,`动态规划`,`单调队列` | 中等 | 第 105 场周赛 | -| 0919 | [完全二叉树插入器](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README.md) | `树`,`广度优先搜索`,`设计`,`二叉树` | 中等 | 第 105 场周赛 | -| 0920 | [播放列表的数量](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README.md) | `数学`,`动态规划`,`组合数学` | 困难 | 第 105 场周赛 | -| 0921 | [使括号有效的最少添加](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README.md) | `栈`,`贪心`,`字符串` | 中等 | 第 106 场周赛 | -| 0922 | [按奇偶排序数组 II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README.md) | `数组`,`双指针`,`排序` | 简单 | 第 106 场周赛 | -| 0923 | [三数之和的多种可能](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md) | `数组`,`哈希表`,`双指针`,`计数`,`排序` | 中等 | 第 106 场周赛 | -| 0924 | [尽量减少恶意软件的传播](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`数组`,`哈希表` | 困难 | 第 106 场周赛 | -| 0925 | [长按键入](/solution/0900-0999/0925.Long%20Pressed%20Name/README.md) | `双指针`,`字符串` | 简单 | 第 107 场周赛 | -| 0926 | [将字符串翻转到单调递增](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md) | `字符串`,`动态规划` | 中等 | 第 107 场周赛 | -| 0927 | [三等分](/solution/0900-0999/0927.Three%20Equal%20Parts/README.md) | `数组`,`数学` | 困难 | 第 107 场周赛 | -| 0928 | [尽量减少恶意软件的传播 II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`数组`,`哈希表` | 困难 | 第 107 场周赛 | -| 0929 | [独特的电子邮件地址](/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 108 场周赛 | -| 0930 | [和相同的二元子数组](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md) | `数组`,`哈希表`,`前缀和`,`滑动窗口` | 中等 | 第 108 场周赛 | -| 0931 | [下降路径最小和](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 108 场周赛 | -| 0932 | [漂亮数组](/solution/0900-0999/0932.Beautiful%20Array/README.md) | `数组`,`数学`,`分治` | 中等 | 第 108 场周赛 | -| 0933 | [最近的请求次数](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md) | `设计`,`队列`,`数据流` | 简单 | 第 109 场周赛 | -| 0934 | [最短的桥](/solution/0900-0999/0934.Shortest%20Bridge/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | 第 109 场周赛 | -| 0935 | [骑士拨号器](/solution/0900-0999/0935.Knight%20Dialer/README.md) | `动态规划` | 中等 | 第 109 场周赛 | -| 0936 | [戳印序列](/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md) | `栈`,`贪心`,`队列`,`字符串` | 困难 | 第 109 场周赛 | -| 0937 | [重新排列日志文件](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README.md) | `数组`,`字符串`,`排序` | 中等 | 第 110 场周赛 | -| 0938 | [二叉搜索树的范围和](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 简单 | 第 110 场周赛 | -| 0939 | [最小面积矩形](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README.md) | `几何`,`数组`,`哈希表`,`数学`,`排序` | 中等 | 第 110 场周赛 | -| 0940 | [不同的子序列 II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md) | `字符串`,`动态规划` | 困难 | 第 110 场周赛 | -| 0941 | [有效的山脉数组](/solution/0900-0999/0941.Valid%20Mountain%20Array/README.md) | `数组` | 简单 | 第 111 场周赛 | -| 0942 | [增减字符串匹配](/solution/0900-0999/0942.DI%20String%20Match/README.md) | `贪心`,`数组`,`双指针`,`字符串` | 简单 | 第 111 场周赛 | -| 0943 | [最短超级串](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README.md) | `位运算`,`数组`,`字符串`,`动态规划`,`状态压缩` | 困难 | 第 111 场周赛 | -| 0944 | [删列造序](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README.md) | `数组`,`字符串` | 简单 | 第 111 场周赛 | -| 0945 | [使数组唯一的最小增量](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README.md) | `贪心`,`数组`,`计数`,`排序` | 中等 | 第 112 场周赛 | -| 0946 | [验证栈序列](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README.md) | `栈`,`数组`,`模拟` | 中等 | 第 112 场周赛 | -| 0947 | [移除最多的同行或同列石头](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README.md) | `深度优先搜索`,`并查集`,`图`,`哈希表` | 中等 | 第 112 场周赛 | -| 0948 | [令牌放置](/solution/0900-0999/0948.Bag%20of%20Tokens/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 112 场周赛 | -| 0949 | [给定数字能组成的最大时间](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README.md) | `数组`,`字符串`,`枚举` | 中等 | 第 113 场周赛 | -| 0950 | [按递增顺序显示卡牌](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README.md) | `队列`,`数组`,`排序`,`模拟` | 中等 | 第 113 场周赛 | -| 0951 | [翻转等价二叉树](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 113 场周赛 | -| 0952 | [按公因数计算最大组件大小](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README.md) | `并查集`,`数组`,`哈希表`,`数学`,`数论` | 困难 | 第 113 场周赛 | -| 0953 | [验证外星语词典](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 114 场周赛 | -| 0954 | [二倍数对数组](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README.md) | `贪心`,`数组`,`哈希表`,`排序` | 中等 | 第 114 场周赛 | -| 0955 | [删列造序 II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README.md) | `贪心`,`数组`,`字符串` | 中等 | 第 114 场周赛 | -| 0956 | [最高的广告牌](/solution/0900-0999/0956.Tallest%20Billboard/README.md) | `数组`,`动态规划` | 困难 | 第 114 场周赛 | -| 0957 | [N 天后的牢房](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README.md) | `位运算`,`数组`,`哈希表`,`数学` | 中等 | 第 115 场周赛 | -| 0958 | [二叉树的完全性检验](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | 第 115 场周赛 | -| 0959 | [由斜杠划分区域](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`矩阵` | 中等 | 第 115 场周赛 | -| 0960 | [删列造序 III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md) | `数组`,`字符串`,`动态规划` | 困难 | 第 115 场周赛 | -| 0961 | [在长度 2N 的数组中找出重复 N 次的元素](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README.md) | `数组`,`哈希表` | 简单 | 第 116 场周赛 | -| 0962 | [最大宽度坡](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md) | `栈`,`数组`,`单调栈` | 中等 | 第 116 场周赛 | -| 0963 | [最小面积矩形 II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README.md) | `几何`,`数组`,`数学` | 中等 | 第 116 场周赛 | -| 0964 | [表示数字的最少运算符](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README.md) | `记忆化搜索`,`数学`,`动态规划` | 困难 | 第 116 场周赛 | -| 0965 | [单值二叉树](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | 第 117 场周赛 | -| 0966 | [元音拼写检查器](/solution/0900-0999/0966.Vowel%20Spellchecker/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 117 场周赛 | -| 0967 | [连续差相同的数字](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README.md) | `广度优先搜索`,`回溯` | 中等 | 第 117 场周赛 | -| 0968 | [监控二叉树](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README.md) | `树`,`深度优先搜索`,`动态规划`,`二叉树` | 困难 | 第 117 场周赛 | -| 0969 | [煎饼排序](/solution/0900-0999/0969.Pancake%20Sorting/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 118 场周赛 | -| 0970 | [强整数](/solution/0900-0999/0970.Powerful%20Integers/README.md) | `哈希表`,`数学`,`枚举` | 中等 | 第 118 场周赛 | -| 0971 | [翻转二叉树以匹配先序遍历](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 118 场周赛 | -| 0972 | [相等的有理数](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README.md) | `数学`,`字符串` | 困难 | 第 118 场周赛 | -| 0973 | [最接近原点的 K 个点](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README.md) | `几何`,`数组`,`数学`,`分治`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | 第 119 场周赛 | -| 0974 | [和可被 K 整除的子数组](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 119 场周赛 | -| 0975 | [奇偶跳](/solution/0900-0999/0975.Odd%20Even%20Jump/README.md) | `栈`,`数组`,`动态规划`,`有序集合`,`单调栈` | 困难 | 第 119 场周赛 | -| 0976 | [三角形的最大周长](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README.md) | `贪心`,`数组`,`数学`,`排序` | 简单 | 第 119 场周赛 | -| 0977 | [有序数组的平方](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README.md) | `数组`,`双指针`,`排序` | 简单 | 第 120 场周赛 | -| 0978 | [最长湍流子数组](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README.md) | `数组`,`动态规划`,`滑动窗口` | 中等 | 第 120 场周赛 | -| 0979 | [在二叉树中分配硬币](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 120 场周赛 | -| 0980 | [不同路径 III](/solution/0900-0999/0980.Unique%20Paths%20III/README.md) | `位运算`,`数组`,`回溯`,`矩阵` | 困难 | 第 120 场周赛 | -| 0981 | [基于时间的键值存储](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README.md) | `设计`,`哈希表`,`字符串`,`二分查找` | 中等 | 第 121 场周赛 | -| 0982 | [按位与为零的三元组](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README.md) | `位运算`,`数组`,`哈希表` | 困难 | 第 121 场周赛 | -| 0983 | [最低票价](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README.md) | `数组`,`动态规划` | 中等 | 第 121 场周赛 | -| 0984 | [不含 AAA 或 BBB 的字符串](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README.md) | `贪心`,`字符串` | 中等 | 第 121 场周赛 | -| 0985 | [查询后的偶数和](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README.md) | `数组`,`模拟` | 中等 | 第 122 场周赛 | -| 0986 | [区间列表的交集](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md) | `数组`,`双指针` | 中等 | 第 122 场周赛 | -| 0987 | [二叉树的垂序遍历](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树`,`排序` | 困难 | 第 122 场周赛 | -| 0988 | [从叶结点开始的最小字符串](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md) | `树`,`深度优先搜索`,`字符串`,`回溯`,`二叉树` | 中等 | 第 122 场周赛 | -| 0989 | [数组形式的整数加法](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md) | `数组`,`数学` | 简单 | 第 123 场周赛 | -| 0990 | [等式方程的可满足性](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md) | `并查集`,`图`,`数组`,`字符串` | 中等 | 第 123 场周赛 | -| 0991 | [坏了的计算器](/solution/0900-0999/0991.Broken%20Calculator/README.md) | `贪心`,`数学` | 中等 | 第 123 场周赛 | -| 0992 | [K 个不同整数的子数组](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md) | `数组`,`哈希表`,`计数`,`滑动窗口` | 困难 | 第 123 场周赛 | -| 0993 | [二叉树的堂兄弟节点](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | 第 124 场周赛 | -| 0994 | [腐烂的橘子](/solution/0900-0999/0994.Rotting%20Oranges/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 第 124 场周赛 | -| 0995 | [K 连续位的最小翻转次数](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README.md) | `位运算`,`队列`,`数组`,`前缀和`,`滑动窗口` | 困难 | 第 124 场周赛 | -| 0996 | [平方数组的数目](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README.md) | `位运算`,`数组`,`哈希表`,`数学`,`动态规划`,`回溯`,`状态压缩` | 困难 | 第 124 场周赛 | -| 0997 | [找到小镇的法官](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README.md) | `图`,`数组`,`哈希表` | 简单 | 第 125 场周赛 | -| 0998 | [最大二叉树 II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README.md) | `树`,`二叉树` | 中等 | 第 125 场周赛 | -| 0999 | [可以被一步捕获的棋子数](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README.md) | `数组`,`矩阵`,`模拟` | 简单 | 第 125 场周赛 | -| 1000 | [合并石头的最低成本](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README.md) | `数组`,`动态规划`,`前缀和` | 困难 | 第 126 场周赛 | -| 1001 | [网格照明](/solution/1000-1099/1001.Grid%20Illumination/README.md) | `数组`,`哈希表` | 困难 | 第 125 场周赛 | -| 1002 | [查找共用字符](/solution/1000-1099/1002.Find%20Common%20Characters/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 126 场周赛 | -| 1003 | [检查替换后的词是否有效](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README.md) | `栈`,`字符串` | 中等 | 第 126 场周赛 | -| 1004 | [最大连续 1 的个数 III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md) | `数组`,`二分查找`,`前缀和`,`滑动窗口` | 中等 | 第 126 场周赛 | -| 1005 | [K 次取反后最大化的数组和](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 127 场周赛 | -| 1006 | [笨阶乘](/solution/1000-1099/1006.Clumsy%20Factorial/README.md) | `栈`,`数学`,`模拟` | 中等 | 第 127 场周赛 | -| 1007 | [行相等的最少多米诺旋转](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README.md) | `贪心`,`数组` | 中等 | 第 127 场周赛 | -| 1008 | [前序遍历构造二叉搜索树](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README.md) | `栈`,`树`,`二叉搜索树`,`数组`,`二叉树`,`单调栈` | 中等 | 第 127 场周赛 | -| 1009 | [十进制整数的反码](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README.md) | `位运算` | 简单 | 第 128 场周赛 | -| 1010 | [总持续时间可被 60 整除的歌曲](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 128 场周赛 | -| 1011 | [在 D 天内送达包裹的能力](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README.md) | `数组`,`二分查找` | 中等 | 第 128 场周赛 | -| 1012 | [至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md) | `数学`,`动态规划` | 困难 | 第 128 场周赛 | -| 1013 | [将数组分成和相等的三个部分](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README.md) | `贪心`,`数组` | 简单 | 第 129 场周赛 | -| 1014 | [最佳观光组合](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README.md) | `数组`,`动态规划` | 中等 | 第 129 场周赛 | -| 1015 | [可被 K 整除的最小整数](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README.md) | `哈希表`,`数学` | 中等 | 第 129 场周赛 | -| 1016 | [子串能表示从 1 到 N 数字的二进制串](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README.md) | `字符串` | 中等 | 第 129 场周赛 | -| 1017 | [负二进制转换](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md) | `数学` | 中等 | 第 130 场周赛 | -| 1018 | [可被 5 整除的二进制前缀](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README.md) | `位运算`,`数组` | 简单 | 第 130 场周赛 | -| 1019 | [链表中的下一个更大节点](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README.md) | `栈`,`数组`,`链表`,`单调栈` | 中等 | 第 130 场周赛 | -| 1020 | [飞地的数量](/solution/1000-1099/1020.Number%20of%20Enclaves/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 130 场周赛 | -| 1021 | [删除最外层的括号](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md) | `栈`,`字符串` | 简单 | 第 131 场周赛 | -| 1022 | [从根到叶的二进制数之和](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | 第 131 场周赛 | -| 1023 | [驼峰式匹配](/solution/1000-1099/1023.Camelcase%20Matching/README.md) | `字典树`,`数组`,`双指针`,`字符串`,`字符串匹配` | 中等 | 第 131 场周赛 | -| 1024 | [视频拼接](/solution/1000-1099/1024.Video%20Stitching/README.md) | `贪心`,`数组`,`动态规划` | 中等 | 第 131 场周赛 | -| 1025 | [除数博弈](/solution/1000-1099/1025.Divisor%20Game/README.md) | `脑筋急转弯`,`数学`,`动态规划`,`博弈` | 简单 | 第 132 场周赛 | -| 1026 | [节点与其祖先之间的最大差值](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 132 场周赛 | -| 1027 | [最长等差数列](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README.md) | `数组`,`哈希表`,`二分查找`,`动态规划` | 中等 | 第 132 场周赛 | -| 1028 | [从先序遍历还原二叉树](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README.md) | `树`,`深度优先搜索`,`字符串`,`二叉树` | 困难 | 第 132 场周赛 | -| 1029 | [两地调度](/solution/1000-1099/1029.Two%20City%20Scheduling/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 133 场周赛 | -| 1030 | [距离顺序排列矩阵单元格](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README.md) | `几何`,`数组`,`数学`,`矩阵`,`排序` | 简单 | 第 133 场周赛 | -| 1031 | [两个非重叠子数组的最大和](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README.md) | `数组`,`动态规划`,`滑动窗口` | 中等 | 第 133 场周赛 | -| 1032 | [字符流](/solution/1000-1099/1032.Stream%20of%20Characters/README.md) | `设计`,`字典树`,`数组`,`字符串`,`数据流` | 困难 | 第 133 场周赛 | -| 1033 | [移动石子直到连续](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README.md) | `脑筋急转弯`,`数学` | 中等 | 第 134 场周赛 | -| 1034 | [边界着色](/solution/1000-1099/1034.Coloring%20A%20Border/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | 第 134 场周赛 | -| 1035 | [不相交的线](/solution/1000-1099/1035.Uncrossed%20Lines/README.md) | `数组`,`动态规划` | 中等 | 第 134 场周赛 | -| 1036 | [逃离大迷宫](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`哈希表` | 困难 | 第 134 场周赛 | -| 1037 | [有效的回旋镖](/solution/1000-1099/1037.Valid%20Boomerang/README.md) | `几何`,`数组`,`数学` | 简单 | 第 135 场周赛 | -| 1038 | [从二叉搜索树到更大和树](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | 第 135 场周赛 | -| 1039 | [多边形三角剖分的最低得分](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md) | `数组`,`动态规划` | 中等 | 第 135 场周赛 | -| 1040 | [移动石子直到连续 II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README.md) | `数组`,`数学`,`双指针`,`排序` | 中等 | 第 135 场周赛 | -| 1041 | [困于环中的机器人](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README.md) | `数学`,`字符串`,`模拟` | 中等 | 第 136 场周赛 | -| 1042 | [不邻接植花](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README.md) | `深度优先搜索`,`广度优先搜索`,`图` | 中等 | 第 136 场周赛 | -| 1043 | [分隔数组以得到最大和](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README.md) | `数组`,`动态规划` | 中等 | 第 136 场周赛 | -| 1044 | [最长重复子串](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md) | `字符串`,`二分查找`,`后缀数组`,`滑动窗口`,`哈希函数`,`滚动哈希` | 困难 | 第 136 场周赛 | -| 1045 | [买下所有产品的客户](/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README.md) | `数据库` | 中等 | | -| 1046 | [最后一块石头的重量](/solution/1000-1099/1046.Last%20Stone%20Weight/README.md) | `数组`,`堆（优先队列）` | 简单 | 第 137 场周赛 | -| 1047 | [删除字符串中的所有相邻重复项](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README.md) | `栈`,`字符串` | 简单 | 第 137 场周赛 | -| 1048 | [最长字符串链](/solution/1000-1099/1048.Longest%20String%20Chain/README.md) | `数组`,`哈希表`,`双指针`,`字符串`,`动态规划` | 中等 | 第 137 场周赛 | -| 1049 | [最后一块石头的重量 II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md) | `数组`,`动态规划` | 中等 | 第 137 场周赛 | -| 1050 | [合作过至少三次的演员和导演](/solution/1000-1099/1050.Actors%20and%20Directors%20Who%20Cooperated%20At%20Least%20Three%20Times/README.md) | `数据库` | 简单 | | -| 1051 | [高度检查器](/solution/1000-1099/1051.Height%20Checker/README.md) | `数组`,`计数排序`,`排序` | 简单 | 第 138 场周赛 | -| 1052 | [爱生气的书店老板](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README.md) | `数组`,`滑动窗口` | 中等 | 第 138 场周赛 | -| 1053 | [交换一次的先前排列](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README.md) | `贪心`,`数组` | 中等 | 第 138 场周赛 | -| 1054 | [距离相等的条形码](/solution/1000-1099/1054.Distant%20Barcodes/README.md) | `贪心`,`数组`,`哈希表`,`计数`,`排序`,`堆（优先队列）` | 中等 | 第 138 场周赛 | -| 1055 | [形成字符串的最短路径](/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README.md) | `贪心`,`双指针`,`字符串` | 中等 | 🔒 | -| 1056 | [易混淆数](/solution/1000-1099/1056.Confusing%20Number/README.md) | `数学` | 简单 | 🔒 | -| 1057 | [校园自行车分配](/solution/1000-1099/1057.Campus%20Bikes/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | -| 1058 | [最小化舍入误差以满足目标](/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README.md) | `贪心`,`数组`,`数学`,`字符串`,`排序` | 中等 | 🔒 | -| 1059 | [从始点到终点的所有路径](/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README.md) | `图`,`拓扑排序` | 中等 | 🔒 | -| 1060 | [有序数组中的缺失元素](/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README.md) | `数组`,`二分查找` | 中等 | 🔒 | -| 1061 | [按字典序排列最小的等效字符串](/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README.md) | `并查集`,`字符串` | 中等 | | -| 1062 | [最长重复子串](/solution/1000-1099/1062.Longest%20Repeating%20Substring/README.md) | `字符串`,`二分查找`,`动态规划`,`后缀数组`,`哈希函数`,`滚动哈希` | 中等 | 🔒 | -| 1063 | [有效子数组的数目](/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README.md) | `栈`,`数组`,`单调栈` | 困难 | 🔒 | -| 1064 | [不动点](/solution/1000-1099/1064.Fixed%20Point/README.md) | `数组`,`二分查找` | 简单 | 第 1 场双周赛 | -| 1065 | [字符串的索引对](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md) | `字典树`,`数组`,`字符串`,`排序` | 简单 | 第 1 场双周赛 | -| 1066 | [校园自行车分配 II](/solution/1000-1099/1066.Campus%20Bikes%20II/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | 第 1 场双周赛 | -| 1067 | [范围内的数字计数](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README.md) | `数学`,`动态规划` | 困难 | 第 1 场双周赛 | -| 1068 | [产品销售分析 I](/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README.md) | `数据库` | 简单 | | -| 1069 | [产品销售分析 II](/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README.md) | `数据库` | 简单 | 🔒 | -| 1070 | [产品销售分析 III](/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README.md) | `数据库` | 中等 | | -| 1071 | [字符串的最大公因子](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README.md) | `数学`,`字符串` | 简单 | 第 139 场周赛 | -| 1072 | [按列翻转得到最大值等行数](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 第 139 场周赛 | -| 1073 | [负二进制数相加](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md) | `数组`,`数学` | 中等 | 第 139 场周赛 | -| 1074 | [元素和为目标值的子矩阵数量](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md) | `数组`,`哈希表`,`矩阵`,`前缀和` | 困难 | 第 139 场周赛 | -| 1075 | [项目员工 I](/solution/1000-1099/1075.Project%20Employees%20I/README.md) | `数据库` | 简单 | | -| 1076 | [项目员工 II](/solution/1000-1099/1076.Project%20Employees%20II/README.md) | `数据库` | 简单 | 🔒 | -| 1077 | [项目员工 III](/solution/1000-1099/1077.Project%20Employees%20III/README.md) | `数据库` | 中等 | 🔒 | -| 1078 | [Bigram 分词](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README.md) | `字符串` | 简单 | 第 140 场周赛 | -| 1079 | [活字印刷](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README.md) | `哈希表`,`字符串`,`回溯`,`计数` | 中等 | 第 140 场周赛 | -| 1080 | [根到叶路径上的不足节点](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 140 场周赛 | -| 1081 | [不同字符的最小子序列](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README.md) | `栈`,`贪心`,`字符串`,`单调栈` | 中等 | 第 140 场周赛 | -| 1082 | [销售分析 I ](/solution/1000-1099/1082.Sales%20Analysis%20I/README.md) | `数据库` | 简单 | 🔒 | -| 1083 | [销售分析 II](/solution/1000-1099/1083.Sales%20Analysis%20II/README.md) | `数据库` | 简单 | 🔒 | -| 1084 | [销售分析 III](/solution/1000-1099/1084.Sales%20Analysis%20III/README.md) | `数据库` | 简单 | | -| 1085 | [最小元素各数位之和](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md) | `数组`,`数学` | 简单 | 第 2 场双周赛 | -| 1086 | [前五科的均分](/solution/1000-1099/1086.High%20Five/README.md) | `数组`,`哈希表`,`排序`,`堆（优先队列）` | 简单 | 第 2 场双周赛 | -| 1087 | [花括号展开](/solution/1000-1099/1087.Brace%20Expansion/README.md) | `广度优先搜索`,`字符串`,`回溯` | 中等 | 第 2 场双周赛 | -| 1088 | [易混淆数 II](/solution/1000-1099/1088.Confusing%20Number%20II/README.md) | `数学`,`回溯` | 困难 | 第 2 场双周赛 | -| 1089 | [复写零](/solution/1000-1099/1089.Duplicate%20Zeros/README.md) | `数组`,`双指针` | 简单 | 第 141 场周赛 | -| 1090 | [受标签影响的最大值](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README.md) | `贪心`,`数组`,`哈希表`,`计数`,`排序` | 中等 | 第 141 场周赛 | -| 1091 | [二进制矩阵中的最短路径](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 第 141 场周赛 | -| 1092 | [最短公共超序列](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README.md) | `字符串`,`动态规划` | 困难 | 第 141 场周赛 | -| 1093 | [大样本统计](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README.md) | `数组`,`数学`,`概率与统计` | 中等 | 第 142 场周赛 | -| 1094 | [拼车](/solution/1000-1099/1094.Car%20Pooling/README.md) | `数组`,`前缀和`,`排序`,`模拟`,`堆（优先队列）` | 中等 | 第 142 场周赛 | -| 1095 | [山脉数组中查找目标值](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README.md) | `数组`,`二分查找`,`交互` | 困难 | 第 142 场周赛 | -| 1096 | [花括号展开 II](/solution/1000-1099/1096.Brace%20Expansion%20II/README.md) | `栈`,`广度优先搜索`,`字符串`,`回溯` | 困难 | 第 142 场周赛 | -| 1097 | [游戏玩法分析 V](/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README.md) | `数据库` | 困难 | 🔒 | -| 1098 | [小众书籍](/solution/1000-1099/1098.Unpopular%20Books/README.md) | `数据库` | 中等 | 🔒 | -| 1099 | [小于 K 的两数之和](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 简单 | 第 3 场双周赛 | -| 1100 | [长度为 K 的无重复字符子串](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 第 3 场双周赛 | -| 1101 | [彼此熟识的最早时间](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md) | `并查集`,`数组`,`排序` | 中等 | 第 3 场双周赛 | -| 1102 | [得分最高的路径](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`二分查找`,`矩阵`,`堆（优先队列）` | 中等 | 第 3 场双周赛 | -| 1103 | [分糖果 II](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README.md) | `数学`,`模拟` | 简单 | 第 143 场周赛 | -| 1104 | [二叉树寻路](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README.md) | `树`,`数学`,`二叉树` | 中等 | 第 143 场周赛 | -| 1105 | [填充书架](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README.md) | `数组`,`动态规划` | 中等 | 第 143 场周赛 | -| 1106 | [解析布尔表达式](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README.md) | `栈`,`递归`,`字符串` | 困难 | 第 143 场周赛 | -| 1107 | [每日新用户统计](/solution/1100-1199/1107.New%20Users%20Daily%20Count/README.md) | `数据库` | 中等 | 🔒 | -| 1108 | [IP 地址无效化](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README.md) | `字符串` | 简单 | 第 144 场周赛 | -| 1109 | [航班预订统计](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README.md) | `数组`,`前缀和` | 中等 | 第 144 场周赛 | -| 1110 | [删点成林](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README.md) | `树`,`深度优先搜索`,`数组`,`哈希表`,`二叉树` | 中等 | 第 144 场周赛 | -| 1111 | [有效括号的嵌套深度](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README.md) | `栈`,`字符串` | 中等 | 第 144 场周赛 | -| 1112 | [每位学生的最高成绩](/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README.md) | `数据库` | 中等 | 🔒 | -| 1113 | [报告的记录](/solution/1100-1199/1113.Reported%20Posts/README.md) | `数据库` | 简单 | 🔒 | -| 1114 | [按序打印](/solution/1100-1199/1114.Print%20in%20Order/README.md) | `多线程` | 简单 | | -| 1115 | [交替打印 FooBar](/solution/1100-1199/1115.Print%20FooBar%20Alternately/README.md) | `多线程` | 中等 | | -| 1116 | [打印零与奇偶数](/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README.md) | `多线程` | 中等 | | -| 1117 | [H2O 生成](/solution/1100-1199/1117.Building%20H2O/README.md) | `多线程` | 中等 | | -| 1118 | [一月有多少天](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md) | `数学` | 简单 | 第 4 场双周赛 | -| 1119 | [删去字符串中的元音](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md) | `字符串` | 简单 | 第 4 场双周赛 | -| 1120 | [子树的最大平均值](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 4 场双周赛 | -| 1121 | [将数组分成几个递增序列](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README.md) | `数组`,`计数` | 困难 | 第 4 场双周赛 | -| 1122 | [数组的相对排序](/solution/1100-1199/1122.Relative%20Sort%20Array/README.md) | `数组`,`哈希表`,`计数排序`,`排序` | 简单 | 第 145 场周赛 | -| 1123 | [最深叶节点的最近公共祖先](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 第 145 场周赛 | -| 1124 | [表现良好的最长时间段](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README.md) | `栈`,`数组`,`哈希表`,`前缀和`,`单调栈` | 中等 | 第 145 场周赛 | -| 1125 | [最小的必要团队](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 145 场周赛 | -| 1126 | [查询活跃业务](/solution/1100-1199/1126.Active%20Businesses/README.md) | `数据库` | 中等 | 🔒 | -| 1127 | [用户购买平台](/solution/1100-1199/1127.User%20Purchase%20Platform/README.md) | `数据库` | 困难 | 🔒 | -| 1128 | [等价多米诺骨牌对的数量](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 146 场周赛 | -| 1129 | [颜色交替的最短路径](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README.md) | `广度优先搜索`,`图` | 中等 | 第 146 场周赛 | -| 1130 | [叶值的最小代价生成树](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README.md) | `栈`,`贪心`,`数组`,`动态规划`,`单调栈` | 中等 | 第 146 场周赛 | -| 1131 | [绝对值表达式的最大值](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md) | `数组`,`数学` | 中等 | 第 146 场周赛 | -| 1132 | [报告的记录 II](/solution/1100-1199/1132.Reported%20Posts%20II/README.md) | `数据库` | 中等 | 🔒 | -| 1133 | [最大唯一数](/solution/1100-1199/1133.Largest%20Unique%20Number/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 5 场双周赛 | -| 1134 | [阿姆斯特朗数](/solution/1100-1199/1134.Armstrong%20Number/README.md) | `数学` | 简单 | 第 5 场双周赛 | -| 1135 | [最低成本连通所有城市](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md) | `并查集`,`图`,`最小生成树`,`堆（优先队列）` | 中等 | 第 5 场双周赛 | -| 1136 | [并行课程](/solution/1100-1199/1136.Parallel%20Courses/README.md) | `图`,`拓扑排序` | 中等 | 第 5 场双周赛 | -| 1137 | [第 N 个泰波那契数](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md) | `记忆化搜索`,`数学`,`动态规划` | 简单 | 第 147 场周赛 | -| 1138 | [字母板上的路径](/solution/1100-1199/1138.Alphabet%20Board%20Path/README.md) | `哈希表`,`字符串` | 中等 | 第 147 场周赛 | -| 1139 | [最大的以 1 为边界的正方形](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 147 场周赛 | -| 1140 | [石子游戏 II](/solution/1100-1199/1140.Stone%20Game%20II/README.md) | `数组`,`数学`,`动态规划`,`博弈`,`前缀和` | 中等 | 第 147 场周赛 | -| 1141 | [查询近 30 天活跃用户数](/solution/1100-1199/1141.User%20Activity%20for%20the%20Past%2030%20Days%20I/README.md) | `数据库` | 简单 | | -| 1142 | [过去 30 天的用户活动 II](/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README.md) | `数据库` | 简单 | 🔒 | -| 1143 | [最长公共子序列](/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md) | `字符串`,`动态规划` | 中等 | | -| 1144 | [递减元素使数组呈锯齿状](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README.md) | `贪心`,`数组` | 中等 | 第 148 场周赛 | -| 1145 | [二叉树着色游戏](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 148 场周赛 | -| 1146 | [快照数组](/solution/1100-1199/1146.Snapshot%20Array/README.md) | `设计`,`数组`,`哈希表`,`二分查找` | 中等 | 第 148 场周赛 | -| 1147 | [段式回文](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README.md) | `贪心`,`双指针`,`字符串`,`动态规划`,`哈希函数`,`滚动哈希` | 困难 | 第 148 场周赛 | -| 1148 | [文章浏览 I](/solution/1100-1199/1148.Article%20Views%20I/README.md) | `数据库` | 简单 | | -| 1149 | [文章浏览 II](/solution/1100-1199/1149.Article%20Views%20II/README.md) | `数据库` | 中等 | 🔒 | -| 1150 | [检查一个数是否在数组中占绝大多数](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md) | `数组`,`二分查找` | 简单 | 第 6 场双周赛 | -| 1151 | [最少交换次数来组合所有的 1](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md) | `数组`,`滑动窗口` | 中等 | 第 6 场双周赛 | -| 1152 | [用户网站访问行为分析](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md) | `数组`,`哈希表`,`排序` | 中等 | 第 6 场双周赛 | -| 1153 | [字符串转化](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README.md) | `哈希表`,`字符串` | 困难 | 第 6 场双周赛 | -| 1154 | [一年中的第几天](/solution/1100-1199/1154.Day%20of%20the%20Year/README.md) | `数学`,`字符串` | 简单 | 第 149 场周赛 | -| 1155 | [掷骰子等于目标和的方法数](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md) | `动态规划` | 中等 | 第 149 场周赛 | -| 1156 | [单字符重复子串的最大长度](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 第 149 场周赛 | -| 1157 | [子数组中占绝大多数的元素](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README.md) | `设计`,`树状数组`,`线段树`,`数组`,`二分查找` | 困难 | 第 149 场周赛 | -| 1158 | [市场分析 I](/solution/1100-1199/1158.Market%20Analysis%20I/README.md) | `数据库` | 中等 | | -| 1159 | [市场分析 II](/solution/1100-1199/1159.Market%20Analysis%20II/README.md) | `数据库` | 困难 | 🔒 | -| 1160 | [拼写单词](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 150 场周赛 | -| 1161 | [最大层内元素和](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 150 场周赛 | -| 1162 | [地图分析](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README.md) | `广度优先搜索`,`数组`,`动态规划`,`矩阵` | 中等 | 第 150 场周赛 | -| 1163 | [按字典序排在最后的子串](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README.md) | `双指针`,`字符串` | 困难 | 第 150 场周赛 | -| 1164 | [指定日期的产品价格](/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README.md) | `数据库` | 中等 | | -| 1165 | [单行键盘](/solution/1100-1199/1165.Single-Row%20Keyboard/README.md) | `哈希表`,`字符串` | 简单 | 第 7 场双周赛 | -| 1166 | [设计文件系统](/solution/1100-1199/1166.Design%20File%20System/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | 第 7 场双周赛 | -| 1167 | [连接木棍的最低费用](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 7 场双周赛 | -| 1168 | [水资源分配优化](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md) | `并查集`,`图`,`最小生成树`,`堆（优先队列）` | 困难 | 第 7 场双周赛 | -| 1169 | [查询无效交易](/solution/1100-1199/1169.Invalid%20Transactions/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 151 场周赛 | -| 1170 | [比较字符串最小字母出现频次](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README.md) | `数组`,`哈希表`,`字符串`,`二分查找`,`排序` | 中等 | 第 151 场周赛 | -| 1171 | [从链表中删去总和值为零的连续节点](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README.md) | `哈希表`,`链表` | 中等 | 第 151 场周赛 | -| 1172 | [餐盘栈](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README.md) | `栈`,`设计`,`哈希表`,`堆（优先队列）` | 困难 | 第 151 场周赛 | -| 1173 | [即时食物配送 I](/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README.md) | `数据库` | 简单 | 🔒 | -| 1174 | [即时食物配送 II](/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README.md) | `数据库` | 中等 | | -| 1175 | [质数排列](/solution/1100-1199/1175.Prime%20Arrangements/README.md) | `数学` | 简单 | 第 152 场周赛 | -| 1176 | [健身计划评估](/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md) | `数组`,`滑动窗口` | 简单 | 第 152 场周赛 | -| 1177 | [构建回文串检测](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README.md) | `位运算`,`数组`,`哈希表`,`字符串`,`前缀和` | 中等 | 第 152 场周赛 | -| 1178 | [猜字谜](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README.md) | `位运算`,`字典树`,`数组`,`哈希表`,`字符串` | 困难 | 第 152 场周赛 | -| 1179 | [重新格式化部门表](/solution/1100-1199/1179.Reformat%20Department%20Table/README.md) | `数据库` | 简单 | | -| 1180 | [统计只含单一字母的子串](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md) | `数学`,`字符串` | 简单 | 第 8 场双周赛 | -| 1181 | [前后拼接](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 8 场双周赛 | -| 1182 | [与目标颜色间的最短距离](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md) | `数组`,`二分查找`,`动态规划` | 中等 | 第 8 场双周赛 | -| 1183 | [矩阵中 1 的最大数量](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md) | `贪心`,`堆（优先队列）` | 困难 | 第 8 场双周赛 | -| 1184 | [公交站间的距离](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README.md) | `数组` | 简单 | 第 153 场周赛 | -| 1185 | [一周中的第几天](/solution/1100-1199/1185.Day%20of%20the%20Week/README.md) | `数学` | 简单 | 第 153 场周赛 | -| 1186 | [删除一次得到子数组最大和](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README.md) | `数组`,`动态规划` | 中等 | 第 153 场周赛 | -| 1187 | [使数组严格递增](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README.md) | `数组`,`二分查找`,`动态规划`,`排序` | 困难 | 第 153 场周赛 | -| 1188 | [设计有限阻塞队列](/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README.md) | `多线程` | 中等 | 🔒 | -| 1189 | [“气球” 的最大数量](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 154 场周赛 | -| 1190 | [反转每对括号间的子串](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README.md) | `栈`,`字符串` | 中等 | 第 154 场周赛 | -| 1191 | [K 次串联后最大子数组之和](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README.md) | `数组`,`动态规划` | 中等 | 第 154 场周赛 | -| 1192 | [查找集群内的关键连接](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README.md) | `深度优先搜索`,`图`,`双连通分量` | 困难 | 第 154 场周赛 | -| 1193 | [每月交易 I](/solution/1100-1199/1193.Monthly%20Transactions%20I/README.md) | `数据库` | 中等 | | -| 1194 | [锦标赛优胜者](/solution/1100-1199/1194.Tournament%20Winners/README.md) | `数据库` | 困难 | 🔒 | -| 1195 | [交替打印字符串](/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README.md) | `多线程` | 中等 | | -| 1196 | [最多可以买到的苹果数量](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 9 场双周赛 | -| 1197 | [进击的骑士](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md) | `广度优先搜索` | 中等 | 第 9 场双周赛 | -| 1198 | [找出所有行中最小公共元素](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md) | `数组`,`哈希表`,`二分查找`,`计数`,`矩阵` | 中等 | 第 9 场双周赛 | -| 1199 | [建造街区的最短时间](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README.md) | `贪心`,`数组`,`数学`,`堆（优先队列）` | 困难 | 第 9 场双周赛 | -| 1200 | [最小绝对差](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README.md) | `数组`,`排序` | 简单 | 第 155 场周赛 | -| 1201 | [丑数 III](/solution/1200-1299/1201.Ugly%20Number%20III/README.md) | `数学`,`二分查找`,`组合数学`,`数论` | 中等 | 第 155 场周赛 | -| 1202 | [交换字符串中的元素](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 155 场周赛 | -| 1203 | [项目管理](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 困难 | 第 155 场周赛 | -| 1204 | [最后一个能进入巴士的人](/solution/1200-1299/1204.Last%20Person%20to%20Fit%20in%20the%20Bus/README.md) | `数据库` | 中等 | | -| 1205 | [每月交易 II](/solution/1200-1299/1205.Monthly%20Transactions%20II/README.md) | `数据库` | 中等 | 🔒 | -| 1206 | [设计跳表](/solution/1200-1299/1206.Design%20Skiplist/README.md) | `设计`,`链表` | 困难 | | -| 1207 | [独一无二的出现次数](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README.md) | `数组`,`哈希表` | 简单 | 第 156 场周赛 | -| 1208 | [尽可能使字符串相等](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README.md) | `字符串`,`二分查找`,`前缀和`,`滑动窗口` | 中等 | 第 156 场周赛 | -| 1209 | [删除字符串中的所有相邻重复项 II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README.md) | `栈`,`字符串` | 中等 | 第 156 场周赛 | -| 1210 | [穿过迷宫的最少移动次数](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README.md) | `广度优先搜索`,`数组`,`矩阵` | 困难 | 第 156 场周赛 | -| 1211 | [查询结果的质量和占比](/solution/1200-1299/1211.Queries%20Quality%20and%20Percentage/README.md) | `数据库` | 简单 | | -| 1212 | [查询球队积分](/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README.md) | `数据库` | 中等 | 🔒 | -| 1213 | [三个有序数组的交集](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md) | `数组`,`哈希表`,`二分查找`,`计数` | 简单 | 第 10 场双周赛 | -| 1214 | [查找两棵二叉搜索树之和](/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md) | `栈`,`树`,`深度优先搜索`,`二叉搜索树`,`双指针`,`二分查找`,`二叉树` | 中等 | 第 10 场双周赛 | -| 1215 | [步进数](/solution/1200-1299/1215.Stepping%20Numbers/README.md) | `广度优先搜索`,`回溯` | 中等 | 第 10 场双周赛 | -| 1216 | [验证回文串 III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README.md) | `字符串`,`动态规划` | 困难 | 第 10 场双周赛 | -| 1217 | [玩筹码](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README.md) | `贪心`,`数组`,`数学` | 简单 | 第 157 场周赛 | -| 1218 | [最长定差子序列](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README.md) | `数组`,`哈希表`,`动态规划` | 中等 | 第 157 场周赛 | -| 1219 | [黄金矿工](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md) | `数组`,`回溯`,`矩阵` | 中等 | 第 157 场周赛 | -| 1220 | [统计元音字母序列的数目](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README.md) | `动态规划` | 困难 | 第 157 场周赛 | -| 1221 | [分割平衡字符串](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README.md) | `贪心`,`字符串`,`计数` | 简单 | 第 158 场周赛 | -| 1222 | [可以攻击国王的皇后](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 158 场周赛 | -| 1223 | [掷骰子模拟](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README.md) | `数组`,`动态规划` | 困难 | 第 158 场周赛 | -| 1224 | [最大相等频率](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README.md) | `数组`,`哈希表` | 困难 | 第 158 场周赛 | -| 1225 | [报告系统状态的连续日期](/solution/1200-1299/1225.Report%20Contiguous%20Dates/README.md) | `数据库` | 困难 | 🔒 | -| 1226 | [哲学家进餐](/solution/1200-1299/1226.The%20Dining%20Philosophers/README.md) | `多线程` | 中等 | | -| 1227 | [飞机座位分配概率](/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README.md) | `脑筋急转弯`,`数学`,`动态规划`,`概率与统计` | 中等 | | -| 1228 | [等差数列中缺失的数字](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md) | `数组`,`数学` | 简单 | 第 11 场双周赛 | -| 1229 | [安排会议日程](/solution/1200-1299/1229.Meeting%20Scheduler/README.md) | `数组`,`双指针`,`排序` | 中等 | 第 11 场双周赛 | -| 1230 | [抛掷硬币](/solution/1200-1299/1230.Toss%20Strange%20Coins/README.md) | `数组`,`数学`,`动态规划`,`概率与统计` | 中等 | 第 11 场双周赛 | -| 1231 | [分享巧克力](/solution/1200-1299/1231.Divide%20Chocolate/README.md) | `数组`,`二分查找` | 困难 | 第 11 场双周赛 | -| 1232 | [缀点成线](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README.md) | `几何`,`数组`,`数学` | 简单 | 第 159 场周赛 | -| 1233 | [删除子文件夹](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README.md) | `深度优先搜索`,`字典树`,`数组`,`字符串` | 中等 | 第 159 场周赛 | -| 1234 | [替换子串得到平衡字符串](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README.md) | `字符串`,`滑动窗口` | 中等 | 第 159 场周赛 | -| 1235 | [规划兼职工作](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md) | `数组`,`二分查找`,`动态规划`,`排序` | 困难 | 第 159 场周赛 | -| 1236 | [网络爬虫](/solution/1200-1299/1236.Web%20Crawler/README.md) | `深度优先搜索`,`广度优先搜索`,`字符串`,`交互` | 中等 | 🔒 | -| 1237 | [找出给定方程的正整数解](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README.md) | `数学`,`双指针`,`二分查找`,`交互` | 中等 | 第 160 场周赛 | -| 1238 | [循环码排列](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README.md) | `位运算`,`数学`,`回溯` | 中等 | 第 160 场周赛 | -| 1239 | [串联字符串的最大长度](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README.md) | `位运算`,`数组`,`字符串`,`回溯` | 中等 | 第 160 场周赛 | -| 1240 | [铺瓷砖](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README.md) | `回溯` | 困难 | 第 160 场周赛 | -| 1241 | [每个帖子的评论数](/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README.md) | `数据库` | 简单 | 🔒 | -| 1242 | [多线程网页爬虫](/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README.md) | `深度优先搜索`,`广度优先搜索`,`多线程` | 中等 | 🔒 | -| 1243 | [数组变换](/solution/1200-1299/1243.Array%20Transformation/README.md) | `数组`,`模拟` | 简单 | 第 12 场双周赛 | -| 1244 | [力扣排行榜](/solution/1200-1299/1244.Design%20A%20Leaderboard/README.md) | `设计`,`哈希表`,`排序` | 中等 | 第 12 场双周赛 | -| 1245 | [树的直径](/solution/1200-1299/1245.Tree%20Diameter/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | 第 12 场双周赛 | -| 1246 | [删除回文子数组](/solution/1200-1299/1246.Palindrome%20Removal/README.md) | `数组`,`动态规划` | 困难 | 第 12 场双周赛 | -| 1247 | [交换字符使得字符串相同](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README.md) | `贪心`,`数学`,`字符串` | 中等 | 第 161 场周赛 | -| 1248 | [统计「优美子数组」](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README.md) | `数组`,`哈希表`,`数学`,`滑动窗口` | 中等 | 第 161 场周赛 | -| 1249 | [移除无效的括号](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md) | `栈`,`字符串` | 中等 | 第 161 场周赛 | -| 1250 | [检查「好数组」](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README.md) | `数组`,`数学`,`数论` | 困难 | 第 161 场周赛 | -| 1251 | [平均售价](/solution/1200-1299/1251.Average%20Selling%20Price/README.md) | `数据库` | 简单 | | -| 1252 | [奇数值单元格的数目](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README.md) | `数组`,`数学`,`模拟` | 简单 | 第 162 场周赛 | -| 1253 | [重构 2 行二进制矩阵](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README.md) | `贪心`,`数组`,`矩阵` | 中等 | 第 162 场周赛 | -| 1254 | [统计封闭岛屿的数目](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 162 场周赛 | -| 1255 | [得分最高的单词集合](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README.md) | `位运算`,`数组`,`字符串`,`动态规划`,`回溯`,`状态压缩` | 困难 | 第 162 场周赛 | -| 1256 | [加密数字](/solution/1200-1299/1256.Encode%20Number/README.md) | `位运算`,`数学`,`字符串` | 中等 | 第 13 场双周赛 | -| 1257 | [最小公共区域](/solution/1200-1299/1257.Smallest%20Common%20Region/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组`,`哈希表`,`字符串` | 中等 | 第 13 场双周赛 | -| 1258 | [近义词句子](/solution/1200-1299/1258.Synonymous%20Sentences/README.md) | `并查集`,`数组`,`哈希表`,`字符串`,`回溯` | 中等 | 第 13 场双周赛 | -| 1259 | [不相交的握手](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md) | `数学`,`动态规划` | 困难 | 第 13 场双周赛 | -| 1260 | [二维网格迁移](/solution/1200-1299/1260.Shift%202D%20Grid/README.md) | `数组`,`矩阵`,`模拟` | 简单 | 第 163 场周赛 | -| 1261 | [在受污染的二叉树中查找元素](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`哈希表`,`二叉树` | 中等 | 第 163 场周赛 | -| 1262 | [可被三整除的最大和](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README.md) | `贪心`,`数组`,`动态规划`,`排序` | 中等 | 第 163 场周赛 | -| 1263 | [推箱子](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README.md) | `广度优先搜索`,`数组`,`矩阵`,`堆（优先队列）` | 困难 | 第 163 场周赛 | -| 1264 | [页面推荐](/solution/1200-1299/1264.Page%20Recommendations/README.md) | `数据库` | 中等 | 🔒 | -| 1265 | [逆序打印不可变链表](/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README.md) | `栈`,`递归`,`链表`,`双指针` | 中等 | 🔒 | -| 1266 | [访问所有点的最小时间](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README.md) | `几何`,`数组`,`数学` | 简单 | 第 164 场周赛 | -| 1267 | [统计参与通信的服务器](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`计数`,`矩阵` | 中等 | 第 164 场周赛 | -| 1268 | [搜索推荐系统](/solution/1200-1299/1268.Search%20Suggestions%20System/README.md) | `字典树`,`数组`,`字符串`,`二分查找`,`排序`,`堆（优先队列）` | 中等 | 第 164 场周赛 | -| 1269 | [停在原地的方案数](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README.md) | `动态规划` | 困难 | 第 164 场周赛 | -| 1270 | [向公司 CEO 汇报工作的所有人](/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README.md) | `数据库` | 中等 | 🔒 | -| 1271 | [十六进制魔术数字](/solution/1200-1299/1271.Hexspeak/README.md) | `数学`,`字符串` | 简单 | 第 14 场双周赛 | -| 1272 | [删除区间](/solution/1200-1299/1272.Remove%20Interval/README.md) | `数组` | 中等 | 第 14 场双周赛 | -| 1273 | [删除树节点](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组` | 中等 | 第 14 场双周赛 | -| 1274 | [矩形内船只的数目](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md) | `数组`,`分治`,`交互` | 困难 | 第 14 场双周赛 | -| 1275 | [找出井字棋的获胜者](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README.md) | `数组`,`哈希表`,`矩阵`,`模拟` | 简单 | 第 165 场周赛 | -| 1276 | [不浪费原料的汉堡制作方案](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README.md) | `数学` | 中等 | 第 165 场周赛 | -| 1277 | [统计全为 1 的正方形子矩阵](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 165 场周赛 | -| 1278 | [分割回文串 III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README.md) | `字符串`,`动态规划` | 困难 | 第 165 场周赛 | -| 1279 | [红绿灯路口](/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README.md) | `多线程` | 简单 | 🔒 | -| 1280 | [学生们参加各科测试的次数](/solution/1200-1299/1280.Students%20and%20Examinations/README.md) | `数据库` | 简单 | | -| 1281 | [整数的各位积和之差](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README.md) | `数学` | 简单 | 第 166 场周赛 | -| 1282 | [用户分组](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README.md) | `数组`,`哈希表` | 中等 | 第 166 场周赛 | -| 1283 | [使结果不超过阈值的最小除数](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README.md) | `数组`,`二分查找` | 中等 | 第 166 场周赛 | -| 1284 | [转化为全零矩阵的最少反转次数](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README.md) | `位运算`,`广度优先搜索`,`数组`,`哈希表`,`矩阵` | 困难 | 第 166 场周赛 | -| 1285 | [找到连续区间的开始和结束数字](/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README.md) | `数据库` | 中等 | 🔒 | -| 1286 | [字母组合迭代器](/solution/1200-1299/1286.Iterator%20for%20Combination/README.md) | `设计`,`字符串`,`回溯`,`迭代器` | 中等 | 第 15 场双周赛 | -| 1287 | [有序数组中出现次数超过 25%的元素](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README.md) | `数组` | 简单 | 第 15 场双周赛 | -| 1288 | [删除被覆盖区间](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README.md) | `数组`,`排序` | 中等 | 第 15 场双周赛 | -| 1289 | [下降路径最小和 II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 15 场双周赛 | -| 1290 | [二进制链表转整数](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README.md) | `链表`,`数学` | 简单 | 第 167 场周赛 | -| 1291 | [顺次数](/solution/1200-1299/1291.Sequential%20Digits/README.md) | `枚举` | 中等 | 第 167 场周赛 | -| 1292 | [元素和小于等于阈值的正方形的最大边长](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README.md) | `数组`,`二分查找`,`矩阵`,`前缀和` | 中等 | 第 167 场周赛 | -| 1293 | [网格中的最短路径](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md) | `广度优先搜索`,`数组`,`矩阵` | 困难 | 第 167 场周赛 | -| 1294 | [不同国家的天气类型](/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README.md) | `数据库` | 简单 | 🔒 | -| 1295 | [统计位数为偶数的数字](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README.md) | `数组` | 简单 | 第 168 场周赛 | -| 1296 | [划分数组为连续数字的集合](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README.md) | `贪心`,`数组`,`哈希表`,`排序` | 中等 | 第 168 场周赛 | -| 1297 | [子串的最大出现次数](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 第 168 场周赛 | -| 1298 | [你能从盒子里获得的最大糖果数](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README.md) | `广度优先搜索`,`图`,`数组` | 困难 | 第 168 场周赛 | -| 1299 | [将每个元素替换为右侧最大元素](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README.md) | `数组` | 简单 | 第 16 场双周赛 | -| 1300 | [转变数组后最接近目标值的数组和](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README.md) | `数组`,`二分查找`,`排序` | 中等 | 第 16 场双周赛 | -| 1301 | [最大得分的路径数目](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 16 场双周赛 | -| 1302 | [层数最深叶子节点的和](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 16 场双周赛 | -| 1303 | [求团队人数](/solution/1300-1399/1303.Find%20the%20Team%20Size/README.md) | `数据库` | 简单 | 🔒 | -| 1304 | [和为零的 N 个不同整数](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README.md) | `数组`,`数学` | 简单 | 第 169 场周赛 | -| 1305 | [两棵二叉搜索树中的所有元素](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树`,`排序` | 中等 | 第 169 场周赛 | -| 1306 | [跳跃游戏 III](/solution/1300-1399/1306.Jump%20Game%20III/README.md) | `深度优先搜索`,`广度优先搜索`,`数组` | 中等 | 第 169 场周赛 | -| 1307 | [口算难题](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README.md) | `数组`,`数学`,`字符串`,`回溯` | 困难 | 第 169 场周赛 | -| 1308 | [不同性别每日分数总计](/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README.md) | `数据库` | 中等 | 🔒 | -| 1309 | [解码字母到整数映射](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README.md) | `字符串` | 简单 | 第 170 场周赛 | -| 1310 | [子数组异或查询](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README.md) | `位运算`,`数组`,`前缀和` | 中等 | 第 170 场周赛 | -| 1311 | [获取你好友已观看的视频](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README.md) | `广度优先搜索`,`图`,`数组`,`哈希表`,`排序` | 中等 | 第 170 场周赛 | -| 1312 | [让字符串成为回文串的最少插入次数](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md) | `字符串`,`动态规划` | 困难 | 第 170 场周赛 | -| 1313 | [解压缩编码列表](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README.md) | `数组` | 简单 | 第 17 场双周赛 | -| 1314 | [矩阵区域和](/solution/1300-1399/1314.Matrix%20Block%20Sum/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 17 场双周赛 | -| 1315 | [祖父节点值为偶数的节点和](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 17 场双周赛 | -| 1316 | [不同的循环子字符串](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README.md) | `字典树`,`字符串`,`哈希函数`,`滚动哈希` | 困难 | 第 17 场双周赛 | -| 1317 | [将整数转换为两个无零整数的和](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README.md) | `数学` | 简单 | 第 171 场周赛 | -| 1318 | [或运算的最小翻转次数](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README.md) | `位运算` | 中等 | 第 171 场周赛 | -| 1319 | [连通网络的操作次数](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 第 171 场周赛 | -| 1320 | [二指输入的的最小距离](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README.md) | `字符串`,`动态规划` | 困难 | 第 171 场周赛 | -| 1321 | [餐馆营业额变化增长](/solution/1300-1399/1321.Restaurant%20Growth/README.md) | `数据库` | 中等 | | -| 1322 | [广告效果](/solution/1300-1399/1322.Ads%20Performance/README.md) | `数据库` | 简单 | 🔒 | -| 1323 | [6 和 9 组成的最大数字](/solution/1300-1399/1323.Maximum%2069%20Number/README.md) | `贪心`,`数学` | 简单 | 第 172 场周赛 | -| 1324 | [竖直打印单词](/solution/1300-1399/1324.Print%20Words%20Vertically/README.md) | `数组`,`字符串`,`模拟` | 中等 | 第 172 场周赛 | -| 1325 | [删除给定值的叶子节点](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 172 场周赛 | -| 1326 | [灌溉花园的最少水龙头数目](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md) | `贪心`,`数组`,`动态规划` | 困难 | 第 172 场周赛 | -| 1327 | [列出指定时间段内所有的下单产品](/solution/1300-1399/1327.List%20the%20Products%20Ordered%20in%20a%20Period/README.md) | `数据库` | 简单 | | -| 1328 | [破坏回文串](/solution/1300-1399/1328.Break%20a%20Palindrome/README.md) | `贪心`,`字符串` | 中等 | 第 18 场双周赛 | -| 1329 | [将矩阵按对角线排序](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README.md) | `数组`,`矩阵`,`排序` | 中等 | 第 18 场双周赛 | -| 1330 | [翻转子数组得到最大的数组值](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md) | `贪心`,`数组`,`数学` | 困难 | 第 18 场双周赛 | -| 1331 | [数组序号转换](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 18 场双周赛 | -| 1332 | [删除回文子序列](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README.md) | `双指针`,`字符串` | 简单 | 第 173 场周赛 | -| 1333 | [餐厅过滤器](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README.md) | `数组`,`排序` | 中等 | 第 173 场周赛 | -| 1334 | [阈值距离内邻居最少的城市](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README.md) | `图`,`动态规划`,`最短路` | 中等 | 第 173 场周赛 | -| 1335 | [工作计划的最低难度](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README.md) | `数组`,`动态规划` | 困难 | 第 173 场周赛 | -| 1336 | [每次访问的交易次数](/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README.md) | `数据库` | 困难 | 🔒 | -| 1337 | [矩阵中战斗力最弱的 K 行](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README.md) | `数组`,`二分查找`,`矩阵`,`排序`,`堆（优先队列）` | 简单 | 第 174 场周赛 | -| 1338 | [数组大小减半](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README.md) | `贪心`,`数组`,`哈希表`,`排序`,`堆（优先队列）` | 中等 | 第 174 场周赛 | -| 1339 | [分裂二叉树的最大乘积](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 174 场周赛 | -| 1340 | [跳跃游戏 V](/solution/1300-1399/1340.Jump%20Game%20V/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 174 场周赛 | -| 1341 | [电影评分](/solution/1300-1399/1341.Movie%20Rating/README.md) | `数据库` | 中等 | | -| 1342 | [将数字变成 0 的操作次数](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README.md) | `位运算`,`数学` | 简单 | 第 19 场双周赛 | -| 1343 | [大小为 K 且平均值大于等于阈值的子数组数目](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README.md) | `数组`,`滑动窗口` | 中等 | 第 19 场双周赛 | -| 1344 | [时钟指针的夹角](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README.md) | `数学` | 中等 | 第 19 场双周赛 | -| 1345 | [跳跃游戏 IV](/solution/1300-1399/1345.Jump%20Game%20IV/README.md) | `广度优先搜索`,`数组`,`哈希表` | 困难 | 第 19 场双周赛 | -| 1346 | [检查整数及其两倍数是否存在](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`排序` | 简单 | 第 175 场周赛 | -| 1347 | [制造字母异位词的最小步骤数](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 175 场周赛 | -| 1348 | [推文计数](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README.md) | `设计`,`哈希表`,`二分查找`,`有序集合`,`排序` | 中等 | 第 175 场周赛 | -| 1349 | [参加考试的最大学生数](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩`,`矩阵` | 困难 | 第 175 场周赛 | -| 1350 | [院系无效的学生](/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README.md) | `数据库` | 简单 | 🔒 | -| 1351 | [统计有序矩阵中的负数](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README.md) | `数组`,`二分查找`,`矩阵` | 简单 | 第 176 场周赛 | -| 1352 | [最后 K 个数的乘积](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README.md) | `设计`,`队列`,`数组`,`数学`,`数据流` | 中等 | 第 176 场周赛 | -| 1353 | [最多可以参加的会议数目](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 中等 | 第 176 场周赛 | -| 1354 | [多次求和构造目标数组](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README.md) | `数组`,`堆（优先队列）` | 困难 | 第 176 场周赛 | -| 1355 | [活动参与者](/solution/1300-1399/1355.Activity%20Participants/README.md) | `数据库` | 中等 | 🔒 | -| 1356 | [根据数字二进制下 1 的数目排序](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README.md) | `位运算`,`数组`,`计数`,`排序` | 简单 | 第 20 场双周赛 | -| 1357 | [每隔 n 个顾客打折](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README.md) | `设计`,`数组`,`哈希表` | 中等 | 第 20 场双周赛 | -| 1358 | [包含所有三种字符的子字符串数目](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 第 20 场双周赛 | -| 1359 | [有效的快递序列数目](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README.md) | `数学`,`动态规划`,`组合数学` | 困难 | 第 20 场双周赛 | -| 1360 | [日期之间隔几天](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README.md) | `数学`,`字符串` | 简单 | 第 177 场周赛 | -| 1361 | [验证二叉树](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`二叉树` | 中等 | 第 177 场周赛 | -| 1362 | [最接近的因数](/solution/1300-1399/1362.Closest%20Divisors/README.md) | `数学` | 中等 | 第 177 场周赛 | -| 1363 | [形成三的最大倍数](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README.md) | `贪心`,`数组`,`动态规划` | 困难 | 第 177 场周赛 | -| 1364 | [顾客的可信联系人数量](/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README.md) | `数据库` | 中等 | 🔒 | -| 1365 | [有多少小于当前数字的数字](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README.md) | `数组`,`哈希表`,`计数`,`排序` | 简单 | 第 178 场周赛 | -| 1366 | [通过投票对团队排名](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README.md) | `数组`,`哈希表`,`字符串`,`计数`,`排序` | 中等 | 第 178 场周赛 | -| 1367 | [二叉树中的链表](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`链表`,`二叉树` | 中等 | 第 178 场周赛 | -| 1368 | [使网格图至少有一条有效路径的最小代价](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md) | `广度优先搜索`,`图`,`数组`,`矩阵`,`最短路`,`堆（优先队列）` | 困难 | 第 178 场周赛 | -| 1369 | [获取最近第二次的活动](/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README.md) | `数据库` | 困难 | 🔒 | -| 1370 | [上升下降字符串](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 21 场双周赛 | -| 1371 | [每个元音包含偶数次的最长子字符串](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md) | `位运算`,`哈希表`,`字符串`,`前缀和` | 中等 | 第 21 场双周赛 | -| 1372 | [二叉树中的最长交错路径](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`动态规划`,`二叉树` | 中等 | 第 21 场双周赛 | -| 1373 | [二叉搜索子树的最大键值和](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`动态规划`,`二叉树` | 困难 | 第 21 场双周赛 | -| 1374 | [生成每种字符都是奇数个的字符串](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README.md) | `字符串` | 简单 | 第 179 场周赛 | -| 1375 | [二进制字符串前缀一致的次数](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README.md) | `数组` | 中等 | 第 179 场周赛 | -| 1376 | [通知所有员工所需的时间](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md) | `树`,`深度优先搜索`,`广度优先搜索` | 中等 | 第 179 场周赛 | -| 1377 | [T 秒后青蛙的位置](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`图` | 困难 | 第 179 场周赛 | -| 1378 | [使用唯一标识码替换员工 ID](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README.md) | `数据库` | 简单 | | -| 1379 | [找出克隆二叉树中的相同节点](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | -| 1380 | [矩阵中的幸运数](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md) | `数组`,`矩阵` | 简单 | 第 180 场周赛 | -| 1381 | [设计一个支持增量操作的栈](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md) | `栈`,`设计`,`数组` | 中等 | 第 180 场周赛 | -| 1382 | [将二叉搜索树变平衡](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md) | `贪心`,`树`,`深度优先搜索`,`二叉搜索树`,`分治`,`二叉树` | 中等 | 第 180 场周赛 | -| 1383 | [最大的团队表现值](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 困难 | 第 180 场周赛 | -| 1384 | [按年度列出销售总额](/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README.md) | `数据库` | 困难 | 🔒 | -| 1385 | [两个数组间的距离值](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 简单 | 第 22 场双周赛 | -| 1386 | [安排电影院座位](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README.md) | `贪心`,`位运算`,`数组`,`哈希表` | 中等 | 第 22 场双周赛 | -| 1387 | [将整数按权重排序](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README.md) | `记忆化搜索`,`动态规划`,`排序` | 中等 | 第 22 场双周赛 | -| 1388 | [3n 块披萨](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README.md) | `贪心`,`数组`,`动态规划`,`堆（优先队列）` | 困难 | 第 22 场双周赛 | -| 1389 | [按既定顺序创建目标数组](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README.md) | `数组`,`模拟` | 简单 | 第 181 场周赛 | -| 1390 | [四因数](/solution/1300-1399/1390.Four%20Divisors/README.md) | `数组`,`数学` | 中等 | 第 181 场周赛 | -| 1391 | [检查网格中是否存在有效路径](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 181 场周赛 | -| 1392 | [最长快乐前缀](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README.md) | `字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 181 场周赛 | -| 1393 | [股票的资本损益](/solution/1300-1399/1393.Capital%20GainLoss/README.md) | `数据库` | 中等 | | -| 1394 | [找出数组中的幸运数](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 182 场周赛 | -| 1395 | [统计作战单位数](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README.md) | `树状数组`,`数组`,`动态规划` | 中等 | 第 182 场周赛 | -| 1396 | [设计地铁系统](/solution/1300-1399/1396.Design%20Underground%20System/README.md) | `设计`,`哈希表`,`字符串` | 中等 | 第 182 场周赛 | -| 1397 | [找到所有好字符串](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README.md) | `字符串`,`动态规划`,`字符串匹配` | 困难 | 第 182 场周赛 | -| 1398 | [购买了产品 A 和产品 B 却没有购买产品 C 的顾客](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README.md) | `数据库` | 中等 | 🔒 | -| 1399 | [统计最大组的数目](/solution/1300-1399/1399.Count%20Largest%20Group/README.md) | `哈希表`,`数学` | 简单 | 第 23 场双周赛 | -| 1400 | [构造 K 个回文字符串](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md) | `贪心`,`哈希表`,`字符串`,`计数` | 中等 | 第 23 场双周赛 | -| 1401 | [圆和矩形是否有重叠](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md) | `几何`,`数学` | 中等 | 第 23 场双周赛 | -| 1402 | [做菜顺序](/solution/1400-1499/1402.Reducing%20Dishes/README.md) | `贪心`,`数组`,`动态规划`,`排序` | 困难 | 第 23 场双周赛 | -| 1403 | [非递增顺序的最小子序列](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 183 场周赛 | -| 1404 | [将二进制表示减到 1 的步骤数](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md) | `位运算`,`字符串` | 中等 | 第 183 场周赛 | -| 1405 | [最长快乐字符串](/solution/1400-1499/1405.Longest%20Happy%20String/README.md) | `贪心`,`字符串`,`堆（优先队列）` | 中等 | 第 183 场周赛 | -| 1406 | [石子游戏 III](/solution/1400-1499/1406.Stone%20Game%20III/README.md) | `数组`,`数学`,`动态规划`,`博弈` | 困难 | 第 183 场周赛 | -| 1407 | [排名靠前的旅行者](/solution/1400-1499/1407.Top%20Travellers/README.md) | `数据库` | 简单 | | -| 1408 | [数组中的字符串匹配](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README.md) | `数组`,`字符串`,`字符串匹配` | 简单 | 第 184 场周赛 | -| 1409 | [查询带键的排列](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README.md) | `树状数组`,`数组`,`模拟` | 中等 | 第 184 场周赛 | -| 1410 | [HTML 实体解析器](/solution/1400-1499/1410.HTML%20Entity%20Parser/README.md) | `哈希表`,`字符串` | 中等 | 第 184 场周赛 | -| 1411 | [给 N x 3 网格图涂色的方案数](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README.md) | `动态规划` | 困难 | 第 184 场周赛 | -| 1412 | [查找成绩处于中游的学生](/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README.md) | `数据库` | 困难 | 🔒 | -| 1413 | [逐步求和得到正数的最小值](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README.md) | `数组`,`前缀和` | 简单 | 第 24 场双周赛 | -| 1414 | [和为 K 的最少斐波那契数字数目](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README.md) | `贪心`,`数学` | 中等 | 第 24 场双周赛 | -| 1415 | [长度为 n 的开心字符串中字典序第 k 小的字符串](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README.md) | `字符串`,`回溯` | 中等 | 第 24 场双周赛 | -| 1416 | [恢复数组](/solution/1400-1499/1416.Restore%20The%20Array/README.md) | `字符串`,`动态规划` | 困难 | 第 24 场双周赛 | -| 1417 | [重新格式化字符串](/solution/1400-1499/1417.Reformat%20The%20String/README.md) | `字符串` | 简单 | 第 185 场周赛 | -| 1418 | [点菜展示表](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README.md) | `数组`,`哈希表`,`字符串`,`有序集合`,`排序` | 中等 | 第 185 场周赛 | -| 1419 | [数青蛙](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README.md) | `字符串`,`计数` | 中等 | 第 185 场周赛 | -| 1420 | [生成数组](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README.md) | `动态规划`,`前缀和` | 困难 | 第 185 场周赛 | -| 1421 | [净现值查询](/solution/1400-1499/1421.NPV%20Queries/README.md) | `数据库` | 简单 | 🔒 | -| 1422 | [分割字符串的最大得分](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README.md) | `字符串`,`前缀和` | 简单 | 第 186 场周赛 | -| 1423 | [可获得的最大点数](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README.md) | `数组`,`前缀和`,`滑动窗口` | 中等 | 第 186 场周赛 | -| 1424 | [对角线遍历 II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README.md) | `数组`,`排序`,`堆（优先队列）` | 中等 | 第 186 场周赛 | -| 1425 | [带限制的子序列和](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md) | `队列`,`数组`,`动态规划`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 困难 | 第 186 场周赛 | -| 1426 | [数元素](/solution/1400-1499/1426.Counting%20Elements/README.md) | `数组`,`哈希表` | 简单 | 🔒 | -| 1427 | [字符串的左右移](/solution/1400-1499/1427.Perform%20String%20Shifts/README.md) | `数组`,`数学`,`字符串` | 简单 | 🔒 | -| 1428 | [至少有一个 1 的最左端列](/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README.md) | `数组`,`二分查找`,`交互`,`矩阵` | 中等 | 🔒 | -| 1429 | [第一个唯一数字](/solution/1400-1499/1429.First%20Unique%20Number/README.md) | `设计`,`队列`,`数组`,`哈希表`,`数据流` | 中等 | 🔒 | -| 1430 | [判断给定的序列是否是二叉树从根到叶的路径](/solution/1400-1499/1430.Check%20If%20a%20String%20Is%20a%20Valid%20Sequence%20from%20Root%20to%20Leaves%20Path%20in%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | -| 1431 | [拥有最多糖果的孩子](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README.md) | `数组` | 简单 | 第 25 场双周赛 | -| 1432 | [改变一个整数能得到的最大差值](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README.md) | `贪心`,`数学` | 中等 | 第 25 场双周赛 | -| 1433 | [检查一个字符串是否可以打破另一个字符串](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README.md) | `贪心`,`字符串`,`排序` | 中等 | 第 25 场双周赛 | -| 1434 | [每个人戴不同帽子的方案数](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 25 场双周赛 | -| 1435 | [制作会话柱状图](/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README.md) | `数据库` | 简单 | 🔒 | -| 1436 | [旅行终点站](/solution/1400-1499/1436.Destination%20City/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 187 场周赛 | -| 1437 | [是否所有 1 都至少相隔 k 个元素](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README.md) | `数组` | 简单 | 第 187 场周赛 | -| 1438 | [绝对差不超过限制的最长连续子数组](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README.md) | `队列`,`数组`,`有序集合`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 中等 | 第 187 场周赛 | -| 1439 | [有序矩阵中的第 k 个最小数组和](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README.md) | `数组`,`二分查找`,`矩阵`,`堆（优先队列）` | 困难 | 第 187 场周赛 | -| 1440 | [计算布尔表达式的值](/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README.md) | `数据库` | 中等 | 🔒 | -| 1441 | [用栈操作构建数组](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README.md) | `栈`,`数组`,`模拟` | 中等 | 第 188 场周赛 | -| 1442 | [形成两个异或相等数组的三元组数目](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README.md) | `位运算`,`数组`,`哈希表`,`数学`,`前缀和` | 中等 | 第 188 场周赛 | -| 1443 | [收集树上所有苹果的最少时间](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表` | 中等 | 第 188 场周赛 | -| 1444 | [切披萨的方案数](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md) | `记忆化搜索`,`数组`,`动态规划`,`矩阵` | 困难 | 第 188 场周赛 | -| 1445 | [苹果和桔子](/solution/1400-1499/1445.Apples%20%26%20Oranges/README.md) | `数据库` | 中等 | 🔒 | -| 1446 | [连续字符](/solution/1400-1499/1446.Consecutive%20Characters/README.md) | `字符串` | 简单 | 第 26 场双周赛 | -| 1447 | [最简分数](/solution/1400-1499/1447.Simplified%20Fractions/README.md) | `数学`,`字符串`,`数论` | 中等 | 第 26 场双周赛 | -| 1448 | [统计二叉树中好节点的数目](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 26 场双周赛 | -| 1449 | [数位成本和为目标值的最大数字](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README.md) | `数组`,`动态规划` | 困难 | 第 26 场双周赛 | -| 1450 | [在既定时间做作业的学生人数](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README.md) | `数组` | 简单 | 第 189 场周赛 | -| 1451 | [重新排列句子中的单词](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README.md) | `字符串`,`排序` | 中等 | 第 189 场周赛 | -| 1452 | [收藏清单](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 189 场周赛 | -| 1453 | [圆形靶内的最大飞镖数量](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README.md) | `几何`,`数组`,`数学` | 困难 | 第 189 场周赛 | -| 1454 | [活跃用户](/solution/1400-1499/1454.Active%20Users/README.md) | `数据库` | 中等 | 🔒 | -| 1455 | [检查单词是否为句中其他单词的前缀](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README.md) | `双指针`,`字符串`,`字符串匹配` | 简单 | 第 190 场周赛 | -| 1456 | [定长子串中元音的最大数目](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README.md) | `字符串`,`滑动窗口` | 中等 | 第 190 场周赛 | -| 1457 | [二叉树中的伪回文路径](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README.md) | `位运算`,`树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 190 场周赛 | -| 1458 | [两个子序列的最大点积](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README.md) | `数组`,`动态规划` | 困难 | 第 190 场周赛 | -| 1459 | [矩形面积](/solution/1400-1499/1459.Rectangles%20Area/README.md) | `数据库` | 中等 | 🔒 | -| 1460 | [通过翻转子数组使两个数组相等](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 27 场双周赛 | -| 1461 | [检查一个字符串是否包含所有长度为 K 的二进制子串](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README.md) | `位运算`,`哈希表`,`字符串`,`哈希函数`,`滚动哈希` | 中等 | 第 27 场双周赛 | -| 1462 | [课程表 IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | 第 27 场双周赛 | -| 1463 | [摘樱桃 II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 27 场双周赛 | -| 1464 | [数组中两元素的最大乘积](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README.md) | `数组`,`排序`,`堆（优先队列）` | 简单 | 第 191 场周赛 | -| 1465 | [切割后面积最大的蛋糕](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 191 场周赛 | -| 1466 | [重新规划路线](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README.md) | `深度优先搜索`,`广度优先搜索`,`图` | 中等 | 第 191 场周赛 | -| 1467 | [两个盒子中球的颜色数相同的概率](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README.md) | `数组`,`数学`,`动态规划`,`回溯`,`组合数学`,`概率与统计` | 困难 | 第 191 场周赛 | -| 1468 | [计算税后工资](/solution/1400-1499/1468.Calculate%20Salaries/README.md) | `数据库` | 中等 | 🔒 | -| 1469 | [寻找所有的独生节点](/solution/1400-1499/1469.Find%20All%20The%20Lonely%20Nodes/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | 🔒 | -| 1470 | [重新排列数组](/solution/1400-1499/1470.Shuffle%20the%20Array/README.md) | `数组` | 简单 | 第 192 场周赛 | -| 1471 | [数组中的 k 个最强值](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README.md) | `数组`,`双指针`,`排序` | 中等 | 第 192 场周赛 | -| 1472 | [设计浏览器历史记录](/solution/1400-1499/1472.Design%20Browser%20History/README.md) | `栈`,`设计`,`数组`,`链表`,`数据流`,`双向链表` | 中等 | 第 192 场周赛 | -| 1473 | [粉刷房子 III](/solution/1400-1499/1473.Paint%20House%20III/README.md) | `数组`,`动态规划` | 困难 | 第 192 场周赛 | -| 1474 | [删除链表 M 个节点之后的 N 个节点](/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README.md) | `链表` | 简单 | 🔒 | -| 1475 | [商品折扣后的最终价格](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README.md) | `栈`,`数组`,`单调栈` | 简单 | 第 28 场双周赛 | -| 1476 | [子矩形查询](/solution/1400-1499/1476.Subrectangle%20Queries/README.md) | `设计`,`数组`,`矩阵` | 中等 | 第 28 场双周赛 | -| 1477 | [找两个和为目标值且不重叠的子数组](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README.md) | `数组`,`哈希表`,`二分查找`,`动态规划`,`滑动窗口` | 中等 | 第 28 场双周赛 | -| 1478 | [安排邮筒](/solution/1400-1499/1478.Allocate%20Mailboxes/README.md) | `数组`,`数学`,`动态规划`,`排序` | 困难 | 第 28 场双周赛 | -| 1479 | [周内每天的销售情况](/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README.md) | `数据库` | 困难 | 🔒 | -| 1480 | [一维数组的动态和](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README.md) | `数组`,`前缀和` | 简单 | 第 193 场周赛 | -| 1481 | [不同整数的最少数目](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README.md) | `贪心`,`数组`,`哈希表`,`计数`,`排序` | 中等 | 第 193 场周赛 | -| 1482 | [制作 m 束花所需的最少天数](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README.md) | `数组`,`二分查找` | 中等 | 第 193 场周赛 | -| 1483 | [树节点的第 K 个祖先](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`二分查找`,`动态规划` | 困难 | 第 193 场周赛 | -| 1484 | [按日期分组销售产品](/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README.md) | `数据库` | 简单 | | -| 1485 | [克隆含随机指针的二叉树](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 | -| 1486 | [数组异或操作](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README.md) | `位运算`,`数学` | 简单 | 第 194 场周赛 | -| 1487 | [保证文件名唯一](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 194 场周赛 | -| 1488 | [避免洪水泛滥](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README.md) | `贪心`,`数组`,`哈希表`,`二分查找`,`堆（优先队列）` | 中等 | 第 194 场周赛 | -| 1489 | [找到最小生成树里的关键边和伪关键边](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README.md) | `并查集`,`图`,`最小生成树`,`排序`,`强连通分量` | 困难 | 第 194 场周赛 | -| 1490 | [克隆 N 叉树](/solution/1400-1499/1490.Clone%20N-ary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表` | 中等 | 🔒 | -| 1491 | [去掉最低工资和最高工资后的工资平均值](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README.md) | `数组`,`排序` | 简单 | 第 29 场双周赛 | -| 1492 | [n 的第 k 个因子](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README.md) | `数学`,`数论` | 中等 | 第 29 场双周赛 | -| 1493 | [删掉一个元素以后全为 1 的最长子数组](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README.md) | `数组`,`动态规划`,`滑动窗口` | 中等 | 第 29 场双周赛 | -| 1494 | [并行课程 II](/solution/1400-1499/1494.Parallel%20Courses%20II/README.md) | `位运算`,`图`,`动态规划`,`状态压缩` | 困难 | 第 29 场双周赛 | -| 1495 | [上月播放的儿童适宜电影](/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README.md) | `数据库` | 简单 | 🔒 | -| 1496 | [判断路径是否相交](/solution/1400-1499/1496.Path%20Crossing/README.md) | `哈希表`,`字符串` | 简单 | 第 195 场周赛 | -| 1497 | [检查数组对是否可以被 k 整除](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 195 场周赛 | -| 1498 | [满足条件的子序列数目](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 195 场周赛 | -| 1499 | [满足不等式的最大值](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README.md) | `队列`,`数组`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 困难 | 第 195 场周赛 | -| 1500 | [设计文件分享系统](/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README.md) | `设计`,`哈希表`,`数据流`,`堆（优先队列）` | 中等 | 🔒 | -| 1501 | [可以放心投资的国家](/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README.md) | `数据库` | 中等 | 🔒 | -| 1502 | [判断能否形成等差数列](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README.md) | `数组`,`排序` | 简单 | 第 196 场周赛 | -| 1503 | [所有蚂蚁掉下来前的最后一刻](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README.md) | `脑筋急转弯`,`数组`,`模拟` | 中等 | 第 196 场周赛 | -| 1504 | [统计全 1 子矩形](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README.md) | `栈`,`数组`,`动态规划`,`矩阵`,`单调栈` | 中等 | 第 196 场周赛 | -| 1505 | [最多 K 次交换相邻数位后得到的最小整数](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README.md) | `贪心`,`树状数组`,`线段树`,`字符串` | 困难 | 第 196 场周赛 | -| 1506 | [找到 N 叉树的根节点](/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README.md) | `位运算`,`树`,`深度优先搜索`,`哈希表` | 中等 | 🔒 | -| 1507 | [转变日期格式](/solution/1500-1599/1507.Reformat%20Date/README.md) | `字符串` | 简单 | 第 30 场双周赛 | -| 1508 | [子数组和排序后的区间和](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 30 场双周赛 | -| 1509 | [三次操作后最大值与最小值的最小差](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 30 场双周赛 | -| 1510 | [石子游戏 IV](/solution/1500-1599/1510.Stone%20Game%20IV/README.md) | `数学`,`动态规划`,`博弈` | 困难 | 第 30 场双周赛 | -| 1511 | [消费者下单频率](/solution/1500-1599/1511.Customer%20Order%20Frequency/README.md) | `数据库` | 简单 | 🔒 | -| 1512 | [好数对的数目](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README.md) | `数组`,`哈希表`,`数学`,`计数` | 简单 | 第 197 场周赛 | -| 1513 | [仅含 1 的子串数](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md) | `数学`,`字符串` | 中等 | 第 197 场周赛 | -| 1514 | [概率最大的路径](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README.md) | `图`,`数组`,`最短路`,`堆（优先队列）` | 中等 | 第 197 场周赛 | -| 1515 | [服务中心的最佳位置](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README.md) | `几何`,`数学`,`随机化` | 困难 | 第 197 场周赛 | -| 1516 | [移动 N 叉树的子树](/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README.md) | `树`,`深度优先搜索` | 困难 | 🔒 | -| 1517 | [查找拥有有效邮箱的用户](/solution/1500-1599/1517.Find%20Users%20With%20Valid%20E-Mails/README.md) | `数据库` | 简单 | | -| 1518 | [换水问题](/solution/1500-1599/1518.Water%20Bottles/README.md) | `数学`,`模拟` | 简单 | 第 198 场周赛 | -| 1519 | [子树中标签相同的节点数](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`计数` | 中等 | 第 198 场周赛 | -| 1520 | [最多的不重叠子字符串](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README.md) | `贪心`,`字符串` | 困难 | 第 198 场周赛 | -| 1521 | [找到最接近目标值的函数值](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README.md) | `位运算`,`线段树`,`数组`,`二分查找` | 困难 | 第 198 场周赛 | -| 1522 | [N 叉树的直径](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md) | `树`,`深度优先搜索` | 中等 | 🔒 | -| 1523 | [在区间范围内统计奇数数目](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README.md) | `数学` | 简单 | 第 31 场双周赛 | -| 1524 | [和为奇数的子数组数目](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README.md) | `数组`,`数学`,`动态规划`,`前缀和` | 中等 | 第 31 场双周赛 | -| 1525 | [字符串的好分割数目](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README.md) | `位运算`,`哈希表`,`字符串`,`动态规划` | 中等 | 第 31 场双周赛 | -| 1526 | [形成目标数组的子数组最少增加次数](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README.md) | `栈`,`贪心`,`数组`,`动态规划`,`单调栈` | 困难 | 第 31 场双周赛 | -| 1527 | [患某种疾病的患者](/solution/1500-1599/1527.Patients%20With%20a%20Condition/README.md) | `数据库` | 简单 | | -| 1528 | [重新排列字符串](/solution/1500-1599/1528.Shuffle%20String/README.md) | `数组`,`字符串` | 简单 | 第 199 场周赛 | -| 1529 | [最少的后缀翻转次数](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README.md) | `贪心`,`字符串` | 中等 | 第 199 场周赛 | -| 1530 | [好叶子节点对的数量](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 199 场周赛 | -| 1531 | [压缩字符串 II](/solution/1500-1599/1531.String%20Compression%20II/README.md) | `字符串`,`动态规划` | 困难 | 第 199 场周赛 | -| 1532 | [最近的三笔订单](/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README.md) | `数据库` | 中等 | 🔒 | -| 1533 | [找到最大整数的索引](/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README.md) | `数组`,`二分查找`,`交互` | 中等 | 🔒 | -| 1534 | [统计好三元组](/solution/1500-1599/1534.Count%20Good%20Triplets/README.md) | `数组`,`枚举` | 简单 | 第 200 场周赛 | -| 1535 | [找出数组游戏的赢家](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README.md) | `数组`,`模拟` | 中等 | 第 200 场周赛 | -| 1536 | [排布二进制网格的最少交换次数](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README.md) | `贪心`,`数组`,`矩阵` | 中等 | 第 200 场周赛 | -| 1537 | [最大得分](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README.md) | `贪心`,`数组`,`双指针`,`动态规划` | 困难 | 第 200 场周赛 | -| 1538 | [找出隐藏数组中出现次数最多的元素](/solution/1500-1599/1538.Guess%20the%20Majority%20in%20a%20Hidden%20Array/README.md) | `数组`,`数学`,`交互` | 中等 | 🔒 | -| 1539 | [第 k 个缺失的正整数](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README.md) | `数组`,`二分查找` | 简单 | 第 32 场双周赛 | -| 1540 | [K 次操作转变字符串](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README.md) | `哈希表`,`字符串` | 中等 | 第 32 场双周赛 | -| 1541 | [平衡括号字符串的最少插入次数](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md) | `栈`,`贪心`,`字符串` | 中等 | 第 32 场双周赛 | -| 1542 | [找出最长的超赞子字符串](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README.md) | `位运算`,`哈希表`,`字符串` | 困难 | 第 32 场双周赛 | -| 1543 | [产品名称格式修复](/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README.md) | `数据库` | 简单 | 🔒 | -| 1544 | [整理字符串](/solution/1500-1599/1544.Make%20The%20String%20Great/README.md) | `栈`,`字符串` | 简单 | 第 201 场周赛 | -| 1545 | [找出第 N 个二进制字符串中的第 K 位](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README.md) | `递归`,`字符串`,`模拟` | 中等 | 第 201 场周赛 | -| 1546 | [和为目标值且不重叠的非空子数组的最大数目](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README.md) | `贪心`,`数组`,`哈希表`,`前缀和` | 中等 | 第 201 场周赛 | -| 1547 | [切棍子的最小成本](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 201 场周赛 | -| 1548 | [图中最相似的路径](/solution/1500-1599/1548.The%20Most%20Similar%20Path%20in%20a%20Graph/README.md) | `图`,`动态规划` | 困难 | 🔒 | -| 1549 | [每件商品的最新订单](/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README.md) | `数据库` | 中等 | 🔒 | -| 1550 | [存在连续三个奇数的数组](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README.md) | `数组` | 简单 | 第 202 场周赛 | -| 1551 | [使数组中所有元素相等的最小操作数](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README.md) | `数学` | 中等 | 第 202 场周赛 | -| 1552 | [两球之间的磁力](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README.md) | `数组`,`二分查找`,`排序` | 中等 | 第 202 场周赛 | -| 1553 | [吃掉 N 个橘子的最少天数](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README.md) | `记忆化搜索`,`动态规划` | 困难 | 第 202 场周赛 | -| 1554 | [只有一个不同字符的字符串](/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README.md) | `哈希表`,`字符串`,`哈希函数`,`滚动哈希` | 中等 | 🔒 | -| 1555 | [银行账户概要](/solution/1500-1599/1555.Bank%20Account%20Summary/README.md) | `数据库` | 中等 | 🔒 | -| 1556 | [千位分隔数](/solution/1500-1599/1556.Thousand%20Separator/README.md) | `字符串` | 简单 | 第 33 场双周赛 | -| 1557 | [可以到达所有点的最少点数目](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README.md) | `图` | 中等 | 第 33 场双周赛 | -| 1558 | [得到目标数组的最少函数调用次数](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README.md) | `贪心`,`位运算`,`数组` | 中等 | 第 33 场双周赛 | -| 1559 | [二维网格图中探测环](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 33 场双周赛 | -| 1560 | [圆形赛道上经过次数最多的扇区](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README.md) | `数组`,`模拟` | 简单 | 第 203 场周赛 | -| 1561 | [你可以获得的最大硬币数目](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README.md) | `贪心`,`数组`,`数学`,`博弈`,`排序` | 中等 | 第 203 场周赛 | -| 1562 | [查找大小为 M 的最新分组](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README.md) | `数组`,`二分查找`,`模拟` | 中等 | 第 203 场周赛 | -| 1563 | [石子游戏 V](/solution/1500-1599/1563.Stone%20Game%20V/README.md) | `数组`,`数学`,`动态规划`,`博弈` | 困难 | 第 203 场周赛 | -| 1564 | [把箱子放进仓库里 I](/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | -| 1565 | [按月统计订单数与顾客数](/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README.md) | `数据库` | 简单 | 🔒 | -| 1566 | [重复至少 K 次且长度为 M 的模式](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README.md) | `数组`,`枚举` | 简单 | 第 204 场周赛 | -| 1567 | [乘积为正数的最长子数组长度](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README.md) | `贪心`,`数组`,`动态规划` | 中等 | 第 204 场周赛 | -| 1568 | [使陆地分离的最少天数](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵`,`强连通分量` | 困难 | 第 204 场周赛 | -| 1569 | [将子数组重新排序得到同一个二叉搜索树的方案数](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README.md) | `树`,`并查集`,`二叉搜索树`,`记忆化搜索`,`数组`,`数学`,`分治`,`动态规划`,`二叉树`,`组合数学` | 困难 | 第 204 场周赛 | -| 1570 | [两个稀疏向量的点积](/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README.md) | `设计`,`数组`,`哈希表`,`双指针` | 中等 | 🔒 | -| 1571 | [仓库经理](/solution/1500-1599/1571.Warehouse%20Manager/README.md) | `数据库` | 简单 | 🔒 | -| 1572 | [矩阵对角线元素的和](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README.md) | `数组`,`矩阵` | 简单 | 第 34 场双周赛 | -| 1573 | [分割字符串的方案数](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md) | `数学`,`字符串` | 中等 | 第 34 场双周赛 | -| 1574 | [删除最短的子数组使剩余数组有序](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md) | `栈`,`数组`,`双指针`,`二分查找`,`单调栈` | 中等 | 第 34 场双周赛 | -| 1575 | [统计所有可行路径](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md) | `记忆化搜索`,`数组`,`动态规划` | 困难 | 第 34 场双周赛 | -| 1576 | [替换所有的问号](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md) | `字符串` | 简单 | 第 205 场周赛 | -| 1577 | [数的平方等于两数乘积的方法数](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md) | `数组`,`哈希表`,`数学`,`双指针` | 中等 | 第 205 场周赛 | -| 1578 | [使绳子变成彩色的最短时间](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README.md) | `贪心`,`数组`,`字符串`,`动态规划` | 中等 | 第 205 场周赛 | -| 1579 | [保证图可完全遍历](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md) | `并查集`,`图` | 困难 | 第 205 场周赛 | -| 1580 | [把箱子放进仓库里 II](/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | -| 1581 | [进店却未进行过交易的顾客](/solution/1500-1599/1581.Customer%20Who%20Visited%20but%20Did%20Not%20Make%20Any%20Transactions/README.md) | `数据库` | 简单 | | -| 1582 | [二进制矩阵中的特殊位置](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README.md) | `数组`,`矩阵` | 简单 | 第 206 场周赛 | -| 1583 | [统计不开心的朋友](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README.md) | `数组`,`模拟` | 中等 | 第 206 场周赛 | -| 1584 | [连接所有点的最小费用](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md) | `并查集`,`图`,`数组`,`最小生成树` | 中等 | 第 206 场周赛 | -| 1585 | [检查字符串是否可以通过排序子字符串得到另一个字符串](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README.md) | `贪心`,`字符串`,`排序` | 困难 | 第 206 场周赛 | -| 1586 | [二叉搜索树迭代器 II](/solution/1500-1599/1586.Binary%20Search%20Tree%20Iterator%20II/README.md) | `栈`,`树`,`设计`,`二叉搜索树`,`二叉树`,`迭代器` | 中等 | 🔒 | -| 1587 | [银行账户概要 II](/solution/1500-1599/1587.Bank%20Account%20Summary%20II/README.md) | `数据库` | 简单 | | -| 1588 | [所有奇数长度子数组的和](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README.md) | `数组`,`数学`,`前缀和` | 简单 | 第 35 场双周赛 | -| 1589 | [所有排列中的最大和](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README.md) | `贪心`,`数组`,`前缀和`,`排序` | 中等 | 第 35 场双周赛 | -| 1590 | [使数组和能被 P 整除](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 35 场双周赛 | -| 1591 | [奇怪的打印机 II](/solution/1500-1599/1591.Strange%20Printer%20II/README.md) | `图`,`拓扑排序`,`数组`,`矩阵` | 困难 | 第 35 场双周赛 | -| 1592 | [重新排列单词间的空格](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README.md) | `字符串` | 简单 | 第 207 场周赛 | -| 1593 | [拆分字符串使唯一子字符串的数目最大](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README.md) | `哈希表`,`字符串`,`回溯` | 中等 | 第 207 场周赛 | -| 1594 | [矩阵的最大非负积](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 207 场周赛 | -| 1595 | [连通两组点的最小成本](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩`,`矩阵` | 困难 | 第 207 场周赛 | -| 1596 | [每位顾客最经常订购的商品](/solution/1500-1599/1596.The%20Most%20Frequently%20Ordered%20Products%20for%20Each%20Customer/README.md) | `数据库` | 中等 | 🔒 | -| 1597 | [根据中缀表达式构造二叉表达式树](/solution/1500-1599/1597.Build%20Binary%20Expression%20Tree%20From%20Infix%20Expression/README.md) | `栈`,`树`,`字符串`,`二叉树` | 困难 | 🔒 | -| 1598 | [文件夹操作日志搜集器](/solution/1500-1599/1598.Crawler%20Log%20Folder/README.md) | `栈`,`数组`,`字符串` | 简单 | 第 208 场周赛 | -| 1599 | [经营摩天轮的最大利润](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README.md) | `数组`,`模拟` | 中等 | 第 208 场周赛 | -| 1600 | [王位继承顺序](/solution/1600-1699/1600.Throne%20Inheritance/README.md) | `树`,`深度优先搜索`,`设计`,`哈希表` | 中等 | 第 208 场周赛 | -| 1601 | [最多可达成的换楼请求数目](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README.md) | `位运算`,`数组`,`回溯`,`枚举` | 困难 | 第 208 场周赛 | -| 1602 | [找到二叉树中最近的右侧节点](/solution/1600-1699/1602.Find%20Nearest%20Right%20Node%20in%20Binary%20Tree/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | -| 1603 | [设计停车系统](/solution/1600-1699/1603.Design%20Parking%20System/README.md) | `设计`,`计数`,`模拟` | 简单 | 第 36 场双周赛 | -| 1604 | [警告一小时内使用相同员工卡大于等于三次的人](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 36 场双周赛 | -| 1605 | [给定行和列的和求可行矩阵](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README.md) | `贪心`,`数组`,`矩阵` | 中等 | 第 36 场双周赛 | -| 1606 | [找到处理最多请求的服务器](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README.md) | `贪心`,`数组`,`有序集合`,`堆（优先队列）` | 困难 | 第 36 场双周赛 | -| 1607 | [没有卖出的卖家](/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README.md) | `数据库` | 简单 | 🔒 | -| 1608 | [特殊数组的特征值](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README.md) | `数组`,`二分查找`,`排序` | 简单 | 第 209 场周赛 | -| 1609 | [奇偶树](/solution/1600-1699/1609.Even%20Odd%20Tree/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | 第 209 场周赛 | -| 1610 | [可见点的最大数目](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README.md) | `几何`,`数组`,`数学`,`排序`,`滑动窗口` | 困难 | 第 209 场周赛 | -| 1611 | [使整数变为 0 的最少操作次数](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README.md) | `位运算`,`记忆化搜索`,`动态规划` | 困难 | 第 209 场周赛 | -| 1612 | [检查两棵二叉表达式树是否等价](/solution/1600-1699/1612.Check%20If%20Two%20Expression%20Trees%20are%20Equivalent/README.md) | `树`,`深度优先搜索`,`哈希表`,`二叉树`,`计数` | 中等 | 🔒 | -| 1613 | [找到遗失的 ID](/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README.md) | `数据库` | 中等 | 🔒 | -| 1614 | [括号的最大嵌套深度](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README.md) | `栈`,`字符串` | 简单 | 第 210 场周赛 | -| 1615 | [最大网络秩](/solution/1600-1699/1615.Maximal%20Network%20Rank/README.md) | `图` | 中等 | 第 210 场周赛 | -| 1616 | [分割两个字符串得到回文串](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README.md) | `双指针`,`字符串` | 中等 | 第 210 场周赛 | -| 1617 | [统计子树中城市之间最大距离](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README.md) | `位运算`,`树`,`动态规划`,`状态压缩`,`枚举` | 困难 | 第 210 场周赛 | -| 1618 | [找出适应屏幕的最大字号](/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README.md) | `数组`,`字符串`,`二分查找`,`交互` | 中等 | 🔒 | -| 1619 | [删除某些元素后的数组均值](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README.md) | `数组`,`排序` | 简单 | 第 37 场双周赛 | -| 1620 | [网络信号最好的坐标](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README.md) | `数组`,`枚举` | 中等 | 第 37 场双周赛 | -| 1621 | [大小为 K 的不重叠线段的数目](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README.md) | `数学`,`动态规划`,`组合数学` | 中等 | 第 37 场双周赛 | -| 1622 | [奇妙序列](/solution/1600-1699/1622.Fancy%20Sequence/README.md) | `设计`,`线段树`,`数学` | 困难 | 第 37 场双周赛 | -| 1623 | [三人国家代表队](/solution/1600-1699/1623.All%20Valid%20Triplets%20That%20Can%20Represent%20a%20Country/README.md) | `数据库` | 简单 | 🔒 | -| 1624 | [两个相同字符之间的最长子字符串](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README.md) | `哈希表`,`字符串` | 简单 | 第 211 场周赛 | -| 1625 | [执行操作后字典序最小的字符串](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README.md) | `深度优先搜索`,`广度优先搜索`,`字符串`,`枚举` | 中等 | 第 211 场周赛 | -| 1626 | [无矛盾的最佳球队](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md) | `数组`,`动态规划`,`排序` | 中等 | 第 211 场周赛 | -| 1627 | [带阈值的图连通性](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README.md) | `并查集`,`数组`,`数学`,`数论` | 困难 | 第 211 场周赛 | -| 1628 | [设计带解析函数的表达式树](/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README.md) | `栈`,`树`,`设计`,`数组`,`数学`,`二叉树` | 中等 | 🔒 | -| 1629 | [按键持续时间最长的键](/solution/1600-1699/1629.Slowest%20Key/README.md) | `数组`,`字符串` | 简单 | 第 212 场周赛 | -| 1630 | [等差子数组](/solution/1600-1699/1630.Arithmetic%20Subarrays/README.md) | `数组`,`哈希表`,`排序` | 中等 | 第 212 场周赛 | -| 1631 | [最小体力消耗路径](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`二分查找`,`矩阵`,`堆（优先队列）` | 中等 | 第 212 场周赛 | -| 1632 | [矩阵转换后的秩](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README.md) | `并查集`,`图`,`拓扑排序`,`数组`,`矩阵`,`排序` | 困难 | 第 212 场周赛 | -| 1633 | [各赛事的用户注册率](/solution/1600-1699/1633.Percentage%20of%20Users%20Attended%20a%20Contest/README.md) | `数据库` | 简单 | | -| 1634 | [求两个多项式链表的和](/solution/1600-1699/1634.Add%20Two%20Polynomials%20Represented%20as%20Linked%20Lists/README.md) | `链表`,`数学`,`双指针` | 中等 | 🔒 | -| 1635 | [Hopper 公司查询 I](/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README.md) | `数据库` | 困难 | 🔒 | -| 1636 | [按照频率将数组升序排序](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 38 场双周赛 | -| 1637 | [两点之间不包含任何点的最宽垂直区域](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README.md) | `数组`,`排序` | 简单 | 第 38 场双周赛 | -| 1638 | [统计只差一个字符的子串数目](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README.md) | `哈希表`,`字符串`,`动态规划`,`枚举` | 中等 | 第 38 场双周赛 | -| 1639 | [通过给定词典构造目标字符串的方案数](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README.md) | `数组`,`字符串`,`动态规划` | 困难 | 第 38 场双周赛 | -| 1640 | [能否连接形成数组](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README.md) | `数组`,`哈希表` | 简单 | 第 213 场周赛 | -| 1641 | [统计字典序元音字符串的数目](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README.md) | `数学`,`动态规划`,`组合数学` | 中等 | 第 213 场周赛 | -| 1642 | [可以到达的最远建筑](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 213 场周赛 | -| 1643 | [第 K 条最小指令](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README.md) | `数组`,`数学`,`动态规划`,`组合数学` | 困难 | 第 213 场周赛 | -| 1644 | [二叉树的最近公共祖先 II](/solution/1600-1699/1644.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20II/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | -| 1645 | [Hopper 公司查询 II](/solution/1600-1699/1645.Hopper%20Company%20Queries%20II/README.md) | `数据库` | 困难 | 🔒 | -| 1646 | [获取生成数组中的最大值](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README.md) | `数组`,`模拟` | 简单 | 第 214 场周赛 | -| 1647 | [字符频次唯一的最小删除次数](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README.md) | `贪心`,`哈希表`,`字符串`,`排序` | 中等 | 第 214 场周赛 | -| 1648 | [销售价值减少的颜色球](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README.md) | `贪心`,`数组`,`数学`,`二分查找`,`排序`,`堆（优先队列）` | 中等 | 第 214 场周赛 | -| 1649 | [通过指令创建有序数组](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | 第 214 场周赛 | -| 1650 | [二叉树的最近公共祖先 III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README.md) | `树`,`哈希表`,`双指针`,`二叉树` | 中等 | 🔒 | -| 1651 | [Hopper 公司查询 III](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README.md) | `数据库` | 困难 | 🔒 | -| 1652 | [拆炸弹](/solution/1600-1699/1652.Defuse%20the%20Bomb/README.md) | `数组`,`滑动窗口` | 简单 | 第 39 场双周赛 | -| 1653 | [使字符串平衡的最少删除次数](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README.md) | `栈`,`字符串`,`动态规划` | 中等 | 第 39 场双周赛 | -| 1654 | [到家的最少跳跃次数](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README.md) | `广度优先搜索`,`数组`,`动态规划` | 中等 | 第 39 场双周赛 | -| 1655 | [分配重复整数](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 困难 | 第 39 场双周赛 | -| 1656 | [设计有序流](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README.md) | `设计`,`数组`,`哈希表`,`数据流` | 简单 | 第 215 场周赛 | -| 1657 | [确定两个字符串是否接近](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README.md) | `哈希表`,`字符串`,`计数`,`排序` | 中等 | 第 215 场周赛 | -| 1658 | [将 x 减到 0 的最小操作数](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README.md) | `数组`,`哈希表`,`二分查找`,`前缀和`,`滑动窗口` | 中等 | 第 215 场周赛 | -| 1659 | [最大化网格幸福感](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README.md) | `位运算`,`记忆化搜索`,`动态规划`,`状态压缩` | 困难 | 第 215 场周赛 | -| 1660 | [纠正二叉树](/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 | -| 1661 | [每台机器的进程平均运行时间](/solution/1600-1699/1661.Average%20Time%20of%20Process%20per%20Machine/README.md) | `数据库` | 简单 | | -| 1662 | [检查两个字符串数组是否相等](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README.md) | `数组`,`字符串` | 简单 | 第 216 场周赛 | -| 1663 | [具有给定数值的最小字符串](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README.md) | `贪心`,`字符串` | 中等 | 第 216 场周赛 | -| 1664 | [生成平衡数组的方案数](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README.md) | `数组`,`前缀和` | 中等 | 第 216 场周赛 | -| 1665 | [完成所有任务的最少初始能量](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README.md) | `贪心`,`数组`,`排序` | 困难 | 第 216 场周赛 | -| 1666 | [改变二叉树的根节点](/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | -| 1667 | [修复表中的名字](/solution/1600-1699/1667.Fix%20Names%20in%20a%20Table/README.md) | `数据库` | 简单 | | -| 1668 | [最大重复子字符串](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README.md) | `字符串`,`动态规划`,`字符串匹配` | 简单 | 第 40 场双周赛 | -| 1669 | [合并两个链表](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README.md) | `链表` | 中等 | 第 40 场双周赛 | -| 1670 | [设计前中后队列](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README.md) | `设计`,`队列`,`数组`,`链表`,`数据流` | 中等 | 第 40 场双周赛 | -| 1671 | [得到山形数组的最少删除次数](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README.md) | `贪心`,`数组`,`二分查找`,`动态规划` | 困难 | 第 40 场双周赛 | -| 1672 | [最富有客户的资产总量](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README.md) | `数组`,`矩阵` | 简单 | 第 217 场周赛 | -| 1673 | [找出最具竞争力的子序列](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README.md) | `栈`,`贪心`,`数组`,`单调栈` | 中等 | 第 217 场周赛 | -| 1674 | [使数组互补的最少操作次数](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 217 场周赛 | -| 1675 | [数组的最小偏移量](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README.md) | `贪心`,`数组`,`有序集合`,`堆（优先队列）` | 困难 | 第 217 场周赛 | -| 1676 | [二叉树的最近公共祖先 IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README.md) | `树`,`深度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 | -| 1677 | [发票中的产品金额](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README.md) | `数据库` | 简单 | 🔒 | -| 1678 | [设计 Goal 解析器](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md) | `字符串` | 简单 | 第 218 场周赛 | -| 1679 | [K 和数对的最大数目](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md) | `数组`,`哈希表`,`双指针`,`排序` | 中等 | 第 218 场周赛 | -| 1680 | [连接连续二进制数字](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README.md) | `位运算`,`数学`,`模拟` | 中等 | 第 218 场周赛 | -| 1681 | [最小不兼容性](/solution/1600-1699/1681.Minimum%20Incompatibility/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 218 场周赛 | -| 1682 | [最长回文子序列 II](/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README.md) | `字符串`,`动态规划` | 中等 | 🔒 | -| 1683 | [无效的推文](/solution/1600-1699/1683.Invalid%20Tweets/README.md) | `数据库` | 简单 | | -| 1684 | [统计一致字符串的数目](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README.md) | `位运算`,`数组`,`哈希表`,`字符串` | 简单 | 第 41 场双周赛 | -| 1685 | [有序数组中差绝对值之和](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README.md) | `数组`,`数学`,`前缀和` | 中等 | 第 41 场双周赛 | -| 1686 | [石子游戏 VI](/solution/1600-1699/1686.Stone%20Game%20VI/README.md) | `贪心`,`数组`,`数学`,`博弈`,`排序`,`堆（优先队列）` | 中等 | 第 41 场双周赛 | -| 1687 | [从仓库到码头运输箱子](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README.md) | `线段树`,`队列`,`数组`,`动态规划`,`前缀和`,`单调队列`,`堆（优先队列）` | 困难 | 第 41 场双周赛 | -| 1688 | [比赛中的配对次数](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README.md) | `数学`,`模拟` | 简单 | 第 219 场周赛 | -| 1689 | [十-二进制数的最少数目](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README.md) | `贪心`,`字符串` | 中等 | 第 219 场周赛 | -| 1690 | [石子游戏 VII](/solution/1600-1699/1690.Stone%20Game%20VII/README.md) | `数组`,`数学`,`动态规划`,`博弈` | 中等 | 第 219 场周赛 | -| 1691 | [堆叠长方体的最大高度](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 219 场周赛 | -| 1692 | [计算分配糖果的不同方式](/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README.md) | `动态规划` | 困难 | 🔒 | -| 1693 | [每天的领导和合伙人](/solution/1600-1699/1693.Daily%20Leads%20and%20Partners/README.md) | `数据库` | 简单 | | -| 1694 | [重新格式化电话号码](/solution/1600-1699/1694.Reformat%20Phone%20Number/README.md) | `字符串` | 简单 | 第 220 场周赛 | -| 1695 | [删除子数组的最大得分](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 220 场周赛 | -| 1696 | [跳跃游戏 VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md) | `队列`,`数组`,`动态规划`,`单调队列`,`堆（优先队列）` | 中等 | 第 220 场周赛 | -| 1697 | [检查边长度限制的路径是否存在](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md) | `并查集`,`图`,`数组`,`双指针`,`排序` | 困难 | 第 220 场周赛 | -| 1698 | [字符串的不同子字符串个数](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md) | `字典树`,`字符串`,`后缀数组`,`哈希函数`,`滚动哈希` | 中等 | 🔒 | -| 1699 | [两人之间的通话次数](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md) | `数据库` | 中等 | 🔒 | -| 1700 | [无法吃午餐的学生数量](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md) | `栈`,`队列`,`数组`,`模拟` | 简单 | 第 42 场双周赛 | -| 1701 | [平均等待时间](/solution/1700-1799/1701.Average%20Waiting%20Time/README.md) | `数组`,`模拟` | 中等 | 第 42 场双周赛 | -| 1702 | [修改后的最大二进制字符串](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README.md) | `贪心`,`字符串` | 中等 | 第 42 场双周赛 | -| 1703 | [得到连续 K 个 1 的最少相邻交换次数](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README.md) | `贪心`,`数组`,`前缀和`,`滑动窗口` | 困难 | 第 42 场双周赛 | -| 1704 | [判断字符串的两半是否相似](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README.md) | `字符串`,`计数` | 简单 | 第 221 场周赛 | -| 1705 | [吃苹果的最大数目](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 221 场周赛 | -| 1706 | [球会落何处](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 221 场周赛 | -| 1707 | [与数组中元素的最大异或值](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README.md) | `位运算`,`字典树`,`数组` | 困难 | 第 221 场周赛 | -| 1708 | [长度为 K 的最大子数组](/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README.md) | `贪心`,`数组` | 简单 | 🔒 | -| 1709 | [访问日期之间最大的空档期](/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README.md) | `数据库` | 中等 | 🔒 | -| 1710 | [卡车上的最大单元数](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 222 场周赛 | -| 1711 | [大餐计数](/solution/1700-1799/1711.Count%20Good%20Meals/README.md) | `数组`,`哈希表` | 中等 | 第 222 场周赛 | -| 1712 | [将数组分成三个子数组的方案数](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README.md) | `数组`,`双指针`,`二分查找`,`前缀和` | 中等 | 第 222 场周赛 | -| 1713 | [得到子序列的最少操作次数](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README.md) | `贪心`,`数组`,`哈希表`,`二分查找` | 困难 | 第 222 场周赛 | -| 1714 | [数组中特殊等间距元素的和](/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README.md) | `数组`,`动态规划` | 困难 | 🔒 | -| 1715 | [苹果和橘子的个数](/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README.md) | `数据库` | 中等 | 🔒 | -| 1716 | [计算力扣银行的钱](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README.md) | `数学` | 简单 | 第 43 场双周赛 | -| 1717 | [删除子字符串的最大得分](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README.md) | `栈`,`贪心`,`字符串` | 中等 | 第 43 场双周赛 | -| 1718 | [构建字典序最大的可行序列](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README.md) | `数组`,`回溯` | 中等 | 第 43 场双周赛 | -| 1719 | [重构一棵树的方案数](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README.md) | `树`,`图` | 困难 | 第 43 场双周赛 | -| 1720 | [解码异或后的数组](/solution/1700-1799/1720.Decode%20XORed%20Array/README.md) | `位运算`,`数组` | 简单 | 第 223 场周赛 | -| 1721 | [交换链表中的节点](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README.md) | `链表`,`双指针` | 中等 | 第 223 场周赛 | -| 1722 | [执行交换操作后的最小汉明距离](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README.md) | `深度优先搜索`,`并查集`,`数组` | 中等 | 第 223 场周赛 | -| 1723 | [完成所有工作的最短时间](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 困难 | 第 223 场周赛 | -| 1724 | [检查边长度限制的路径是否存在 II](/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README.md) | `并查集`,`图`,`最小生成树` | 困难 | 🔒 | -| 1725 | [可以形成最大正方形的矩形数目](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README.md) | `数组` | 简单 | 第 224 场周赛 | -| 1726 | [同积元组](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 224 场周赛 | -| 1727 | [重新排列后的最大子矩阵](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README.md) | `贪心`,`数组`,`矩阵`,`排序` | 中等 | 第 224 场周赛 | -| 1728 | [猫和老鼠 II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README.md) | `图`,`拓扑排序`,`记忆化搜索`,`数组`,`数学`,`动态规划`,`博弈`,`矩阵` | 困难 | 第 224 场周赛 | -| 1729 | [求关注者的数量](/solution/1700-1799/1729.Find%20Followers%20Count/README.md) | `数据库` | 简单 | | -| 1730 | [获取食物的最短路径](/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 🔒 | -| 1731 | [每位经理的下属员工数量](/solution/1700-1799/1731.The%20Number%20of%20Employees%20Which%20Report%20to%20Each%20Employee/README.md) | `数据库` | 简单 | | -| 1732 | [找到最高海拔](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md) | `数组`,`前缀和` | 简单 | 第 44 场双周赛 | -| 1733 | [需要教语言的最少人数](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md) | `贪心`,`数组`,`哈希表` | 中等 | 第 44 场双周赛 | -| 1734 | [解码异或后的排列](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md) | `位运算`,`数组` | 中等 | 第 44 场双周赛 | -| 1735 | [生成乘积数组的方案数](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md) | `数组`,`数学`,`动态规划`,`组合数学`,`数论` | 困难 | 第 44 场双周赛 | -| 1736 | [替换隐藏数字得到的最晚时间](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md) | `贪心`,`字符串` | 简单 | 第 225 场周赛 | -| 1737 | [满足三条件之一需改变的最少字符数](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md) | `哈希表`,`字符串`,`计数`,`前缀和` | 中等 | 第 225 场周赛 | -| 1738 | [找出第 K 大的异或坐标值](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md) | `位运算`,`数组`,`分治`,`矩阵`,`前缀和`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | 第 225 场周赛 | -| 1739 | [放置盒子](/solution/1700-1799/1739.Building%20Boxes/README.md) | `贪心`,`数学`,`二分查找` | 困难 | 第 225 场周赛 | -| 1740 | [找到二叉树中的距离](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 | -| 1741 | [查找每个员工花费的总时间](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README.md) | `数据库` | 简单 | | -| 1742 | [盒子中小球的最大数量](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md) | `哈希表`,`数学`,`计数` | 简单 | 第 226 场周赛 | -| 1743 | [从相邻元素对还原数组](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md) | `数组`,`哈希表` | 中等 | 第 226 场周赛 | -| 1744 | [你能在你最喜欢的那天吃到你最喜欢的糖果吗？](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md) | `数组`,`前缀和` | 中等 | 第 226 场周赛 | -| 1745 | [分割回文串 IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md) | `字符串`,`动态规划` | 困难 | 第 226 场周赛 | -| 1746 | [经过一次操作后的最大子数组和](/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README.md) | `数组`,`动态规划` | 中等 | 🔒 | -| 1747 | [应该被禁止的 Leetflex 账户](/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README.md) | `数据库` | 中等 | 🔒 | -| 1748 | [唯一元素的和](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 45 场双周赛 | -| 1749 | [任意子数组和的绝对值的最大值](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md) | `数组`,`动态规划` | 中等 | 第 45 场双周赛 | -| 1750 | [删除字符串两端相同字符后的最短长度](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md) | `双指针`,`字符串` | 中等 | 第 45 场双周赛 | -| 1751 | [最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md) | `数组`,`二分查找`,`动态规划`,`排序` | 困难 | 第 45 场双周赛 | -| 1752 | [检查数组是否经排序和轮转得到](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md) | `数组` | 简单 | 第 227 场周赛 | -| 1753 | [移除石子的最大得分](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md) | `贪心`,`数学`,`堆（优先队列）` | 中等 | 第 227 场周赛 | -| 1754 | [构造字典序最大的合并字符串](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md) | `贪心`,`双指针`,`字符串` | 中等 | 第 227 场周赛 | -| 1755 | [最接近目标值的子序列和](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md) | `位运算`,`数组`,`双指针`,`动态规划`,`状态压缩` | 困难 | 第 227 场周赛 | -| 1756 | [设计最近使用（MRU）队列](/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README.md) | `栈`,`设计`,`树状数组`,`数组`,`哈希表`,`有序集合` | 中等 | 🔒 | -| 1757 | [可回收且低脂的产品](/solution/1700-1799/1757.Recyclable%20and%20Low%20Fat%20Products/README.md) | `数据库` | 简单 | | -| 1758 | [生成交替二进制字符串的最少操作数](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README.md) | `字符串` | 简单 | 第 228 场周赛 | -| 1759 | [统计同质子字符串的数目](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README.md) | `数学`,`字符串` | 中等 | 第 228 场周赛 | -| 1760 | [袋子里最少数目的球](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README.md) | `数组`,`二分查找` | 中等 | 第 228 场周赛 | -| 1761 | [一个图中连通三元组的最小度数](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README.md) | `图` | 困难 | 第 228 场周赛 | -| 1762 | [能看到海景的建筑物](/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README.md) | `栈`,`数组`,`单调栈` | 中等 | 🔒 | -| 1763 | [最长的美好子字符串](/solution/1700-1799/1763.Longest%20Nice%20Substring/README.md) | `位运算`,`哈希表`,`字符串`,`分治`,`滑动窗口` | 简单 | 第 46 场双周赛 | -| 1764 | [通过连接另一个数组的子数组得到一个数组](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README.md) | `贪心`,`数组`,`双指针`,`字符串匹配` | 中等 | 第 46 场双周赛 | -| 1765 | [地图中的最高点](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 第 46 场双周赛 | -| 1766 | [互质树](/solution/1700-1799/1766.Tree%20of%20Coprimes/README.md) | `树`,`深度优先搜索`,`数组`,`数学`,`数论` | 困难 | 第 46 场双周赛 | -| 1767 | [寻找没有被执行的任务对](/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README.md) | `数据库` | 困难 | 🔒 | -| 1768 | [交替合并字符串](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README.md) | `双指针`,`字符串` | 简单 | 第 229 场周赛 | -| 1769 | [移动所有球到每个盒子所需的最小操作数](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README.md) | `数组`,`字符串` | 中等 | 第 229 场周赛 | -| 1770 | [执行乘法运算的最大分数](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README.md) | `数组`,`动态规划` | 困难 | 第 229 场周赛 | -| 1771 | [由子序列构造的最长回文串的长度](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README.md) | `字符串`,`动态规划` | 困难 | 第 229 场周赛 | -| 1772 | [按受欢迎程度排列功能](/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 🔒 | -| 1773 | [统计匹配检索规则的物品数量](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README.md) | `数组`,`字符串` | 简单 | 第 230 场周赛 | -| 1774 | [最接近目标价格的甜点成本](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md) | `数组`,`动态规划`,`回溯` | 中等 | 第 230 场周赛 | -| 1775 | [通过最少操作次数使数组的和相等](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README.md) | `贪心`,`数组`,`哈希表`,`计数` | 中等 | 第 230 场周赛 | -| 1776 | [车队 II](/solution/1700-1799/1776.Car%20Fleet%20II/README.md) | `栈`,`数组`,`数学`,`单调栈`,`堆（优先队列）` | 困难 | 第 230 场周赛 | -| 1777 | [每家商店的产品价格](/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README.md) | `数据库` | 简单 | 🔒 | -| 1778 | [未知网格中的最短路径](/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`交互` | 中等 | 🔒 | -| 1779 | [找到最近的有相同 X 或 Y 坐标的点](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README.md) | `数组` | 简单 | 第 47 场双周赛 | -| 1780 | [判断一个数字是否可以表示成三的幂的和](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README.md) | `数学` | 中等 | 第 47 场双周赛 | -| 1781 | [所有子字符串美丽值之和](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 47 场双周赛 | -| 1782 | [统计点对的数目](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README.md) | `图`,`数组`,`双指针`,`二分查找`,`排序` | 困难 | 第 47 场双周赛 | -| 1783 | [大满贯数量](/solution/1700-1799/1783.Grand%20Slam%20Titles/README.md) | `数据库` | 中等 | 🔒 | -| 1784 | [检查二进制字符串字段](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README.md) | `字符串` | 简单 | 第 231 场周赛 | -| 1785 | [构成特定和需要添加的最少元素](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README.md) | `贪心`,`数组` | 中等 | 第 231 场周赛 | -| 1786 | [从第一个节点出发到最后一个节点的受限路径数](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README.md) | `图`,`拓扑排序`,`动态规划`,`最短路`,`堆（优先队列）` | 中等 | 第 231 场周赛 | -| 1787 | [使所有区间的异或结果为零](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README.md) | `位运算`,`数组`,`动态规划` | 困难 | 第 231 场周赛 | -| 1788 | [最大化花园的美观度](/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README.md) | `贪心`,`数组`,`前缀和` | 困难 | 🔒 | -| 1789 | [员工的直属部门](/solution/1700-1799/1789.Primary%20Department%20for%20Each%20Employee/README.md) | `数据库` | 简单 | | -| 1790 | [仅执行一次字符串交换能否使两个字符串相等](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 232 场周赛 | -| 1791 | [找出星型图的中心节点](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README.md) | `图` | 简单 | 第 232 场周赛 | -| 1792 | [最大平均通过率](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 232 场周赛 | -| 1793 | [好子数组的最大分数](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README.md) | `栈`,`数组`,`双指针`,`二分查找`,`单调栈` | 困难 | 第 232 场周赛 | -| 1794 | [统计距离最小的子串对个数](/solution/1700-1799/1794.Count%20Pairs%20of%20Equal%20Substrings%20With%20Minimum%20Difference/README.md) | `贪心`,`哈希表`,`字符串` | 中等 | 🔒 | -| 1795 | [每个产品在不同商店的价格](/solution/1700-1799/1795.Rearrange%20Products%20Table/README.md) | `数据库` | 简单 | | -| 1796 | [字符串中第二大的数字](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README.md) | `哈希表`,`字符串` | 简单 | 第 48 场双周赛 | -| 1797 | [设计一个验证系统](/solution/1700-1799/1797.Design%20Authentication%20Manager/README.md) | `设计`,`哈希表` | 中等 | 第 48 场双周赛 | -| 1798 | [你能构造出连续值的最大数目](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 48 场双周赛 | -| 1799 | [N 次操作后的最大分数和](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README.md) | `位运算`,`数组`,`数学`,`动态规划`,`回溯`,`状态压缩`,`数论` | 困难 | 第 48 场双周赛 | -| 1800 | [最大升序子数组和](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README.md) | `数组` | 简单 | 第 233 场周赛 | -| 1801 | [积压订单中的订单总数](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README.md) | `数组`,`模拟`,`堆（优先队列）` | 中等 | 第 233 场周赛 | -| 1802 | [有界数组中指定下标处的最大值](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README.md) | `贪心`,`二分查找` | 中等 | 第 233 场周赛 | -| 1803 | [统计异或值在范围内的数对有多少](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README.md) | `位运算`,`字典树`,`数组` | 困难 | 第 233 场周赛 | -| 1804 | [实现 Trie （前缀树） II](/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | 🔒 | -| 1805 | [字符串中不同整数的数目](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README.md) | `哈希表`,`字符串` | 简单 | 第 234 场周赛 | -| 1806 | [还原排列的最少操作步数](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README.md) | `数组`,`数学`,`模拟` | 中等 | 第 234 场周赛 | -| 1807 | [替换字符串中的括号内容](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 234 场周赛 | -| 1808 | [好因子的最大数目](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README.md) | `递归`,`数学` | 困难 | 第 234 场周赛 | -| 1809 | [没有广告的剧集](/solution/1800-1899/1809.Ad-Free%20Sessions/README.md) | `数据库` | 简单 | 🔒 | -| 1810 | [隐藏网格下的最小消耗路径](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`交互`,`堆（优先队列）` | 中等 | 🔒 | -| 1811 | [寻找面试候选人](/solution/1800-1899/1811.Find%20Interview%20Candidates/README.md) | `数据库` | 中等 | 🔒 | -| 1812 | [判断国际象棋棋盘中一个格子的颜色](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README.md) | `数学`,`字符串` | 简单 | 第 49 场双周赛 | -| 1813 | [句子相似性 III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README.md) | `数组`,`双指针`,`字符串` | 中等 | 第 49 场双周赛 | -| 1814 | [统计一个数组中好对子的数目](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README.md) | `数组`,`哈希表`,`数学`,`计数` | 中等 | 第 49 场双周赛 | -| 1815 | [得到新鲜甜甜圈的最多组数](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README.md) | `位运算`,`记忆化搜索`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 49 场双周赛 | -| 1816 | [截断句子](/solution/1800-1899/1816.Truncate%20Sentence/README.md) | `数组`,`字符串` | 简单 | 第 235 场周赛 | -| 1817 | [查找用户活跃分钟数](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README.md) | `数组`,`哈希表` | 中等 | 第 235 场周赛 | -| 1818 | [绝对差值和](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README.md) | `数组`,`二分查找`,`有序集合`,`排序` | 中等 | 第 235 场周赛 | -| 1819 | [序列中不同最大公约数的数目](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README.md) | `数组`,`数学`,`计数`,`数论` | 困难 | 第 235 场周赛 | -| 1820 | [最多邀请的个数](/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README.md) | `数组`,`回溯`,`矩阵` | 中等 | 🔒 | -| 1821 | [寻找今年具有正收入的客户](/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README.md) | `数据库` | 简单 | 🔒 | -| 1822 | [数组元素积的符号](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README.md) | `数组`,`数学` | 简单 | 第 236 场周赛 | -| 1823 | [找出游戏的获胜者](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README.md) | `递归`,`队列`,`数组`,`数学`,`模拟` | 中等 | 第 236 场周赛 | -| 1824 | [最少侧跳次数](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README.md) | `贪心`,`数组`,`动态规划` | 中等 | 第 236 场周赛 | -| 1825 | [求出 MK 平均值](/solution/1800-1899/1825.Finding%20MK%20Average/README.md) | `设计`,`队列`,`数据流`,`有序集合`,`堆（优先队列）` | 困难 | 第 236 场周赛 | -| 1826 | [有缺陷的传感器](/solution/1800-1899/1826.Faulty%20Sensor/README.md) | `数组`,`双指针` | 简单 | 🔒 | -| 1827 | [最少操作使数组递增](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README.md) | `贪心`,`数组` | 简单 | 第 50 场双周赛 | -| 1828 | [统计一个圆中点的数目](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README.md) | `几何`,`数组`,`数学` | 中等 | 第 50 场双周赛 | -| 1829 | [每个查询的最大异或值](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README.md) | `位运算`,`数组`,`前缀和` | 中等 | 第 50 场双周赛 | -| 1830 | [使字符串有序的最少操作次数](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README.md) | `数学`,`字符串`,`组合数学` | 困难 | 第 50 场双周赛 | -| 1831 | [每天的最大交易](/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README.md) | `数据库` | 中等 | 🔒 | -| 1832 | [判断句子是否为全字母句](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README.md) | `哈希表`,`字符串` | 简单 | 第 237 场周赛 | -| 1833 | [雪糕的最大数量](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 237 场周赛 | -| 1834 | [单线程 CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README.md) | `数组`,`排序`,`堆（优先队列）` | 中等 | 第 237 场周赛 | -| 1835 | [所有数对按位与结果的异或和](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README.md) | `位运算`,`数组`,`数学` | 困难 | 第 237 场周赛 | -| 1836 | [从未排序的链表中移除重复元素](/solution/1800-1899/1836.Remove%20Duplicates%20From%20an%20Unsorted%20Linked%20List/README.md) | `哈希表`,`链表` | 中等 | 🔒 | -| 1837 | [K 进制表示下的各位数字总和](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README.md) | `数学` | 简单 | 第 238 场周赛 | -| 1838 | [最高频元素的频数](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README.md) | `贪心`,`数组`,`二分查找`,`前缀和`,`排序`,`滑动窗口` | 中等 | 第 238 场周赛 | -| 1839 | [所有元音按顺序排布的最长子字符串](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README.md) | `字符串`,`滑动窗口` | 中等 | 第 238 场周赛 | -| 1840 | [最高建筑高度](/solution/1800-1899/1840.Maximum%20Building%20Height/README.md) | `数组`,`数学`,`排序` | 困难 | 第 238 场周赛 | -| 1841 | [联赛信息统计](/solution/1800-1899/1841.League%20Statistics/README.md) | `数据库` | 中等 | 🔒 | -| 1842 | [下个由相同数字构成的回文串](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README.md) | `双指针`,`字符串` | 困难 | 🔒 | -| 1843 | [可疑银行账户](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README.md) | `数据库` | 中等 | 🔒 | -| 1844 | [将所有数字用字符替换](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README.md) | `字符串` | 简单 | 第 51 场双周赛 | -| 1845 | [座位预约管理系统](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README.md) | `设计`,`堆（优先队列）` | 中等 | 第 51 场双周赛 | -| 1846 | [减小和重新排列数组后的最大元素](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 51 场双周赛 | -| 1847 | [最近的房间](/solution/1800-1899/1847.Closest%20Room/README.md) | `数组`,`二分查找`,`排序` | 困难 | 第 51 场双周赛 | -| 1848 | [到目标元素的最小距离](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README.md) | `数组` | 简单 | 第 239 场周赛 | -| 1849 | [将字符串拆分为递减的连续值](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README.md) | `字符串`,`回溯` | 中等 | 第 239 场周赛 | -| 1850 | [邻位交换的最小次数](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README.md) | `贪心`,`双指针`,`字符串` | 中等 | 第 239 场周赛 | -| 1851 | [包含每个查询的最小区间](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README.md) | `数组`,`二分查找`,`排序`,`扫描线`,`堆（优先队列）` | 困难 | 第 239 场周赛 | -| 1852 | [每个子数组的数字种类数](/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 🔒 | -| 1853 | [转换日期格式](/solution/1800-1899/1853.Convert%20Date%20Format/README.md) | `数据库` | 简单 | 🔒 | -| 1854 | [人口最多的年份](/solution/1800-1899/1854.Maximum%20Population%20Year/README.md) | `数组`,`计数`,`前缀和` | 简单 | 第 240 场周赛 | -| 1855 | [下标对中的最大距离](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README.md) | `数组`,`双指针`,`二分查找` | 中等 | 第 240 场周赛 | -| 1856 | [子数组最小乘积的最大值](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README.md) | `栈`,`数组`,`前缀和`,`单调栈` | 中等 | 第 240 场周赛 | -| 1857 | [有向图中最大颜色值](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README.md) | `图`,`拓扑排序`,`记忆化搜索`,`哈希表`,`动态规划`,`计数` | 困难 | 第 240 场周赛 | -| 1858 | [包含所有前缀的最长单词](/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README.md) | `深度优先搜索`,`字典树` | 中等 | 🔒 | -| 1859 | [将句子排序](/solution/1800-1899/1859.Sorting%20the%20Sentence/README.md) | `字符串`,`排序` | 简单 | 第 52 场双周赛 | -| 1860 | [增长的内存泄露](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README.md) | `数学`,`模拟` | 中等 | 第 52 场双周赛 | -| 1861 | [旋转盒子](/solution/1800-1899/1861.Rotating%20the%20Box/README.md) | `数组`,`双指针`,`矩阵` | 中等 | 第 52 场双周赛 | -| 1862 | [向下取整数对和](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README.md) | `数组`,`数学`,`二分查找`,`前缀和` | 困难 | 第 52 场双周赛 | -| 1863 | [找出所有子集的异或总和再求和](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README.md) | `位运算`,`数组`,`数学`,`回溯`,`组合数学`,`枚举` | 简单 | 第 241 场周赛 | -| 1864 | [构成交替字符串需要的最小交换次数](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README.md) | `贪心`,`字符串` | 中等 | 第 241 场周赛 | -| 1865 | [找出和为指定值的下标对](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README.md) | `设计`,`数组`,`哈希表` | 中等 | 第 241 场周赛 | -| 1866 | [恰有 K 根木棍可以看到的排列数目](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README.md) | `数学`,`动态规划`,`组合数学` | 困难 | 第 241 场周赛 | -| 1867 | [最大数量高于平均水平的订单](/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README.md) | `数据库` | 中等 | 🔒 | -| 1868 | [两个行程编码数组的积](/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README.md) | `数组`,`双指针` | 中等 | 🔒 | -| 1869 | [哪种连续子字符串更长](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README.md) | `字符串` | 简单 | 第 242 场周赛 | -| 1870 | [准时到达的列车最小时速](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md) | `数组`,`二分查找` | 中等 | 第 242 场周赛 | -| 1871 | [跳跃游戏 VII](/solution/1800-1899/1871.Jump%20Game%20VII/README.md) | `字符串`,`动态规划`,`前缀和`,`滑动窗口` | 中等 | 第 242 场周赛 | -| 1872 | [石子游戏 VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README.md) | `数组`,`数学`,`动态规划`,`博弈`,`前缀和` | 困难 | 第 242 场周赛 | -| 1873 | [计算特殊奖金](/solution/1800-1899/1873.Calculate%20Special%20Bonus/README.md) | `数据库` | 简单 | | -| 1874 | [两个数组的最小乘积和](/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | -| 1875 | [将工资相同的雇员分组](/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README.md) | `数据库` | 中等 | 🔒 | -| 1876 | [长度为三且各字符不同的子字符串](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README.md) | `哈希表`,`字符串`,`计数`,`滑动窗口` | 简单 | 第 53 场双周赛 | -| 1877 | [数组中最大数对和的最小值](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 53 场双周赛 | -| 1878 | [矩阵中最大的三个菱形和](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README.md) | `数组`,`数学`,`矩阵`,`前缀和`,`排序`,`堆（优先队列）` | 中等 | 第 53 场双周赛 | -| 1879 | [两个数组最小的异或值之和](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 53 场双周赛 | -| 1880 | [检查某单词是否等于两单词之和](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README.md) | `字符串` | 简单 | 第 243 场周赛 | -| 1881 | [插入后的最大值](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README.md) | `贪心`,`字符串` | 中等 | 第 243 场周赛 | -| 1882 | [使用服务器处理任务](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md) | `数组`,`堆（优先队列）` | 中等 | 第 243 场周赛 | -| 1883 | [准时抵达会议现场的最小跳过休息次数](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README.md) | `数组`,`动态规划` | 困难 | 第 243 场周赛 | -| 1884 | [鸡蛋掉落-两枚鸡蛋](/solution/1800-1899/1884.Egg%20Drop%20With%202%20Eggs%20and%20N%20Floors/README.md) | `数学`,`动态规划` | 中等 | | -| 1885 | [统计数对](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 🔒 | -| 1886 | [判断矩阵经轮转后是否一致](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README.md) | `数组`,`矩阵` | 简单 | 第 244 场周赛 | -| 1887 | [使数组元素相等的减少操作次数](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README.md) | `数组`,`排序` | 中等 | 第 244 场周赛 | -| 1888 | [使二进制字符串字符交替的最少反转次数](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README.md) | `贪心`,`字符串`,`动态规划`,`滑动窗口` | 中等 | 第 244 场周赛 | -| 1889 | [装包裹的最小浪费空间](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README.md) | `数组`,`二分查找`,`前缀和`,`排序` | 困难 | 第 244 场周赛 | -| 1890 | [2020 年最后一次登录](/solution/1800-1899/1890.The%20Latest%20Login%20in%202020/README.md) | `数据库` | 简单 | | -| 1891 | [割绳子](/solution/1800-1899/1891.Cutting%20Ribbons/README.md) | `数组`,`二分查找` | 中等 | 🔒 | -| 1892 | [页面推荐 Ⅱ](/solution/1800-1899/1892.Page%20Recommendations%20II/README.md) | `数据库` | 困难 | 🔒 | -| 1893 | [检查是否区域内所有整数都被覆盖](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README.md) | `数组`,`哈希表`,`前缀和` | 简单 | 第 54 场双周赛 | -| 1894 | [找到需要补充粉笔的学生编号](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md) | `数组`,`二分查找`,`前缀和`,`模拟` | 中等 | 第 54 场双周赛 | -| 1895 | [最大的幻方](/solution/1800-1899/1895.Largest%20Magic%20Square/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 54 场双周赛 | -| 1896 | [反转表达式值的最少操作次数](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README.md) | `栈`,`数学`,`字符串`,`动态规划` | 困难 | 第 54 场双周赛 | -| 1897 | [重新分配字符使所有字符串都相等](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 245 场周赛 | -| 1898 | [可移除字符的最大数目](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md) | `数组`,`双指针`,`字符串`,`二分查找` | 中等 | 第 245 场周赛 | -| 1899 | [合并若干三元组以形成目标三元组](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README.md) | `贪心`,`数组` | 中等 | 第 245 场周赛 | -| 1900 | [最佳运动员的比拼回合](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README.md) | `记忆化搜索`,`动态规划` | 困难 | 第 245 场周赛 | -| 1901 | [寻找峰值 II](/solution/1900-1999/1901.Find%20a%20Peak%20Element%20II/README.md) | `数组`,`二分查找`,`矩阵` | 中等 | | -| 1902 | [给定二叉搜索树的插入顺序求深度](/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README.md) | `树`,`二叉搜索树`,`二叉树`,`有序集合` | 中等 | 🔒 | -| 1903 | [字符串中的最大奇数](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README.md) | `贪心`,`数学`,`字符串` | 简单 | 第 246 场周赛 | -| 1904 | [你完成的完整对局数](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README.md) | `数学`,`字符串` | 中等 | 第 246 场周赛 | -| 1905 | [统计子岛屿](/solution/1900-1999/1905.Count%20Sub%20Islands/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 246 场周赛 | -| 1906 | [查询差绝对值的最小值](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README.md) | `数组`,`哈希表` | 中等 | 第 246 场周赛 | -| 1907 | [按分类统计薪水](/solution/1900-1999/1907.Count%20Salary%20Categories/README.md) | `数据库` | 中等 | | -| 1908 | [Nim 游戏 II](/solution/1900-1999/1908.Game%20of%20Nim/README.md) | `位运算`,`脑筋急转弯`,`数组`,`数学`,`动态规划`,`博弈` | 中等 | 🔒 | -| 1909 | [删除一个元素使数组严格递增](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README.md) | `数组` | 简单 | 第 55 场双周赛 | -| 1910 | [删除一个字符串中所有出现的给定子字符串](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README.md) | `字符串` | 中等 | 第 55 场双周赛 | -| 1911 | [最大子序列交替和](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README.md) | `数组`,`动态规划` | 中等 | 第 55 场双周赛 | -| 1912 | [设计电影租借系统](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README.md) | `设计`,`数组`,`哈希表`,`有序集合`,`堆（优先队列）` | 困难 | 第 55 场双周赛 | -| 1913 | [两个数对之间的最大乘积差](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README.md) | `数组`,`排序` | 简单 | 第 247 场周赛 | -| 1914 | [循环轮转矩阵](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 247 场周赛 | -| 1915 | [最美子字符串的数目](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README.md) | `位运算`,`哈希表`,`字符串`,`前缀和` | 中等 | 第 247 场周赛 | -| 1916 | [统计为蚁群构筑房间的不同顺序](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README.md) | `树`,`图`,`拓扑排序`,`数学`,`动态规划`,`组合数学` | 困难 | 第 247 场周赛 | -| 1917 | [Leetcodify 好友推荐](/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README.md) | `数据库` | 困难 | 🔒 | -| 1918 | [第 K 小的子数组和](/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README.md) | `数组`,`二分查找`,`滑动窗口` | 中等 | 🔒 | -| 1919 | [兴趣相同的朋友](/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README.md) | `数据库` | 困难 | 🔒 | -| 1920 | [基于排列构建数组](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README.md) | `数组`,`模拟` | 简单 | 第 248 场周赛 | -| 1921 | [消灭怪物的最大数量](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 248 场周赛 | -| 1922 | [统计好数字的数目](/solution/1900-1999/1922.Count%20Good%20Numbers/README.md) | `递归`,`数学` | 中等 | 第 248 场周赛 | -| 1923 | [最长公共子路径](/solution/1900-1999/1923.Longest%20Common%20Subpath/README.md) | `数组`,`二分查找`,`后缀数组`,`哈希函数`,`滚动哈希` | 困难 | 第 248 场周赛 | -| 1924 | [安装栅栏 II](/solution/1900-1999/1924.Erect%20the%20Fence%20II/README.md) | `几何`,`数组`,`数学` | 困难 | 🔒 | -| 1925 | [统计平方和三元组的数目](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README.md) | `数学`,`枚举` | 简单 | 第 56 场双周赛 | -| 1926 | [迷宫中离入口最近的出口](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 第 56 场双周赛 | -| 1927 | [求和游戏](/solution/1900-1999/1927.Sum%20Game/README.md) | `贪心`,`数学`,`字符串`,`博弈` | 中等 | 第 56 场双周赛 | -| 1928 | [规定时间内到达终点的最小花费](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README.md) | `图`,`数组`,`动态规划` | 困难 | 第 56 场双周赛 | -| 1929 | [数组串联](/solution/1900-1999/1929.Concatenation%20of%20Array/README.md) | `数组`,`模拟` | 简单 | 第 249 场周赛 | -| 1930 | [长度为 3 的不同回文子序列](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README.md) | `位运算`,`哈希表`,`字符串`,`前缀和` | 中等 | 第 249 场周赛 | -| 1931 | [用三种不同颜色为网格涂色](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README.md) | `动态规划` | 困难 | 第 249 场周赛 | -| 1932 | [合并多棵二叉搜索树](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README.md) | `树`,`深度优先搜索`,`哈希表`,`二分查找`,`二叉树` | 困难 | 第 249 场周赛 | -| 1933 | [判断字符串是否可分解为值均等的子串](/solution/1900-1999/1933.Check%20if%20String%20Is%20Decomposable%20Into%20Value-Equal%20Substrings/README.md) | `字符串` | 简单 | 🔒 | -| 1934 | [确认率](/solution/1900-1999/1934.Confirmation%20Rate/README.md) | `数据库` | 中等 | | -| 1935 | [可以输入的最大单词数](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README.md) | `哈希表`,`字符串` | 简单 | 第 250 场周赛 | -| 1936 | [新增的最少台阶数](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README.md) | `贪心`,`数组` | 中等 | 第 250 场周赛 | -| 1937 | [扣分后的最大得分](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README.md) | `数组`,`动态规划` | 中等 | 第 250 场周赛 | -| 1938 | [查询最大基因差](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README.md) | `位运算`,`字典树`,`数组` | 困难 | 第 250 场周赛 | -| 1939 | [主动请求确认消息的用户](/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README.md) | `数据库` | 简单 | 🔒 | -| 1940 | [排序数组之间的最长公共子序列](/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README.md) | `数组`,`哈希表`,`计数` | 中等 | 🔒 | -| 1941 | [检查是否所有字符出现次数相同](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 57 场双周赛 | -| 1942 | [最小未被占据椅子的编号](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README.md) | `数组`,`哈希表`,`堆（优先队列）` | 中等 | 第 57 场双周赛 | -| 1943 | [描述绘画结果](/solution/1900-1999/1943.Describe%20the%20Painting/README.md) | `数组`,`哈希表`,`前缀和`,`排序` | 中等 | 第 57 场双周赛 | -| 1944 | [队列中可以看到的人数](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README.md) | `栈`,`数组`,`单调栈` | 困难 | 第 57 场双周赛 | -| 1945 | [字符串转化后的各位数字之和](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README.md) | `字符串`,`模拟` | 简单 | 第 251 场周赛 | -| 1946 | [子字符串突变后可能得到的最大整数](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README.md) | `贪心`,`数组`,`字符串` | 中等 | 第 251 场周赛 | -| 1947 | [最大兼容性评分和](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | 第 251 场周赛 | -| 1948 | [删除系统中的重复文件夹](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`哈希函数` | 困难 | 第 251 场周赛 | -| 1949 | [坚定的友谊](/solution/1900-1999/1949.Strong%20Friendship/README.md) | `数据库` | 中等 | 🔒 | -| 1950 | [所有子数组最小值中的最大值](/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README.md) | `栈`,`数组`,`单调栈` | 中等 | 🔒 | -| 1951 | [查询具有最多共同关注者的所有两两结对组](/solution/1900-1999/1951.All%20the%20Pairs%20With%20the%20Maximum%20Number%20of%20Common%20Followers/README.md) | `数据库` | 中等 | 🔒 | -| 1952 | [三除数](/solution/1900-1999/1952.Three%20Divisors/README.md) | `数学`,`枚举`,`数论` | 简单 | 第 252 场周赛 | -| 1953 | [你可以工作的最大周数](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README.md) | `贪心`,`数组` | 中等 | 第 252 场周赛 | -| 1954 | [收集足够苹果的最小花园周长](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README.md) | `数学`,`二分查找` | 中等 | 第 252 场周赛 | -| 1955 | [统计特殊子序列的数目](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README.md) | `数组`,`动态规划` | 困难 | 第 252 场周赛 | -| 1956 | [感染 K 种病毒所需的最短时间](/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README.md) | `几何`,`数组`,`数学`,`二分查找`,`枚举` | 困难 | 🔒 | -| 1957 | [删除字符使字符串变好](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README.md) | `字符串` | 简单 | 第 58 场双周赛 | -| 1958 | [检查操作是否合法](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README.md) | `数组`,`枚举`,`矩阵` | 中等 | 第 58 场双周赛 | -| 1959 | [K 次调整数组大小浪费的最小总空间](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README.md) | `数组`,`动态规划` | 中等 | 第 58 场双周赛 | -| 1960 | [两个回文子字符串长度的最大乘积](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README.md) | `字符串`,`哈希函数`,`滚动哈希` | 困难 | 第 58 场双周赛 | -| 1961 | [检查字符串是否为数组前缀](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README.md) | `数组`,`双指针`,`字符串` | 简单 | 第 253 场周赛 | -| 1962 | [移除石子使总数最小](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 253 场周赛 | -| 1963 | [使字符串平衡的最小交换次数](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README.md) | `栈`,`贪心`,`双指针`,`字符串` | 中等 | 第 253 场周赛 | -| 1964 | [找出到每个位置为止最长的有效障碍赛跑路线](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README.md) | `树状数组`,`数组`,`二分查找` | 困难 | 第 253 场周赛 | -| 1965 | [丢失信息的雇员](/solution/1900-1999/1965.Employees%20With%20Missing%20Information/README.md) | `数据库` | 简单 | | -| 1966 | [未排序数组中的可被二分搜索的数](/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README.md) | `数组`,`二分查找` | 中等 | 🔒 | -| 1967 | [作为子字符串出现在单词中的字符串数目](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README.md) | `字符串` | 简单 | 第 254 场周赛 | -| 1968 | [构造元素不等于两相邻元素平均值的数组](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 254 场周赛 | -| 1969 | [数组元素的最小非零乘积](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README.md) | `贪心`,`递归`,`数学` | 中等 | 第 254 场周赛 | -| 1970 | [你能穿过矩阵的最后一天](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`二分查找`,`矩阵` | 困难 | 第 254 场周赛 | -| 1971 | [寻找图中是否存在路径](/solution/1900-1999/1971.Find%20if%20Path%20Exists%20in%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 简单 | | -| 1972 | [同一天的第一个电话和最后一个电话](/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README.md) | `数据库` | 困难 | 🔒 | -| 1973 | [值等于子节点值之和的节点数量](/solution/1900-1999/1973.Count%20Nodes%20Equal%20to%20Sum%20of%20Descendants/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | -| 1974 | [使用特殊打字机键入单词的最少时间](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README.md) | `贪心`,`字符串` | 简单 | 第 59 场双周赛 | -| 1975 | [最大方阵和](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README.md) | `贪心`,`数组`,`矩阵` | 中等 | 第 59 场双周赛 | -| 1976 | [到达目的地的方案数](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README.md) | `图`,`拓扑排序`,`动态规划`,`最短路` | 中等 | 第 59 场双周赛 | -| 1977 | [划分数字的方案数](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README.md) | `字符串`,`动态规划`,`后缀数组` | 困难 | 第 59 场双周赛 | -| 1978 | [上级经理已离职的公司员工](/solution/1900-1999/1978.Employees%20Whose%20Manager%20Left%20the%20Company/README.md) | `数据库` | 简单 | | -| 1979 | [找出数组的最大公约数](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README.md) | `数组`,`数学`,`数论` | 简单 | 第 255 场周赛 | -| 1980 | [找出不同的二进制字符串](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README.md) | `数组`,`哈希表`,`字符串`,`回溯` | 中等 | 第 255 场周赛 | -| 1981 | [最小化目标值与所选元素的差](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 255 场周赛 | -| 1982 | [从子集的和还原数组](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README.md) | `数组`,`分治` | 困难 | 第 255 场周赛 | -| 1983 | [范围和相等的最宽索引对](/solution/1900-1999/1983.Widest%20Pair%20of%20Indices%20With%20Equal%20Range%20Sum/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 🔒 | -| 1984 | [学生分数的最小差值](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README.md) | `数组`,`排序`,`滑动窗口` | 简单 | 第 256 场周赛 | -| 1985 | [找出数组中的第 K 大整数](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README.md) | `数组`,`字符串`,`分治`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | 第 256 场周赛 | -| 1986 | [完成任务的最少工作时间段](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | 第 256 场周赛 | -| 1987 | [不同的好子序列数目](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README.md) | `字符串`,`动态规划` | 困难 | 第 256 场周赛 | -| 1988 | [找出每所学校的最低分数要求](/solution/1900-1999/1988.Find%20Cutoff%20Score%20for%20Each%20School/README.md) | `数据库` | 中等 | 🔒 | -| 1989 | [捉迷藏中可捕获的最大人数](/solution/1900-1999/1989.Maximum%20Number%20of%20People%20That%20Can%20Be%20Caught%20in%20Tag/README.md) | `贪心`,`数组` | 中等 | 🔒 | -| 1990 | [统计实验的数量](/solution/1900-1999/1990.Count%20the%20Number%20of%20Experiments/README.md) | `数据库` | 中等 | 🔒 | -| 1991 | [找到数组的中间位置](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md) | `数组`,`前缀和` | 简单 | 第 60 场双周赛 | -| 1992 | [找到所有的农场组](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | 第 60 场双周赛 | -| 1993 | [树上的操作](/solution/1900-1999/1993.Operations%20on%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`数组`,`哈希表` | 中等 | 第 60 场双周赛 | -| 1994 | [好子集的数目](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README.md) | `位运算`,`数组`,`数学`,`动态规划`,`状态压缩` | 困难 | 第 60 场双周赛 | -| 1995 | [统计特殊四元组](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README.md) | `数组`,`哈希表`,`枚举` | 简单 | 第 257 场周赛 | -| 1996 | [游戏中弱角色的数量](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README.md) | `栈`,`贪心`,`数组`,`排序`,`单调栈` | 中等 | 第 257 场周赛 | -| 1997 | [访问完所有房间的第一天](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README.md) | `数组`,`动态规划` | 中等 | 第 257 场周赛 | -| 1998 | [数组的最大公因数排序](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README.md) | `并查集`,`数组`,`数学`,`数论`,`排序` | 困难 | 第 257 场周赛 | -| 1999 | [最小的仅由两个数组成的倍数](/solution/1900-1999/1999.Smallest%20Greater%20Multiple%20Made%20of%20Two%20Digits/README.md) | `数学`,`枚举` | 中等 | 🔒 | -| 2000 | [反转单词前缀](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README.md) | `双指针`,`字符串` | 简单 | 第 258 场周赛 | -| 2001 | [可互换矩形的组数](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README.md) | `数组`,`哈希表`,`数学`,`计数`,`数论` | 中等 | 第 258 场周赛 | -| 2002 | [两个回文子序列长度的最大乘积](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README.md) | `位运算`,`字符串`,`动态规划`,`回溯`,`状态压缩` | 中等 | 第 258 场周赛 | -| 2003 | [每棵子树内缺失的最小基因值](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README.md) | `树`,`深度优先搜索`,`并查集`,`动态规划` | 困难 | 第 258 场周赛 | -| 2004 | [职员招聘人数](/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README.md) | `数据库` | 困难 | 🔒 | -| 2005 | [斐波那契树的移除子树游戏](/solution/2000-2099/2005.Subtree%20Removal%20Game%20with%20Fibonacci%20Tree/README.md) | `树`,`数学`,`动态规划`,`二叉树`,`博弈` | 困难 | 🔒 | -| 2006 | [差的绝对值为 K 的数对数目](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 61 场双周赛 | -| 2007 | [从双倍数组中还原原数组](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README.md) | `贪心`,`数组`,`哈希表`,`排序` | 中等 | 第 61 场双周赛 | -| 2008 | [出租车的最大盈利](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md) | `数组`,`哈希表`,`二分查找`,`动态规划`,`排序` | 中等 | 第 61 场双周赛 | -| 2009 | [使数组连续的最少操作数](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README.md) | `数组`,`哈希表`,`二分查找`,`滑动窗口` | 困难 | 第 61 场双周赛 | -| 2010 | [职员招聘人数 II](/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README.md) | `数据库` | 困难 | 🔒 | -| 2011 | [执行操作后的变量值](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README.md) | `数组`,`字符串`,`模拟` | 简单 | 第 259 场周赛 | -| 2012 | [数组美丽值求和](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README.md) | `数组` | 中等 | 第 259 场周赛 | -| 2013 | [检测正方形](/solution/2000-2099/2013.Detect%20Squares/README.md) | `设计`,`数组`,`哈希表`,`计数` | 中等 | 第 259 场周赛 | -| 2014 | [重复 K 次的最长子序列](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README.md) | `贪心`,`字符串`,`回溯`,`计数`,`枚举` | 困难 | 第 259 场周赛 | -| 2015 | [每段建筑物的平均高度](/solution/2000-2099/2015.Average%20Height%20of%20Buildings%20in%20Each%20Segment/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 中等 | 🔒 | -| 2016 | [增量元素之间的最大差值](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README.md) | `数组` | 简单 | 第 260 场周赛 | -| 2017 | [网格游戏](/solution/2000-2099/2017.Grid%20Game/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 260 场周赛 | -| 2018 | [判断单词是否能放入填字游戏内](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README.md) | `数组`,`枚举`,`矩阵` | 中等 | 第 260 场周赛 | -| 2019 | [解出数学表达式的学生分数](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README.md) | `栈`,`记忆化搜索`,`数组`,`数学`,`字符串`,`动态规划` | 困难 | 第 260 场周赛 | -| 2020 | [无流量的帐户数](/solution/2000-2099/2020.Number%20of%20Accounts%20That%20Did%20Not%20Stream/README.md) | `数据库` | 中等 | 🔒 | -| 2021 | [街上最亮的位置](/solution/2000-2099/2021.Brightest%20Position%20on%20Street/README.md) | `数组`,`有序集合`,`前缀和` | 中等 | 🔒 | -| 2022 | [将一维数组转变成二维数组](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README.md) | `数组`,`矩阵`,`模拟` | 简单 | 第 62 场双周赛 | -| 2023 | [连接后等于目标字符串的字符串对](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 中等 | 第 62 场双周赛 | -| 2024 | [考试的最大困扰度](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README.md) | `字符串`,`二分查找`,`前缀和`,`滑动窗口` | 中等 | 第 62 场双周赛 | -| 2025 | [分割数组的最多方案数](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README.md) | `数组`,`哈希表`,`计数`,`枚举`,`前缀和` | 困难 | 第 62 场双周赛 | -| 2026 | [低质量的问题](/solution/2000-2099/2026.Low-Quality%20Problems/README.md) | `数据库` | 简单 | 🔒 | -| 2027 | [转换字符串的最少操作次数](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README.md) | `贪心`,`字符串` | 简单 | 第 261 场周赛 | -| 2028 | [找出缺失的观测数据](/solution/2000-2099/2028.Find%20Missing%20Observations/README.md) | `数组`,`数学`,`模拟` | 中等 | 第 261 场周赛 | -| 2029 | [石子游戏 IX](/solution/2000-2099/2029.Stone%20Game%20IX/README.md) | `贪心`,`数组`,`数学`,`计数`,`博弈` | 中等 | 第 261 场周赛 | -| 2030 | [含特定字母的最小子序列](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README.md) | `栈`,`贪心`,`字符串`,`单调栈` | 困难 | 第 261 场周赛 | -| 2031 | [1 比 0 多的子数组个数](/solution/2000-2099/2031.Count%20Subarrays%20With%20More%20Ones%20Than%20Zeros/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 中等 | 🔒 | -| 2032 | [至少在两个数组中出现的值](/solution/2000-2099/2032.Two%20Out%20of%20Three/README.md) | `位运算`,`数组`,`哈希表` | 简单 | 第 262 场周赛 | -| 2033 | [获取单值网格的最小操作数](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README.md) | `数组`,`数学`,`矩阵`,`排序` | 中等 | 第 262 场周赛 | -| 2034 | [股票价格波动](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README.md) | `设计`,`哈希表`,`数据流`,`有序集合`,`堆（优先队列）` | 中等 | 第 262 场周赛 | -| 2035 | [将数组分成两个数组并最小化数组和的差](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README.md) | `位运算`,`数组`,`双指针`,`二分查找`,`动态规划`,`状态压缩`,`有序集合` | 困难 | 第 262 场周赛 | -| 2036 | [最大交替子数组和](/solution/2000-2099/2036.Maximum%20Alternating%20Subarray%20Sum/README.md) | `数组`,`动态规划` | 中等 | 🔒 | -| 2037 | [使每位学生都有座位的最少移动次数](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 63 场双周赛 | -| 2038 | [如果相邻两个颜色均相同则删除当前颜色](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README.md) | `贪心`,`数学`,`字符串`,`博弈` | 中等 | 第 63 场双周赛 | -| 2039 | [网络空闲的时刻](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README.md) | `广度优先搜索`,`图`,`数组` | 中等 | 第 63 场双周赛 | -| 2040 | [两个有序数组的第 K 小乘积](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README.md) | `数组`,`二分查找` | 困难 | 第 63 场双周赛 | -| 2041 | [面试中被录取的候选人](/solution/2000-2099/2041.Accepted%20Candidates%20From%20the%20Interviews/README.md) | `数据库` | 中等 | 🔒 | -| 2042 | [检查句子中的数字是否递增](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README.md) | `字符串` | 简单 | 第 263 场周赛 | -| 2043 | [简易银行系统](/solution/2000-2099/2043.Simple%20Bank%20System/README.md) | `设计`,`数组`,`哈希表`,`模拟` | 中等 | 第 263 场周赛 | -| 2044 | [统计按位或能得到最大值的子集数目](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README.md) | `位运算`,`数组`,`回溯`,`枚举` | 中等 | 第 263 场周赛 | -| 2045 | [到达目的地的第二短时间](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README.md) | `广度优先搜索`,`图`,`最短路` | 困难 | 第 263 场周赛 | -| 2046 | [给按照绝对值排序的链表排序](/solution/2000-2099/2046.Sort%20Linked%20List%20Already%20Sorted%20Using%20Absolute%20Values/README.md) | `链表`,`双指针`,`排序` | 中等 | 🔒 | -| 2047 | [句子中的有效单词数](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README.md) | `字符串` | 简单 | 第 264 场周赛 | -| 2048 | [下一个更大的数值平衡数](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README.md) | `数学`,`回溯`,`枚举` | 中等 | 第 264 场周赛 | -| 2049 | [统计最高分的节点数目](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README.md) | `树`,`深度优先搜索`,`数组`,`二叉树` | 中等 | 第 264 场周赛 | -| 2050 | [并行课程 III](/solution/2000-2099/2050.Parallel%20Courses%20III/README.md) | `图`,`拓扑排序`,`数组`,`动态规划` | 困难 | 第 264 场周赛 | -| 2051 | [商店中每个成员的级别](/solution/2000-2099/2051.The%20Category%20of%20Each%20Member%20in%20the%20Store/README.md) | `数据库` | 中等 | 🔒 | -| 2052 | [将句子分隔成行的最低成本](/solution/2000-2099/2052.Minimum%20Cost%20to%20Separate%20Sentence%20Into%20Rows/README.md) | `数组`,`动态规划` | 中等 | 🔒 | -| 2053 | [数组中第 K 个独一无二的字符串](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 简单 | 第 64 场双周赛 | -| 2054 | [两个最好的不重叠活动](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README.md) | `数组`,`二分查找`,`动态规划`,`排序`,`堆（优先队列）` | 中等 | 第 64 场双周赛 | -| 2055 | [蜡烛之间的盘子](/solution/2000-2099/2055.Plates%20Between%20Candles/README.md) | `数组`,`字符串`,`二分查找`,`前缀和` | 中等 | 第 64 场双周赛 | -| 2056 | [棋盘上有效移动组合的数目](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README.md) | `数组`,`字符串`,`回溯`,`模拟` | 困难 | 第 64 场双周赛 | -| 2057 | [值相等的最小索引](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README.md) | `数组` | 简单 | 第 265 场周赛 | -| 2058 | [找出临界点之间的最小和最大距离](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README.md) | `链表` | 中等 | 第 265 场周赛 | -| 2059 | [转化数字的最小运算数](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README.md) | `广度优先搜索`,`数组` | 中等 | 第 265 场周赛 | -| 2060 | [同源字符串检测](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README.md) | `字符串`,`动态规划` | 困难 | 第 265 场周赛 | -| 2061 | [扫地机器人清扫过的空间个数](/solution/2000-2099/2061.Number%20of%20Spaces%20Cleaning%20Robot%20Cleaned/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 🔒 | -| 2062 | [统计字符串中的元音子字符串](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README.md) | `哈希表`,`字符串` | 简单 | 第 266 场周赛 | -| 2063 | [所有子字符串中的元音](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README.md) | `数学`,`字符串`,`动态规划`,`组合数学` | 中等 | 第 266 场周赛 | -| 2064 | [分配给商店的最多商品的最小值](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README.md) | `数组`,`二分查找` | 中等 | 第 266 场周赛 | -| 2065 | [最大化一张图中的路径价值](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README.md) | `图`,`数组`,`回溯` | 困难 | 第 266 场周赛 | -| 2066 | [账户余额](/solution/2000-2099/2066.Account%20Balance/README.md) | `数据库` | 中等 | 🔒 | -| 2067 | [等计数子串的数量](/solution/2000-2099/2067.Number%20of%20Equal%20Count%20Substrings/README.md) | `字符串`,`计数`,`前缀和` | 中等 | 🔒 | -| 2068 | [检查两个字符串是否几乎相等](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 65 场双周赛 | -| 2069 | [模拟行走机器人 II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README.md) | `设计`,`模拟` | 中等 | 第 65 场双周赛 | -| 2070 | [每一个查询的最大美丽值](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README.md) | `数组`,`二分查找`,`排序` | 中等 | 第 65 场双周赛 | -| 2071 | [你可以安排的最多任务数目](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README.md) | `贪心`,`队列`,`数组`,`二分查找`,`排序`,`单调队列` | 困难 | 第 65 场双周赛 | -| 2072 | [赢得比赛的大学](/solution/2000-2099/2072.The%20Winner%20University/README.md) | `数据库` | 简单 | 🔒 | -| 2073 | [买票需要的时间](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README.md) | `队列`,`数组`,`模拟` | 简单 | 第 267 场周赛 | -| 2074 | [反转偶数长度组的节点](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README.md) | `链表` | 中等 | 第 267 场周赛 | -| 2075 | [解码斜向换位密码](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README.md) | `字符串`,`模拟` | 中等 | 第 267 场周赛 | -| 2076 | [处理含限制条件的好友请求](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README.md) | `并查集`,`图` | 困难 | 第 267 场周赛 | -| 2077 | [殊途同归](/solution/2000-2099/2077.Paths%20in%20Maze%20That%20Lead%20to%20Same%20Room/README.md) | `图` | 中等 | 🔒 | -| 2078 | [两栋颜色不同且距离最远的房子](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README.md) | `贪心`,`数组` | 简单 | 第 268 场周赛 | -| 2079 | [给植物浇水](/solution/2000-2099/2079.Watering%20Plants/README.md) | `数组`,`模拟` | 中等 | 第 268 场周赛 | -| 2080 | [区间内查询数字的频率](/solution/2000-2099/2080.Range%20Frequency%20Queries/README.md) | `设计`,`线段树`,`数组`,`哈希表`,`二分查找` | 中等 | 第 268 场周赛 | -| 2081 | [k 镜像数字的和](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README.md) | `数学`,`枚举` | 困难 | 第 268 场周赛 | -| 2082 | [富有客户的数量](/solution/2000-2099/2082.The%20Number%20of%20Rich%20Customers/README.md) | `数据库` | 简单 | 🔒 | -| 2083 | [求以相同字母开头和结尾的子串总数](/solution/2000-2099/2083.Substrings%20That%20Begin%20and%20End%20With%20the%20Same%20Letter/README.md) | `哈希表`,`数学`,`字符串`,`计数`,`前缀和` | 中等 | 🔒 | -| 2084 | [为订单类型为 0 的客户删除类型为 1 的订单](/solution/2000-2099/2084.Drop%20Type%201%20Orders%20for%20Customers%20With%20Type%200%20Orders/README.md) | `数据库` | 中等 | 🔒 | -| 2085 | [统计出现过一次的公共字符串](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 简单 | 第 66 场双周赛 | -| 2086 | [喂食仓鼠的最小食物桶数](/solution/2000-2099/2086.Minimum%20Number%20of%20Food%20Buckets%20to%20Feed%20the%20Hamsters/README.md) | `贪心`,`字符串`,`动态规划` | 中等 | 第 66 场双周赛 | -| 2087 | [网格图中机器人回家的最小代价](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README.md) | `贪心`,`数组` | 中等 | 第 66 场双周赛 | -| 2088 | [统计农场中肥沃金字塔的数目](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 66 场双周赛 | -| 2089 | [找出数组排序后的目标下标](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README.md) | `数组`,`二分查找`,`排序` | 简单 | 第 269 场周赛 | -| 2090 | [半径为 k 的子数组平均值](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README.md) | `数组`,`滑动窗口` | 中等 | 第 269 场周赛 | -| 2091 | [从数组中移除最大值和最小值](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README.md) | `贪心`,`数组` | 中等 | 第 269 场周赛 | -| 2092 | [找出知晓秘密的所有专家](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`排序` | 困难 | 第 269 场周赛 | -| 2093 | [前往目标城市的最小费用](/solution/2000-2099/2093.Minimum%20Cost%20to%20Reach%20City%20With%20Discounts/README.md) | `图`,`最短路`,`堆（优先队列）` | 中等 | 🔒 | -| 2094 | [找出 3 位偶数](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README.md) | `数组`,`哈希表`,`枚举`,`排序` | 简单 | 第 270 场周赛 | -| 2095 | [删除链表的中间节点](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README.md) | `链表`,`双指针` | 中等 | 第 270 场周赛 | -| 2096 | [从二叉树一个节点到另一个节点每一步的方向](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README.md) | `树`,`深度优先搜索`,`字符串`,`二叉树` | 中等 | 第 270 场周赛 | -| 2097 | [合法重新排列数对](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README.md) | `深度优先搜索`,`图`,`欧拉回路` | 困难 | 第 270 场周赛 | -| 2098 | [长度为 K 的最大偶数和子序列](/solution/2000-2099/2098.Subsequence%20of%20Size%20K%20With%20the%20Largest%20Even%20Sum/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | -| 2099 | [找到和最大的长度为 K 的子序列](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README.md) | `数组`,`哈希表`,`排序`,`堆（优先队列）` | 简单 | 第 67 场双周赛 | -| 2100 | [适合野炊的日子](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README.md) | `数组`,`动态规划`,`前缀和` | 中等 | 第 67 场双周赛 | -| 2101 | [引爆最多的炸弹](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`几何`,`数组`,`数学` | 中等 | 第 67 场双周赛 | -| 2102 | [序列顺序查询](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README.md) | `设计`,`数据流`,`有序集合`,`堆（优先队列）` | 困难 | 第 67 场双周赛 | -| 2103 | [环和杆](/solution/2100-2199/2103.Rings%20and%20Rods/README.md) | `哈希表`,`字符串` | 简单 | 第 271 场周赛 | -| 2104 | [子数组范围和](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README.md) | `栈`,`数组`,`单调栈` | 中等 | 第 271 场周赛 | -| 2105 | [给植物浇水 II](/solution/2100-2199/2105.Watering%20Plants%20II/README.md) | `数组`,`双指针`,`模拟` | 中等 | 第 271 场周赛 | -| 2106 | [摘水果](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README.md) | `数组`,`二分查找`,`前缀和`,`滑动窗口` | 困难 | 第 271 场周赛 | -| 2107 | [分享 K 个糖果后独特口味的数量](/solution/2100-2199/2107.Number%20of%20Unique%20Flavors%20After%20Sharing%20K%20Candies/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 🔒 | -| 2108 | [找出数组中的第一个回文字符串](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README.md) | `数组`,`双指针`,`字符串` | 简单 | 第 272 场周赛 | -| 2109 | [向字符串添加空格](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README.md) | `数组`,`双指针`,`字符串`,`模拟` | 中等 | 第 272 场周赛 | -| 2110 | [股票平滑下跌阶段的数目](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README.md) | `数组`,`数学`,`动态规划` | 中等 | 第 272 场周赛 | -| 2111 | [使数组 K 递增的最少操作次数](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README.md) | `数组`,`二分查找` | 困难 | 第 272 场周赛 | -| 2112 | [最繁忙的机场](/solution/2100-2199/2112.The%20Airport%20With%20the%20Most%20Traffic/README.md) | `数据库` | 中等 | 🔒 | -| 2113 | [查询删除和添加元素后的数组](/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README.md) | `数组` | 中等 | 🔒 | -| 2114 | [句子中的最多单词数](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README.md) | `数组`,`字符串` | 简单 | 第 68 场双周赛 | -| 2115 | [从给定原材料中找到所有可以做出的菜](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README.md) | `图`,`拓扑排序`,`数组`,`哈希表`,`字符串` | 中等 | 第 68 场双周赛 | -| 2116 | [判断一个括号字符串是否有效](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md) | `栈`,`贪心`,`字符串` | 中等 | 第 68 场双周赛 | -| 2117 | [一个区间内所有数乘积的缩写](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README.md) | `数学` | 困难 | 第 68 场双周赛 | -| 2118 | [建立方程](/solution/2100-2199/2118.Build%20the%20Equation/README.md) | `数据库` | 困难 | 🔒 | -| 2119 | [反转两次的数字](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README.md) | `数学` | 简单 | 第 273 场周赛 | -| 2120 | [执行所有后缀指令](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README.md) | `字符串`,`模拟` | 中等 | 第 273 场周赛 | -| 2121 | [相同元素的间隔之和](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 273 场周赛 | -| 2122 | [还原原数组](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README.md) | `数组`,`哈希表`,`枚举`,`排序` | 困难 | 第 273 场周赛 | -| 2123 | [使矩阵中的 1 互不相邻的最小操作数](/solution/2100-2199/2123.Minimum%20Operations%20to%20Remove%20Adjacent%20Ones%20in%20Matrix/README.md) | `图`,`数组`,`矩阵` | 困难 | 🔒 | -| 2124 | [检查是否所有 A 都在 B 之前](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md) | `字符串` | 简单 | 第 274 场周赛 | -| 2125 | [银行中的激光束数量](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md) | `数组`,`数学`,`字符串`,`矩阵` | 中等 | 第 274 场周赛 | -| 2126 | [摧毁小行星](/solution/2100-2199/2126.Destroying%20Asteroids/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 274 场周赛 | -| 2127 | [参加会议的最多员工数](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md) | `深度优先搜索`,`图`,`拓扑排序` | 困难 | 第 274 场周赛 | -| 2128 | [通过翻转行或列来去除所有的 1](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md) | `位运算`,`数组`,`数学`,`矩阵` | 中等 | 🔒 | -| 2129 | [将标题首字母大写](/solution/2100-2199/2129.Capitalize%20the%20Title/README.md) | `字符串` | 简单 | 第 69 场双周赛 | -| 2130 | [链表最大孪生和](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md) | `栈`,`链表`,`双指针` | 中等 | 第 69 场双周赛 | -| 2131 | [连接两字母单词得到的最长回文串](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README.md) | `贪心`,`数组`,`哈希表`,`字符串`,`计数` | 中等 | 第 69 场双周赛 | -| 2132 | [用邮票贴满网格图](/solution/2100-2199/2132.Stamping%20the%20Grid/README.md) | `贪心`,`数组`,`矩阵`,`前缀和` | 困难 | 第 69 场双周赛 | -| 2133 | [检查是否每一行每一列都包含全部整数](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README.md) | `数组`,`哈希表`,`矩阵` | 简单 | 第 275 场周赛 | -| 2134 | [最少交换次数来组合所有的 1 II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README.md) | `数组`,`滑动窗口` | 中等 | 第 275 场周赛 | -| 2135 | [统计追加字母可以获得的单词数](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README.md) | `位运算`,`数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 275 场周赛 | -| 2136 | [全部开花的最早一天](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README.md) | `贪心`,`数组`,`排序` | 困难 | 第 275 场周赛 | -| 2137 | [通过倒水操作让所有的水桶所含水量相等](/solution/2100-2199/2137.Pour%20Water%20Between%20Buckets%20to%20Make%20Water%20Levels%20Equal/README.md) | `数组`,`二分查找` | 中等 | 🔒 | -| 2138 | [将字符串拆分为若干长度为 k 的组](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README.md) | `字符串`,`模拟` | 简单 | 第 276 场周赛 | -| 2139 | [得到目标值的最少行动次数](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README.md) | `贪心`,`数学` | 中等 | 第 276 场周赛 | -| 2140 | [解决智力问题](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README.md) | `数组`,`动态规划` | 中等 | 第 276 场周赛 | -| 2141 | [同时运行 N 台电脑的最长时间](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README.md) | `贪心`,`数组`,`二分查找`,`排序` | 困难 | 第 276 场周赛 | -| 2142 | [每辆车的乘客人数 I](/solution/2100-2199/2142.The%20Number%20of%20Passengers%20in%20Each%20Bus%20I/README.md) | `数据库` | 中等 | 🔒 | -| 2143 | [在两个数组的区间中选取数字](/solution/2100-2199/2143.Choose%20Numbers%20From%20Two%20Arrays%20in%20Range/README.md) | `数组`,`动态规划` | 困难 | 🔒 | -| 2144 | [打折购买糖果的最小开销](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 70 场双周赛 | -| 2145 | [统计隐藏数组数目](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README.md) | `数组`,`前缀和` | 中等 | 第 70 场双周赛 | -| 2146 | [价格范围内最高排名的 K 样物品](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README.md) | `广度优先搜索`,`数组`,`矩阵`,`排序`,`堆（优先队列）` | 中等 | 第 70 场双周赛 | -| 2147 | [分隔长廊的方案数](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README.md) | `数学`,`字符串`,`动态规划` | 困难 | 第 70 场双周赛 | -| 2148 | [元素计数](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README.md) | `数组`,`排序` | 简单 | 第 277 场周赛 | -| 2149 | [按符号重排数组](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README.md) | `数组`,`双指针`,`模拟` | 中等 | 第 277 场周赛 | -| 2150 | [找出数组中的所有孤独数字](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 277 场周赛 | -| 2151 | [基于陈述统计最多好人数](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README.md) | `位运算`,`数组`,`回溯`,`枚举` | 困难 | 第 277 场周赛 | -| 2152 | [穿过所有点的所需最少直线数量](/solution/2100-2199/2152.Minimum%20Number%20of%20Lines%20to%20Cover%20Points/README.md) | `位运算`,`几何`,`数组`,`哈希表`,`数学`,`动态规划`,`回溯`,`状态压缩` | 中等 | 🔒 | -| 2153 | [每辆车的乘客人数 II](/solution/2100-2199/2153.The%20Number%20of%20Passengers%20in%20Each%20Bus%20II/README.md) | `数据库` | 困难 | 🔒 | -| 2154 | [将找到的值乘以 2](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README.md) | `数组`,`哈希表`,`排序`,`模拟` | 简单 | 第 278 场周赛 | -| 2155 | [分组得分最高的所有下标](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README.md) | `数组` | 中等 | 第 278 场周赛 | -| 2156 | [查找给定哈希值的子串](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README.md) | `字符串`,`滑动窗口`,`哈希函数`,`滚动哈希` | 困难 | 第 278 场周赛 | -| 2157 | [字符串分组](/solution/2100-2199/2157.Groups%20of%20Strings/README.md) | `位运算`,`并查集`,`字符串` | 困难 | 第 278 场周赛 | -| 2158 | [每天绘制新区域的数量](/solution/2100-2199/2158.Amount%20of%20New%20Area%20Painted%20Each%20Day/README.md) | `线段树`,`数组`,`有序集合` | 困难 | 🔒 | -| 2159 | [分别排序两列](/solution/2100-2199/2159.Order%20Two%20Columns%20Independently/README.md) | `数据库` | 中等 | 🔒 | -| 2160 | [拆分数位后四位数字的最小和](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README.md) | `贪心`,`数学`,`排序` | 简单 | 第 71 场双周赛 | -| 2161 | [根据给定数字划分数组](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README.md) | `数组`,`双指针`,`模拟` | 中等 | 第 71 场双周赛 | -| 2162 | [设置时间的最少代价](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README.md) | `数学`,`枚举` | 中等 | 第 71 场双周赛 | -| 2163 | [删除元素后和的最小差值](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README.md) | `数组`,`动态规划`,`堆（优先队列）` | 困难 | 第 71 场双周赛 | -| 2164 | [对奇偶下标分别排序](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README.md) | `数组`,`排序` | 简单 | 第 279 场周赛 | -| 2165 | [重排数字的最小值](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README.md) | `数学`,`排序` | 中等 | 第 279 场周赛 | -| 2166 | [设计位集](/solution/2100-2199/2166.Design%20Bitset/README.md) | `设计`,`数组`,`哈希表`,`字符串` | 中等 | 第 279 场周赛 | -| 2167 | [移除所有载有违禁货物车厢所需的最少时间](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README.md) | `字符串`,`动态规划` | 困难 | 第 279 场周赛 | -| 2168 | [每个数字的频率都相同的独特子字符串的数量](/solution/2100-2199/2168.Unique%20Substrings%20With%20Equal%20Digit%20Frequency/README.md) | `哈希表`,`字符串`,`计数`,`哈希函数`,`滚动哈希` | 中等 | 🔒 | -| 2169 | [得到 0 的操作数](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README.md) | `数学`,`模拟` | 简单 | 第 280 场周赛 | -| 2170 | [使数组变成交替数组的最少操作数](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README.md) | `贪心`,`数组`,`哈希表`,`计数` | 中等 | 第 280 场周赛 | -| 2171 | [拿出最少数目的魔法豆](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README.md) | `贪心`,`数组`,`枚举`,`前缀和`,`排序` | 中等 | 第 280 场周赛 | -| 2172 | [数组的最大与和](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 280 场周赛 | -| 2173 | [最多连胜的次数](/solution/2100-2199/2173.Longest%20Winning%20Streak/README.md) | `数据库` | 困难 | 🔒 | -| 2174 | [通过翻转行或列来去除所有的 1 II](/solution/2100-2199/2174.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips%20II/README.md) | `位运算`,`广度优先搜索`,`数组`,`矩阵` | 中等 | 🔒 | -| 2175 | [世界排名的变化](/solution/2100-2199/2175.The%20Change%20in%20Global%20Rankings/README.md) | `数据库` | 中等 | 🔒 | -| 2176 | [统计数组中相等且可以被整除的数对](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README.md) | `数组` | 简单 | 第 72 场双周赛 | -| 2177 | [找到和为给定整数的三个连续整数](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README.md) | `数学`,`模拟` | 中等 | 第 72 场双周赛 | -| 2178 | [拆分成最多数目的正偶数之和](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README.md) | `贪心`,`数学`,`回溯` | 中等 | 第 72 场双周赛 | -| 2179 | [统计数组中好三元组数目](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | 第 72 场双周赛 | -| 2180 | [统计各位数字之和为偶数的整数个数](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README.md) | `数学`,`模拟` | 简单 | 第 281 场周赛 | -| 2181 | [合并零之间的节点](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README.md) | `链表`,`模拟` | 中等 | 第 281 场周赛 | -| 2182 | [构造限制重复的字符串](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`堆（优先队列）` | 中等 | 第 281 场周赛 | -| 2183 | [统计可以被 K 整除的下标对数目](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README.md) | `数组`,`数学`,`数论` | 困难 | 第 281 场周赛 | -| 2184 | [建造坚实的砖墙的方法数](/solution/2100-2199/2184.Number%20of%20Ways%20to%20Build%20Sturdy%20Brick%20Wall/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 中等 | 🔒 | -| 2185 | [统计包含给定前缀的字符串](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README.md) | `数组`,`字符串`,`字符串匹配` | 简单 | 第 282 场周赛 | -| 2186 | [制造字母异位词的最小步骤数 II](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 282 场周赛 | -| 2187 | [完成旅途的最少时间](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README.md) | `数组`,`二分查找` | 中等 | 第 282 场周赛 | -| 2188 | [完成比赛的最少时间](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README.md) | `数组`,`动态规划` | 困难 | 第 282 场周赛 | -| 2189 | [建造纸牌屋的方法数](/solution/2100-2199/2189.Number%20of%20Ways%20to%20Build%20House%20of%20Cards/README.md) | `数学`,`动态规划` | 中等 | 🔒 | -| 2190 | [数组中紧跟 key 之后出现最频繁的数字](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 73 场双周赛 | -| 2191 | [将杂乱无章的数字排序](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README.md) | `数组`,`排序` | 中等 | 第 73 场双周赛 | -| 2192 | [有向无环图中一个节点的所有祖先](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | 第 73 场双周赛 | -| 2193 | [得到回文串的最少操作次数](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README.md) | `贪心`,`树状数组`,`双指针`,`字符串` | 困难 | 第 73 场双周赛 | -| 2194 | [Excel 表中某个范围内的单元格](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README.md) | `字符串` | 简单 | 第 283 场周赛 | -| 2195 | [向数组中追加 K 个整数](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README.md) | `贪心`,`数组`,`数学`,`排序` | 中等 | 第 283 场周赛 | -| 2196 | [根据描述创建二叉树](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README.md) | `树`,`数组`,`哈希表`,`二叉树` | 中等 | 第 283 场周赛 | -| 2197 | [替换数组中的非互质数](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README.md) | `栈`,`数组`,`数学`,`数论` | 困难 | 第 283 场周赛 | -| 2198 | [单因数三元组](/solution/2100-2199/2198.Number%20of%20Single%20Divisor%20Triplets/README.md) | `数学` | 中等 | 🔒 | -| 2199 | [找到每篇文章的主题](/solution/2100-2199/2199.Finding%20the%20Topic%20of%20Each%20Post/README.md) | `数据库` | 困难 | 🔒 | -| 2200 | [找出数组中的所有 K 近邻下标](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README.md) | `数组`,`双指针` | 简单 | 第 284 场周赛 | -| 2201 | [统计可以提取的工件](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README.md) | `数组`,`哈希表`,`模拟` | 中等 | 第 284 场周赛 | -| 2202 | [K 次操作后最大化顶端元素](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README.md) | `贪心`,`数组` | 中等 | 第 284 场周赛 | -| 2203 | [得到要求路径的最小带权子图](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md) | `图`,`最短路` | 困难 | 第 284 场周赛 | -| 2204 | [无向图中到环的距离](/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 困难 | 🔒 | -| 2205 | [有资格享受折扣的用户数量](/solution/2200-2299/2205.The%20Number%20of%20Users%20That%20Are%20Eligible%20for%20Discount/README.md) | `数据库` | 简单 | 🔒 | -| 2206 | [将数组划分成相等数对](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README.md) | `位运算`,`数组`,`哈希表`,`计数` | 简单 | 第 74 场双周赛 | -| 2207 | [字符串中最多数目的子序列](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README.md) | `贪心`,`字符串`,`前缀和` | 中等 | 第 74 场双周赛 | -| 2208 | [将数组和减半的最少操作次数](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 74 场双周赛 | -| 2209 | [用地毯覆盖后的最少白色砖块](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README.md) | `字符串`,`动态规划`,`前缀和` | 困难 | 第 74 场双周赛 | -| 2210 | [统计数组中峰和谷的数量](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README.md) | `数组` | 简单 | 第 285 场周赛 | -| 2211 | [统计道路上的碰撞次数](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README.md) | `栈`,`字符串`,`模拟` | 中等 | 第 285 场周赛 | -| 2212 | [射箭比赛中的最大得分](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README.md) | `位运算`,`数组`,`回溯`,`枚举` | 中等 | 第 285 场周赛 | -| 2213 | [由单个字符重复的最长子字符串](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README.md) | `线段树`,`数组`,`字符串`,`有序集合` | 困难 | 第 285 场周赛 | -| 2214 | [通关游戏所需的最低生命值](/solution/2200-2299/2214.Minimum%20Health%20to%20Beat%20Game/README.md) | `贪心`,`数组` | 中等 | 🔒 | -| 2215 | [找出两数组的不同](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README.md) | `数组`,`哈希表` | 简单 | 第 286 场周赛 | -| 2216 | [美化数组的最少删除数](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README.md) | `栈`,`贪心`,`数组` | 中等 | 第 286 场周赛 | -| 2217 | [找到指定长度的回文数](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README.md) | `数组`,`数学` | 中等 | 第 286 场周赛 | -| 2218 | [从栈中取出 K 个硬币的最大面值和](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README.md) | `数组`,`动态规划`,`前缀和` | 困难 | 第 286 场周赛 | -| 2219 | [数组的最大总分](/solution/2200-2299/2219.Maximum%20Sum%20Score%20of%20Array/README.md) | `数组`,`前缀和` | 中等 | 🔒 | -| 2220 | [转换数字的最少位翻转次数](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README.md) | `位运算` | 简单 | 第 75 场双周赛 | -| 2221 | [数组的三角和](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README.md) | `数组`,`数学`,`组合数学`,`模拟` | 中等 | 第 75 场双周赛 | -| 2222 | [选择建筑的方案数](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README.md) | `字符串`,`动态规划`,`前缀和` | 中等 | 第 75 场双周赛 | -| 2223 | [构造字符串的总得分和](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README.md) | `字符串`,`二分查找`,`字符串匹配`,`后缀数组`,`哈希函数`,`滚动哈希` | 困难 | 第 75 场双周赛 | -| 2224 | [转化时间需要的最少操作数](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README.md) | `贪心`,`字符串` | 简单 | 第 287 场周赛 | -| 2225 | [找出输掉零场或一场比赛的玩家](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README.md) | `数组`,`哈希表`,`计数`,`排序` | 中等 | 第 287 场周赛 | -| 2226 | [每个小孩最多能分到多少糖果](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README.md) | `数组`,`二分查找` | 中等 | 第 287 场周赛 | -| 2227 | [加密解密字符串](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README.md) | `设计`,`字典树`,`数组`,`哈希表`,`字符串` | 困难 | 第 287 场周赛 | -| 2228 | [7 天内两次购买的用户](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README.md) | `数据库` | 中等 | 🔒 | -| 2229 | [检查数组是否连贯](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README.md) | `数组`,`哈希表`,`排序` | 简单 | 🔒 | -| 2230 | [查找可享受优惠的用户](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README.md) | `数据库` | 简单 | 🔒 | -| 2231 | [按奇偶性交换后的最大数字](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md) | `排序`,`堆（优先队列）` | 简单 | 第 288 场周赛 | -| 2232 | [向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md) | `字符串`,`枚举` | 中等 | 第 288 场周赛 | -| 2233 | [K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 288 场周赛 | -| 2234 | [花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md) | `贪心`,`数组`,`双指针`,`二分查找`,`排序` | 困难 | 第 288 场周赛 | -| 2235 | [两整数相加](/solution/2200-2299/2235.Add%20Two%20Integers/README.md) | `数学` | 简单 | | -| 2236 | [判断根结点是否等于子结点之和](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README.md) | `树`,`二叉树` | 简单 | | -| 2237 | [计算街道上满足所需亮度的位置数量](/solution/2200-2299/2237.Count%20Positions%20on%20Street%20With%20Required%20Brightness/README.md) | `数组`,`前缀和` | 中等 | 🔒 | -| 2238 | [司机成为乘客的次数](/solution/2200-2299/2238.Number%20of%20Times%20a%20Driver%20Was%20a%20Passenger/README.md) | `数据库` | 中等 | 🔒 | -| 2239 | [找到最接近 0 的数字](/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README.md) | `数组` | 简单 | 第 76 场双周赛 | -| 2240 | [买钢笔和铅笔的方案数](/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README.md) | `数学`,`枚举` | 中等 | 第 76 场双周赛 | -| 2241 | [设计一个 ATM 机器](/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README.md) | `贪心`,`设计`,`数组` | 中等 | 第 76 场双周赛 | -| 2242 | [节点序列的最大得分](/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README.md) | `图`,`数组`,`枚举`,`排序` | 困难 | 第 76 场双周赛 | -| 2243 | [计算字符串的数字和](/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README.md) | `字符串`,`模拟` | 简单 | 第 289 场周赛 | -| 2244 | [完成所有任务需要的最少轮数](/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README.md) | `贪心`,`数组`,`哈希表`,`计数` | 中等 | 第 289 场周赛 | -| 2245 | [转角路径的乘积中最多能有几个尾随零](/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 289 场周赛 | -| 2246 | [相邻字符不同的最长路径](/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README.md) | `树`,`深度优先搜索`,`图`,`拓扑排序`,`数组`,`字符串` | 困难 | 第 289 场周赛 | -| 2247 | [K 条高速公路的最大旅行费用](/solution/2200-2299/2247.Maximum%20Cost%20of%20Trip%20With%20K%20Highways/README.md) | `位运算`,`图`,`动态规划`,`状态压缩` | 困难 | 🔒 | -| 2248 | [多个数组求交集](/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README.md) | `数组`,`哈希表`,`计数`,`排序` | 简单 | 第 290 场周赛 | -| 2249 | [统计圆内格点数目](/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README.md) | `几何`,`数组`,`哈希表`,`数学`,`枚举` | 中等 | 第 290 场周赛 | -| 2250 | [统计包含每个点的矩形数目](/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README.md) | `树状数组`,`数组`,`二分查找`,`排序` | 中等 | 第 290 场周赛 | -| 2251 | [花期内花的数目](/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README.md) | `数组`,`哈希表`,`二分查找`,`有序集合`,`前缀和`,`排序` | 困难 | 第 290 场周赛 | -| 2252 | [表的动态旋转](/solution/2200-2299/2252.Dynamic%20Pivoting%20of%20a%20Table/README.md) | `数据库` | 困难 | 🔒 | -| 2253 | [动态取消表的旋转](/solution/2200-2299/2253.Dynamic%20Unpivoting%20of%20a%20Table/README.md) | `数据库` | 困难 | 🔒 | -| 2254 | [设计视频共享平台](/solution/2200-2299/2254.Design%20Video%20Sharing%20Platform/README.md) | `栈`,`设计`,`哈希表`,`有序集合` | 困难 | 🔒 | -| 2255 | [统计是给定字符串前缀的字符串数目](/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README.md) | `数组`,`字符串` | 简单 | 第 77 场双周赛 | -| 2256 | [最小平均差](/solution/2200-2299/2256.Minimum%20Average%20Difference/README.md) | `数组`,`前缀和` | 中等 | 第 77 场双周赛 | -| 2257 | [统计网格图中没有被保卫的格子数](/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 77 场双周赛 | -| 2258 | [逃离火灾](/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README.md) | `广度优先搜索`,`数组`,`二分查找`,`矩阵` | 困难 | 第 77 场双周赛 | -| 2259 | [移除指定数字得到的最大结果](/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README.md) | `贪心`,`字符串`,`枚举` | 简单 | 第 291 场周赛 | -| 2260 | [必须拿起的最小连续卡牌数](/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 291 场周赛 | -| 2261 | [含最多 K 个可整除元素的子数组](/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README.md) | `字典树`,`数组`,`哈希表`,`枚举`,`哈希函数`,`滚动哈希` | 中等 | 第 291 场周赛 | -| 2262 | [字符串的总引力](/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README.md) | `哈希表`,`字符串`,`动态规划` | 困难 | 第 291 场周赛 | -| 2263 | [数组变为有序的最小操作次数](/solution/2200-2299/2263.Make%20Array%20Non-decreasing%20or%20Non-increasing/README.md) | `贪心`,`动态规划` | 困难 | 🔒 | -| 2264 | [字符串中最大的 3 位相同数字](/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README.md) | `字符串` | 简单 | 第 292 场周赛 | -| 2265 | [统计值等于子树平均值的节点数](/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 292 场周赛 | -| 2266 | [统计打字方案数](/solution/2200-2299/2266.Count%20Number%20of%20Texts/README.md) | `哈希表`,`数学`,`字符串`,`动态规划` | 中等 | 第 292 场周赛 | -| 2267 | [检查是否有合法括号字符串路径](/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 292 场周赛 | -| 2268 | [最少按键次数](/solution/2200-2299/2268.Minimum%20Number%20of%20Keypresses/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序` | 中等 | 🔒 | -| 2269 | [找到一个数字的 K 美丽值](/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README.md) | `数学`,`字符串`,`滑动窗口` | 简单 | 第 78 场双周赛 | -| 2270 | [分割数组的方案数](/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README.md) | `数组`,`前缀和` | 中等 | 第 78 场双周赛 | -| 2271 | [毯子覆盖的最多白色砖块数](/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README.md) | `贪心`,`数组`,`二分查找`,`前缀和`,`排序` | 中等 | 第 78 场双周赛 | -| 2272 | [最大波动的子字符串](/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README.md) | `数组`,`动态规划` | 困难 | 第 78 场双周赛 | -| 2273 | [移除字母异位词后的结果数组](/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 简单 | 第 293 场周赛 | -| 2274 | [不含特殊楼层的最大连续楼层数](/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README.md) | `数组`,`排序` | 中等 | 第 293 场周赛 | -| 2275 | [按位与结果大于零的最长组合](/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README.md) | `位运算`,`数组`,`哈希表`,`计数` | 中等 | 第 293 场周赛 | -| 2276 | [统计区间中的整数数目](/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README.md) | `设计`,`线段树`,`有序集合` | 困难 | 第 293 场周赛 | -| 2277 | [树中最接近路径的节点](/solution/2200-2299/2277.Closest%20Node%20to%20Path%20in%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组` | 困难 | 🔒 | -| 2278 | [字母在字符串中的百分比](/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README.md) | `字符串` | 简单 | 第 294 场周赛 | -| 2279 | [装满石头的背包的最大数量](/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 294 场周赛 | -| 2280 | [表示一个折线图的最少线段数](/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README.md) | `几何`,`数组`,`数学`,`数论`,`排序` | 中等 | 第 294 场周赛 | -| 2281 | [巫师的总力量和](/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README.md) | `栈`,`数组`,`前缀和`,`单调栈` | 困难 | 第 294 场周赛 | -| 2282 | [在一个网格中可以看到的人数](/solution/2200-2299/2282.Number%20of%20People%20That%20Can%20Be%20Seen%20in%20a%20Grid/README.md) | `栈`,`数组`,`矩阵`,`单调栈` | 中等 | 🔒 | -| 2283 | [判断一个数的数字计数是否等于数位的值](/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 79 场双周赛 | -| 2284 | [最多单词数的发件人](/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 中等 | 第 79 场双周赛 | -| 2285 | [道路的最大总重要性](/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README.md) | `贪心`,`图`,`排序`,`堆（优先队列）` | 中等 | 第 79 场双周赛 | -| 2286 | [以组为单位订音乐会的门票](/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README.md) | `设计`,`树状数组`,`线段树`,`二分查找` | 困难 | 第 79 场双周赛 | -| 2287 | [重排字符形成目标字符串](/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 295 场周赛 | -| 2288 | [价格减免](/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README.md) | `字符串` | 中等 | 第 295 场周赛 | -| 2289 | [使数组按非递减顺序排列](/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README.md) | `栈`,`数组`,`链表`,`单调栈` | 中等 | 第 295 场周赛 | -| 2290 | [到达角落需要移除障碍物的最小数目](/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README.md) | `广度优先搜索`,`图`,`数组`,`矩阵`,`最短路`,`堆（优先队列）` | 困难 | 第 295 场周赛 | -| 2291 | [最大股票收益](/solution/2200-2299/2291.Maximum%20Profit%20From%20Trading%20Stocks/README.md) | `数组`,`动态规划` | 中等 | 🔒 | -| 2292 | [连续两年有 3 个及以上订单的产品](/solution/2200-2299/2292.Products%20With%20Three%20or%20More%20Orders%20in%20Two%20Consecutive%20Years/README.md) | `数据库` | 中等 | 🔒 | -| 2293 | [极大极小游戏](/solution/2200-2299/2293.Min%20Max%20Game/README.md) | `数组`,`模拟` | 简单 | 第 296 场周赛 | -| 2294 | [划分数组使最大差为 K](/solution/2200-2299/2294.Partition%20Array%20Such%20That%20Maximum%20Difference%20Is%20K/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 296 场周赛 | -| 2295 | [替换数组中的元素](/solution/2200-2299/2295.Replace%20Elements%20in%20an%20Array/README.md) | `数组`,`哈希表`,`模拟` | 中等 | 第 296 场周赛 | -| 2296 | [设计一个文本编辑器](/solution/2200-2299/2296.Design%20a%20Text%20Editor/README.md) | `栈`,`设计`,`链表`,`字符串`,`双向链表`,`模拟` | 困难 | 第 296 场周赛 | -| 2297 | [跳跃游戏 VIII](/solution/2200-2299/2297.Jump%20Game%20VIII/README.md) | `栈`,`图`,`数组`,`动态规划`,`最短路`,`单调栈` | 中等 | 🔒 | -| 2298 | [周末任务计数](/solution/2200-2299/2298.Tasks%20Count%20in%20the%20Weekend/README.md) | `数据库` | 中等 | 🔒 | -| 2299 | [强密码检验器 II](/solution/2200-2299/2299.Strong%20Password%20Checker%20II/README.md) | `字符串` | 简单 | 第 80 场双周赛 | -| 2300 | [咒语和药水的成功对数](/solution/2300-2399/2300.Successful%20Pairs%20of%20Spells%20and%20Potions/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 80 场双周赛 | -| 2301 | [替换字符后匹配](/solution/2300-2399/2301.Match%20Substring%20After%20Replacement/README.md) | `数组`,`哈希表`,`字符串`,`字符串匹配` | 困难 | 第 80 场双周赛 | -| 2302 | [统计得分小于 K 的子数组数目](/solution/2300-2399/2302.Count%20Subarrays%20With%20Score%20Less%20Than%20K/README.md) | `数组`,`二分查找`,`前缀和`,`滑动窗口` | 困难 | 第 80 场双周赛 | -| 2303 | [计算应缴税款总额](/solution/2300-2399/2303.Calculate%20Amount%20Paid%20in%20Taxes/README.md) | `数组`,`模拟` | 简单 | 第 297 场周赛 | -| 2304 | [网格中的最小路径代价](/solution/2300-2399/2304.Minimum%20Path%20Cost%20in%20a%20Grid/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 297 场周赛 | -| 2305 | [公平分发饼干](/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | 第 297 场周赛 | -| 2306 | [公司命名](/solution/2300-2399/2306.Naming%20a%20Company/README.md) | `位运算`,`数组`,`哈希表`,`字符串`,`枚举` | 困难 | 第 297 场周赛 | -| 2307 | [检查方程中的矛盾之处](/solution/2300-2399/2307.Check%20for%20Contradictions%20in%20Equations/README.md) | `深度优先搜索`,`并查集`,`图`,`数组` | 困难 | 🔒 | -| 2308 | [按性别排列表格](/solution/2300-2399/2308.Arrange%20Table%20by%20Gender/README.md) | `数据库` | 中等 | 🔒 | -| 2309 | [兼具大小写的最好英文字母](/solution/2300-2399/2309.Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case/README.md) | `哈希表`,`字符串`,`枚举` | 简单 | 第 298 场周赛 | -| 2310 | [个位数字为 K 的整数之和](/solution/2300-2399/2310.Sum%20of%20Numbers%20With%20Units%20Digit%20K/README.md) | `贪心`,`数学`,`动态规划`,`枚举` | 中等 | 第 298 场周赛 | -| 2311 | [小于等于 K 的最长二进制子序列](/solution/2300-2399/2311.Longest%20Binary%20Subsequence%20Less%20Than%20or%20Equal%20to%20K/README.md) | `贪心`,`记忆化搜索`,`字符串`,`动态规划` | 中等 | 第 298 场周赛 | -| 2312 | [卖木头块](/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README.md) | `记忆化搜索`,`数组`,`动态规划` | 困难 | 第 298 场周赛 | -| 2313 | [二叉树中得到结果所需的最少翻转次数](/solution/2300-2399/2313.Minimum%20Flips%20in%20Binary%20Tree%20to%20Get%20Result/README.md) | `树`,`深度优先搜索`,`动态规划`,`二叉树` | 困难 | 🔒 | -| 2314 | [每个城市最高气温的第一天](/solution/2300-2399/2314.The%20First%20Day%20of%20the%20Maximum%20Recorded%20Degree%20in%20Each%20City/README.md) | `数据库` | 中等 | 🔒 | -| 2315 | [统计星号](/solution/2300-2399/2315.Count%20Asterisks/README.md) | `字符串` | 简单 | 第 81 场双周赛 | -| 2316 | [统计无向图中无法互相到达点对数](/solution/2300-2399/2316.Count%20Unreachable%20Pairs%20of%20Nodes%20in%20an%20Undirected%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 第 81 场双周赛 | -| 2317 | [操作后的最大异或和](/solution/2300-2399/2317.Maximum%20XOR%20After%20Operations/README.md) | `位运算`,`数组`,`数学` | 中等 | 第 81 场双周赛 | -| 2318 | [不同骰子序列的数目](/solution/2300-2399/2318.Number%20of%20Distinct%20Roll%20Sequences/README.md) | `记忆化搜索`,`动态规划` | 困难 | 第 81 场双周赛 | -| 2319 | [判断矩阵是否是一个 X 矩阵](/solution/2300-2399/2319.Check%20if%20Matrix%20Is%20X-Matrix/README.md) | `数组`,`矩阵` | 简单 | 第 299 场周赛 | -| 2320 | [统计放置房子的方式数](/solution/2300-2399/2320.Count%20Number%20of%20Ways%20to%20Place%20Houses/README.md) | `动态规划` | 中等 | 第 299 场周赛 | -| 2321 | [拼接数组的最大分数](/solution/2300-2399/2321.Maximum%20Score%20Of%20Spliced%20Array/README.md) | `数组`,`动态规划` | 困难 | 第 299 场周赛 | -| 2322 | [从树中删除边的最小分数](/solution/2300-2399/2322.Minimum%20Score%20After%20Removals%20on%20a%20Tree/README.md) | `位运算`,`树`,`深度优先搜索`,`数组` | 困难 | 第 299 场周赛 | -| 2323 | [完成所有工作的最短时间 II](/solution/2300-2399/2323.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs%20II/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | -| 2324 | [产品销售分析 IV](/solution/2300-2399/2324.Product%20Sales%20Analysis%20IV/README.md) | `数据库` | 中等 | 🔒 | -| 2325 | [解密消息](/solution/2300-2399/2325.Decode%20the%20Message/README.md) | `哈希表`,`字符串` | 简单 | 第 300 场周赛 | -| 2326 | [螺旋矩阵 IV](/solution/2300-2399/2326.Spiral%20Matrix%20IV/README.md) | `数组`,`链表`,`矩阵`,`模拟` | 中等 | 第 300 场周赛 | -| 2327 | [知道秘密的人数](/solution/2300-2399/2327.Number%20of%20People%20Aware%20of%20a%20Secret/README.md) | `队列`,`动态规划`,`模拟` | 中等 | 第 300 场周赛 | -| 2328 | [网格图中递增路径的数目](/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序`,`记忆化搜索`,`数组`,`动态规划`,`矩阵` | 困难 | 第 300 场周赛 | -| 2329 | [产品销售分析 Ⅴ](/solution/2300-2399/2329.Product%20Sales%20Analysis%20V/README.md) | `数据库` | 简单 | 🔒 | -| 2330 | [验证回文串 IV](/solution/2300-2399/2330.Valid%20Palindrome%20IV/README.md) | `双指针`,`字符串` | 中等 | 🔒 | -| 2331 | [计算布尔二叉树的值](/solution/2300-2399/2331.Evaluate%20Boolean%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | 第 82 场双周赛 | -| 2332 | [坐上公交的最晚时间](/solution/2300-2399/2332.The%20Latest%20Time%20to%20Catch%20a%20Bus/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 82 场双周赛 | -| 2333 | [最小差值平方和](/solution/2300-2399/2333.Minimum%20Sum%20of%20Squared%20Difference/README.md) | `数组`,`数学`,`排序`,`堆（优先队列）` | 中等 | 第 82 场双周赛 | -| 2334 | [元素值大于变化阈值的子数组](/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README.md) | `栈`,`并查集`,`数组`,`单调栈` | 困难 | 第 82 场双周赛 | -| 2335 | [装满杯子需要的最短总时长](/solution/2300-2399/2335.Minimum%20Amount%20of%20Time%20to%20Fill%20Cups/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 简单 | 第 301 场周赛 | -| 2336 | [无限集中的最小数字](/solution/2300-2399/2336.Smallest%20Number%20in%20Infinite%20Set/README.md) | `设计`,`哈希表`,`堆（优先队列）` | 中等 | 第 301 场周赛 | -| 2337 | [移动片段得到字符串](/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README.md) | `双指针`,`字符串` | 中等 | 第 301 场周赛 | -| 2338 | [统计理想数组的数目](/solution/2300-2399/2338.Count%20the%20Number%20of%20Ideal%20Arrays/README.md) | `数学`,`动态规划`,`组合数学`,`数论` | 困难 | 第 301 场周赛 | -| 2339 | [联赛的所有比赛](/solution/2300-2399/2339.All%20the%20Matches%20of%20the%20League/README.md) | `数据库` | 简单 | 🔒 | -| 2340 | [生成有效数组的最少交换次数](/solution/2300-2399/2340.Minimum%20Adjacent%20Swaps%20to%20Make%20a%20Valid%20Array/README.md) | `贪心`,`数组` | 中等 | 🔒 | -| 2341 | [数组能形成多少数对](/solution/2300-2399/2341.Maximum%20Number%20of%20Pairs%20in%20Array/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 302 场周赛 | -| 2342 | [数位和相等数对的最大和](/solution/2300-2399/2342.Max%20Sum%20of%20a%20Pair%20With%20Equal%20Sum%20of%20Digits/README.md) | `数组`,`哈希表`,`排序`,`堆（优先队列）` | 中等 | 第 302 场周赛 | -| 2343 | [裁剪数字后查询第 K 小的数字](/solution/2300-2399/2343.Query%20Kth%20Smallest%20Trimmed%20Number/README.md) | `数组`,`字符串`,`分治`,`快速选择`,`基数排序`,`排序`,`堆（优先队列）` | 中等 | 第 302 场周赛 | -| 2344 | [使数组可以被整除的最少删除次数](/solution/2300-2399/2344.Minimum%20Deletions%20to%20Make%20Array%20Divisible/README.md) | `数组`,`数学`,`数论`,`排序`,`堆（优先队列）` | 困难 | 第 302 场周赛 | -| 2345 | [寻找可见山的数量](/solution/2300-2399/2345.Finding%20the%20Number%20of%20Visible%20Mountains/README.md) | `栈`,`数组`,`排序`,`单调栈` | 中等 | 🔒 | -| 2346 | [以百分比计算排名](/solution/2300-2399/2346.Compute%20the%20Rank%20as%20a%20Percentage/README.md) | `数据库` | 中等 | 🔒 | -| 2347 | [最好的扑克手牌](/solution/2300-2399/2347.Best%20Poker%20Hand/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 83 场双周赛 | -| 2348 | [全 0 子数组的数目](/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README.md) | `数组`,`数学` | 中等 | 第 83 场双周赛 | -| 2349 | [设计数字容器系统](/solution/2300-2399/2349.Design%20a%20Number%20Container%20System/README.md) | `设计`,`哈希表`,`有序集合`,`堆（优先队列）` | 中等 | 第 83 场双周赛 | -| 2350 | [不可能得到的最短骰子序列](/solution/2300-2399/2350.Shortest%20Impossible%20Sequence%20of%20Rolls/README.md) | `贪心`,`数组`,`哈希表` | 困难 | 第 83 场双周赛 | -| 2351 | [第一个出现两次的字母](/solution/2300-2399/2351.First%20Letter%20to%20Appear%20Twice/README.md) | `位运算`,`哈希表`,`字符串`,`计数` | 简单 | 第 303 场周赛 | -| 2352 | [相等行列对](/solution/2300-2399/2352.Equal%20Row%20and%20Column%20Pairs/README.md) | `数组`,`哈希表`,`矩阵`,`模拟` | 中等 | 第 303 场周赛 | -| 2353 | [设计食物评分系统](/solution/2300-2399/2353.Design%20a%20Food%20Rating%20System/README.md) | `设计`,`哈希表`,`有序集合`,`堆（优先队列）` | 中等 | 第 303 场周赛 | -| 2354 | [优质数对的数目](/solution/2300-2399/2354.Number%20of%20Excellent%20Pairs/README.md) | `位运算`,`数组`,`哈希表`,`二分查找` | 困难 | 第 303 场周赛 | -| 2355 | [你能拿走的最大图书数量](/solution/2300-2399/2355.Maximum%20Number%20of%20Books%20You%20Can%20Take/README.md) | `栈`,`数组`,`动态规划`,`单调栈` | 困难 | 🔒 | -| 2356 | [每位教师所教授的科目种类的数量](/solution/2300-2399/2356.Number%20of%20Unique%20Subjects%20Taught%20by%20Each%20Teacher/README.md) | `数据库` | 简单 | | -| 2357 | [使数组中所有元素都等于零](/solution/2300-2399/2357.Make%20Array%20Zero%20by%20Subtracting%20Equal%20Amounts/README.md) | `贪心`,`数组`,`哈希表`,`排序`,`模拟`,`堆（优先队列）` | 简单 | 第 304 场周赛 | -| 2358 | [分组的最大数量](/solution/2300-2399/2358.Maximum%20Number%20of%20Groups%20Entering%20a%20Competition/README.md) | `贪心`,`数组`,`数学`,`二分查找` | 中等 | 第 304 场周赛 | -| 2359 | [找到离给定两个节点最近的节点](/solution/2300-2399/2359.Find%20Closest%20Node%20to%20Given%20Two%20Nodes/README.md) | `深度优先搜索`,`图` | 中等 | 第 304 场周赛 | -| 2360 | [图中的最长环](/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README.md) | `深度优先搜索`,`图`,`拓扑排序` | 困难 | 第 304 场周赛 | -| 2361 | [乘坐火车路线的最少费用](/solution/2300-2399/2361.Minimum%20Costs%20Using%20the%20Train%20Line/README.md) | `数组`,`动态规划` | 困难 | 🔒 | -| 2362 | [生成发票](/solution/2300-2399/2362.Generate%20the%20Invoice/README.md) | `数据库` | 困难 | 🔒 | -| 2363 | [合并相似的物品](/solution/2300-2399/2363.Merge%20Similar%20Items/README.md) | `数组`,`哈希表`,`有序集合`,`排序` | 简单 | 第 84 场双周赛 | -| 2364 | [统计坏数对的数目](/solution/2300-2399/2364.Count%20Number%20of%20Bad%20Pairs/README.md) | `数组`,`哈希表` | 中等 | 第 84 场双周赛 | -| 2365 | [任务调度器 II](/solution/2300-2399/2365.Task%20Scheduler%20II/README.md) | `数组`,`哈希表`,`模拟` | 中等 | 第 84 场双周赛 | -| 2366 | [将数组排序的最少替换次数](/solution/2300-2399/2366.Minimum%20Replacements%20to%20Sort%20the%20Array/README.md) | `贪心`,`数组`,`数学` | 困难 | 第 84 场双周赛 | -| 2367 | [算术三元组的数目](/solution/2300-2399/2367.Number%20of%20Arithmetic%20Triplets/README.md) | `数组`,`哈希表`,`双指针`,`枚举` | 简单 | 第 305 场周赛 | -| 2368 | [受限条件下可到达节点的数目](/solution/2300-2399/2368.Reachable%20Nodes%20With%20Restrictions/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`数组`,`哈希表` | 中等 | 第 305 场周赛 | -| 2369 | [检查数组是否存在有效划分](/solution/2300-2399/2369.Check%20if%20There%20is%20a%20Valid%20Partition%20For%20The%20Array/README.md) | `数组`,`动态规划` | 中等 | 第 305 场周赛 | -| 2370 | [最长理想子序列](/solution/2300-2399/2370.Longest%20Ideal%20Subsequence/README.md) | `哈希表`,`字符串`,`动态规划` | 中等 | 第 305 场周赛 | -| 2371 | [最小化网格中的最大值](/solution/2300-2399/2371.Minimize%20Maximum%20Value%20in%20a%20Grid/README.md) | `并查集`,`图`,`拓扑排序`,`数组`,`矩阵`,`排序` | 困难 | 🔒 | -| 2372 | [计算每个销售人员的影响力](/solution/2300-2399/2372.Calculate%20the%20Influence%20of%20Each%20Salesperson/README.md) | `数据库` | 中等 | 🔒 | -| 2373 | [矩阵中的局部最大值](/solution/2300-2399/2373.Largest%20Local%20Values%20in%20a%20Matrix/README.md) | `数组`,`矩阵` | 简单 | 第 306 场周赛 | -| 2374 | [边积分最高的节点](/solution/2300-2399/2374.Node%20With%20Highest%20Edge%20Score/README.md) | `图`,`哈希表` | 中等 | 第 306 场周赛 | -| 2375 | [根据模式串构造最小数字](/solution/2300-2399/2375.Construct%20Smallest%20Number%20From%20DI%20String/README.md) | `栈`,`贪心`,`字符串`,`回溯` | 中等 | 第 306 场周赛 | -| 2376 | [统计特殊整数](/solution/2300-2399/2376.Count%20Special%20Integers/README.md) | `数学`,`动态规划` | 困难 | 第 306 场周赛 | -| 2377 | [整理奥运表](/solution/2300-2399/2377.Sort%20the%20Olympic%20Table/README.md) | `数据库` | 简单 | 🔒 | -| 2378 | [选择边来最大化树的得分](/solution/2300-2399/2378.Choose%20Edges%20to%20Maximize%20Score%20in%20a%20Tree/README.md) | `树`,`深度优先搜索`,`动态规划` | 中等 | 🔒 | -| 2379 | [得到 K 个黑块的最少涂色次数](/solution/2300-2399/2379.Minimum%20Recolors%20to%20Get%20K%20Consecutive%20Black%20Blocks/README.md) | `字符串`,`滑动窗口` | 简单 | 第 85 场双周赛 | -| 2380 | [二进制字符串重新安排顺序需要的时间](/solution/2300-2399/2380.Time%20Needed%20to%20Rearrange%20a%20Binary%20String/README.md) | `字符串`,`动态规划`,`模拟` | 中等 | 第 85 场双周赛 | -| 2381 | [字母移位 II](/solution/2300-2399/2381.Shifting%20Letters%20II/README.md) | `数组`,`字符串`,`前缀和` | 中等 | 第 85 场双周赛 | -| 2382 | [删除操作后的最大子段和](/solution/2300-2399/2382.Maximum%20Segment%20Sum%20After%20Removals/README.md) | `并查集`,`数组`,`有序集合`,`前缀和` | 困难 | 第 85 场双周赛 | -| 2383 | [赢得比赛需要的最少训练时长](/solution/2300-2399/2383.Minimum%20Hours%20of%20Training%20to%20Win%20a%20Competition/README.md) | `贪心`,`数组` | 简单 | 第 307 场周赛 | -| 2384 | [最大回文数字](/solution/2300-2399/2384.Largest%20Palindromic%20Number/README.md) | `贪心`,`哈希表`,`字符串` | 中等 | 第 307 场周赛 | -| 2385 | [感染二叉树需要的总时间](/solution/2300-2399/2385.Amount%20of%20Time%20for%20Binary%20Tree%20to%20Be%20Infected/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 第 307 场周赛 | -| 2386 | [找出数组的第 K 大和](/solution/2300-2399/2386.Find%20the%20K-Sum%20of%20an%20Array/README.md) | `数组`,`排序`,`堆（优先队列）` | 困难 | 第 307 场周赛 | -| 2387 | [行排序矩阵的中位数](/solution/2300-2399/2387.Median%20of%20a%20Row%20Wise%20Sorted%20Matrix/README.md) | `数组`,`二分查找`,`矩阵` | 中等 | 🔒 | -| 2388 | [将表中的空值更改为前一个值](/solution/2300-2399/2388.Change%20Null%20Values%20in%20a%20Table%20to%20the%20Previous%20Value/README.md) | `数据库` | 中等 | 🔒 | -| 2389 | [和有限的最长子序列](/solution/2300-2399/2389.Longest%20Subsequence%20With%20Limited%20Sum/README.md) | `贪心`,`数组`,`二分查找`,`前缀和`,`排序` | 简单 | 第 308 场周赛 | -| 2390 | [从字符串中移除星号](/solution/2300-2399/2390.Removing%20Stars%20From%20a%20String/README.md) | `栈`,`字符串`,`模拟` | 中等 | 第 308 场周赛 | -| 2391 | [收集垃圾的最少总时间](/solution/2300-2399/2391.Minimum%20Amount%20of%20Time%20to%20Collect%20Garbage/README.md) | `数组`,`字符串`,`前缀和` | 中等 | 第 308 场周赛 | -| 2392 | [给定条件下构造矩阵](/solution/2300-2399/2392.Build%20a%20Matrix%20With%20Conditions/README.md) | `图`,`拓扑排序`,`数组`,`矩阵` | 困难 | 第 308 场周赛 | -| 2393 | [严格递增的子数组个数](/solution/2300-2399/2393.Count%20Strictly%20Increasing%20Subarrays/README.md) | `数组`,`数学`,`动态规划` | 中等 | 🔒 | -| 2394 | [开除员工](/solution/2300-2399/2394.Employees%20With%20Deductions/README.md) | `数据库` | 中等 | 🔒 | -| 2395 | [和相等的子数组](/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README.md) | `数组`,`哈希表` | 简单 | 第 86 场双周赛 | -| 2396 | [严格回文的数字](/solution/2300-2399/2396.Strictly%20Palindromic%20Number/README.md) | `脑筋急转弯`,`数学`,`双指针` | 中等 | 第 86 场双周赛 | -| 2397 | [被列覆盖的最多行数](/solution/2300-2399/2397.Maximum%20Rows%20Covered%20by%20Columns/README.md) | `位运算`,`数组`,`回溯`,`枚举`,`矩阵` | 中等 | 第 86 场双周赛 | -| 2398 | [预算内的最多机器人数目](/solution/2300-2399/2398.Maximum%20Number%20of%20Robots%20Within%20Budget/README.md) | `队列`,`数组`,`二分查找`,`前缀和`,`滑动窗口`,`堆（优先队列）` | 困难 | 第 86 场双周赛 | -| 2399 | [检查相同字母间的距离](/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 309 场周赛 | -| 2400 | [恰好移动 k 步到达某一位置的方法数目](/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README.md) | `数学`,`动态规划`,`组合数学` | 中等 | 第 309 场周赛 | -| 2401 | [最长优雅子数组](/solution/2400-2499/2401.Longest%20Nice%20Subarray/README.md) | `位运算`,`数组`,`滑动窗口` | 中等 | 第 309 场周赛 | -| 2402 | [会议室 III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README.md) | `数组`,`哈希表`,`排序`,`模拟`,`堆（优先队列）` | 困难 | 第 309 场周赛 | -| 2403 | [杀死所有怪物的最短时间](/solution/2400-2499/2403.Minimum%20Time%20to%20Kill%20All%20Monsters/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 🔒 | -| 2404 | [出现最频繁的偶数元素](/solution/2400-2499/2404.Most%20Frequent%20Even%20Element/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 310 场周赛 | -| 2405 | [子字符串的最优划分](/solution/2400-2499/2405.Optimal%20Partition%20of%20String/README.md) | `贪心`,`哈希表`,`字符串` | 中等 | 第 310 场周赛 | -| 2406 | [将区间分为最少组数](/solution/2400-2499/2406.Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/README.md) | `贪心`,`数组`,`双指针`,`前缀和`,`排序`,`堆（优先队列）` | 中等 | 第 310 场周赛 | -| 2407 | [最长递增子序列 II](/solution/2400-2499/2407.Longest%20Increasing%20Subsequence%20II/README.md) | `树状数组`,`线段树`,`队列`,`数组`,`分治`,`动态规划`,`单调队列` | 困难 | 第 310 场周赛 | -| 2408 | [设计 SQL](/solution/2400-2499/2408.Design%20SQL/README.md) | `设计`,`数组`,`哈希表`,`字符串` | 中等 | 🔒 | -| 2409 | [统计共同度过的日子数](/solution/2400-2499/2409.Count%20Days%20Spent%20Together/README.md) | `数学`,`字符串` | 简单 | 第 87 场双周赛 | -| 2410 | [运动员和训练师的最大匹配数](/solution/2400-2499/2410.Maximum%20Matching%20of%20Players%20With%20Trainers/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 87 场双周赛 | -| 2411 | [按位或最大的最小子数组长度](/solution/2400-2499/2411.Smallest%20Subarrays%20With%20Maximum%20Bitwise%20OR/README.md) | `位运算`,`数组`,`二分查找`,`滑动窗口` | 中等 | 第 87 场双周赛 | -| 2412 | [完成所有交易的初始最少钱数](/solution/2400-2499/2412.Minimum%20Money%20Required%20Before%20Transactions/README.md) | `贪心`,`数组`,`排序` | 困难 | 第 87 场双周赛 | -| 2413 | [最小偶倍数](/solution/2400-2499/2413.Smallest%20Even%20Multiple/README.md) | `数学`,`数论` | 简单 | 第 311 场周赛 | -| 2414 | [最长的字母序连续子字符串的长度](/solution/2400-2499/2414.Length%20of%20the%20Longest%20Alphabetical%20Continuous%20Substring/README.md) | `字符串` | 中等 | 第 311 场周赛 | -| 2415 | [反转二叉树的奇数层](/solution/2400-2499/2415.Reverse%20Odd%20Levels%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 311 场周赛 | -| 2416 | [字符串的前缀分数和](/solution/2400-2499/2416.Sum%20of%20Prefix%20Scores%20of%20Strings/README.md) | `字典树`,`数组`,`字符串`,`计数` | 困难 | 第 311 场周赛 | -| 2417 | [最近的公平整数](/solution/2400-2499/2417.Closest%20Fair%20Integer/README.md) | `数学`,`枚举` | 中等 | 🔒 | -| 2418 | [按身高排序](/solution/2400-2499/2418.Sort%20the%20People/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 简单 | 第 312 场周赛 | -| 2419 | [按位与最大的最长子数组](/solution/2400-2499/2419.Longest%20Subarray%20With%20Maximum%20Bitwise%20AND/README.md) | `位运算`,`脑筋急转弯`,`数组` | 中等 | 第 312 场周赛 | -| 2420 | [找到所有好下标](/solution/2400-2499/2420.Find%20All%20Good%20Indices/README.md) | `数组`,`动态规划`,`前缀和` | 中等 | 第 312 场周赛 | -| 2421 | [好路径的数目](/solution/2400-2499/2421.Number%20of%20Good%20Paths/README.md) | `树`,`并查集`,`图`,`数组`,`哈希表`,`排序` | 困难 | 第 312 场周赛 | -| 2422 | [使用合并操作将数组转换为回文序列](/solution/2400-2499/2422.Merge%20Operations%20to%20Turn%20Array%20Into%20a%20Palindrome/README.md) | `贪心`,`数组`,`双指针` | 中等 | 🔒 | -| 2423 | [删除字符使频率相同](/solution/2400-2499/2423.Remove%20Letter%20To%20Equalize%20Frequency/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 88 场双周赛 | -| 2424 | [最长上传前缀](/solution/2400-2499/2424.Longest%20Uploaded%20Prefix/README.md) | `并查集`,`设计`,`树状数组`,`线段树`,`二分查找`,`有序集合`,`堆（优先队列）` | 中等 | 第 88 场双周赛 | -| 2425 | [所有数对的异或和](/solution/2400-2499/2425.Bitwise%20XOR%20of%20All%20Pairings/README.md) | `位运算`,`脑筋急转弯`,`数组` | 中等 | 第 88 场双周赛 | -| 2426 | [满足不等式的数对数目](/solution/2400-2499/2426.Number%20of%20Pairs%20Satisfying%20Inequality/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | 第 88 场双周赛 | -| 2427 | [公因子的数目](/solution/2400-2499/2427.Number%20of%20Common%20Factors/README.md) | `数学`,`枚举`,`数论` | 简单 | 第 313 场周赛 | -| 2428 | [沙漏的最大总和](/solution/2400-2499/2428.Maximum%20Sum%20of%20an%20Hourglass/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 313 场周赛 | -| 2429 | [最小异或](/solution/2400-2499/2429.Minimize%20XOR/README.md) | `贪心`,`位运算` | 中等 | 第 313 场周赛 | -| 2430 | [对字母串可执行的最大删除数](/solution/2400-2499/2430.Maximum%20Deletions%20on%20a%20String/README.md) | `字符串`,`动态规划`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 313 场周赛 | -| 2431 | [最大限度地提高购买水果的口味](/solution/2400-2499/2431.Maximize%20Total%20Tastiness%20of%20Purchased%20Fruits/README.md) | `数组`,`动态规划` | 中等 | 🔒 | -| 2432 | [处理用时最长的那个任务的员工](/solution/2400-2499/2432.The%20Employee%20That%20Worked%20on%20the%20Longest%20Task/README.md) | `数组` | 简单 | 第 314 场周赛 | -| 2433 | [找出前缀异或的原始数组](/solution/2400-2499/2433.Find%20The%20Original%20Array%20of%20Prefix%20Xor/README.md) | `位运算`,`数组` | 中等 | 第 314 场周赛 | -| 2434 | [使用机器人打印字典序最小的字符串](/solution/2400-2499/2434.Using%20a%20Robot%20to%20Print%20the%20Lexicographically%20Smallest%20String/README.md) | `栈`,`贪心`,`哈希表`,`字符串` | 中等 | 第 314 场周赛 | -| 2435 | [矩阵中和能被 K 整除的路径](/solution/2400-2499/2435.Paths%20in%20Matrix%20Whose%20Sum%20Is%20Divisible%20by%20K/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 314 场周赛 | -| 2436 | [使子数组最大公约数大于一的最小分割数](/solution/2400-2499/2436.Minimum%20Split%20Into%20Subarrays%20With%20GCD%20Greater%20Than%20One/README.md) | `贪心`,`数组`,`数学`,`动态规划`,`数论` | 中等 | 🔒 | -| 2437 | [有效时间的数目](/solution/2400-2499/2437.Number%20of%20Valid%20Clock%20Times/README.md) | `字符串`,`枚举` | 简单 | 第 89 场双周赛 | -| 2438 | [二的幂数组中查询范围内的乘积](/solution/2400-2499/2438.Range%20Product%20Queries%20of%20Powers/README.md) | `位运算`,`数组`,`前缀和` | 中等 | 第 89 场双周赛 | -| 2439 | [最小化数组中的最大值](/solution/2400-2499/2439.Minimize%20Maximum%20of%20Array/README.md) | `贪心`,`数组`,`二分查找`,`动态规划`,`前缀和` | 中等 | 第 89 场双周赛 | -| 2440 | [创建价值相同的连通块](/solution/2400-2499/2440.Create%20Components%20With%20Same%20Value/README.md) | `树`,`深度优先搜索`,`数组`,`数学`,`枚举` | 困难 | 第 89 场双周赛 | -| 2441 | [与对应负数同时存在的最大正整数](/solution/2400-2499/2441.Largest%20Positive%20Integer%20That%20Exists%20With%20Its%20Negative/README.md) | `数组`,`哈希表`,`双指针`,`排序` | 简单 | 第 315 场周赛 | -| 2442 | [反转之后不同整数的数目](/solution/2400-2499/2442.Count%20Number%20of%20Distinct%20Integers%20After%20Reverse%20Operations/README.md) | `数组`,`哈希表`,`数学` | 中等 | 第 315 场周赛 | -| 2443 | [反转之后的数字和](/solution/2400-2499/2443.Sum%20of%20Number%20and%20Its%20Reverse/README.md) | `数学`,`枚举` | 中等 | 第 315 场周赛 | -| 2444 | [统计定界子数组的数目](/solution/2400-2499/2444.Count%20Subarrays%20With%20Fixed%20Bounds/README.md) | `队列`,`数组`,`滑动窗口`,`单调队列` | 困难 | 第 315 场周赛 | -| 2445 | [值为 1 的节点数](/solution/2400-2499/2445.Number%20of%20Nodes%20With%20Value%20One/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | -| 2446 | [判断两个事件是否存在冲突](/solution/2400-2499/2446.Determine%20if%20Two%20Events%20Have%20Conflict/README.md) | `数组`,`字符串` | 简单 | 第 316 场周赛 | -| 2447 | [最大公因数等于 K 的子数组数目](/solution/2400-2499/2447.Number%20of%20Subarrays%20With%20GCD%20Equal%20to%20K/README.md) | `数组`,`数学`,`数论` | 中等 | 第 316 场周赛 | -| 2448 | [使数组相等的最小开销](/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README.md) | `贪心`,`数组`,`二分查找`,`前缀和`,`排序` | 困难 | 第 316 场周赛 | -| 2449 | [使数组相似的最少操作次数](/solution/2400-2499/2449.Minimum%20Number%20of%20Operations%20to%20Make%20Arrays%20Similar/README.md) | `贪心`,`数组`,`排序` | 困难 | 第 316 场周赛 | -| 2450 | [应用操作后不同二进制字符串的数量](/solution/2400-2499/2450.Number%20of%20Distinct%20Binary%20Strings%20After%20Applying%20Operations/README.md) | `数学`,`字符串` | 中等 | 🔒 | -| 2451 | [差值数组不同的字符串](/solution/2400-2499/2451.Odd%20String%20Difference/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 90 场双周赛 | -| 2452 | [距离字典两次编辑以内的单词](/solution/2400-2499/2452.Words%20Within%20Two%20Edits%20of%20Dictionary/README.md) | `数组`,`字符串` | 中等 | 第 90 场双周赛 | -| 2453 | [摧毁一系列目标](/solution/2400-2499/2453.Destroy%20Sequential%20Targets/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 90 场双周赛 | -| 2454 | [下一个更大元素 IV](/solution/2400-2499/2454.Next%20Greater%20Element%20IV/README.md) | `栈`,`数组`,`二分查找`,`排序`,`单调栈`,`堆（优先队列）` | 困难 | 第 90 场双周赛 | -| 2455 | [可被三整除的偶数的平均值](/solution/2400-2499/2455.Average%20Value%20of%20Even%20Numbers%20That%20Are%20Divisible%20by%20Three/README.md) | `数组`,`数学` | 简单 | 第 317 场周赛 | -| 2456 | [最流行的视频创作者](/solution/2400-2499/2456.Most%20Popular%20Video%20Creator/README.md) | `数组`,`哈希表`,`字符串`,`排序`,`堆（优先队列）` | 中等 | 第 317 场周赛 | -| 2457 | [美丽整数的最小增量](/solution/2400-2499/2457.Minimum%20Addition%20to%20Make%20Integer%20Beautiful/README.md) | `贪心`,`数学` | 中等 | 第 317 场周赛 | -| 2458 | [移除子树后的二叉树高度](/solution/2400-2499/2458.Height%20of%20Binary%20Tree%20After%20Subtree%20Removal%20Queries/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组`,`二叉树` | 困难 | 第 317 场周赛 | -| 2459 | [通过移动项目到空白区域来排序数组](/solution/2400-2499/2459.Sort%20Array%20by%20Moving%20Items%20to%20Empty%20Space/README.md) | `贪心`,`数组`,`排序` | 困难 | 🔒 | -| 2460 | [对数组执行操作](/solution/2400-2499/2460.Apply%20Operations%20to%20an%20Array/README.md) | `数组`,`双指针`,`模拟` | 简单 | 第 318 场周赛 | -| 2461 | [长度为 K 子数组中的最大和](/solution/2400-2499/2461.Maximum%20Sum%20of%20Distinct%20Subarrays%20With%20Length%20K/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 318 场周赛 | -| 2462 | [雇佣 K 位工人的总代价](/solution/2400-2499/2462.Total%20Cost%20to%20Hire%20K%20Workers/README.md) | `数组`,`双指针`,`模拟`,`堆（优先队列）` | 中等 | 第 318 场周赛 | -| 2463 | [最小移动总距离](/solution/2400-2499/2463.Minimum%20Total%20Distance%20Traveled/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 318 场周赛 | -| 2464 | [有效分割中的最少子数组数目](/solution/2400-2499/2464.Minimum%20Subarrays%20in%20a%20Valid%20Split/README.md) | `数组`,`数学`,`动态规划`,`数论` | 中等 | 🔒 | -| 2465 | [不同的平均值数目](/solution/2400-2499/2465.Number%20of%20Distinct%20Averages/README.md) | `数组`,`哈希表`,`双指针`,`排序` | 简单 | 第 91 场双周赛 | -| 2466 | [统计构造好字符串的方案数](/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README.md) | `动态规划` | 中等 | 第 91 场双周赛 | -| 2467 | [树上最大得分和路径](/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`图`,`数组` | 中等 | 第 91 场双周赛 | -| 2468 | [根据限制分割消息](/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README.md) | `字符串`,`二分查找` | 困难 | 第 91 场双周赛 | -| 2469 | [温度转换](/solution/2400-2499/2469.Convert%20the%20Temperature/README.md) | `数学` | 简单 | 第 319 场周赛 | -| 2470 | [最小公倍数为 K 的子数组数目](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README.md) | `数组`,`数学`,`数论` | 中等 | 第 319 场周赛 | -| 2471 | [逐层排序二叉树所需的最少操作数目](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | 第 319 场周赛 | -| 2472 | [不重叠回文子字符串的最大数目](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README.md) | `字符串`,`动态规划` | 困难 | 第 319 场周赛 | -| 2473 | [购买苹果的最低成本](/solution/2400-2499/2473.Minimum%20Cost%20to%20Buy%20Apples/README.md) | `图`,`数组`,`最短路`,`堆（优先队列）` | 中等 | 🔒 | -| 2474 | [购买量严格增加的客户](/solution/2400-2499/2474.Customers%20With%20Strictly%20Increasing%20Purchases/README.md) | `数据库` | 困难 | 🔒 | -| 2475 | [数组中不等三元组的数目](/solution/2400-2499/2475.Number%20of%20Unequal%20Triplets%20in%20Array/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 320 场周赛 | -| 2476 | [二叉搜索树最近节点查询](/solution/2400-2499/2476.Closest%20Nodes%20Queries%20in%20a%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`数组`,`二分查找`,`二叉树` | 中等 | 第 320 场周赛 | -| 2477 | [到达首都的最少油耗](/solution/2400-2499/2477.Minimum%20Fuel%20Cost%20to%20Report%20to%20the%20Capital/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`图` | 中等 | 第 320 场周赛 | -| 2478 | [完美分割的方案数](/solution/2400-2499/2478.Number%20of%20Beautiful%20Partitions/README.md) | `字符串`,`动态规划` | 困难 | 第 320 场周赛 | -| 2479 | [两个不重叠子树的最大异或值](/solution/2400-2499/2479.Maximum%20XOR%20of%20Two%20Non-Overlapping%20Subtrees/README.md) | `树`,`深度优先搜索`,`图`,`字典树` | 困难 | 🔒 | -| 2480 | [形成化学键](/solution/2400-2499/2480.Form%20a%20Chemical%20Bond/README.md) | `数据库` | 简单 | 🔒 | -| 2481 | [分割圆的最少切割次数](/solution/2400-2499/2481.Minimum%20Cuts%20to%20Divide%20a%20Circle/README.md) | `几何`,`数学` | 简单 | 第 92 场双周赛 | -| 2482 | [行和列中一和零的差值](/solution/2400-2499/2482.Difference%20Between%20Ones%20and%20Zeros%20in%20Row%20and%20Column/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 92 场双周赛 | -| 2483 | [商店的最少代价](/solution/2400-2499/2483.Minimum%20Penalty%20for%20a%20Shop/README.md) | `字符串`,`前缀和` | 中等 | 第 92 场双周赛 | -| 2484 | [统计回文子序列数目](/solution/2400-2499/2484.Count%20Palindromic%20Subsequences/README.md) | `字符串`,`动态规划` | 困难 | 第 92 场双周赛 | -| 2485 | [找出中枢整数](/solution/2400-2499/2485.Find%20the%20Pivot%20Integer/README.md) | `数学`,`前缀和` | 简单 | 第 321 场周赛 | -| 2486 | [追加字符以获得子序列](/solution/2400-2499/2486.Append%20Characters%20to%20String%20to%20Make%20Subsequence/README.md) | `贪心`,`双指针`,`字符串` | 中等 | 第 321 场周赛 | -| 2487 | [从链表中移除节点](/solution/2400-2499/2487.Remove%20Nodes%20From%20Linked%20List/README.md) | `栈`,`递归`,`链表`,`单调栈` | 中等 | 第 321 场周赛 | -| 2488 | [统计中位数为 K 的子数组](/solution/2400-2499/2488.Count%20Subarrays%20With%20Median%20K/README.md) | `数组`,`哈希表`,`前缀和` | 困难 | 第 321 场周赛 | -| 2489 | [固定比率的子字符串数](/solution/2400-2499/2489.Number%20of%20Substrings%20With%20Fixed%20Ratio/README.md) | `哈希表`,`数学`,`字符串`,`前缀和` | 中等 | 🔒 | -| 2490 | [回环句](/solution/2400-2499/2490.Circular%20Sentence/README.md) | `字符串` | 简单 | 第 322 场周赛 | -| 2491 | [划分技能点相等的团队](/solution/2400-2499/2491.Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/README.md) | `数组`,`哈希表`,`双指针`,`排序` | 中等 | 第 322 场周赛 | -| 2492 | [两个城市间路径的最小分数](/solution/2400-2499/2492.Minimum%20Score%20of%20a%20Path%20Between%20Two%20Cities/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 第 322 场周赛 | -| 2493 | [将节点分成尽可能多的组](/solution/2400-2499/2493.Divide%20Nodes%20Into%20the%20Maximum%20Number%20of%20Groups/README.md) | `广度优先搜索`,`并查集`,`图` | 困难 | 第 322 场周赛 | -| 2494 | [合并在同一个大厅重叠的活动](/solution/2400-2499/2494.Merge%20Overlapping%20Events%20in%20the%20Same%20Hall/README.md) | `数据库` | 困难 | 🔒 | -| 2495 | [乘积为偶数的子数组数](/solution/2400-2499/2495.Number%20of%20Subarrays%20Having%20Even%20Product/README.md) | `数组`,`数学`,`动态规划` | 中等 | 🔒 | -| 2496 | [数组中字符串的最大值](/solution/2400-2499/2496.Maximum%20Value%20of%20a%20String%20in%20an%20Array/README.md) | `数组`,`字符串` | 简单 | 第 93 场双周赛 | -| 2497 | [图中最大星和](/solution/2400-2499/2497.Maximum%20Star%20Sum%20of%20a%20Graph/README.md) | `贪心`,`图`,`数组`,`排序`,`堆（优先队列）` | 中等 | 第 93 场双周赛 | -| 2498 | [青蛙过河 II](/solution/2400-2499/2498.Frog%20Jump%20II/README.md) | `贪心`,`数组`,`二分查找` | 中等 | 第 93 场双周赛 | -| 2499 | [让数组不相等的最小总代价](/solution/2400-2499/2499.Minimum%20Total%20Cost%20to%20Make%20Arrays%20Unequal/README.md) | `贪心`,`数组`,`哈希表`,`计数` | 困难 | 第 93 场双周赛 | -| 2500 | [删除每行中的最大值](/solution/2500-2599/2500.Delete%20Greatest%20Value%20in%20Each%20Row/README.md) | `数组`,`矩阵`,`排序`,`模拟`,`堆（优先队列）` | 简单 | 第 323 场周赛 | -| 2501 | [数组中最长的方波](/solution/2500-2599/2501.Longest%20Square%20Streak%20in%20an%20Array/README.md) | `数组`,`哈希表`,`二分查找`,`动态规划`,`排序` | 中等 | 第 323 场周赛 | -| 2502 | [设计内存分配器](/solution/2500-2599/2502.Design%20Memory%20Allocator/README.md) | `设计`,`数组`,`哈希表`,`模拟` | 中等 | 第 323 场周赛 | -| 2503 | [矩阵查询可获得的最大分数](/solution/2500-2599/2503.Maximum%20Number%20of%20Points%20From%20Grid%20Queries/README.md) | `广度优先搜索`,`并查集`,`数组`,`双指针`,`矩阵`,`排序`,`堆（优先队列）` | 困难 | 第 323 场周赛 | -| 2504 | [把名字和职业联系起来](/solution/2500-2599/2504.Concatenate%20the%20Name%20and%20the%20Profession/README.md) | `数据库` | 简单 | 🔒 | -| 2505 | [所有子序列和的按位或](/solution/2500-2599/2505.Bitwise%20OR%20of%20All%20Subsequence%20Sums/README.md) | `位运算`,`脑筋急转弯`,`数组`,`数学` | 中等 | 🔒 | -| 2506 | [统计相似字符串对的数目](/solution/2500-2599/2506.Count%20Pairs%20Of%20Similar%20Strings/README.md) | `位运算`,`数组`,`哈希表`,`字符串` | 简单 | 第 324 场周赛 | -| 2507 | [使用质因数之和替换后可以取到的最小值](/solution/2500-2599/2507.Smallest%20Value%20After%20Replacing%20With%20Sum%20of%20Prime%20Factors/README.md) | `数学`,`数论`,`模拟` | 中等 | 第 324 场周赛 | -| 2508 | [添加边使所有节点度数都为偶数](/solution/2500-2599/2508.Add%20Edges%20to%20Make%20Degrees%20of%20All%20Nodes%20Even/README.md) | `图`,`哈希表` | 困难 | 第 324 场周赛 | -| 2509 | [查询树中环的长度](/solution/2500-2599/2509.Cycle%20Length%20Queries%20in%20a%20Tree/README.md) | `树`,`数组`,`二叉树` | 困难 | 第 324 场周赛 | -| 2510 | [检查是否有路径经过相同数量的 0 和 1](/solution/2500-2599/2510.Check%20if%20There%20is%20a%20Path%20With%20Equal%20Number%20of%200%27s%20And%201%27s/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 🔒 | -| 2511 | [最多可以摧毁的敌人城堡数目](/solution/2500-2599/2511.Maximum%20Enemy%20Forts%20That%20Can%20Be%20Captured/README.md) | `数组`,`双指针` | 简单 | 第 94 场双周赛 | -| 2512 | [奖励最顶尖的 K 名学生](/solution/2500-2599/2512.Reward%20Top%20K%20Students/README.md) | `数组`,`哈希表`,`字符串`,`排序`,`堆（优先队列）` | 中等 | 第 94 场双周赛 | -| 2513 | [最小化两个数组中的最大值](/solution/2500-2599/2513.Minimize%20the%20Maximum%20of%20Two%20Arrays/README.md) | `数学`,`二分查找`,`数论` | 中等 | 第 94 场双周赛 | -| 2514 | [统计同位异构字符串数目](/solution/2500-2599/2514.Count%20Anagrams/README.md) | `哈希表`,`数学`,`字符串`,`组合数学`,`计数` | 困难 | 第 94 场双周赛 | -| 2515 | [到目标字符串的最短距离](/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README.md) | `数组`,`字符串` | 简单 | 第 325 场周赛 | -| 2516 | [每种字符至少取 K 个](/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 第 325 场周赛 | -| 2517 | [礼盒的最大甜蜜度](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README.md) | `贪心`,`数组`,`二分查找`,`排序` | 中等 | 第 325 场周赛 | -| 2518 | [好分区的数目](/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README.md) | `数组`,`动态规划` | 困难 | 第 325 场周赛 | -| 2519 | [统计 K-Big 索引的数量](/solution/2500-2599/2519.Count%20the%20Number%20of%20K-Big%20Indices/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | 🔒 | -| 2520 | [统计能整除数字的位数](/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README.md) | `数学` | 简单 | 第 326 场周赛 | -| 2521 | [数组乘积中的不同质因数数目](/solution/2500-2599/2521.Distinct%20Prime%20Factors%20of%20Product%20of%20Array/README.md) | `数组`,`哈希表`,`数学`,`数论` | 中等 | 第 326 场周赛 | -| 2522 | [将字符串分割成值不超过 K 的子字符串](/solution/2500-2599/2522.Partition%20String%20Into%20Substrings%20With%20Values%20at%20Most%20K/README.md) | `贪心`,`字符串`,`动态规划` | 中等 | 第 326 场周赛 | -| 2523 | [范围内最接近的两个质数](/solution/2500-2599/2523.Closest%20Prime%20Numbers%20in%20Range/README.md) | `数学`,`数论` | 中等 | 第 326 场周赛 | -| 2524 | [子数组的最大频率分数](/solution/2500-2599/2524.Maximum%20Frequency%20Score%20of%20a%20Subarray/README.md) | `数组`,`哈希表`,`数学`,`滑动窗口` | 困难 | 🔒 | -| 2525 | [根据规则将箱子分类](/solution/2500-2599/2525.Categorize%20Box%20According%20to%20Criteria/README.md) | `数学` | 简单 | 第 95 场双周赛 | -| 2526 | [找到数据流中的连续整数](/solution/2500-2599/2526.Find%20Consecutive%20Integers%20from%20a%20Data%20Stream/README.md) | `设计`,`队列`,`哈希表`,`计数`,`数据流` | 中等 | 第 95 场双周赛 | -| 2527 | [查询数组异或美丽值](/solution/2500-2599/2527.Find%20Xor-Beauty%20of%20Array/README.md) | `位运算`,`数组`,`数学` | 中等 | 第 95 场双周赛 | -| 2528 | [最大化城市的最小电量](/solution/2500-2599/2528.Maximize%20the%20Minimum%20Powered%20City/README.md) | `贪心`,`队列`,`数组`,`二分查找`,`前缀和`,`滑动窗口` | 困难 | 第 95 场双周赛 | -| 2529 | [正整数和负整数的最大计数](/solution/2500-2599/2529.Maximum%20Count%20of%20Positive%20Integer%20and%20Negative%20Integer/README.md) | `数组`,`二分查找`,`计数` | 简单 | 第 327 场周赛 | -| 2530 | [执行 K 次操作后的最大分数](/solution/2500-2599/2530.Maximal%20Score%20After%20Applying%20K%20Operations/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 327 场周赛 | -| 2531 | [使字符串中不同字符的数目相等](/solution/2500-2599/2531.Make%20Number%20of%20Distinct%20Characters%20Equal/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 327 场周赛 | -| 2532 | [过桥的时间](/solution/2500-2599/2532.Time%20to%20Cross%20a%20Bridge/README.md) | `数组`,`模拟`,`堆（优先队列）` | 困难 | 第 327 场周赛 | -| 2533 | [好二进制字符串的数量](/solution/2500-2599/2533.Number%20of%20Good%20Binary%20Strings/README.md) | `动态规划` | 中等 | 🔒 | -| 2534 | [通过门的时间](/solution/2500-2599/2534.Time%20Taken%20to%20Cross%20the%20Door/README.md) | `队列`,`数组`,`模拟` | 困难 | 🔒 | -| 2535 | [数组元素和与数字和的绝对差](/solution/2500-2599/2535.Difference%20Between%20Element%20Sum%20and%20Digit%20Sum%20of%20an%20Array/README.md) | `数组`,`数学` | 简单 | 第 328 场周赛 | -| 2536 | [子矩阵元素加 1](/solution/2500-2599/2536.Increment%20Submatrices%20by%20One/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 328 场周赛 | -| 2537 | [统计好子数组的数目](/solution/2500-2599/2537.Count%20the%20Number%20of%20Good%20Subarrays/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 328 场周赛 | -| 2538 | [最大价值和与最小价值和的差值](/solution/2500-2599/2538.Difference%20Between%20Maximum%20and%20Minimum%20Price%20Sum/README.md) | `树`,`深度优先搜索`,`数组`,`动态规划` | 困难 | 第 328 场周赛 | -| 2539 | [好子序列的个数](/solution/2500-2599/2539.Count%20the%20Number%20of%20Good%20Subsequences/README.md) | `哈希表`,`数学`,`字符串`,`组合数学`,`计数` | 中等 | 🔒 | -| 2540 | [最小公共值](/solution/2500-2599/2540.Minimum%20Common%20Value/README.md) | `数组`,`哈希表`,`双指针`,`二分查找` | 简单 | 第 96 场双周赛 | -| 2541 | [使数组中所有元素相等的最小操作数 II](/solution/2500-2599/2541.Minimum%20Operations%20to%20Make%20Array%20Equal%20II/README.md) | `贪心`,`数组`,`数学` | 中等 | 第 96 场双周赛 | -| 2542 | [最大子序列的分数](/solution/2500-2599/2542.Maximum%20Subsequence%20Score/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 中等 | 第 96 场双周赛 | -| 2543 | [判断一个点是否可以到达](/solution/2500-2599/2543.Check%20if%20Point%20Is%20Reachable/README.md) | `数学`,`数论` | 困难 | 第 96 场双周赛 | -| 2544 | [交替数字和](/solution/2500-2599/2544.Alternating%20Digit%20Sum/README.md) | `数学` | 简单 | 第 329 场周赛 | -| 2545 | [根据第 K 场考试的分数排序](/solution/2500-2599/2545.Sort%20the%20Students%20by%20Their%20Kth%20Score/README.md) | `数组`,`矩阵`,`排序` | 中等 | 第 329 场周赛 | -| 2546 | [执行逐位运算使字符串相等](/solution/2500-2599/2546.Apply%20Bitwise%20Operations%20to%20Make%20Strings%20Equal/README.md) | `位运算`,`字符串` | 中等 | 第 329 场周赛 | -| 2547 | [拆分数组的最小代价](/solution/2500-2599/2547.Minimum%20Cost%20to%20Split%20an%20Array/README.md) | `数组`,`哈希表`,`动态规划`,`计数` | 困难 | 第 329 场周赛 | -| 2548 | [填满背包的最大价格](/solution/2500-2599/2548.Maximum%20Price%20to%20Fill%20a%20Bag/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | -| 2549 | [统计桌面上的不同数字](/solution/2500-2599/2549.Count%20Distinct%20Numbers%20on%20Board/README.md) | `数组`,`哈希表`,`数学`,`模拟` | 简单 | 第 330 场周赛 | -| 2550 | [猴子碰撞的方法数](/solution/2500-2599/2550.Count%20Collisions%20of%20Monkeys%20on%20a%20Polygon/README.md) | `递归`,`数学` | 中等 | 第 330 场周赛 | -| 2551 | [将珠子放入背包中](/solution/2500-2599/2551.Put%20Marbles%20in%20Bags/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 困难 | 第 330 场周赛 | -| 2552 | [统计上升四元组](/solution/2500-2599/2552.Count%20Increasing%20Quadruplets/README.md) | `树状数组`,`数组`,`动态规划`,`枚举`,`前缀和` | 困难 | 第 330 场周赛 | -| 2553 | [分割数组中数字的数位](/solution/2500-2599/2553.Separate%20the%20Digits%20in%20an%20Array/README.md) | `数组`,`模拟` | 简单 | 第 97 场双周赛 | -| 2554 | [从一个范围内选择最多整数 I](/solution/2500-2599/2554.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20I/README.md) | `贪心`,`数组`,`哈希表`,`二分查找`,`排序` | 中等 | 第 97 场双周赛 | -| 2555 | [两个线段获得的最多奖品](/solution/2500-2599/2555.Maximize%20Win%20From%20Two%20Segments/README.md) | `数组`,`二分查找`,`滑动窗口` | 中等 | 第 97 场双周赛 | -| 2556 | [二进制矩阵中翻转最多一次使路径不连通](/solution/2500-2599/2556.Disconnect%20Path%20in%20a%20Binary%20Matrix%20by%20at%20Most%20One%20Flip/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`动态规划`,`矩阵` | 中等 | 第 97 场双周赛 | -| 2557 | [从一个范围内选择最多整数 II](/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README.md) | `贪心`,`数组`,`二分查找`,`排序` | 中等 | 🔒 | -| 2558 | [从数量最多的堆取走礼物](/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README.md) | `数组`,`模拟`,`堆（优先队列）` | 简单 | 第 331 场周赛 | -| 2559 | [统计范围内的元音字符串数](/solution/2500-2599/2559.Count%20Vowel%20Strings%20in%20Ranges/README.md) | `数组`,`字符串`,`前缀和` | 中等 | 第 331 场周赛 | -| 2560 | [打家劫舍 IV](/solution/2500-2599/2560.House%20Robber%20IV/README.md) | `数组`,`二分查找` | 中等 | 第 331 场周赛 | -| 2561 | [重排水果](/solution/2500-2599/2561.Rearranging%20Fruits/README.md) | `贪心`,`数组`,`哈希表` | 困难 | 第 331 场周赛 | -| 2562 | [找出数组的串联值](/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README.md) | `数组`,`双指针`,`模拟` | 简单 | 第 332 场周赛 | -| 2563 | [统计公平数对的数目](/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 332 场周赛 | -| 2564 | [子字符串异或查询](/solution/2500-2599/2564.Substring%20XOR%20Queries/README.md) | `位运算`,`数组`,`哈希表`,`字符串` | 中等 | 第 332 场周赛 | -| 2565 | [最少得分子序列](/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README.md) | `双指针`,`字符串`,`二分查找` | 困难 | 第 332 场周赛 | -| 2566 | [替换一个数字后的最大差值](/solution/2500-2599/2566.Maximum%20Difference%20by%20Remapping%20a%20Digit/README.md) | `贪心`,`数学` | 简单 | 第 98 场双周赛 | -| 2567 | [修改两个元素的最小分数](/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 98 场双周赛 | -| 2568 | [最小无法得到的或值](/solution/2500-2599/2568.Minimum%20Impossible%20OR/README.md) | `位运算`,`脑筋急转弯`,`数组` | 中等 | 第 98 场双周赛 | -| 2569 | [更新数组后处理求和查询](/solution/2500-2599/2569.Handling%20Sum%20Queries%20After%20Update/README.md) | `线段树`,`数组` | 困难 | 第 98 场双周赛 | -| 2570 | [合并两个二维数组 - 求和法](/solution/2500-2599/2570.Merge%20Two%202D%20Arrays%20by%20Summing%20Values/README.md) | `数组`,`哈希表`,`双指针` | 简单 | 第 333 场周赛 | -| 2571 | [将整数减少到零需要的最少操作数](/solution/2500-2599/2571.Minimum%20Operations%20to%20Reduce%20an%20Integer%20to%200/README.md) | `贪心`,`位运算`,`动态规划` | 中等 | 第 333 场周赛 | -| 2572 | [无平方子集计数](/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README.md) | `位运算`,`数组`,`数学`,`动态规划`,`状态压缩` | 中等 | 第 333 场周赛 | -| 2573 | [找出对应 LCP 矩阵的字符串](/solution/2500-2599/2573.Find%20the%20String%20with%20LCP/README.md) | `贪心`,`并查集`,`数组`,`字符串`,`动态规划`,`矩阵` | 困难 | 第 333 场周赛 | -| 2574 | [左右元素和的差值](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README.md) | `数组`,`前缀和` | 简单 | 第 334 场周赛 | -| 2575 | [找出字符串的可整除数组](/solution/2500-2599/2575.Find%20the%20Divisibility%20Array%20of%20a%20String/README.md) | `数组`,`数学`,`字符串` | 中等 | 第 334 场周赛 | -| 2576 | [求出最多标记下标](/solution/2500-2599/2576.Find%20the%20Maximum%20Number%20of%20Marked%20Indices/README.md) | `贪心`,`数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 334 场周赛 | -| 2577 | [在网格图中访问一个格子的最少时间](/solution/2500-2599/2577.Minimum%20Time%20to%20Visit%20a%20Cell%20In%20a%20Grid/README.md) | `广度优先搜索`,`图`,`数组`,`矩阵`,`最短路`,`堆（优先队列）` | 困难 | 第 334 场周赛 | -| 2578 | [最小和分割](/solution/2500-2599/2578.Split%20With%20Minimum%20Sum/README.md) | `贪心`,`数学`,`排序` | 简单 | 第 99 场双周赛 | -| 2579 | [统计染色格子数](/solution/2500-2599/2579.Count%20Total%20Number%20of%20Colored%20Cells/README.md) | `数学` | 中等 | 第 99 场双周赛 | -| 2580 | [统计将重叠区间合并成组的方案数](/solution/2500-2599/2580.Count%20Ways%20to%20Group%20Overlapping%20Ranges/README.md) | `数组`,`排序` | 中等 | 第 99 场双周赛 | -| 2581 | [统计可能的树根数目](/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README.md) | `树`,`深度优先搜索`,`哈希表`,`动态规划` | 困难 | 第 99 场双周赛 | -| 2582 | [递枕头](/solution/2500-2599/2582.Pass%20the%20Pillow/README.md) | `数学`,`模拟` | 简单 | 第 335 场周赛 | -| 2583 | [二叉树中的第 K 大层和](/solution/2500-2599/2583.Kth%20Largest%20Sum%20in%20a%20Binary%20Tree/README.md) | `树`,`广度优先搜索`,`二叉树`,`排序` | 中等 | 第 335 场周赛 | -| 2584 | [分割数组使乘积互质](/solution/2500-2599/2584.Split%20the%20Array%20to%20Make%20Coprime%20Products/README.md) | `数组`,`哈希表`,`数学`,`数论` | 困难 | 第 335 场周赛 | -| 2585 | [获得分数的方法数](/solution/2500-2599/2585.Number%20of%20Ways%20to%20Earn%20Points/README.md) | `数组`,`动态规划` | 困难 | 第 335 场周赛 | -| 2586 | [统计范围内的元音字符串数](/solution/2500-2599/2586.Count%20the%20Number%20of%20Vowel%20Strings%20in%20Range/README.md) | `数组`,`字符串` | 简单 | 第 336 场周赛 | -| 2587 | [重排数组以得到最大前缀分数](/solution/2500-2599/2587.Rearrange%20Array%20to%20Maximize%20Prefix%20Score/README.md) | `贪心`,`数组`,`前缀和`,`排序` | 中等 | 第 336 场周赛 | -| 2588 | [统计美丽子数组数目](/solution/2500-2599/2588.Count%20the%20Number%20of%20Beautiful%20Subarrays/README.md) | `位运算`,`数组`,`哈希表`,`前缀和` | 中等 | 第 336 场周赛 | -| 2589 | [完成所有任务的最少时间](/solution/2500-2599/2589.Minimum%20Time%20to%20Complete%20All%20Tasks/README.md) | `栈`,`贪心`,`数组`,`二分查找`,`排序` | 困难 | 第 336 场周赛 | -| 2590 | [设计一个待办事项清单](/solution/2500-2599/2590.Design%20a%20Todo%20List/README.md) | `设计`,`数组`,`哈希表`,`字符串`,`排序` | 中等 | 🔒 | -| 2591 | [将钱分给最多的儿童](/solution/2500-2599/2591.Distribute%20Money%20to%20Maximum%20Children/README.md) | `贪心`,`数学` | 简单 | 第 100 场双周赛 | -| 2592 | [最大化数组的伟大值](/solution/2500-2599/2592.Maximize%20Greatness%20of%20an%20Array/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 100 场双周赛 | -| 2593 | [标记所有元素后数组的分数](/solution/2500-2599/2593.Find%20Score%20of%20an%20Array%20After%20Marking%20All%20Elements/README.md) | `数组`,`哈希表`,`排序`,`模拟`,`堆（优先队列）` | 中等 | 第 100 场双周赛 | -| 2594 | [修车的最少时间](/solution/2500-2599/2594.Minimum%20Time%20to%20Repair%20Cars/README.md) | `数组`,`二分查找` | 中等 | 第 100 场双周赛 | -| 2595 | [奇偶位数](/solution/2500-2599/2595.Number%20of%20Even%20and%20Odd%20Bits/README.md) | `位运算` | 简单 | 第 337 场周赛 | -| 2596 | [检查骑士巡视方案](/solution/2500-2599/2596.Check%20Knight%20Tour%20Configuration/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵`,`模拟` | 中等 | 第 337 场周赛 | -| 2597 | [美丽子集的数目](/solution/2500-2599/2597.The%20Number%20of%20Beautiful%20Subsets/README.md) | `数组`,`动态规划`,`回溯`,`排序` | 中等 | 第 337 场周赛 | -| 2598 | [执行操作后的最大 MEX](/solution/2500-2599/2598.Smallest%20Missing%20Non-negative%20Integer%20After%20Operations/README.md) | `贪心`,`数组`,`哈希表`,`数学` | 中等 | 第 337 场周赛 | -| 2599 | [使前缀和数组非负](/solution/2500-2599/2599.Make%20the%20Prefix%20Sum%20Non-negative/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 🔒 | -| 2600 | [K 件物品的最大和](/solution/2600-2699/2600.K%20Items%20With%20the%20Maximum%20Sum/README.md) | `贪心`,`数学` | 简单 | 第 338 场周赛 | -| 2601 | [质数减法运算](/solution/2600-2699/2601.Prime%20Subtraction%20Operation/README.md) | `贪心`,`数组`,`数学`,`二分查找`,`数论` | 中等 | 第 338 场周赛 | -| 2602 | [使数组元素全部相等的最少操作次数](/solution/2600-2699/2602.Minimum%20Operations%20to%20Make%20All%20Array%20Elements%20Equal/README.md) | `数组`,`二分查找`,`前缀和`,`排序` | 中等 | 第 338 场周赛 | -| 2603 | [收集树中金币](/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README.md) | `树`,`图`,`拓扑排序`,`数组` | 困难 | 第 338 场周赛 | -| 2604 | [吃掉所有谷子的最短时间](/solution/2600-2699/2604.Minimum%20Time%20to%20Eat%20All%20Grains/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 困难 | 🔒 | -| 2605 | [从两个数字数组里生成最小数字](/solution/2600-2699/2605.Form%20Smallest%20Number%20From%20Two%20Digit%20Arrays/README.md) | `数组`,`哈希表`,`枚举` | 简单 | 第 101 场双周赛 | -| 2606 | [找到最大开销的子字符串](/solution/2600-2699/2606.Find%20the%20Substring%20With%20Maximum%20Cost/README.md) | `数组`,`哈希表`,`字符串`,`动态规划` | 中等 | 第 101 场双周赛 | -| 2607 | [使子数组元素和相等](/solution/2600-2699/2607.Make%20K-Subarray%20Sums%20Equal/README.md) | `数组`,`数学`,`数论`,`排序` | 中等 | 第 101 场双周赛 | -| 2608 | [图中的最短环](/solution/2600-2699/2608.Shortest%20Cycle%20in%20a%20Graph/README.md) | `广度优先搜索`,`图` | 困难 | 第 101 场双周赛 | -| 2609 | [最长平衡子字符串](/solution/2600-2699/2609.Find%20the%20Longest%20Balanced%20Substring%20of%20a%20Binary%20String/README.md) | `字符串` | 简单 | 第 339 场周赛 | -| 2610 | [转换二维数组](/solution/2600-2699/2610.Convert%20an%20Array%20Into%20a%202D%20Array%20With%20Conditions/README.md) | `数组`,`哈希表` | 中等 | 第 339 场周赛 | -| 2611 | [老鼠和奶酪](/solution/2600-2699/2611.Mice%20and%20Cheese/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 中等 | 第 339 场周赛 | -| 2612 | [最少翻转操作数](/solution/2600-2699/2612.Minimum%20Reverse%20Operations/README.md) | `广度优先搜索`,`数组`,`有序集合` | 困难 | 第 339 场周赛 | -| 2613 | [美数对](/solution/2600-2699/2613.Beautiful%20Pairs/README.md) | `几何`,`数组`,`数学`,`分治`,`有序集合`,`排序` | 困难 | 🔒 | -| 2614 | [对角线上的质数](/solution/2600-2699/2614.Prime%20In%20Diagonal/README.md) | `数组`,`数学`,`矩阵`,`数论` | 简单 | 第 340 场周赛 | -| 2615 | [等值距离和](/solution/2600-2699/2615.Sum%20of%20Distances/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 340 场周赛 | -| 2616 | [最小化数对的最大差值](/solution/2600-2699/2616.Minimize%20the%20Maximum%20Difference%20of%20Pairs/README.md) | `贪心`,`数组`,`二分查找` | 中等 | 第 340 场周赛 | -| 2617 | [网格图中最少访问的格子数](/solution/2600-2699/2617.Minimum%20Number%20of%20Visited%20Cells%20in%20a%20Grid/README.md) | `栈`,`广度优先搜索`,`并查集`,`数组`,`动态规划`,`矩阵`,`单调栈`,`堆（优先队列）` | 困难 | 第 340 场周赛 | -| 2618 | [检查是否是类的对象实例](/solution/2600-2699/2618.Check%20if%20Object%20Instance%20of%20Class/README.md) | | 中等 | | -| 2619 | [数组原型对象的最后一个元素](/solution/2600-2699/2619.Array%20Prototype%20Last/README.md) | | 简单 | | -| 2620 | [计数器](/solution/2600-2699/2620.Counter/README.md) | | 简单 | | -| 2621 | [睡眠函数](/solution/2600-2699/2621.Sleep/README.md) | | 简单 | | -| 2622 | [有时间限制的缓存](/solution/2600-2699/2622.Cache%20With%20Time%20Limit/README.md) | | 中等 | | -| 2623 | [记忆函数](/solution/2600-2699/2623.Memoize/README.md) | | 中等 | | -| 2624 | [蜗牛排序](/solution/2600-2699/2624.Snail%20Traversal/README.md) | | 中等 | | -| 2625 | [扁平化嵌套数组](/solution/2600-2699/2625.Flatten%20Deeply%20Nested%20Array/README.md) | | 中等 | | -| 2626 | [数组归约运算](/solution/2600-2699/2626.Array%20Reduce%20Transformation/README.md) | | 简单 | | -| 2627 | [函数防抖](/solution/2600-2699/2627.Debounce/README.md) | | 中等 | | -| 2628 | [完全相等的 JSON 字符串](/solution/2600-2699/2628.JSON%20Deep%20Equal/README.md) | | 中等 | 🔒 | -| 2629 | [复合函数](/solution/2600-2699/2629.Function%20Composition/README.md) | | 简单 | | -| 2630 | [记忆函数 II](/solution/2600-2699/2630.Memoize%20II/README.md) | | 困难 | | -| 2631 | [分组](/solution/2600-2699/2631.Group%20By/README.md) | | 中等 | | -| 2632 | [柯里化](/solution/2600-2699/2632.Curry/README.md) | | 中等 | 🔒 | -| 2633 | [将对象转换为 JSON 字符串](/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README.md) | | 中等 | 🔒 | -| 2634 | [过滤数组中的元素](/solution/2600-2699/2634.Filter%20Elements%20from%20Array/README.md) | | 简单 | | -| 2635 | [转换数组中的每个元素](/solution/2600-2699/2635.Apply%20Transform%20Over%20Each%20Element%20in%20Array/README.md) | | 简单 | | -| 2636 | [Promise 对象池](/solution/2600-2699/2636.Promise%20Pool/README.md) | | 中等 | 🔒 | -| 2637 | [有时间限制的 Promise 对象](/solution/2600-2699/2637.Promise%20Time%20Limit/README.md) | | 中等 | | -| 2638 | [统计 K-Free 子集的总数](/solution/2600-2699/2638.Count%20the%20Number%20of%20K-Free%20Subsets/README.md) | `数组`,`动态规划`,`排序` | 中等 | 🔒 | -| 2639 | [查询网格图中每一列的宽度](/solution/2600-2699/2639.Find%20the%20Width%20of%20Columns%20of%20a%20Grid/README.md) | `数组`,`矩阵` | 简单 | 第 102 场双周赛 | -| 2640 | [一个数组所有前缀的分数](/solution/2600-2699/2640.Find%20the%20Score%20of%20All%20Prefixes%20of%20an%20Array/README.md) | `数组`,`前缀和` | 中等 | 第 102 场双周赛 | -| 2641 | [二叉树的堂兄弟节点 II](/solution/2600-2699/2641.Cousins%20in%20Binary%20Tree%20II/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 第 102 场双周赛 | -| 2642 | [设计可以求最短路径的图类](/solution/2600-2699/2642.Design%20Graph%20With%20Shortest%20Path%20Calculator/README.md) | `图`,`设计`,`最短路`,`堆（优先队列）` | 困难 | 第 102 场双周赛 | -| 2643 | [一最多的行](/solution/2600-2699/2643.Row%20With%20Maximum%20Ones/README.md) | `数组`,`矩阵` | 简单 | 第 341 场周赛 | -| 2644 | [找出可整除性得分最大的整数](/solution/2600-2699/2644.Find%20the%20Maximum%20Divisibility%20Score/README.md) | `数组` | 简单 | 第 341 场周赛 | -| 2645 | [构造有效字符串的最少插入数](/solution/2600-2699/2645.Minimum%20Additions%20to%20Make%20Valid%20String/README.md) | `栈`,`贪心`,`字符串`,`动态规划` | 中等 | 第 341 场周赛 | -| 2646 | [最小化旅行的价格总和](/solution/2600-2699/2646.Minimize%20the%20Total%20Price%20of%20the%20Trips/README.md) | `树`,`深度优先搜索`,`图`,`数组`,`动态规划` | 困难 | 第 341 场周赛 | -| 2647 | [把三角形染成红色](/solution/2600-2699/2647.Color%20the%20Triangle%20Red/README.md) | `数组`,`数学` | 困难 | 🔒 | -| 2648 | [生成斐波那契数列](/solution/2600-2699/2648.Generate%20Fibonacci%20Sequence/README.md) | | 简单 | | -| 2649 | [嵌套数组生成器](/solution/2600-2699/2649.Nested%20Array%20Generator/README.md) | | 中等 | | -| 2650 | [设计可取消函数](/solution/2600-2699/2650.Design%20Cancellable%20Function/README.md) | | 困难 | | -| 2651 | [计算列车到站时间](/solution/2600-2699/2651.Calculate%20Delayed%20Arrival%20Time/README.md) | `数学` | 简单 | 第 342 场周赛 | -| 2652 | [倍数求和](/solution/2600-2699/2652.Sum%20Multiples/README.md) | `数学` | 简单 | 第 342 场周赛 | -| 2653 | [滑动子数组的美丽值](/solution/2600-2699/2653.Sliding%20Subarray%20Beauty/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 342 场周赛 | -| 2654 | [使数组所有元素变成 1 的最少操作次数](/solution/2600-2699/2654.Minimum%20Number%20of%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%201/README.md) | `数组`,`数学`,`数论` | 中等 | 第 342 场周赛 | -| 2655 | [寻找最大长度的未覆盖区间](/solution/2600-2699/2655.Find%20Maximal%20Uncovered%20Ranges/README.md) | `数组`,`排序` | 中等 | 🔒 | -| 2656 | [K 个元素的最大和](/solution/2600-2699/2656.Maximum%20Sum%20With%20Exactly%20K%20Elements/README.md) | `贪心`,`数组` | 简单 | 第 103 场双周赛 | -| 2657 | [找到两个数组的前缀公共数组](/solution/2600-2699/2657.Find%20the%20Prefix%20Common%20Array%20of%20Two%20Arrays/README.md) | `位运算`,`数组`,`哈希表` | 中等 | 第 103 场双周赛 | -| 2658 | [网格图中鱼的最大数目](/solution/2600-2699/2658.Maximum%20Number%20of%20Fish%20in%20a%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 103 场双周赛 | -| 2659 | [将数组清空](/solution/2600-2699/2659.Make%20Array%20Empty/README.md) | `贪心`,`树状数组`,`线段树`,`数组`,`二分查找`,`有序集合`,`排序` | 困难 | 第 103 场双周赛 | -| 2660 | [保龄球游戏的获胜者](/solution/2600-2699/2660.Determine%20the%20Winner%20of%20a%20Bowling%20Game/README.md) | `数组`,`模拟` | 简单 | 第 343 场周赛 | -| 2661 | [找出叠涂元素](/solution/2600-2699/2661.First%20Completely%20Painted%20Row%20or%20Column/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 第 343 场周赛 | -| 2662 | [前往目标的最小代价](/solution/2600-2699/2662.Minimum%20Cost%20of%20a%20Path%20With%20Special%20Roads/README.md) | `图`,`数组`,`最短路`,`堆（优先队列）` | 中等 | 第 343 场周赛 | -| 2663 | [字典序最小的美丽字符串](/solution/2600-2699/2663.Lexicographically%20Smallest%20Beautiful%20String/README.md) | `贪心`,`字符串` | 困难 | 第 343 场周赛 | -| 2664 | [巡逻的骑士](/solution/2600-2699/2664.The%20Knight%E2%80%99s%20Tour/README.md) | `数组`,`回溯`,`矩阵` | 中等 | 🔒 | -| 2665 | [计数器 II](/solution/2600-2699/2665.Counter%20II/README.md) | | 简单 | | -| 2666 | [只允许一次函数调用](/solution/2600-2699/2666.Allow%20One%20Function%20Call/README.md) | | 简单 | | -| 2667 | [创建 Hello World 函数](/solution/2600-2699/2667.Create%20Hello%20World%20Function/README.md) | | 简单 | | -| 2668 | [查询员工当前薪水](/solution/2600-2699/2668.Find%20Latest%20Salaries/README.md) | `数据库` | 简单 | 🔒 | -| 2669 | [统计 Spotify 排行榜上艺术家出现次数](/solution/2600-2699/2669.Count%20Artist%20Occurrences%20On%20Spotify%20Ranking%20List/README.md) | `数据库` | 简单 | 🔒 | -| 2670 | [找出不同元素数目差数组](/solution/2600-2699/2670.Find%20the%20Distinct%20Difference%20Array/README.md) | `数组`,`哈希表` | 简单 | 第 344 场周赛 | -| 2671 | [频率跟踪器](/solution/2600-2699/2671.Frequency%20Tracker/README.md) | `设计`,`哈希表` | 中等 | 第 344 场周赛 | -| 2672 | [有相同颜色的相邻元素数目](/solution/2600-2699/2672.Number%20of%20Adjacent%20Elements%20With%20the%20Same%20Color/README.md) | `数组` | 中等 | 第 344 场周赛 | -| 2673 | [使二叉树所有路径值相等的最小代价](/solution/2600-2699/2673.Make%20Costs%20of%20Paths%20Equal%20in%20a%20Binary%20Tree/README.md) | `贪心`,`树`,`数组`,`动态规划`,`二叉树` | 中等 | 第 344 场周赛 | -| 2674 | [拆分循环链表](/solution/2600-2699/2674.Split%20a%20Circular%20Linked%20List/README.md) | `链表`,`双指针` | 中等 | 🔒 | -| 2675 | [将对象数组转换为矩阵](/solution/2600-2699/2675.Array%20of%20Objects%20to%20Matrix/README.md) | | 困难 | 🔒 | -| 2676 | [节流](/solution/2600-2699/2676.Throttle/README.md) | | 中等 | 🔒 | -| 2677 | [分块数组](/solution/2600-2699/2677.Chunk%20Array/README.md) | | 简单 | | -| 2678 | [老人的数目](/solution/2600-2699/2678.Number%20of%20Senior%20Citizens/README.md) | `数组`,`字符串` | 简单 | 第 104 场双周赛 | -| 2679 | [矩阵中的和](/solution/2600-2699/2679.Sum%20in%20a%20Matrix/README.md) | `数组`,`矩阵`,`排序`,`模拟`,`堆（优先队列）` | 中等 | 第 104 场双周赛 | -| 2680 | [最大或值](/solution/2600-2699/2680.Maximum%20OR/README.md) | `贪心`,`位运算`,`数组`,`前缀和` | 中等 | 第 104 场双周赛 | -| 2681 | [英雄的力量](/solution/2600-2699/2681.Power%20of%20Heroes/README.md) | `数组`,`数学`,`动态规划`,`前缀和`,`排序` | 困难 | 第 104 场双周赛 | -| 2682 | [找出转圈游戏输家](/solution/2600-2699/2682.Find%20the%20Losers%20of%20the%20Circular%20Game/README.md) | `数组`,`哈希表`,`模拟` | 简单 | 第 345 场周赛 | -| 2683 | [相邻值的按位异或](/solution/2600-2699/2683.Neighboring%20Bitwise%20XOR/README.md) | `位运算`,`数组` | 中等 | 第 345 场周赛 | -| 2684 | [矩阵中移动的最大次数](/solution/2600-2699/2684.Maximum%20Number%20of%20Moves%20in%20a%20Grid/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 345 场周赛 | -| 2685 | [统计完全连通分量的数量](/solution/2600-2699/2685.Count%20the%20Number%20of%20Complete%20Components/README.md) | `深度优先搜索`,`广度优先搜索`,`图` | 中等 | 第 345 场周赛 | -| 2686 | [即时食物配送 III](/solution/2600-2699/2686.Immediate%20Food%20Delivery%20III/README.md) | `数据库` | 中等 | 🔒 | -| 2687 | [自行车的最后使用时间](/solution/2600-2699/2687.Bikes%20Last%20Time%20Used/README.md) | `数据库` | 简单 | 🔒 | -| 2688 | [查找活跃用户](/solution/2600-2699/2688.Find%20Active%20Users/README.md) | `数据库` | 中等 | 🔒 | -| 2689 | [从 Rope 树中提取第 K 个字符](/solution/2600-2699/2689.Extract%20Kth%20Character%20From%20The%20Rope%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | 🔒 | -| 2690 | [无穷方法对象](/solution/2600-2699/2690.Infinite%20Method%20Object/README.md) | | 简单 | 🔒 | -| 2691 | [不可变辅助工具](/solution/2600-2699/2691.Immutability%20Helper/README.md) | | 困难 | 🔒 | -| 2692 | [使对象不可变](/solution/2600-2699/2692.Make%20Object%20Immutable/README.md) | | 中等 | 🔒 | -| 2693 | [使用自定义上下文调用函数](/solution/2600-2699/2693.Call%20Function%20with%20Custom%20Context/README.md) | | 中等 | | -| 2694 | [事件发射器](/solution/2600-2699/2694.Event%20Emitter/README.md) | | 中等 | | -| 2695 | [包装数组](/solution/2600-2699/2695.Array%20Wrapper/README.md) | | 简单 | | -| 2696 | [删除子串后的字符串最小长度](/solution/2600-2699/2696.Minimum%20String%20Length%20After%20Removing%20Substrings/README.md) | `栈`,`字符串`,`模拟` | 简单 | 第 346 场周赛 | -| 2697 | [字典序最小回文串](/solution/2600-2699/2697.Lexicographically%20Smallest%20Palindrome/README.md) | `贪心`,`双指针`,`字符串` | 简单 | 第 346 场周赛 | -| 2698 | [求一个整数的惩罚数](/solution/2600-2699/2698.Find%20the%20Punishment%20Number%20of%20an%20Integer/README.md) | `数学`,`回溯` | 中等 | 第 346 场周赛 | -| 2699 | [修改图中的边权](/solution/2600-2699/2699.Modify%20Graph%20Edge%20Weights/README.md) | `图`,`最短路`,`堆（优先队列）` | 困难 | 第 346 场周赛 | -| 2700 | [两个对象之间的差异](/solution/2700-2799/2700.Differences%20Between%20Two%20Objects/README.md) | | 中等 | 🔒 | -| 2701 | [连续递增交易](/solution/2700-2799/2701.Consecutive%20Transactions%20with%20Increasing%20Amounts/README.md) | `数据库` | 困难 | 🔒 | -| 2702 | [使数字变为非正数的最小操作次数](/solution/2700-2799/2702.Minimum%20Operations%20to%20Make%20Numbers%20Non-positive/README.md) | `数组`,`二分查找` | 困难 | 🔒 | -| 2703 | [返回传递的参数的长度](/solution/2700-2799/2703.Return%20Length%20of%20Arguments%20Passed/README.md) | | 简单 | | -| 2704 | [相等还是不相等](/solution/2700-2799/2704.To%20Be%20Or%20Not%20To%20Be/README.md) | | 简单 | | -| 2705 | [精简对象](/solution/2700-2799/2705.Compact%20Object/README.md) | | 中等 | | -| 2706 | [购买两块巧克力](/solution/2700-2799/2706.Buy%20Two%20Chocolates/README.md) | `数组`,`排序` | 简单 | 第 105 场双周赛 | -| 2707 | [字符串中的额外字符](/solution/2700-2799/2707.Extra%20Characters%20in%20a%20String/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`动态规划` | 中等 | 第 105 场双周赛 | -| 2708 | [一个小组的最大实力值](/solution/2700-2799/2708.Maximum%20Strength%20of%20a%20Group/README.md) | `贪心`,`位运算`,`数组`,`动态规划`,`回溯`,`枚举`,`排序` | 中等 | 第 105 场双周赛 | -| 2709 | [最大公约数遍历](/solution/2700-2799/2709.Greatest%20Common%20Divisor%20Traversal/README.md) | `并查集`,`数组`,`数学`,`数论` | 困难 | 第 105 场双周赛 | -| 2710 | [移除字符串中的尾随零](/solution/2700-2799/2710.Remove%20Trailing%20Zeros%20From%20a%20String/README.md) | `字符串` | 简单 | 第 347 场周赛 | -| 2711 | [对角线上不同值的数量差](/solution/2700-2799/2711.Difference%20of%20Number%20of%20Distinct%20Values%20on%20Diagonals/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 第 347 场周赛 | -| 2712 | [使所有字符相等的最小成本](/solution/2700-2799/2712.Minimum%20Cost%20to%20Make%20All%20Characters%20Equal/README.md) | `贪心`,`字符串`,`动态规划` | 中等 | 第 347 场周赛 | -| 2713 | [矩阵中严格递增的单元格数](/solution/2700-2799/2713.Maximum%20Strictly%20Increasing%20Cells%20in%20a%20Matrix/README.md) | `记忆化搜索`,`数组`,`哈希表`,`二分查找`,`动态规划`,`矩阵`,`有序集合`,`排序` | 困难 | 第 347 场周赛 | -| 2714 | [找到 K 次跨越的最短路径](/solution/2700-2799/2714.Find%20Shortest%20Path%20with%20K%20Hops/README.md) | `图`,`最短路`,`堆（优先队列）` | 困难 | 🔒 | -| 2715 | [执行可取消的延迟函数](/solution/2700-2799/2715.Timeout%20Cancellation/README.md) | | 简单 | | -| 2716 | [最小化字符串长度](/solution/2700-2799/2716.Minimize%20String%20Length/README.md) | `哈希表`,`字符串` | 简单 | 第 348 场周赛 | -| 2717 | [半有序排列](/solution/2700-2799/2717.Semi-Ordered%20Permutation/README.md) | `数组`,`模拟` | 简单 | 第 348 场周赛 | -| 2718 | [查询后矩阵的和](/solution/2700-2799/2718.Sum%20of%20Matrix%20After%20Queries/README.md) | `数组`,`哈希表` | 中等 | 第 348 场周赛 | -| 2719 | [统计整数数目](/solution/2700-2799/2719.Count%20of%20Integers/README.md) | `数学`,`字符串`,`动态规划` | 困难 | 第 348 场周赛 | -| 2720 | [受欢迎度百分比](/solution/2700-2799/2720.Popularity%20Percentage/README.md) | `数据库` | 困难 | 🔒 | -| 2721 | [并行执行异步函数](/solution/2700-2799/2721.Execute%20Asynchronous%20Functions%20in%20Parallel/README.md) | | 中等 | | -| 2722 | [根据 ID 合并两个数组](/solution/2700-2799/2722.Join%20Two%20Arrays%20by%20ID/README.md) | | 中等 | | -| 2723 | [两个 Promise 对象相加](/solution/2700-2799/2723.Add%20Two%20Promises/README.md) | | 简单 | | -| 2724 | [排序方式](/solution/2700-2799/2724.Sort%20By/README.md) | | 简单 | | -| 2725 | [间隔取消](/solution/2700-2799/2725.Interval%20Cancellation/README.md) | | 简单 | | -| 2726 | [使用方法链的计算器](/solution/2700-2799/2726.Calculator%20with%20Method%20Chaining/README.md) | | 简单 | | -| 2727 | [判断对象是否为空](/solution/2700-2799/2727.Is%20Object%20Empty/README.md) | | 简单 | | -| 2728 | [计算一个环形街道上的房屋数量](/solution/2700-2799/2728.Count%20Houses%20in%20a%20Circular%20Street/README.md) | `数组`,`交互` | 简单 | 🔒 | -| 2729 | [判断一个数是否迷人](/solution/2700-2799/2729.Check%20if%20The%20Number%20is%20Fascinating/README.md) | `哈希表`,`数学` | 简单 | 第 106 场双周赛 | -| 2730 | [找到最长的半重复子字符串](/solution/2700-2799/2730.Find%20the%20Longest%20Semi-Repetitive%20Substring/README.md) | `字符串`,`滑动窗口` | 中等 | 第 106 场双周赛 | -| 2731 | [移动机器人](/solution/2700-2799/2731.Movement%20of%20Robots/README.md) | `脑筋急转弯`,`数组`,`前缀和`,`排序` | 中等 | 第 106 场双周赛 | -| 2732 | [找到矩阵中的好子集](/solution/2700-2799/2732.Find%20a%20Good%20Subset%20of%20the%20Matrix/README.md) | `位运算`,`数组`,`哈希表`,`矩阵` | 困难 | 第 106 场双周赛 | -| 2733 | [既不是最小值也不是最大值](/solution/2700-2799/2733.Neither%20Minimum%20nor%20Maximum/README.md) | `数组`,`排序` | 简单 | 第 349 场周赛 | -| 2734 | [执行子串操作后的字典序最小字符串](/solution/2700-2799/2734.Lexicographically%20Smallest%20String%20After%20Substring%20Operation/README.md) | `贪心`,`字符串` | 中等 | 第 349 场周赛 | -| 2735 | [收集巧克力](/solution/2700-2799/2735.Collecting%20Chocolates/README.md) | `数组`,`枚举` | 中等 | 第 349 场周赛 | -| 2736 | [最大和查询](/solution/2700-2799/2736.Maximum%20Sum%20Queries/README.md) | `栈`,`树状数组`,`线段树`,`数组`,`二分查找`,`排序`,`单调栈` | 困难 | 第 349 场周赛 | -| 2737 | [找到最近的标记节点](/solution/2700-2799/2737.Find%20the%20Closest%20Marked%20Node/README.md) | `图`,`数组`,`最短路`,`堆（优先队列）` | 中等 | 🔒 | -| 2738 | [统计文本中单词的出现次数](/solution/2700-2799/2738.Count%20Occurrences%20in%20Text/README.md) | `数据库` | 中等 | 🔒 | -| 2739 | [总行驶距离](/solution/2700-2799/2739.Total%20Distance%20Traveled/README.md) | `数学`,`模拟` | 简单 | 第 350 场周赛 | -| 2740 | [找出分区值](/solution/2700-2799/2740.Find%20the%20Value%20of%20the%20Partition/README.md) | `数组`,`排序` | 中等 | 第 350 场周赛 | -| 2741 | [特别的排列](/solution/2700-2799/2741.Special%20Permutations/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 中等 | 第 350 场周赛 | -| 2742 | [给墙壁刷油漆](/solution/2700-2799/2742.Painting%20the%20Walls/README.md) | `数组`,`动态规划` | 困难 | 第 350 场周赛 | -| 2743 | [计算没有重复字符的子字符串数量](/solution/2700-2799/2743.Count%20Substrings%20Without%20Repeating%20Character/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 🔒 | -| 2744 | [最大字符串配对数目](/solution/2700-2799/2744.Find%20Maximum%20Number%20of%20String%20Pairs/README.md) | `数组`,`哈希表`,`字符串`,`模拟` | 简单 | 第 107 场双周赛 | -| 2745 | [构造最长的新字符串](/solution/2700-2799/2745.Construct%20the%20Longest%20New%20String/README.md) | `贪心`,`脑筋急转弯`,`数学`,`动态规划` | 中等 | 第 107 场双周赛 | -| 2746 | [字符串连接删减字母](/solution/2700-2799/2746.Decremental%20String%20Concatenation/README.md) | `数组`,`字符串`,`动态规划` | 中等 | 第 107 场双周赛 | -| 2747 | [统计没有收到请求的服务器数目](/solution/2700-2799/2747.Count%20Zero%20Request%20Servers/README.md) | `数组`,`哈希表`,`排序`,`滑动窗口` | 中等 | 第 107 场双周赛 | -| 2748 | [美丽下标对的数目](/solution/2700-2799/2748.Number%20of%20Beautiful%20Pairs/README.md) | `数组`,`哈希表`,`数学`,`计数`,`数论` | 简单 | 第 351 场周赛 | -| 2749 | [得到整数零需要执行的最少操作数](/solution/2700-2799/2749.Minimum%20Operations%20to%20Make%20the%20Integer%20Zero/README.md) | `位运算`,`脑筋急转弯` | 中等 | 第 351 场周赛 | -| 2750 | [将数组划分成若干好子数组的方式](/solution/2700-2799/2750.Ways%20to%20Split%20Array%20Into%20Good%20Subarrays/README.md) | `数组`,`数学` | 中等 | 第 351 场周赛 | -| 2751 | [机器人碰撞](/solution/2700-2799/2751.Robot%20Collisions/README.md) | `栈`,`数组`,`排序`,`模拟` | 困难 | 第 351 场周赛 | -| 2752 | [在连续天数上进行了最多交易次数的顾客](/solution/2700-2799/2752.Customers%20with%20Maximum%20Number%20of%20Transactions%20on%20Consecutive%20Days/README.md) | `数据库` | 困难 | 🔒 | -| 2753 | [计算一个环形街道上的房屋数量 II](/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README.md) | | 困难 | 🔒 | -| 2754 | [将函数绑定到上下文](/solution/2700-2799/2754.Bind%20Function%20to%20Context/README.md) | | 中等 | 🔒 | -| 2755 | [深度合并两个对象](/solution/2700-2799/2755.Deep%20Merge%20of%20Two%20Objects/README.md) | | 中等 | 🔒 | -| 2756 | [批处理查询](/solution/2700-2799/2756.Query%20Batching/README.md) | | 困难 | 🔒 | -| 2757 | [生成循环数组的值](/solution/2700-2799/2757.Generate%20Circular%20Array%20Values/README.md) | | 中等 | 🔒 | -| 2758 | [下一天](/solution/2700-2799/2758.Next%20Day/README.md) | | 简单 | 🔒 | -| 2759 | [将 JSON 字符串转换为对象](/solution/2700-2799/2759.Convert%20JSON%20String%20to%20Object/README.md) | | 困难 | 🔒 | -| 2760 | [最长奇偶子数组](/solution/2700-2799/2760.Longest%20Even%20Odd%20Subarray%20With%20Threshold/README.md) | `数组`,`滑动窗口` | 简单 | 第 352 场周赛 | -| 2761 | [和等于目标值的质数对](/solution/2700-2799/2761.Prime%20Pairs%20With%20Target%20Sum/README.md) | `数组`,`数学`,`枚举`,`数论` | 中等 | 第 352 场周赛 | -| 2762 | [不间断子数组](/solution/2700-2799/2762.Continuous%20Subarrays/README.md) | `队列`,`数组`,`有序集合`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 中等 | 第 352 场周赛 | -| 2763 | [所有子数组中不平衡数字之和](/solution/2700-2799/2763.Sum%20of%20Imbalance%20Numbers%20of%20All%20Subarrays/README.md) | `数组`,`哈希表`,`有序集合` | 困难 | 第 352 场周赛 | -| 2764 | [数组是否表示某二叉树的前序遍历](/solution/2700-2799/2764.Is%20Array%20a%20Preorder%20of%20Some%20%E2%80%8CBinary%20Tree/README.md) | `栈`,`树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | -| 2765 | [最长交替子数组](/solution/2700-2799/2765.Longest%20Alternating%20Subarray/README.md) | `数组`,`枚举` | 简单 | 第 108 场双周赛 | -| 2766 | [重新放置石块](/solution/2700-2799/2766.Relocate%20Marbles/README.md) | `数组`,`哈希表`,`排序`,`模拟` | 中等 | 第 108 场双周赛 | -| 2767 | [将字符串分割为最少的美丽子字符串](/solution/2700-2799/2767.Partition%20String%20Into%20Minimum%20Beautiful%20Substrings/README.md) | `哈希表`,`字符串`,`动态规划`,`回溯` | 中等 | 第 108 场双周赛 | -| 2768 | [黑格子的数目](/solution/2700-2799/2768.Number%20of%20Black%20Blocks/README.md) | `数组`,`哈希表`,`枚举` | 中等 | 第 108 场双周赛 | -| 2769 | [找出最大的可达成数字](/solution/2700-2799/2769.Find%20the%20Maximum%20Achievable%20Number/README.md) | `数学` | 简单 | 第 353 场周赛 | -| 2770 | [达到末尾下标所需的最大跳跃次数](/solution/2700-2799/2770.Maximum%20Number%20of%20Jumps%20to%20Reach%20the%20Last%20Index/README.md) | `数组`,`动态规划` | 中等 | 第 353 场周赛 | -| 2771 | [构造最长非递减子数组](/solution/2700-2799/2771.Longest%20Non-decreasing%20Subarray%20From%20Two%20Arrays/README.md) | `数组`,`动态规划` | 中等 | 第 353 场周赛 | -| 2772 | [使数组中的所有元素都等于零](/solution/2700-2799/2772.Apply%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%20Zero/README.md) | `数组`,`前缀和` | 中等 | 第 353 场周赛 | -| 2773 | [特殊二叉树的高度](/solution/2700-2799/2773.Height%20of%20Special%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | -| 2774 | [数组的上界](/solution/2700-2799/2774.Array%20Upper%20Bound/README.md) | | 简单 | 🔒 | -| 2775 | [将 undefined 转为 null](/solution/2700-2799/2775.Undefined%20to%20Null/README.md) | | 中等 | 🔒 | -| 2776 | [转换回调函数为 Promise 函数](/solution/2700-2799/2776.Convert%20Callback%20Based%20Function%20to%20Promise%20Based%20Function/README.md) | | 中等 | 🔒 | -| 2777 | [日期范围生成器](/solution/2700-2799/2777.Date%20Range%20Generator/README.md) | | 中等 | 🔒 | -| 2778 | [特殊元素平方和](/solution/2700-2799/2778.Sum%20of%20Squares%20of%20Special%20Elements/README.md) | `数组`,`枚举` | 简单 | 第 354 场周赛 | -| 2779 | [数组的最大美丽值](/solution/2700-2799/2779.Maximum%20Beauty%20of%20an%20Array%20After%20Applying%20Operation/README.md) | `数组`,`二分查找`,`排序`,`滑动窗口` | 中等 | 第 354 场周赛 | -| 2780 | [合法分割的最小下标](/solution/2700-2799/2780.Minimum%20Index%20of%20a%20Valid%20Split/README.md) | `数组`,`哈希表`,`排序` | 中等 | 第 354 场周赛 | -| 2781 | [最长合法子字符串的长度](/solution/2700-2799/2781.Length%20of%20the%20Longest%20Valid%20Substring/README.md) | `数组`,`哈希表`,`字符串`,`滑动窗口` | 困难 | 第 354 场周赛 | -| 2782 | [唯一类别的数量](/solution/2700-2799/2782.Number%20of%20Unique%20Categories/README.md) | `并查集`,`计数`,`交互` | 中等 | 🔒 | -| 2783 | [航班入座率和等待名单分析](/solution/2700-2799/2783.Flight%20Occupancy%20and%20Waitlist%20Analysis/README.md) | `数据库` | 中等 | 🔒 | -| 2784 | [检查数组是否是好的](/solution/2700-2799/2784.Check%20if%20Array%20is%20Good/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 109 场双周赛 | -| 2785 | [将字符串中的元音字母排序](/solution/2700-2799/2785.Sort%20Vowels%20in%20a%20String/README.md) | `字符串`,`排序` | 中等 | 第 109 场双周赛 | -| 2786 | [访问数组中的位置使分数最大](/solution/2700-2799/2786.Visit%20Array%20Positions%20to%20Maximize%20Score/README.md) | `数组`,`动态规划` | 中等 | 第 109 场双周赛 | -| 2787 | [将一个数字表示成幂的和的方案数](/solution/2700-2799/2787.Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers/README.md) | `动态规划` | 中等 | 第 109 场双周赛 | -| 2788 | [按分隔符拆分字符串](/solution/2700-2799/2788.Split%20Strings%20by%20Separator/README.md) | `数组`,`字符串` | 简单 | 第 355 场周赛 | -| 2789 | [合并后数组中的最大元素](/solution/2700-2799/2789.Largest%20Element%20in%20an%20Array%20after%20Merge%20Operations/README.md) | `贪心`,`数组` | 中等 | 第 355 场周赛 | -| 2790 | [长度递增组的最大数目](/solution/2700-2799/2790.Maximum%20Number%20of%20Groups%20With%20Increasing%20Length/README.md) | `贪心`,`数组`,`数学`,`二分查找`,`排序` | 困难 | 第 355 场周赛 | -| 2791 | [树中可以形成回文的路径数](/solution/2700-2799/2791.Count%20Paths%20That%20Can%20Form%20a%20Palindrome%20in%20a%20Tree/README.md) | `位运算`,`树`,`深度优先搜索`,`动态规划`,`状态压缩` | 困难 | 第 355 场周赛 | -| 2792 | [计算足够大的节点数](/solution/2700-2799/2792.Count%20Nodes%20That%20Are%20Great%20Enough/README.md) | `树`,`深度优先搜索`,`分治`,`二叉树` | 困难 | 🔒 | -| 2793 | [航班机票状态](/solution/2700-2799/2793.Status%20of%20Flight%20Tickets/README.md) | | 困难 | 🔒 | -| 2794 | [从两个数组中创建对象](/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README.md) | | 简单 | 🔒 | -| 2795 | [并行执行 Promise 以获取独有的结果](/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README.md) | | 中等 | 🔒 | -| 2796 | [重复字符串](/solution/2700-2799/2796.Repeat%20String/README.md) | | 简单 | 🔒 | -| 2797 | [带有占位符的部分函数](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README.md) | | 简单 | 🔒 | -| 2798 | [满足目标工作时长的员工数目](/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README.md) | `数组` | 简单 | 第 356 场周赛 | -| 2799 | [统计完全子数组的数目](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 356 场周赛 | -| 2800 | [包含三个字符串的最短字符串](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README.md) | `贪心`,`字符串`,`枚举` | 中等 | 第 356 场周赛 | -| 2801 | [统计范围内的步进数字数目](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README.md) | `字符串`,`动态规划` | 困难 | 第 356 场周赛 | -| 2802 | [找出第 K 个幸运数字](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README.md) | `位运算`,`数学`,`字符串` | 中等 | 🔒 | -| 2803 | [阶乘生成器](/solution/2800-2899/2803.Factorial%20Generator/README.md) | | 简单 | 🔒 | -| 2804 | [数组原型的 forEach 方法](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README.md) | | 简单 | 🔒 | -| 2805 | [自定义间隔](/solution/2800-2899/2805.Custom%20Interval/README.md) | | 中等 | 🔒 | -| 2806 | [取整购买后的账户余额](/solution/2800-2899/2806.Account%20Balance%20After%20Rounded%20Purchase/README.md) | `数学` | 简单 | 第 110 场双周赛 | -| 2807 | [在链表中插入最大公约数](/solution/2800-2899/2807.Insert%20Greatest%20Common%20Divisors%20in%20Linked%20List/README.md) | `链表`,`数学`,`数论` | 中等 | 第 110 场双周赛 | -| 2808 | [使循环数组所有元素相等的最少秒数](/solution/2800-2899/2808.Minimum%20Seconds%20to%20Equalize%20a%20Circular%20Array/README.md) | `数组`,`哈希表` | 中等 | 第 110 场双周赛 | -| 2809 | [使数组和小于等于 x 的最少时间](/solution/2800-2899/2809.Minimum%20Time%20to%20Make%20Array%20Sum%20At%20Most%20x/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 110 场双周赛 | -| 2810 | [故障键盘](/solution/2800-2899/2810.Faulty%20Keyboard/README.md) | `字符串`,`模拟` | 简单 | 第 357 场周赛 | -| 2811 | [判断是否能拆分数组](/solution/2800-2899/2811.Check%20if%20it%20is%20Possible%20to%20Split%20Array/README.md) | `贪心`,`数组`,`动态规划` | 中等 | 第 357 场周赛 | -| 2812 | [找出最安全路径](/solution/2800-2899/2812.Find%20the%20Safest%20Path%20in%20a%20Grid/README.md) | `广度优先搜索`,`并查集`,`数组`,`二分查找`,`矩阵` | 中等 | 第 357 场周赛 | -| 2813 | [子序列最大优雅度](/solution/2800-2899/2813.Maximum%20Elegance%20of%20a%20K-Length%20Subsequence/README.md) | `栈`,`贪心`,`数组`,`哈希表`,`排序`,`堆（优先队列）` | 困难 | 第 357 场周赛 | -| 2814 | [避免淹死并到达目的地的最短时间](/solution/2800-2899/2814.Minimum%20Time%20Takes%20to%20Reach%20Destination%20Without%20Drowning/README.md) | `广度优先搜索`,`数组`,`矩阵` | 困难 | 🔒 | -| 2815 | [数组中的最大数对和](/solution/2800-2899/2815.Max%20Pair%20Sum%20in%20an%20Array/README.md) | `数组`,`哈希表` | 简单 | 第 358 场周赛 | -| 2816 | [翻倍以链表形式表示的数字](/solution/2800-2899/2816.Double%20a%20Number%20Represented%20as%20a%20Linked%20List/README.md) | `栈`,`链表`,`数学` | 中等 | 第 358 场周赛 | -| 2817 | [限制条件下元素之间的最小绝对差](/solution/2800-2899/2817.Minimum%20Absolute%20Difference%20Between%20Elements%20With%20Constraint/README.md) | `数组`,`二分查找`,`有序集合` | 中等 | 第 358 场周赛 | -| 2818 | [操作使得分最大](/solution/2800-2899/2818.Apply%20Operations%20to%20Maximize%20Score/README.md) | `栈`,`贪心`,`数组`,`数学`,`数论`,`单调栈` | 困难 | 第 358 场周赛 | -| 2819 | [购买巧克力后的最小相对损失](/solution/2800-2899/2819.Minimum%20Relative%20Loss%20After%20Buying%20Chocolates/README.md) | `数组`,`二分查找`,`前缀和`,`排序` | 困难 | 🔒 | -| 2820 | [选举结果](/solution/2800-2899/2820.Election%20Results/README.md) | | 中等 | 🔒 | -| 2821 | [延迟每个 Promise 对象的解析](/solution/2800-2899/2821.Delay%20the%20Resolution%20of%20Each%20Promise/README.md) | | 中等 | 🔒 | -| 2822 | [对象反转](/solution/2800-2899/2822.Inversion%20of%20Object/README.md) | | 简单 | 🔒 | -| 2823 | [深度对象筛选](/solution/2800-2899/2823.Deep%20Object%20Filter/README.md) | | 中等 | 🔒 | -| 2824 | [统计和小于目标的下标对数目](/solution/2800-2899/2824.Count%20Pairs%20Whose%20Sum%20is%20Less%20than%20Target/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 简单 | 第 111 场双周赛 | -| 2825 | [循环增长使字符串子序列等于另一个字符串](/solution/2800-2899/2825.Make%20String%20a%20Subsequence%20Using%20Cyclic%20Increments/README.md) | `双指针`,`字符串` | 中等 | 第 111 场双周赛 | -| 2826 | [将三个组排序](/solution/2800-2899/2826.Sorting%20Three%20Groups/README.md) | `数组`,`二分查找`,`动态规划` | 中等 | 第 111 场双周赛 | -| 2827 | [范围中美丽整数的数目](/solution/2800-2899/2827.Number%20of%20Beautiful%20Integers%20in%20the%20Range/README.md) | `数学`,`动态规划` | 困难 | 第 111 场双周赛 | -| 2828 | [判别首字母缩略词](/solution/2800-2899/2828.Check%20if%20a%20String%20Is%20an%20Acronym%20of%20Words/README.md) | `数组`,`字符串` | 简单 | 第 359 场周赛 | -| 2829 | [k-avoiding 数组的最小总和](/solution/2800-2899/2829.Determine%20the%20Minimum%20Sum%20of%20a%20k-avoiding%20Array/README.md) | `贪心`,`数学` | 中等 | 第 359 场周赛 | -| 2830 | [销售利润最大化](/solution/2800-2899/2830.Maximize%20the%20Profit%20as%20the%20Salesman/README.md) | `数组`,`哈希表`,`二分查找`,`动态规划`,`排序` | 中等 | 第 359 场周赛 | -| 2831 | [找出最长等值子数组](/solution/2800-2899/2831.Find%20the%20Longest%20Equal%20Subarray/README.md) | `数组`,`哈希表`,`二分查找`,`滑动窗口` | 中等 | 第 359 场周赛 | -| 2832 | [每个元素为最大值的最大范围](/solution/2800-2899/2832.Maximal%20Range%20That%20Each%20Element%20Is%20Maximum%20in%20It/README.md) | `栈`,`数组`,`单调栈` | 中等 | 🔒 | -| 2833 | [距离原点最远的点](/solution/2800-2899/2833.Furthest%20Point%20From%20Origin/README.md) | `字符串`,`计数` | 简单 | 第 360 场周赛 | -| 2834 | [找出美丽数组的最小和](/solution/2800-2899/2834.Find%20the%20Minimum%20Possible%20Sum%20of%20a%20Beautiful%20Array/README.md) | `贪心`,`数学` | 中等 | 第 360 场周赛 | -| 2835 | [使子序列的和等于目标的最少操作次数](/solution/2800-2899/2835.Minimum%20Operations%20to%20Form%20Subsequence%20With%20Target%20Sum/README.md) | `贪心`,`位运算`,`数组` | 困难 | 第 360 场周赛 | -| 2836 | [在传球游戏中最大化函数值](/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README.md) | `位运算`,`数组`,`动态规划` | 困难 | 第 360 场周赛 | -| 2837 | [总旅行距离](/solution/2800-2899/2837.Total%20Traveled%20Distance/README.md) | `数据库` | 简单 | 🔒 | -| 2838 | [英雄可以获得的最大金币数](/solution/2800-2899/2838.Maximum%20Coins%20Heroes%20Can%20Collect/README.md) | `数组`,`双指针`,`二分查找`,`前缀和`,`排序` | 中等 | 🔒 | -| 2839 | [判断通过操作能否让字符串相等 I](/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README.md) | `字符串` | 简单 | 第 112 场双周赛 | -| 2840 | [判断通过操作能否让字符串相等 II](/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README.md) | `哈希表`,`字符串`,`排序` | 中等 | 第 112 场双周赛 | -| 2841 | [几乎唯一子数组的最大和](/solution/2800-2899/2841.Maximum%20Sum%20of%20Almost%20Unique%20Subarray/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 112 场双周赛 | -| 2842 | [统计一个字符串的 k 子序列美丽值最大的数目](/solution/2800-2899/2842.Count%20K-Subsequences%20of%20a%20String%20With%20Maximum%20Beauty/README.md) | `贪心`,`哈希表`,`数学`,`字符串`,`组合数学` | 困难 | 第 112 场双周赛 | -| 2843 | [统计对称整数的数目](/solution/2800-2899/2843.Count%20Symmetric%20Integers/README.md) | `数学`,`枚举` | 简单 | 第 361 场周赛 | -| 2844 | [生成特殊数字的最少操作](/solution/2800-2899/2844.Minimum%20Operations%20to%20Make%20a%20Special%20Number/README.md) | `贪心`,`数学`,`字符串`,`枚举` | 中等 | 第 361 场周赛 | -| 2845 | [统计趣味子数组的数目](/solution/2800-2899/2845.Count%20of%20Interesting%20Subarrays/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 361 场周赛 | -| 2846 | [边权重均等查询](/solution/2800-2899/2846.Minimum%20Edge%20Weight%20Equilibrium%20Queries%20in%20a%20Tree/README.md) | `树`,`图`,`数组`,`强连通分量` | 困难 | 第 361 场周赛 | -| 2847 | [给定数字乘积的最小数字](/solution/2800-2899/2847.Smallest%20Number%20With%20Given%20Digit%20Product/README.md) | `贪心`,`数学` | 中等 | 🔒 | -| 2848 | [与车相交的点](/solution/2800-2899/2848.Points%20That%20Intersect%20With%20Cars/README.md) | `数组`,`哈希表`,`前缀和` | 简单 | 第 362 场周赛 | -| 2849 | [判断能否在给定时间到达单元格](/solution/2800-2899/2849.Determine%20if%20a%20Cell%20Is%20Reachable%20at%20a%20Given%20Time/README.md) | `数学` | 中等 | 第 362 场周赛 | -| 2850 | [将石头分散到网格图的最少移动次数](/solution/2800-2899/2850.Minimum%20Moves%20to%20Spread%20Stones%20Over%20Grid/README.md) | `广度优先搜索`,`数组`,`动态规划`,`矩阵` | 中等 | 第 362 场周赛 | -| 2851 | [字符串转换](/solution/2800-2899/2851.String%20Transformation/README.md) | `数学`,`字符串`,`动态规划`,`字符串匹配` | 困难 | 第 362 场周赛 | -| 2852 | [所有单元格的远离程度之和](/solution/2800-2899/2852.Sum%20of%20Remoteness%20of%20All%20Cells/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`矩阵` | 中等 | 🔒 | -| 2853 | [最高薪水差异](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README.md) | `数据库` | 简单 | 🔒 | -| 2854 | [滚动平均步数](/solution/2800-2899/2854.Rolling%20Average%20Steps/README.md) | `数据库` | 中等 | 🔒 | -| 2855 | [使数组成为递增数组的最少右移次数](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README.md) | `数组` | 简单 | 第 113 场双周赛 | -| 2856 | [删除数对后的最小数组长度](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README.md) | `贪心`,`数组`,`哈希表`,`双指针`,`二分查找`,`计数` | 中等 | 第 113 场双周赛 | -| 2857 | [统计距离为 k 的点对](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README.md) | `位运算`,`数组`,`哈希表` | 中等 | 第 113 场双周赛 | -| 2858 | [可以到达每一个节点的最少边反转次数](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`动态规划` | 困难 | 第 113 场双周赛 | -| 2859 | [计算 K 置位下标对应元素的和](/solution/2800-2899/2859.Sum%20of%20Values%20at%20Indices%20With%20K%20Set%20Bits/README.md) | `位运算`,`数组` | 简单 | 第 363 场周赛 | -| 2860 | [让所有学生保持开心的分组方法数](/solution/2800-2899/2860.Happy%20Students/README.md) | `数组`,`枚举`,`排序` | 中等 | 第 363 场周赛 | -| 2861 | [最大合金数](/solution/2800-2899/2861.Maximum%20Number%20of%20Alloys/README.md) | `数组`,`二分查找` | 中等 | 第 363 场周赛 | -| 2862 | [完全子集的最大元素和](/solution/2800-2899/2862.Maximum%20Element-Sum%20of%20a%20Complete%20Subset%20of%20Indices/README.md) | `数组`,`数学`,`数论` | 困难 | 第 363 场周赛 | -| 2863 | [最长半递减数组](/solution/2800-2899/2863.Maximum%20Length%20of%20Semi-Decreasing%20Subarrays/README.md) | `数组`,`哈希表`,`排序` | 中等 | 🔒 | -| 2864 | [最大二进制奇数](/solution/2800-2899/2864.Maximum%20Odd%20Binary%20Number/README.md) | `贪心`,`数学`,`字符串` | 简单 | 第 364 场周赛 | -| 2865 | [美丽塔 I](/solution/2800-2899/2865.Beautiful%20Towers%20I/README.md) | `栈`,`数组`,`单调栈` | 中等 | 第 364 场周赛 | -| 2866 | [美丽塔 II](/solution/2800-2899/2866.Beautiful%20Towers%20II/README.md) | `栈`,`数组`,`单调栈` | 中等 | 第 364 场周赛 | -| 2867 | [统计树中的合法路径数目](/solution/2800-2899/2867.Count%20Valid%20Paths%20in%20a%20Tree/README.md) | `树`,`深度优先搜索`,`数学`,`动态规划`,`数论` | 困难 | 第 364 场周赛 | -| 2868 | [单词游戏](/solution/2800-2899/2868.The%20Wording%20Game/README.md) | `数组`,`数学`,`双指针`,`字符串`,`博弈` | 困难 | 🔒 | -| 2869 | [收集元素的最少操作次数](/solution/2800-2899/2869.Minimum%20Operations%20to%20Collect%20Elements/README.md) | `位运算`,`数组`,`哈希表` | 简单 | 第 114 场双周赛 | -| 2870 | [使数组为空的最少操作次数](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README.md) | `贪心`,`数组`,`哈希表`,`计数` | 中等 | 第 114 场双周赛 | -| 2871 | [将数组分割成最多数目的子数组](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README.md) | `贪心`,`位运算`,`数组` | 中等 | 第 114 场双周赛 | -| 2872 | [可以被 K 整除连通块的最大数目](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README.md) | `树`,`深度优先搜索` | 困难 | 第 114 场双周赛 | -| 2873 | [有序三元组中的最大值 I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README.md) | `数组` | 简单 | 第 365 场周赛 | -| 2874 | [有序三元组中的最大值 II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README.md) | `数组` | 中等 | 第 365 场周赛 | -| 2875 | [无限数组的最短子数组](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README.md) | `数组`,`哈希表`,`前缀和`,`滑动窗口` | 中等 | 第 365 场周赛 | -| 2876 | [有向图访问计数](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README.md) | `图`,`记忆化搜索`,`动态规划` | 困难 | 第 365 场周赛 | -| 2877 | [从表中创建 DataFrame](/solution/2800-2899/2877.Create%20a%20DataFrame%20from%20List/README.md) | | 简单 | | -| 2878 | [获取 DataFrame 的大小](/solution/2800-2899/2878.Get%20the%20Size%20of%20a%20DataFrame/README.md) | | 简单 | | -| 2879 | [显示前三行](/solution/2800-2899/2879.Display%20the%20First%20Three%20Rows/README.md) | | 简单 | | -| 2880 | [数据选取](/solution/2800-2899/2880.Select%20Data/README.md) | | 简单 | | -| 2881 | [创建新列](/solution/2800-2899/2881.Create%20a%20New%20Column/README.md) | | 简单 | | -| 2882 | [删去重复的行](/solution/2800-2899/2882.Drop%20Duplicate%20Rows/README.md) | | 简单 | | -| 2883 | [删去丢失的数据](/solution/2800-2899/2883.Drop%20Missing%20Data/README.md) | | 简单 | | -| 2884 | [修改列](/solution/2800-2899/2884.Modify%20Columns/README.md) | | 简单 | | -| 2885 | [重命名列](/solution/2800-2899/2885.Rename%20Columns/README.md) | | 简单 | | -| 2886 | [改变数据类型](/solution/2800-2899/2886.Change%20Data%20Type/README.md) | | 简单 | | -| 2887 | [填充缺失值](/solution/2800-2899/2887.Fill%20Missing%20Data/README.md) | | 简单 | | -| 2888 | [重塑数据：连结](/solution/2800-2899/2888.Reshape%20Data%20Concatenate/README.md) | | 简单 | | -| 2889 | [数据重塑：透视](/solution/2800-2899/2889.Reshape%20Data%20Pivot/README.md) | | 简单 | | -| 2890 | [重塑数据：融合](/solution/2800-2899/2890.Reshape%20Data%20Melt/README.md) | | 简单 | | -| 2891 | [方法链](/solution/2800-2899/2891.Method%20Chaining/README.md) | | 简单 | | -| 2892 | [将相邻元素相乘后得到最小化数组](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README.md) | `贪心`,`数组`,`动态规划` | 中等 | 🔒 | -| 2893 | [计算每个区间内的订单](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README.md) | `数据库` | 中等 | 🔒 | -| 2894 | [分类求和并作差](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README.md) | `数学` | 简单 | 第 366 场周赛 | -| 2895 | [最小处理时间](/solution/2800-2899/2895.Minimum%20Processing%20Time/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 366 场周赛 | -| 2896 | [执行操作使两个字符串相等](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README.md) | `字符串`,`动态规划` | 中等 | 第 366 场周赛 | -| 2897 | [对数组执行操作使平方和最大](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README.md) | `贪心`,`位运算`,`数组`,`哈希表` | 困难 | 第 366 场周赛 | -| 2898 | [最大线性股票得分](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README.md) | `数组`,`哈希表` | 中等 | 🔒 | -| 2899 | [上一个遍历的整数](/solution/2800-2899/2899.Last%20Visited%20Integers/README.md) | `数组`,`模拟` | 简单 | 第 115 场双周赛 | -| 2900 | [最长相邻不相等子序列 I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README.md) | `贪心`,`数组`,`字符串`,`动态规划` | 简单 | 第 115 场双周赛 | -| 2901 | [最长相邻不相等子序列 II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README.md) | `数组`,`字符串`,`动态规划` | 中等 | 第 115 场双周赛 | -| 2902 | [和带限制的子多重集合的数目](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README.md) | `数组`,`哈希表`,`动态规划`,`滑动窗口` | 困难 | 第 115 场双周赛 | -| 2903 | [找出满足差值条件的下标 I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README.md) | `数组`,`双指针` | 简单 | 第 367 场周赛 | -| 2904 | [最短且字典序最小的美丽子字符串](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README.md) | `字符串`,`滑动窗口` | 中等 | 第 367 场周赛 | -| 2905 | [找出满足差值条件的下标 II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README.md) | `数组`,`双指针` | 中等 | 第 367 场周赛 | -| 2906 | [构造乘积矩阵](/solution/2900-2999/2906.Construct%20Product%20Matrix/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 367 场周赛 | -| 2907 | [价格递增的最大利润三元组 I](/solution/2900-2999/2907.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20I/README.md) | `树状数组`,`线段树`,`数组` | 中等 | 🔒 | -| 2908 | [元素和最小的山形三元组 I](/solution/2900-2999/2908.Minimum%20Sum%20of%20Mountain%20Triplets%20I/README.md) | `数组` | 简单 | 第 368 场周赛 | -| 2909 | [元素和最小的山形三元组 II](/solution/2900-2999/2909.Minimum%20Sum%20of%20Mountain%20Triplets%20II/README.md) | `数组` | 中等 | 第 368 场周赛 | -| 2910 | [合法分组的最少组数](/solution/2900-2999/2910.Minimum%20Number%20of%20Groups%20to%20Create%20a%20Valid%20Assignment/README.md) | `贪心`,`数组`,`哈希表` | 中等 | 第 368 场周赛 | -| 2911 | [得到 K 个半回文串的最少修改次数](/solution/2900-2999/2911.Minimum%20Changes%20to%20Make%20K%20Semi-palindromes/README.md) | `双指针`,`字符串`,`动态规划` | 困难 | 第 368 场周赛 | -| 2912 | [在网格上移动到目的地的方法数](/solution/2900-2999/2912.Number%20of%20Ways%20to%20Reach%20Destination%20in%20the%20Grid/README.md) | `数学`,`动态规划`,`组合数学` | 困难 | 🔒 | -| 2913 | [子数组不同元素数目的平方和 I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README.md) | `数组`,`哈希表` | 简单 | 第 116 场双周赛 | -| 2914 | [使二进制字符串变美丽的最少修改次数](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README.md) | `字符串` | 中等 | 第 116 场双周赛 | -| 2915 | [和为目标值的最长子序列的长度](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README.md) | `数组`,`动态规划` | 中等 | 第 116 场双周赛 | -| 2916 | [子数组不同元素数目的平方和 II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README.md) | `树状数组`,`线段树`,`数组`,`动态规划` | 困难 | 第 116 场双周赛 | -| 2917 | [找出数组中的 K-or 值](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README.md) | `位运算`,`数组` | 简单 | 第 369 场周赛 | -| 2918 | [数组的最小相等和](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README.md) | `贪心`,`数组` | 中等 | 第 369 场周赛 | -| 2919 | [使数组变美的最小增量运算数](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README.md) | `数组`,`动态规划` | 中等 | 第 369 场周赛 | -| 2920 | [收集所有金币可获得的最大积分](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README.md) | `位运算`,`树`,`深度优先搜索`,`数组`,`动态规划` | 困难 | 第 369 场周赛 | -| 2921 | [价格递增的最大利润三元组 II](/solution/2900-2999/2921.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20II/README.md) | `树状数组`,`线段树`,`数组` | 困难 | 🔒 | -| 2922 | [市场分析 III](/solution/2900-2999/2922.Market%20Analysis%20III/README.md) | `数据库` | 中等 | 🔒 | -| 2923 | [找到冠军 I](/solution/2900-2999/2923.Find%20Champion%20I/README.md) | `数组`,`矩阵` | 简单 | 第 370 场周赛 | -| 2924 | [找到冠军 II](/solution/2900-2999/2924.Find%20Champion%20II/README.md) | `图` | 中等 | 第 370 场周赛 | -| 2925 | [在树上执行操作以后得到的最大分数](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README.md) | `树`,`深度优先搜索`,`动态规划` | 中等 | 第 370 场周赛 | -| 2926 | [平衡子序列的最大和](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`动态规划` | 困难 | 第 370 场周赛 | -| 2927 | [给小朋友们分糖果 III](/solution/2900-2999/2927.Distribute%20Candies%20Among%20Children%20III/README.md) | `数学`,`组合数学` | 困难 | 🔒 | -| 2928 | [给小朋友们分糖果 I](/solution/2900-2999/2928.Distribute%20Candies%20Among%20Children%20I/README.md) | `数学`,`组合数学`,`枚举` | 简单 | 第 117 场双周赛 | -| 2929 | [给小朋友们分糖果 II](/solution/2900-2999/2929.Distribute%20Candies%20Among%20Children%20II/README.md) | `数学`,`组合数学`,`枚举` | 中等 | 第 117 场双周赛 | -| 2930 | [重新排列后包含指定子字符串的字符串数目](/solution/2900-2999/2930.Number%20of%20Strings%20Which%20Can%20Be%20Rearranged%20to%20Contain%20Substring/README.md) | `数学`,`动态规划`,`组合数学` | 中等 | 第 117 场双周赛 | -| 2931 | [购买物品的最大开销](/solution/2900-2999/2931.Maximum%20Spending%20After%20Buying%20Items/README.md) | `贪心`,`数组`,`矩阵`,`排序`,`堆（优先队列）` | 困难 | 第 117 场双周赛 | -| 2932 | [找出强数对的最大异或值 I](/solution/2900-2999/2932.Maximum%20Strong%20Pair%20XOR%20I/README.md) | `位运算`,`字典树`,`数组`,`哈希表`,`滑动窗口` | 简单 | 第 371 场周赛 | -| 2933 | [高访问员工](/solution/2900-2999/2933.High-Access%20Employees/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 371 场周赛 | -| 2934 | [最大化数组末位元素的最少操作次数](/solution/2900-2999/2934.Minimum%20Operations%20to%20Maximize%20Last%20Elements%20in%20Arrays/README.md) | `数组`,`枚举` | 中等 | 第 371 场周赛 | -| 2935 | [找出强数对的最大异或值 II](/solution/2900-2999/2935.Maximum%20Strong%20Pair%20XOR%20II/README.md) | `位运算`,`字典树`,`数组`,`哈希表`,`滑动窗口` | 困难 | 第 371 场周赛 | -| 2936 | [包含相等值数字块的数量](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README.md) | `数组`,`二分查找`,`交互` | 中等 | 🔒 | -| 2937 | [使三个字符串相等](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README.md) | `字符串` | 简单 | 第 372 场周赛 | -| 2938 | [区分黑球与白球](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README.md) | `贪心`,`双指针`,`字符串` | 中等 | 第 372 场周赛 | -| 2939 | [最大异或乘积](/solution/2900-2999/2939.Maximum%20Xor%20Product/README.md) | `贪心`,`位运算`,`数学` | 中等 | 第 372 场周赛 | -| 2940 | [找到 Alice 和 Bob 可以相遇的建筑](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README.md) | `栈`,`树状数组`,`线段树`,`数组`,`二分查找`,`单调栈`,`堆（优先队列）` | 困难 | 第 372 场周赛 | -| 2941 | [子数组的最大 GCD-Sum](/solution/2900-2999/2941.Maximum%20GCD-Sum%20of%20a%20Subarray/README.md) | `数组`,`数学`,`二分查找`,`数论` | 困难 | 🔒 | -| 2942 | [查找包含给定字符的单词](/solution/2900-2999/2942.Find%20Words%20Containing%20Character/README.md) | `数组`,`字符串` | 简单 | 第 118 场双周赛 | -| 2943 | [最大化网格图中正方形空洞的面积](/solution/2900-2999/2943.Maximize%20Area%20of%20Square%20Hole%20in%20Grid/README.md) | `数组`,`排序` | 中等 | 第 118 场双周赛 | -| 2944 | [购买水果需要的最少金币数](/solution/2900-2999/2944.Minimum%20Number%20of%20Coins%20for%20Fruits/README.md) | `队列`,`数组`,`动态规划`,`单调队列`,`堆（优先队列）` | 中等 | 第 118 场双周赛 | -| 2945 | [找到最大非递减数组的长度](/solution/2900-2999/2945.Find%20Maximum%20Non-decreasing%20Array%20Length/README.md) | `栈`,`队列`,`数组`,`二分查找`,`动态规划`,`单调队列`,`单调栈` | 困难 | 第 118 场双周赛 | -| 2946 | [循环移位后的矩阵相似检查](/solution/2900-2999/2946.Matrix%20Similarity%20After%20Cyclic%20Shifts/README.md) | `数组`,`数学`,`矩阵`,`模拟` | 简单 | 第 373 场周赛 | -| 2947 | [统计美丽子字符串 I](/solution/2900-2999/2947.Count%20Beautiful%20Substrings%20I/README.md) | `哈希表`,`数学`,`字符串`,`枚举`,`数论`,`前缀和` | 中等 | 第 373 场周赛 | -| 2948 | [交换得到字典序最小的数组](/solution/2900-2999/2948.Make%20Lexicographically%20Smallest%20Array%20by%20Swapping%20Elements/README.md) | `并查集`,`数组`,`排序` | 中等 | 第 373 场周赛 | -| 2949 | [统计美丽子字符串 II](/solution/2900-2999/2949.Count%20Beautiful%20Substrings%20II/README.md) | `哈希表`,`数学`,`字符串`,`数论`,`前缀和` | 困难 | 第 373 场周赛 | -| 2950 | [可整除子串的数量](/solution/2900-2999/2950.Number%20of%20Divisible%20Substrings/README.md) | `哈希表`,`字符串`,`计数`,`前缀和` | 中等 | 🔒 | -| 2951 | [找出峰值](/solution/2900-2999/2951.Find%20the%20Peaks/README.md) | `数组`,`枚举` | 简单 | 第 374 场周赛 | -| 2952 | [需要添加的硬币的最小数量](/solution/2900-2999/2952.Minimum%20Number%20of%20Coins%20to%20be%20Added/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 374 场周赛 | -| 2953 | [统计完全子字符串](/solution/2900-2999/2953.Count%20Complete%20Substrings/README.md) | `哈希表`,`字符串`,`滑动窗口` | 困难 | 第 374 场周赛 | -| 2954 | [统计感冒序列的数目](/solution/2900-2999/2954.Count%20the%20Number%20of%20Infection%20Sequences/README.md) | `数组`,`数学`,`组合数学` | 困难 | 第 374 场周赛 | -| 2955 | [同端子串的数量](/solution/2900-2999/2955.Number%20of%20Same-End%20Substrings/README.md) | `数组`,`哈希表`,`字符串`,`计数`,`前缀和` | 中等 | 🔒 | -| 2956 | [找到两个数组中的公共元素](/solution/2900-2999/2956.Find%20Common%20Elements%20Between%20Two%20Arrays/README.md) | `数组`,`哈希表` | 简单 | 第 119 场双周赛 | -| 2957 | [消除相邻近似相等字符](/solution/2900-2999/2957.Remove%20Adjacent%20Almost-Equal%20Characters/README.md) | `贪心`,`字符串`,`动态规划` | 中等 | 第 119 场双周赛 | -| 2958 | [最多 K 个重复元素的最长子数组](/solution/2900-2999/2958.Length%20of%20Longest%20Subarray%20With%20at%20Most%20K%20Frequency/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 119 场双周赛 | -| 2959 | [关闭分部的可行集合数目](/solution/2900-2999/2959.Number%20of%20Possible%20Sets%20of%20Closing%20Branches/README.md) | `位运算`,`图`,`枚举`,`最短路`,`堆（优先队列）` | 困难 | 第 119 场双周赛 | -| 2960 | [统计已测试设备](/solution/2900-2999/2960.Count%20Tested%20Devices%20After%20Test%20Operations/README.md) | `数组`,`模拟` | 简单 | 第 375 场周赛 | -| 2961 | [双模幂运算](/solution/2900-2999/2961.Double%20Modular%20Exponentiation/README.md) | `数组`,`数学`,`模拟` | 中等 | 第 375 场周赛 | -| 2962 | [统计最大元素出现至少 K 次的子数组](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README.md) | `数组`,`滑动窗口` | 中等 | 第 375 场周赛 | -| 2963 | [统计好分割方案的数目](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README.md) | `数组`,`哈希表`,`数学`,`组合数学` | 困难 | 第 375 场周赛 | -| 2964 | [可被整除的三元组数量](/solution/2900-2999/2964.Number%20of%20Divisible%20Triplet%20Sums/README.md) | `数组`,`哈希表` | 中等 | 🔒 | -| 2965 | [找出缺失和重复的数字](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README.md) | `数组`,`哈希表`,`数学`,`矩阵` | 简单 | 第 376 场周赛 | -| 2966 | [划分数组并满足最大差限制](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 376 场周赛 | -| 2967 | [使数组成为等数数组的最小代价](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README.md) | `贪心`,`数组`,`数学`,`排序` | 中等 | 第 376 场周赛 | -| 2968 | [执行操作使频率分数最大](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README.md) | `数组`,`二分查找`,`前缀和`,`排序`,`滑动窗口` | 困难 | 第 376 场周赛 | -| 2969 | [购买水果需要的最少金币数 II](/solution/2900-2999/2969.Minimum%20Number%20of%20Coins%20for%20Fruits%20II/README.md) | `队列`,`数组`,`动态规划`,`单调队列`,`堆（优先队列）` | 困难 | 🔒 | -| 2970 | [统计移除递增子数组的数目 I](/solution/2900-2999/2970.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README.md) | `数组`,`双指针`,`二分查找`,`枚举` | 简单 | 第 120 场双周赛 | -| 2971 | [找到最大周长的多边形](/solution/2900-2999/2971.Find%20Polygon%20With%20the%20Largest%20Perimeter/README.md) | `贪心`,`数组`,`前缀和`,`排序` | 中等 | 第 120 场双周赛 | -| 2972 | [统计移除递增子数组的数目 II](/solution/2900-2999/2972.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README.md) | `数组`,`双指针`,`二分查找` | 困难 | 第 120 场双周赛 | -| 2973 | [树中每个节点放置的金币数目](/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README.md) | `树`,`深度优先搜索`,`动态规划`,`排序`,`堆（优先队列）` | 困难 | 第 120 场双周赛 | -| 2974 | [最小数字游戏](/solution/2900-2999/2974.Minimum%20Number%20Game/README.md) | `数组`,`排序`,`模拟`,`堆（优先队列）` | 简单 | 第 377 场周赛 | -| 2975 | [移除栅栏得到的正方形田地的最大面积](/solution/2900-2999/2975.Maximum%20Square%20Area%20by%20Removing%20Fences%20From%20a%20Field/README.md) | `数组`,`哈希表`,`枚举` | 中等 | 第 377 场周赛 | -| 2976 | [转换字符串的最小成本 I](/solution/2900-2999/2976.Minimum%20Cost%20to%20Convert%20String%20I/README.md) | `图`,`数组`,`字符串`,`最短路` | 中等 | 第 377 场周赛 | -| 2977 | [转换字符串的最小成本 II](/solution/2900-2999/2977.Minimum%20Cost%20to%20Convert%20String%20II/README.md) | `图`,`字典树`,`数组`,`字符串`,`动态规划`,`最短路` | 困难 | 第 377 场周赛 | -| 2978 | [对称坐标](/solution/2900-2999/2978.Symmetric%20Coordinates/README.md) | `数据库` | 中等 | 🔒 | -| 2979 | [最贵的无法购买的商品](/solution/2900-2999/2979.Most%20Expensive%20Item%20That%20Can%20Not%20Be%20Bought/README.md) | `数学`,`动态规划`,`数论` | 中等 | 🔒 | -| 2980 | [检查按位或是否存在尾随零](/solution/2900-2999/2980.Check%20if%20Bitwise%20OR%20Has%20Trailing%20Zeros/README.md) | `位运算`,`数组` | 简单 | 第 378 场周赛 | -| 2981 | [找出出现至少三次的最长特殊子字符串 I](/solution/2900-2999/2981.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20I/README.md) | `哈希表`,`字符串`,`二分查找`,`计数`,`滑动窗口` | 中等 | 第 378 场周赛 | -| 2982 | [找出出现至少三次的最长特殊子字符串 II](/solution/2900-2999/2982.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20II/README.md) | `哈希表`,`字符串`,`二分查找`,`计数`,`滑动窗口` | 中等 | 第 378 场周赛 | -| 2983 | [回文串重新排列查询](/solution/2900-2999/2983.Palindrome%20Rearrangement%20Queries/README.md) | `哈希表`,`字符串`,`前缀和` | 困难 | 第 378 场周赛 | -| 2984 | [找到每座城市的高峰通话时间](/solution/2900-2999/2984.Find%20Peak%20Calling%20Hours%20for%20Each%20City/README.md) | `数据库` | 中等 | 🔒 | -| 2985 | [计算订单平均商品数量](/solution/2900-2999/2985.Calculate%20Compressed%20Mean/README.md) | `数据库` | 简单 | 🔒 | -| 2986 | [找到第三笔交易](/solution/2900-2999/2986.Find%20Third%20Transaction/README.md) | `数据库` | 中等 | 🔒 | -| 2987 | [寻找房价最贵的城市](/solution/2900-2999/2987.Find%20Expensive%20Cities/README.md) | `数据库` | 简单 | 🔒 | -| 2988 | [最大部门的经理](/solution/2900-2999/2988.Manager%20of%20the%20Largest%20Department/README.md) | `数据库` | 中等 | 🔒 | -| 2989 | [班级表现](/solution/2900-2999/2989.Class%20Performance/README.md) | `数据库` | 中等 | 🔒 | -| 2990 | [贷款类型](/solution/2900-2999/2990.Loan%20Types/README.md) | `数据库` | 简单 | 🔒 | -| 2991 | [最好的三家酒庄](/solution/2900-2999/2991.Top%20Three%20Wineries/README.md) | `数据库` | 困难 | 🔒 | -| 2992 | [自整除排列的数量](/solution/2900-2999/2992.Number%20of%20Self-Divisible%20Permutations/README.md) | `位运算`,`递归`,`数组`,`动态规划`,`状态压缩` | 中等 | 🔒 | -| 2993 | [发生在周五的交易 I](/solution/2900-2999/2993.Friday%20Purchases%20I/README.md) | `数据库` | 中等 | 🔒 | -| 2994 | [发生在周五的交易 II](/solution/2900-2999/2994.Friday%20Purchases%20II/README.md) | `数据库` | 困难 | 🔒 | -| 2995 | [观众变主播](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README.md) | `数据库` | 困难 | 🔒 | -| 2996 | [大于等于顺序前缀和的最小缺失整数](/solution/2900-2999/2996.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 121 场双周赛 | -| 2997 | [使数组异或和等于 K 的最少操作次数](/solution/2900-2999/2997.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README.md) | `位运算`,`数组` | 中等 | 第 121 场双周赛 | -| 2998 | [使 X 和 Y 相等的最少操作次数](/solution/2900-2999/2998.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README.md) | `广度优先搜索`,`记忆化搜索`,`动态规划` | 中等 | 第 121 场双周赛 | -| 2999 | [统计强大整数的数目](/solution/2900-2999/2999.Count%20the%20Number%20of%20Powerful%20Integers/README.md) | `数学`,`字符串`,`动态规划` | 困难 | 第 121 场双周赛 | -| 3000 | [对角线最长的矩形的面积](/solution/3000-3099/3000.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README.md) | `数组` | 简单 | 第 379 场周赛 | -| 3001 | [捕获黑皇后需要的最少移动次数](/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/README.md) | `数组`,`枚举` | 中等 | 第 379 场周赛 | -| 3002 | [移除后集合的最多元素数](/solution/3000-3099/3002.Maximum%20Size%20of%20a%20Set%20After%20Removals/README.md) | `贪心`,`数组`,`哈希表` | 中等 | 第 379 场周赛 | -| 3003 | [执行操作后的最大分割数量](/solution/3000-3099/3003.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README.md) | `位运算`,`字符串`,`动态规划`,`状态压缩` | 困难 | 第 379 场周赛 | -| 3004 | [相同颜色的最大子树](/solution/3000-3099/3004.Maximum%20Subtree%20of%20the%20Same%20Color/README.md) | `树`,`深度优先搜索`,`数组`,`动态规划` | 中等 | 🔒 | -| 3005 | [最大频率元素计数](/solution/3000-3099/3005.Count%20Elements%20With%20Maximum%20Frequency/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 380 场周赛 | -| 3006 | [找出数组中的美丽下标 I](/solution/3000-3099/3006.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I/README.md) | `双指针`,`字符串`,`二分查找`,`字符串匹配`,`哈希函数`,`滚动哈希` | 中等 | 第 380 场周赛 | -| 3007 | [价值和小于等于 K 的最大数字](/solution/3000-3099/3007.Maximum%20Number%20That%20Sum%20of%20the%20Prices%20Is%20Less%20Than%20or%20Equal%20to%20K/README.md) | `位运算`,`二分查找`,`动态规划` | 中等 | 第 380 场周赛 | -| 3008 | [找出数组中的美丽下标 II](/solution/3000-3099/3008.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20II/README.md) | `双指针`,`字符串`,`二分查找`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 380 场周赛 | -| 3009 | [折线图上的最大交点数量](/solution/3000-3099/3009.Maximum%20Number%20of%20Intersections%20on%20the%20Chart/README.md) | `树状数组`,`几何`,`数组`,`数学` | 困难 | 🔒 | -| 3010 | [将数组分成最小总代价的子数组 I](/solution/3000-3099/3010.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20I/README.md) | `数组`,`枚举`,`排序` | 简单 | 第 122 场双周赛 | -| 3011 | [判断一个数组是否可以变为有序](/solution/3000-3099/3011.Find%20if%20Array%20Can%20Be%20Sorted/README.md) | `位运算`,`数组`,`排序` | 中等 | 第 122 场双周赛 | -| 3012 | [通过操作使数组长度最小](/solution/3000-3099/3012.Minimize%20Length%20of%20Array%20Using%20Operations/README.md) | `贪心`,`数组`,`数学`,`数论` | 中等 | 第 122 场双周赛 | -| 3013 | [将数组分成最小总代价的子数组 II](/solution/3000-3099/3013.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20II/README.md) | `数组`,`哈希表`,`滑动窗口`,`堆（优先队列）` | 困难 | 第 122 场双周赛 | -| 3014 | [输入单词需要的最少按键次数 I](/solution/3000-3099/3014.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20I/README.md) | `贪心`,`数学`,`字符串` | 简单 | 第 381 场周赛 | -| 3015 | [按距离统计房屋对数目 I](/solution/3000-3099/3015.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20I/README.md) | `广度优先搜索`,`图`,`前缀和` | 中等 | 第 381 场周赛 | -| 3016 | [输入单词需要的最少按键次数 II](/solution/3000-3099/3016.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20II/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序` | 中等 | 第 381 场周赛 | -| 3017 | [按距离统计房屋对数目 II](/solution/3000-3099/3017.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20II/README.md) | `图`,`前缀和` | 困难 | 第 381 场周赛 | -| 3018 | [可处理的最大删除操作数 I](/solution/3000-3099/3018.Maximum%20Number%20of%20Removal%20Queries%20That%20Can%20Be%20Processed%20I/README.md) | `数组`,`动态规划` | 困难 | 🔒 | -| 3019 | [按键变更的次数](/solution/3000-3099/3019.Number%20of%20Changing%20Keys/README.md) | `字符串` | 简单 | 第 382 场周赛 | -| 3020 | [子集中元素的最大数量](/solution/3000-3099/3020.Find%20the%20Maximum%20Number%20of%20Elements%20in%20Subset/README.md) | `数组`,`哈希表`,`枚举` | 中等 | 第 382 场周赛 | -| 3021 | [Alice 和 Bob 玩鲜花游戏](/solution/3000-3099/3021.Alice%20and%20Bob%20Playing%20Flower%20Game/README.md) | `数学` | 中等 | 第 382 场周赛 | -| 3022 | [给定操作次数内使剩余元素的或值最小](/solution/3000-3099/3022.Minimize%20OR%20of%20Remaining%20Elements%20Using%20Operations/README.md) | `贪心`,`位运算`,`数组` | 困难 | 第 382 场周赛 | -| 3023 | [在无限流中寻找模式 I](/solution/3000-3099/3023.Find%20Pattern%20in%20Infinite%20Stream%20I/README.md) | `数组`,`字符串匹配`,`滑动窗口`,`哈希函数`,`滚动哈希` | 中等 | 🔒 | -| 3024 | [三角形类型](/solution/3000-3099/3024.Type%20of%20Triangle/README.md) | `数组`,`数学`,`排序` | 简单 | 第 123 场双周赛 | -| 3025 | [人员站位的方案数 I](/solution/3000-3099/3025.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20I/README.md) | `几何`,`数组`,`数学`,`枚举`,`排序` | 中等 | 第 123 场双周赛 | -| 3026 | [最大好子数组和](/solution/3000-3099/3026.Maximum%20Good%20Subarray%20Sum/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 123 场双周赛 | -| 3027 | [人员站位的方案数 II](/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/README.md) | `几何`,`数组`,`数学`,`枚举`,`排序` | 困难 | 第 123 场双周赛 | -| 3028 | [边界上的蚂蚁](/solution/3000-3099/3028.Ant%20on%20the%20Boundary/README.md) | `数组`,`前缀和`,`模拟` | 简单 | 第 383 场周赛 | -| 3029 | [将单词恢复初始状态所需的最短时间 I](/solution/3000-3099/3029.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20I/README.md) | `字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 中等 | 第 383 场周赛 | -| 3030 | [找出网格的区域平均强度](/solution/3000-3099/3030.Find%20the%20Grid%20of%20Region%20Average/README.md) | `数组`,`矩阵` | 中等 | 第 383 场周赛 | -| 3031 | [将单词恢复初始状态所需的最短时间 II](/solution/3000-3099/3031.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20II/README.md) | `字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 383 场周赛 | -| 3032 | [统计各位数字都不同的数字个数 II](/solution/3000-3099/3032.Count%20Numbers%20With%20Unique%20Digits%20II/README.md) | `哈希表`,`数学`,`动态规划` | 简单 | 🔒 | -| 3033 | [修改矩阵](/solution/3000-3099/3033.Modify%20the%20Matrix/README.md) | `数组`,`矩阵` | 简单 | 第 384 场周赛 | -| 3034 | [匹配模式数组的子数组数目 I](/solution/3000-3099/3034.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20I/README.md) | `数组`,`字符串匹配`,`哈希函数`,`滚动哈希` | 中等 | 第 384 场周赛 | -| 3035 | [回文字符串的最大数量](/solution/3000-3099/3035.Maximum%20Palindromes%20After%20Operations/README.md) | `贪心`,`数组`,`哈希表`,`字符串`,`计数`,`排序` | 中等 | 第 384 场周赛 | -| 3036 | [匹配模式数组的子数组数目 II](/solution/3000-3099/3036.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20II/README.md) | `数组`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 384 场周赛 | -| 3037 | [在无限流中寻找模式 II](/solution/3000-3099/3037.Find%20Pattern%20in%20Infinite%20Stream%20II/README.md) | `数组`,`字符串匹配`,`滑动窗口`,`哈希函数`,`滚动哈希` | 困难 | 🔒 | -| 3038 | [相同分数的最大操作数目 I](/solution/3000-3099/3038.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20I/README.md) | `数组`,`模拟` | 简单 | 第 124 场双周赛 | -| 3039 | [进行操作使字符串为空](/solution/3000-3099/3039.Apply%20Operations%20to%20Make%20String%20Empty/README.md) | `数组`,`哈希表`,`计数`,`排序` | 中等 | 第 124 场双周赛 | -| 3040 | [相同分数的最大操作数目 II](/solution/3000-3099/3040.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20II/README.md) | `记忆化搜索`,`数组`,`动态规划` | 中等 | 第 124 场双周赛 | -| 3041 | [修改数组后最大化数组中的连续元素数目](/solution/3000-3099/3041.Maximize%20Consecutive%20Elements%20in%20an%20Array%20After%20Modification/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 124 场双周赛 | -| 3042 | [统计前后缀下标对 I](/solution/3000-3099/3042.Count%20Prefix%20and%20Suffix%20Pairs%20I/README.md) | `字典树`,`数组`,`字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 简单 | 第 385 场周赛 | -| 3043 | [最长公共前缀的长度](/solution/3000-3099/3043.Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/README.md) | `字典树`,`数组`,`哈希表`,`字符串` | 中等 | 第 385 场周赛 | -| 3044 | [出现频率最高的质数](/solution/3000-3099/3044.Most%20Frequent%20Prime/README.md) | `数组`,`哈希表`,`数学`,`计数`,`枚举`,`矩阵`,`数论` | 中等 | 第 385 场周赛 | -| 3045 | [统计前后缀下标对 II](/solution/3000-3099/3045.Count%20Prefix%20and%20Suffix%20Pairs%20II/README.md) | `字典树`,`数组`,`字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 385 场周赛 | -| 3046 | [分割数组](/solution/3000-3099/3046.Split%20the%20Array/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 386 场周赛 | -| 3047 | [求交集区域内的最大正方形面积](/solution/3000-3099/3047.Find%20the%20Largest%20Area%20of%20Square%20Inside%20Two%20Rectangles/README.md) | `几何`,`数组`,`数学` | 中等 | 第 386 场周赛 | -| 3048 | [标记所有下标的最早秒数 I](/solution/3000-3099/3048.Earliest%20Second%20to%20Mark%20Indices%20I/README.md) | `数组`,`二分查找` | 中等 | 第 386 场周赛 | -| 3049 | [标记所有下标的最早秒数 II](/solution/3000-3099/3049.Earliest%20Second%20to%20Mark%20Indices%20II/README.md) | `贪心`,`数组`,`二分查找`,`堆（优先队列）` | 困难 | 第 386 场周赛 | -| 3050 | [披萨配料成本分析](/solution/3000-3099/3050.Pizza%20Toppings%20Cost%20Analysis/README.md) | `数据库` | 中等 | 🔒 | -| 3051 | [寻找数据科学家职位的候选人](/solution/3000-3099/3051.Find%20Candidates%20for%20Data%20Scientist%20Position/README.md) | `数据库` | 简单 | 🔒 | -| 3052 | [最大化商品](/solution/3000-3099/3052.Maximize%20Items/README.md) | `数据库` | 困难 | 🔒 | -| 3053 | [根据长度分类三角形](/solution/3000-3099/3053.Classifying%20Triangles%20by%20Lengths/README.md) | `数据库` | 简单 | 🔒 | -| 3054 | [二叉树节点](/solution/3000-3099/3054.Binary%20Tree%20Nodes/README.md) | `数据库` | 中等 | 🔒 | -| 3055 | [最高欺诈百分位数](/solution/3000-3099/3055.Top%20Percentile%20Fraud/README.md) | `数据库` | 中等 | 🔒 | -| 3056 | [快照分析](/solution/3000-3099/3056.Snaps%20Analysis/README.md) | `数据库` | 中等 | 🔒 | -| 3057 | [员工项目分配](/solution/3000-3099/3057.Employees%20Project%20Allocation/README.md) | `数据库` | 困难 | 🔒 | -| 3058 | [没有共同朋友的朋友](/solution/3000-3099/3058.Friends%20With%20No%20Mutual%20Friends/README.md) | `数据库` | 中等 | 🔒 | -| 3059 | [找到所有不同的邮件域名](/solution/3000-3099/3059.Find%20All%20Unique%20Email%20Domains/README.md) | `数据库` | 简单 | 🔒 | -| 3060 | [时间范围内的用户活动](/solution/3000-3099/3060.User%20Activities%20within%20Time%20Bounds/README.md) | `数据库` | 困难 | 🔒 | -| 3061 | [计算滞留雨水](/solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README.md) | `数据库` | 困难 | 🔒 | -| 3062 | [链表游戏的获胜者](/solution/3000-3099/3062.Winner%20of%20the%20Linked%20List%20Game/README.md) | `链表` | 简单 | 🔒 | -| 3063 | [链表频率](/solution/3000-3099/3063.Linked%20List%20Frequency/README.md) | `哈希表`,`链表`,`计数` | 简单 | 🔒 | -| 3064 | [使用按位查询猜测数字 I](/solution/3000-3099/3064.Guess%20the%20Number%20Using%20Bitwise%20Questions%20I/README.md) | `位运算`,`交互` | 中等 | 🔒 | -| 3065 | [超过阈值的最少操作数 I](/solution/3000-3099/3065.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20I/README.md) | `数组` | 简单 | 第 125 场双周赛 | -| 3066 | [超过阈值的最少操作数 II](/solution/3000-3099/3066.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20II/README.md) | `数组`,`模拟`,`堆（优先队列）` | 中等 | 第 125 场双周赛 | -| 3067 | [在带权树网络中统计可连接服务器对数目](/solution/3000-3099/3067.Count%20Pairs%20of%20Connectable%20Servers%20in%20a%20Weighted%20Tree%20Network/README.md) | `树`,`深度优先搜索`,`数组` | 中等 | 第 125 场双周赛 | -| 3068 | [最大节点价值之和](/solution/3000-3099/3068.Find%20the%20Maximum%20Sum%20of%20Node%20Values/README.md) | `贪心`,`位运算`,`树`,`数组`,`动态规划`,`排序` | 困难 | 第 125 场双周赛 | -| 3069 | [将元素分配到两个数组中 I](/solution/3000-3099/3069.Distribute%20Elements%20Into%20Two%20Arrays%20I/README.md) | `数组`,`模拟` | 简单 | 第 387 场周赛 | -| 3070 | [元素和小于等于 k 的子矩阵的数目](/solution/3000-3099/3070.Count%20Submatrices%20with%20Top-Left%20Element%20and%20Sum%20Less%20Than%20k/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 387 场周赛 | -| 3071 | [在矩阵上写出字母 Y 所需的最少操作次数](/solution/3000-3099/3071.Minimum%20Operations%20to%20Write%20the%20Letter%20Y%20on%20a%20Grid/README.md) | `数组`,`哈希表`,`计数`,`矩阵` | 中等 | 第 387 场周赛 | -| 3072 | [将元素分配到两个数组中 II](/solution/3000-3099/3072.Distribute%20Elements%20Into%20Two%20Arrays%20II/README.md) | `树状数组`,`线段树`,`数组`,`模拟` | 困难 | 第 387 场周赛 | -| 3073 | [最大递增三元组](/solution/3000-3099/3073.Maximum%20Increasing%20Triplet%20Value/README.md) | `数组`,`有序集合` | 中等 | 🔒 | -| 3074 | [重新分装苹果](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 388 场周赛 | -| 3075 | [幸福值最大化的选择方案](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 388 场周赛 | -| 3076 | [数组中的最短非公共子字符串](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README.md) | `字典树`,`数组`,`哈希表`,`字符串` | 中等 | 第 388 场周赛 | -| 3077 | [K 个不相交子数组的最大能量值](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README.md) | `数组`,`动态规划`,`前缀和` | 困难 | 第 388 场周赛 | -| 3078 | [矩阵中的字母数字模式匹配 I](/solution/3000-3099/3078.Match%20Alphanumerical%20Pattern%20in%20Matrix%20I/README.md) | `数组`,`哈希表`,`字符串`,`矩阵` | 中等 | 🔒 | -| 3079 | [求出加密整数的和](/solution/3000-3099/3079.Find%20the%20Sum%20of%20Encrypted%20Integers/README.md) | `数组`,`数学` | 简单 | 第 126 场双周赛 | -| 3080 | [执行操作标记数组中的元素](/solution/3000-3099/3080.Mark%20Elements%20on%20Array%20by%20Performing%20Queries/README.md) | `数组`,`哈希表`,`排序`,`模拟`,`堆（优先队列）` | 中等 | 第 126 场双周赛 | -| 3081 | [替换字符串中的问号使分数最小](/solution/3000-3099/3081.Replace%20Question%20Marks%20in%20String%20to%20Minimize%20Its%20Value/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序`,`堆（优先队列）` | 中等 | 第 126 场双周赛 | -| 3082 | [求出所有子序列的能量和](/solution/3000-3099/3082.Find%20the%20Sum%20of%20the%20Power%20of%20All%20Subsequences/README.md) | `数组`,`动态规划` | 困难 | 第 126 场双周赛 | -| 3083 | [字符串及其反转中是否存在同一子字符串](/solution/3000-3099/3083.Existence%20of%20a%20Substring%20in%20a%20String%20and%20Its%20Reverse/README.md) | `哈希表`,`字符串` | 简单 | 第 389 场周赛 | -| 3084 | [统计以给定字符开头和结尾的子字符串总数](/solution/3000-3099/3084.Count%20Substrings%20Starting%20and%20Ending%20with%20Given%20Character/README.md) | `数学`,`字符串`,`计数` | 中等 | 第 389 场周赛 | -| 3085 | [成为 K 特殊字符串需要删除的最少字符数](/solution/3000-3099/3085.Minimum%20Deletions%20to%20Make%20String%20K-Special/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序` | 中等 | 第 389 场周赛 | -| 3086 | [拾起 K 个 1 需要的最少行动次数](/solution/3000-3099/3086.Minimum%20Moves%20to%20Pick%20K%20Ones/README.md) | `贪心`,`数组`,`前缀和`,`滑动窗口` | 困难 | 第 389 场周赛 | -| 3087 | [查找热门话题标签](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README.md) | `数据库` | 中等 | 🔒 | -| 3088 | [使字符串反回文](/solution/3000-3099/3088.Make%20String%20Anti-palindrome/README.md) | `贪心`,`字符串`,`排序` | 困难 | 🔒 | -| 3089 | [查找突发行为](/solution/3000-3099/3089.Find%20Bursty%20Behavior/README.md) | `数据库` | 中等 | 🔒 | -| 3090 | [每个字符最多出现两次的最长子字符串](/solution/3000-3099/3090.Maximum%20Length%20Substring%20With%20Two%20Occurrences/README.md) | `哈希表`,`字符串`,`滑动窗口` | 简单 | 第 390 场周赛 | -| 3091 | [执行操作使数据元素之和大于等于 K](/solution/3000-3099/3091.Apply%20Operations%20to%20Make%20Sum%20of%20Array%20Greater%20Than%20or%20Equal%20to%20k/README.md) | `贪心`,`数学`,`枚举` | 中等 | 第 390 场周赛 | -| 3092 | [最高频率的 ID](/solution/3000-3099/3092.Most%20Frequent%20IDs/README.md) | `数组`,`哈希表`,`有序集合`,`堆（优先队列）` | 中等 | 第 390 场周赛 | -| 3093 | [最长公共后缀查询](/solution/3000-3099/3093.Longest%20Common%20Suffix%20Queries/README.md) | `字典树`,`数组`,`字符串` | 困难 | 第 390 场周赛 | -| 3094 | [使用按位查询猜测数字 II](/solution/3000-3099/3094.Guess%20the%20Number%20Using%20Bitwise%20Questions%20II/README.md) | `位运算`,`交互` | 中等 | 🔒 | -| 3095 | [或值至少 K 的最短子数组 I](/solution/3000-3099/3095.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20I/README.md) | `位运算`,`数组`,`滑动窗口` | 简单 | 第 127 场双周赛 | -| 3096 | [得到更多分数的最少关卡数目](/solution/3000-3099/3096.Minimum%20Levels%20to%20Gain%20More%20Points/README.md) | `数组`,`前缀和` | 中等 | 第 127 场双周赛 | -| 3097 | [或值至少为 K 的最短子数组 II](/solution/3000-3099/3097.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20II/README.md) | `位运算`,`数组`,`滑动窗口` | 中等 | 第 127 场双周赛 | -| 3098 | [求出所有子序列的能量和](/solution/3000-3099/3098.Find%20the%20Sum%20of%20Subsequence%20Powers/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 127 场双周赛 | -| 3099 | [哈沙德数](/solution/3000-3099/3099.Harshad%20Number/README.md) | `数学` | 简单 | 第 391 场周赛 | -| 3100 | [换水问题 II](/solution/3100-3199/3100.Water%20Bottles%20II/README.md) | `数学`,`模拟` | 中等 | 第 391 场周赛 | -| 3101 | [交替子数组计数](/solution/3100-3199/3101.Count%20Alternating%20Subarrays/README.md) | `数组`,`数学` | 中等 | 第 391 场周赛 | -| 3102 | [最小化曼哈顿距离](/solution/3100-3199/3102.Minimize%20Manhattan%20Distances/README.md) | `几何`,`数组`,`数学`,`有序集合`,`排序` | 困难 | 第 391 场周赛 | -| 3103 | [查找热门话题标签 II](/solution/3100-3199/3103.Find%20Trending%20Hashtags%20II/README.md) | `数据库` | 困难 | 🔒 | -| 3104 | [Find Longest Self-Contained Substring](/solution/3100-3199/3104.Find%20Longest%20Self-Contained%20Substring/README.md) | `哈希表`,`字符串`,`二分查找`,`前缀和` | 困难 | 🔒 | -| 3105 | [最长的严格递增或递减子数组](/solution/3100-3199/3105.Longest%20Strictly%20Increasing%20or%20Strictly%20Decreasing%20Subarray/README.md) | `数组` | 简单 | 第 392 场周赛 | -| 3106 | [满足距离约束且字典序最小的字符串](/solution/3100-3199/3106.Lexicographically%20Smallest%20String%20After%20Operations%20With%20Constraint/README.md) | `贪心`,`字符串` | 中等 | 第 392 场周赛 | -| 3107 | [使数组中位数等于 K 的最少操作数](/solution/3100-3199/3107.Minimum%20Operations%20to%20Make%20Median%20of%20Array%20Equal%20to%20K/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 392 场周赛 | -| 3108 | [带权图里旅途的最小代价](/solution/3100-3199/3108.Minimum%20Cost%20Walk%20in%20Weighted%20Graph/README.md) | `位运算`,`并查集`,`图`,`数组` | 困难 | 第 392 场周赛 | -| 3109 | [Find the Index of Permutation](/solution/3100-3199/3109.Find%20the%20Index%20of%20Permutation/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 中等 | 🔒 | -| 3110 | [字符串的分数](/solution/3100-3199/3110.Score%20of%20a%20String/README.md) | `字符串` | 简单 | 第 128 场双周赛 | -| 3111 | [覆盖所有点的最少矩形数目](/solution/3100-3199/3111.Minimum%20Rectangles%20to%20Cover%20Points/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 128 场双周赛 | -| 3112 | [访问消失节点的最少时间](/solution/3100-3199/3112.Minimum%20Time%20to%20Visit%20Disappearing%20Nodes/README.md) | `图`,`数组`,`最短路`,`堆（优先队列）` | 中等 | 第 128 场双周赛 | -| 3113 | [边界元素是最大值的子数组数目](/solution/3100-3199/3113.Find%20the%20Number%20of%20Subarrays%20Where%20Boundary%20Elements%20Are%20Maximum/README.md) | `栈`,`数组`,`二分查找`,`单调栈` | 困难 | 第 128 场双周赛 | -| 3114 | [替换字符可以得到的最晚时间](/solution/3100-3199/3114.Latest%20Time%20You%20Can%20Obtain%20After%20Replacing%20Characters/README.md) | `字符串`,`枚举` | 简单 | 第 393 场周赛 | -| 3115 | [质数的最大距离](/solution/3100-3199/3115.Maximum%20Prime%20Difference/README.md) | `数组`,`数学`,`数论` | 中等 | 第 393 场周赛 | -| 3116 | [单面值组合的第 K 小金额](/solution/3100-3199/3116.Kth%20Smallest%20Amount%20With%20Single%20Denomination%20Combination/README.md) | `位运算`,`数组`,`数学`,`二分查找`,`组合数学`,`数论` | 困难 | 第 393 场周赛 | -| 3117 | [划分数组得到最小的值之和](/solution/3100-3199/3117.Minimum%20Sum%20of%20Values%20by%20Dividing%20Array/README.md) | `位运算`,`线段树`,`队列`,`数组`,`二分查找`,`动态规划` | 困难 | 第 393 场周赛 | -| 3118 | [Friday Purchase III](/solution/3100-3199/3118.Friday%20Purchase%20III/README.md) | `数据库` | 中等 | 🔒 | -| 3119 | [最大数量的可修复坑洼](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README.md) | `贪心`,`字符串`,`排序` | 中等 | 🔒 | -| 3120 | [统计特殊字母的数量 I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README.md) | `哈希表`,`字符串` | 简单 | 第 394 场周赛 | -| 3121 | [统计特殊字母的数量 II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README.md) | `哈希表`,`字符串` | 中等 | 第 394 场周赛 | -| 3122 | [使矩阵满足条件的最少操作次数](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 394 场周赛 | -| 3123 | [最短路径中的边](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`最短路`,`堆（优先队列）` | 困难 | 第 394 场周赛 | -| 3124 | [查找最长的电话](/solution/3100-3199/3124.Find%20Longest%20Calls/README.md) | `数据库` | 中等 | 🔒 | -| 3125 | [使得按位与结果为 0 的最大数字](/solution/3100-3199/3125.Maximum%20Number%20That%20Makes%20Result%20of%20Bitwise%20AND%20Zero/README.md) | `贪心`,`字符串`,`排序` | 中等 | 🔒 | -| 3126 | [服务器利用时间](/solution/3100-3199/3126.Server%20Utilization%20Time/README.md) | `数据库` | 中等 | 🔒 | -| 3127 | [构造相同颜色的正方形](/solution/3100-3199/3127.Make%20a%20Square%20with%20the%20Same%20Color/README.md) | `数组`,`枚举`,`矩阵` | 简单 | 第 129 场双周赛 | -| 3128 | [直角三角形](/solution/3100-3199/3128.Right%20Triangles/README.md) | `数组`,`哈希表`,`数学`,`组合数学`,`计数` | 中等 | 第 129 场双周赛 | -| 3129 | [找出所有稳定的二进制数组 I](/solution/3100-3199/3129.Find%20All%20Possible%20Stable%20Binary%20Arrays%20I/README.md) | `动态规划`,`前缀和` | 中等 | 第 129 场双周赛 | -| 3130 | [找出所有稳定的二进制数组 II](/solution/3100-3199/3130.Find%20All%20Possible%20Stable%20Binary%20Arrays%20II/README.md) | `动态规划`,`前缀和` | 困难 | 第 129 场双周赛 | -| 3131 | [找出与数组相加的整数 I](/solution/3100-3199/3131.Find%20the%20Integer%20Added%20to%20Array%20I/README.md) | `数组` | 简单 | 第 395 场周赛 | -| 3132 | [找出与数组相加的整数 II](/solution/3100-3199/3132.Find%20the%20Integer%20Added%20to%20Array%20II/README.md) | `数组`,`双指针`,`枚举`,`排序` | 中等 | 第 395 场周赛 | -| 3133 | [数组最后一个元素的最小值](/solution/3100-3199/3133.Minimum%20Array%20End/README.md) | `位运算` | 中等 | 第 395 场周赛 | -| 3134 | [找出唯一性数组的中位数](/solution/3100-3199/3134.Find%20the%20Median%20of%20the%20Uniqueness%20Array/README.md) | `数组`,`哈希表`,`二分查找`,`滑动窗口` | 困难 | 第 395 场周赛 | -| 3135 | [通过添加或删除结尾字符来同化字符串](/solution/3100-3199/3135.Equalize%20Strings%20by%20Adding%20or%20Removing%20Characters%20at%20Ends/README.md) | `字符串`,`二分查找`,`动态规划`,`滑动窗口`,`哈希函数` | 中等 | 🔒 | -| 3136 | [有效单词](/solution/3100-3199/3136.Valid%20Word/README.md) | `字符串` | 简单 | 第 396 场周赛 | -| 3137 | [K 周期字符串需要的最少操作次数](/solution/3100-3199/3137.Minimum%20Number%20of%20Operations%20to%20Make%20Word%20K-Periodic/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 396 场周赛 | -| 3138 | [同位字符串连接的最小长度](/solution/3100-3199/3138.Minimum%20Length%20of%20Anagram%20Concatenation/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 396 场周赛 | -| 3139 | [使数组中所有元素相等的最小开销](/solution/3100-3199/3139.Minimum%20Cost%20to%20Equalize%20Array/README.md) | `贪心`,`数组`,`枚举` | 困难 | 第 396 场周赛 | -| 3140 | [连续空余座位 II](/solution/3100-3199/3140.Consecutive%20Available%20Seats%20II/README.md) | `数据库` | 中等 | 🔒 | -| 3141 | [最大汉明距离](/solution/3100-3199/3141.Maximum%20Hamming%20Distances/README.md) | `位运算`,`广度优先搜索`,`数组` | 困难 | 🔒 | -| 3142 | [判断矩阵是否满足条件](/solution/3100-3199/3142.Check%20if%20Grid%20Satisfies%20Conditions/README.md) | `数组`,`矩阵` | 简单 | 第 130 场双周赛 | -| 3143 | [正方形中的最多点数](/solution/3100-3199/3143.Maximum%20Points%20Inside%20the%20Square/README.md) | `数组`,`哈希表`,`字符串`,`二分查找`,`排序` | 中等 | 第 130 场双周赛 | -| 3144 | [分割字符频率相等的最少子字符串](/solution/3100-3199/3144.Minimum%20Substring%20Partition%20of%20Equal%20Character%20Frequency/README.md) | `哈希表`,`字符串`,`动态规划`,`计数` | 中等 | 第 130 场双周赛 | -| 3145 | [大数组元素的乘积](/solution/3100-3199/3145.Find%20Products%20of%20Elements%20of%20Big%20Array/README.md) | `位运算`,`数组`,`二分查找` | 困难 | 第 130 场双周赛 | -| 3146 | [两个字符串的排列差](/solution/3100-3199/3146.Permutation%20Difference%20between%20Two%20Strings/README.md) | `哈希表`,`字符串` | 简单 | 第 397 场周赛 | -| 3147 | [从魔法师身上吸取的最大能量](/solution/3100-3199/3147.Taking%20Maximum%20Energy%20From%20the%20Mystic%20Dungeon/README.md) | `数组`,`前缀和` | 中等 | 第 397 场周赛 | -| 3148 | [矩阵中的最大得分](/solution/3100-3199/3148.Maximum%20Difference%20Score%20in%20a%20Grid/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 397 场周赛 | -| 3149 | [找出分数最低的排列](/solution/3100-3199/3149.Find%20the%20Minimum%20Cost%20Array%20Permutation/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 397 场周赛 | -| 3150 | [无效的推文 II](/solution/3100-3199/3150.Invalid%20Tweets%20II/README.md) | `数据库` | 简单 | 🔒 | -| 3151 | [特殊数组 I](/solution/3100-3199/3151.Special%20Array%20I/README.md) | `数组` | 简单 | 第 398 场周赛 | -| 3152 | [特殊数组 II](/solution/3100-3199/3152.Special%20Array%20II/README.md) | `数组`,`二分查找`,`前缀和` | 中等 | 第 398 场周赛 | -| 3153 | [所有数对中数位不同之和](/solution/3100-3199/3153.Sum%20of%20Digit%20Differences%20of%20All%20Pairs/README.md) | `数组`,`哈希表`,`数学`,`计数` | 中等 | 第 398 场周赛 | -| 3154 | [到达第 K 级台阶的方案数](/solution/3100-3199/3154.Find%20Number%20of%20Ways%20to%20Reach%20the%20K-th%20Stair/README.md) | `位运算`,`记忆化搜索`,`数学`,`动态规划`,`组合数学` | 困难 | 第 398 场周赛 | -| 3155 | [可升级服务器的最大数量](/solution/3100-3199/3155.Maximum%20Number%20of%20Upgradable%20Servers/README.md) | `数组`,`数学`,`二分查找` | 中等 | 🔒 | -| 3156 | [员工任务持续时间和并发任务](/solution/3100-3199/3156.Employee%20Task%20Duration%20and%20Concurrent%20Tasks/README.md) | `数据库` | 困难 | 🔒 | -| 3157 | [找到具有最小和的树的层数](/solution/3100-3199/3157.Find%20the%20Level%20of%20Tree%20with%20Minimum%20Sum/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | -| 3158 | [求出出现两次数字的 XOR 值](/solution/3100-3199/3158.Find%20the%20XOR%20of%20Numbers%20Which%20Appear%20Twice/README.md) | `位运算`,`数组`,`哈希表` | 简单 | 第 131 场双周赛 | -| 3159 | [查询数组中元素的出现位置](/solution/3100-3199/3159.Find%20Occurrences%20of%20an%20Element%20in%20an%20Array/README.md) | `数组`,`哈希表` | 中等 | 第 131 场双周赛 | -| 3160 | [所有球里面不同颜色的数目](/solution/3100-3199/3160.Find%20the%20Number%20of%20Distinct%20Colors%20Among%20the%20Balls/README.md) | `数组`,`哈希表`,`模拟` | 中等 | 第 131 场双周赛 | -| 3161 | [物块放置查询](/solution/3100-3199/3161.Block%20Placement%20Queries/README.md) | `树状数组`,`线段树`,`数组`,`二分查找` | 困难 | 第 131 场双周赛 | -| 3162 | [优质数对的总数 I](/solution/3100-3199/3162.Find%20the%20Number%20of%20Good%20Pairs%20I/README.md) | `数组`,`哈希表` | 简单 | 第 399 场周赛 | -| 3163 | [压缩字符串 III](/solution/3100-3199/3163.String%20Compression%20III/README.md) | `字符串` | 中等 | 第 399 场周赛 | -| 3164 | [优质数对的总数 II](/solution/3100-3199/3164.Find%20the%20Number%20of%20Good%20Pairs%20II/README.md) | `数组`,`哈希表` | 中等 | 第 399 场周赛 | -| 3165 | [不包含相邻元素的子序列的最大和](/solution/3100-3199/3165.Maximum%20Sum%20of%20Subsequence%20With%20Non-adjacent%20Elements/README.md) | `线段树`,`数组`,`分治`,`动态规划` | 困难 | 第 399 场周赛 | -| 3166 | [计算停车费与时长](/solution/3100-3199/3166.Calculate%20Parking%20Fees%20and%20Duration/README.md) | `数据库` | 中等 | 🔒 | -| 3167 | [字符串的更好压缩](/solution/3100-3199/3167.Better%20Compression%20of%20String/README.md) | `哈希表`,`字符串`,`计数`,`排序` | 中等 | 🔒 | -| 3168 | [候诊室中的最少椅子数](/solution/3100-3199/3168.Minimum%20Number%20of%20Chairs%20in%20a%20Waiting%20Room/README.md) | `字符串`,`模拟` | 简单 | 第 400 场周赛 | -| 3169 | [无需开会的工作日](/solution/3100-3199/3169.Count%20Days%20Without%20Meetings/README.md) | `数组`,`排序` | 中等 | 第 400 场周赛 | -| 3170 | [删除星号以后字典序最小的字符串](/solution/3100-3199/3170.Lexicographically%20Minimum%20String%20After%20Removing%20Stars/README.md) | `栈`,`贪心`,`哈希表`,`字符串`,`堆（优先队列）` | 中等 | 第 400 场周赛 | -| 3171 | [找到按位或最接近 K 的子数组](/solution/3100-3199/3171.Find%20Subarray%20With%20Bitwise%20OR%20Closest%20to%20K/README.md) | `位运算`,`线段树`,`数组`,`二分查找` | 困难 | 第 400 场周赛 | -| 3172 | [第二天验证](/solution/3100-3199/3172.Second%20Day%20Verification/README.md) | `数据库` | 简单 | 🔒 | -| 3173 | [相邻元素的按位或](/solution/3100-3199/3173.Bitwise%20OR%20of%20Adjacent%20Elements/README.md) | `位运算`,`数组` | 简单 | 🔒 | -| 3174 | [清除数字](/solution/3100-3199/3174.Clear%20Digits/README.md) | `哈希表`,`字符串`,`模拟` | 简单 | 第 132 场双周赛 | -| 3175 | [找到连续赢 K 场比赛的第一位玩家](/solution/3100-3199/3175.Find%20The%20First%20Player%20to%20win%20K%20Games%20in%20a%20Row/README.md) | `数组`,`模拟` | 中等 | 第 132 场双周赛 | -| 3176 | [求出最长好子序列 I](/solution/3100-3199/3176.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20I/README.md) | `数组`,`哈希表`,`动态规划` | 中等 | 第 132 场双周赛 | -| 3177 | [求出最长好子序列 II](/solution/3100-3199/3177.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20II/README.md) | `数组`,`哈希表`,`动态规划` | 困难 | 第 132 场双周赛 | -| 3178 | [找出 K 秒后拿着球的孩子](/solution/3100-3199/3178.Find%20the%20Child%20Who%20Has%20the%20Ball%20After%20K%20Seconds/README.md) | `数学`,`模拟` | 简单 | 第 401 场周赛 | -| 3179 | [K 秒后第 N 个元素的值](/solution/3100-3199/3179.Find%20the%20N-th%20Value%20After%20K%20Seconds/README.md) | `数组`,`数学`,`组合数学`,`前缀和`,`模拟` | 中等 | 第 401 场周赛 | -| 3180 | [执行操作可获得的最大总奖励 I](/solution/3100-3199/3180.Maximum%20Total%20Reward%20Using%20Operations%20I/README.md) | `数组`,`动态规划` | 中等 | 第 401 场周赛 | -| 3181 | [执行操作可获得的最大总奖励 II](/solution/3100-3199/3181.Maximum%20Total%20Reward%20Using%20Operations%20II/README.md) | `位运算`,`数组`,`动态规划` | 困难 | 第 401 场周赛 | -| 3182 | [查找得分最高的学生](/solution/3100-3199/3182.Find%20Top%20Scoring%20Students/README.md) | `数据库` | 中等 | 🔒 | -| 3183 | [达到总和的方法数量](/solution/3100-3199/3183.The%20Number%20of%20Ways%20to%20Make%20the%20Sum/README.md) | `数组`,`动态规划` | 中等 | 🔒 | -| 3184 | [构成整天的下标对数目 I](/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 402 场周赛 | -| 3185 | [构成整天的下标对数目 II](/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 402 场周赛 | -| 3186 | [施咒的最大总伤害](/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`动态规划`,`计数`,`排序` | 中等 | 第 402 场周赛 | -| 3187 | [数组中的峰值](/solution/3100-3199/3187.Peaks%20in%20Array/README.md) | `树状数组`,`线段树`,`数组` | 困难 | 第 402 场周赛 | -| 3188 | [查找得分最高的学生 II](/solution/3100-3199/3188.Find%20Top%20Scoring%20Students%20II/README.md) | | 困难 | 🔒 | -| 3189 | [Minimum Moves to Get a Peaceful Board](/solution/3100-3199/3189.Minimum%20Moves%20to%20Get%20a%20Peaceful%20Board/README.md) | | 中等 | 🔒 | - -## 版权 - -本项目著作权归 [GitHub 开源社区 Doocs](https://github.com/doocs) 所有，商业转载请联系 @yanglbme 获得授权，非商业转载请注明出处。 - -## 联系我们 - -欢迎各位小伙伴们添加 @yanglbme 的个人微信（微信号：YLB0109），备注 「**leetcode**」。后续我们会创建算法、技术相关的交流群，大家一起交流学习，分享经验，共同进步。 - -| | -| ------------------------------------------------------------------------------------------------------------------------------ | +# LeetCode + +[English Version](/solution/README_EN.md) + +## 题解 + +列表所有题解均由 [开源社区 Doocs](https://github.com/doocs) 贡献者提供，正在完善中，欢迎贡献你的题解！ + +快速搜索题号、题解、标签等，请善用 Control + F（或者 Command + F）。 + +| 题号 | 题解 | 标签 | 难度 | 备注 | +| ---- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------------------------- | ---- | --------------- | +| 0001 | [两数之和](/solution/0000-0099/0001.Two%20Sum/README.md) | `数组`,`哈希表` | 简单 | | +| 0002 | [两数相加](/solution/0000-0099/0002.Add%20Two%20Numbers/README.md) | `递归`,`链表`,`数学` | 中等 | | +| 0003 | [无重复字符的最长子串](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | | +| 0004 | [寻找两个正序数组的中位数](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md) | `数组`,`二分查找`,`分治` | 困难 | | +| 0005 | [最长回文子串](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md) | `双指针`,`字符串`,`动态规划` | 中等 | | +| 0006 | [Z 字形变换](/solution/0000-0099/0006.Zigzag%20Conversion/README.md) | `字符串` | 中等 | | +| 0007 | [整数反转](/solution/0000-0099/0007.Reverse%20Integer/README.md) | `数学` | 中等 | | +| 0008 | [字符串转换整数 (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md) | `字符串` | 中等 | | +| 0009 | [回文数](/solution/0000-0099/0009.Palindrome%20Number/README.md) | `数学` | 简单 | | +| 0010 | [正则表达式匹配](/solution/0000-0099/0010.Regular%20Expression%20Matching/README.md) | `递归`,`字符串`,`动态规划` | 困难 | | +| 0011 | [盛最多水的容器](/solution/0000-0099/0011.Container%20With%20Most%20Water/README.md) | `贪心`,`数组`,`双指针` | 中等 | | +| 0012 | [整数转罗马数字](/solution/0000-0099/0012.Integer%20to%20Roman/README.md) | `哈希表`,`数学`,`字符串` | 中等 | | +| 0013 | [罗马数字转整数](/solution/0000-0099/0013.Roman%20to%20Integer/README.md) | `哈希表`,`数学`,`字符串` | 简单 | | +| 0014 | [最长公共前缀](/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md) | `字典树`,`字符串` | 简单 | | +| 0015 | [三数之和](/solution/0000-0099/0015.3Sum/README.md) | `数组`,`双指针`,`排序` | 中等 | | +| 0016 | [最接近的三数之和](/solution/0000-0099/0016.3Sum%20Closest/README.md) | `数组`,`双指针`,`排序` | 中等 | | +| 0017 | [电话号码的字母组合](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README.md) | `哈希表`,`字符串`,`回溯` | 中等 | | +| 0018 | [四数之和](/solution/0000-0099/0018.4Sum/README.md) | `数组`,`双指针`,`排序` | 中等 | | +| 0019 | [删除链表的倒数第 N 个结点](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README.md) | `链表`,`双指针` | 中等 | | +| 0020 | [有效的括号](/solution/0000-0099/0020.Valid%20Parentheses/README.md) | `栈`,`字符串` | 简单 | | +| 0021 | [合并两个有序链表](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README.md) | `递归`,`链表` | 简单 | | +| 0022 | [括号生成](/solution/0000-0099/0022.Generate%20Parentheses/README.md) | `字符串`,`动态规划`,`回溯` | 中等 | | +| 0023 | [合并 K 个升序链表](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README.md) | `链表`,`分治`,`堆（优先队列）`,`归并排序` | 困难 | | +| 0024 | [两两交换链表中的节点](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README.md) | `递归`,`链表` | 中等 | | +| 0025 | [K 个一组翻转链表](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README.md) | `递归`,`链表` | 困难 | | +| 0026 | [删除有序数组中的重复项](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md) | `数组`,`双指针` | 简单 | | +| 0027 | [移除元素](/solution/0000-0099/0027.Remove%20Element/README.md) | `数组`,`双指针` | 简单 | | +| 0028 | [找出字符串中第一个匹配项的下标](/solution/0000-0099/0028.Find%20the%20Index%20of%20the%20First%20Occurrence%20in%20a%20String/README.md) | `双指针`,`字符串`,`字符串匹配` | 简单 | | +| 0029 | [两数相除](/solution/0000-0099/0029.Divide%20Two%20Integers/README.md) | `位运算`,`数学` | 中等 | | +| 0030 | [串联所有单词的子串](/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README.md) | `哈希表`,`字符串`,`滑动窗口` | 困难 | | +| 0031 | [下一个排列](/solution/0000-0099/0031.Next%20Permutation/README.md) | `数组`,`双指针` | 中等 | | +| 0032 | [最长有效括号](/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README.md) | `栈`,`字符串`,`动态规划` | 困难 | | +| 0033 | [搜索旋转排序数组](/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README.md) | `数组`,`二分查找` | 中等 | | +| 0034 | [在排序数组中查找元素的第一个和最后一个位置](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md) | `数组`,`二分查找` | 中等 | | +| 0035 | [搜索插入位置](/solution/0000-0099/0035.Search%20Insert%20Position/README.md) | `数组`,`二分查找` | 简单 | | +| 0036 | [有效的数独](/solution/0000-0099/0036.Valid%20Sudoku/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | | +| 0037 | [解数独](/solution/0000-0099/0037.Sudoku%20Solver/README.md) | `数组`,`哈希表`,`回溯`,`矩阵` | 困难 | | +| 0038 | [外观数列](/solution/0000-0099/0038.Count%20and%20Say/README.md) | `字符串` | 中等 | | +| 0039 | [组合总和](/solution/0000-0099/0039.Combination%20Sum/README.md) | `数组`,`回溯` | 中等 | | +| 0040 | [组合总和 II](/solution/0000-0099/0040.Combination%20Sum%20II/README.md) | `数组`,`回溯` | 中等 | | +| 0041 | [缺失的第一个正数](/solution/0000-0099/0041.First%20Missing%20Positive/README.md) | `数组`,`哈希表` | 困难 | | +| 0042 | [接雨水](/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md) | `栈`,`数组`,`双指针`,`动态规划`,`单调栈` | 困难 | | +| 0043 | [字符串相乘](/solution/0000-0099/0043.Multiply%20Strings/README.md) | `数学`,`字符串`,`模拟` | 中等 | | +| 0044 | [通配符匹配](/solution/0000-0099/0044.Wildcard%20Matching/README.md) | `贪心`,`递归`,`字符串`,`动态规划` | 困难 | | +| 0045 | [跳跃游戏 II](/solution/0000-0099/0045.Jump%20Game%20II/README.md) | `贪心`,`数组`,`动态规划` | 中等 | | +| 0046 | [全排列](/solution/0000-0099/0046.Permutations/README.md) | `数组`,`回溯` | 中等 | | +| 0047 | [全排列 II](/solution/0000-0099/0047.Permutations%20II/README.md) | `数组`,`回溯` | 中等 | | +| 0048 | [旋转图像](/solution/0000-0099/0048.Rotate%20Image/README.md) | `数组`,`数学`,`矩阵` | 中等 | | +| 0049 | [字母异位词分组](/solution/0000-0099/0049.Group%20Anagrams/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | | +| 0050 | [Pow(x, n)](/solution/0000-0099/0050.Pow%28x%2C%20n%29/README.md) | `递归`,`数学` | 中等 | | +| 0051 | [N 皇后](/solution/0000-0099/0051.N-Queens/README.md) | `数组`,`回溯` | 困难 | | +| 0052 | [N 皇后 II](/solution/0000-0099/0052.N-Queens%20II/README.md) | `回溯` | 困难 | | +| 0053 | [最大子数组和](/solution/0000-0099/0053.Maximum%20Subarray/README.md) | `数组`,`分治`,`动态规划` | 中等 | | +| 0054 | [螺旋矩阵](/solution/0000-0099/0054.Spiral%20Matrix/README.md) | `数组`,`矩阵`,`模拟` | 中等 | | +| 0055 | [跳跃游戏](/solution/0000-0099/0055.Jump%20Game/README.md) | `贪心`,`数组`,`动态规划` | 中等 | | +| 0056 | [合并区间](/solution/0000-0099/0056.Merge%20Intervals/README.md) | `数组`,`排序` | 中等 | | +| 0057 | [插入区间](/solution/0000-0099/0057.Insert%20Interval/README.md) | `数组` | 中等 | | +| 0058 | [最后一个单词的长度](/solution/0000-0099/0058.Length%20of%20Last%20Word/README.md) | `字符串` | 简单 | | +| 0059 | [螺旋矩阵 II](/solution/0000-0099/0059.Spiral%20Matrix%20II/README.md) | `数组`,`矩阵`,`模拟` | 中等 | | +| 0060 | [排列序列](/solution/0000-0099/0060.Permutation%20Sequence/README.md) | `递归`,`数学` | 困难 | | +| 0061 | [旋转链表](/solution/0000-0099/0061.Rotate%20List/README.md) | `链表`,`双指针` | 中等 | | +| 0062 | [不同路径](/solution/0000-0099/0062.Unique%20Paths/README.md) | `数学`,`动态规划`,`组合数学` | 中等 | | +| 0063 | [不同路径 II](/solution/0000-0099/0063.Unique%20Paths%20II/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | | +| 0064 | [最小路径和](/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | | +| 0065 | [有效数字](/solution/0000-0099/0065.Valid%20Number/README.md) | `字符串` | 困难 | | +| 0066 | [加一](/solution/0000-0099/0066.Plus%20One/README.md) | `数组`,`数学` | 简单 | | +| 0067 | [二进制求和](/solution/0000-0099/0067.Add%20Binary/README.md) | `位运算`,`数学`,`字符串`,`模拟` | 简单 | | +| 0068 | [文本左右对齐](/solution/0000-0099/0068.Text%20Justification/README.md) | `数组`,`字符串`,`模拟` | 困难 | | +| 0069 | [x 的平方根 ](/solution/0000-0099/0069.Sqrt%28x%29/README.md) | `数学`,`二分查找` | 简单 | | +| 0070 | [爬楼梯](/solution/0000-0099/0070.Climbing%20Stairs/README.md) | `记忆化搜索`,`数学`,`动态规划` | 简单 | | +| 0071 | [简化路径](/solution/0000-0099/0071.Simplify%20Path/README.md) | `栈`,`字符串` | 中等 | | +| 0072 | [编辑距离](/solution/0000-0099/0072.Edit%20Distance/README.md) | `字符串`,`动态规划` | 中等 | | +| 0073 | [矩阵置零](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | | +| 0074 | [搜索二维矩阵](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README.md) | `数组`,`二分查找`,`矩阵` | 中等 | | +| 0075 | [颜色分类](/solution/0000-0099/0075.Sort%20Colors/README.md) | `数组`,`双指针`,`排序` | 中等 | | +| 0076 | [最小覆盖子串](/solution/0000-0099/0076.Minimum%20Window%20Substring/README.md) | `哈希表`,`字符串`,`滑动窗口` | 困难 | | +| 0077 | [组合](/solution/0000-0099/0077.Combinations/README.md) | `回溯` | 中等 | | +| 0078 | [子集](/solution/0000-0099/0078.Subsets/README.md) | `位运算`,`数组`,`回溯` | 中等 | | +| 0079 | [单词搜索](/solution/0000-0099/0079.Word%20Search/README.md) | `数组`,`字符串`,`回溯`,`矩阵` | 中等 | | +| 0080 | [删除有序数组中的重复项 II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md) | `数组`,`双指针` | 中等 | | +| 0081 | [搜索旋转排序数组 II](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md) | `数组`,`二分查找` | 中等 | | +| 0082 | [删除排序链表中的重复元素 II](/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README.md) | `链表`,`双指针` | 中等 | | +| 0083 | [删除排序链表中的重复元素](/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README.md) | `链表` | 简单 | | +| 0084 | [柱状图中最大的矩形](/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README.md) | `栈`,`数组`,`单调栈` | 困难 | | +| 0085 | [最大矩形](/solution/0000-0099/0085.Maximal%20Rectangle/README.md) | `栈`,`数组`,`动态规划`,`矩阵`,`单调栈` | 困难 | | +| 0086 | [分隔链表](/solution/0000-0099/0086.Partition%20List/README.md) | `链表`,`双指针` | 中等 | | +| 0087 | [扰乱字符串](/solution/0000-0099/0087.Scramble%20String/README.md) | `字符串`,`动态规划` | 困难 | | +| 0088 | [合并两个有序数组](/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md) | `数组`,`双指针`,`排序` | 简单 | | +| 0089 | [格雷编码](/solution/0000-0099/0089.Gray%20Code/README.md) | `位运算`,`数学`,`回溯` | 中等 | | +| 0090 | [子集 II](/solution/0000-0099/0090.Subsets%20II/README.md) | `位运算`,`数组`,`回溯` | 中等 | | +| 0091 | [解码方法](/solution/0000-0099/0091.Decode%20Ways/README.md) | `字符串`,`动态规划` | 中等 | | +| 0092 | [反转链表 II](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README.md) | `链表` | 中等 | | +| 0093 | [复原 IP 地址](/solution/0000-0099/0093.Restore%20IP%20Addresses/README.md) | `字符串`,`回溯` | 中等 | | +| 0094 | [二叉树的中序遍历](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README.md) | `栈`,`树`,`深度优先搜索`,`二叉树` | 简单 | | +| 0095 | [不同的二叉搜索树 II](/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README.md) | `树`,`二叉搜索树`,`动态规划`,`回溯`,`二叉树` | 中等 | | +| 0096 | [不同的二叉搜索树](/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README.md) | `树`,`二叉搜索树`,`数学`,`动态规划`,`二叉树` | 中等 | | +| 0097 | [交错字符串](/solution/0000-0099/0097.Interleaving%20String/README.md) | `字符串`,`动态规划` | 中等 | | +| 0098 | [验证二叉搜索树](/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | +| 0099 | [恢复二叉搜索树](/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | +| 0100 | [相同的树](/solution/0100-0199/0100.Same%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | +| 0101 | [对称二叉树](/solution/0100-0199/0101.Symmetric%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | +| 0102 | [二叉树的层序遍历](/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | | +| 0103 | [二叉树的锯齿形层序遍历](/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | | +| 0104 | [二叉树的最大深度](/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | +| 0105 | [从前序与中序遍历序列构造二叉树](/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README.md) | `树`,`数组`,`哈希表`,`分治`,`二叉树` | 中等 | | +| 0106 | [从中序与后序遍历序列构造二叉树](/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README.md) | `树`,`数组`,`哈希表`,`分治`,`二叉树` | 中等 | | +| 0107 | [二叉树的层序遍历 II](/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | | +| 0108 | [将有序数组转换为二叉搜索树](/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README.md) | `树`,`二叉搜索树`,`数组`,`分治`,`二叉树` | 简单 | | +| 0109 | [有序链表转换二叉搜索树](/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README.md) | `树`,`二叉搜索树`,`链表`,`分治`,`二叉树` | 中等 | | +| 0110 | [平衡二叉树](/solution/0100-0199/0110.Balanced%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | | +| 0111 | [二叉树的最小深度](/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | +| 0112 | [路径总和](/solution/0100-0199/0112.Path%20Sum/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | +| 0113 | [路径总和 II](/solution/0100-0199/0113.Path%20Sum%20II/README.md) | `树`,`深度优先搜索`,`回溯`,`二叉树` | 中等 | | +| 0114 | [二叉树展开为链表](/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README.md) | `栈`,`树`,`深度优先搜索`,`链表`,`二叉树` | 中等 | | +| 0115 | [不同的子序列](/solution/0100-0199/0115.Distinct%20Subsequences/README.md) | `字符串`,`动态规划` | 困难 | | +| 0116 | [填充每个节点的下一个右侧节点指针](/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`链表`,`二叉树` | 中等 | | +| 0117 | [填充每个节点的下一个右侧节点指针 II](/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`链表`,`二叉树` | 中等 | | +| 0118 | [杨辉三角](/solution/0100-0199/0118.Pascal%27s%20Triangle/README.md) | `数组`,`动态规划` | 简单 | | +| 0119 | [杨辉三角 II](/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README.md) | `数组`,`动态规划` | 简单 | | +| 0120 | [三角形最小路径和](/solution/0100-0199/0120.Triangle/README.md) | `数组`,`动态规划` | 中等 | | +| 0121 | [买卖股票的最佳时机](/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README.md) | `数组`,`动态规划` | 简单 | | +| 0122 | [买卖股票的最佳时机 II](/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README.md) | `贪心`,`数组`,`动态规划` | 中等 | | +| 0123 | [买卖股票的最佳时机 III](/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README.md) | `数组`,`动态规划` | 困难 | | +| 0124 | [二叉树中的最大路径和](/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README.md) | `树`,`深度优先搜索`,`动态规划`,`二叉树` | 困难 | | +| 0125 | [验证回文串](/solution/0100-0199/0125.Valid%20Palindrome/README.md) | `双指针`,`字符串` | 简单 | | +| 0126 | [单词接龙 II](/solution/0100-0199/0126.Word%20Ladder%20II/README.md) | `广度优先搜索`,`哈希表`,`字符串`,`回溯` | 困难 | | +| 0127 | [单词接龙](/solution/0100-0199/0127.Word%20Ladder/README.md) | `广度优先搜索`,`哈希表`,`字符串` | 困难 | | +| 0128 | [最长连续序列](/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README.md) | `并查集`,`数组`,`哈希表` | 中等 | | +| 0129 | [求根节点到叶节点数字之和](/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | | +| 0130 | [被围绕的区域](/solution/0100-0199/0130.Surrounded%20Regions/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | | +| 0131 | [分割回文串](/solution/0100-0199/0131.Palindrome%20Partitioning/README.md) | `字符串`,`动态规划`,`回溯` | 中等 | | +| 0132 | [分割回文串 II](/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README.md) | `字符串`,`动态规划` | 困难 | | +| 0133 | [克隆图](/solution/0100-0199/0133.Clone%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`哈希表` | 中等 | | +| 0134 | [加油站](/solution/0100-0199/0134.Gas%20Station/README.md) | `贪心`,`数组` | 中等 | | +| 0135 | [分发糖果](/solution/0100-0199/0135.Candy/README.md) | `贪心`,`数组` | 困难 | | +| 0136 | [只出现一次的数字](/solution/0100-0199/0136.Single%20Number/README.md) | `位运算`,`数组` | 简单 | | +| 0137 | [只出现一次的数字 II](/solution/0100-0199/0137.Single%20Number%20II/README.md) | `位运算`,`数组` | 中等 | | +| 0138 | [随机链表的复制](/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README.md) | `哈希表`,`链表` | 中等 | | +| 0139 | [单词拆分](/solution/0100-0199/0139.Word%20Break/README.md) | `字典树`,`记忆化搜索`,`数组`,`哈希表`,`字符串`,`动态规划` | 中等 | | +| 0140 | [单词拆分 II](/solution/0100-0199/0140.Word%20Break%20II/README.md) | `字典树`,`记忆化搜索`,`数组`,`哈希表`,`字符串`,`动态规划`,`回溯` | 困难 | | +| 0141 | [环形链表](/solution/0100-0199/0141.Linked%20List%20Cycle/README.md) | `哈希表`,`链表`,`双指针` | 简单 | | +| 0142 | [环形链表 II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md) | `哈希表`,`链表`,`双指针` | 中等 | | +| 0143 | [重排链表](/solution/0100-0199/0143.Reorder%20List/README.md) | `栈`,`递归`,`链表`,`双指针` | 中等 | | +| 0144 | [二叉树的前序遍历](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README.md) | `栈`,`树`,`深度优先搜索`,`二叉树` | 简单 | | +| 0145 | [二叉树的后序遍历](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README.md) | `栈`,`树`,`深度优先搜索`,`二叉树` | 简单 | | +| 0146 | [LRU 缓存](/solution/0100-0199/0146.LRU%20Cache/README.md) | `设计`,`哈希表`,`链表`,`双向链表` | 中等 | | +| 0147 | [对链表进行插入排序](/solution/0100-0199/0147.Insertion%20Sort%20List/README.md) | `链表`,`排序` | 中等 | | +| 0148 | [排序链表](/solution/0100-0199/0148.Sort%20List/README.md) | `链表`,`双指针`,`分治`,`排序`,`归并排序` | 中等 | | +| 0149 | [直线上最多的点数](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README.md) | `几何`,`数组`,`哈希表`,`数学` | 困难 | | +| 0150 | [逆波兰表达式求值](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md) | `栈`,`数组`,`数学` | 中等 | | +| 0151 | [反转字符串中的单词](/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README.md) | `双指针`,`字符串` | 中等 | | +| 0152 | [乘积最大子数组](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README.md) | `数组`,`动态规划` | 中等 | | +| 0153 | [寻找旋转排序数组中的最小值](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README.md) | `数组`,`二分查找` | 中等 | | +| 0154 | [寻找旋转排序数组中的最小值 II](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README.md) | `数组`,`二分查找` | 困难 | | +| 0155 | [最小栈](/solution/0100-0199/0155.Min%20Stack/README.md) | `栈`,`设计` | 中等 | | +| 0156 | [上下翻转二叉树](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | +| 0157 | [用 Read4 读取 N 个字符](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README.md) | `数组`,`交互`,`模拟` | 简单 | 🔒 | +| 0158 | [用 Read4 读取 N 个字符 II - 多次调用](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20read4%20II%20-%20Call%20Multiple%20Times/README.md) | `数组`,`交互`,`模拟` | 困难 | 🔒 | +| 0159 | [至多包含两个不同字符的最长子串](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 🔒 | +| 0160 | [相交链表](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README.md) | `哈希表`,`链表`,`双指针` | 简单 | | +| 0161 | [相隔为 1 的编辑距离](/solution/0100-0199/0161.One%20Edit%20Distance/README.md) | `双指针`,`字符串` | 中等 | 🔒 | +| 0162 | [寻找峰值](/solution/0100-0199/0162.Find%20Peak%20Element/README.md) | `数组`,`二分查找` | 中等 | | +| 0163 | [缺失的区间](/solution/0100-0199/0163.Missing%20Ranges/README.md) | `数组` | 简单 | 🔒 | +| 0164 | [最大间距](/solution/0100-0199/0164.Maximum%20Gap/README.md) | `数组`,`桶排序`,`基数排序`,`排序` | 中等 | | +| 0165 | [比较版本号](/solution/0100-0199/0165.Compare%20Version%20Numbers/README.md) | `双指针`,`字符串` | 中等 | | +| 0166 | [分数到小数](/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README.md) | `哈希表`,`数学`,`字符串` | 中等 | | +| 0167 | [两数之和 II - 输入有序数组](/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted/README.md) | `数组`,`双指针`,`二分查找` | 中等 | | +| 0168 | [Excel 表列名称](/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README.md) | `数学`,`字符串` | 简单 | | +| 0169 | [多数元素](/solution/0100-0199/0169.Majority%20Element/README.md) | `数组`,`哈希表`,`分治`,`计数`,`排序` | 简单 | | +| 0170 | [两数之和 III - 数据结构设计](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README.md) | `设计`,`数组`,`哈希表`,`双指针`,`数据流` | 简单 | 🔒 | +| 0171 | [Excel 表列序号](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README.md) | `数学`,`字符串` | 简单 | | +| 0172 | [阶乘后的零](/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README.md) | `数学` | 中等 | | +| 0173 | [二叉搜索树迭代器](/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README.md) | `栈`,`树`,`设计`,`二叉搜索树`,`二叉树`,`迭代器` | 中等 | | +| 0174 | [地下城游戏](/solution/0100-0199/0174.Dungeon%20Game/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | | +| 0175 | [组合两个表](/solution/0100-0199/0175.Combine%20Two%20Tables/README.md) | `数据库` | 简单 | | +| 0176 | [第二高的薪水](/solution/0100-0199/0176.Second%20Highest%20Salary/README.md) | `数据库` | 中等 | | +| 0177 | [第 N 高的薪水](/solution/0100-0199/0177.Nth%20Highest%20Salary/README.md) | `数据库` | 中等 | | +| 0178 | [分数排名](/solution/0100-0199/0178.Rank%20Scores/README.md) | `数据库` | 中等 | | +| 0179 | [最大数](/solution/0100-0199/0179.Largest%20Number/README.md) | `贪心`,`数组`,`字符串`,`排序` | 中等 | | +| 0180 | [连续出现的数字](/solution/0100-0199/0180.Consecutive%20Numbers/README.md) | `数据库` | 中等 | | +| 0181 | [超过经理收入的员工](/solution/0100-0199/0181.Employees%20Earning%20More%20Than%20Their%20Managers/README.md) | `数据库` | 简单 | | +| 0182 | [查找重复的电子邮箱](/solution/0100-0199/0182.Duplicate%20Emails/README.md) | `数据库` | 简单 | | +| 0183 | [从不订购的客户](/solution/0100-0199/0183.Customers%20Who%20Never%20Order/README.md) | `数据库` | 简单 | | +| 0184 | [部门工资最高的员工](/solution/0100-0199/0184.Department%20Highest%20Salary/README.md) | `数据库` | 中等 | | +| 0185 | [部门工资前三高的所有员工](/solution/0100-0199/0185.Department%20Top%20Three%20Salaries/README.md) | `数据库` | 困难 | | +| 0186 | [反转字符串中的单词 II](/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README.md) | `双指针`,`字符串` | 中等 | 🔒 | +| 0187 | [重复的 DNA 序列](/solution/0100-0199/0187.Repeated%20DNA%20Sequences/README.md) | `位运算`,`哈希表`,`字符串`,`滑动窗口`,`哈希函数`,`滚动哈希` | 中等 | | +| 0188 | [买卖股票的最佳时机 IV](/solution/0100-0199/0188.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV/README.md) | `数组`,`动态规划` | 困难 | | +| 0189 | [轮转数组](/solution/0100-0199/0189.Rotate%20Array/README.md) | `数组`,`数学`,`双指针` | 中等 | | +| 0190 | [颠倒二进制位](/solution/0100-0199/0190.Reverse%20Bits/README.md) | `位运算`,`分治` | 简单 | | +| 0191 | [位 1 的个数](/solution/0100-0199/0191.Number%20of%201%20Bits/README.md) | `位运算`,`分治` | 简单 | | +| 0192 | [统计词频](/solution/0100-0199/0192.Word%20Frequency/README.md) | | 中等 | | +| 0193 | [有效电话号码](/solution/0100-0199/0193.Valid%20Phone%20Numbers/README.md) | | 简单 | | +| 0194 | [转置文件](/solution/0100-0199/0194.Transpose%20File/README.md) | | 中等 | | +| 0195 | [第十行](/solution/0100-0199/0195.Tenth%20Line/README.md) | | 简单 | | +| 0196 | [删除重复的电子邮箱](/solution/0100-0199/0196.Delete%20Duplicate%20Emails/README.md) | `数据库` | 简单 | | +| 0197 | [上升的温度](/solution/0100-0199/0197.Rising%20Temperature/README.md) | `数据库` | 简单 | | +| 0198 | [打家劫舍](/solution/0100-0199/0198.House%20Robber/README.md) | `数组`,`动态规划` | 中等 | | +| 0199 | [二叉树的右视图](/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | +| 0200 | [岛屿数量](/solution/0200-0299/0200.Number%20of%20Islands/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | | +| 0201 | [数字范围按位与](/solution/0200-0299/0201.Bitwise%20AND%20of%20Numbers%20Range/README.md) | `位运算` | 中等 | | +| 0202 | [快乐数](/solution/0200-0299/0202.Happy%20Number/README.md) | `哈希表`,`数学`,`双指针` | 简单 | | +| 0203 | [移除链表元素](/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README.md) | `递归`,`链表` | 简单 | | +| 0204 | [计数质数](/solution/0200-0299/0204.Count%20Primes/README.md) | `数组`,`数学`,`枚举`,`数论` | 中等 | | +| 0205 | [同构字符串](/solution/0200-0299/0205.Isomorphic%20Strings/README.md) | `哈希表`,`字符串` | 简单 | | +| 0206 | [反转链表](/solution/0200-0299/0206.Reverse%20Linked%20List/README.md) | `递归`,`链表` | 简单 | | +| 0207 | [课程表](/solution/0200-0299/0207.Course%20Schedule/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | | +| 0208 | [实现 Trie (前缀树)](/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | | +| 0209 | [长度最小的子数组](/solution/0200-0299/0209.Minimum%20Size%20Subarray%20Sum/README.md) | `数组`,`二分查找`,`前缀和`,`滑动窗口` | 中等 | | +| 0210 | [课程表 II](/solution/0200-0299/0210.Course%20Schedule%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | | +| 0211 | [添加与搜索单词 - 数据结构设计](/solution/0200-0299/0211.Design%20Add%20and%20Search%20Words%20Data%20Structure/README.md) | `深度优先搜索`,`设计`,`字典树`,`字符串` | 中等 | | +| 0212 | [单词搜索 II](/solution/0200-0299/0212.Word%20Search%20II/README.md) | `字典树`,`数组`,`字符串`,`回溯`,`矩阵` | 困难 | | +| 0213 | [打家劫舍 II](/solution/0200-0299/0213.House%20Robber%20II/README.md) | `数组`,`动态规划` | 中等 | | +| 0214 | [最短回文串](/solution/0200-0299/0214.Shortest%20Palindrome/README.md) | `字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | | +| 0215 | [数组中的第 K 个最大元素](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README.md) | `数组`,`分治`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | | +| 0216 | [组合总和 III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md) | `数组`,`回溯` | 中等 | | +| 0217 | [存在重复元素](/solution/0200-0299/0217.Contains%20Duplicate/README.md) | `数组`,`哈希表`,`排序` | 简单 | | +| 0218 | [天际线问题](/solution/0200-0299/0218.The%20Skyline%20Problem/README.md) | `树状数组`,`线段树`,`数组`,`分治`,`有序集合`,`扫描线`,`堆（优先队列）` | 困难 | | +| 0219 | [存在重复元素 II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README.md) | `数组`,`哈希表`,`滑动窗口` | 简单 | | +| 0220 | [存在重复元素 III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README.md) | `数组`,`桶排序`,`有序集合`,`排序`,`滑动窗口` | 困难 | | +| 0221 | [最大正方形](/solution/0200-0299/0221.Maximal%20Square/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | | +| 0222 | [完全二叉树的节点个数](/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README.md) | `位运算`,`树`,`二分查找`,`二叉树` | 简单 | | +| 0223 | [矩形面积](/solution/0200-0299/0223.Rectangle%20Area/README.md) | `几何`,`数学` | 中等 | | +| 0224 | [基本计算器](/solution/0200-0299/0224.Basic%20Calculator/README.md) | `栈`,`递归`,`数学`,`字符串` | 困难 | | +| 0225 | [用队列实现栈](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README.md) | `栈`,`设计`,`队列` | 简单 | | +| 0226 | [翻转二叉树](/solution/0200-0299/0226.Invert%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | +| 0227 | [基本计算器 II](/solution/0200-0299/0227.Basic%20Calculator%20II/README.md) | `栈`,`数学`,`字符串` | 中等 | | +| 0228 | [汇总区间](/solution/0200-0299/0228.Summary%20Ranges/README.md) | `数组` | 简单 | | +| 0229 | [多数元素 II](/solution/0200-0299/0229.Majority%20Element%20II/README.md) | `数组`,`哈希表`,`计数`,`排序` | 中等 | | +| 0230 | [二叉搜索树中第 K 小的元素](/solution/0200-0299/0230.Kth%20Smallest%20Element%20in%20a%20BST/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | +| 0231 | [2 的幂](/solution/0200-0299/0231.Power%20of%20Two/README.md) | `位运算`,`递归`,`数学` | 简单 | | +| 0232 | [用栈实现队列](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README.md) | `栈`,`设计`,`队列` | 简单 | | +| 0233 | [数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md) | `递归`,`数学`,`动态规划` | 困难 | | +| 0234 | [回文链表](/solution/0200-0299/0234.Palindrome%20Linked%20List/README.md) | `栈`,`递归`,`链表`,`双指针` | 简单 | | +| 0235 | [二叉搜索树的最近公共祖先](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | +| 0236 | [二叉树的最近公共祖先](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | | +| 0237 | [删除链表中的节点](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README.md) | `链表` | 中等 | | +| 0238 | [除自身以外数组的乘积](/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README.md) | `数组`,`前缀和` | 中等 | | +| 0239 | [滑动窗口最大值](/solution/0200-0299/0239.Sliding%20Window%20Maximum/README.md) | `队列`,`数组`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 困难 | | +| 0240 | [搜索二维矩阵 II](/solution/0200-0299/0240.Search%20a%202D%20Matrix%20II/README.md) | `数组`,`二分查找`,`分治`,`矩阵` | 中等 | | +| 0241 | [为运算表达式设计优先级](/solution/0200-0299/0241.Different%20Ways%20to%20Add%20Parentheses/README.md) | `递归`,`记忆化搜索`,`数学`,`字符串`,`动态规划` | 中等 | | +| 0242 | [有效的字母异位词](/solution/0200-0299/0242.Valid%20Anagram/README.md) | `哈希表`,`字符串`,`排序` | 简单 | | +| 0243 | [最短单词距离](/solution/0200-0299/0243.Shortest%20Word%20Distance/README.md) | `数组`,`字符串` | 简单 | 🔒 | +| 0244 | [最短单词距离 II](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README.md) | `设计`,`数组`,`哈希表`,`双指针`,`字符串` | 中等 | 🔒 | +| 0245 | [最短单词距离 III](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README.md) | `数组`,`字符串` | 中等 | 🔒 | +| 0246 | [中心对称数](/solution/0200-0299/0246.Strobogrammatic%20Number/README.md) | `哈希表`,`双指针`,`字符串` | 简单 | 🔒 | +| 0247 | [中心对称数 II](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README.md) | `递归`,`数组`,`字符串` | 中等 | 🔒 | +| 0248 | [中心对称数 III](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md) | `递归`,`数组`,`字符串` | 困难 | 🔒 | +| 0249 | [移位字符串分组](/solution/0200-0299/0249.Group%20Shifted%20Strings/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 🔒 | +| 0250 | [统计同值子树](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | +| 0251 | [展开二维向量](/solution/0200-0299/0251.Flatten%202D%20Vector/README.md) | `设计`,`数组`,`双指针`,`迭代器` | 中等 | 🔒 | +| 0252 | [会议室](/solution/0200-0299/0252.Meeting%20Rooms/README.md) | `数组`,`排序` | 简单 | 🔒 | +| 0253 | [会议室 II](/solution/0200-0299/0253.Meeting%20Rooms%20II/README.md) | `贪心`,`数组`,`双指针`,`前缀和`,`排序`,`堆（优先队列）` | 中等 | 🔒 | +| 0254 | [因子的组合](/solution/0200-0299/0254.Factor%20Combinations/README.md) | `回溯` | 中等 | 🔒 | +| 0255 | [验证二叉搜索树的前序遍历序列](/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README.md) | `栈`,`树`,`二叉搜索树`,`递归`,`数组`,`二叉树`,`单调栈` | 中等 | 🔒 | +| 0256 | [粉刷房子](/solution/0200-0299/0256.Paint%20House/README.md) | `数组`,`动态规划` | 中等 | 🔒 | +| 0257 | [二叉树的所有路径](/solution/0200-0299/0257.Binary%20Tree%20Paths/README.md) | `树`,`深度优先搜索`,`字符串`,`回溯`,`二叉树` | 简单 | | +| 0258 | [各位相加](/solution/0200-0299/0258.Add%20Digits/README.md) | `数学`,`数论`,`模拟` | 简单 | | +| 0259 | [较小的三数之和](/solution/0200-0299/0259.3Sum%20Smaller/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 🔒 | +| 0260 | [只出现一次的数字 III](/solution/0200-0299/0260.Single%20Number%20III/README.md) | `位运算`,`数组` | 中等 | | +| 0261 | [以图判树](/solution/0200-0299/0261.Graph%20Valid%20Tree/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 🔒 | +| 0262 | [行程和用户](/solution/0200-0299/0262.Trips%20and%20Users/README.md) | `数据库` | 困难 | | +| 0263 | [丑数](/solution/0200-0299/0263.Ugly%20Number/README.md) | `数学` | 简单 | | +| 0264 | [丑数 II](/solution/0200-0299/0264.Ugly%20Number%20II/README.md) | `哈希表`,`数学`,`动态规划`,`堆（优先队列）` | 中等 | | +| 0265 | [粉刷房子 II](/solution/0200-0299/0265.Paint%20House%20II/README.md) | `数组`,`动态规划` | 困难 | 🔒 | +| 0266 | [回文排列](/solution/0200-0299/0266.Palindrome%20Permutation/README.md) | `位运算`,`哈希表`,`字符串` | 简单 | 🔒 | +| 0267 | [回文排列 II](/solution/0200-0299/0267.Palindrome%20Permutation%20II/README.md) | `哈希表`,`字符串`,`回溯` | 中等 | 🔒 | +| 0268 | [丢失的数字](/solution/0200-0299/0268.Missing%20Number/README.md) | `位运算`,`数组`,`哈希表`,`数学`,`二分查找`,`排序` | 简单 | | +| 0269 | [火星词典](/solution/0200-0299/0269.Alien%20Dictionary/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序`,`数组`,`字符串` | 困难 | 🔒 | +| 0270 | [最接近的二叉搜索树值](/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二分查找`,`二叉树` | 简单 | 🔒 | +| 0271 | [字符串的编码与解码](/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README.md) | `设计`,`数组`,`字符串` | 中等 | 🔒 | +| 0272 | [最接近的二叉搜索树值 II](/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README.md) | `栈`,`树`,`深度优先搜索`,`二叉搜索树`,`双指针`,`二叉树`,`堆（优先队列）` | 困难 | 🔒 | +| 0273 | [整数转换英文表示](/solution/0200-0299/0273.Integer%20to%20English%20Words/README.md) | `递归`,`数学`,`字符串` | 困难 | | +| 0274 | [H 指数](/solution/0200-0299/0274.H-Index/README.md) | `数组`,`计数排序`,`排序` | 中等 | | +| 0275 | [H 指数 II](/solution/0200-0299/0275.H-Index%20II/README.md) | `数组`,`二分查找` | 中等 | | +| 0276 | [栅栏涂色](/solution/0200-0299/0276.Paint%20Fence/README.md) | `动态规划` | 中等 | 🔒 | +| 0277 | [搜寻名人](/solution/0200-0299/0277.Find%20the%20Celebrity/README.md) | `图`,`双指针`,`交互` | 中等 | 🔒 | +| 0278 | [第一个错误的版本](/solution/0200-0299/0278.First%20Bad%20Version/README.md) | `二分查找`,`交互` | 简单 | | +| 0279 | [完全平方数](/solution/0200-0299/0279.Perfect%20Squares/README.md) | `广度优先搜索`,`数学`,`动态规划` | 中等 | | +| 0280 | [摆动排序](/solution/0200-0299/0280.Wiggle%20Sort/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | +| 0281 | [锯齿迭代器](/solution/0200-0299/0281.Zigzag%20Iterator/README.md) | `设计`,`队列`,`数组`,`迭代器` | 中等 | 🔒 | +| 0282 | [给表达式添加运算符](/solution/0200-0299/0282.Expression%20Add%20Operators/README.md) | `数学`,`字符串`,`回溯` | 困难 | | +| 0283 | [移动零](/solution/0200-0299/0283.Move%20Zeroes/README.md) | `数组`,`双指针` | 简单 | | +| 0284 | [窥视迭代器](/solution/0200-0299/0284.Peeking%20Iterator/README.md) | `设计`,`数组`,`迭代器` | 中等 | | +| 0285 | [二叉搜索树中的中序后继](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | 🔒 | +| 0286 | [墙与门](/solution/0200-0299/0286.Walls%20and%20Gates/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 🔒 | +| 0287 | [寻找重复数](/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README.md) | `位运算`,`数组`,`双指针`,`二分查找` | 中等 | | +| 0288 | [单词的唯一缩写](/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README.md) | `设计`,`数组`,`哈希表`,`字符串` | 中等 | 🔒 | +| 0289 | [生命游戏](/solution/0200-0299/0289.Game%20of%20Life/README.md) | `数组`,`矩阵`,`模拟` | 中等 | | +| 0290 | [单词规律](/solution/0200-0299/0290.Word%20Pattern/README.md) | `哈希表`,`字符串` | 简单 | | +| 0291 | [单词规律 II](/solution/0200-0299/0291.Word%20Pattern%20II/README.md) | `哈希表`,`字符串`,`回溯` | 中等 | 🔒 | +| 0292 | [Nim 游戏](/solution/0200-0299/0292.Nim%20Game/README.md) | `脑筋急转弯`,`数学`,`博弈` | 简单 | | +| 0293 | [翻转游戏](/solution/0200-0299/0293.Flip%20Game/README.md) | `字符串` | 简单 | 🔒 | +| 0294 | [翻转游戏 II](/solution/0200-0299/0294.Flip%20Game%20II/README.md) | `记忆化搜索`,`数学`,`动态规划`,`回溯`,`博弈` | 中等 | 🔒 | +| 0295 | [数据流的中位数](/solution/0200-0299/0295.Find%20Median%20from%20Data%20Stream/README.md) | `设计`,`双指针`,`数据流`,`排序`,`堆（优先队列）` | 困难 | | +| 0296 | [最佳的碰头地点](/solution/0200-0299/0296.Best%20Meeting%20Point/README.md) | `数组`,`数学`,`矩阵`,`排序` | 困难 | 🔒 | +| 0297 | [二叉树的序列化与反序列化](/solution/0200-0299/0297.Serialize%20and%20Deserialize%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`字符串`,`二叉树` | 困难 | | +| 0298 | [二叉树最长连续序列](/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | +| 0299 | [猜数字游戏](/solution/0200-0299/0299.Bulls%20and%20Cows/README.md) | `哈希表`,`字符串`,`计数` | 中等 | | +| 0300 | [最长递增子序列](/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README.md) | `数组`,`二分查找`,`动态规划` | 中等 | | +| 0301 | [删除无效的括号](/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README.md) | `广度优先搜索`,`字符串`,`回溯` | 困难 | | +| 0302 | [包含全部黑色像素的最小矩形](/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`二分查找`,`矩阵` | 困难 | 🔒 | +| 0303 | [区域和检索 - 数组不可变](/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README.md) | `设计`,`数组`,`前缀和` | 简单 | | +| 0304 | [二维区域和检索 - 矩阵不可变](/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md) | `设计`,`数组`,`矩阵`,`前缀和` | 中等 | | +| 0305 | [岛屿数量 II](/solution/0300-0399/0305.Number%20of%20Islands%20II/README.md) | `并查集`,`数组`,`哈希表` | 困难 | 🔒 | +| 0306 | [累加数](/solution/0300-0399/0306.Additive%20Number/README.md) | `字符串`,`回溯` | 中等 | | +| 0307 | [区域和检索 - 数组可修改](/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README.md) | `设计`,`树状数组`,`线段树`,`数组` | 中等 | | +| 0308 | [二维区域和检索 - 可变](/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README.md) | `设计`,`树状数组`,`线段树`,`数组`,`矩阵` | 困难 | 🔒 | +| 0309 | [买卖股票的最佳时机含冷冻期](/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README.md) | `数组`,`动态规划` | 中等 | | +| 0310 | [最小高度树](/solution/0300-0399/0310.Minimum%20Height%20Trees/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | | +| 0311 | [稀疏矩阵的乘法](/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 🔒 | +| 0312 | [戳气球](/solution/0300-0399/0312.Burst%20Balloons/README.md) | `数组`,`动态规划` | 困难 | | +| 0313 | [超级丑数](/solution/0300-0399/0313.Super%20Ugly%20Number/README.md) | `数组`,`数学`,`动态规划` | 中等 | | +| 0314 | [二叉树的垂直遍历](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树`,`排序` | 中等 | 🔒 | +| 0315 | [计算右侧小于当前元素的个数](/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | | +| 0316 | [去除重复字母](/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README.md) | `栈`,`贪心`,`字符串`,`单调栈` | 中等 | | +| 0317 | [离建筑物最近的距离](/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README.md) | `广度优先搜索`,`数组`,`矩阵` | 困难 | 🔒 | +| 0318 | [最大单词长度乘积](/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README.md) | `位运算`,`数组`,`字符串` | 中等 | | +| 0319 | [灯泡开关](/solution/0300-0399/0319.Bulb%20Switcher/README.md) | `脑筋急转弯`,`数学` | 中等 | | +| 0320 | [列举单词的全部缩写](/solution/0300-0399/0320.Generalized%20Abbreviation/README.md) | `位运算`,`字符串`,`回溯` | 中等 | 🔒 | +| 0321 | [拼接最大数](/solution/0300-0399/0321.Create%20Maximum%20Number/README.md) | `栈`,`贪心`,`数组`,`双指针`,`单调栈` | 困难 | | +| 0322 | [零钱兑换](/solution/0300-0399/0322.Coin%20Change/README.md) | `广度优先搜索`,`数组`,`动态规划` | 中等 | | +| 0323 | [无向图中连通分量的数目](/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 🔒 | +| 0324 | [摆动排序 II](/solution/0300-0399/0324.Wiggle%20Sort%20II/README.md) | `贪心`,`数组`,`分治`,`快速选择`,`排序` | 中等 | | +| 0325 | [和等于 k 的最长子数组长度](/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 🔒 | +| 0326 | [3 的幂](/solution/0300-0399/0326.Power%20of%20Three/README.md) | `递归`,`数学` | 简单 | | +| 0327 | [区间和的个数](/solution/0300-0399/0327.Count%20of%20Range%20Sum/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | | +| 0328 | [奇偶链表](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README.md) | `链表` | 中等 | | +| 0329 | [矩阵中的最长递增路径](/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序`,`记忆化搜索`,`数组`,`动态规划`,`矩阵` | 困难 | | +| 0330 | [按要求补齐数组](/solution/0300-0399/0330.Patching%20Array/README.md) | `贪心`,`数组` | 困难 | | +| 0331 | [验证二叉树的前序序列化](/solution/0300-0399/0331.Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README.md) | `栈`,`树`,`字符串`,`二叉树` | 中等 | | +| 0332 | [重新安排行程](/solution/0300-0399/0332.Reconstruct%20Itinerary/README.md) | `深度优先搜索`,`图`,`欧拉回路` | 困难 | | +| 0333 | [最大二叉搜索子树](/solution/0300-0399/0333.Largest%20BST%20Subtree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`动态规划`,`二叉树` | 中等 | 🔒 | +| 0334 | [递增的三元子序列](/solution/0300-0399/0334.Increasing%20Triplet%20Subsequence/README.md) | `贪心`,`数组` | 中等 | | +| 0335 | [路径交叉](/solution/0300-0399/0335.Self%20Crossing/README.md) | `几何`,`数组`,`数学` | 困难 | | +| 0336 | [回文对](/solution/0300-0399/0336.Palindrome%20Pairs/README.md) | `字典树`,`数组`,`哈希表`,`字符串` | 困难 | | +| 0337 | [打家劫舍 III](/solution/0300-0399/0337.House%20Robber%20III/README.md) | `树`,`深度优先搜索`,`动态规划`,`二叉树` | 中等 | | +| 0338 | [比特位计数](/solution/0300-0399/0338.Counting%20Bits/README.md) | `位运算`,`动态规划` | 简单 | | +| 0339 | [嵌套列表加权和](/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README.md) | `深度优先搜索`,`广度优先搜索` | 中等 | 🔒 | +| 0340 | [至多包含 K 个不同字符的最长子串](/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 🔒 | +| 0341 | [扁平化嵌套列表迭代器](/solution/0300-0399/0341.Flatten%20Nested%20List%20Iterator/README.md) | `栈`,`树`,`深度优先搜索`,`设计`,`队列`,`迭代器` | 中等 | | +| 0342 | [4 的幂](/solution/0300-0399/0342.Power%20of%20Four/README.md) | `位运算`,`递归`,`数学` | 简单 | | +| 0343 | [整数拆分](/solution/0300-0399/0343.Integer%20Break/README.md) | `数学`,`动态规划` | 中等 | | +| 0344 | [反转字符串](/solution/0300-0399/0344.Reverse%20String/README.md) | `双指针`,`字符串` | 简单 | | +| 0345 | [反转字符串中的元音字母](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README.md) | `双指针`,`字符串` | 简单 | | +| 0346 | [数据流中的移动平均值](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README.md) | `设计`,`队列`,`数组`,`数据流` | 简单 | 🔒 | +| 0347 | [前 K 个高频元素](/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README.md) | `数组`,`哈希表`,`分治`,`桶排序`,`计数`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | | +| 0348 | [设计井字棋](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README.md) | `设计`,`数组`,`哈希表`,`矩阵`,`模拟` | 中等 | 🔒 | +| 0349 | [两个数组的交集](/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`排序` | 简单 | | +| 0350 | [两个数组的交集 II](/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`排序` | 简单 | | +| 0351 | [安卓系统手势解锁](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README.md) | `位运算`,`动态规划`,`回溯`,`状态压缩` | 中等 | 🔒 | +| 0352 | [将数据流变为多个不相交区间](/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README.md) | `设计`,`二分查找`,`有序集合` | 困难 | | +| 0353 | [贪吃蛇](/solution/0300-0399/0353.Design%20Snake%20Game/README.md) | `设计`,`队列`,`数组`,`哈希表`,`模拟` | 中等 | 🔒 | +| 0354 | [俄罗斯套娃信封问题](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md) | `数组`,`二分查找`,`动态规划`,`排序` | 困难 | | +| 0355 | [设计推特](/solution/0300-0399/0355.Design%20Twitter/README.md) | `设计`,`哈希表`,`链表`,`堆（优先队列）` | 中等 | | +| 0356 | [直线镜像](/solution/0300-0399/0356.Line%20Reflection/README.md) | `数组`,`哈希表`,`数学` | 中等 | 🔒 | +| 0357 | [统计各位数字都不同的数字个数](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md) | `数学`,`动态规划`,`回溯` | 中等 | | +| 0358 | [K 距离间隔重排字符串](/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序`,`堆（优先队列）` | 困难 | 🔒 | +| 0359 | [日志速率限制器](/solution/0300-0399/0359.Logger%20Rate%20Limiter/README.md) | `设计`,`哈希表`,`数据流` | 简单 | 🔒 | +| 0360 | [有序转化数组](/solution/0300-0399/0360.Sort%20Transformed%20Array/README.md) | `数组`,`数学`,`双指针`,`排序` | 中等 | 🔒 | +| 0361 | [轰炸敌人](/solution/0300-0399/0361.Bomb%20Enemy/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 🔒 | +| 0362 | [敲击计数器](/solution/0300-0399/0362.Design%20Hit%20Counter/README.md) | `设计`,`队列`,`数组`,`二分查找`,`数据流` | 中等 | 🔒 | +| 0363 | [矩形区域不超过 K 的最大数值和](/solution/0300-0399/0363.Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/README.md) | `数组`,`二分查找`,`矩阵`,`有序集合`,`前缀和` | 困难 | | +| 0364 | [嵌套列表加权和 II](/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README.md) | `栈`,`深度优先搜索`,`广度优先搜索` | 中等 | 🔒 | +| 0365 | [水壶问题](/solution/0300-0399/0365.Water%20and%20Jug%20Problem/README.md) | `深度优先搜索`,`广度优先搜索`,`数学` | 中等 | | +| 0366 | [寻找二叉树的叶子节点](/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | +| 0367 | [有效的完全平方数](/solution/0300-0399/0367.Valid%20Perfect%20Square/README.md) | `数学`,`二分查找` | 简单 | | +| 0368 | [最大整除子集](/solution/0300-0399/0368.Largest%20Divisible%20Subset/README.md) | `数组`,`数学`,`动态规划`,`排序` | 中等 | | +| 0369 | [给单链表加一](/solution/0300-0399/0369.Plus%20One%20Linked%20List/README.md) | `链表`,`数学` | 中等 | 🔒 | +| 0370 | [区间加法](/solution/0300-0399/0370.Range%20Addition/README.md) | `数组`,`前缀和` | 中等 | 🔒 | +| 0371 | [两整数之和](/solution/0300-0399/0371.Sum%20of%20Two%20Integers/README.md) | `位运算`,`数学` | 中等 | | +| 0372 | [超级次方](/solution/0300-0399/0372.Super%20Pow/README.md) | `数学`,`分治` | 中等 | | +| 0373 | [查找和最小的 K 对数字](/solution/0300-0399/0373.Find%20K%20Pairs%20with%20Smallest%20Sums/README.md) | `数组`,`堆（优先队列）` | 中等 | | +| 0374 | [猜数字大小](/solution/0300-0399/0374.Guess%20Number%20Higher%20or%20Lower/README.md) | `二分查找`,`交互` | 简单 | | +| 0375 | [猜数字大小 II](/solution/0300-0399/0375.Guess%20Number%20Higher%20or%20Lower%20II/README.md) | `数学`,`动态规划`,`博弈` | 中等 | | +| 0376 | [摆动序列](/solution/0300-0399/0376.Wiggle%20Subsequence/README.md) | `贪心`,`数组`,`动态规划` | 中等 | | +| 0377 | [组合总和 Ⅳ](/solution/0300-0399/0377.Combination%20Sum%20IV/README.md) | `数组`,`动态规划` | 中等 | | +| 0378 | [有序矩阵中第 K 小的元素](/solution/0300-0399/0378.Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/README.md) | `数组`,`二分查找`,`矩阵`,`排序`,`堆（优先队列）` | 中等 | | +| 0379 | [电话目录管理系统](/solution/0300-0399/0379.Design%20Phone%20Directory/README.md) | `设计`,`队列`,`数组`,`哈希表`,`链表` | 中等 | 🔒 | +| 0380 | [O(1) 时间插入、删除和获取随机元素](/solution/0300-0399/0380.Insert%20Delete%20GetRandom%20O%281%29/README.md) | `设计`,`数组`,`哈希表`,`数学`,`随机化` | 中等 | | +| 0381 | [O(1) 时间插入、删除和获取随机元素 - 允许重复](/solution/0300-0399/0381.Insert%20Delete%20GetRandom%20O%281%29%20-%20Duplicates%20allowed/README.md) | `设计`,`数组`,`哈希表`,`数学`,`随机化` | 困难 | | +| 0382 | [链表随机节点](/solution/0300-0399/0382.Linked%20List%20Random%20Node/README.md) | `水塘抽样`,`链表`,`数学`,`随机化` | 中等 | | +| 0383 | [赎金信](/solution/0300-0399/0383.Ransom%20Note/README.md) | `哈希表`,`字符串`,`计数` | 简单 | | +| 0384 | [打乱数组](/solution/0300-0399/0384.Shuffle%20an%20Array/README.md) | `数组`,`数学`,`随机化` | 中等 | | +| 0385 | [迷你语法分析器](/solution/0300-0399/0385.Mini%20Parser/README.md) | `栈`,`深度优先搜索`,`字符串` | 中等 | | +| 0386 | [字典序排数](/solution/0300-0399/0386.Lexicographical%20Numbers/README.md) | `深度优先搜索`,`字典树` | 中等 | | +| 0387 | [字符串中的第一个唯一字符](/solution/0300-0399/0387.First%20Unique%20Character%20in%20a%20String/README.md) | `队列`,`哈希表`,`字符串`,`计数` | 简单 | | +| 0388 | [文件的最长绝对路径](/solution/0300-0399/0388.Longest%20Absolute%20File%20Path/README.md) | `栈`,`深度优先搜索`,`字符串` | 中等 | | +| 0389 | [找不同](/solution/0300-0399/0389.Find%20the%20Difference/README.md) | `位运算`,`哈希表`,`字符串`,`排序` | 简单 | | +| 0390 | [消除游戏](/solution/0300-0399/0390.Elimination%20Game/README.md) | `递归`,`数学` | 中等 | | +| 0391 | [完美矩形](/solution/0300-0399/0391.Perfect%20Rectangle/README.md) | `数组`,`扫描线` | 困难 | | +| 0392 | [判断子序列](/solution/0300-0399/0392.Is%20Subsequence/README.md) | `双指针`,`字符串`,`动态规划` | 简单 | | +| 0393 | [UTF-8 编码验证](/solution/0300-0399/0393.UTF-8%20Validation/README.md) | `位运算`,`数组` | 中等 | | +| 0394 | [字符串解码](/solution/0300-0399/0394.Decode%20String/README.md) | `栈`,`递归`,`字符串` | 中等 | | +| 0395 | [至少有 K 个重复字符的最长子串](/solution/0300-0399/0395.Longest%20Substring%20with%20At%20Least%20K%20Repeating%20Characters/README.md) | `哈希表`,`字符串`,`分治`,`滑动窗口` | 中等 | | +| 0396 | [旋转函数](/solution/0300-0399/0396.Rotate%20Function/README.md) | `数组`,`数学`,`动态规划` | 中等 | | +| 0397 | [整数替换](/solution/0300-0399/0397.Integer%20Replacement/README.md) | `贪心`,`位运算`,`记忆化搜索`,`动态规划` | 中等 | | +| 0398 | [随机数索引](/solution/0300-0399/0398.Random%20Pick%20Index/README.md) | `水塘抽样`,`哈希表`,`数学`,`随机化` | 中等 | | +| 0399 | [除法求值](/solution/0300-0399/0399.Evaluate%20Division/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`数组`,`字符串`,`最短路` | 中等 | | +| 0400 | [第 N 位数字](/solution/0400-0499/0400.Nth%20Digit/README.md) | `数学`,`二分查找` | 中等 | | +| 0401 | [二进制手表](/solution/0400-0499/0401.Binary%20Watch/README.md) | `位运算`,`回溯` | 简单 | | +| 0402 | [移掉 K 位数字](/solution/0400-0499/0402.Remove%20K%20Digits/README.md) | `栈`,`贪心`,`字符串`,`单调栈` | 中等 | | +| 0403 | [青蛙过河](/solution/0400-0499/0403.Frog%20Jump/README.md) | `数组`,`动态规划` | 困难 | | +| 0404 | [左叶子之和](/solution/0400-0499/0404.Sum%20of%20Left%20Leaves/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | +| 0405 | [数字转换为十六进制数](/solution/0400-0499/0405.Convert%20a%20Number%20to%20Hexadecimal/README.md) | `位运算`,`数学` | 简单 | | +| 0406 | [根据身高重建队列](/solution/0400-0499/0406.Queue%20Reconstruction%20by%20Height/README.md) | `树状数组`,`线段树`,`数组`,`排序` | 中等 | | +| 0407 | [接雨水 II](/solution/0400-0499/0407.Trapping%20Rain%20Water%20II/README.md) | `广度优先搜索`,`数组`,`矩阵`,`堆（优先队列）` | 困难 | | +| 0408 | [有效单词缩写](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README.md) | `双指针`,`字符串` | 简单 | 🔒 | +| 0409 | [最长回文串](/solution/0400-0499/0409.Longest%20Palindrome/README.md) | `贪心`,`哈希表`,`字符串` | 简单 | | +| 0410 | [分割数组的最大值](/solution/0400-0499/0410.Split%20Array%20Largest%20Sum/README.md) | `贪心`,`数组`,`二分查找`,`动态规划`,`前缀和` | 困难 | | +| 0411 | [最短独占单词缩写](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README.md) | `位运算`,`字符串`,`回溯` | 困难 | 🔒 | +| 0412 | [Fizz Buzz](/solution/0400-0499/0412.Fizz%20Buzz/README.md) | `数学`,`字符串`,`模拟` | 简单 | | +| 0413 | [等差数列划分](/solution/0400-0499/0413.Arithmetic%20Slices/README.md) | `数组`,`动态规划` | 中等 | | +| 0414 | [第三大的数](/solution/0400-0499/0414.Third%20Maximum%20Number/README.md) | `数组`,`排序` | 简单 | | +| 0415 | [字符串相加](/solution/0400-0499/0415.Add%20Strings/README.md) | `数学`,`字符串`,`模拟` | 简单 | | +| 0416 | [分割等和子集](/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README.md) | `数组`,`动态规划` | 中等 | | +| 0417 | [太平洋大西洋水流问题](/solution/0400-0499/0417.Pacific%20Atlantic%20Water%20Flow/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | | +| 0418 | [屏幕可显示句子的数量](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README.md) | `数组`,`字符串`,`动态规划` | 中等 | 🔒 | +| 0419 | [棋盘上的战舰](/solution/0400-0499/0419.Battleships%20in%20a%20Board/README.md) | `深度优先搜索`,`数组`,`矩阵` | 中等 | | +| 0420 | [强密码检验器](/solution/0400-0499/0420.Strong%20Password%20Checker/README.md) | `贪心`,`字符串`,`堆（优先队列）` | 困难 | | +| 0421 | [数组中两个数的最大异或值](/solution/0400-0499/0421.Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/README.md) | `位运算`,`字典树`,`数组`,`哈希表` | 中等 | | +| 0422 | [有效的单词方块](/solution/0400-0499/0422.Valid%20Word%20Square/README.md) | `数组`,`矩阵` | 简单 | 🔒 | +| 0423 | [从英文中重建数字](/solution/0400-0499/0423.Reconstruct%20Original%20Digits%20from%20English/README.md) | `哈希表`,`数学`,`字符串` | 中等 | | +| 0424 | [替换后的最长重复字符](/solution/0400-0499/0424.Longest%20Repeating%20Character%20Replacement/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | | +| 0425 | [单词方块](/solution/0400-0499/0425.Word%20Squares/README.md) | `字典树`,`数组`,`字符串`,`回溯` | 困难 | 🔒 | +| 0426 | [将二叉搜索树转化为排序的双向链表](/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README.md) | `栈`,`树`,`深度优先搜索`,`二叉搜索树`,`链表`,`二叉树`,`双向链表` | 中等 | 🔒 | +| 0427 | [建立四叉树](/solution/0400-0499/0427.Construct%20Quad%20Tree/README.md) | `树`,`数组`,`分治`,`矩阵` | 中等 | | +| 0428 | [序列化和反序列化 N 叉树](/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`字符串` | 困难 | 🔒 | +| 0429 | [N 叉树的层序遍历](/solution/0400-0499/0429.N-ary%20Tree%20Level%20Order%20Traversal/README.md) | `树`,`广度优先搜索` | 中等 | | +| 0430 | [扁平化多级双向链表](/solution/0400-0499/0430.Flatten%20a%20Multilevel%20Doubly%20Linked%20List/README.md) | `深度优先搜索`,`链表`,`双向链表` | 中等 | | +| 0431 | [将 N 叉树编码为二叉树](/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`二叉树` | 困难 | 🔒 | +| 0432 | [全 O(1) 的数据结构](/solution/0400-0499/0432.All%20O%60one%20Data%20Structure/README.md) | `设计`,`哈希表`,`链表`,`双向链表` | 困难 | | +| 0433 | [最小基因变化](/solution/0400-0499/0433.Minimum%20Genetic%20Mutation/README.md) | `广度优先搜索`,`哈希表`,`字符串` | 中等 | | +| 0434 | [字符串中的单词数](/solution/0400-0499/0434.Number%20of%20Segments%20in%20a%20String/README.md) | `字符串` | 简单 | | +| 0435 | [无重叠区间](/solution/0400-0499/0435.Non-overlapping%20Intervals/README.md) | `贪心`,`数组`,`动态规划`,`排序` | 中等 | | +| 0436 | [寻找右区间](/solution/0400-0499/0436.Find%20Right%20Interval/README.md) | `数组`,`二分查找`,`排序` | 中等 | | +| 0437 | [路径总和 III](/solution/0400-0499/0437.Path%20Sum%20III/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | | +| 0438 | [找到字符串中所有字母异位词](/solution/0400-0499/0438.Find%20All%20Anagrams%20in%20a%20String/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | | +| 0439 | [三元表达式解析器](/solution/0400-0499/0439.Ternary%20Expression%20Parser/README.md) | `栈`,`递归`,`字符串` | 中等 | 🔒 | +| 0440 | [字典序的第 K 小数字](/solution/0400-0499/0440.K-th%20Smallest%20in%20Lexicographical%20Order/README.md) | `字典树` | 困难 | | +| 0441 | [排列硬币](/solution/0400-0499/0441.Arranging%20Coins/README.md) | `数学`,`二分查找` | 简单 | | +| 0442 | [数组中重复的数据](/solution/0400-0499/0442.Find%20All%20Duplicates%20in%20an%20Array/README.md) | `数组`,`哈希表` | 中等 | | +| 0443 | [压缩字符串](/solution/0400-0499/0443.String%20Compression/README.md) | `双指针`,`字符串` | 中等 | | +| 0444 | [序列重建](/solution/0400-0499/0444.Sequence%20Reconstruction/README.md) | `图`,`拓扑排序`,`数组` | 中等 | 🔒 | +| 0445 | [两数相加 II](/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README.md) | `栈`,`链表`,`数学` | 中等 | | +| 0446 | [等差数列划分 II - 子序列](/solution/0400-0499/0446.Arithmetic%20Slices%20II%20-%20Subsequence/README.md) | `数组`,`动态规划` | 困难 | | +| 0447 | [回旋镖的数量](/solution/0400-0499/0447.Number%20of%20Boomerangs/README.md) | `数组`,`哈希表`,`数学` | 中等 | | +| 0448 | [找到所有数组中消失的数字](/solution/0400-0499/0448.Find%20All%20Numbers%20Disappeared%20in%20an%20Array/README.md) | `数组`,`哈希表` | 简单 | | +| 0449 | [序列化和反序列化二叉搜索树](/solution/0400-0499/0449.Serialize%20and%20Deserialize%20BST/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`二叉搜索树`,`字符串`,`二叉树` | 中等 | | +| 0450 | [删除二叉搜索树中的节点](/solution/0400-0499/0450.Delete%20Node%20in%20a%20BST/README.md) | `树`,`二叉搜索树`,`二叉树` | 中等 | | +| 0451 | [根据字符出现频率排序](/solution/0400-0499/0451.Sort%20Characters%20By%20Frequency/README.md) | `哈希表`,`字符串`,`桶排序`,`计数`,`排序`,`堆（优先队列）` | 中等 | | +| 0452 | [用最少数量的箭引爆气球](/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README.md) | `贪心`,`数组`,`排序` | 中等 | | +| 0453 | [最小操作次数使数组元素相等](/solution/0400-0499/0453.Minimum%20Moves%20to%20Equal%20Array%20Elements/README.md) | `数组`,`数学` | 中等 | | +| 0454 | [四数相加 II](/solution/0400-0499/0454.4Sum%20II/README.md) | `数组`,`哈希表` | 中等 | | +| 0455 | [分发饼干](/solution/0400-0499/0455.Assign%20Cookies/README.md) | `贪心`,`数组`,`双指针`,`排序` | 简单 | | +| 0456 | [132 模式](/solution/0400-0499/0456.132%20Pattern/README.md) | `栈`,`数组`,`二分查找`,`有序集合`,`单调栈` | 中等 | | +| 0457 | [环形数组是否存在循环](/solution/0400-0499/0457.Circular%20Array%20Loop/README.md) | `数组`,`哈希表`,`双指针` | 中等 | | +| 0458 | [可怜的小猪](/solution/0400-0499/0458.Poor%20Pigs/README.md) | `数学`,`动态规划`,`组合数学` | 困难 | | +| 0459 | [重复的子字符串](/solution/0400-0499/0459.Repeated%20Substring%20Pattern/README.md) | `字符串`,`字符串匹配` | 简单 | | +| 0460 | [LFU 缓存](/solution/0400-0499/0460.LFU%20Cache/README.md) | `设计`,`哈希表`,`链表`,`双向链表` | 困难 | | +| 0461 | [汉明距离](/solution/0400-0499/0461.Hamming%20Distance/README.md) | `位运算` | 简单 | | +| 0462 | [最小操作次数使数组元素相等 II](/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md) | `数组`,`数学`,`排序` | 中等 | | +| 0463 | [岛屿的周长](/solution/0400-0499/0463.Island%20Perimeter/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 简单 | | +| 0464 | [我能赢吗](/solution/0400-0499/0464.Can%20I%20Win/README.md) | `位运算`,`记忆化搜索`,`数学`,`动态规划`,`状态压缩`,`博弈` | 中等 | | +| 0465 | [最优账单平衡](/solution/0400-0499/0465.Optimal%20Account%20Balancing/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 困难 | 🔒 | +| 0466 | [统计重复个数](/solution/0400-0499/0466.Count%20The%20Repetitions/README.md) | `字符串`,`动态规划` | 困难 | | +| 0467 | [环绕字符串中唯一的子字符串](/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README.md) | `字符串`,`动态规划` | 中等 | | +| 0468 | [验证 IP 地址](/solution/0400-0499/0468.Validate%20IP%20Address/README.md) | `字符串` | 中等 | | +| 0469 | [凸多边形](/solution/0400-0499/0469.Convex%20Polygon/README.md) | `几何`,`数组`,`数学` | 中等 | 🔒 | +| 0470 | [用 Rand7() 实现 Rand10()](/solution/0400-0499/0470.Implement%20Rand10%28%29%20Using%20Rand7%28%29/README.md) | `数学`,`拒绝采样`,`概率与统计`,`随机化` | 中等 | | +| 0471 | [编码最短长度的字符串](/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README.md) | `字符串`,`动态规划` | 困难 | 🔒 | +| 0472 | [连接词](/solution/0400-0499/0472.Concatenated%20Words/README.md) | `深度优先搜索`,`字典树`,`数组`,`字符串`,`动态规划` | 困难 | | +| 0473 | [火柴拼正方形](/solution/0400-0499/0473.Matchsticks%20to%20Square/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | | +| 0474 | [一和零](/solution/0400-0499/0474.Ones%20and%20Zeroes/README.md) | `数组`,`字符串`,`动态规划` | 中等 | | +| 0475 | [供暖器](/solution/0400-0499/0475.Heaters/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | | +| 0476 | [数字的补数](/solution/0400-0499/0476.Number%20Complement/README.md) | `位运算` | 简单 | | +| 0477 | [汉明距离总和](/solution/0400-0499/0477.Total%20Hamming%20Distance/README.md) | `位运算`,`数组`,`数学` | 中等 | | +| 0478 | [在圆内随机生成点](/solution/0400-0499/0478.Generate%20Random%20Point%20in%20a%20Circle/README.md) | `几何`,`数学`,`拒绝采样`,`随机化` | 中等 | | +| 0479 | [最大回文数乘积](/solution/0400-0499/0479.Largest%20Palindrome%20Product/README.md) | `数学`,`枚举` | 困难 | | +| 0480 | [滑动窗口中位数](/solution/0400-0499/0480.Sliding%20Window%20Median/README.md) | `数组`,`哈希表`,`滑动窗口`,`堆（优先队列）` | 困难 | | +| 0481 | [神奇字符串](/solution/0400-0499/0481.Magical%20String/README.md) | `双指针`,`字符串` | 中等 | | +| 0482 | [密钥格式化](/solution/0400-0499/0482.License%20Key%20Formatting/README.md) | `字符串` | 简单 | | +| 0483 | [最小好进制](/solution/0400-0499/0483.Smallest%20Good%20Base/README.md) | `数学`,`二分查找` | 困难 | | +| 0484 | [寻找排列](/solution/0400-0499/0484.Find%20Permutation/README.md) | `栈`,`贪心`,`数组`,`字符串` | 中等 | 🔒 | +| 0485 | [最大连续 1 的个数](/solution/0400-0499/0485.Max%20Consecutive%20Ones/README.md) | `数组` | 简单 | | +| 0486 | [预测赢家](/solution/0400-0499/0486.Predict%20the%20Winner/README.md) | `递归`,`数组`,`数学`,`动态规划`,`博弈` | 中等 | | +| 0487 | [最大连续 1 的个数 II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README.md) | `数组`,`动态规划`,`滑动窗口` | 中等 | 🔒 | +| 0488 | [祖玛游戏](/solution/0400-0499/0488.Zuma%20Game/README.md) | `栈`,`广度优先搜索`,`记忆化搜索`,`字符串`,`动态规划` | 困难 | | +| 0489 | [扫地机器人](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README.md) | `回溯`,`交互` | 困难 | 🔒 | +| 0490 | [迷宫](/solution/0400-0499/0490.The%20Maze/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | 🔒 | +| 0491 | [非递减子序列](/solution/0400-0499/0491.Non-decreasing%20Subsequences/README.md) | `位运算`,`数组`,`哈希表`,`回溯` | 中等 | | +| 0492 | [构造矩形](/solution/0400-0499/0492.Construct%20the%20Rectangle/README.md) | `数学` | 简单 | | +| 0493 | [翻转对](/solution/0400-0499/0493.Reverse%20Pairs/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | | +| 0494 | [目标和](/solution/0400-0499/0494.Target%20Sum/README.md) | `数组`,`动态规划`,`回溯` | 中等 | | +| 0495 | [提莫攻击](/solution/0400-0499/0495.Teemo%20Attacking/README.md) | `数组`,`模拟` | 简单 | | +| 0496 | [下一个更大元素 I](/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md) | `栈`,`数组`,`哈希表`,`单调栈` | 简单 | | +| 0497 | [非重叠矩形中的随机点](/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README.md) | `水塘抽样`,`数组`,`数学`,`二分查找`,`有序集合`,`前缀和`,`随机化` | 中等 | | +| 0498 | [对角线遍历](/solution/0400-0499/0498.Diagonal%20Traverse/README.md) | `数组`,`矩阵`,`模拟` | 中等 | | +| 0499 | [迷宫 III](/solution/0400-0499/0499.The%20Maze%20III/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`数组`,`字符串`,`矩阵`,`最短路`,`堆（优先队列）` | 困难 | 🔒 | +| 0500 | [键盘行](/solution/0500-0599/0500.Keyboard%20Row/README.md) | `数组`,`哈希表`,`字符串` | 简单 | | +| 0501 | [二叉搜索树中的众数](/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 简单 | | +| 0502 | [IPO](/solution/0500-0599/0502.IPO/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 困难 | | +| 0503 | [下一个更大元素 II](/solution/0500-0599/0503.Next%20Greater%20Element%20II/README.md) | `栈`,`数组`,`单调栈` | 中等 | | +| 0504 | [七进制数](/solution/0500-0599/0504.Base%207/README.md) | `数学` | 简单 | | +| 0505 | [迷宫 II](/solution/0500-0599/0505.The%20Maze%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`数组`,`矩阵`,`最短路`,`堆（优先队列）` | 中等 | 🔒 | +| 0506 | [相对名次](/solution/0500-0599/0506.Relative%20Ranks/README.md) | `数组`,`排序`,`堆（优先队列）` | 简单 | | +| 0507 | [完美数](/solution/0500-0599/0507.Perfect%20Number/README.md) | `数学` | 简单 | | +| 0508 | [出现次数最多的子树元素和](/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README.md) | `树`,`深度优先搜索`,`哈希表`,`二叉树` | 中等 | | +| 0509 | [斐波那契数](/solution/0500-0599/0509.Fibonacci%20Number/README.md) | `递归`,`记忆化搜索`,`数学`,`动态规划` | 简单 | | +| 0510 | [二叉搜索树中的中序后继 II](/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README.md) | `树`,`二叉搜索树`,`二叉树` | 中等 | 🔒 | +| 0511 | [游戏玩法分析 I](/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README.md) | `数据库` | 简单 | | +| 0512 | [游戏玩法分析 II](/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README.md) | `数据库` | 简单 | 🔒 | +| 0513 | [找树左下角的值](/solution/0500-0599/0513.Find%20Bottom%20Left%20Tree%20Value/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | +| 0514 | [自由之路](/solution/0500-0599/0514.Freedom%20Trail/README.md) | `深度优先搜索`,`广度优先搜索`,`字符串`,`动态规划` | 困难 | | +| 0515 | [在每个树行中找最大值](/solution/0500-0599/0515.Find%20Largest%20Value%20in%20Each%20Tree%20Row/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | +| 0516 | [最长回文子序列](/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README.md) | `字符串`,`动态规划` | 中等 | | +| 0517 | [超级洗衣机](/solution/0500-0599/0517.Super%20Washing%20Machines/README.md) | `贪心`,`数组` | 困难 | | +| 0518 | [零钱兑换 II](/solution/0500-0599/0518.Coin%20Change%20II/README.md) | `数组`,`动态规划` | 中等 | | +| 0519 | [随机翻转矩阵](/solution/0500-0599/0519.Random%20Flip%20Matrix/README.md) | `水塘抽样`,`哈希表`,`数学`,`随机化` | 中等 | | +| 0520 | [检测大写字母](/solution/0500-0599/0520.Detect%20Capital/README.md) | `字符串` | 简单 | | +| 0521 | [最长特殊序列 Ⅰ](/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README.md) | `字符串` | 简单 | | +| 0522 | [最长特殊序列 II](/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README.md) | `数组`,`哈希表`,`双指针`,`字符串`,`排序` | 中等 | | +| 0523 | [连续的子数组和](/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README.md) | `数组`,`哈希表`,`数学`,`前缀和` | 中等 | | +| 0524 | [通过删除字母匹配到字典里最长单词](/solution/0500-0599/0524.Longest%20Word%20in%20Dictionary%20through%20Deleting/README.md) | `数组`,`双指针`,`字符串`,`排序` | 中等 | | +| 0525 | [连续数组](/solution/0500-0599/0525.Contiguous%20Array/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | | +| 0526 | [优美的排列](/solution/0500-0599/0526.Beautiful%20Arrangement/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | | +| 0527 | [单词缩写](/solution/0500-0599/0527.Word%20Abbreviation/README.md) | `贪心`,`字典树`,`数组`,`字符串`,`排序` | 困难 | 🔒 | +| 0528 | [按权重随机选择](/solution/0500-0599/0528.Random%20Pick%20with%20Weight/README.md) | `数组`,`数学`,`二分查找`,`前缀和`,`随机化` | 中等 | | +| 0529 | [扫雷游戏](/solution/0500-0599/0529.Minesweeper/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | | +| 0530 | [二叉搜索树的最小绝对差](/solution/0500-0599/0530.Minimum%20Absolute%20Difference%20in%20BST/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉搜索树`,`二叉树` | 简单 | | +| 0531 | [孤独像素 I](/solution/0500-0599/0531.Lonely%20Pixel%20I/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 🔒 | +| 0532 | [数组中的 k-diff 数对](/solution/0500-0599/0532.K-diff%20Pairs%20in%20an%20Array/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`排序` | 中等 | | +| 0533 | [孤独像素 II](/solution/0500-0599/0533.Lonely%20Pixel%20II/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 🔒 | +| 0534 | [游戏玩法分析 III](/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README.md) | `数据库` | 中等 | 🔒 | +| 0535 | [TinyURL 的加密与解密](/solution/0500-0599/0535.Encode%20and%20Decode%20TinyURL/README.md) | `设计`,`哈希表`,`字符串`,`哈希函数` | 中等 | | +| 0536 | [从字符串生成二叉树](/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README.md) | `栈`,`树`,`深度优先搜索`,`字符串`,`二叉树` | 中等 | 🔒 | +| 0537 | [复数乘法](/solution/0500-0599/0537.Complex%20Number%20Multiplication/README.md) | `数学`,`字符串`,`模拟` | 中等 | | +| 0538 | [把二叉搜索树转换为累加树](/solution/0500-0599/0538.Convert%20BST%20to%20Greater%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | +| 0539 | [最小时间差](/solution/0500-0599/0539.Minimum%20Time%20Difference/README.md) | `数组`,`数学`,`字符串`,`排序` | 中等 | | +| 0540 | [有序数组中的单一元素](/solution/0500-0599/0540.Single%20Element%20in%20a%20Sorted%20Array/README.md) | `数组`,`二分查找` | 中等 | | +| 0541 | [反转字符串 II](/solution/0500-0599/0541.Reverse%20String%20II/README.md) | `双指针`,`字符串` | 简单 | | +| 0542 | [01 矩阵](/solution/0500-0599/0542.01%20Matrix/README.md) | `广度优先搜索`,`数组`,`动态规划`,`矩阵` | 中等 | | +| 0543 | [二叉树的直径](/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | | +| 0544 | [输出比赛匹配对](/solution/0500-0599/0544.Output%20Contest%20Matches/README.md) | `递归`,`字符串`,`模拟` | 中等 | 🔒 | +| 0545 | [二叉树的边界](/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | +| 0546 | [移除盒子](/solution/0500-0599/0546.Remove%20Boxes/README.md) | `记忆化搜索`,`数组`,`动态规划` | 困难 | | +| 0547 | [省份数量](/solution/0500-0599/0547.Number%20of%20Provinces/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | | +| 0548 | [将数组分割成和相等的子数组](/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README.md) | `数组`,`哈希表`,`前缀和` | 困难 | 🔒 | +| 0549 | [二叉树最长连续序列 II](/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | +| 0550 | [游戏玩法分析 IV](/solution/0500-0599/0550.Game%20Play%20Analysis%20IV/README.md) | `数据库` | 中等 | | +| 0551 | [学生出勤记录 I](/solution/0500-0599/0551.Student%20Attendance%20Record%20I/README.md) | `字符串` | 简单 | | +| 0552 | [学生出勤记录 II](/solution/0500-0599/0552.Student%20Attendance%20Record%20II/README.md) | `动态规划` | 困难 | | +| 0553 | [最优除法](/solution/0500-0599/0553.Optimal%20Division/README.md) | `数组`,`数学`,`动态规划` | 中等 | | +| 0554 | [砖墙](/solution/0500-0599/0554.Brick%20Wall/README.md) | `数组`,`哈希表` | 中等 | | +| 0555 | [分割连接字符串](/solution/0500-0599/0555.Split%20Concatenated%20Strings/README.md) | `贪心`,`数组`,`字符串` | 中等 | 🔒 | +| 0556 | [下一个更大元素 III](/solution/0500-0599/0556.Next%20Greater%20Element%20III/README.md) | `数学`,`双指针`,`字符串` | 中等 | | +| 0557 | [反转字符串中的单词 III](/solution/0500-0599/0557.Reverse%20Words%20in%20a%20String%20III/README.md) | `双指针`,`字符串` | 简单 | | +| 0558 | [四叉树交集](/solution/0500-0599/0558.Logical%20OR%20of%20Two%20Binary%20Grids%20Represented%20as%20Quad-Trees/README.md) | `树`,`分治` | 中等 | | +| 0559 | [N 叉树的最大深度](/solution/0500-0599/0559.Maximum%20Depth%20of%20N-ary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索` | 简单 | | +| 0560 | [和为 K 的子数组](/solution/0500-0599/0560.Subarray%20Sum%20Equals%20K/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | | +| 0561 | [数组拆分](/solution/0500-0599/0561.Array%20Partition/README.md) | `贪心`,`数组`,`计数排序`,`排序` | 简单 | | +| 0562 | [矩阵中最长的连续 1 线段](/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 🔒 | +| 0563 | [二叉树的坡度](/solution/0500-0599/0563.Binary%20Tree%20Tilt/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | | +| 0564 | [寻找最近的回文数](/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README.md) | `数学`,`字符串` | 困难 | | +| 0565 | [数组嵌套](/solution/0500-0599/0565.Array%20Nesting/README.md) | `深度优先搜索`,`数组` | 中等 | | +| 0566 | [重塑矩阵](/solution/0500-0599/0566.Reshape%20the%20Matrix/README.md) | `数组`,`矩阵`,`模拟` | 简单 | | +| 0567 | [字符串的排列](/solution/0500-0599/0567.Permutation%20in%20String/README.md) | `哈希表`,`双指针`,`字符串`,`滑动窗口` | 中等 | | +| 0568 | [最大休假天数](/solution/0500-0599/0568.Maximum%20Vacation%20Days/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 🔒 | +| 0569 | [员工薪水中位数](/solution/0500-0599/0569.Median%20Employee%20Salary/README.md) | `数据库` | 困难 | 🔒 | +| 0570 | [至少有 5 名直接下属的经理](/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README.md) | `数据库` | 中等 | | +| 0571 | [给定数字的频率查询中位数](/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README.md) | `数据库` | 困难 | 🔒 | +| 0572 | [另一棵树的子树](/solution/0500-0599/0572.Subtree%20of%20Another%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树`,`字符串匹配`,`哈希函数` | 简单 | | +| 0573 | [松鼠模拟](/solution/0500-0599/0573.Squirrel%20Simulation/README.md) | `数组`,`数学` | 中等 | 🔒 | +| 0574 | [当选者](/solution/0500-0599/0574.Winning%20Candidate/README.md) | `数据库` | 中等 | 🔒 | +| 0575 | [分糖果](/solution/0500-0599/0575.Distribute%20Candies/README.md) | `数组`,`哈希表` | 简单 | | +| 0576 | [出界的路径数](/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README.md) | `动态规划` | 中等 | | +| 0577 | [员工奖金](/solution/0500-0599/0577.Employee%20Bonus/README.md) | `数据库` | 简单 | | +| 0578 | [查询回答率最高的问题](/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README.md) | `数据库` | 中等 | 🔒 | +| 0579 | [查询员工的累计薪水](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md) | `数据库` | 困难 | 🔒 | +| 0580 | [统计各专业学生人数](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md) | `数据库` | 中等 | 🔒 | +| 0581 | [最短无序连续子数组](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md) | `栈`,`贪心`,`数组`,`双指针`,`排序`,`单调栈` | 中等 | | +| 0582 | [杀掉进程](/solution/0500-0599/0582.Kill%20Process/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组`,`哈希表` | 中等 | 🔒 | +| 0583 | [两个字符串的删除操作](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md) | `字符串`,`动态规划` | 中等 | | +| 0584 | [寻找用户推荐人](/solution/0500-0599/0584.Find%20Customer%20Referee/README.md) | `数据库` | 简单 | | +| 0585 | [2016 年的投资](/solution/0500-0599/0585.Investments%20in%202016/README.md) | `数据库` | 中等 | | +| 0586 | [订单最多的客户](/solution/0500-0599/0586.Customer%20Placing%20the%20Largest%20Number%20of%20Orders/README.md) | `数据库` | 简单 | | +| 0587 | [安装栅栏](/solution/0500-0599/0587.Erect%20the%20Fence/README.md) | `几何`,`数组`,`数学` | 困难 | | +| 0588 | [设计内存文件系统](/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 困难 | 🔒 | +| 0589 | [N 叉树的前序遍历](/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README.md) | `栈`,`树`,`深度优先搜索` | 简单 | | +| 0590 | [N 叉树的后序遍历](/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README.md) | `栈`,`树`,`深度优先搜索` | 简单 | | +| 0591 | [标签验证器](/solution/0500-0599/0591.Tag%20Validator/README.md) | `栈`,`字符串` | 困难 | | +| 0592 | [分数加减运算](/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README.md) | `数学`,`字符串`,`模拟` | 中等 | | +| 0593 | [有效的正方形](/solution/0500-0599/0593.Valid%20Square/README.md) | `几何`,`数学` | 中等 | | +| 0594 | [最长和谐子序列](/solution/0500-0599/0594.Longest%20Harmonious%20Subsequence/README.md) | `数组`,`哈希表`,`计数`,`排序`,`滑动窗口` | 简单 | | +| 0595 | [大的国家](/solution/0500-0599/0595.Big%20Countries/README.md) | `数据库` | 简单 | | +| 0596 | [超过 5 名学生的课](/solution/0500-0599/0596.Classes%20More%20Than%205%20Students/README.md) | `数据库` | 简单 | | +| 0597 | [好友申请 I：总体通过率](/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README.md) | `数据库` | 简单 | 🔒 | +| 0598 | [区间加法 II](/solution/0500-0599/0598.Range%20Addition%20II/README.md) | `数组`,`数学` | 简单 | | +| 0599 | [两个列表的最小索引总和](/solution/0500-0599/0599.Minimum%20Index%20Sum%20of%20Two%20Lists/README.md) | `数组`,`哈希表`,`字符串` | 简单 | | +| 0600 | [不含连续 1 的非负整数](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md) | `动态规划` | 困难 | | +| 0601 | [体育馆的人流量](/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README.md) | `数据库` | 困难 | | +| 0602 | [好友申请 II ：谁有最多的好友](/solution/0600-0699/0602.Friend%20Requests%20II%20Who%20Has%20the%20Most%20Friends/README.md) | `数据库` | 中等 | | +| 0603 | [连续空余座位](/solution/0600-0699/0603.Consecutive%20Available%20Seats/README.md) | `数据库` | 简单 | 🔒 | +| 0604 | [迭代压缩字符串](/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README.md) | `设计`,`数组`,`字符串`,`迭代器` | 简单 | 🔒 | +| 0605 | [种花问题](/solution/0600-0699/0605.Can%20Place%20Flowers/README.md) | `贪心`,`数组` | 简单 | | +| 0606 | [根据二叉树创建字符串](/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`字符串`,`二叉树` | 中等 | | +| 0607 | [销售员](/solution/0600-0699/0607.Sales%20Person/README.md) | `数据库` | 简单 | | +| 0608 | [树节点](/solution/0600-0699/0608.Tree%20Node/README.md) | `数据库` | 中等 | | +| 0609 | [在系统中查找重复文件](/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README.md) | `数组`,`哈希表`,`字符串` | 中等 | | +| 0610 | [判断三角形](/solution/0600-0699/0610.Triangle%20Judgement/README.md) | `数据库` | 简单 | | +| 0611 | [有效三角形的个数](/solution/0600-0699/0611.Valid%20Triangle%20Number/README.md) | `贪心`,`数组`,`双指针`,`二分查找`,`排序` | 中等 | | +| 0612 | [平面上的最近距离](/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README.md) | `数据库` | 中等 | 🔒 | +| 0613 | [直线上的最近距离](/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README.md) | `数据库` | 简单 | 🔒 | +| 0614 | [二级关注者](/solution/0600-0699/0614.Second%20Degree%20Follower/README.md) | `数据库` | 中等 | 🔒 | +| 0615 | [平均工资：部门与公司比较](/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README.md) | `数据库` | 困难 | 🔒 | +| 0616 | [给字符串添加加粗标签](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`字符串匹配` | 中等 | 🔒 | +| 0617 | [合并二叉树](/solution/0600-0699/0617.Merge%20Two%20Binary%20Trees/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | +| 0618 | [学生地理信息报告](/solution/0600-0699/0618.Students%20Report%20By%20Geography/README.md) | `数据库` | 困难 | 🔒 | +| 0619 | [只出现一次的最大数字](/solution/0600-0699/0619.Biggest%20Single%20Number/README.md) | `数据库` | 简单 | | +| 0620 | [有趣的电影](/solution/0600-0699/0620.Not%20Boring%20Movies/README.md) | `数据库` | 简单 | | +| 0621 | [任务调度器](/solution/0600-0699/0621.Task%20Scheduler/README.md) | `贪心`,`数组`,`哈希表`,`计数`,`排序`,`堆（优先队列）` | 中等 | | +| 0622 | [设计循环队列](/solution/0600-0699/0622.Design%20Circular%20Queue/README.md) | `设计`,`队列`,`数组`,`链表` | 中等 | | +| 0623 | [在二叉树中增加一行](/solution/0600-0699/0623.Add%20One%20Row%20to%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | +| 0624 | [数组列表中的最大距离](/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README.md) | `贪心`,`数组` | 中等 | 🔒 | +| 0625 | [最小因式分解](/solution/0600-0699/0625.Minimum%20Factorization/README.md) | `贪心`,`数学` | 中等 | 🔒 | +| 0626 | [换座位](/solution/0600-0699/0626.Exchange%20Seats/README.md) | `数据库` | 中等 | | +| 0627 | [变更性别](/solution/0600-0699/0627.Swap%20Salary/README.md) | `数据库` | 简单 | | +| 0628 | [三个数的最大乘积](/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README.md) | `数组`,`数学`,`排序` | 简单 | | +| 0629 | [K 个逆序对数组](/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README.md) | `动态规划` | 困难 | | +| 0630 | [课程表 III](/solution/0600-0699/0630.Course%20Schedule%20III/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 困难 | | +| 0631 | [设计 Excel 求和公式](/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README.md) | `图`,`设计`,`拓扑排序`,`数组`,`矩阵` | 困难 | 🔒 | +| 0632 | [最小区间](/solution/0600-0699/0632.Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/README.md) | `贪心`,`数组`,`哈希表`,`排序`,`滑动窗口`,`堆（优先队列）` | 困难 | | +| 0633 | [平方数之和](/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README.md) | `数学`,`双指针`,`二分查找` | 中等 | | +| 0634 | [寻找数组的错位排列](/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README.md) | `数学`,`动态规划` | 中等 | 🔒 | +| 0635 | [设计日志存储系统](/solution/0600-0699/0635.Design%20Log%20Storage%20System/README.md) | `设计`,`哈希表`,`字符串`,`有序集合` | 中等 | 🔒 | +| 0636 | [函数的独占时间](/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README.md) | `栈`,`数组` | 中等 | | +| 0637 | [二叉树的层平均值](/solution/0600-0699/0637.Average%20of%20Levels%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | +| 0638 | [大礼包](/solution/0600-0699/0638.Shopping%20Offers/README.md) | `位运算`,`记忆化搜索`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | | +| 0639 | [解码方法 II](/solution/0600-0699/0639.Decode%20Ways%20II/README.md) | `字符串`,`动态规划` | 困难 | | +| 0640 | [求解方程](/solution/0600-0699/0640.Solve%20the%20Equation/README.md) | `数学`,`字符串`,`模拟` | 中等 | | +| 0641 | [设计循环双端队列](/solution/0600-0699/0641.Design%20Circular%20Deque/README.md) | `设计`,`队列`,`数组`,`链表` | 中等 | | +| 0642 | [设计搜索自动补全系统](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md) | `设计`,`字典树`,`字符串`,`数据流`,`排序`,`堆（优先队列）` | 困难 | 🔒 | +| 0643 | [子数组最大平均数 I](/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README.md) | `数组`,`滑动窗口` | 简单 | | +| 0644 | [子数组最大平均数 II](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README.md) | `数组`,`二分查找`,`前缀和` | 困难 | 🔒 | +| 0645 | [错误的集合](/solution/0600-0699/0645.Set%20Mismatch/README.md) | `位运算`,`数组`,`哈希表`,`排序` | 简单 | | +| 0646 | [最长数对链](/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README.md) | `贪心`,`数组`,`动态规划`,`排序` | 中等 | | +| 0647 | [回文子串](/solution/0600-0699/0647.Palindromic%20Substrings/README.md) | `双指针`,`字符串`,`动态规划` | 中等 | | +| 0648 | [单词替换](/solution/0600-0699/0648.Replace%20Words/README.md) | `字典树`,`数组`,`哈希表`,`字符串` | 中等 | | +| 0649 | [Dota2 参议院](/solution/0600-0699/0649.Dota2%20Senate/README.md) | `贪心`,`队列`,`字符串` | 中等 | | +| 0650 | [两个键的键盘](/solution/0600-0699/0650.2%20Keys%20Keyboard/README.md) | `数学`,`动态规划` | 中等 | | +| 0651 | [四个键的键盘](/solution/0600-0699/0651.4%20Keys%20Keyboard/README.md) | `数学`,`动态规划` | 中等 | 🔒 | +| 0652 | [寻找重复的子树](/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README.md) | `树`,`深度优先搜索`,`哈希表`,`二叉树` | 中等 | | +| 0653 | [两数之和 IV - 输入二叉搜索树](/solution/0600-0699/0653.Two%20Sum%20IV%20-%20Input%20is%20a%20BST/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉搜索树`,`哈希表`,`双指针`,`二叉树` | 简单 | | +| 0654 | [最大二叉树](/solution/0600-0699/0654.Maximum%20Binary%20Tree/README.md) | `栈`,`树`,`数组`,`分治`,`二叉树`,`单调栈` | 中等 | | +| 0655 | [输出二叉树](/solution/0600-0699/0655.Print%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | +| 0656 | [成本最小路径](/solution/0600-0699/0656.Coin%20Path/README.md) | `数组`,`动态规划` | 困难 | 🔒 | +| 0657 | [机器人能否返回原点](/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README.md) | `字符串`,`模拟` | 简单 | | +| 0658 | [找到 K 个最接近的元素](/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README.md) | `数组`,`双指针`,`二分查找`,`排序`,`滑动窗口`,`堆（优先队列）` | 中等 | | +| 0659 | [分割数组为连续子序列](/solution/0600-0699/0659.Split%20Array%20into%20Consecutive%20Subsequences/README.md) | `贪心`,`数组`,`哈希表`,`堆（优先队列）` | 中等 | | +| 0660 | [移除 9](/solution/0600-0699/0660.Remove%209/README.md) | `数学` | 困难 | 🔒 | +| 0661 | [图片平滑器](/solution/0600-0699/0661.Image%20Smoother/README.md) | `数组`,`矩阵` | 简单 | | +| 0662 | [二叉树最大宽度](/solution/0600-0699/0662.Maximum%20Width%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | | +| 0663 | [均匀树划分](/solution/0600-0699/0663.Equal%20Tree%20Partition/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | +| 0664 | [奇怪的打印机](/solution/0600-0699/0664.Strange%20Printer/README.md) | `字符串`,`动态规划` | 困难 | | +| 0665 | [非递减数列](/solution/0600-0699/0665.Non-decreasing%20Array/README.md) | `数组` | 中等 | | +| 0666 | [路径总和 IV](/solution/0600-0699/0666.Path%20Sum%20IV/README.md) | `树`,`深度优先搜索`,`数组`,`哈希表`,`二叉树` | 中等 | 🔒 | +| 0667 | [优美的排列 II](/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README.md) | `数组`,`数学` | 中等 | | +| 0668 | [乘法表中第 k 小的数](/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README.md) | `数学`,`二分查找` | 困难 | | +| 0669 | [修剪二叉搜索树](/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | | +| 0670 | [最大交换](/solution/0600-0699/0670.Maximum%20Swap/README.md) | `贪心`,`数学` | 中等 | | +| 0671 | [二叉树中第二小的节点](/solution/0600-0699/0671.Second%20Minimum%20Node%20In%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | | +| 0672 | [灯泡开关 Ⅱ](/solution/0600-0699/0672.Bulb%20Switcher%20II/README.md) | `位运算`,`深度优先搜索`,`广度优先搜索`,`数学` | 中等 | | +| 0673 | [最长递增子序列的个数](/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README.md) | `树状数组`,`线段树`,`数组`,`动态规划` | 中等 | | +| 0674 | [最长连续递增序列](/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README.md) | `数组` | 简单 | | +| 0675 | [为高尔夫比赛砍树](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md) | `广度优先搜索`,`数组`,`矩阵`,`堆（优先队列）` | 困难 | | +| 0676 | [实现一个魔法字典](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md) | `深度优先搜索`,`设计`,`字典树`,`哈希表`,`字符串` | 中等 | | +| 0677 | [键值映射](/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | | +| 0678 | [有效的括号字符串](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md) | `栈`,`贪心`,`字符串`,`动态规划` | 中等 | | +| 0679 | [24 点游戏](/solution/0600-0699/0679.24%20Game/README.md) | `数组`,`数学`,`回溯` | 困难 | | +| 0680 | [验证回文串 II](/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md) | `贪心`,`双指针`,`字符串` | 简单 | | +| 0681 | [最近时刻](/solution/0600-0699/0681.Next%20Closest%20Time/README.md) | `哈希表`,`字符串`,`回溯`,`枚举` | 中等 | 🔒 | +| 0682 | [棒球比赛](/solution/0600-0699/0682.Baseball%20Game/README.md) | `栈`,`数组`,`模拟` | 简单 | | +| 0683 | [K 个关闭的灯泡](/solution/0600-0699/0683.K%20Empty%20Slots/README.md) | `树状数组`,`数组`,`有序集合`,`滑动窗口` | 困难 | 🔒 | +| 0684 | [冗余连接](/solution/0600-0699/0684.Redundant%20Connection/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | | +| 0685 | [冗余连接 II](/solution/0600-0699/0685.Redundant%20Connection%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 困难 | | +| 0686 | [重复叠加字符串匹配](/solution/0600-0699/0686.Repeated%20String%20Match/README.md) | `字符串`,`字符串匹配` | 中等 | | +| 0687 | [最长同值路径](/solution/0600-0699/0687.Longest%20Univalue%20Path/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | | +| 0688 | [骑士在棋盘上的概率](/solution/0600-0699/0688.Knight%20Probability%20in%20Chessboard/README.md) | `动态规划` | 中等 | | +| 0689 | [三个无重叠子数组的最大和](/solution/0600-0699/0689.Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays/README.md) | `数组`,`动态规划` | 困难 | | +| 0690 | [员工的重要性](/solution/0600-0699/0690.Employee%20Importance/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组`,`哈希表` | 中等 | | +| 0691 | [贴纸拼词](/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README.md) | `位运算`,`数组`,`字符串`,`动态规划`,`回溯`,`状态压缩` | 困难 | | +| 0692 | [前 K 个高频单词](/solution/0600-0699/0692.Top%20K%20Frequent%20Words/README.md) | `字典树`,`哈希表`,`字符串`,`桶排序`,`计数`,`排序`,`堆（优先队列）` | 中等 | | +| 0693 | [交替位二进制数](/solution/0600-0699/0693.Binary%20Number%20with%20Alternating%20Bits/README.md) | `位运算` | 简单 | | +| 0694 | [不同岛屿的数量](/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`哈希表`,`哈希函数` | 中等 | 🔒 | +| 0695 | [岛屿的最大面积](/solution/0600-0699/0695.Max%20Area%20of%20Island/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | | +| 0696 | [计数二进制子串](/solution/0600-0699/0696.Count%20Binary%20Substrings/README.md) | `双指针`,`字符串` | 简单 | | +| 0697 | [数组的度](/solution/0600-0699/0697.Degree%20of%20an%20Array/README.md) | `数组`,`哈希表` | 简单 | | +| 0698 | [划分为 k 个相等的子集](/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README.md) | `位运算`,`记忆化搜索`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | | +| 0699 | [掉落的方块](/solution/0600-0699/0699.Falling%20Squares/README.md) | `线段树`,`数组`,`有序集合` | 困难 | | +| 0700 | [二叉搜索树中的搜索](/solution/0700-0799/0700.Search%20in%20a%20Binary%20Search%20Tree/README.md) | `树`,`二叉搜索树`,`二叉树` | 简单 | | +| 0701 | [二叉搜索树中的插入操作](/solution/0700-0799/0701.Insert%20into%20a%20Binary%20Search%20Tree/README.md) | `树`,`二叉搜索树`,`二叉树` | 中等 | | +| 0702 | [搜索长度未知的有序数组](/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README.md) | `数组`,`二分查找`,`交互` | 中等 | 🔒 | +| 0703 | [数据流中的第 K 大元素](/solution/0700-0799/0703.Kth%20Largest%20Element%20in%20a%20Stream/README.md) | `树`,`设计`,`二叉搜索树`,`二叉树`,`数据流`,`堆（优先队列）` | 简单 | | +| 0704 | [二分查找](/solution/0700-0799/0704.Binary%20Search/README.md) | `数组`,`二分查找` | 简单 | | +| 0705 | [设计哈希集合](/solution/0700-0799/0705.Design%20HashSet/README.md) | `设计`,`数组`,`哈希表`,`链表`,`哈希函数` | 简单 | | +| 0706 | [设计哈希映射](/solution/0700-0799/0706.Design%20HashMap/README.md) | `设计`,`数组`,`哈希表`,`链表`,`哈希函数` | 简单 | | +| 0707 | [设计链表](/solution/0700-0799/0707.Design%20Linked%20List/README.md) | `设计`,`链表` | 中等 | | +| 0708 | [循环有序列表的插入](/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README.md) | `链表` | 中等 | 🔒 | +| 0709 | [转换成小写字母](/solution/0700-0799/0709.To%20Lower%20Case/README.md) | `字符串` | 简单 | | +| 0710 | [黑名单中的随机数](/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README.md) | `数组`,`哈希表`,`数学`,`二分查找`,`排序`,`随机化` | 困难 | | +| 0711 | [不同岛屿的数量 II](/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`哈希表`,`哈希函数` | 困难 | 🔒 | +| 0712 | [两个字符串的最小 ASCII 删除和](/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README.md) | `字符串`,`动态规划` | 中等 | | +| 0713 | [乘积小于 K 的子数组](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md) | `数组`,`滑动窗口` | 中等 | | +| 0714 | [买卖股票的最佳时机含手续费](/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README.md) | `贪心`,`数组`,`动态规划` | 中等 | | +| 0715 | [Range 模块](/solution/0700-0799/0715.Range%20Module/README.md) | `设计`,`线段树`,`有序集合` | 困难 | | +| 0716 | [最大栈](/solution/0700-0799/0716.Max%20Stack/README.md) | `栈`,`设计`,`链表`,`双向链表`,`有序集合` | 困难 | 🔒 | +| 0717 | [1 比特与 2 比特字符](/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README.md) | `数组` | 简单 | | +| 0718 | [最长重复子数组](/solution/0700-0799/0718.Maximum%20Length%20of%20Repeated%20Subarray/README.md) | `数组`,`二分查找`,`动态规划`,`滑动窗口`,`哈希函数`,`滚动哈希` | 中等 | | +| 0719 | [找出第 K 小的数对距离](/solution/0700-0799/0719.Find%20K-th%20Smallest%20Pair%20Distance/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 困难 | | +| 0720 | [词典中最长的单词](/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`排序` | 中等 | | +| 0721 | [账户合并](/solution/0700-0799/0721.Accounts%20Merge/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`字符串`,`排序` | 中等 | | +| 0722 | [删除注释](/solution/0700-0799/0722.Remove%20Comments/README.md) | `数组`,`字符串` | 中等 | | +| 0723 | [粉碎糖果](/solution/0700-0799/0723.Candy%20Crush/README.md) | `数组`,`双指针`,`矩阵`,`模拟` | 中等 | 🔒 | +| 0724 | [寻找数组的中心下标](/solution/0700-0799/0724.Find%20Pivot%20Index/README.md) | `数组`,`前缀和` | 简单 | | +| 0725 | [分隔链表](/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README.md) | `链表` | 中等 | | +| 0726 | [原子的数量](/solution/0700-0799/0726.Number%20of%20Atoms/README.md) | `栈`,`哈希表`,`字符串`,`排序` | 困难 | | +| 0727 | [最小窗口子序列](/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README.md) | `字符串`,`动态规划`,`滑动窗口` | 困难 | 🔒 | +| 0728 | [自除数](/solution/0700-0799/0728.Self%20Dividing%20Numbers/README.md) | `数学` | 简单 | | +| 0729 | [我的日程安排表 I](/solution/0700-0799/0729.My%20Calendar%20I/README.md) | `设计`,`线段树`,`数组`,`二分查找`,`有序集合` | 中等 | | +| 0730 | [统计不同回文子序列](/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README.md) | `字符串`,`动态规划` | 困难 | | +| 0731 | [我的日程安排表 II](/solution/0700-0799/0731.My%20Calendar%20II/README.md) | `设计`,`线段树`,`数组`,`二分查找`,`有序集合`,`前缀和` | 中等 | | +| 0732 | [我的日程安排表 III](/solution/0700-0799/0732.My%20Calendar%20III/README.md) | `设计`,`线段树`,`二分查找`,`有序集合`,`前缀和` | 困难 | | +| 0733 | [图像渲染](/solution/0700-0799/0733.Flood%20Fill/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 简单 | | +| 0734 | [句子相似性](/solution/0700-0799/0734.Sentence%20Similarity/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 🔒 | +| 0735 | [小行星碰撞](/solution/0700-0799/0735.Asteroid%20Collision/README.md) | `栈`,`数组`,`模拟` | 中等 | | +| 0736 | [Lisp 语法解析](/solution/0700-0799/0736.Parse%20Lisp%20Expression/README.md) | `栈`,`递归`,`哈希表`,`字符串` | 困难 | | +| 0737 | [句子相似性 II](/solution/0700-0799/0737.Sentence%20Similarity%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`字符串` | 中等 | 🔒 | +| 0738 | [单调递增的数字](/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README.md) | `贪心`,`数学` | 中等 | | +| 0739 | [每日温度](/solution/0700-0799/0739.Daily%20Temperatures/README.md) | `栈`,`数组`,`单调栈` | 中等 | | +| 0740 | [删除并获得点数](/solution/0700-0799/0740.Delete%20and%20Earn/README.md) | `数组`,`哈希表`,`动态规划` | 中等 | | +| 0741 | [摘樱桃](/solution/0700-0799/0741.Cherry%20Pickup/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | | +| 0742 | [二叉树最近的叶节点](/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | +| 0743 | [网络延迟时间](/solution/0700-0799/0743.Network%20Delay%20Time/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`最短路`,`堆（优先队列）` | 中等 | | +| 0744 | [寻找比目标字母大的最小字母](/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README.md) | `数组`,`二分查找` | 简单 | | +| 0745 | [前缀和后缀搜索](/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README.md) | `设计`,`字典树`,`数组`,`哈希表`,`字符串` | 困难 | | +| 0746 | [使用最小花费爬楼梯](/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README.md) | `数组`,`动态规划` | 简单 | | +| 0747 | [至少是其他数字两倍的最大数](/solution/0700-0799/0747.Largest%20Number%20At%20Least%20Twice%20of%20Others/README.md) | `数组`,`排序` | 简单 | | +| 0748 | [最短补全词](/solution/0700-0799/0748.Shortest%20Completing%20Word/README.md) | `数组`,`哈希表`,`字符串` | 简单 | | +| 0749 | [隔离病毒](/solution/0700-0799/0749.Contain%20Virus/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵`,`模拟` | 困难 | | +| 0750 | [角矩形的数量](/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README.md) | `数组`,`数学`,`动态规划`,`矩阵` | 中等 | 🔒 | +| 0751 | [IP 到 CIDR](/solution/0700-0799/0751.IP%20to%20CIDR/README.md) | `位运算`,`字符串` | 中等 | 🔒 | +| 0752 | [打开转盘锁](/solution/0700-0799/0752.Open%20the%20Lock/README.md) | `广度优先搜索`,`数组`,`哈希表`,`字符串` | 中等 | | +| 0753 | [破解保险箱](/solution/0700-0799/0753.Cracking%20the%20Safe/README.md) | `深度优先搜索`,`图`,`欧拉回路` | 困难 | | +| 0754 | [到达终点数字](/solution/0700-0799/0754.Reach%20a%20Number/README.md) | `数学`,`二分查找` | 中等 | | +| 0755 | [倒水](/solution/0700-0799/0755.Pour%20Water/README.md) | `数组`,`模拟` | 中等 | 🔒 | +| 0756 | [金字塔转换矩阵](/solution/0700-0799/0756.Pyramid%20Transition%20Matrix/README.md) | `位运算`,`深度优先搜索`,`广度优先搜索` | 中等 | | +| 0757 | [设置交集大小至少为 2](/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README.md) | `贪心`,`数组`,`排序` | 困难 | | +| 0758 | [字符串中的加粗单词](/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`字符串匹配` | 中等 | 🔒 | +| 0759 | [员工空闲时间](/solution/0700-0799/0759.Employee%20Free%20Time/README.md) | `数组`,`排序`,`堆（优先队列）` | 困难 | 🔒 | +| 0760 | [找出变位映射](/solution/0700-0799/0760.Find%20Anagram%20Mappings/README.md) | `数组`,`哈希表` | 简单 | 🔒 | +| 0761 | [特殊的二进制序列](/solution/0700-0799/0761.Special%20Binary%20String/README.md) | `递归`,`字符串` | 困难 | | +| 0762 | [二进制表示中质数个计算置位](/solution/0700-0799/0762.Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation/README.md) | `位运算`,`数学` | 简单 | | +| 0763 | [划分字母区间](/solution/0700-0799/0763.Partition%20Labels/README.md) | `贪心`,`哈希表`,`双指针`,`字符串` | 中等 | | +| 0764 | [最大加号标志](/solution/0700-0799/0764.Largest%20Plus%20Sign/README.md) | `数组`,`动态规划` | 中等 | | +| 0765 | [情侣牵手](/solution/0700-0799/0765.Couples%20Holding%20Hands/README.md) | `贪心`,`深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 困难 | | +| 0766 | [托普利茨矩阵](/solution/0700-0799/0766.Toeplitz%20Matrix/README.md) | `数组`,`矩阵` | 简单 | | +| 0767 | [重构字符串](/solution/0700-0799/0767.Reorganize%20String/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序`,`堆（优先队列）` | 中等 | | +| 0768 | [最多能完成排序的块 II](/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README.md) | `栈`,`贪心`,`数组`,`排序`,`单调栈` | 困难 | | +| 0769 | [最多能完成排序的块](/solution/0700-0799/0769.Max%20Chunks%20To%20Make%20Sorted/README.md) | `栈`,`贪心`,`数组`,`排序`,`单调栈` | 中等 | | +| 0770 | [基本计算器 IV](/solution/0700-0799/0770.Basic%20Calculator%20IV/README.md) | `栈`,`递归`,`哈希表`,`数学`,`字符串` | 困难 | | +| 0771 | [宝石与石头](/solution/0700-0799/0771.Jewels%20and%20Stones/README.md) | `哈希表`,`字符串` | 简单 | | +| 0772 | [基本计算器 III](/solution/0700-0799/0772.Basic%20Calculator%20III/README.md) | `栈`,`递归`,`数学`,`字符串` | 困难 | 🔒 | +| 0773 | [滑动谜题](/solution/0700-0799/0773.Sliding%20Puzzle/README.md) | `广度优先搜索`,`数组`,`矩阵` | 困难 | | +| 0774 | [最小化去加油站的最大距离](/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README.md) | `数组`,`二分查找` | 困难 | 🔒 | +| 0775 | [全局倒置与局部倒置](/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README.md) | `数组`,`数学` | 中等 | | +| 0776 | [拆分二叉搜索树](/solution/0700-0799/0776.Split%20BST/README.md) | `树`,`二叉搜索树`,`递归`,`二叉树` | 中等 | 🔒 | +| 0777 | [在 LR 字符串中交换相邻字符](/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README.md) | `双指针`,`字符串` | 中等 | | +| 0778 | [水位上升的泳池中游泳](/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`二分查找`,`矩阵`,`堆（优先队列）` | 困难 | | +| 0779 | [第 K 个语法符号](/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README.md) | `位运算`,`递归`,`数学` | 中等 | | +| 0780 | [到达终点](/solution/0700-0799/0780.Reaching%20Points/README.md) | `数学` | 困难 | | +| 0781 | [森林中的兔子](/solution/0700-0799/0781.Rabbits%20in%20Forest/README.md) | `贪心`,`数组`,`哈希表`,`数学` | 中等 | | +| 0782 | [变为棋盘](/solution/0700-0799/0782.Transform%20to%20Chessboard/README.md) | `位运算`,`数组`,`数学`,`矩阵` | 困难 | | +| 0783 | [二叉搜索树节点最小距离](/solution/0700-0799/0783.Minimum%20Distance%20Between%20BST%20Nodes/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉搜索树`,`二叉树` | 简单 | | +| 0784 | [字母大小写全排列](/solution/0700-0799/0784.Letter%20Case%20Permutation/README.md) | `位运算`,`字符串`,`回溯` | 中等 | | +| 0785 | [判断二分图](/solution/0700-0799/0785.Is%20Graph%20Bipartite/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | | +| 0786 | [第 K 个最小的质数分数](/solution/0700-0799/0786.K-th%20Smallest%20Prime%20Fraction/README.md) | `数组`,`双指针`,`二分查找`,`排序`,`堆（优先队列）` | 中等 | | +| 0787 | [K 站中转内最便宜的航班](/solution/0700-0799/0787.Cheapest%20Flights%20Within%20K%20Stops/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`动态规划`,`最短路`,`堆（优先队列）` | 中等 | | +| 0788 | [旋转数字](/solution/0700-0799/0788.Rotated%20Digits/README.md) | `数学`,`动态规划` | 中等 | | +| 0789 | [逃脱阻碍者](/solution/0700-0799/0789.Escape%20The%20Ghosts/README.md) | `数组`,`数学` | 中等 | | +| 0790 | [多米诺和托米诺平铺](/solution/0700-0799/0790.Domino%20and%20Tromino%20Tiling/README.md) | `动态规划` | 中等 | | +| 0791 | [自定义字符串排序](/solution/0700-0799/0791.Custom%20Sort%20String/README.md) | `哈希表`,`字符串`,`排序` | 中等 | | +| 0792 | [匹配子序列的单词数](/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`二分查找`,`动态规划`,`排序` | 中等 | | +| 0793 | [阶乘函数后 K 个零](/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README.md) | `数学`,`二分查找` | 困难 | | +| 0794 | [有效的井字游戏](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README.md) | `数组`,`矩阵` | 中等 | | +| 0795 | [区间子数组个数](/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README.md) | `数组`,`双指针` | 中等 | | +| 0796 | [旋转字符串](/solution/0700-0799/0796.Rotate%20String/README.md) | `字符串`,`字符串匹配` | 简单 | | +| 0797 | [所有可能的路径](/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`回溯` | 中等 | | +| 0798 | [得分最高的最小轮调](/solution/0700-0799/0798.Smallest%20Rotation%20with%20Highest%20Score/README.md) | `数组`,`前缀和` | 困难 | | +| 0799 | [香槟塔](/solution/0700-0799/0799.Champagne%20Tower/README.md) | `动态规划` | 中等 | | +| 0800 | [相似 RGB 颜色](/solution/0800-0899/0800.Similar%20RGB%20Color/README.md) | `数学`,`字符串`,`枚举` | 简单 | 🔒 | +| 0801 | [使序列递增的最小交换次数](/solution/0800-0899/0801.Minimum%20Swaps%20To%20Make%20Sequences%20Increasing/README.md) | `数组`,`动态规划` | 困难 | | +| 0802 | [找到最终的安全状态](/solution/0800-0899/0802.Find%20Eventual%20Safe%20States/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | | +| 0803 | [打砖块](/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README.md) | `并查集`,`数组`,`矩阵` | 困难 | | +| 0804 | [唯一摩尔斯密码词](/solution/0800-0899/0804.Unique%20Morse%20Code%20Words/README.md) | `数组`,`哈希表`,`字符串` | 简单 | | +| 0805 | [数组的均值分割](/solution/0800-0899/0805.Split%20Array%20With%20Same%20Average/README.md) | `位运算`,`数组`,`数学`,`动态规划`,`状态压缩` | 困难 | | +| 0806 | [写字符串需要的行数](/solution/0800-0899/0806.Number%20of%20Lines%20To%20Write%20String/README.md) | `数组`,`字符串` | 简单 | | +| 0807 | [保持城市天际线](/solution/0800-0899/0807.Max%20Increase%20to%20Keep%20City%20Skyline/README.md) | `贪心`,`数组`,`矩阵` | 中等 | | +| 0808 | [分汤](/solution/0800-0899/0808.Soup%20Servings/README.md) | `数学`,`动态规划`,`概率与统计` | 中等 | | +| 0809 | [情感丰富的文字](/solution/0800-0899/0809.Expressive%20Words/README.md) | `数组`,`双指针`,`字符串` | 中等 | | +| 0810 | [黑板异或游戏](/solution/0800-0899/0810.Chalkboard%20XOR%20Game/README.md) | `位运算`,`脑筋急转弯`,`数组`,`数学`,`博弈` | 困难 | | +| 0811 | [子域名访问计数](/solution/0800-0899/0811.Subdomain%20Visit%20Count/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 中等 | | +| 0812 | [最大三角形面积](/solution/0800-0899/0812.Largest%20Triangle%20Area/README.md) | `几何`,`数组`,`数学` | 简单 | | +| 0813 | [最大平均值和的分组](/solution/0800-0899/0813.Largest%20Sum%20of%20Averages/README.md) | `数组`,`动态规划`,`前缀和` | 中等 | | +| 0814 | [二叉树剪枝](/solution/0800-0899/0814.Binary%20Tree%20Pruning/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | | +| 0815 | [公交路线](/solution/0800-0899/0815.Bus%20Routes/README.md) | `广度优先搜索`,`数组`,`哈希表` | 困难 | | +| 0816 | [模糊坐标](/solution/0800-0899/0816.Ambiguous%20Coordinates/README.md) | `字符串`,`回溯`,`枚举` | 中等 | | +| 0817 | [链表组件](/solution/0800-0899/0817.Linked%20List%20Components/README.md) | `数组`,`哈希表`,`链表` | 中等 | | +| 0818 | [赛车](/solution/0800-0899/0818.Race%20Car/README.md) | `动态规划` | 困难 | | +| 0819 | [最常见的单词](/solution/0800-0899/0819.Most%20Common%20Word/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 简单 | | +| 0820 | [单词的压缩编码](/solution/0800-0899/0820.Short%20Encoding%20of%20Words/README.md) | `字典树`,`数组`,`哈希表`,`字符串` | 中等 | | +| 0821 | [字符的最短距离](/solution/0800-0899/0821.Shortest%20Distance%20to%20a%20Character/README.md) | `数组`,`双指针`,`字符串` | 简单 | | +| 0822 | [翻转卡片游戏](/solution/0800-0899/0822.Card%20Flipping%20Game/README.md) | `数组`,`哈希表` | 中等 | | +| 0823 | [带因子的二叉树](/solution/0800-0899/0823.Binary%20Trees%20With%20Factors/README.md) | `数组`,`哈希表`,`动态规划`,`排序` | 中等 | | +| 0824 | [山羊拉丁文](/solution/0800-0899/0824.Goat%20Latin/README.md) | `字符串` | 简单 | | +| 0825 | [适龄的朋友](/solution/0800-0899/0825.Friends%20Of%20Appropriate%20Ages/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | | +| 0826 | [安排工作以达到最大收益](/solution/0800-0899/0826.Most%20Profit%20Assigning%20Work/README.md) | `贪心`,`数组`,`双指针`,`二分查找`,`排序` | 中等 | | +| 0827 | [最大人工岛](/solution/0800-0899/0827.Making%20A%20Large%20Island/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 困难 | | +| 0828 | [统计子串中的唯一字符](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README.md) | `哈希表`,`字符串`,`动态规划` | 困难 | 第 83 场周赛 | +| 0829 | [连续整数求和](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README.md) | `数学`,`枚举` | 困难 | 第 83 场周赛 | +| 0830 | [较大分组的位置](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README.md) | `字符串` | 简单 | 第 83 场周赛 | +| 0831 | [隐藏个人信息](/solution/0800-0899/0831.Masking%20Personal%20Information/README.md) | `字符串` | 中等 | 第 83 场周赛 | +| 0832 | [翻转图像](/solution/0800-0899/0832.Flipping%20an%20Image/README.md) | `位运算`,`数组`,`双指针`,`矩阵`,`模拟` | 简单 | 第 84 场周赛 | +| 0833 | [字符串中的查找与替换](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README.md) | `数组`,`字符串`,`排序` | 中等 | 第 84 场周赛 | +| 0834 | [树中距离之和](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md) | `树`,`深度优先搜索`,`图`,`动态规划` | 困难 | 第 84 场周赛 | +| 0835 | [图像重叠](/solution/0800-0899/0835.Image%20Overlap/README.md) | `数组`,`矩阵` | 中等 | 第 84 场周赛 | +| 0836 | [矩形重叠](/solution/0800-0899/0836.Rectangle%20Overlap/README.md) | `几何`,`数学` | 简单 | 第 85 场周赛 | +| 0837 | [新 21 点](/solution/0800-0899/0837.New%2021%20Game/README.md) | `数学`,`动态规划`,`滑动窗口`,`概率与统计` | 中等 | 第 85 场周赛 | +| 0838 | [推多米诺](/solution/0800-0899/0838.Push%20Dominoes/README.md) | `双指针`,`字符串`,`动态规划` | 中等 | 第 85 场周赛 | +| 0839 | [相似字符串组](/solution/0800-0899/0839.Similar%20String%20Groups/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`字符串` | 困难 | 第 85 场周赛 | +| 0840 | [矩阵中的幻方](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README.md) | `数组`,`哈希表`,`数学`,`矩阵` | 中等 | 第 86 场周赛 | +| 0841 | [钥匙和房间](/solution/0800-0899/0841.Keys%20and%20Rooms/README.md) | `深度优先搜索`,`广度优先搜索`,`图` | 中等 | 第 86 场周赛 | +| 0842 | [将数组拆分成斐波那契序列](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README.md) | `字符串`,`回溯` | 中等 | 第 86 场周赛 | +| 0843 | [猜猜这个单词](/solution/0800-0899/0843.Guess%20the%20Word/README.md) | `数组`,`数学`,`字符串`,`博弈`,`交互` | 困难 | 第 86 场周赛 | +| 0844 | [比较含退格的字符串](/solution/0800-0899/0844.Backspace%20String%20Compare/README.md) | `栈`,`双指针`,`字符串`,`模拟` | 简单 | 第 87 场周赛 | +| 0845 | [数组中的最长山脉](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README.md) | `数组`,`双指针`,`动态规划`,`枚举` | 中等 | 第 87 场周赛 | +| 0846 | [一手顺子](/solution/0800-0899/0846.Hand%20of%20Straights/README.md) | `贪心`,`数组`,`哈希表`,`排序` | 中等 | 第 87 场周赛 | +| 0847 | [访问所有节点的最短路径](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md) | `位运算`,`广度优先搜索`,`图`,`动态规划`,`状态压缩` | 困难 | 第 87 场周赛 | +| 0848 | [字母移位](/solution/0800-0899/0848.Shifting%20Letters/README.md) | `数组`,`字符串`,`前缀和` | 中等 | 第 88 场周赛 | +| 0849 | [到最近的人的最大距离](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README.md) | `数组` | 中等 | 第 88 场周赛 | +| 0850 | [矩形面积 II](/solution/0800-0899/0850.Rectangle%20Area%20II/README.md) | `线段树`,`数组`,`有序集合`,`扫描线` | 困难 | 第 88 场周赛 | +| 0851 | [喧闹和富有](/solution/0800-0899/0851.Loud%20and%20Rich/README.md) | `深度优先搜索`,`图`,`拓扑排序`,`数组` | 中等 | 第 88 场周赛 | +| 0852 | [山脉数组的峰顶索引](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README.md) | `数组`,`二分查找` | 中等 | 第 89 场周赛 | +| 0853 | [车队](/solution/0800-0899/0853.Car%20Fleet/README.md) | `栈`,`数组`,`排序`,`单调栈` | 中等 | 第 89 场周赛 | +| 0854 | [相似度为 K 的字符串](/solution/0800-0899/0854.K-Similar%20Strings/README.md) | `广度优先搜索`,`字符串` | 困难 | 第 89 场周赛 | +| 0855 | [考场就座](/solution/0800-0899/0855.Exam%20Room/README.md) | `设计`,`有序集合`,`堆（优先队列）` | 中等 | 第 89 场周赛 | +| 0856 | [括号的分数](/solution/0800-0899/0856.Score%20of%20Parentheses/README.md) | `栈`,`字符串` | 中等 | 第 90 场周赛 | +| 0857 | [雇佣 K 名工人的最低成本](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 困难 | 第 90 场周赛 | +| 0858 | [镜面反射](/solution/0800-0899/0858.Mirror%20Reflection/README.md) | `几何`,`数学`,`数论` | 中等 | 第 90 场周赛 | +| 0859 | [亲密字符串](/solution/0800-0899/0859.Buddy%20Strings/README.md) | `哈希表`,`字符串` | 简单 | 第 90 场周赛 | +| 0860 | [柠檬水找零](/solution/0800-0899/0860.Lemonade%20Change/README.md) | `贪心`,`数组` | 简单 | 第 91 场周赛 | +| 0861 | [翻转矩阵后的得分](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README.md) | `贪心`,`位运算`,`数组`,`矩阵` | 中等 | 第 91 场周赛 | +| 0862 | [和至少为 K 的最短子数组](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md) | `队列`,`数组`,`二分查找`,`前缀和`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 困难 | 第 91 场周赛 | +| 0863 | [二叉树中所有距离为 K 的结点](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 第 91 场周赛 | +| 0864 | [获取所有钥匙的最短路径](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README.md) | `位运算`,`广度优先搜索`,`数组`,`矩阵` | 困难 | 第 92 场周赛 | +| 0865 | [具有所有最深节点的最小子树](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 第 92 场周赛 | +| 0866 | [回文质数](/solution/0800-0899/0866.Prime%20Palindrome/README.md) | `数学`,`数论` | 中等 | 第 92 场周赛 | +| 0867 | [转置矩阵](/solution/0800-0899/0867.Transpose%20Matrix/README.md) | `数组`,`矩阵`,`模拟` | 简单 | 第 92 场周赛 | +| 0868 | [二进制间距](/solution/0800-0899/0868.Binary%20Gap/README.md) | `位运算` | 简单 | 第 93 场周赛 | +| 0869 | [重新排序得到 2 的幂](/solution/0800-0899/0869.Reordered%20Power%20of%202/README.md) | `哈希表`,`数学`,`计数`,`枚举`,`排序` | 中等 | 第 93 场周赛 | +| 0870 | [优势洗牌](/solution/0800-0899/0870.Advantage%20Shuffle/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 93 场周赛 | +| 0871 | [最低加油次数](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README.md) | `贪心`,`数组`,`动态规划`,`堆（优先队列）` | 困难 | 第 93 场周赛 | +| 0872 | [叶子相似的树](/solution/0800-0899/0872.Leaf-Similar%20Trees/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | 第 94 场周赛 | +| 0873 | [最长的斐波那契子序列的长度](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README.md) | `数组`,`哈希表`,`动态规划` | 中等 | 第 94 场周赛 | +| 0874 | [模拟行走机器人](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README.md) | `数组`,`哈希表`,`模拟` | 中等 | 第 94 场周赛 | +| 0875 | [爱吃香蕉的珂珂](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README.md) | `数组`,`二分查找` | 中等 | 第 94 场周赛 | +| 0876 | [链表的中间结点](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README.md) | `链表`,`双指针` | 简单 | 第 95 场周赛 | +| 0877 | [石子游戏](/solution/0800-0899/0877.Stone%20Game/README.md) | `数组`,`数学`,`动态规划`,`博弈` | 中等 | 第 95 场周赛 | +| 0878 | [第 N 个神奇数字](/solution/0800-0899/0878.Nth%20Magical%20Number/README.md) | `数学`,`二分查找` | 困难 | 第 95 场周赛 | +| 0879 | [盈利计划](/solution/0800-0899/0879.Profitable%20Schemes/README.md) | `数组`,`动态规划` | 困难 | 第 95 场周赛 | +| 0880 | [索引处的解码字符串](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README.md) | `栈`,`字符串` | 中等 | 第 96 场周赛 | +| 0881 | [救生艇](/solution/0800-0899/0881.Boats%20to%20Save%20People/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 96 场周赛 | +| 0882 | [细分图中的可到达节点](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README.md) | `图`,`最短路`,`堆（优先队列）` | 困难 | 第 96 场周赛 | +| 0883 | [三维形体投影面积](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README.md) | `几何`,`数组`,`数学`,`矩阵` | 简单 | 第 96 场周赛 | +| 0884 | [两句话中的不常见单词](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README.md) | `哈希表`,`字符串` | 简单 | 第 97 场周赛 | +| 0885 | [螺旋矩阵 III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 97 场周赛 | +| 0886 | [可能的二分法](/solution/0800-0899/0886.Possible%20Bipartition/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 第 97 场周赛 | +| 0887 | [鸡蛋掉落](/solution/0800-0899/0887.Super%20Egg%20Drop/README.md) | `数学`,`二分查找`,`动态规划` | 困难 | 第 97 场周赛 | +| 0888 | [公平的糖果交换](/solution/0800-0899/0888.Fair%20Candy%20Swap/README.md) | `数组`,`哈希表`,`二分查找`,`排序` | 简单 | 第 98 场周赛 | +| 0889 | [根据前序和后序遍历构造二叉树](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README.md) | `树`,`数组`,`哈希表`,`分治`,`二叉树` | 中等 | 第 98 场周赛 | +| 0890 | [查找和替换模式](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 98 场周赛 | +| 0891 | [子序列宽度之和](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README.md) | `数组`,`数学`,`排序` | 困难 | 第 98 场周赛 | +| 0892 | [三维形体的表面积](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README.md) | `几何`,`数组`,`数学`,`矩阵` | 简单 | 第 99 场周赛 | +| 0893 | [特殊等价字符串组](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 99 场周赛 | +| 0894 | [所有可能的真二叉树](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README.md) | `树`,`递归`,`记忆化搜索`,`动态规划`,`二叉树` | 中等 | 第 99 场周赛 | +| 0895 | [最大频率栈](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README.md) | `栈`,`设计`,`哈希表`,`有序集合` | 困难 | 第 99 场周赛 | +| 0896 | [单调数列](/solution/0800-0899/0896.Monotonic%20Array/README.md) | `数组` | 简单 | 第 100 场周赛 | +| 0897 | [递增顺序搜索树](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README.md) | `栈`,`树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 简单 | 第 100 场周赛 | +| 0898 | [子数组按位或操作](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README.md) | `位运算`,`数组`,`动态规划` | 中等 | 第 100 场周赛 | +| 0899 | [有序队列](/solution/0800-0899/0899.Orderly%20Queue/README.md) | `数学`,`字符串`,`排序` | 困难 | 第 100 场周赛 | +| 0900 | [RLE 迭代器](/solution/0900-0999/0900.RLE%20Iterator/README.md) | `设计`,`数组`,`计数`,`迭代器` | 中等 | 第 101 场周赛 | +| 0901 | [股票价格跨度](/solution/0900-0999/0901.Online%20Stock%20Span/README.md) | `栈`,`设计`,`数据流`,`单调栈` | 中等 | 第 101 场周赛 | +| 0902 | [最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md) | `数组`,`数学`,`字符串`,`二分查找`,`动态规划` | 困难 | 第 101 场周赛 | +| 0903 | [DI 序列的有效排列](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README.md) | `字符串`,`动态规划`,`前缀和` | 困难 | 第 101 场周赛 | +| 0904 | [水果成篮](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 102 场周赛 | +| 0905 | [按奇偶排序数组](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README.md) | `数组`,`双指针`,`排序` | 简单 | 第 102 场周赛 | +| 0906 | [超级回文数](/solution/0900-0999/0906.Super%20Palindromes/README.md) | `数学`,`枚举` | 困难 | 第 102 场周赛 | +| 0907 | [子数组的最小值之和](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md) | `栈`,`数组`,`动态规划`,`单调栈` | 中等 | 第 102 场周赛 | +| 0908 | [最小差值 I](/solution/0900-0999/0908.Smallest%20Range%20I/README.md) | `数组`,`数学` | 简单 | 第 103 场周赛 | +| 0909 | [蛇梯棋](/solution/0900-0999/0909.Snakes%20and%20Ladders/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 第 103 场周赛 | +| 0910 | [最小差值 II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md) | `贪心`,`数组`,`数学`,`排序` | 中等 | 第 103 场周赛 | +| 0911 | [在线选举](/solution/0900-0999/0911.Online%20Election/README.md) | `设计`,`数组`,`哈希表`,`二分查找` | 中等 | 第 103 场周赛 | +| 0912 | [排序数组](/solution/0900-0999/0912.Sort%20an%20Array/README.md) | `数组`,`分治`,`桶排序`,`计数排序`,`基数排序`,`排序`,`堆（优先队列）`,`归并排序` | 中等 | | +| 0913 | [猫和老鼠](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md) | `图`,`拓扑排序`,`记忆化搜索`,`数学`,`动态规划`,`博弈` | 困难 | 第 104 场周赛 | +| 0914 | [卡牌分组](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md) | `数组`,`哈希表`,`数学`,`计数`,`数论` | 简单 | 第 104 场周赛 | +| 0915 | [分割数组](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md) | `数组` | 中等 | 第 104 场周赛 | +| 0916 | [单词子集](/solution/0900-0999/0916.Word%20Subsets/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 104 场周赛 | +| 0917 | [仅仅反转字母](/solution/0900-0999/0917.Reverse%20Only%20Letters/README.md) | `双指针`,`字符串` | 简单 | 第 105 场周赛 | +| 0918 | [环形子数组的最大和](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md) | `队列`,`数组`,`分治`,`动态规划`,`单调队列` | 中等 | 第 105 场周赛 | +| 0919 | [完全二叉树插入器](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README.md) | `树`,`广度优先搜索`,`设计`,`二叉树` | 中等 | 第 105 场周赛 | +| 0920 | [播放列表的数量](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README.md) | `数学`,`动态规划`,`组合数学` | 困难 | 第 105 场周赛 | +| 0921 | [使括号有效的最少添加](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README.md) | `栈`,`贪心`,`字符串` | 中等 | 第 106 场周赛 | +| 0922 | [按奇偶排序数组 II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README.md) | `数组`,`双指针`,`排序` | 简单 | 第 106 场周赛 | +| 0923 | [三数之和的多种可能](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md) | `数组`,`哈希表`,`双指针`,`计数`,`排序` | 中等 | 第 106 场周赛 | +| 0924 | [尽量减少恶意软件的传播](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`数组`,`哈希表` | 困难 | 第 106 场周赛 | +| 0925 | [长按键入](/solution/0900-0999/0925.Long%20Pressed%20Name/README.md) | `双指针`,`字符串` | 简单 | 第 107 场周赛 | +| 0926 | [将字符串翻转到单调递增](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md) | `字符串`,`动态规划` | 中等 | 第 107 场周赛 | +| 0927 | [三等分](/solution/0900-0999/0927.Three%20Equal%20Parts/README.md) | `数组`,`数学` | 困难 | 第 107 场周赛 | +| 0928 | [尽量减少恶意软件的传播 II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`数组`,`哈希表` | 困难 | 第 107 场周赛 | +| 0929 | [独特的电子邮件地址](/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 108 场周赛 | +| 0930 | [和相同的二元子数组](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md) | `数组`,`哈希表`,`前缀和`,`滑动窗口` | 中等 | 第 108 场周赛 | +| 0931 | [下降路径最小和](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 108 场周赛 | +| 0932 | [漂亮数组](/solution/0900-0999/0932.Beautiful%20Array/README.md) | `数组`,`数学`,`分治` | 中等 | 第 108 场周赛 | +| 0933 | [最近的请求次数](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md) | `设计`,`队列`,`数据流` | 简单 | 第 109 场周赛 | +| 0934 | [最短的桥](/solution/0900-0999/0934.Shortest%20Bridge/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | 第 109 场周赛 | +| 0935 | [骑士拨号器](/solution/0900-0999/0935.Knight%20Dialer/README.md) | `动态规划` | 中等 | 第 109 场周赛 | +| 0936 | [戳印序列](/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md) | `栈`,`贪心`,`队列`,`字符串` | 困难 | 第 109 场周赛 | +| 0937 | [重新排列日志文件](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README.md) | `数组`,`字符串`,`排序` | 中等 | 第 110 场周赛 | +| 0938 | [二叉搜索树的范围和](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 简单 | 第 110 场周赛 | +| 0939 | [最小面积矩形](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README.md) | `几何`,`数组`,`哈希表`,`数学`,`排序` | 中等 | 第 110 场周赛 | +| 0940 | [不同的子序列 II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md) | `字符串`,`动态规划` | 困难 | 第 110 场周赛 | +| 0941 | [有效的山脉数组](/solution/0900-0999/0941.Valid%20Mountain%20Array/README.md) | `数组` | 简单 | 第 111 场周赛 | +| 0942 | [增减字符串匹配](/solution/0900-0999/0942.DI%20String%20Match/README.md) | `贪心`,`数组`,`双指针`,`字符串` | 简单 | 第 111 场周赛 | +| 0943 | [最短超级串](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README.md) | `位运算`,`数组`,`字符串`,`动态规划`,`状态压缩` | 困难 | 第 111 场周赛 | +| 0944 | [删列造序](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README.md) | `数组`,`字符串` | 简单 | 第 111 场周赛 | +| 0945 | [使数组唯一的最小增量](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README.md) | `贪心`,`数组`,`计数`,`排序` | 中等 | 第 112 场周赛 | +| 0946 | [验证栈序列](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README.md) | `栈`,`数组`,`模拟` | 中等 | 第 112 场周赛 | +| 0947 | [移除最多的同行或同列石头](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README.md) | `深度优先搜索`,`并查集`,`图`,`哈希表` | 中等 | 第 112 场周赛 | +| 0948 | [令牌放置](/solution/0900-0999/0948.Bag%20of%20Tokens/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 112 场周赛 | +| 0949 | [给定数字能组成的最大时间](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README.md) | `数组`,`字符串`,`枚举` | 中等 | 第 113 场周赛 | +| 0950 | [按递增顺序显示卡牌](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README.md) | `队列`,`数组`,`排序`,`模拟` | 中等 | 第 113 场周赛 | +| 0951 | [翻转等价二叉树](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 113 场周赛 | +| 0952 | [按公因数计算最大组件大小](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README.md) | `并查集`,`数组`,`哈希表`,`数学`,`数论` | 困难 | 第 113 场周赛 | +| 0953 | [验证外星语词典](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 114 场周赛 | +| 0954 | [二倍数对数组](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README.md) | `贪心`,`数组`,`哈希表`,`排序` | 中等 | 第 114 场周赛 | +| 0955 | [删列造序 II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README.md) | `贪心`,`数组`,`字符串` | 中等 | 第 114 场周赛 | +| 0956 | [最高的广告牌](/solution/0900-0999/0956.Tallest%20Billboard/README.md) | `数组`,`动态规划` | 困难 | 第 114 场周赛 | +| 0957 | [N 天后的牢房](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README.md) | `位运算`,`数组`,`哈希表`,`数学` | 中等 | 第 115 场周赛 | +| 0958 | [二叉树的完全性检验](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | 第 115 场周赛 | +| 0959 | [由斜杠划分区域](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`矩阵` | 中等 | 第 115 场周赛 | +| 0960 | [删列造序 III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md) | `数组`,`字符串`,`动态规划` | 困难 | 第 115 场周赛 | +| 0961 | [在长度 2N 的数组中找出重复 N 次的元素](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README.md) | `数组`,`哈希表` | 简单 | 第 116 场周赛 | +| 0962 | [最大宽度坡](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md) | `栈`,`数组`,`单调栈` | 中等 | 第 116 场周赛 | +| 0963 | [最小面积矩形 II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README.md) | `几何`,`数组`,`数学` | 中等 | 第 116 场周赛 | +| 0964 | [表示数字的最少运算符](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README.md) | `记忆化搜索`,`数学`,`动态规划` | 困难 | 第 116 场周赛 | +| 0965 | [单值二叉树](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | 第 117 场周赛 | +| 0966 | [元音拼写检查器](/solution/0900-0999/0966.Vowel%20Spellchecker/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 117 场周赛 | +| 0967 | [连续差相同的数字](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README.md) | `广度优先搜索`,`回溯` | 中等 | 第 117 场周赛 | +| 0968 | [监控二叉树](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README.md) | `树`,`深度优先搜索`,`动态规划`,`二叉树` | 困难 | 第 117 场周赛 | +| 0969 | [煎饼排序](/solution/0900-0999/0969.Pancake%20Sorting/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 118 场周赛 | +| 0970 | [强整数](/solution/0900-0999/0970.Powerful%20Integers/README.md) | `哈希表`,`数学`,`枚举` | 中等 | 第 118 场周赛 | +| 0971 | [翻转二叉树以匹配先序遍历](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 118 场周赛 | +| 0972 | [相等的有理数](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README.md) | `数学`,`字符串` | 困难 | 第 118 场周赛 | +| 0973 | [最接近原点的 K 个点](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README.md) | `几何`,`数组`,`数学`,`分治`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | 第 119 场周赛 | +| 0974 | [和可被 K 整除的子数组](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 119 场周赛 | +| 0975 | [奇偶跳](/solution/0900-0999/0975.Odd%20Even%20Jump/README.md) | `栈`,`数组`,`动态规划`,`有序集合`,`单调栈` | 困难 | 第 119 场周赛 | +| 0976 | [三角形的最大周长](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README.md) | `贪心`,`数组`,`数学`,`排序` | 简单 | 第 119 场周赛 | +| 0977 | [有序数组的平方](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README.md) | `数组`,`双指针`,`排序` | 简单 | 第 120 场周赛 | +| 0978 | [最长湍流子数组](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README.md) | `数组`,`动态规划`,`滑动窗口` | 中等 | 第 120 场周赛 | +| 0979 | [在二叉树中分配硬币](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 120 场周赛 | +| 0980 | [不同路径 III](/solution/0900-0999/0980.Unique%20Paths%20III/README.md) | `位运算`,`数组`,`回溯`,`矩阵` | 困难 | 第 120 场周赛 | +| 0981 | [基于时间的键值存储](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README.md) | `设计`,`哈希表`,`字符串`,`二分查找` | 中等 | 第 121 场周赛 | +| 0982 | [按位与为零的三元组](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README.md) | `位运算`,`数组`,`哈希表` | 困难 | 第 121 场周赛 | +| 0983 | [最低票价](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README.md) | `数组`,`动态规划` | 中等 | 第 121 场周赛 | +| 0984 | [不含 AAA 或 BBB 的字符串](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README.md) | `贪心`,`字符串` | 中等 | 第 121 场周赛 | +| 0985 | [查询后的偶数和](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README.md) | `数组`,`模拟` | 中等 | 第 122 场周赛 | +| 0986 | [区间列表的交集](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md) | `数组`,`双指针` | 中等 | 第 122 场周赛 | +| 0987 | [二叉树的垂序遍历](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树`,`排序` | 困难 | 第 122 场周赛 | +| 0988 | [从叶结点开始的最小字符串](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md) | `树`,`深度优先搜索`,`字符串`,`回溯`,`二叉树` | 中等 | 第 122 场周赛 | +| 0989 | [数组形式的整数加法](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md) | `数组`,`数学` | 简单 | 第 123 场周赛 | +| 0990 | [等式方程的可满足性](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md) | `并查集`,`图`,`数组`,`字符串` | 中等 | 第 123 场周赛 | +| 0991 | [坏了的计算器](/solution/0900-0999/0991.Broken%20Calculator/README.md) | `贪心`,`数学` | 中等 | 第 123 场周赛 | +| 0992 | [K 个不同整数的子数组](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md) | `数组`,`哈希表`,`计数`,`滑动窗口` | 困难 | 第 123 场周赛 | +| 0993 | [二叉树的堂兄弟节点](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | 第 124 场周赛 | +| 0994 | [腐烂的橘子](/solution/0900-0999/0994.Rotting%20Oranges/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 第 124 场周赛 | +| 0995 | [K 连续位的最小翻转次数](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README.md) | `位运算`,`队列`,`数组`,`前缀和`,`滑动窗口` | 困难 | 第 124 场周赛 | +| 0996 | [平方数组的数目](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README.md) | `位运算`,`数组`,`哈希表`,`数学`,`动态规划`,`回溯`,`状态压缩` | 困难 | 第 124 场周赛 | +| 0997 | [找到小镇的法官](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README.md) | `图`,`数组`,`哈希表` | 简单 | 第 125 场周赛 | +| 0998 | [最大二叉树 II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README.md) | `树`,`二叉树` | 中等 | 第 125 场周赛 | +| 0999 | [可以被一步捕获的棋子数](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README.md) | `数组`,`矩阵`,`模拟` | 简单 | 第 125 场周赛 | +| 1000 | [合并石头的最低成本](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README.md) | `数组`,`动态规划`,`前缀和` | 困难 | 第 126 场周赛 | +| 1001 | [网格照明](/solution/1000-1099/1001.Grid%20Illumination/README.md) | `数组`,`哈希表` | 困难 | 第 125 场周赛 | +| 1002 | [查找共用字符](/solution/1000-1099/1002.Find%20Common%20Characters/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 126 场周赛 | +| 1003 | [检查替换后的词是否有效](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README.md) | `栈`,`字符串` | 中等 | 第 126 场周赛 | +| 1004 | [最大连续 1 的个数 III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md) | `数组`,`二分查找`,`前缀和`,`滑动窗口` | 中等 | 第 126 场周赛 | +| 1005 | [K 次取反后最大化的数组和](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 127 场周赛 | +| 1006 | [笨阶乘](/solution/1000-1099/1006.Clumsy%20Factorial/README.md) | `栈`,`数学`,`模拟` | 中等 | 第 127 场周赛 | +| 1007 | [行相等的最少多米诺旋转](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README.md) | `贪心`,`数组` | 中等 | 第 127 场周赛 | +| 1008 | [前序遍历构造二叉搜索树](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README.md) | `栈`,`树`,`二叉搜索树`,`数组`,`二叉树`,`单调栈` | 中等 | 第 127 场周赛 | +| 1009 | [十进制整数的反码](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README.md) | `位运算` | 简单 | 第 128 场周赛 | +| 1010 | [总持续时间可被 60 整除的歌曲](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 128 场周赛 | +| 1011 | [在 D 天内送达包裹的能力](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README.md) | `数组`,`二分查找` | 中等 | 第 128 场周赛 | +| 1012 | [至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md) | `数学`,`动态规划` | 困难 | 第 128 场周赛 | +| 1013 | [将数组分成和相等的三个部分](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README.md) | `贪心`,`数组` | 简单 | 第 129 场周赛 | +| 1014 | [最佳观光组合](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README.md) | `数组`,`动态规划` | 中等 | 第 129 场周赛 | +| 1015 | [可被 K 整除的最小整数](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README.md) | `哈希表`,`数学` | 中等 | 第 129 场周赛 | +| 1016 | [子串能表示从 1 到 N 数字的二进制串](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README.md) | `字符串` | 中等 | 第 129 场周赛 | +| 1017 | [负二进制转换](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md) | `数学` | 中等 | 第 130 场周赛 | +| 1018 | [可被 5 整除的二进制前缀](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README.md) | `位运算`,`数组` | 简单 | 第 130 场周赛 | +| 1019 | [链表中的下一个更大节点](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README.md) | `栈`,`数组`,`链表`,`单调栈` | 中等 | 第 130 场周赛 | +| 1020 | [飞地的数量](/solution/1000-1099/1020.Number%20of%20Enclaves/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 130 场周赛 | +| 1021 | [删除最外层的括号](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md) | `栈`,`字符串` | 简单 | 第 131 场周赛 | +| 1022 | [从根到叶的二进制数之和](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | 第 131 场周赛 | +| 1023 | [驼峰式匹配](/solution/1000-1099/1023.Camelcase%20Matching/README.md) | `字典树`,`数组`,`双指针`,`字符串`,`字符串匹配` | 中等 | 第 131 场周赛 | +| 1024 | [视频拼接](/solution/1000-1099/1024.Video%20Stitching/README.md) | `贪心`,`数组`,`动态规划` | 中等 | 第 131 场周赛 | +| 1025 | [除数博弈](/solution/1000-1099/1025.Divisor%20Game/README.md) | `脑筋急转弯`,`数学`,`动态规划`,`博弈` | 简单 | 第 132 场周赛 | +| 1026 | [节点与其祖先之间的最大差值](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 132 场周赛 | +| 1027 | [最长等差数列](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README.md) | `数组`,`哈希表`,`二分查找`,`动态规划` | 中等 | 第 132 场周赛 | +| 1028 | [从先序遍历还原二叉树](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README.md) | `树`,`深度优先搜索`,`字符串`,`二叉树` | 困难 | 第 132 场周赛 | +| 1029 | [两地调度](/solution/1000-1099/1029.Two%20City%20Scheduling/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 133 场周赛 | +| 1030 | [距离顺序排列矩阵单元格](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README.md) | `几何`,`数组`,`数学`,`矩阵`,`排序` | 简单 | 第 133 场周赛 | +| 1031 | [两个非重叠子数组的最大和](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README.md) | `数组`,`动态规划`,`滑动窗口` | 中等 | 第 133 场周赛 | +| 1032 | [字符流](/solution/1000-1099/1032.Stream%20of%20Characters/README.md) | `设计`,`字典树`,`数组`,`字符串`,`数据流` | 困难 | 第 133 场周赛 | +| 1033 | [移动石子直到连续](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README.md) | `脑筋急转弯`,`数学` | 中等 | 第 134 场周赛 | +| 1034 | [边界着色](/solution/1000-1099/1034.Coloring%20A%20Border/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | 第 134 场周赛 | +| 1035 | [不相交的线](/solution/1000-1099/1035.Uncrossed%20Lines/README.md) | `数组`,`动态规划` | 中等 | 第 134 场周赛 | +| 1036 | [逃离大迷宫](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`哈希表` | 困难 | 第 134 场周赛 | +| 1037 | [有效的回旋镖](/solution/1000-1099/1037.Valid%20Boomerang/README.md) | `几何`,`数组`,`数学` | 简单 | 第 135 场周赛 | +| 1038 | [从二叉搜索树到更大和树](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树` | 中等 | 第 135 场周赛 | +| 1039 | [多边形三角剖分的最低得分](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md) | `数组`,`动态规划` | 中等 | 第 135 场周赛 | +| 1040 | [移动石子直到连续 II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README.md) | `数组`,`数学`,`双指针`,`排序` | 中等 | 第 135 场周赛 | +| 1041 | [困于环中的机器人](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README.md) | `数学`,`字符串`,`模拟` | 中等 | 第 136 场周赛 | +| 1042 | [不邻接植花](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README.md) | `深度优先搜索`,`广度优先搜索`,`图` | 中等 | 第 136 场周赛 | +| 1043 | [分隔数组以得到最大和](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README.md) | `数组`,`动态规划` | 中等 | 第 136 场周赛 | +| 1044 | [最长重复子串](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md) | `字符串`,`二分查找`,`后缀数组`,`滑动窗口`,`哈希函数`,`滚动哈希` | 困难 | 第 136 场周赛 | +| 1045 | [买下所有产品的客户](/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README.md) | `数据库` | 中等 | | +| 1046 | [最后一块石头的重量](/solution/1000-1099/1046.Last%20Stone%20Weight/README.md) | `数组`,`堆（优先队列）` | 简单 | 第 137 场周赛 | +| 1047 | [删除字符串中的所有相邻重复项](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README.md) | `栈`,`字符串` | 简单 | 第 137 场周赛 | +| 1048 | [最长字符串链](/solution/1000-1099/1048.Longest%20String%20Chain/README.md) | `数组`,`哈希表`,`双指针`,`字符串`,`动态规划` | 中等 | 第 137 场周赛 | +| 1049 | [最后一块石头的重量 II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md) | `数组`,`动态规划` | 中等 | 第 137 场周赛 | +| 1050 | [合作过至少三次的演员和导演](/solution/1000-1099/1050.Actors%20and%20Directors%20Who%20Cooperated%20At%20Least%20Three%20Times/README.md) | `数据库` | 简单 | | +| 1051 | [高度检查器](/solution/1000-1099/1051.Height%20Checker/README.md) | `数组`,`计数排序`,`排序` | 简单 | 第 138 场周赛 | +| 1052 | [爱生气的书店老板](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README.md) | `数组`,`滑动窗口` | 中等 | 第 138 场周赛 | +| 1053 | [交换一次的先前排列](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README.md) | `贪心`,`数组` | 中等 | 第 138 场周赛 | +| 1054 | [距离相等的条形码](/solution/1000-1099/1054.Distant%20Barcodes/README.md) | `贪心`,`数组`,`哈希表`,`计数`,`排序`,`堆（优先队列）` | 中等 | 第 138 场周赛 | +| 1055 | [形成字符串的最短路径](/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README.md) | `贪心`,`双指针`,`字符串` | 中等 | 🔒 | +| 1056 | [易混淆数](/solution/1000-1099/1056.Confusing%20Number/README.md) | `数学` | 简单 | 🔒 | +| 1057 | [校园自行车分配](/solution/1000-1099/1057.Campus%20Bikes/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | +| 1058 | [最小化舍入误差以满足目标](/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README.md) | `贪心`,`数组`,`数学`,`字符串`,`排序` | 中等 | 🔒 | +| 1059 | [从始点到终点的所有路径](/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README.md) | `图`,`拓扑排序` | 中等 | 🔒 | +| 1060 | [有序数组中的缺失元素](/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README.md) | `数组`,`二分查找` | 中等 | 🔒 | +| 1061 | [按字典序排列最小的等效字符串](/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README.md) | `并查集`,`字符串` | 中等 | | +| 1062 | [最长重复子串](/solution/1000-1099/1062.Longest%20Repeating%20Substring/README.md) | `字符串`,`二分查找`,`动态规划`,`后缀数组`,`哈希函数`,`滚动哈希` | 中等 | 🔒 | +| 1063 | [有效子数组的数目](/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README.md) | `栈`,`数组`,`单调栈` | 困难 | 🔒 | +| 1064 | [不动点](/solution/1000-1099/1064.Fixed%20Point/README.md) | `数组`,`二分查找` | 简单 | 第 1 场双周赛 | +| 1065 | [字符串的索引对](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md) | `字典树`,`数组`,`字符串`,`排序` | 简单 | 第 1 场双周赛 | +| 1066 | [校园自行车分配 II](/solution/1000-1099/1066.Campus%20Bikes%20II/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | 第 1 场双周赛 | +| 1067 | [范围内的数字计数](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README.md) | `数学`,`动态规划` | 困难 | 第 1 场双周赛 | +| 1068 | [产品销售分析 I](/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README.md) | `数据库` | 简单 | | +| 1069 | [产品销售分析 II](/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README.md) | `数据库` | 简单 | 🔒 | +| 1070 | [产品销售分析 III](/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README.md) | `数据库` | 中等 | | +| 1071 | [字符串的最大公因子](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README.md) | `数学`,`字符串` | 简单 | 第 139 场周赛 | +| 1072 | [按列翻转得到最大值等行数](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 第 139 场周赛 | +| 1073 | [负二进制数相加](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md) | `数组`,`数学` | 中等 | 第 139 场周赛 | +| 1074 | [元素和为目标值的子矩阵数量](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md) | `数组`,`哈希表`,`矩阵`,`前缀和` | 困难 | 第 139 场周赛 | +| 1075 | [项目员工 I](/solution/1000-1099/1075.Project%20Employees%20I/README.md) | `数据库` | 简单 | | +| 1076 | [项目员工 II](/solution/1000-1099/1076.Project%20Employees%20II/README.md) | `数据库` | 简单 | 🔒 | +| 1077 | [项目员工 III](/solution/1000-1099/1077.Project%20Employees%20III/README.md) | `数据库` | 中等 | 🔒 | +| 1078 | [Bigram 分词](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README.md) | `字符串` | 简单 | 第 140 场周赛 | +| 1079 | [活字印刷](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README.md) | `哈希表`,`字符串`,`回溯`,`计数` | 中等 | 第 140 场周赛 | +| 1080 | [根到叶路径上的不足节点](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 140 场周赛 | +| 1081 | [不同字符的最小子序列](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README.md) | `栈`,`贪心`,`字符串`,`单调栈` | 中等 | 第 140 场周赛 | +| 1082 | [销售分析 I ](/solution/1000-1099/1082.Sales%20Analysis%20I/README.md) | `数据库` | 简单 | 🔒 | +| 1083 | [销售分析 II](/solution/1000-1099/1083.Sales%20Analysis%20II/README.md) | `数据库` | 简单 | 🔒 | +| 1084 | [销售分析 III](/solution/1000-1099/1084.Sales%20Analysis%20III/README.md) | `数据库` | 简单 | | +| 1085 | [最小元素各数位之和](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md) | `数组`,`数学` | 简单 | 第 2 场双周赛 | +| 1086 | [前五科的均分](/solution/1000-1099/1086.High%20Five/README.md) | `数组`,`哈希表`,`排序`,`堆（优先队列）` | 简单 | 第 2 场双周赛 | +| 1087 | [花括号展开](/solution/1000-1099/1087.Brace%20Expansion/README.md) | `广度优先搜索`,`字符串`,`回溯` | 中等 | 第 2 场双周赛 | +| 1088 | [易混淆数 II](/solution/1000-1099/1088.Confusing%20Number%20II/README.md) | `数学`,`回溯` | 困难 | 第 2 场双周赛 | +| 1089 | [复写零](/solution/1000-1099/1089.Duplicate%20Zeros/README.md) | `数组`,`双指针` | 简单 | 第 141 场周赛 | +| 1090 | [受标签影响的最大值](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README.md) | `贪心`,`数组`,`哈希表`,`计数`,`排序` | 中等 | 第 141 场周赛 | +| 1091 | [二进制矩阵中的最短路径](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 第 141 场周赛 | +| 1092 | [最短公共超序列](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README.md) | `字符串`,`动态规划` | 困难 | 第 141 场周赛 | +| 1093 | [大样本统计](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README.md) | `数组`,`数学`,`概率与统计` | 中等 | 第 142 场周赛 | +| 1094 | [拼车](/solution/1000-1099/1094.Car%20Pooling/README.md) | `数组`,`前缀和`,`排序`,`模拟`,`堆（优先队列）` | 中等 | 第 142 场周赛 | +| 1095 | [山脉数组中查找目标值](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README.md) | `数组`,`二分查找`,`交互` | 困难 | 第 142 场周赛 | +| 1096 | [花括号展开 II](/solution/1000-1099/1096.Brace%20Expansion%20II/README.md) | `栈`,`广度优先搜索`,`字符串`,`回溯` | 困难 | 第 142 场周赛 | +| 1097 | [游戏玩法分析 V](/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README.md) | `数据库` | 困难 | 🔒 | +| 1098 | [小众书籍](/solution/1000-1099/1098.Unpopular%20Books/README.md) | `数据库` | 中等 | 🔒 | +| 1099 | [小于 K 的两数之和](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 简单 | 第 3 场双周赛 | +| 1100 | [长度为 K 的无重复字符子串](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 第 3 场双周赛 | +| 1101 | [彼此熟识的最早时间](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md) | `并查集`,`数组`,`排序` | 中等 | 第 3 场双周赛 | +| 1102 | [得分最高的路径](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`二分查找`,`矩阵`,`堆（优先队列）` | 中等 | 第 3 场双周赛 | +| 1103 | [分糖果 II](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README.md) | `数学`,`模拟` | 简单 | 第 143 场周赛 | +| 1104 | [二叉树寻路](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README.md) | `树`,`数学`,`二叉树` | 中等 | 第 143 场周赛 | +| 1105 | [填充书架](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README.md) | `数组`,`动态规划` | 中等 | 第 143 场周赛 | +| 1106 | [解析布尔表达式](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README.md) | `栈`,`递归`,`字符串` | 困难 | 第 143 场周赛 | +| 1107 | [每日新用户统计](/solution/1100-1199/1107.New%20Users%20Daily%20Count/README.md) | `数据库` | 中等 | 🔒 | +| 1108 | [IP 地址无效化](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README.md) | `字符串` | 简单 | 第 144 场周赛 | +| 1109 | [航班预订统计](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README.md) | `数组`,`前缀和` | 中等 | 第 144 场周赛 | +| 1110 | [删点成林](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README.md) | `树`,`深度优先搜索`,`数组`,`哈希表`,`二叉树` | 中等 | 第 144 场周赛 | +| 1111 | [有效括号的嵌套深度](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README.md) | `栈`,`字符串` | 中等 | 第 144 场周赛 | +| 1112 | [每位学生的最高成绩](/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README.md) | `数据库` | 中等 | 🔒 | +| 1113 | [报告的记录](/solution/1100-1199/1113.Reported%20Posts/README.md) | `数据库` | 简单 | 🔒 | +| 1114 | [按序打印](/solution/1100-1199/1114.Print%20in%20Order/README.md) | `多线程` | 简单 | | +| 1115 | [交替打印 FooBar](/solution/1100-1199/1115.Print%20FooBar%20Alternately/README.md) | `多线程` | 中等 | | +| 1116 | [打印零与奇偶数](/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README.md) | `多线程` | 中等 | | +| 1117 | [H2O 生成](/solution/1100-1199/1117.Building%20H2O/README.md) | `多线程` | 中等 | | +| 1118 | [一月有多少天](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md) | `数学` | 简单 | 第 4 场双周赛 | +| 1119 | [删去字符串中的元音](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md) | `字符串` | 简单 | 第 4 场双周赛 | +| 1120 | [子树的最大平均值](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 4 场双周赛 | +| 1121 | [将数组分成几个递增序列](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README.md) | `数组`,`计数` | 困难 | 第 4 场双周赛 | +| 1122 | [数组的相对排序](/solution/1100-1199/1122.Relative%20Sort%20Array/README.md) | `数组`,`哈希表`,`计数排序`,`排序` | 简单 | 第 145 场周赛 | +| 1123 | [最深叶节点的最近公共祖先](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 第 145 场周赛 | +| 1124 | [表现良好的最长时间段](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README.md) | `栈`,`数组`,`哈希表`,`前缀和`,`单调栈` | 中等 | 第 145 场周赛 | +| 1125 | [最小的必要团队](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 145 场周赛 | +| 1126 | [查询活跃业务](/solution/1100-1199/1126.Active%20Businesses/README.md) | `数据库` | 中等 | 🔒 | +| 1127 | [用户购买平台](/solution/1100-1199/1127.User%20Purchase%20Platform/README.md) | `数据库` | 困难 | 🔒 | +| 1128 | [等价多米诺骨牌对的数量](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 146 场周赛 | +| 1129 | [颜色交替的最短路径](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README.md) | `广度优先搜索`,`图` | 中等 | 第 146 场周赛 | +| 1130 | [叶值的最小代价生成树](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README.md) | `栈`,`贪心`,`数组`,`动态规划`,`单调栈` | 中等 | 第 146 场周赛 | +| 1131 | [绝对值表达式的最大值](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md) | `数组`,`数学` | 中等 | 第 146 场周赛 | +| 1132 | [报告的记录 II](/solution/1100-1199/1132.Reported%20Posts%20II/README.md) | `数据库` | 中等 | 🔒 | +| 1133 | [最大唯一数](/solution/1100-1199/1133.Largest%20Unique%20Number/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 5 场双周赛 | +| 1134 | [阿姆斯特朗数](/solution/1100-1199/1134.Armstrong%20Number/README.md) | `数学` | 简单 | 第 5 场双周赛 | +| 1135 | [最低成本连通所有城市](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md) | `并查集`,`图`,`最小生成树`,`堆（优先队列）` | 中等 | 第 5 场双周赛 | +| 1136 | [并行课程](/solution/1100-1199/1136.Parallel%20Courses/README.md) | `图`,`拓扑排序` | 中等 | 第 5 场双周赛 | +| 1137 | [第 N 个泰波那契数](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md) | `记忆化搜索`,`数学`,`动态规划` | 简单 | 第 147 场周赛 | +| 1138 | [字母板上的路径](/solution/1100-1199/1138.Alphabet%20Board%20Path/README.md) | `哈希表`,`字符串` | 中等 | 第 147 场周赛 | +| 1139 | [最大的以 1 为边界的正方形](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 147 场周赛 | +| 1140 | [石子游戏 II](/solution/1100-1199/1140.Stone%20Game%20II/README.md) | `数组`,`数学`,`动态规划`,`博弈`,`前缀和` | 中等 | 第 147 场周赛 | +| 1141 | [查询近 30 天活跃用户数](/solution/1100-1199/1141.User%20Activity%20for%20the%20Past%2030%20Days%20I/README.md) | `数据库` | 简单 | | +| 1142 | [过去 30 天的用户活动 II](/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README.md) | `数据库` | 简单 | 🔒 | +| 1143 | [最长公共子序列](/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md) | `字符串`,`动态规划` | 中等 | | +| 1144 | [递减元素使数组呈锯齿状](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README.md) | `贪心`,`数组` | 中等 | 第 148 场周赛 | +| 1145 | [二叉树着色游戏](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 148 场周赛 | +| 1146 | [快照数组](/solution/1100-1199/1146.Snapshot%20Array/README.md) | `设计`,`数组`,`哈希表`,`二分查找` | 中等 | 第 148 场周赛 | +| 1147 | [段式回文](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README.md) | `贪心`,`双指针`,`字符串`,`动态规划`,`哈希函数`,`滚动哈希` | 困难 | 第 148 场周赛 | +| 1148 | [文章浏览 I](/solution/1100-1199/1148.Article%20Views%20I/README.md) | `数据库` | 简单 | | +| 1149 | [文章浏览 II](/solution/1100-1199/1149.Article%20Views%20II/README.md) | `数据库` | 中等 | 🔒 | +| 1150 | [检查一个数是否在数组中占绝大多数](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md) | `数组`,`二分查找` | 简单 | 第 6 场双周赛 | +| 1151 | [最少交换次数来组合所有的 1](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md) | `数组`,`滑动窗口` | 中等 | 第 6 场双周赛 | +| 1152 | [用户网站访问行为分析](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md) | `数组`,`哈希表`,`排序` | 中等 | 第 6 场双周赛 | +| 1153 | [字符串转化](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README.md) | `哈希表`,`字符串` | 困难 | 第 6 场双周赛 | +| 1154 | [一年中的第几天](/solution/1100-1199/1154.Day%20of%20the%20Year/README.md) | `数学`,`字符串` | 简单 | 第 149 场周赛 | +| 1155 | [掷骰子等于目标和的方法数](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md) | `动态规划` | 中等 | 第 149 场周赛 | +| 1156 | [单字符重复子串的最大长度](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 第 149 场周赛 | +| 1157 | [子数组中占绝大多数的元素](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README.md) | `设计`,`树状数组`,`线段树`,`数组`,`二分查找` | 困难 | 第 149 场周赛 | +| 1158 | [市场分析 I](/solution/1100-1199/1158.Market%20Analysis%20I/README.md) | `数据库` | 中等 | | +| 1159 | [市场分析 II](/solution/1100-1199/1159.Market%20Analysis%20II/README.md) | `数据库` | 困难 | 🔒 | +| 1160 | [拼写单词](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 150 场周赛 | +| 1161 | [最大层内元素和](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 150 场周赛 | +| 1162 | [地图分析](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README.md) | `广度优先搜索`,`数组`,`动态规划`,`矩阵` | 中等 | 第 150 场周赛 | +| 1163 | [按字典序排在最后的子串](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README.md) | `双指针`,`字符串` | 困难 | 第 150 场周赛 | +| 1164 | [指定日期的产品价格](/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README.md) | `数据库` | 中等 | | +| 1165 | [单行键盘](/solution/1100-1199/1165.Single-Row%20Keyboard/README.md) | `哈希表`,`字符串` | 简单 | 第 7 场双周赛 | +| 1166 | [设计文件系统](/solution/1100-1199/1166.Design%20File%20System/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | 第 7 场双周赛 | +| 1167 | [连接木棍的最低费用](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 7 场双周赛 | +| 1168 | [水资源分配优化](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md) | `并查集`,`图`,`最小生成树`,`堆（优先队列）` | 困难 | 第 7 场双周赛 | +| 1169 | [查询无效交易](/solution/1100-1199/1169.Invalid%20Transactions/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 151 场周赛 | +| 1170 | [比较字符串最小字母出现频次](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README.md) | `数组`,`哈希表`,`字符串`,`二分查找`,`排序` | 中等 | 第 151 场周赛 | +| 1171 | [从链表中删去总和值为零的连续节点](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README.md) | `哈希表`,`链表` | 中等 | 第 151 场周赛 | +| 1172 | [餐盘栈](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README.md) | `栈`,`设计`,`哈希表`,`堆（优先队列）` | 困难 | 第 151 场周赛 | +| 1173 | [即时食物配送 I](/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README.md) | `数据库` | 简单 | 🔒 | +| 1174 | [即时食物配送 II](/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README.md) | `数据库` | 中等 | | +| 1175 | [质数排列](/solution/1100-1199/1175.Prime%20Arrangements/README.md) | `数学` | 简单 | 第 152 场周赛 | +| 1176 | [健身计划评估](/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md) | `数组`,`滑动窗口` | 简单 | 第 152 场周赛 | +| 1177 | [构建回文串检测](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README.md) | `位运算`,`数组`,`哈希表`,`字符串`,`前缀和` | 中等 | 第 152 场周赛 | +| 1178 | [猜字谜](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README.md) | `位运算`,`字典树`,`数组`,`哈希表`,`字符串` | 困难 | 第 152 场周赛 | +| 1179 | [重新格式化部门表](/solution/1100-1199/1179.Reformat%20Department%20Table/README.md) | `数据库` | 简单 | | +| 1180 | [统计只含单一字母的子串](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md) | `数学`,`字符串` | 简单 | 第 8 场双周赛 | +| 1181 | [前后拼接](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 8 场双周赛 | +| 1182 | [与目标颜色间的最短距离](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md) | `数组`,`二分查找`,`动态规划` | 中等 | 第 8 场双周赛 | +| 1183 | [矩阵中 1 的最大数量](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md) | `贪心`,`堆（优先队列）` | 困难 | 第 8 场双周赛 | +| 1184 | [公交站间的距离](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README.md) | `数组` | 简单 | 第 153 场周赛 | +| 1185 | [一周中的第几天](/solution/1100-1199/1185.Day%20of%20the%20Week/README.md) | `数学` | 简单 | 第 153 场周赛 | +| 1186 | [删除一次得到子数组最大和](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README.md) | `数组`,`动态规划` | 中等 | 第 153 场周赛 | +| 1187 | [使数组严格递增](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README.md) | `数组`,`二分查找`,`动态规划`,`排序` | 困难 | 第 153 场周赛 | +| 1188 | [设计有限阻塞队列](/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README.md) | `多线程` | 中等 | 🔒 | +| 1189 | [“气球” 的最大数量](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 154 场周赛 | +| 1190 | [反转每对括号间的子串](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README.md) | `栈`,`字符串` | 中等 | 第 154 场周赛 | +| 1191 | [K 次串联后最大子数组之和](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README.md) | `数组`,`动态规划` | 中等 | 第 154 场周赛 | +| 1192 | [查找集群内的关键连接](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README.md) | `深度优先搜索`,`图`,`双连通分量` | 困难 | 第 154 场周赛 | +| 1193 | [每月交易 I](/solution/1100-1199/1193.Monthly%20Transactions%20I/README.md) | `数据库` | 中等 | | +| 1194 | [锦标赛优胜者](/solution/1100-1199/1194.Tournament%20Winners/README.md) | `数据库` | 困难 | 🔒 | +| 1195 | [交替打印字符串](/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README.md) | `多线程` | 中等 | | +| 1196 | [最多可以买到的苹果数量](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 9 场双周赛 | +| 1197 | [进击的骑士](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md) | `广度优先搜索` | 中等 | 第 9 场双周赛 | +| 1198 | [找出所有行中最小公共元素](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md) | `数组`,`哈希表`,`二分查找`,`计数`,`矩阵` | 中等 | 第 9 场双周赛 | +| 1199 | [建造街区的最短时间](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README.md) | `贪心`,`数组`,`数学`,`堆（优先队列）` | 困难 | 第 9 场双周赛 | +| 1200 | [最小绝对差](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README.md) | `数组`,`排序` | 简单 | 第 155 场周赛 | +| 1201 | [丑数 III](/solution/1200-1299/1201.Ugly%20Number%20III/README.md) | `数学`,`二分查找`,`组合数学`,`数论` | 中等 | 第 155 场周赛 | +| 1202 | [交换字符串中的元素](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 155 场周赛 | +| 1203 | [项目管理](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 困难 | 第 155 场周赛 | +| 1204 | [最后一个能进入巴士的人](/solution/1200-1299/1204.Last%20Person%20to%20Fit%20in%20the%20Bus/README.md) | `数据库` | 中等 | | +| 1205 | [每月交易 II](/solution/1200-1299/1205.Monthly%20Transactions%20II/README.md) | `数据库` | 中等 | 🔒 | +| 1206 | [设计跳表](/solution/1200-1299/1206.Design%20Skiplist/README.md) | `设计`,`链表` | 困难 | | +| 1207 | [独一无二的出现次数](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README.md) | `数组`,`哈希表` | 简单 | 第 156 场周赛 | +| 1208 | [尽可能使字符串相等](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README.md) | `字符串`,`二分查找`,`前缀和`,`滑动窗口` | 中等 | 第 156 场周赛 | +| 1209 | [删除字符串中的所有相邻重复项 II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README.md) | `栈`,`字符串` | 中等 | 第 156 场周赛 | +| 1210 | [穿过迷宫的最少移动次数](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README.md) | `广度优先搜索`,`数组`,`矩阵` | 困难 | 第 156 场周赛 | +| 1211 | [查询结果的质量和占比](/solution/1200-1299/1211.Queries%20Quality%20and%20Percentage/README.md) | `数据库` | 简单 | | +| 1212 | [查询球队积分](/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README.md) | `数据库` | 中等 | 🔒 | +| 1213 | [三个有序数组的交集](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md) | `数组`,`哈希表`,`二分查找`,`计数` | 简单 | 第 10 场双周赛 | +| 1214 | [查找两棵二叉搜索树之和](/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md) | `栈`,`树`,`深度优先搜索`,`二叉搜索树`,`双指针`,`二分查找`,`二叉树` | 中等 | 第 10 场双周赛 | +| 1215 | [步进数](/solution/1200-1299/1215.Stepping%20Numbers/README.md) | `广度优先搜索`,`回溯` | 中等 | 第 10 场双周赛 | +| 1216 | [验证回文串 III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README.md) | `字符串`,`动态规划` | 困难 | 第 10 场双周赛 | +| 1217 | [玩筹码](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README.md) | `贪心`,`数组`,`数学` | 简单 | 第 157 场周赛 | +| 1218 | [最长定差子序列](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README.md) | `数组`,`哈希表`,`动态规划` | 中等 | 第 157 场周赛 | +| 1219 | [黄金矿工](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md) | `数组`,`回溯`,`矩阵` | 中等 | 第 157 场周赛 | +| 1220 | [统计元音字母序列的数目](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README.md) | `动态规划` | 困难 | 第 157 场周赛 | +| 1221 | [分割平衡字符串](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README.md) | `贪心`,`字符串`,`计数` | 简单 | 第 158 场周赛 | +| 1222 | [可以攻击国王的皇后](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 158 场周赛 | +| 1223 | [掷骰子模拟](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README.md) | `数组`,`动态规划` | 困难 | 第 158 场周赛 | +| 1224 | [最大相等频率](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README.md) | `数组`,`哈希表` | 困难 | 第 158 场周赛 | +| 1225 | [报告系统状态的连续日期](/solution/1200-1299/1225.Report%20Contiguous%20Dates/README.md) | `数据库` | 困难 | 🔒 | +| 1226 | [哲学家进餐](/solution/1200-1299/1226.The%20Dining%20Philosophers/README.md) | `多线程` | 中等 | | +| 1227 | [飞机座位分配概率](/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README.md) | `脑筋急转弯`,`数学`,`动态规划`,`概率与统计` | 中等 | | +| 1228 | [等差数列中缺失的数字](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md) | `数组`,`数学` | 简单 | 第 11 场双周赛 | +| 1229 | [安排会议日程](/solution/1200-1299/1229.Meeting%20Scheduler/README.md) | `数组`,`双指针`,`排序` | 中等 | 第 11 场双周赛 | +| 1230 | [抛掷硬币](/solution/1200-1299/1230.Toss%20Strange%20Coins/README.md) | `数组`,`数学`,`动态规划`,`概率与统计` | 中等 | 第 11 场双周赛 | +| 1231 | [分享巧克力](/solution/1200-1299/1231.Divide%20Chocolate/README.md) | `数组`,`二分查找` | 困难 | 第 11 场双周赛 | +| 1232 | [缀点成线](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README.md) | `几何`,`数组`,`数学` | 简单 | 第 159 场周赛 | +| 1233 | [删除子文件夹](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README.md) | `深度优先搜索`,`字典树`,`数组`,`字符串` | 中等 | 第 159 场周赛 | +| 1234 | [替换子串得到平衡字符串](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README.md) | `字符串`,`滑动窗口` | 中等 | 第 159 场周赛 | +| 1235 | [规划兼职工作](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md) | `数组`,`二分查找`,`动态规划`,`排序` | 困难 | 第 159 场周赛 | +| 1236 | [网络爬虫](/solution/1200-1299/1236.Web%20Crawler/README.md) | `深度优先搜索`,`广度优先搜索`,`字符串`,`交互` | 中等 | 🔒 | +| 1237 | [找出给定方程的正整数解](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README.md) | `数学`,`双指针`,`二分查找`,`交互` | 中等 | 第 160 场周赛 | +| 1238 | [循环码排列](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README.md) | `位运算`,`数学`,`回溯` | 中等 | 第 160 场周赛 | +| 1239 | [串联字符串的最大长度](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README.md) | `位运算`,`数组`,`字符串`,`回溯` | 中等 | 第 160 场周赛 | +| 1240 | [铺瓷砖](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README.md) | `回溯` | 困难 | 第 160 场周赛 | +| 1241 | [每个帖子的评论数](/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README.md) | `数据库` | 简单 | 🔒 | +| 1242 | [多线程网页爬虫](/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README.md) | `深度优先搜索`,`广度优先搜索`,`多线程` | 中等 | 🔒 | +| 1243 | [数组变换](/solution/1200-1299/1243.Array%20Transformation/README.md) | `数组`,`模拟` | 简单 | 第 12 场双周赛 | +| 1244 | [力扣排行榜](/solution/1200-1299/1244.Design%20A%20Leaderboard/README.md) | `设计`,`哈希表`,`排序` | 中等 | 第 12 场双周赛 | +| 1245 | [树的直径](/solution/1200-1299/1245.Tree%20Diameter/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | 第 12 场双周赛 | +| 1246 | [删除回文子数组](/solution/1200-1299/1246.Palindrome%20Removal/README.md) | `数组`,`动态规划` | 困难 | 第 12 场双周赛 | +| 1247 | [交换字符使得字符串相同](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README.md) | `贪心`,`数学`,`字符串` | 中等 | 第 161 场周赛 | +| 1248 | [统计「优美子数组」](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README.md) | `数组`,`哈希表`,`数学`,`滑动窗口` | 中等 | 第 161 场周赛 | +| 1249 | [移除无效的括号](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md) | `栈`,`字符串` | 中等 | 第 161 场周赛 | +| 1250 | [检查「好数组」](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README.md) | `数组`,`数学`,`数论` | 困难 | 第 161 场周赛 | +| 1251 | [平均售价](/solution/1200-1299/1251.Average%20Selling%20Price/README.md) | `数据库` | 简单 | | +| 1252 | [奇数值单元格的数目](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README.md) | `数组`,`数学`,`模拟` | 简单 | 第 162 场周赛 | +| 1253 | [重构 2 行二进制矩阵](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README.md) | `贪心`,`数组`,`矩阵` | 中等 | 第 162 场周赛 | +| 1254 | [统计封闭岛屿的数目](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 162 场周赛 | +| 1255 | [得分最高的单词集合](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README.md) | `位运算`,`数组`,`字符串`,`动态规划`,`回溯`,`状态压缩` | 困难 | 第 162 场周赛 | +| 1256 | [加密数字](/solution/1200-1299/1256.Encode%20Number/README.md) | `位运算`,`数学`,`字符串` | 中等 | 第 13 场双周赛 | +| 1257 | [最小公共区域](/solution/1200-1299/1257.Smallest%20Common%20Region/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组`,`哈希表`,`字符串` | 中等 | 第 13 场双周赛 | +| 1258 | [近义词句子](/solution/1200-1299/1258.Synonymous%20Sentences/README.md) | `并查集`,`数组`,`哈希表`,`字符串`,`回溯` | 中等 | 第 13 场双周赛 | +| 1259 | [不相交的握手](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md) | `数学`,`动态规划` | 困难 | 第 13 场双周赛 | +| 1260 | [二维网格迁移](/solution/1200-1299/1260.Shift%202D%20Grid/README.md) | `数组`,`矩阵`,`模拟` | 简单 | 第 163 场周赛 | +| 1261 | [在受污染的二叉树中查找元素](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`哈希表`,`二叉树` | 中等 | 第 163 场周赛 | +| 1262 | [可被三整除的最大和](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README.md) | `贪心`,`数组`,`动态规划`,`排序` | 中等 | 第 163 场周赛 | +| 1263 | [推箱子](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README.md) | `广度优先搜索`,`数组`,`矩阵`,`堆（优先队列）` | 困难 | 第 163 场周赛 | +| 1264 | [页面推荐](/solution/1200-1299/1264.Page%20Recommendations/README.md) | `数据库` | 中等 | 🔒 | +| 1265 | [逆序打印不可变链表](/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README.md) | `栈`,`递归`,`链表`,`双指针` | 中等 | 🔒 | +| 1266 | [访问所有点的最小时间](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README.md) | `几何`,`数组`,`数学` | 简单 | 第 164 场周赛 | +| 1267 | [统计参与通信的服务器](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`计数`,`矩阵` | 中等 | 第 164 场周赛 | +| 1268 | [搜索推荐系统](/solution/1200-1299/1268.Search%20Suggestions%20System/README.md) | `字典树`,`数组`,`字符串`,`二分查找`,`排序`,`堆（优先队列）` | 中等 | 第 164 场周赛 | +| 1269 | [停在原地的方案数](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README.md) | `动态规划` | 困难 | 第 164 场周赛 | +| 1270 | [向公司 CEO 汇报工作的所有人](/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README.md) | `数据库` | 中等 | 🔒 | +| 1271 | [十六进制魔术数字](/solution/1200-1299/1271.Hexspeak/README.md) | `数学`,`字符串` | 简单 | 第 14 场双周赛 | +| 1272 | [删除区间](/solution/1200-1299/1272.Remove%20Interval/README.md) | `数组` | 中等 | 第 14 场双周赛 | +| 1273 | [删除树节点](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组` | 中等 | 第 14 场双周赛 | +| 1274 | [矩形内船只的数目](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md) | `数组`,`分治`,`交互` | 困难 | 第 14 场双周赛 | +| 1275 | [找出井字棋的获胜者](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README.md) | `数组`,`哈希表`,`矩阵`,`模拟` | 简单 | 第 165 场周赛 | +| 1276 | [不浪费原料的汉堡制作方案](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README.md) | `数学` | 中等 | 第 165 场周赛 | +| 1277 | [统计全为 1 的正方形子矩阵](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 165 场周赛 | +| 1278 | [分割回文串 III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README.md) | `字符串`,`动态规划` | 困难 | 第 165 场周赛 | +| 1279 | [红绿灯路口](/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README.md) | `多线程` | 简单 | 🔒 | +| 1280 | [学生们参加各科测试的次数](/solution/1200-1299/1280.Students%20and%20Examinations/README.md) | `数据库` | 简单 | | +| 1281 | [整数的各位积和之差](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README.md) | `数学` | 简单 | 第 166 场周赛 | +| 1282 | [用户分组](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README.md) | `数组`,`哈希表` | 中等 | 第 166 场周赛 | +| 1283 | [使结果不超过阈值的最小除数](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README.md) | `数组`,`二分查找` | 中等 | 第 166 场周赛 | +| 1284 | [转化为全零矩阵的最少反转次数](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README.md) | `位运算`,`广度优先搜索`,`数组`,`哈希表`,`矩阵` | 困难 | 第 166 场周赛 | +| 1285 | [找到连续区间的开始和结束数字](/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README.md) | `数据库` | 中等 | 🔒 | +| 1286 | [字母组合迭代器](/solution/1200-1299/1286.Iterator%20for%20Combination/README.md) | `设计`,`字符串`,`回溯`,`迭代器` | 中等 | 第 15 场双周赛 | +| 1287 | [有序数组中出现次数超过 25%的元素](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README.md) | `数组` | 简单 | 第 15 场双周赛 | +| 1288 | [删除被覆盖区间](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README.md) | `数组`,`排序` | 中等 | 第 15 场双周赛 | +| 1289 | [下降路径最小和 II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 15 场双周赛 | +| 1290 | [二进制链表转整数](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README.md) | `链表`,`数学` | 简单 | 第 167 场周赛 | +| 1291 | [顺次数](/solution/1200-1299/1291.Sequential%20Digits/README.md) | `枚举` | 中等 | 第 167 场周赛 | +| 1292 | [元素和小于等于阈值的正方形的最大边长](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README.md) | `数组`,`二分查找`,`矩阵`,`前缀和` | 中等 | 第 167 场周赛 | +| 1293 | [网格中的最短路径](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md) | `广度优先搜索`,`数组`,`矩阵` | 困难 | 第 167 场周赛 | +| 1294 | [不同国家的天气类型](/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README.md) | `数据库` | 简单 | 🔒 | +| 1295 | [统计位数为偶数的数字](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README.md) | `数组` | 简单 | 第 168 场周赛 | +| 1296 | [划分数组为连续数字的集合](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README.md) | `贪心`,`数组`,`哈希表`,`排序` | 中等 | 第 168 场周赛 | +| 1297 | [子串的最大出现次数](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 第 168 场周赛 | +| 1298 | [你能从盒子里获得的最大糖果数](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README.md) | `广度优先搜索`,`图`,`数组` | 困难 | 第 168 场周赛 | +| 1299 | [将每个元素替换为右侧最大元素](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README.md) | `数组` | 简单 | 第 16 场双周赛 | +| 1300 | [转变数组后最接近目标值的数组和](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README.md) | `数组`,`二分查找`,`排序` | 中等 | 第 16 场双周赛 | +| 1301 | [最大得分的路径数目](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 16 场双周赛 | +| 1302 | [层数最深叶子节点的和](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 16 场双周赛 | +| 1303 | [求团队人数](/solution/1300-1399/1303.Find%20the%20Team%20Size/README.md) | `数据库` | 简单 | 🔒 | +| 1304 | [和为零的 N 个不同整数](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README.md) | `数组`,`数学` | 简单 | 第 169 场周赛 | +| 1305 | [两棵二叉搜索树中的所有元素](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`二叉树`,`排序` | 中等 | 第 169 场周赛 | +| 1306 | [跳跃游戏 III](/solution/1300-1399/1306.Jump%20Game%20III/README.md) | `深度优先搜索`,`广度优先搜索`,`数组` | 中等 | 第 169 场周赛 | +| 1307 | [口算难题](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README.md) | `数组`,`数学`,`字符串`,`回溯` | 困难 | 第 169 场周赛 | +| 1308 | [不同性别每日分数总计](/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README.md) | `数据库` | 中等 | 🔒 | +| 1309 | [解码字母到整数映射](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README.md) | `字符串` | 简单 | 第 170 场周赛 | +| 1310 | [子数组异或查询](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README.md) | `位运算`,`数组`,`前缀和` | 中等 | 第 170 场周赛 | +| 1311 | [获取你好友已观看的视频](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README.md) | `广度优先搜索`,`图`,`数组`,`哈希表`,`排序` | 中等 | 第 170 场周赛 | +| 1312 | [让字符串成为回文串的最少插入次数](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md) | `字符串`,`动态规划` | 困难 | 第 170 场周赛 | +| 1313 | [解压缩编码列表](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README.md) | `数组` | 简单 | 第 17 场双周赛 | +| 1314 | [矩阵区域和](/solution/1300-1399/1314.Matrix%20Block%20Sum/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 17 场双周赛 | +| 1315 | [祖父节点值为偶数的节点和](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 17 场双周赛 | +| 1316 | [不同的循环子字符串](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README.md) | `字典树`,`字符串`,`哈希函数`,`滚动哈希` | 困难 | 第 17 场双周赛 | +| 1317 | [将整数转换为两个无零整数的和](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README.md) | `数学` | 简单 | 第 171 场周赛 | +| 1318 | [或运算的最小翻转次数](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README.md) | `位运算` | 中等 | 第 171 场周赛 | +| 1319 | [连通网络的操作次数](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 第 171 场周赛 | +| 1320 | [二指输入的的最小距离](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README.md) | `字符串`,`动态规划` | 困难 | 第 171 场周赛 | +| 1321 | [餐馆营业额变化增长](/solution/1300-1399/1321.Restaurant%20Growth/README.md) | `数据库` | 中等 | | +| 1322 | [广告效果](/solution/1300-1399/1322.Ads%20Performance/README.md) | `数据库` | 简单 | 🔒 | +| 1323 | [6 和 9 组成的最大数字](/solution/1300-1399/1323.Maximum%2069%20Number/README.md) | `贪心`,`数学` | 简单 | 第 172 场周赛 | +| 1324 | [竖直打印单词](/solution/1300-1399/1324.Print%20Words%20Vertically/README.md) | `数组`,`字符串`,`模拟` | 中等 | 第 172 场周赛 | +| 1325 | [删除给定值的叶子节点](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 172 场周赛 | +| 1326 | [灌溉花园的最少水龙头数目](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md) | `贪心`,`数组`,`动态规划` | 困难 | 第 172 场周赛 | +| 1327 | [列出指定时间段内所有的下单产品](/solution/1300-1399/1327.List%20the%20Products%20Ordered%20in%20a%20Period/README.md) | `数据库` | 简单 | | +| 1328 | [破坏回文串](/solution/1300-1399/1328.Break%20a%20Palindrome/README.md) | `贪心`,`字符串` | 中等 | 第 18 场双周赛 | +| 1329 | [将矩阵按对角线排序](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README.md) | `数组`,`矩阵`,`排序` | 中等 | 第 18 场双周赛 | +| 1330 | [翻转子数组得到最大的数组值](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md) | `贪心`,`数组`,`数学` | 困难 | 第 18 场双周赛 | +| 1331 | [数组序号转换](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 18 场双周赛 | +| 1332 | [删除回文子序列](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README.md) | `双指针`,`字符串` | 简单 | 第 173 场周赛 | +| 1333 | [餐厅过滤器](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README.md) | `数组`,`排序` | 中等 | 第 173 场周赛 | +| 1334 | [阈值距离内邻居最少的城市](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README.md) | `图`,`动态规划`,`最短路` | 中等 | 第 173 场周赛 | +| 1335 | [工作计划的最低难度](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README.md) | `数组`,`动态规划` | 困难 | 第 173 场周赛 | +| 1336 | [每次访问的交易次数](/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README.md) | `数据库` | 困难 | 🔒 | +| 1337 | [矩阵中战斗力最弱的 K 行](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README.md) | `数组`,`二分查找`,`矩阵`,`排序`,`堆（优先队列）` | 简单 | 第 174 场周赛 | +| 1338 | [数组大小减半](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README.md) | `贪心`,`数组`,`哈希表`,`排序`,`堆（优先队列）` | 中等 | 第 174 场周赛 | +| 1339 | [分裂二叉树的最大乘积](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 174 场周赛 | +| 1340 | [跳跃游戏 V](/solution/1300-1399/1340.Jump%20Game%20V/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 174 场周赛 | +| 1341 | [电影评分](/solution/1300-1399/1341.Movie%20Rating/README.md) | `数据库` | 中等 | | +| 1342 | [将数字变成 0 的操作次数](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README.md) | `位运算`,`数学` | 简单 | 第 19 场双周赛 | +| 1343 | [大小为 K 且平均值大于等于阈值的子数组数目](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README.md) | `数组`,`滑动窗口` | 中等 | 第 19 场双周赛 | +| 1344 | [时钟指针的夹角](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README.md) | `数学` | 中等 | 第 19 场双周赛 | +| 1345 | [跳跃游戏 IV](/solution/1300-1399/1345.Jump%20Game%20IV/README.md) | `广度优先搜索`,`数组`,`哈希表` | 困难 | 第 19 场双周赛 | +| 1346 | [检查整数及其两倍数是否存在](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`排序` | 简单 | 第 175 场周赛 | +| 1347 | [制造字母异位词的最小步骤数](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 175 场周赛 | +| 1348 | [推文计数](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README.md) | `设计`,`哈希表`,`二分查找`,`有序集合`,`排序` | 中等 | 第 175 场周赛 | +| 1349 | [参加考试的最大学生数](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩`,`矩阵` | 困难 | 第 175 场周赛 | +| 1350 | [院系无效的学生](/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README.md) | `数据库` | 简单 | 🔒 | +| 1351 | [统计有序矩阵中的负数](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README.md) | `数组`,`二分查找`,`矩阵` | 简单 | 第 176 场周赛 | +| 1352 | [最后 K 个数的乘积](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README.md) | `设计`,`队列`,`数组`,`数学`,`数据流` | 中等 | 第 176 场周赛 | +| 1353 | [最多可以参加的会议数目](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 中等 | 第 176 场周赛 | +| 1354 | [多次求和构造目标数组](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README.md) | `数组`,`堆（优先队列）` | 困难 | 第 176 场周赛 | +| 1355 | [活动参与者](/solution/1300-1399/1355.Activity%20Participants/README.md) | `数据库` | 中等 | 🔒 | +| 1356 | [根据数字二进制下 1 的数目排序](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README.md) | `位运算`,`数组`,`计数`,`排序` | 简单 | 第 20 场双周赛 | +| 1357 | [每隔 n 个顾客打折](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README.md) | `设计`,`数组`,`哈希表` | 中等 | 第 20 场双周赛 | +| 1358 | [包含所有三种字符的子字符串数目](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 第 20 场双周赛 | +| 1359 | [有效的快递序列数目](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README.md) | `数学`,`动态规划`,`组合数学` | 困难 | 第 20 场双周赛 | +| 1360 | [日期之间隔几天](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README.md) | `数学`,`字符串` | 简单 | 第 177 场周赛 | +| 1361 | [验证二叉树](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`二叉树` | 中等 | 第 177 场周赛 | +| 1362 | [最接近的因数](/solution/1300-1399/1362.Closest%20Divisors/README.md) | `数学` | 中等 | 第 177 场周赛 | +| 1363 | [形成三的最大倍数](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README.md) | `贪心`,`数组`,`动态规划` | 困难 | 第 177 场周赛 | +| 1364 | [顾客的可信联系人数量](/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README.md) | `数据库` | 中等 | 🔒 | +| 1365 | [有多少小于当前数字的数字](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README.md) | `数组`,`哈希表`,`计数`,`排序` | 简单 | 第 178 场周赛 | +| 1366 | [通过投票对团队排名](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README.md) | `数组`,`哈希表`,`字符串`,`计数`,`排序` | 中等 | 第 178 场周赛 | +| 1367 | [二叉树中的链表](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`链表`,`二叉树` | 中等 | 第 178 场周赛 | +| 1368 | [使网格图至少有一条有效路径的最小代价](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md) | `广度优先搜索`,`图`,`数组`,`矩阵`,`最短路`,`堆（优先队列）` | 困难 | 第 178 场周赛 | +| 1369 | [获取最近第二次的活动](/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README.md) | `数据库` | 困难 | 🔒 | +| 1370 | [上升下降字符串](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 21 场双周赛 | +| 1371 | [每个元音包含偶数次的最长子字符串](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md) | `位运算`,`哈希表`,`字符串`,`前缀和` | 中等 | 第 21 场双周赛 | +| 1372 | [二叉树中的最长交错路径](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`动态规划`,`二叉树` | 中等 | 第 21 场双周赛 | +| 1373 | [二叉搜索子树的最大键值和](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`动态规划`,`二叉树` | 困难 | 第 21 场双周赛 | +| 1374 | [生成每种字符都是奇数个的字符串](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README.md) | `字符串` | 简单 | 第 179 场周赛 | +| 1375 | [二进制字符串前缀一致的次数](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README.md) | `数组` | 中等 | 第 179 场周赛 | +| 1376 | [通知所有员工所需的时间](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md) | `树`,`深度优先搜索`,`广度优先搜索` | 中等 | 第 179 场周赛 | +| 1377 | [T 秒后青蛙的位置](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`图` | 困难 | 第 179 场周赛 | +| 1378 | [使用唯一标识码替换员工 ID](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README.md) | `数据库` | 简单 | | +| 1379 | [找出克隆二叉树中的相同节点](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | | +| 1380 | [矩阵中的幸运数](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md) | `数组`,`矩阵` | 简单 | 第 180 场周赛 | +| 1381 | [设计一个支持增量操作的栈](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md) | `栈`,`设计`,`数组` | 中等 | 第 180 场周赛 | +| 1382 | [将二叉搜索树变平衡](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md) | `贪心`,`树`,`深度优先搜索`,`二叉搜索树`,`分治`,`二叉树` | 中等 | 第 180 场周赛 | +| 1383 | [最大的团队表现值](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 困难 | 第 180 场周赛 | +| 1384 | [按年度列出销售总额](/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README.md) | `数据库` | 困难 | 🔒 | +| 1385 | [两个数组间的距离值](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 简单 | 第 22 场双周赛 | +| 1386 | [安排电影院座位](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README.md) | `贪心`,`位运算`,`数组`,`哈希表` | 中等 | 第 22 场双周赛 | +| 1387 | [将整数按权重排序](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README.md) | `记忆化搜索`,`动态规划`,`排序` | 中等 | 第 22 场双周赛 | +| 1388 | [3n 块披萨](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README.md) | `贪心`,`数组`,`动态规划`,`堆（优先队列）` | 困难 | 第 22 场双周赛 | +| 1389 | [按既定顺序创建目标数组](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README.md) | `数组`,`模拟` | 简单 | 第 181 场周赛 | +| 1390 | [四因数](/solution/1300-1399/1390.Four%20Divisors/README.md) | `数组`,`数学` | 中等 | 第 181 场周赛 | +| 1391 | [检查网格中是否存在有效路径](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 181 场周赛 | +| 1392 | [最长快乐前缀](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README.md) | `字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 181 场周赛 | +| 1393 | [股票的资本损益](/solution/1300-1399/1393.Capital%20GainLoss/README.md) | `数据库` | 中等 | | +| 1394 | [找出数组中的幸运数](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 182 场周赛 | +| 1395 | [统计作战单位数](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README.md) | `树状数组`,`数组`,`动态规划` | 中等 | 第 182 场周赛 | +| 1396 | [设计地铁系统](/solution/1300-1399/1396.Design%20Underground%20System/README.md) | `设计`,`哈希表`,`字符串` | 中等 | 第 182 场周赛 | +| 1397 | [找到所有好字符串](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README.md) | `字符串`,`动态规划`,`字符串匹配` | 困难 | 第 182 场周赛 | +| 1398 | [购买了产品 A 和产品 B 却没有购买产品 C 的顾客](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README.md) | `数据库` | 中等 | 🔒 | +| 1399 | [统计最大组的数目](/solution/1300-1399/1399.Count%20Largest%20Group/README.md) | `哈希表`,`数学` | 简单 | 第 23 场双周赛 | +| 1400 | [构造 K 个回文字符串](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md) | `贪心`,`哈希表`,`字符串`,`计数` | 中等 | 第 23 场双周赛 | +| 1401 | [圆和矩形是否有重叠](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md) | `几何`,`数学` | 中等 | 第 23 场双周赛 | +| 1402 | [做菜顺序](/solution/1400-1499/1402.Reducing%20Dishes/README.md) | `贪心`,`数组`,`动态规划`,`排序` | 困难 | 第 23 场双周赛 | +| 1403 | [非递增顺序的最小子序列](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 183 场周赛 | +| 1404 | [将二进制表示减到 1 的步骤数](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md) | `位运算`,`字符串` | 中等 | 第 183 场周赛 | +| 1405 | [最长快乐字符串](/solution/1400-1499/1405.Longest%20Happy%20String/README.md) | `贪心`,`字符串`,`堆（优先队列）` | 中等 | 第 183 场周赛 | +| 1406 | [石子游戏 III](/solution/1400-1499/1406.Stone%20Game%20III/README.md) | `数组`,`数学`,`动态规划`,`博弈` | 困难 | 第 183 场周赛 | +| 1407 | [排名靠前的旅行者](/solution/1400-1499/1407.Top%20Travellers/README.md) | `数据库` | 简单 | | +| 1408 | [数组中的字符串匹配](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README.md) | `数组`,`字符串`,`字符串匹配` | 简单 | 第 184 场周赛 | +| 1409 | [查询带键的排列](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README.md) | `树状数组`,`数组`,`模拟` | 中等 | 第 184 场周赛 | +| 1410 | [HTML 实体解析器](/solution/1400-1499/1410.HTML%20Entity%20Parser/README.md) | `哈希表`,`字符串` | 中等 | 第 184 场周赛 | +| 1411 | [给 N x 3 网格图涂色的方案数](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README.md) | `动态规划` | 困难 | 第 184 场周赛 | +| 1412 | [查找成绩处于中游的学生](/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README.md) | `数据库` | 困难 | 🔒 | +| 1413 | [逐步求和得到正数的最小值](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README.md) | `数组`,`前缀和` | 简单 | 第 24 场双周赛 | +| 1414 | [和为 K 的最少斐波那契数字数目](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README.md) | `贪心`,`数学` | 中等 | 第 24 场双周赛 | +| 1415 | [长度为 n 的开心字符串中字典序第 k 小的字符串](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README.md) | `字符串`,`回溯` | 中等 | 第 24 场双周赛 | +| 1416 | [恢复数组](/solution/1400-1499/1416.Restore%20The%20Array/README.md) | `字符串`,`动态规划` | 困难 | 第 24 场双周赛 | +| 1417 | [重新格式化字符串](/solution/1400-1499/1417.Reformat%20The%20String/README.md) | `字符串` | 简单 | 第 185 场周赛 | +| 1418 | [点菜展示表](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README.md) | `数组`,`哈希表`,`字符串`,`有序集合`,`排序` | 中等 | 第 185 场周赛 | +| 1419 | [数青蛙](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README.md) | `字符串`,`计数` | 中等 | 第 185 场周赛 | +| 1420 | [生成数组](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README.md) | `动态规划`,`前缀和` | 困难 | 第 185 场周赛 | +| 1421 | [净现值查询](/solution/1400-1499/1421.NPV%20Queries/README.md) | `数据库` | 简单 | 🔒 | +| 1422 | [分割字符串的最大得分](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README.md) | `字符串`,`前缀和` | 简单 | 第 186 场周赛 | +| 1423 | [可获得的最大点数](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README.md) | `数组`,`前缀和`,`滑动窗口` | 中等 | 第 186 场周赛 | +| 1424 | [对角线遍历 II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README.md) | `数组`,`排序`,`堆（优先队列）` | 中等 | 第 186 场周赛 | +| 1425 | [带限制的子序列和](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md) | `队列`,`数组`,`动态规划`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 困难 | 第 186 场周赛 | +| 1426 | [数元素](/solution/1400-1499/1426.Counting%20Elements/README.md) | `数组`,`哈希表` | 简单 | 🔒 | +| 1427 | [字符串的左右移](/solution/1400-1499/1427.Perform%20String%20Shifts/README.md) | `数组`,`数学`,`字符串` | 简单 | 🔒 | +| 1428 | [至少有一个 1 的最左端列](/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README.md) | `数组`,`二分查找`,`交互`,`矩阵` | 中等 | 🔒 | +| 1429 | [第一个唯一数字](/solution/1400-1499/1429.First%20Unique%20Number/README.md) | `设计`,`队列`,`数组`,`哈希表`,`数据流` | 中等 | 🔒 | +| 1430 | [判断给定的序列是否是二叉树从根到叶的路径](/solution/1400-1499/1430.Check%20If%20a%20String%20Is%20a%20Valid%20Sequence%20from%20Root%20to%20Leaves%20Path%20in%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | +| 1431 | [拥有最多糖果的孩子](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README.md) | `数组` | 简单 | 第 25 场双周赛 | +| 1432 | [改变一个整数能得到的最大差值](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README.md) | `贪心`,`数学` | 中等 | 第 25 场双周赛 | +| 1433 | [检查一个字符串是否可以打破另一个字符串](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README.md) | `贪心`,`字符串`,`排序` | 中等 | 第 25 场双周赛 | +| 1434 | [每个人戴不同帽子的方案数](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 25 场双周赛 | +| 1435 | [制作会话柱状图](/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README.md) | `数据库` | 简单 | 🔒 | +| 1436 | [旅行终点站](/solution/1400-1499/1436.Destination%20City/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 187 场周赛 | +| 1437 | [是否所有 1 都至少相隔 k 个元素](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README.md) | `数组` | 简单 | 第 187 场周赛 | +| 1438 | [绝对差不超过限制的最长连续子数组](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README.md) | `队列`,`数组`,`有序集合`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 中等 | 第 187 场周赛 | +| 1439 | [有序矩阵中的第 k 个最小数组和](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README.md) | `数组`,`二分查找`,`矩阵`,`堆（优先队列）` | 困难 | 第 187 场周赛 | +| 1440 | [计算布尔表达式的值](/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README.md) | `数据库` | 中等 | 🔒 | +| 1441 | [用栈操作构建数组](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README.md) | `栈`,`数组`,`模拟` | 中等 | 第 188 场周赛 | +| 1442 | [形成两个异或相等数组的三元组数目](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README.md) | `位运算`,`数组`,`哈希表`,`数学`,`前缀和` | 中等 | 第 188 场周赛 | +| 1443 | [收集树上所有苹果的最少时间](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表` | 中等 | 第 188 场周赛 | +| 1444 | [切披萨的方案数](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md) | `记忆化搜索`,`数组`,`动态规划`,`矩阵` | 困难 | 第 188 场周赛 | +| 1445 | [苹果和桔子](/solution/1400-1499/1445.Apples%20%26%20Oranges/README.md) | `数据库` | 中等 | 🔒 | +| 1446 | [连续字符](/solution/1400-1499/1446.Consecutive%20Characters/README.md) | `字符串` | 简单 | 第 26 场双周赛 | +| 1447 | [最简分数](/solution/1400-1499/1447.Simplified%20Fractions/README.md) | `数学`,`字符串`,`数论` | 中等 | 第 26 场双周赛 | +| 1448 | [统计二叉树中好节点的数目](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 26 场双周赛 | +| 1449 | [数位成本和为目标值的最大数字](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README.md) | `数组`,`动态规划` | 困难 | 第 26 场双周赛 | +| 1450 | [在既定时间做作业的学生人数](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README.md) | `数组` | 简单 | 第 189 场周赛 | +| 1451 | [重新排列句子中的单词](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README.md) | `字符串`,`排序` | 中等 | 第 189 场周赛 | +| 1452 | [收藏清单](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 189 场周赛 | +| 1453 | [圆形靶内的最大飞镖数量](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README.md) | `几何`,`数组`,`数学` | 困难 | 第 189 场周赛 | +| 1454 | [活跃用户](/solution/1400-1499/1454.Active%20Users/README.md) | `数据库` | 中等 | 🔒 | +| 1455 | [检查单词是否为句中其他单词的前缀](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README.md) | `双指针`,`字符串`,`字符串匹配` | 简单 | 第 190 场周赛 | +| 1456 | [定长子串中元音的最大数目](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README.md) | `字符串`,`滑动窗口` | 中等 | 第 190 场周赛 | +| 1457 | [二叉树中的伪回文路径](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README.md) | `位运算`,`树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 190 场周赛 | +| 1458 | [两个子序列的最大点积](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README.md) | `数组`,`动态规划` | 困难 | 第 190 场周赛 | +| 1459 | [矩形面积](/solution/1400-1499/1459.Rectangles%20Area/README.md) | `数据库` | 中等 | 🔒 | +| 1460 | [通过翻转子数组使两个数组相等](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 27 场双周赛 | +| 1461 | [检查一个字符串是否包含所有长度为 K 的二进制子串](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README.md) | `位运算`,`哈希表`,`字符串`,`哈希函数`,`滚动哈希` | 中等 | 第 27 场双周赛 | +| 1462 | [课程表 IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | 第 27 场双周赛 | +| 1463 | [摘樱桃 II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 27 场双周赛 | +| 1464 | [数组中两元素的最大乘积](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README.md) | `数组`,`排序`,`堆（优先队列）` | 简单 | 第 191 场周赛 | +| 1465 | [切割后面积最大的蛋糕](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 191 场周赛 | +| 1466 | [重新规划路线](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README.md) | `深度优先搜索`,`广度优先搜索`,`图` | 中等 | 第 191 场周赛 | +| 1467 | [两个盒子中球的颜色数相同的概率](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README.md) | `数组`,`数学`,`动态规划`,`回溯`,`组合数学`,`概率与统计` | 困难 | 第 191 场周赛 | +| 1468 | [计算税后工资](/solution/1400-1499/1468.Calculate%20Salaries/README.md) | `数据库` | 中等 | 🔒 | +| 1469 | [寻找所有的独生节点](/solution/1400-1499/1469.Find%20All%20The%20Lonely%20Nodes/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 简单 | 🔒 | +| 1470 | [重新排列数组](/solution/1400-1499/1470.Shuffle%20the%20Array/README.md) | `数组` | 简单 | 第 192 场周赛 | +| 1471 | [数组中的 k 个最强值](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README.md) | `数组`,`双指针`,`排序` | 中等 | 第 192 场周赛 | +| 1472 | [设计浏览器历史记录](/solution/1400-1499/1472.Design%20Browser%20History/README.md) | `栈`,`设计`,`数组`,`链表`,`数据流`,`双向链表` | 中等 | 第 192 场周赛 | +| 1473 | [粉刷房子 III](/solution/1400-1499/1473.Paint%20House%20III/README.md) | `数组`,`动态规划` | 困难 | 第 192 场周赛 | +| 1474 | [删除链表 M 个节点之后的 N 个节点](/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README.md) | `链表` | 简单 | 🔒 | +| 1475 | [商品折扣后的最终价格](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README.md) | `栈`,`数组`,`单调栈` | 简单 | 第 28 场双周赛 | +| 1476 | [子矩形查询](/solution/1400-1499/1476.Subrectangle%20Queries/README.md) | `设计`,`数组`,`矩阵` | 中等 | 第 28 场双周赛 | +| 1477 | [找两个和为目标值且不重叠的子数组](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README.md) | `数组`,`哈希表`,`二分查找`,`动态规划`,`滑动窗口` | 中等 | 第 28 场双周赛 | +| 1478 | [安排邮筒](/solution/1400-1499/1478.Allocate%20Mailboxes/README.md) | `数组`,`数学`,`动态规划`,`排序` | 困难 | 第 28 场双周赛 | +| 1479 | [周内每天的销售情况](/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README.md) | `数据库` | 困难 | 🔒 | +| 1480 | [一维数组的动态和](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README.md) | `数组`,`前缀和` | 简单 | 第 193 场周赛 | +| 1481 | [不同整数的最少数目](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README.md) | `贪心`,`数组`,`哈希表`,`计数`,`排序` | 中等 | 第 193 场周赛 | +| 1482 | [制作 m 束花所需的最少天数](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README.md) | `数组`,`二分查找` | 中等 | 第 193 场周赛 | +| 1483 | [树节点的第 K 个祖先](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`二分查找`,`动态规划` | 困难 | 第 193 场周赛 | +| 1484 | [按日期分组销售产品](/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README.md) | `数据库` | 简单 | | +| 1485 | [克隆含随机指针的二叉树](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 | +| 1486 | [数组异或操作](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README.md) | `位运算`,`数学` | 简单 | 第 194 场周赛 | +| 1487 | [保证文件名唯一](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 194 场周赛 | +| 1488 | [避免洪水泛滥](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README.md) | `贪心`,`数组`,`哈希表`,`二分查找`,`堆（优先队列）` | 中等 | 第 194 场周赛 | +| 1489 | [找到最小生成树里的关键边和伪关键边](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README.md) | `并查集`,`图`,`最小生成树`,`排序`,`强连通分量` | 困难 | 第 194 场周赛 | +| 1490 | [克隆 N 叉树](/solution/1400-1499/1490.Clone%20N-ary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表` | 中等 | 🔒 | +| 1491 | [去掉最低工资和最高工资后的工资平均值](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README.md) | `数组`,`排序` | 简单 | 第 29 场双周赛 | +| 1492 | [n 的第 k 个因子](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README.md) | `数学`,`数论` | 中等 | 第 29 场双周赛 | +| 1493 | [删掉一个元素以后全为 1 的最长子数组](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README.md) | `数组`,`动态规划`,`滑动窗口` | 中等 | 第 29 场双周赛 | +| 1494 | [并行课程 II](/solution/1400-1499/1494.Parallel%20Courses%20II/README.md) | `位运算`,`图`,`动态规划`,`状态压缩` | 困难 | 第 29 场双周赛 | +| 1495 | [上月播放的儿童适宜电影](/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README.md) | `数据库` | 简单 | 🔒 | +| 1496 | [判断路径是否相交](/solution/1400-1499/1496.Path%20Crossing/README.md) | `哈希表`,`字符串` | 简单 | 第 195 场周赛 | +| 1497 | [检查数组对是否可以被 k 整除](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 195 场周赛 | +| 1498 | [满足条件的子序列数目](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 195 场周赛 | +| 1499 | [满足不等式的最大值](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README.md) | `队列`,`数组`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 困难 | 第 195 场周赛 | +| 1500 | [设计文件分享系统](/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README.md) | `设计`,`哈希表`,`数据流`,`堆（优先队列）` | 中等 | 🔒 | +| 1501 | [可以放心投资的国家](/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README.md) | `数据库` | 中等 | 🔒 | +| 1502 | [判断能否形成等差数列](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README.md) | `数组`,`排序` | 简单 | 第 196 场周赛 | +| 1503 | [所有蚂蚁掉下来前的最后一刻](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README.md) | `脑筋急转弯`,`数组`,`模拟` | 中等 | 第 196 场周赛 | +| 1504 | [统计全 1 子矩形](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README.md) | `栈`,`数组`,`动态规划`,`矩阵`,`单调栈` | 中等 | 第 196 场周赛 | +| 1505 | [最多 K 次交换相邻数位后得到的最小整数](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README.md) | `贪心`,`树状数组`,`线段树`,`字符串` | 困难 | 第 196 场周赛 | +| 1506 | [找到 N 叉树的根节点](/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README.md) | `位运算`,`树`,`深度优先搜索`,`哈希表` | 中等 | 🔒 | +| 1507 | [转变日期格式](/solution/1500-1599/1507.Reformat%20Date/README.md) | `字符串` | 简单 | 第 30 场双周赛 | +| 1508 | [子数组和排序后的区间和](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 30 场双周赛 | +| 1509 | [三次操作后最大值与最小值的最小差](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 30 场双周赛 | +| 1510 | [石子游戏 IV](/solution/1500-1599/1510.Stone%20Game%20IV/README.md) | `数学`,`动态规划`,`博弈` | 困难 | 第 30 场双周赛 | +| 1511 | [消费者下单频率](/solution/1500-1599/1511.Customer%20Order%20Frequency/README.md) | `数据库` | 简单 | 🔒 | +| 1512 | [好数对的数目](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README.md) | `数组`,`哈希表`,`数学`,`计数` | 简单 | 第 197 场周赛 | +| 1513 | [仅含 1 的子串数](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md) | `数学`,`字符串` | 中等 | 第 197 场周赛 | +| 1514 | [概率最大的路径](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README.md) | `图`,`数组`,`最短路`,`堆（优先队列）` | 中等 | 第 197 场周赛 | +| 1515 | [服务中心的最佳位置](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README.md) | `几何`,`数学`,`随机化` | 困难 | 第 197 场周赛 | +| 1516 | [移动 N 叉树的子树](/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README.md) | `树`,`深度优先搜索` | 困难 | 🔒 | +| 1517 | [查找拥有有效邮箱的用户](/solution/1500-1599/1517.Find%20Users%20With%20Valid%20E-Mails/README.md) | `数据库` | 简单 | | +| 1518 | [换水问题](/solution/1500-1599/1518.Water%20Bottles/README.md) | `数学`,`模拟` | 简单 | 第 198 场周赛 | +| 1519 | [子树中标签相同的节点数](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`计数` | 中等 | 第 198 场周赛 | +| 1520 | [最多的不重叠子字符串](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README.md) | `贪心`,`字符串` | 困难 | 第 198 场周赛 | +| 1521 | [找到最接近目标值的函数值](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README.md) | `位运算`,`线段树`,`数组`,`二分查找` | 困难 | 第 198 场周赛 | +| 1522 | [N 叉树的直径](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md) | `树`,`深度优先搜索` | 中等 | 🔒 | +| 1523 | [在区间范围内统计奇数数目](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README.md) | `数学` | 简单 | 第 31 场双周赛 | +| 1524 | [和为奇数的子数组数目](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README.md) | `数组`,`数学`,`动态规划`,`前缀和` | 中等 | 第 31 场双周赛 | +| 1525 | [字符串的好分割数目](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README.md) | `位运算`,`哈希表`,`字符串`,`动态规划` | 中等 | 第 31 场双周赛 | +| 1526 | [形成目标数组的子数组最少增加次数](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README.md) | `栈`,`贪心`,`数组`,`动态规划`,`单调栈` | 困难 | 第 31 场双周赛 | +| 1527 | [患某种疾病的患者](/solution/1500-1599/1527.Patients%20With%20a%20Condition/README.md) | `数据库` | 简单 | | +| 1528 | [重新排列字符串](/solution/1500-1599/1528.Shuffle%20String/README.md) | `数组`,`字符串` | 简单 | 第 199 场周赛 | +| 1529 | [最少的后缀翻转次数](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README.md) | `贪心`,`字符串` | 中等 | 第 199 场周赛 | +| 1530 | [好叶子节点对的数量](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 199 场周赛 | +| 1531 | [压缩字符串 II](/solution/1500-1599/1531.String%20Compression%20II/README.md) | `字符串`,`动态规划` | 困难 | 第 199 场周赛 | +| 1532 | [最近的三笔订单](/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README.md) | `数据库` | 中等 | 🔒 | +| 1533 | [找到最大整数的索引](/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README.md) | `数组`,`二分查找`,`交互` | 中等 | 🔒 | +| 1534 | [统计好三元组](/solution/1500-1599/1534.Count%20Good%20Triplets/README.md) | `数组`,`枚举` | 简单 | 第 200 场周赛 | +| 1535 | [找出数组游戏的赢家](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README.md) | `数组`,`模拟` | 中等 | 第 200 场周赛 | +| 1536 | [排布二进制网格的最少交换次数](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README.md) | `贪心`,`数组`,`矩阵` | 中等 | 第 200 场周赛 | +| 1537 | [最大得分](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README.md) | `贪心`,`数组`,`双指针`,`动态规划` | 困难 | 第 200 场周赛 | +| 1538 | [找出隐藏数组中出现次数最多的元素](/solution/1500-1599/1538.Guess%20the%20Majority%20in%20a%20Hidden%20Array/README.md) | `数组`,`数学`,`交互` | 中等 | 🔒 | +| 1539 | [第 k 个缺失的正整数](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README.md) | `数组`,`二分查找` | 简单 | 第 32 场双周赛 | +| 1540 | [K 次操作转变字符串](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README.md) | `哈希表`,`字符串` | 中等 | 第 32 场双周赛 | +| 1541 | [平衡括号字符串的最少插入次数](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md) | `栈`,`贪心`,`字符串` | 中等 | 第 32 场双周赛 | +| 1542 | [找出最长的超赞子字符串](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README.md) | `位运算`,`哈希表`,`字符串` | 困难 | 第 32 场双周赛 | +| 1543 | [产品名称格式修复](/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README.md) | `数据库` | 简单 | 🔒 | +| 1544 | [整理字符串](/solution/1500-1599/1544.Make%20The%20String%20Great/README.md) | `栈`,`字符串` | 简单 | 第 201 场周赛 | +| 1545 | [找出第 N 个二进制字符串中的第 K 位](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README.md) | `递归`,`字符串`,`模拟` | 中等 | 第 201 场周赛 | +| 1546 | [和为目标值且不重叠的非空子数组的最大数目](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README.md) | `贪心`,`数组`,`哈希表`,`前缀和` | 中等 | 第 201 场周赛 | +| 1547 | [切棍子的最小成本](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 201 场周赛 | +| 1548 | [图中最相似的路径](/solution/1500-1599/1548.The%20Most%20Similar%20Path%20in%20a%20Graph/README.md) | `图`,`动态规划` | 困难 | 🔒 | +| 1549 | [每件商品的最新订单](/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README.md) | `数据库` | 中等 | 🔒 | +| 1550 | [存在连续三个奇数的数组](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README.md) | `数组` | 简单 | 第 202 场周赛 | +| 1551 | [使数组中所有元素相等的最小操作数](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README.md) | `数学` | 中等 | 第 202 场周赛 | +| 1552 | [两球之间的磁力](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README.md) | `数组`,`二分查找`,`排序` | 中等 | 第 202 场周赛 | +| 1553 | [吃掉 N 个橘子的最少天数](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README.md) | `记忆化搜索`,`动态规划` | 困难 | 第 202 场周赛 | +| 1554 | [只有一个不同字符的字符串](/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README.md) | `哈希表`,`字符串`,`哈希函数`,`滚动哈希` | 中等 | 🔒 | +| 1555 | [银行账户概要](/solution/1500-1599/1555.Bank%20Account%20Summary/README.md) | `数据库` | 中等 | 🔒 | +| 1556 | [千位分隔数](/solution/1500-1599/1556.Thousand%20Separator/README.md) | `字符串` | 简单 | 第 33 场双周赛 | +| 1557 | [可以到达所有点的最少点数目](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README.md) | `图` | 中等 | 第 33 场双周赛 | +| 1558 | [得到目标数组的最少函数调用次数](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README.md) | `贪心`,`位运算`,`数组` | 中等 | 第 33 场双周赛 | +| 1559 | [二维网格图中探测环](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 33 场双周赛 | +| 1560 | [圆形赛道上经过次数最多的扇区](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README.md) | `数组`,`模拟` | 简单 | 第 203 场周赛 | +| 1561 | [你可以获得的最大硬币数目](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README.md) | `贪心`,`数组`,`数学`,`博弈`,`排序` | 中等 | 第 203 场周赛 | +| 1562 | [查找大小为 M 的最新分组](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README.md) | `数组`,`二分查找`,`模拟` | 中等 | 第 203 场周赛 | +| 1563 | [石子游戏 V](/solution/1500-1599/1563.Stone%20Game%20V/README.md) | `数组`,`数学`,`动态规划`,`博弈` | 困难 | 第 203 场周赛 | +| 1564 | [把箱子放进仓库里 I](/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | +| 1565 | [按月统计订单数与顾客数](/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README.md) | `数据库` | 简单 | 🔒 | +| 1566 | [重复至少 K 次且长度为 M 的模式](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README.md) | `数组`,`枚举` | 简单 | 第 204 场周赛 | +| 1567 | [乘积为正数的最长子数组长度](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README.md) | `贪心`,`数组`,`动态规划` | 中等 | 第 204 场周赛 | +| 1568 | [使陆地分离的最少天数](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵`,`强连通分量` | 困难 | 第 204 场周赛 | +| 1569 | [将子数组重新排序得到同一个二叉搜索树的方案数](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README.md) | `树`,`并查集`,`二叉搜索树`,`记忆化搜索`,`数组`,`数学`,`分治`,`动态规划`,`二叉树`,`组合数学` | 困难 | 第 204 场周赛 | +| 1570 | [两个稀疏向量的点积](/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README.md) | `设计`,`数组`,`哈希表`,`双指针` | 中等 | 🔒 | +| 1571 | [仓库经理](/solution/1500-1599/1571.Warehouse%20Manager/README.md) | `数据库` | 简单 | 🔒 | +| 1572 | [矩阵对角线元素的和](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README.md) | `数组`,`矩阵` | 简单 | 第 34 场双周赛 | +| 1573 | [分割字符串的方案数](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md) | `数学`,`字符串` | 中等 | 第 34 场双周赛 | +| 1574 | [删除最短的子数组使剩余数组有序](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md) | `栈`,`数组`,`双指针`,`二分查找`,`单调栈` | 中等 | 第 34 场双周赛 | +| 1575 | [统计所有可行路径](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md) | `记忆化搜索`,`数组`,`动态规划` | 困难 | 第 34 场双周赛 | +| 1576 | [替换所有的问号](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md) | `字符串` | 简单 | 第 205 场周赛 | +| 1577 | [数的平方等于两数乘积的方法数](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md) | `数组`,`哈希表`,`数学`,`双指针` | 中等 | 第 205 场周赛 | +| 1578 | [使绳子变成彩色的最短时间](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README.md) | `贪心`,`数组`,`字符串`,`动态规划` | 中等 | 第 205 场周赛 | +| 1579 | [保证图可完全遍历](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md) | `并查集`,`图` | 困难 | 第 205 场周赛 | +| 1580 | [把箱子放进仓库里 II](/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | +| 1581 | [进店却未进行过交易的顾客](/solution/1500-1599/1581.Customer%20Who%20Visited%20but%20Did%20Not%20Make%20Any%20Transactions/README.md) | `数据库` | 简单 | | +| 1582 | [二进制矩阵中的特殊位置](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README.md) | `数组`,`矩阵` | 简单 | 第 206 场周赛 | +| 1583 | [统计不开心的朋友](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README.md) | `数组`,`模拟` | 中等 | 第 206 场周赛 | +| 1584 | [连接所有点的最小费用](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md) | `并查集`,`图`,`数组`,`最小生成树` | 中等 | 第 206 场周赛 | +| 1585 | [检查字符串是否可以通过排序子字符串得到另一个字符串](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README.md) | `贪心`,`字符串`,`排序` | 困难 | 第 206 场周赛 | +| 1586 | [二叉搜索树迭代器 II](/solution/1500-1599/1586.Binary%20Search%20Tree%20Iterator%20II/README.md) | `栈`,`树`,`设计`,`二叉搜索树`,`二叉树`,`迭代器` | 中等 | 🔒 | +| 1587 | [银行账户概要 II](/solution/1500-1599/1587.Bank%20Account%20Summary%20II/README.md) | `数据库` | 简单 | | +| 1588 | [所有奇数长度子数组的和](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README.md) | `数组`,`数学`,`前缀和` | 简单 | 第 35 场双周赛 | +| 1589 | [所有排列中的最大和](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README.md) | `贪心`,`数组`,`前缀和`,`排序` | 中等 | 第 35 场双周赛 | +| 1590 | [使数组和能被 P 整除](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 35 场双周赛 | +| 1591 | [奇怪的打印机 II](/solution/1500-1599/1591.Strange%20Printer%20II/README.md) | `图`,`拓扑排序`,`数组`,`矩阵` | 困难 | 第 35 场双周赛 | +| 1592 | [重新排列单词间的空格](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README.md) | `字符串` | 简单 | 第 207 场周赛 | +| 1593 | [拆分字符串使唯一子字符串的数目最大](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README.md) | `哈希表`,`字符串`,`回溯` | 中等 | 第 207 场周赛 | +| 1594 | [矩阵的最大非负积](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 207 场周赛 | +| 1595 | [连通两组点的最小成本](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩`,`矩阵` | 困难 | 第 207 场周赛 | +| 1596 | [每位顾客最经常订购的商品](/solution/1500-1599/1596.The%20Most%20Frequently%20Ordered%20Products%20for%20Each%20Customer/README.md) | `数据库` | 中等 | 🔒 | +| 1597 | [根据中缀表达式构造二叉表达式树](/solution/1500-1599/1597.Build%20Binary%20Expression%20Tree%20From%20Infix%20Expression/README.md) | `栈`,`树`,`字符串`,`二叉树` | 困难 | 🔒 | +| 1598 | [文件夹操作日志搜集器](/solution/1500-1599/1598.Crawler%20Log%20Folder/README.md) | `栈`,`数组`,`字符串` | 简单 | 第 208 场周赛 | +| 1599 | [经营摩天轮的最大利润](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README.md) | `数组`,`模拟` | 中等 | 第 208 场周赛 | +| 1600 | [王位继承顺序](/solution/1600-1699/1600.Throne%20Inheritance/README.md) | `树`,`深度优先搜索`,`设计`,`哈希表` | 中等 | 第 208 场周赛 | +| 1601 | [最多可达成的换楼请求数目](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README.md) | `位运算`,`数组`,`回溯`,`枚举` | 困难 | 第 208 场周赛 | +| 1602 | [找到二叉树中最近的右侧节点](/solution/1600-1699/1602.Find%20Nearest%20Right%20Node%20in%20Binary%20Tree/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | +| 1603 | [设计停车系统](/solution/1600-1699/1603.Design%20Parking%20System/README.md) | `设计`,`计数`,`模拟` | 简单 | 第 36 场双周赛 | +| 1604 | [警告一小时内使用相同员工卡大于等于三次的人](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 36 场双周赛 | +| 1605 | [给定行和列的和求可行矩阵](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README.md) | `贪心`,`数组`,`矩阵` | 中等 | 第 36 场双周赛 | +| 1606 | [找到处理最多请求的服务器](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README.md) | `贪心`,`数组`,`有序集合`,`堆（优先队列）` | 困难 | 第 36 场双周赛 | +| 1607 | [没有卖出的卖家](/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README.md) | `数据库` | 简单 | 🔒 | +| 1608 | [特殊数组的特征值](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README.md) | `数组`,`二分查找`,`排序` | 简单 | 第 209 场周赛 | +| 1609 | [奇偶树](/solution/1600-1699/1609.Even%20Odd%20Tree/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | 第 209 场周赛 | +| 1610 | [可见点的最大数目](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README.md) | `几何`,`数组`,`数学`,`排序`,`滑动窗口` | 困难 | 第 209 场周赛 | +| 1611 | [使整数变为 0 的最少操作次数](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README.md) | `位运算`,`记忆化搜索`,`动态规划` | 困难 | 第 209 场周赛 | +| 1612 | [检查两棵二叉表达式树是否等价](/solution/1600-1699/1612.Check%20If%20Two%20Expression%20Trees%20are%20Equivalent/README.md) | `树`,`深度优先搜索`,`哈希表`,`二叉树`,`计数` | 中等 | 🔒 | +| 1613 | [找到遗失的 ID](/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README.md) | `数据库` | 中等 | 🔒 | +| 1614 | [括号的最大嵌套深度](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README.md) | `栈`,`字符串` | 简单 | 第 210 场周赛 | +| 1615 | [最大网络秩](/solution/1600-1699/1615.Maximal%20Network%20Rank/README.md) | `图` | 中等 | 第 210 场周赛 | +| 1616 | [分割两个字符串得到回文串](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README.md) | `双指针`,`字符串` | 中等 | 第 210 场周赛 | +| 1617 | [统计子树中城市之间最大距离](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README.md) | `位运算`,`树`,`动态规划`,`状态压缩`,`枚举` | 困难 | 第 210 场周赛 | +| 1618 | [找出适应屏幕的最大字号](/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README.md) | `数组`,`字符串`,`二分查找`,`交互` | 中等 | 🔒 | +| 1619 | [删除某些元素后的数组均值](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README.md) | `数组`,`排序` | 简单 | 第 37 场双周赛 | +| 1620 | [网络信号最好的坐标](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README.md) | `数组`,`枚举` | 中等 | 第 37 场双周赛 | +| 1621 | [大小为 K 的不重叠线段的数目](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README.md) | `数学`,`动态规划`,`组合数学` | 中等 | 第 37 场双周赛 | +| 1622 | [奇妙序列](/solution/1600-1699/1622.Fancy%20Sequence/README.md) | `设计`,`线段树`,`数学` | 困难 | 第 37 场双周赛 | +| 1623 | [三人国家代表队](/solution/1600-1699/1623.All%20Valid%20Triplets%20That%20Can%20Represent%20a%20Country/README.md) | `数据库` | 简单 | 🔒 | +| 1624 | [两个相同字符之间的最长子字符串](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README.md) | `哈希表`,`字符串` | 简单 | 第 211 场周赛 | +| 1625 | [执行操作后字典序最小的字符串](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README.md) | `深度优先搜索`,`广度优先搜索`,`字符串`,`枚举` | 中等 | 第 211 场周赛 | +| 1626 | [无矛盾的最佳球队](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md) | `数组`,`动态规划`,`排序` | 中等 | 第 211 场周赛 | +| 1627 | [带阈值的图连通性](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README.md) | `并查集`,`数组`,`数学`,`数论` | 困难 | 第 211 场周赛 | +| 1628 | [设计带解析函数的表达式树](/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README.md) | `栈`,`树`,`设计`,`数组`,`数学`,`二叉树` | 中等 | 🔒 | +| 1629 | [按键持续时间最长的键](/solution/1600-1699/1629.Slowest%20Key/README.md) | `数组`,`字符串` | 简单 | 第 212 场周赛 | +| 1630 | [等差子数组](/solution/1600-1699/1630.Arithmetic%20Subarrays/README.md) | `数组`,`哈希表`,`排序` | 中等 | 第 212 场周赛 | +| 1631 | [最小体力消耗路径](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`二分查找`,`矩阵`,`堆（优先队列）` | 中等 | 第 212 场周赛 | +| 1632 | [矩阵转换后的秩](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README.md) | `并查集`,`图`,`拓扑排序`,`数组`,`矩阵`,`排序` | 困难 | 第 212 场周赛 | +| 1633 | [各赛事的用户注册率](/solution/1600-1699/1633.Percentage%20of%20Users%20Attended%20a%20Contest/README.md) | `数据库` | 简单 | | +| 1634 | [求两个多项式链表的和](/solution/1600-1699/1634.Add%20Two%20Polynomials%20Represented%20as%20Linked%20Lists/README.md) | `链表`,`数学`,`双指针` | 中等 | 🔒 | +| 1635 | [Hopper 公司查询 I](/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README.md) | `数据库` | 困难 | 🔒 | +| 1636 | [按照频率将数组升序排序](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 38 场双周赛 | +| 1637 | [两点之间不包含任何点的最宽垂直区域](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README.md) | `数组`,`排序` | 简单 | 第 38 场双周赛 | +| 1638 | [统计只差一个字符的子串数目](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README.md) | `哈希表`,`字符串`,`动态规划`,`枚举` | 中等 | 第 38 场双周赛 | +| 1639 | [通过给定词典构造目标字符串的方案数](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README.md) | `数组`,`字符串`,`动态规划` | 困难 | 第 38 场双周赛 | +| 1640 | [能否连接形成数组](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README.md) | `数组`,`哈希表` | 简单 | 第 213 场周赛 | +| 1641 | [统计字典序元音字符串的数目](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README.md) | `数学`,`动态规划`,`组合数学` | 中等 | 第 213 场周赛 | +| 1642 | [可以到达的最远建筑](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 213 场周赛 | +| 1643 | [第 K 条最小指令](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README.md) | `数组`,`数学`,`动态规划`,`组合数学` | 困难 | 第 213 场周赛 | +| 1644 | [二叉树的最近公共祖先 II](/solution/1600-1699/1644.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20II/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | +| 1645 | [Hopper 公司查询 II](/solution/1600-1699/1645.Hopper%20Company%20Queries%20II/README.md) | `数据库` | 困难 | 🔒 | +| 1646 | [获取生成数组中的最大值](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README.md) | `数组`,`模拟` | 简单 | 第 214 场周赛 | +| 1647 | [字符频次唯一的最小删除次数](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README.md) | `贪心`,`哈希表`,`字符串`,`排序` | 中等 | 第 214 场周赛 | +| 1648 | [销售价值减少的颜色球](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README.md) | `贪心`,`数组`,`数学`,`二分查找`,`排序`,`堆（优先队列）` | 中等 | 第 214 场周赛 | +| 1649 | [通过指令创建有序数组](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | 第 214 场周赛 | +| 1650 | [二叉树的最近公共祖先 III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README.md) | `树`,`哈希表`,`双指针`,`二叉树` | 中等 | 🔒 | +| 1651 | [Hopper 公司查询 III](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README.md) | `数据库` | 困难 | 🔒 | +| 1652 | [拆炸弹](/solution/1600-1699/1652.Defuse%20the%20Bomb/README.md) | `数组`,`滑动窗口` | 简单 | 第 39 场双周赛 | +| 1653 | [使字符串平衡的最少删除次数](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README.md) | `栈`,`字符串`,`动态规划` | 中等 | 第 39 场双周赛 | +| 1654 | [到家的最少跳跃次数](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README.md) | `广度优先搜索`,`数组`,`动态规划` | 中等 | 第 39 场双周赛 | +| 1655 | [分配重复整数](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 困难 | 第 39 场双周赛 | +| 1656 | [设计有序流](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README.md) | `设计`,`数组`,`哈希表`,`数据流` | 简单 | 第 215 场周赛 | +| 1657 | [确定两个字符串是否接近](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README.md) | `哈希表`,`字符串`,`计数`,`排序` | 中等 | 第 215 场周赛 | +| 1658 | [将 x 减到 0 的最小操作数](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README.md) | `数组`,`哈希表`,`二分查找`,`前缀和`,`滑动窗口` | 中等 | 第 215 场周赛 | +| 1659 | [最大化网格幸福感](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README.md) | `位运算`,`记忆化搜索`,`动态规划`,`状态压缩` | 困难 | 第 215 场周赛 | +| 1660 | [纠正二叉树](/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 | +| 1661 | [每台机器的进程平均运行时间](/solution/1600-1699/1661.Average%20Time%20of%20Process%20per%20Machine/README.md) | `数据库` | 简单 | | +| 1662 | [检查两个字符串数组是否相等](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README.md) | `数组`,`字符串` | 简单 | 第 216 场周赛 | +| 1663 | [具有给定数值的最小字符串](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README.md) | `贪心`,`字符串` | 中等 | 第 216 场周赛 | +| 1664 | [生成平衡数组的方案数](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README.md) | `数组`,`前缀和` | 中等 | 第 216 场周赛 | +| 1665 | [完成所有任务的最少初始能量](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README.md) | `贪心`,`数组`,`排序` | 困难 | 第 216 场周赛 | +| 1666 | [改变二叉树的根节点](/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | +| 1667 | [修复表中的名字](/solution/1600-1699/1667.Fix%20Names%20in%20a%20Table/README.md) | `数据库` | 简单 | | +| 1668 | [最大重复子字符串](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README.md) | `字符串`,`动态规划`,`字符串匹配` | 简单 | 第 40 场双周赛 | +| 1669 | [合并两个链表](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README.md) | `链表` | 中等 | 第 40 场双周赛 | +| 1670 | [设计前中后队列](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README.md) | `设计`,`队列`,`数组`,`链表`,`数据流` | 中等 | 第 40 场双周赛 | +| 1671 | [得到山形数组的最少删除次数](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README.md) | `贪心`,`数组`,`二分查找`,`动态规划` | 困难 | 第 40 场双周赛 | +| 1672 | [最富有客户的资产总量](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README.md) | `数组`,`矩阵` | 简单 | 第 217 场周赛 | +| 1673 | [找出最具竞争力的子序列](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README.md) | `栈`,`贪心`,`数组`,`单调栈` | 中等 | 第 217 场周赛 | +| 1674 | [使数组互补的最少操作次数](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 217 场周赛 | +| 1675 | [数组的最小偏移量](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README.md) | `贪心`,`数组`,`有序集合`,`堆（优先队列）` | 困难 | 第 217 场周赛 | +| 1676 | [二叉树的最近公共祖先 IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README.md) | `树`,`深度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 | +| 1677 | [发票中的产品金额](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README.md) | `数据库` | 简单 | 🔒 | +| 1678 | [设计 Goal 解析器](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md) | `字符串` | 简单 | 第 218 场周赛 | +| 1679 | [K 和数对的最大数目](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md) | `数组`,`哈希表`,`双指针`,`排序` | 中等 | 第 218 场周赛 | +| 1680 | [连接连续二进制数字](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README.md) | `位运算`,`数学`,`模拟` | 中等 | 第 218 场周赛 | +| 1681 | [最小不兼容性](/solution/1600-1699/1681.Minimum%20Incompatibility/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 218 场周赛 | +| 1682 | [最长回文子序列 II](/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README.md) | `字符串`,`动态规划` | 中等 | 🔒 | +| 1683 | [无效的推文](/solution/1600-1699/1683.Invalid%20Tweets/README.md) | `数据库` | 简单 | | +| 1684 | [统计一致字符串的数目](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README.md) | `位运算`,`数组`,`哈希表`,`字符串` | 简单 | 第 41 场双周赛 | +| 1685 | [有序数组中差绝对值之和](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README.md) | `数组`,`数学`,`前缀和` | 中等 | 第 41 场双周赛 | +| 1686 | [石子游戏 VI](/solution/1600-1699/1686.Stone%20Game%20VI/README.md) | `贪心`,`数组`,`数学`,`博弈`,`排序`,`堆（优先队列）` | 中等 | 第 41 场双周赛 | +| 1687 | [从仓库到码头运输箱子](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README.md) | `线段树`,`队列`,`数组`,`动态规划`,`前缀和`,`单调队列`,`堆（优先队列）` | 困难 | 第 41 场双周赛 | +| 1688 | [比赛中的配对次数](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README.md) | `数学`,`模拟` | 简单 | 第 219 场周赛 | +| 1689 | [十-二进制数的最少数目](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README.md) | `贪心`,`字符串` | 中等 | 第 219 场周赛 | +| 1690 | [石子游戏 VII](/solution/1600-1699/1690.Stone%20Game%20VII/README.md) | `数组`,`数学`,`动态规划`,`博弈` | 中等 | 第 219 场周赛 | +| 1691 | [堆叠长方体的最大高度](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 219 场周赛 | +| 1692 | [计算分配糖果的不同方式](/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README.md) | `动态规划` | 困难 | 🔒 | +| 1693 | [每天的领导和合伙人](/solution/1600-1699/1693.Daily%20Leads%20and%20Partners/README.md) | `数据库` | 简单 | | +| 1694 | [重新格式化电话号码](/solution/1600-1699/1694.Reformat%20Phone%20Number/README.md) | `字符串` | 简单 | 第 220 场周赛 | +| 1695 | [删除子数组的最大得分](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 220 场周赛 | +| 1696 | [跳跃游戏 VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md) | `队列`,`数组`,`动态规划`,`单调队列`,`堆（优先队列）` | 中等 | 第 220 场周赛 | +| 1697 | [检查边长度限制的路径是否存在](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md) | `并查集`,`图`,`数组`,`双指针`,`排序` | 困难 | 第 220 场周赛 | +| 1698 | [字符串的不同子字符串个数](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md) | `字典树`,`字符串`,`后缀数组`,`哈希函数`,`滚动哈希` | 中等 | 🔒 | +| 1699 | [两人之间的通话次数](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md) | `数据库` | 中等 | 🔒 | +| 1700 | [无法吃午餐的学生数量](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md) | `栈`,`队列`,`数组`,`模拟` | 简单 | 第 42 场双周赛 | +| 1701 | [平均等待时间](/solution/1700-1799/1701.Average%20Waiting%20Time/README.md) | `数组`,`模拟` | 中等 | 第 42 场双周赛 | +| 1702 | [修改后的最大二进制字符串](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README.md) | `贪心`,`字符串` | 中等 | 第 42 场双周赛 | +| 1703 | [得到连续 K 个 1 的最少相邻交换次数](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README.md) | `贪心`,`数组`,`前缀和`,`滑动窗口` | 困难 | 第 42 场双周赛 | +| 1704 | [判断字符串的两半是否相似](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README.md) | `字符串`,`计数` | 简单 | 第 221 场周赛 | +| 1705 | [吃苹果的最大数目](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 221 场周赛 | +| 1706 | [球会落何处](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 221 场周赛 | +| 1707 | [与数组中元素的最大异或值](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README.md) | `位运算`,`字典树`,`数组` | 困难 | 第 221 场周赛 | +| 1708 | [长度为 K 的最大子数组](/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README.md) | `贪心`,`数组` | 简单 | 🔒 | +| 1709 | [访问日期之间最大的空档期](/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README.md) | `数据库` | 中等 | 🔒 | +| 1710 | [卡车上的最大单元数](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 222 场周赛 | +| 1711 | [大餐计数](/solution/1700-1799/1711.Count%20Good%20Meals/README.md) | `数组`,`哈希表` | 中等 | 第 222 场周赛 | +| 1712 | [将数组分成三个子数组的方案数](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README.md) | `数组`,`双指针`,`二分查找`,`前缀和` | 中等 | 第 222 场周赛 | +| 1713 | [得到子序列的最少操作次数](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README.md) | `贪心`,`数组`,`哈希表`,`二分查找` | 困难 | 第 222 场周赛 | +| 1714 | [数组中特殊等间距元素的和](/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README.md) | `数组`,`动态规划` | 困难 | 🔒 | +| 1715 | [苹果和橘子的个数](/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README.md) | `数据库` | 中等 | 🔒 | +| 1716 | [计算力扣银行的钱](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README.md) | `数学` | 简单 | 第 43 场双周赛 | +| 1717 | [删除子字符串的最大得分](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README.md) | `栈`,`贪心`,`字符串` | 中等 | 第 43 场双周赛 | +| 1718 | [构建字典序最大的可行序列](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README.md) | `数组`,`回溯` | 中等 | 第 43 场双周赛 | +| 1719 | [重构一棵树的方案数](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README.md) | `树`,`图` | 困难 | 第 43 场双周赛 | +| 1720 | [解码异或后的数组](/solution/1700-1799/1720.Decode%20XORed%20Array/README.md) | `位运算`,`数组` | 简单 | 第 223 场周赛 | +| 1721 | [交换链表中的节点](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README.md) | `链表`,`双指针` | 中等 | 第 223 场周赛 | +| 1722 | [执行交换操作后的最小汉明距离](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README.md) | `深度优先搜索`,`并查集`,`数组` | 中等 | 第 223 场周赛 | +| 1723 | [完成所有工作的最短时间](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 困难 | 第 223 场周赛 | +| 1724 | [检查边长度限制的路径是否存在 II](/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README.md) | `并查集`,`图`,`最小生成树` | 困难 | 🔒 | +| 1725 | [可以形成最大正方形的矩形数目](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README.md) | `数组` | 简单 | 第 224 场周赛 | +| 1726 | [同积元组](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 224 场周赛 | +| 1727 | [重新排列后的最大子矩阵](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README.md) | `贪心`,`数组`,`矩阵`,`排序` | 中等 | 第 224 场周赛 | +| 1728 | [猫和老鼠 II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README.md) | `图`,`拓扑排序`,`记忆化搜索`,`数组`,`数学`,`动态规划`,`博弈`,`矩阵` | 困难 | 第 224 场周赛 | +| 1729 | [求关注者的数量](/solution/1700-1799/1729.Find%20Followers%20Count/README.md) | `数据库` | 简单 | | +| 1730 | [获取食物的最短路径](/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 🔒 | +| 1731 | [每位经理的下属员工数量](/solution/1700-1799/1731.The%20Number%20of%20Employees%20Which%20Report%20to%20Each%20Employee/README.md) | `数据库` | 简单 | | +| 1732 | [找到最高海拔](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md) | `数组`,`前缀和` | 简单 | 第 44 场双周赛 | +| 1733 | [需要教语言的最少人数](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md) | `贪心`,`数组`,`哈希表` | 中等 | 第 44 场双周赛 | +| 1734 | [解码异或后的排列](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md) | `位运算`,`数组` | 中等 | 第 44 场双周赛 | +| 1735 | [生成乘积数组的方案数](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md) | `数组`,`数学`,`动态规划`,`组合数学`,`数论` | 困难 | 第 44 场双周赛 | +| 1736 | [替换隐藏数字得到的最晚时间](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md) | `贪心`,`字符串` | 简单 | 第 225 场周赛 | +| 1737 | [满足三条件之一需改变的最少字符数](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md) | `哈希表`,`字符串`,`计数`,`前缀和` | 中等 | 第 225 场周赛 | +| 1738 | [找出第 K 大的异或坐标值](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md) | `位运算`,`数组`,`分治`,`矩阵`,`前缀和`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | 第 225 场周赛 | +| 1739 | [放置盒子](/solution/1700-1799/1739.Building%20Boxes/README.md) | `贪心`,`数学`,`二分查找` | 困难 | 第 225 场周赛 | +| 1740 | [找到二叉树中的距离](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 🔒 | +| 1741 | [查找每个员工花费的总时间](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README.md) | `数据库` | 简单 | | +| 1742 | [盒子中小球的最大数量](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md) | `哈希表`,`数学`,`计数` | 简单 | 第 226 场周赛 | +| 1743 | [从相邻元素对还原数组](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md) | `数组`,`哈希表` | 中等 | 第 226 场周赛 | +| 1744 | [你能在你最喜欢的那天吃到你最喜欢的糖果吗？](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md) | `数组`,`前缀和` | 中等 | 第 226 场周赛 | +| 1745 | [分割回文串 IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md) | `字符串`,`动态规划` | 困难 | 第 226 场周赛 | +| 1746 | [经过一次操作后的最大子数组和](/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README.md) | `数组`,`动态规划` | 中等 | 🔒 | +| 1747 | [应该被禁止的 Leetflex 账户](/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README.md) | `数据库` | 中等 | 🔒 | +| 1748 | [唯一元素的和](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 45 场双周赛 | +| 1749 | [任意子数组和的绝对值的最大值](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md) | `数组`,`动态规划` | 中等 | 第 45 场双周赛 | +| 1750 | [删除字符串两端相同字符后的最短长度](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md) | `双指针`,`字符串` | 中等 | 第 45 场双周赛 | +| 1751 | [最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md) | `数组`,`二分查找`,`动态规划`,`排序` | 困难 | 第 45 场双周赛 | +| 1752 | [检查数组是否经排序和轮转得到](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md) | `数组` | 简单 | 第 227 场周赛 | +| 1753 | [移除石子的最大得分](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md) | `贪心`,`数学`,`堆（优先队列）` | 中等 | 第 227 场周赛 | +| 1754 | [构造字典序最大的合并字符串](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md) | `贪心`,`双指针`,`字符串` | 中等 | 第 227 场周赛 | +| 1755 | [最接近目标值的子序列和](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md) | `位运算`,`数组`,`双指针`,`动态规划`,`状态压缩` | 困难 | 第 227 场周赛 | +| 1756 | [设计最近使用（MRU）队列](/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README.md) | `栈`,`设计`,`树状数组`,`数组`,`哈希表`,`有序集合` | 中等 | 🔒 | +| 1757 | [可回收且低脂的产品](/solution/1700-1799/1757.Recyclable%20and%20Low%20Fat%20Products/README.md) | `数据库` | 简单 | | +| 1758 | [生成交替二进制字符串的最少操作数](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README.md) | `字符串` | 简单 | 第 228 场周赛 | +| 1759 | [统计同质子字符串的数目](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README.md) | `数学`,`字符串` | 中等 | 第 228 场周赛 | +| 1760 | [袋子里最少数目的球](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README.md) | `数组`,`二分查找` | 中等 | 第 228 场周赛 | +| 1761 | [一个图中连通三元组的最小度数](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README.md) | `图` | 困难 | 第 228 场周赛 | +| 1762 | [能看到海景的建筑物](/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README.md) | `栈`,`数组`,`单调栈` | 中等 | 🔒 | +| 1763 | [最长的美好子字符串](/solution/1700-1799/1763.Longest%20Nice%20Substring/README.md) | `位运算`,`哈希表`,`字符串`,`分治`,`滑动窗口` | 简单 | 第 46 场双周赛 | +| 1764 | [通过连接另一个数组的子数组得到一个数组](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README.md) | `贪心`,`数组`,`双指针`,`字符串匹配` | 中等 | 第 46 场双周赛 | +| 1765 | [地图中的最高点](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 第 46 场双周赛 | +| 1766 | [互质树](/solution/1700-1799/1766.Tree%20of%20Coprimes/README.md) | `树`,`深度优先搜索`,`数组`,`数学`,`数论` | 困难 | 第 46 场双周赛 | +| 1767 | [寻找没有被执行的任务对](/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README.md) | `数据库` | 困难 | 🔒 | +| 1768 | [交替合并字符串](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README.md) | `双指针`,`字符串` | 简单 | 第 229 场周赛 | +| 1769 | [移动所有球到每个盒子所需的最小操作数](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README.md) | `数组`,`字符串` | 中等 | 第 229 场周赛 | +| 1770 | [执行乘法运算的最大分数](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README.md) | `数组`,`动态规划` | 困难 | 第 229 场周赛 | +| 1771 | [由子序列构造的最长回文串的长度](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README.md) | `字符串`,`动态规划` | 困难 | 第 229 场周赛 | +| 1772 | [按受欢迎程度排列功能](/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 🔒 | +| 1773 | [统计匹配检索规则的物品数量](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README.md) | `数组`,`字符串` | 简单 | 第 230 场周赛 | +| 1774 | [最接近目标价格的甜点成本](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md) | `数组`,`动态规划`,`回溯` | 中等 | 第 230 场周赛 | +| 1775 | [通过最少操作次数使数组的和相等](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README.md) | `贪心`,`数组`,`哈希表`,`计数` | 中等 | 第 230 场周赛 | +| 1776 | [车队 II](/solution/1700-1799/1776.Car%20Fleet%20II/README.md) | `栈`,`数组`,`数学`,`单调栈`,`堆（优先队列）` | 困难 | 第 230 场周赛 | +| 1777 | [每家商店的产品价格](/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README.md) | `数据库` | 简单 | 🔒 | +| 1778 | [未知网格中的最短路径](/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`交互` | 中等 | 🔒 | +| 1779 | [找到最近的有相同 X 或 Y 坐标的点](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README.md) | `数组` | 简单 | 第 47 场双周赛 | +| 1780 | [判断一个数字是否可以表示成三的幂的和](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README.md) | `数学` | 中等 | 第 47 场双周赛 | +| 1781 | [所有子字符串美丽值之和](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 47 场双周赛 | +| 1782 | [统计点对的数目](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README.md) | `图`,`数组`,`双指针`,`二分查找`,`排序` | 困难 | 第 47 场双周赛 | +| 1783 | [大满贯数量](/solution/1700-1799/1783.Grand%20Slam%20Titles/README.md) | `数据库` | 中等 | 🔒 | +| 1784 | [检查二进制字符串字段](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README.md) | `字符串` | 简单 | 第 231 场周赛 | +| 1785 | [构成特定和需要添加的最少元素](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README.md) | `贪心`,`数组` | 中等 | 第 231 场周赛 | +| 1786 | [从第一个节点出发到最后一个节点的受限路径数](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README.md) | `图`,`拓扑排序`,`动态规划`,`最短路`,`堆（优先队列）` | 中等 | 第 231 场周赛 | +| 1787 | [使所有区间的异或结果为零](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README.md) | `位运算`,`数组`,`动态规划` | 困难 | 第 231 场周赛 | +| 1788 | [最大化花园的美观度](/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README.md) | `贪心`,`数组`,`前缀和` | 困难 | 🔒 | +| 1789 | [员工的直属部门](/solution/1700-1799/1789.Primary%20Department%20for%20Each%20Employee/README.md) | `数据库` | 简单 | | +| 1790 | [仅执行一次字符串交换能否使两个字符串相等](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 232 场周赛 | +| 1791 | [找出星型图的中心节点](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README.md) | `图` | 简单 | 第 232 场周赛 | +| 1792 | [最大平均通过率](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 232 场周赛 | +| 1793 | [好子数组的最大分数](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README.md) | `栈`,`数组`,`双指针`,`二分查找`,`单调栈` | 困难 | 第 232 场周赛 | +| 1794 | [统计距离最小的子串对个数](/solution/1700-1799/1794.Count%20Pairs%20of%20Equal%20Substrings%20With%20Minimum%20Difference/README.md) | `贪心`,`哈希表`,`字符串` | 中等 | 🔒 | +| 1795 | [每个产品在不同商店的价格](/solution/1700-1799/1795.Rearrange%20Products%20Table/README.md) | `数据库` | 简单 | | +| 1796 | [字符串中第二大的数字](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README.md) | `哈希表`,`字符串` | 简单 | 第 48 场双周赛 | +| 1797 | [设计一个验证系统](/solution/1700-1799/1797.Design%20Authentication%20Manager/README.md) | `设计`,`哈希表` | 中等 | 第 48 场双周赛 | +| 1798 | [你能构造出连续值的最大数目](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 48 场双周赛 | +| 1799 | [N 次操作后的最大分数和](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README.md) | `位运算`,`数组`,`数学`,`动态规划`,`回溯`,`状态压缩`,`数论` | 困难 | 第 48 场双周赛 | +| 1800 | [最大升序子数组和](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README.md) | `数组` | 简单 | 第 233 场周赛 | +| 1801 | [积压订单中的订单总数](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README.md) | `数组`,`模拟`,`堆（优先队列）` | 中等 | 第 233 场周赛 | +| 1802 | [有界数组中指定下标处的最大值](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README.md) | `贪心`,`二分查找` | 中等 | 第 233 场周赛 | +| 1803 | [统计异或值在范围内的数对有多少](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README.md) | `位运算`,`字典树`,`数组` | 困难 | 第 233 场周赛 | +| 1804 | [实现 Trie （前缀树） II](/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README.md) | `设计`,`字典树`,`哈希表`,`字符串` | 中等 | 🔒 | +| 1805 | [字符串中不同整数的数目](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README.md) | `哈希表`,`字符串` | 简单 | 第 234 场周赛 | +| 1806 | [还原排列的最少操作步数](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README.md) | `数组`,`数学`,`模拟` | 中等 | 第 234 场周赛 | +| 1807 | [替换字符串中的括号内容](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README.md) | `数组`,`哈希表`,`字符串` | 中等 | 第 234 场周赛 | +| 1808 | [好因子的最大数目](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README.md) | `递归`,`数学` | 困难 | 第 234 场周赛 | +| 1809 | [没有广告的剧集](/solution/1800-1899/1809.Ad-Free%20Sessions/README.md) | `数据库` | 简单 | 🔒 | +| 1810 | [隐藏网格下的最小消耗路径](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`交互`,`堆（优先队列）` | 中等 | 🔒 | +| 1811 | [寻找面试候选人](/solution/1800-1899/1811.Find%20Interview%20Candidates/README.md) | `数据库` | 中等 | 🔒 | +| 1812 | [判断国际象棋棋盘中一个格子的颜色](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README.md) | `数学`,`字符串` | 简单 | 第 49 场双周赛 | +| 1813 | [句子相似性 III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README.md) | `数组`,`双指针`,`字符串` | 中等 | 第 49 场双周赛 | +| 1814 | [统计一个数组中好对子的数目](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README.md) | `数组`,`哈希表`,`数学`,`计数` | 中等 | 第 49 场双周赛 | +| 1815 | [得到新鲜甜甜圈的最多组数](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README.md) | `位运算`,`记忆化搜索`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 49 场双周赛 | +| 1816 | [截断句子](/solution/1800-1899/1816.Truncate%20Sentence/README.md) | `数组`,`字符串` | 简单 | 第 235 场周赛 | +| 1817 | [查找用户活跃分钟数](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README.md) | `数组`,`哈希表` | 中等 | 第 235 场周赛 | +| 1818 | [绝对差值和](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README.md) | `数组`,`二分查找`,`有序集合`,`排序` | 中等 | 第 235 场周赛 | +| 1819 | [序列中不同最大公约数的数目](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README.md) | `数组`,`数学`,`计数`,`数论` | 困难 | 第 235 场周赛 | +| 1820 | [最多邀请的个数](/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README.md) | `数组`,`回溯`,`矩阵` | 中等 | 🔒 | +| 1821 | [寻找今年具有正收入的客户](/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README.md) | `数据库` | 简单 | 🔒 | +| 1822 | [数组元素积的符号](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README.md) | `数组`,`数学` | 简单 | 第 236 场周赛 | +| 1823 | [找出游戏的获胜者](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README.md) | `递归`,`队列`,`数组`,`数学`,`模拟` | 中等 | 第 236 场周赛 | +| 1824 | [最少侧跳次数](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README.md) | `贪心`,`数组`,`动态规划` | 中等 | 第 236 场周赛 | +| 1825 | [求出 MK 平均值](/solution/1800-1899/1825.Finding%20MK%20Average/README.md) | `设计`,`队列`,`数据流`,`有序集合`,`堆（优先队列）` | 困难 | 第 236 场周赛 | +| 1826 | [有缺陷的传感器](/solution/1800-1899/1826.Faulty%20Sensor/README.md) | `数组`,`双指针` | 简单 | 🔒 | +| 1827 | [最少操作使数组递增](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README.md) | `贪心`,`数组` | 简单 | 第 50 场双周赛 | +| 1828 | [统计一个圆中点的数目](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README.md) | `几何`,`数组`,`数学` | 中等 | 第 50 场双周赛 | +| 1829 | [每个查询的最大异或值](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README.md) | `位运算`,`数组`,`前缀和` | 中等 | 第 50 场双周赛 | +| 1830 | [使字符串有序的最少操作次数](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README.md) | `数学`,`字符串`,`组合数学` | 困难 | 第 50 场双周赛 | +| 1831 | [每天的最大交易](/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README.md) | `数据库` | 中等 | 🔒 | +| 1832 | [判断句子是否为全字母句](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README.md) | `哈希表`,`字符串` | 简单 | 第 237 场周赛 | +| 1833 | [雪糕的最大数量](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 237 场周赛 | +| 1834 | [单线程 CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README.md) | `数组`,`排序`,`堆（优先队列）` | 中等 | 第 237 场周赛 | +| 1835 | [所有数对按位与结果的异或和](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README.md) | `位运算`,`数组`,`数学` | 困难 | 第 237 场周赛 | +| 1836 | [从未排序的链表中移除重复元素](/solution/1800-1899/1836.Remove%20Duplicates%20From%20an%20Unsorted%20Linked%20List/README.md) | `哈希表`,`链表` | 中等 | 🔒 | +| 1837 | [K 进制表示下的各位数字总和](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README.md) | `数学` | 简单 | 第 238 场周赛 | +| 1838 | [最高频元素的频数](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README.md) | `贪心`,`数组`,`二分查找`,`前缀和`,`排序`,`滑动窗口` | 中等 | 第 238 场周赛 | +| 1839 | [所有元音按顺序排布的最长子字符串](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README.md) | `字符串`,`滑动窗口` | 中等 | 第 238 场周赛 | +| 1840 | [最高建筑高度](/solution/1800-1899/1840.Maximum%20Building%20Height/README.md) | `数组`,`数学`,`排序` | 困难 | 第 238 场周赛 | +| 1841 | [联赛信息统计](/solution/1800-1899/1841.League%20Statistics/README.md) | `数据库` | 中等 | 🔒 | +| 1842 | [下个由相同数字构成的回文串](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README.md) | `双指针`,`字符串` | 困难 | 🔒 | +| 1843 | [可疑银行账户](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README.md) | `数据库` | 中等 | 🔒 | +| 1844 | [将所有数字用字符替换](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README.md) | `字符串` | 简单 | 第 51 场双周赛 | +| 1845 | [座位预约管理系统](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README.md) | `设计`,`堆（优先队列）` | 中等 | 第 51 场双周赛 | +| 1846 | [减小和重新排列数组后的最大元素](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 51 场双周赛 | +| 1847 | [最近的房间](/solution/1800-1899/1847.Closest%20Room/README.md) | `数组`,`二分查找`,`排序` | 困难 | 第 51 场双周赛 | +| 1848 | [到目标元素的最小距离](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README.md) | `数组` | 简单 | 第 239 场周赛 | +| 1849 | [将字符串拆分为递减的连续值](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README.md) | `字符串`,`回溯` | 中等 | 第 239 场周赛 | +| 1850 | [邻位交换的最小次数](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README.md) | `贪心`,`双指针`,`字符串` | 中等 | 第 239 场周赛 | +| 1851 | [包含每个查询的最小区间](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README.md) | `数组`,`二分查找`,`排序`,`扫描线`,`堆（优先队列）` | 困难 | 第 239 场周赛 | +| 1852 | [每个子数组的数字种类数](/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 🔒 | +| 1853 | [转换日期格式](/solution/1800-1899/1853.Convert%20Date%20Format/README.md) | `数据库` | 简单 | 🔒 | +| 1854 | [人口最多的年份](/solution/1800-1899/1854.Maximum%20Population%20Year/README.md) | `数组`,`计数`,`前缀和` | 简单 | 第 240 场周赛 | +| 1855 | [下标对中的最大距离](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README.md) | `数组`,`双指针`,`二分查找` | 中等 | 第 240 场周赛 | +| 1856 | [子数组最小乘积的最大值](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README.md) | `栈`,`数组`,`前缀和`,`单调栈` | 中等 | 第 240 场周赛 | +| 1857 | [有向图中最大颜色值](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README.md) | `图`,`拓扑排序`,`记忆化搜索`,`哈希表`,`动态规划`,`计数` | 困难 | 第 240 场周赛 | +| 1858 | [包含所有前缀的最长单词](/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README.md) | `深度优先搜索`,`字典树` | 中等 | 🔒 | +| 1859 | [将句子排序](/solution/1800-1899/1859.Sorting%20the%20Sentence/README.md) | `字符串`,`排序` | 简单 | 第 52 场双周赛 | +| 1860 | [增长的内存泄露](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README.md) | `数学`,`模拟` | 中等 | 第 52 场双周赛 | +| 1861 | [旋转盒子](/solution/1800-1899/1861.Rotating%20the%20Box/README.md) | `数组`,`双指针`,`矩阵` | 中等 | 第 52 场双周赛 | +| 1862 | [向下取整数对和](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README.md) | `数组`,`数学`,`二分查找`,`前缀和` | 困难 | 第 52 场双周赛 | +| 1863 | [找出所有子集的异或总和再求和](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README.md) | `位运算`,`数组`,`数学`,`回溯`,`组合数学`,`枚举` | 简单 | 第 241 场周赛 | +| 1864 | [构成交替字符串需要的最小交换次数](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README.md) | `贪心`,`字符串` | 中等 | 第 241 场周赛 | +| 1865 | [找出和为指定值的下标对](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README.md) | `设计`,`数组`,`哈希表` | 中等 | 第 241 场周赛 | +| 1866 | [恰有 K 根木棍可以看到的排列数目](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README.md) | `数学`,`动态规划`,`组合数学` | 困难 | 第 241 场周赛 | +| 1867 | [最大数量高于平均水平的订单](/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README.md) | `数据库` | 中等 | 🔒 | +| 1868 | [两个行程编码数组的积](/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README.md) | `数组`,`双指针` | 中等 | 🔒 | +| 1869 | [哪种连续子字符串更长](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README.md) | `字符串` | 简单 | 第 242 场周赛 | +| 1870 | [准时到达的列车最小时速](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md) | `数组`,`二分查找` | 中等 | 第 242 场周赛 | +| 1871 | [跳跃游戏 VII](/solution/1800-1899/1871.Jump%20Game%20VII/README.md) | `字符串`,`动态规划`,`前缀和`,`滑动窗口` | 中等 | 第 242 场周赛 | +| 1872 | [石子游戏 VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README.md) | `数组`,`数学`,`动态规划`,`博弈`,`前缀和` | 困难 | 第 242 场周赛 | +| 1873 | [计算特殊奖金](/solution/1800-1899/1873.Calculate%20Special%20Bonus/README.md) | `数据库` | 简单 | | +| 1874 | [两个数组的最小乘积和](/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | +| 1875 | [将工资相同的雇员分组](/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README.md) | `数据库` | 中等 | 🔒 | +| 1876 | [长度为三且各字符不同的子字符串](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README.md) | `哈希表`,`字符串`,`计数`,`滑动窗口` | 简单 | 第 53 场双周赛 | +| 1877 | [数组中最大数对和的最小值](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 53 场双周赛 | +| 1878 | [矩阵中最大的三个菱形和](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README.md) | `数组`,`数学`,`矩阵`,`前缀和`,`排序`,`堆（优先队列）` | 中等 | 第 53 场双周赛 | +| 1879 | [两个数组最小的异或值之和](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 53 场双周赛 | +| 1880 | [检查某单词是否等于两单词之和](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README.md) | `字符串` | 简单 | 第 243 场周赛 | +| 1881 | [插入后的最大值](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README.md) | `贪心`,`字符串` | 中等 | 第 243 场周赛 | +| 1882 | [使用服务器处理任务](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md) | `数组`,`堆（优先队列）` | 中等 | 第 243 场周赛 | +| 1883 | [准时抵达会议现场的最小跳过休息次数](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README.md) | `数组`,`动态规划` | 困难 | 第 243 场周赛 | +| 1884 | [鸡蛋掉落-两枚鸡蛋](/solution/1800-1899/1884.Egg%20Drop%20With%202%20Eggs%20and%20N%20Floors/README.md) | `数学`,`动态规划` | 中等 | | +| 1885 | [统计数对](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 🔒 | +| 1886 | [判断矩阵经轮转后是否一致](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README.md) | `数组`,`矩阵` | 简单 | 第 244 场周赛 | +| 1887 | [使数组元素相等的减少操作次数](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README.md) | `数组`,`排序` | 中等 | 第 244 场周赛 | +| 1888 | [使二进制字符串字符交替的最少反转次数](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README.md) | `贪心`,`字符串`,`动态规划`,`滑动窗口` | 中等 | 第 244 场周赛 | +| 1889 | [装包裹的最小浪费空间](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README.md) | `数组`,`二分查找`,`前缀和`,`排序` | 困难 | 第 244 场周赛 | +| 1890 | [2020 年最后一次登录](/solution/1800-1899/1890.The%20Latest%20Login%20in%202020/README.md) | `数据库` | 简单 | | +| 1891 | [割绳子](/solution/1800-1899/1891.Cutting%20Ribbons/README.md) | `数组`,`二分查找` | 中等 | 🔒 | +| 1892 | [页面推荐 Ⅱ](/solution/1800-1899/1892.Page%20Recommendations%20II/README.md) | `数据库` | 困难 | 🔒 | +| 1893 | [检查是否区域内所有整数都被覆盖](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README.md) | `数组`,`哈希表`,`前缀和` | 简单 | 第 54 场双周赛 | +| 1894 | [找到需要补充粉笔的学生编号](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md) | `数组`,`二分查找`,`前缀和`,`模拟` | 中等 | 第 54 场双周赛 | +| 1895 | [最大的幻方](/solution/1800-1899/1895.Largest%20Magic%20Square/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 54 场双周赛 | +| 1896 | [反转表达式值的最少操作次数](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README.md) | `栈`,`数学`,`字符串`,`动态规划` | 困难 | 第 54 场双周赛 | +| 1897 | [重新分配字符使所有字符串都相等](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 245 场周赛 | +| 1898 | [可移除字符的最大数目](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md) | `数组`,`双指针`,`字符串`,`二分查找` | 中等 | 第 245 场周赛 | +| 1899 | [合并若干三元组以形成目标三元组](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README.md) | `贪心`,`数组` | 中等 | 第 245 场周赛 | +| 1900 | [最佳运动员的比拼回合](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README.md) | `记忆化搜索`,`动态规划` | 困难 | 第 245 场周赛 | +| 1901 | [寻找峰值 II](/solution/1900-1999/1901.Find%20a%20Peak%20Element%20II/README.md) | `数组`,`二分查找`,`矩阵` | 中等 | | +| 1902 | [给定二叉搜索树的插入顺序求深度](/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README.md) | `树`,`二叉搜索树`,`二叉树`,`有序集合` | 中等 | 🔒 | +| 1903 | [字符串中的最大奇数](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README.md) | `贪心`,`数学`,`字符串` | 简单 | 第 246 场周赛 | +| 1904 | [你完成的完整对局数](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README.md) | `数学`,`字符串` | 中等 | 第 246 场周赛 | +| 1905 | [统计子岛屿](/solution/1900-1999/1905.Count%20Sub%20Islands/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 246 场周赛 | +| 1906 | [查询差绝对值的最小值](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README.md) | `数组`,`哈希表` | 中等 | 第 246 场周赛 | +| 1907 | [按分类统计薪水](/solution/1900-1999/1907.Count%20Salary%20Categories/README.md) | `数据库` | 中等 | | +| 1908 | [Nim 游戏 II](/solution/1900-1999/1908.Game%20of%20Nim/README.md) | `位运算`,`脑筋急转弯`,`数组`,`数学`,`动态规划`,`博弈` | 中等 | 🔒 | +| 1909 | [删除一个元素使数组严格递增](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README.md) | `数组` | 简单 | 第 55 场双周赛 | +| 1910 | [删除一个字符串中所有出现的给定子字符串](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README.md) | `字符串` | 中等 | 第 55 场双周赛 | +| 1911 | [最大子序列交替和](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README.md) | `数组`,`动态规划` | 中等 | 第 55 场双周赛 | +| 1912 | [设计电影租借系统](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README.md) | `设计`,`数组`,`哈希表`,`有序集合`,`堆（优先队列）` | 困难 | 第 55 场双周赛 | +| 1913 | [两个数对之间的最大乘积差](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README.md) | `数组`,`排序` | 简单 | 第 247 场周赛 | +| 1914 | [循环轮转矩阵](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 247 场周赛 | +| 1915 | [最美子字符串的数目](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README.md) | `位运算`,`哈希表`,`字符串`,`前缀和` | 中等 | 第 247 场周赛 | +| 1916 | [统计为蚁群构筑房间的不同顺序](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README.md) | `树`,`图`,`拓扑排序`,`数学`,`动态规划`,`组合数学` | 困难 | 第 247 场周赛 | +| 1917 | [Leetcodify 好友推荐](/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README.md) | `数据库` | 困难 | 🔒 | +| 1918 | [第 K 小的子数组和](/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README.md) | `数组`,`二分查找`,`滑动窗口` | 中等 | 🔒 | +| 1919 | [兴趣相同的朋友](/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README.md) | `数据库` | 困难 | 🔒 | +| 1920 | [基于排列构建数组](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README.md) | `数组`,`模拟` | 简单 | 第 248 场周赛 | +| 1921 | [消灭怪物的最大数量](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 248 场周赛 | +| 1922 | [统计好数字的数目](/solution/1900-1999/1922.Count%20Good%20Numbers/README.md) | `递归`,`数学` | 中等 | 第 248 场周赛 | +| 1923 | [最长公共子路径](/solution/1900-1999/1923.Longest%20Common%20Subpath/README.md) | `数组`,`二分查找`,`后缀数组`,`哈希函数`,`滚动哈希` | 困难 | 第 248 场周赛 | +| 1924 | [安装栅栏 II](/solution/1900-1999/1924.Erect%20the%20Fence%20II/README.md) | `几何`,`数组`,`数学` | 困难 | 🔒 | +| 1925 | [统计平方和三元组的数目](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README.md) | `数学`,`枚举` | 简单 | 第 56 场双周赛 | +| 1926 | [迷宫中离入口最近的出口](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README.md) | `广度优先搜索`,`数组`,`矩阵` | 中等 | 第 56 场双周赛 | +| 1927 | [求和游戏](/solution/1900-1999/1927.Sum%20Game/README.md) | `贪心`,`数学`,`字符串`,`博弈` | 中等 | 第 56 场双周赛 | +| 1928 | [规定时间内到达终点的最小花费](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README.md) | `图`,`数组`,`动态规划` | 困难 | 第 56 场双周赛 | +| 1929 | [数组串联](/solution/1900-1999/1929.Concatenation%20of%20Array/README.md) | `数组`,`模拟` | 简单 | 第 249 场周赛 | +| 1930 | [长度为 3 的不同回文子序列](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README.md) | `位运算`,`哈希表`,`字符串`,`前缀和` | 中等 | 第 249 场周赛 | +| 1931 | [用三种不同颜色为网格涂色](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README.md) | `动态规划` | 困难 | 第 249 场周赛 | +| 1932 | [合并多棵二叉搜索树](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README.md) | `树`,`深度优先搜索`,`哈希表`,`二分查找`,`二叉树` | 困难 | 第 249 场周赛 | +| 1933 | [判断字符串是否可分解为值均等的子串](/solution/1900-1999/1933.Check%20if%20String%20Is%20Decomposable%20Into%20Value-Equal%20Substrings/README.md) | `字符串` | 简单 | 🔒 | +| 1934 | [确认率](/solution/1900-1999/1934.Confirmation%20Rate/README.md) | `数据库` | 中等 | | +| 1935 | [可以输入的最大单词数](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README.md) | `哈希表`,`字符串` | 简单 | 第 250 场周赛 | +| 1936 | [新增的最少台阶数](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README.md) | `贪心`,`数组` | 中等 | 第 250 场周赛 | +| 1937 | [扣分后的最大得分](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README.md) | `数组`,`动态规划` | 中等 | 第 250 场周赛 | +| 1938 | [查询最大基因差](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README.md) | `位运算`,`字典树`,`数组` | 困难 | 第 250 场周赛 | +| 1939 | [主动请求确认消息的用户](/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README.md) | `数据库` | 简单 | 🔒 | +| 1940 | [排序数组之间的最长公共子序列](/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README.md) | `数组`,`哈希表`,`计数` | 中等 | 🔒 | +| 1941 | [检查是否所有字符出现次数相同](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 57 场双周赛 | +| 1942 | [最小未被占据椅子的编号](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README.md) | `数组`,`哈希表`,`堆（优先队列）` | 中等 | 第 57 场双周赛 | +| 1943 | [描述绘画结果](/solution/1900-1999/1943.Describe%20the%20Painting/README.md) | `数组`,`哈希表`,`前缀和`,`排序` | 中等 | 第 57 场双周赛 | +| 1944 | [队列中可以看到的人数](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README.md) | `栈`,`数组`,`单调栈` | 困难 | 第 57 场双周赛 | +| 1945 | [字符串转化后的各位数字之和](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README.md) | `字符串`,`模拟` | 简单 | 第 251 场周赛 | +| 1946 | [子字符串突变后可能得到的最大整数](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README.md) | `贪心`,`数组`,`字符串` | 中等 | 第 251 场周赛 | +| 1947 | [最大兼容性评分和](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | 第 251 场周赛 | +| 1948 | [删除系统中的重复文件夹](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`哈希函数` | 困难 | 第 251 场周赛 | +| 1949 | [坚定的友谊](/solution/1900-1999/1949.Strong%20Friendship/README.md) | `数据库` | 中等 | 🔒 | +| 1950 | [所有子数组最小值中的最大值](/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README.md) | `栈`,`数组`,`单调栈` | 中等 | 🔒 | +| 1951 | [查询具有最多共同关注者的所有两两结对组](/solution/1900-1999/1951.All%20the%20Pairs%20With%20the%20Maximum%20Number%20of%20Common%20Followers/README.md) | `数据库` | 中等 | 🔒 | +| 1952 | [三除数](/solution/1900-1999/1952.Three%20Divisors/README.md) | `数学`,`枚举`,`数论` | 简单 | 第 252 场周赛 | +| 1953 | [你可以工作的最大周数](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README.md) | `贪心`,`数组` | 中等 | 第 252 场周赛 | +| 1954 | [收集足够苹果的最小花园周长](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README.md) | `数学`,`二分查找` | 中等 | 第 252 场周赛 | +| 1955 | [统计特殊子序列的数目](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README.md) | `数组`,`动态规划` | 困难 | 第 252 场周赛 | +| 1956 | [感染 K 种病毒所需的最短时间](/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README.md) | `几何`,`数组`,`数学`,`二分查找`,`枚举` | 困难 | 🔒 | +| 1957 | [删除字符使字符串变好](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README.md) | `字符串` | 简单 | 第 58 场双周赛 | +| 1958 | [检查操作是否合法](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README.md) | `数组`,`枚举`,`矩阵` | 中等 | 第 58 场双周赛 | +| 1959 | [K 次调整数组大小浪费的最小总空间](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README.md) | `数组`,`动态规划` | 中等 | 第 58 场双周赛 | +| 1960 | [两个回文子字符串长度的最大乘积](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README.md) | `字符串`,`哈希函数`,`滚动哈希` | 困难 | 第 58 场双周赛 | +| 1961 | [检查字符串是否为数组前缀](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README.md) | `数组`,`双指针`,`字符串` | 简单 | 第 253 场周赛 | +| 1962 | [移除石子使总数最小](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 253 场周赛 | +| 1963 | [使字符串平衡的最小交换次数](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README.md) | `栈`,`贪心`,`双指针`,`字符串` | 中等 | 第 253 场周赛 | +| 1964 | [找出到每个位置为止最长的有效障碍赛跑路线](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README.md) | `树状数组`,`数组`,`二分查找` | 困难 | 第 253 场周赛 | +| 1965 | [丢失信息的雇员](/solution/1900-1999/1965.Employees%20With%20Missing%20Information/README.md) | `数据库` | 简单 | | +| 1966 | [未排序数组中的可被二分搜索的数](/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README.md) | `数组`,`二分查找` | 中等 | 🔒 | +| 1967 | [作为子字符串出现在单词中的字符串数目](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README.md) | `字符串` | 简单 | 第 254 场周赛 | +| 1968 | [构造元素不等于两相邻元素平均值的数组](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 254 场周赛 | +| 1969 | [数组元素的最小非零乘积](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README.md) | `贪心`,`递归`,`数学` | 中等 | 第 254 场周赛 | +| 1970 | [你能穿过矩阵的最后一天](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`二分查找`,`矩阵` | 困难 | 第 254 场周赛 | +| 1971 | [寻找图中是否存在路径](/solution/1900-1999/1971.Find%20if%20Path%20Exists%20in%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 简单 | | +| 1972 | [同一天的第一个电话和最后一个电话](/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README.md) | `数据库` | 困难 | 🔒 | +| 1973 | [值等于子节点值之和的节点数量](/solution/1900-1999/1973.Count%20Nodes%20Equal%20to%20Sum%20of%20Descendants/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | +| 1974 | [使用特殊打字机键入单词的最少时间](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README.md) | `贪心`,`字符串` | 简单 | 第 59 场双周赛 | +| 1975 | [最大方阵和](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README.md) | `贪心`,`数组`,`矩阵` | 中等 | 第 59 场双周赛 | +| 1976 | [到达目的地的方案数](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README.md) | `图`,`拓扑排序`,`动态规划`,`最短路` | 中等 | 第 59 场双周赛 | +| 1977 | [划分数字的方案数](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README.md) | `字符串`,`动态规划`,`后缀数组` | 困难 | 第 59 场双周赛 | +| 1978 | [上级经理已离职的公司员工](/solution/1900-1999/1978.Employees%20Whose%20Manager%20Left%20the%20Company/README.md) | `数据库` | 简单 | | +| 1979 | [找出数组的最大公约数](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README.md) | `数组`,`数学`,`数论` | 简单 | 第 255 场周赛 | +| 1980 | [找出不同的二进制字符串](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README.md) | `数组`,`哈希表`,`字符串`,`回溯` | 中等 | 第 255 场周赛 | +| 1981 | [最小化目标值与所选元素的差](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 255 场周赛 | +| 1982 | [从子集的和还原数组](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README.md) | `数组`,`分治` | 困难 | 第 255 场周赛 | +| 1983 | [范围和相等的最宽索引对](/solution/1900-1999/1983.Widest%20Pair%20of%20Indices%20With%20Equal%20Range%20Sum/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 🔒 | +| 1984 | [学生分数的最小差值](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README.md) | `数组`,`排序`,`滑动窗口` | 简单 | 第 256 场周赛 | +| 1985 | [找出数组中的第 K 大整数](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README.md) | `数组`,`字符串`,`分治`,`快速选择`,`排序`,`堆（优先队列）` | 中等 | 第 256 场周赛 | +| 1986 | [完成任务的最少工作时间段](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | 第 256 场周赛 | +| 1987 | [不同的好子序列数目](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README.md) | `字符串`,`动态规划` | 困难 | 第 256 场周赛 | +| 1988 | [找出每所学校的最低分数要求](/solution/1900-1999/1988.Find%20Cutoff%20Score%20for%20Each%20School/README.md) | `数据库` | 中等 | 🔒 | +| 1989 | [捉迷藏中可捕获的最大人数](/solution/1900-1999/1989.Maximum%20Number%20of%20People%20That%20Can%20Be%20Caught%20in%20Tag/README.md) | `贪心`,`数组` | 中等 | 🔒 | +| 1990 | [统计实验的数量](/solution/1900-1999/1990.Count%20the%20Number%20of%20Experiments/README.md) | `数据库` | 中等 | 🔒 | +| 1991 | [找到数组的中间位置](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md) | `数组`,`前缀和` | 简单 | 第 60 场双周赛 | +| 1992 | [找到所有的农场组](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵` | 中等 | 第 60 场双周赛 | +| 1993 | [树上的操作](/solution/1900-1999/1993.Operations%20on%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`设计`,`数组`,`哈希表` | 中等 | 第 60 场双周赛 | +| 1994 | [好子集的数目](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README.md) | `位运算`,`数组`,`数学`,`动态规划`,`状态压缩` | 困难 | 第 60 场双周赛 | +| 1995 | [统计特殊四元组](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README.md) | `数组`,`哈希表`,`枚举` | 简单 | 第 257 场周赛 | +| 1996 | [游戏中弱角色的数量](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README.md) | `栈`,`贪心`,`数组`,`排序`,`单调栈` | 中等 | 第 257 场周赛 | +| 1997 | [访问完所有房间的第一天](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README.md) | `数组`,`动态规划` | 中等 | 第 257 场周赛 | +| 1998 | [数组的最大公因数排序](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README.md) | `并查集`,`数组`,`数学`,`数论`,`排序` | 困难 | 第 257 场周赛 | +| 1999 | [最小的仅由两个数组成的倍数](/solution/1900-1999/1999.Smallest%20Greater%20Multiple%20Made%20of%20Two%20Digits/README.md) | `数学`,`枚举` | 中等 | 🔒 | +| 2000 | [反转单词前缀](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README.md) | `双指针`,`字符串` | 简单 | 第 258 场周赛 | +| 2001 | [可互换矩形的组数](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README.md) | `数组`,`哈希表`,`数学`,`计数`,`数论` | 中等 | 第 258 场周赛 | +| 2002 | [两个回文子序列长度的最大乘积](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README.md) | `位运算`,`字符串`,`动态规划`,`回溯`,`状态压缩` | 中等 | 第 258 场周赛 | +| 2003 | [每棵子树内缺失的最小基因值](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README.md) | `树`,`深度优先搜索`,`并查集`,`动态规划` | 困难 | 第 258 场周赛 | +| 2004 | [职员招聘人数](/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README.md) | `数据库` | 困难 | 🔒 | +| 2005 | [斐波那契树的移除子树游戏](/solution/2000-2099/2005.Subtree%20Removal%20Game%20with%20Fibonacci%20Tree/README.md) | `树`,`数学`,`动态规划`,`二叉树`,`博弈` | 困难 | 🔒 | +| 2006 | [差的绝对值为 K 的数对数目](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 61 场双周赛 | +| 2007 | [从双倍数组中还原原数组](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README.md) | `贪心`,`数组`,`哈希表`,`排序` | 中等 | 第 61 场双周赛 | +| 2008 | [出租车的最大盈利](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md) | `数组`,`哈希表`,`二分查找`,`动态规划`,`排序` | 中等 | 第 61 场双周赛 | +| 2009 | [使数组连续的最少操作数](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README.md) | `数组`,`哈希表`,`二分查找`,`滑动窗口` | 困难 | 第 61 场双周赛 | +| 2010 | [职员招聘人数 II](/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README.md) | `数据库` | 困难 | 🔒 | +| 2011 | [执行操作后的变量值](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README.md) | `数组`,`字符串`,`模拟` | 简单 | 第 259 场周赛 | +| 2012 | [数组美丽值求和](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README.md) | `数组` | 中等 | 第 259 场周赛 | +| 2013 | [检测正方形](/solution/2000-2099/2013.Detect%20Squares/README.md) | `设计`,`数组`,`哈希表`,`计数` | 中等 | 第 259 场周赛 | +| 2014 | [重复 K 次的最长子序列](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README.md) | `贪心`,`字符串`,`回溯`,`计数`,`枚举` | 困难 | 第 259 场周赛 | +| 2015 | [每段建筑物的平均高度](/solution/2000-2099/2015.Average%20Height%20of%20Buildings%20in%20Each%20Segment/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 中等 | 🔒 | +| 2016 | [增量元素之间的最大差值](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README.md) | `数组` | 简单 | 第 260 场周赛 | +| 2017 | [网格游戏](/solution/2000-2099/2017.Grid%20Game/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 260 场周赛 | +| 2018 | [判断单词是否能放入填字游戏内](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README.md) | `数组`,`枚举`,`矩阵` | 中等 | 第 260 场周赛 | +| 2019 | [解出数学表达式的学生分数](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README.md) | `栈`,`记忆化搜索`,`数组`,`数学`,`字符串`,`动态规划` | 困难 | 第 260 场周赛 | +| 2020 | [无流量的帐户数](/solution/2000-2099/2020.Number%20of%20Accounts%20That%20Did%20Not%20Stream/README.md) | `数据库` | 中等 | 🔒 | +| 2021 | [街上最亮的位置](/solution/2000-2099/2021.Brightest%20Position%20on%20Street/README.md) | `数组`,`有序集合`,`前缀和` | 中等 | 🔒 | +| 2022 | [将一维数组转变成二维数组](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README.md) | `数组`,`矩阵`,`模拟` | 简单 | 第 62 场双周赛 | +| 2023 | [连接后等于目标字符串的字符串对](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 中等 | 第 62 场双周赛 | +| 2024 | [考试的最大困扰度](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README.md) | `字符串`,`二分查找`,`前缀和`,`滑动窗口` | 中等 | 第 62 场双周赛 | +| 2025 | [分割数组的最多方案数](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README.md) | `数组`,`哈希表`,`计数`,`枚举`,`前缀和` | 困难 | 第 62 场双周赛 | +| 2026 | [低质量的问题](/solution/2000-2099/2026.Low-Quality%20Problems/README.md) | `数据库` | 简单 | 🔒 | +| 2027 | [转换字符串的最少操作次数](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README.md) | `贪心`,`字符串` | 简单 | 第 261 场周赛 | +| 2028 | [找出缺失的观测数据](/solution/2000-2099/2028.Find%20Missing%20Observations/README.md) | `数组`,`数学`,`模拟` | 中等 | 第 261 场周赛 | +| 2029 | [石子游戏 IX](/solution/2000-2099/2029.Stone%20Game%20IX/README.md) | `贪心`,`数组`,`数学`,`计数`,`博弈` | 中等 | 第 261 场周赛 | +| 2030 | [含特定字母的最小子序列](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README.md) | `栈`,`贪心`,`字符串`,`单调栈` | 困难 | 第 261 场周赛 | +| 2031 | [1 比 0 多的子数组个数](/solution/2000-2099/2031.Count%20Subarrays%20With%20More%20Ones%20Than%20Zeros/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 中等 | 🔒 | +| 2032 | [至少在两个数组中出现的值](/solution/2000-2099/2032.Two%20Out%20of%20Three/README.md) | `位运算`,`数组`,`哈希表` | 简单 | 第 262 场周赛 | +| 2033 | [获取单值网格的最小操作数](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README.md) | `数组`,`数学`,`矩阵`,`排序` | 中等 | 第 262 场周赛 | +| 2034 | [股票价格波动](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README.md) | `设计`,`哈希表`,`数据流`,`有序集合`,`堆（优先队列）` | 中等 | 第 262 场周赛 | +| 2035 | [将数组分成两个数组并最小化数组和的差](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README.md) | `位运算`,`数组`,`双指针`,`二分查找`,`动态规划`,`状态压缩`,`有序集合` | 困难 | 第 262 场周赛 | +| 2036 | [最大交替子数组和](/solution/2000-2099/2036.Maximum%20Alternating%20Subarray%20Sum/README.md) | `数组`,`动态规划` | 中等 | 🔒 | +| 2037 | [使每位学生都有座位的最少移动次数](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 63 场双周赛 | +| 2038 | [如果相邻两个颜色均相同则删除当前颜色](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README.md) | `贪心`,`数学`,`字符串`,`博弈` | 中等 | 第 63 场双周赛 | +| 2039 | [网络空闲的时刻](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README.md) | `广度优先搜索`,`图`,`数组` | 中等 | 第 63 场双周赛 | +| 2040 | [两个有序数组的第 K 小乘积](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README.md) | `数组`,`二分查找` | 困难 | 第 63 场双周赛 | +| 2041 | [面试中被录取的候选人](/solution/2000-2099/2041.Accepted%20Candidates%20From%20the%20Interviews/README.md) | `数据库` | 中等 | 🔒 | +| 2042 | [检查句子中的数字是否递增](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README.md) | `字符串` | 简单 | 第 263 场周赛 | +| 2043 | [简易银行系统](/solution/2000-2099/2043.Simple%20Bank%20System/README.md) | `设计`,`数组`,`哈希表`,`模拟` | 中等 | 第 263 场周赛 | +| 2044 | [统计按位或能得到最大值的子集数目](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README.md) | `位运算`,`数组`,`回溯`,`枚举` | 中等 | 第 263 场周赛 | +| 2045 | [到达目的地的第二短时间](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README.md) | `广度优先搜索`,`图`,`最短路` | 困难 | 第 263 场周赛 | +| 2046 | [给按照绝对值排序的链表排序](/solution/2000-2099/2046.Sort%20Linked%20List%20Already%20Sorted%20Using%20Absolute%20Values/README.md) | `链表`,`双指针`,`排序` | 中等 | 🔒 | +| 2047 | [句子中的有效单词数](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README.md) | `字符串` | 简单 | 第 264 场周赛 | +| 2048 | [下一个更大的数值平衡数](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README.md) | `数学`,`回溯`,`枚举` | 中等 | 第 264 场周赛 | +| 2049 | [统计最高分的节点数目](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README.md) | `树`,`深度优先搜索`,`数组`,`二叉树` | 中等 | 第 264 场周赛 | +| 2050 | [并行课程 III](/solution/2000-2099/2050.Parallel%20Courses%20III/README.md) | `图`,`拓扑排序`,`数组`,`动态规划` | 困难 | 第 264 场周赛 | +| 2051 | [商店中每个成员的级别](/solution/2000-2099/2051.The%20Category%20of%20Each%20Member%20in%20the%20Store/README.md) | `数据库` | 中等 | 🔒 | +| 2052 | [将句子分隔成行的最低成本](/solution/2000-2099/2052.Minimum%20Cost%20to%20Separate%20Sentence%20Into%20Rows/README.md) | `数组`,`动态规划` | 中等 | 🔒 | +| 2053 | [数组中第 K 个独一无二的字符串](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 简单 | 第 64 场双周赛 | +| 2054 | [两个最好的不重叠活动](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README.md) | `数组`,`二分查找`,`动态规划`,`排序`,`堆（优先队列）` | 中等 | 第 64 场双周赛 | +| 2055 | [蜡烛之间的盘子](/solution/2000-2099/2055.Plates%20Between%20Candles/README.md) | `数组`,`字符串`,`二分查找`,`前缀和` | 中等 | 第 64 场双周赛 | +| 2056 | [棋盘上有效移动组合的数目](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README.md) | `数组`,`字符串`,`回溯`,`模拟` | 困难 | 第 64 场双周赛 | +| 2057 | [值相等的最小索引](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README.md) | `数组` | 简单 | 第 265 场周赛 | +| 2058 | [找出临界点之间的最小和最大距离](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README.md) | `链表` | 中等 | 第 265 场周赛 | +| 2059 | [转化数字的最小运算数](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README.md) | `广度优先搜索`,`数组` | 中等 | 第 265 场周赛 | +| 2060 | [同源字符串检测](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README.md) | `字符串`,`动态规划` | 困难 | 第 265 场周赛 | +| 2061 | [扫地机器人清扫过的空间个数](/solution/2000-2099/2061.Number%20of%20Spaces%20Cleaning%20Robot%20Cleaned/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 🔒 | +| 2062 | [统计字符串中的元音子字符串](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README.md) | `哈希表`,`字符串` | 简单 | 第 266 场周赛 | +| 2063 | [所有子字符串中的元音](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README.md) | `数学`,`字符串`,`动态规划`,`组合数学` | 中等 | 第 266 场周赛 | +| 2064 | [分配给商店的最多商品的最小值](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README.md) | `数组`,`二分查找` | 中等 | 第 266 场周赛 | +| 2065 | [最大化一张图中的路径价值](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README.md) | `图`,`数组`,`回溯` | 困难 | 第 266 场周赛 | +| 2066 | [账户余额](/solution/2000-2099/2066.Account%20Balance/README.md) | `数据库` | 中等 | 🔒 | +| 2067 | [等计数子串的数量](/solution/2000-2099/2067.Number%20of%20Equal%20Count%20Substrings/README.md) | `字符串`,`计数`,`前缀和` | 中等 | 🔒 | +| 2068 | [检查两个字符串是否几乎相等](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 65 场双周赛 | +| 2069 | [模拟行走机器人 II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README.md) | `设计`,`模拟` | 中等 | 第 65 场双周赛 | +| 2070 | [每一个查询的最大美丽值](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README.md) | `数组`,`二分查找`,`排序` | 中等 | 第 65 场双周赛 | +| 2071 | [你可以安排的最多任务数目](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README.md) | `贪心`,`队列`,`数组`,`二分查找`,`排序`,`单调队列` | 困难 | 第 65 场双周赛 | +| 2072 | [赢得比赛的大学](/solution/2000-2099/2072.The%20Winner%20University/README.md) | `数据库` | 简单 | 🔒 | +| 2073 | [买票需要的时间](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README.md) | `队列`,`数组`,`模拟` | 简单 | 第 267 场周赛 | +| 2074 | [反转偶数长度组的节点](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README.md) | `链表` | 中等 | 第 267 场周赛 | +| 2075 | [解码斜向换位密码](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README.md) | `字符串`,`模拟` | 中等 | 第 267 场周赛 | +| 2076 | [处理含限制条件的好友请求](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README.md) | `并查集`,`图` | 困难 | 第 267 场周赛 | +| 2077 | [殊途同归](/solution/2000-2099/2077.Paths%20in%20Maze%20That%20Lead%20to%20Same%20Room/README.md) | `图` | 中等 | 🔒 | +| 2078 | [两栋颜色不同且距离最远的房子](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README.md) | `贪心`,`数组` | 简单 | 第 268 场周赛 | +| 2079 | [给植物浇水](/solution/2000-2099/2079.Watering%20Plants/README.md) | `数组`,`模拟` | 中等 | 第 268 场周赛 | +| 2080 | [区间内查询数字的频率](/solution/2000-2099/2080.Range%20Frequency%20Queries/README.md) | `设计`,`线段树`,`数组`,`哈希表`,`二分查找` | 中等 | 第 268 场周赛 | +| 2081 | [k 镜像数字的和](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README.md) | `数学`,`枚举` | 困难 | 第 268 场周赛 | +| 2082 | [富有客户的数量](/solution/2000-2099/2082.The%20Number%20of%20Rich%20Customers/README.md) | `数据库` | 简单 | 🔒 | +| 2083 | [求以相同字母开头和结尾的子串总数](/solution/2000-2099/2083.Substrings%20That%20Begin%20and%20End%20With%20the%20Same%20Letter/README.md) | `哈希表`,`数学`,`字符串`,`计数`,`前缀和` | 中等 | 🔒 | +| 2084 | [为订单类型为 0 的客户删除类型为 1 的订单](/solution/2000-2099/2084.Drop%20Type%201%20Orders%20for%20Customers%20With%20Type%200%20Orders/README.md) | `数据库` | 中等 | 🔒 | +| 2085 | [统计出现过一次的公共字符串](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 简单 | 第 66 场双周赛 | +| 2086 | [喂食仓鼠的最小食物桶数](/solution/2000-2099/2086.Minimum%20Number%20of%20Food%20Buckets%20to%20Feed%20the%20Hamsters/README.md) | `贪心`,`字符串`,`动态规划` | 中等 | 第 66 场双周赛 | +| 2087 | [网格图中机器人回家的最小代价](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README.md) | `贪心`,`数组` | 中等 | 第 66 场双周赛 | +| 2088 | [统计农场中肥沃金字塔的数目](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 66 场双周赛 | +| 2089 | [找出数组排序后的目标下标](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README.md) | `数组`,`二分查找`,`排序` | 简单 | 第 269 场周赛 | +| 2090 | [半径为 k 的子数组平均值](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README.md) | `数组`,`滑动窗口` | 中等 | 第 269 场周赛 | +| 2091 | [从数组中移除最大值和最小值](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README.md) | `贪心`,`数组` | 中等 | 第 269 场周赛 | +| 2092 | [找出知晓秘密的所有专家](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`排序` | 困难 | 第 269 场周赛 | +| 2093 | [前往目标城市的最小费用](/solution/2000-2099/2093.Minimum%20Cost%20to%20Reach%20City%20With%20Discounts/README.md) | `图`,`最短路`,`堆（优先队列）` | 中等 | 🔒 | +| 2094 | [找出 3 位偶数](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README.md) | `数组`,`哈希表`,`枚举`,`排序` | 简单 | 第 270 场周赛 | +| 2095 | [删除链表的中间节点](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README.md) | `链表`,`双指针` | 中等 | 第 270 场周赛 | +| 2096 | [从二叉树一个节点到另一个节点每一步的方向](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README.md) | `树`,`深度优先搜索`,`字符串`,`二叉树` | 中等 | 第 270 场周赛 | +| 2097 | [合法重新排列数对](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README.md) | `深度优先搜索`,`图`,`欧拉回路` | 困难 | 第 270 场周赛 | +| 2098 | [长度为 K 的最大偶数和子序列](/solution/2000-2099/2098.Subsequence%20of%20Size%20K%20With%20the%20Largest%20Even%20Sum/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | +| 2099 | [找到和最大的长度为 K 的子序列](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README.md) | `数组`,`哈希表`,`排序`,`堆（优先队列）` | 简单 | 第 67 场双周赛 | +| 2100 | [适合野炊的日子](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README.md) | `数组`,`动态规划`,`前缀和` | 中等 | 第 67 场双周赛 | +| 2101 | [引爆最多的炸弹](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`几何`,`数组`,`数学` | 中等 | 第 67 场双周赛 | +| 2102 | [序列顺序查询](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README.md) | `设计`,`数据流`,`有序集合`,`堆（优先队列）` | 困难 | 第 67 场双周赛 | +| 2103 | [环和杆](/solution/2100-2199/2103.Rings%20and%20Rods/README.md) | `哈希表`,`字符串` | 简单 | 第 271 场周赛 | +| 2104 | [子数组范围和](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README.md) | `栈`,`数组`,`单调栈` | 中等 | 第 271 场周赛 | +| 2105 | [给植物浇水 II](/solution/2100-2199/2105.Watering%20Plants%20II/README.md) | `数组`,`双指针`,`模拟` | 中等 | 第 271 场周赛 | +| 2106 | [摘水果](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README.md) | `数组`,`二分查找`,`前缀和`,`滑动窗口` | 困难 | 第 271 场周赛 | +| 2107 | [分享 K 个糖果后独特口味的数量](/solution/2100-2199/2107.Number%20of%20Unique%20Flavors%20After%20Sharing%20K%20Candies/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 🔒 | +| 2108 | [找出数组中的第一个回文字符串](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README.md) | `数组`,`双指针`,`字符串` | 简单 | 第 272 场周赛 | +| 2109 | [向字符串添加空格](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README.md) | `数组`,`双指针`,`字符串`,`模拟` | 中等 | 第 272 场周赛 | +| 2110 | [股票平滑下跌阶段的数目](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README.md) | `数组`,`数学`,`动态规划` | 中等 | 第 272 场周赛 | +| 2111 | [使数组 K 递增的最少操作次数](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README.md) | `数组`,`二分查找` | 困难 | 第 272 场周赛 | +| 2112 | [最繁忙的机场](/solution/2100-2199/2112.The%20Airport%20With%20the%20Most%20Traffic/README.md) | `数据库` | 中等 | 🔒 | +| 2113 | [查询删除和添加元素后的数组](/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README.md) | `数组` | 中等 | 🔒 | +| 2114 | [句子中的最多单词数](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README.md) | `数组`,`字符串` | 简单 | 第 68 场双周赛 | +| 2115 | [从给定原材料中找到所有可以做出的菜](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README.md) | `图`,`拓扑排序`,`数组`,`哈希表`,`字符串` | 中等 | 第 68 场双周赛 | +| 2116 | [判断一个括号字符串是否有效](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md) | `栈`,`贪心`,`字符串` | 中等 | 第 68 场双周赛 | +| 2117 | [一个区间内所有数乘积的缩写](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README.md) | `数学` | 困难 | 第 68 场双周赛 | +| 2118 | [建立方程](/solution/2100-2199/2118.Build%20the%20Equation/README.md) | `数据库` | 困难 | 🔒 | +| 2119 | [反转两次的数字](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README.md) | `数学` | 简单 | 第 273 场周赛 | +| 2120 | [执行所有后缀指令](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README.md) | `字符串`,`模拟` | 中等 | 第 273 场周赛 | +| 2121 | [相同元素的间隔之和](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 273 场周赛 | +| 2122 | [还原原数组](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README.md) | `数组`,`哈希表`,`枚举`,`排序` | 困难 | 第 273 场周赛 | +| 2123 | [使矩阵中的 1 互不相邻的最小操作数](/solution/2100-2199/2123.Minimum%20Operations%20to%20Remove%20Adjacent%20Ones%20in%20Matrix/README.md) | `图`,`数组`,`矩阵` | 困难 | 🔒 | +| 2124 | [检查是否所有 A 都在 B 之前](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md) | `字符串` | 简单 | 第 274 场周赛 | +| 2125 | [银行中的激光束数量](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md) | `数组`,`数学`,`字符串`,`矩阵` | 中等 | 第 274 场周赛 | +| 2126 | [摧毁小行星](/solution/2100-2199/2126.Destroying%20Asteroids/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 274 场周赛 | +| 2127 | [参加会议的最多员工数](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md) | `深度优先搜索`,`图`,`拓扑排序` | 困难 | 第 274 场周赛 | +| 2128 | [通过翻转行或列来去除所有的 1](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md) | `位运算`,`数组`,`数学`,`矩阵` | 中等 | 🔒 | +| 2129 | [将标题首字母大写](/solution/2100-2199/2129.Capitalize%20the%20Title/README.md) | `字符串` | 简单 | 第 69 场双周赛 | +| 2130 | [链表最大孪生和](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md) | `栈`,`链表`,`双指针` | 中等 | 第 69 场双周赛 | +| 2131 | [连接两字母单词得到的最长回文串](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README.md) | `贪心`,`数组`,`哈希表`,`字符串`,`计数` | 中等 | 第 69 场双周赛 | +| 2132 | [用邮票贴满网格图](/solution/2100-2199/2132.Stamping%20the%20Grid/README.md) | `贪心`,`数组`,`矩阵`,`前缀和` | 困难 | 第 69 场双周赛 | +| 2133 | [检查是否每一行每一列都包含全部整数](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README.md) | `数组`,`哈希表`,`矩阵` | 简单 | 第 275 场周赛 | +| 2134 | [最少交换次数来组合所有的 1 II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README.md) | `数组`,`滑动窗口` | 中等 | 第 275 场周赛 | +| 2135 | [统计追加字母可以获得的单词数](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README.md) | `位运算`,`数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 275 场周赛 | +| 2136 | [全部开花的最早一天](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README.md) | `贪心`,`数组`,`排序` | 困难 | 第 275 场周赛 | +| 2137 | [通过倒水操作让所有的水桶所含水量相等](/solution/2100-2199/2137.Pour%20Water%20Between%20Buckets%20to%20Make%20Water%20Levels%20Equal/README.md) | `数组`,`二分查找` | 中等 | 🔒 | +| 2138 | [将字符串拆分为若干长度为 k 的组](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README.md) | `字符串`,`模拟` | 简单 | 第 276 场周赛 | +| 2139 | [得到目标值的最少行动次数](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README.md) | `贪心`,`数学` | 中等 | 第 276 场周赛 | +| 2140 | [解决智力问题](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README.md) | `数组`,`动态规划` | 中等 | 第 276 场周赛 | +| 2141 | [同时运行 N 台电脑的最长时间](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README.md) | `贪心`,`数组`,`二分查找`,`排序` | 困难 | 第 276 场周赛 | +| 2142 | [每辆车的乘客人数 I](/solution/2100-2199/2142.The%20Number%20of%20Passengers%20in%20Each%20Bus%20I/README.md) | `数据库` | 中等 | 🔒 | +| 2143 | [在两个数组的区间中选取数字](/solution/2100-2199/2143.Choose%20Numbers%20From%20Two%20Arrays%20in%20Range/README.md) | `数组`,`动态规划` | 困难 | 🔒 | +| 2144 | [打折购买糖果的最小开销](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 70 场双周赛 | +| 2145 | [统计隐藏数组数目](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README.md) | `数组`,`前缀和` | 中等 | 第 70 场双周赛 | +| 2146 | [价格范围内最高排名的 K 样物品](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README.md) | `广度优先搜索`,`数组`,`矩阵`,`排序`,`堆（优先队列）` | 中等 | 第 70 场双周赛 | +| 2147 | [分隔长廊的方案数](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README.md) | `数学`,`字符串`,`动态规划` | 困难 | 第 70 场双周赛 | +| 2148 | [元素计数](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README.md) | `数组`,`排序` | 简单 | 第 277 场周赛 | +| 2149 | [按符号重排数组](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README.md) | `数组`,`双指针`,`模拟` | 中等 | 第 277 场周赛 | +| 2150 | [找出数组中的所有孤独数字](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 277 场周赛 | +| 2151 | [基于陈述统计最多好人数](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README.md) | `位运算`,`数组`,`回溯`,`枚举` | 困难 | 第 277 场周赛 | +| 2152 | [穿过所有点的所需最少直线数量](/solution/2100-2199/2152.Minimum%20Number%20of%20Lines%20to%20Cover%20Points/README.md) | `位运算`,`几何`,`数组`,`哈希表`,`数学`,`动态规划`,`回溯`,`状态压缩` | 中等 | 🔒 | +| 2153 | [每辆车的乘客人数 II](/solution/2100-2199/2153.The%20Number%20of%20Passengers%20in%20Each%20Bus%20II/README.md) | `数据库` | 困难 | 🔒 | +| 2154 | [将找到的值乘以 2](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README.md) | `数组`,`哈希表`,`排序`,`模拟` | 简单 | 第 278 场周赛 | +| 2155 | [分组得分最高的所有下标](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README.md) | `数组` | 中等 | 第 278 场周赛 | +| 2156 | [查找给定哈希值的子串](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README.md) | `字符串`,`滑动窗口`,`哈希函数`,`滚动哈希` | 困难 | 第 278 场周赛 | +| 2157 | [字符串分组](/solution/2100-2199/2157.Groups%20of%20Strings/README.md) | `位运算`,`并查集`,`字符串` | 困难 | 第 278 场周赛 | +| 2158 | [每天绘制新区域的数量](/solution/2100-2199/2158.Amount%20of%20New%20Area%20Painted%20Each%20Day/README.md) | `线段树`,`数组`,`有序集合` | 困难 | 🔒 | +| 2159 | [分别排序两列](/solution/2100-2199/2159.Order%20Two%20Columns%20Independently/README.md) | `数据库` | 中等 | 🔒 | +| 2160 | [拆分数位后四位数字的最小和](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README.md) | `贪心`,`数学`,`排序` | 简单 | 第 71 场双周赛 | +| 2161 | [根据给定数字划分数组](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README.md) | `数组`,`双指针`,`模拟` | 中等 | 第 71 场双周赛 | +| 2162 | [设置时间的最少代价](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README.md) | `数学`,`枚举` | 中等 | 第 71 场双周赛 | +| 2163 | [删除元素后和的最小差值](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README.md) | `数组`,`动态规划`,`堆（优先队列）` | 困难 | 第 71 场双周赛 | +| 2164 | [对奇偶下标分别排序](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README.md) | `数组`,`排序` | 简单 | 第 279 场周赛 | +| 2165 | [重排数字的最小值](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README.md) | `数学`,`排序` | 中等 | 第 279 场周赛 | +| 2166 | [设计位集](/solution/2100-2199/2166.Design%20Bitset/README.md) | `设计`,`数组`,`哈希表`,`字符串` | 中等 | 第 279 场周赛 | +| 2167 | [移除所有载有违禁货物车厢所需的最少时间](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README.md) | `字符串`,`动态规划` | 困难 | 第 279 场周赛 | +| 2168 | [每个数字的频率都相同的独特子字符串的数量](/solution/2100-2199/2168.Unique%20Substrings%20With%20Equal%20Digit%20Frequency/README.md) | `哈希表`,`字符串`,`计数`,`哈希函数`,`滚动哈希` | 中等 | 🔒 | +| 2169 | [得到 0 的操作数](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README.md) | `数学`,`模拟` | 简单 | 第 280 场周赛 | +| 2170 | [使数组变成交替数组的最少操作数](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README.md) | `贪心`,`数组`,`哈希表`,`计数` | 中等 | 第 280 场周赛 | +| 2171 | [拿出最少数目的魔法豆](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README.md) | `贪心`,`数组`,`枚举`,`前缀和`,`排序` | 中等 | 第 280 场周赛 | +| 2172 | [数组的最大与和](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 280 场周赛 | +| 2173 | [最多连胜的次数](/solution/2100-2199/2173.Longest%20Winning%20Streak/README.md) | `数据库` | 困难 | 🔒 | +| 2174 | [通过翻转行或列来去除所有的 1 II](/solution/2100-2199/2174.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips%20II/README.md) | `位运算`,`广度优先搜索`,`数组`,`矩阵` | 中等 | 🔒 | +| 2175 | [世界排名的变化](/solution/2100-2199/2175.The%20Change%20in%20Global%20Rankings/README.md) | `数据库` | 中等 | 🔒 | +| 2176 | [统计数组中相等且可以被整除的数对](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README.md) | `数组` | 简单 | 第 72 场双周赛 | +| 2177 | [找到和为给定整数的三个连续整数](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README.md) | `数学`,`模拟` | 中等 | 第 72 场双周赛 | +| 2178 | [拆分成最多数目的正偶数之和](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README.md) | `贪心`,`数学`,`回溯` | 中等 | 第 72 场双周赛 | +| 2179 | [统计数组中好三元组数目](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | 第 72 场双周赛 | +| 2180 | [统计各位数字之和为偶数的整数个数](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README.md) | `数学`,`模拟` | 简单 | 第 281 场周赛 | +| 2181 | [合并零之间的节点](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README.md) | `链表`,`模拟` | 中等 | 第 281 场周赛 | +| 2182 | [构造限制重复的字符串](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`堆（优先队列）` | 中等 | 第 281 场周赛 | +| 2183 | [统计可以被 K 整除的下标对数目](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README.md) | `数组`,`数学`,`数论` | 困难 | 第 281 场周赛 | +| 2184 | [建造坚实的砖墙的方法数](/solution/2100-2199/2184.Number%20of%20Ways%20to%20Build%20Sturdy%20Brick%20Wall/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 中等 | 🔒 | +| 2185 | [统计包含给定前缀的字符串](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README.md) | `数组`,`字符串`,`字符串匹配` | 简单 | 第 282 场周赛 | +| 2186 | [制造字母异位词的最小步骤数 II](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 282 场周赛 | +| 2187 | [完成旅途的最少时间](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README.md) | `数组`,`二分查找` | 中等 | 第 282 场周赛 | +| 2188 | [完成比赛的最少时间](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README.md) | `数组`,`动态规划` | 困难 | 第 282 场周赛 | +| 2189 | [建造纸牌屋的方法数](/solution/2100-2199/2189.Number%20of%20Ways%20to%20Build%20House%20of%20Cards/README.md) | `数学`,`动态规划` | 中等 | 🔒 | +| 2190 | [数组中紧跟 key 之后出现最频繁的数字](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 73 场双周赛 | +| 2191 | [将杂乱无章的数字排序](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README.md) | `数组`,`排序` | 中等 | 第 73 场双周赛 | +| 2192 | [有向无环图中一个节点的所有祖先](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序` | 中等 | 第 73 场双周赛 | +| 2193 | [得到回文串的最少操作次数](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README.md) | `贪心`,`树状数组`,`双指针`,`字符串` | 困难 | 第 73 场双周赛 | +| 2194 | [Excel 表中某个范围内的单元格](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README.md) | `字符串` | 简单 | 第 283 场周赛 | +| 2195 | [向数组中追加 K 个整数](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README.md) | `贪心`,`数组`,`数学`,`排序` | 中等 | 第 283 场周赛 | +| 2196 | [根据描述创建二叉树](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README.md) | `树`,`数组`,`哈希表`,`二叉树` | 中等 | 第 283 场周赛 | +| 2197 | [替换数组中的非互质数](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README.md) | `栈`,`数组`,`数学`,`数论` | 困难 | 第 283 场周赛 | +| 2198 | [单因数三元组](/solution/2100-2199/2198.Number%20of%20Single%20Divisor%20Triplets/README.md) | `数学` | 中等 | 🔒 | +| 2199 | [找到每篇文章的主题](/solution/2100-2199/2199.Finding%20the%20Topic%20of%20Each%20Post/README.md) | `数据库` | 困难 | 🔒 | +| 2200 | [找出数组中的所有 K 近邻下标](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README.md) | `数组`,`双指针` | 简单 | 第 284 场周赛 | +| 2201 | [统计可以提取的工件](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README.md) | `数组`,`哈希表`,`模拟` | 中等 | 第 284 场周赛 | +| 2202 | [K 次操作后最大化顶端元素](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README.md) | `贪心`,`数组` | 中等 | 第 284 场周赛 | +| 2203 | [得到要求路径的最小带权子图](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md) | `图`,`最短路` | 困难 | 第 284 场周赛 | +| 2204 | [无向图中到环的距离](/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 困难 | 🔒 | +| 2205 | [有资格享受折扣的用户数量](/solution/2200-2299/2205.The%20Number%20of%20Users%20That%20Are%20Eligible%20for%20Discount/README.md) | `数据库` | 简单 | 🔒 | +| 2206 | [将数组划分成相等数对](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README.md) | `位运算`,`数组`,`哈希表`,`计数` | 简单 | 第 74 场双周赛 | +| 2207 | [字符串中最多数目的子序列](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README.md) | `贪心`,`字符串`,`前缀和` | 中等 | 第 74 场双周赛 | +| 2208 | [将数组和减半的最少操作次数](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 74 场双周赛 | +| 2209 | [用地毯覆盖后的最少白色砖块](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README.md) | `字符串`,`动态规划`,`前缀和` | 困难 | 第 74 场双周赛 | +| 2210 | [统计数组中峰和谷的数量](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README.md) | `数组` | 简单 | 第 285 场周赛 | +| 2211 | [统计道路上的碰撞次数](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README.md) | `栈`,`字符串`,`模拟` | 中等 | 第 285 场周赛 | +| 2212 | [射箭比赛中的最大得分](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README.md) | `位运算`,`数组`,`回溯`,`枚举` | 中等 | 第 285 场周赛 | +| 2213 | [由单个字符重复的最长子字符串](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README.md) | `线段树`,`数组`,`字符串`,`有序集合` | 困难 | 第 285 场周赛 | +| 2214 | [通关游戏所需的最低生命值](/solution/2200-2299/2214.Minimum%20Health%20to%20Beat%20Game/README.md) | `贪心`,`数组` | 中等 | 🔒 | +| 2215 | [找出两数组的不同](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README.md) | `数组`,`哈希表` | 简单 | 第 286 场周赛 | +| 2216 | [美化数组的最少删除数](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README.md) | `栈`,`贪心`,`数组` | 中等 | 第 286 场周赛 | +| 2217 | [找到指定长度的回文数](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README.md) | `数组`,`数学` | 中等 | 第 286 场周赛 | +| 2218 | [从栈中取出 K 个硬币的最大面值和](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README.md) | `数组`,`动态规划`,`前缀和` | 困难 | 第 286 场周赛 | +| 2219 | [数组的最大总分](/solution/2200-2299/2219.Maximum%20Sum%20Score%20of%20Array/README.md) | `数组`,`前缀和` | 中等 | 🔒 | +| 2220 | [转换数字的最少位翻转次数](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README.md) | `位运算` | 简单 | 第 75 场双周赛 | +| 2221 | [数组的三角和](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README.md) | `数组`,`数学`,`组合数学`,`模拟` | 中等 | 第 75 场双周赛 | +| 2222 | [选择建筑的方案数](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README.md) | `字符串`,`动态规划`,`前缀和` | 中等 | 第 75 场双周赛 | +| 2223 | [构造字符串的总得分和](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README.md) | `字符串`,`二分查找`,`字符串匹配`,`后缀数组`,`哈希函数`,`滚动哈希` | 困难 | 第 75 场双周赛 | +| 2224 | [转化时间需要的最少操作数](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README.md) | `贪心`,`字符串` | 简单 | 第 287 场周赛 | +| 2225 | [找出输掉零场或一场比赛的玩家](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README.md) | `数组`,`哈希表`,`计数`,`排序` | 中等 | 第 287 场周赛 | +| 2226 | [每个小孩最多能分到多少糖果](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README.md) | `数组`,`二分查找` | 中等 | 第 287 场周赛 | +| 2227 | [加密解密字符串](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README.md) | `设计`,`字典树`,`数组`,`哈希表`,`字符串` | 困难 | 第 287 场周赛 | +| 2228 | [7 天内两次购买的用户](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README.md) | `数据库` | 中等 | 🔒 | +| 2229 | [检查数组是否连贯](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README.md) | `数组`,`哈希表`,`排序` | 简单 | 🔒 | +| 2230 | [查找可享受优惠的用户](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README.md) | `数据库` | 简单 | 🔒 | +| 2231 | [按奇偶性交换后的最大数字](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md) | `排序`,`堆（优先队列）` | 简单 | 第 288 场周赛 | +| 2232 | [向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md) | `字符串`,`枚举` | 中等 | 第 288 场周赛 | +| 2233 | [K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 288 场周赛 | +| 2234 | [花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md) | `贪心`,`数组`,`双指针`,`二分查找`,`排序` | 困难 | 第 288 场周赛 | +| 2235 | [两整数相加](/solution/2200-2299/2235.Add%20Two%20Integers/README.md) | `数学` | 简单 | | +| 2236 | [判断根结点是否等于子结点之和](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README.md) | `树`,`二叉树` | 简单 | | +| 2237 | [计算街道上满足所需亮度的位置数量](/solution/2200-2299/2237.Count%20Positions%20on%20Street%20With%20Required%20Brightness/README.md) | `数组`,`前缀和` | 中等 | 🔒 | +| 2238 | [司机成为乘客的次数](/solution/2200-2299/2238.Number%20of%20Times%20a%20Driver%20Was%20a%20Passenger/README.md) | `数据库` | 中等 | 🔒 | +| 2239 | [找到最接近 0 的数字](/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README.md) | `数组` | 简单 | 第 76 场双周赛 | +| 2240 | [买钢笔和铅笔的方案数](/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README.md) | `数学`,`枚举` | 中等 | 第 76 场双周赛 | +| 2241 | [设计一个 ATM 机器](/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README.md) | `贪心`,`设计`,`数组` | 中等 | 第 76 场双周赛 | +| 2242 | [节点序列的最大得分](/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README.md) | `图`,`数组`,`枚举`,`排序` | 困难 | 第 76 场双周赛 | +| 2243 | [计算字符串的数字和](/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README.md) | `字符串`,`模拟` | 简单 | 第 289 场周赛 | +| 2244 | [完成所有任务需要的最少轮数](/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README.md) | `贪心`,`数组`,`哈希表`,`计数` | 中等 | 第 289 场周赛 | +| 2245 | [转角路径的乘积中最多能有几个尾随零](/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 289 场周赛 | +| 2246 | [相邻字符不同的最长路径](/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README.md) | `树`,`深度优先搜索`,`图`,`拓扑排序`,`数组`,`字符串` | 困难 | 第 289 场周赛 | +| 2247 | [K 条高速公路的最大旅行费用](/solution/2200-2299/2247.Maximum%20Cost%20of%20Trip%20With%20K%20Highways/README.md) | `位运算`,`图`,`动态规划`,`状态压缩` | 困难 | 🔒 | +| 2248 | [多个数组求交集](/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README.md) | `数组`,`哈希表`,`计数`,`排序` | 简单 | 第 290 场周赛 | +| 2249 | [统计圆内格点数目](/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README.md) | `几何`,`数组`,`哈希表`,`数学`,`枚举` | 中等 | 第 290 场周赛 | +| 2250 | [统计包含每个点的矩形数目](/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README.md) | `树状数组`,`数组`,`二分查找`,`排序` | 中等 | 第 290 场周赛 | +| 2251 | [花期内花的数目](/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README.md) | `数组`,`哈希表`,`二分查找`,`有序集合`,`前缀和`,`排序` | 困难 | 第 290 场周赛 | +| 2252 | [表的动态旋转](/solution/2200-2299/2252.Dynamic%20Pivoting%20of%20a%20Table/README.md) | `数据库` | 困难 | 🔒 | +| 2253 | [动态取消表的旋转](/solution/2200-2299/2253.Dynamic%20Unpivoting%20of%20a%20Table/README.md) | `数据库` | 困难 | 🔒 | +| 2254 | [设计视频共享平台](/solution/2200-2299/2254.Design%20Video%20Sharing%20Platform/README.md) | `栈`,`设计`,`哈希表`,`有序集合` | 困难 | 🔒 | +| 2255 | [统计是给定字符串前缀的字符串数目](/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README.md) | `数组`,`字符串` | 简单 | 第 77 场双周赛 | +| 2256 | [最小平均差](/solution/2200-2299/2256.Minimum%20Average%20Difference/README.md) | `数组`,`前缀和` | 中等 | 第 77 场双周赛 | +| 2257 | [统计网格图中没有被保卫的格子数](/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 77 场双周赛 | +| 2258 | [逃离火灾](/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README.md) | `广度优先搜索`,`数组`,`二分查找`,`矩阵` | 困难 | 第 77 场双周赛 | +| 2259 | [移除指定数字得到的最大结果](/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README.md) | `贪心`,`字符串`,`枚举` | 简单 | 第 291 场周赛 | +| 2260 | [必须拿起的最小连续卡牌数](/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 291 场周赛 | +| 2261 | [含最多 K 个可整除元素的子数组](/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README.md) | `字典树`,`数组`,`哈希表`,`枚举`,`哈希函数`,`滚动哈希` | 中等 | 第 291 场周赛 | +| 2262 | [字符串的总引力](/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README.md) | `哈希表`,`字符串`,`动态规划` | 困难 | 第 291 场周赛 | +| 2263 | [数组变为有序的最小操作次数](/solution/2200-2299/2263.Make%20Array%20Non-decreasing%20or%20Non-increasing/README.md) | `贪心`,`动态规划` | 困难 | 🔒 | +| 2264 | [字符串中最大的 3 位相同数字](/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README.md) | `字符串` | 简单 | 第 292 场周赛 | +| 2265 | [统计值等于子树平均值的节点数](/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README.md) | `树`,`深度优先搜索`,`二叉树` | 中等 | 第 292 场周赛 | +| 2266 | [统计打字方案数](/solution/2200-2299/2266.Count%20Number%20of%20Texts/README.md) | `哈希表`,`数学`,`字符串`,`动态规划` | 中等 | 第 292 场周赛 | +| 2267 | [检查是否有合法括号字符串路径](/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 292 场周赛 | +| 2268 | [最少按键次数](/solution/2200-2299/2268.Minimum%20Number%20of%20Keypresses/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序` | 中等 | 🔒 | +| 2269 | [找到一个数字的 K 美丽值](/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README.md) | `数学`,`字符串`,`滑动窗口` | 简单 | 第 78 场双周赛 | +| 2270 | [分割数组的方案数](/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README.md) | `数组`,`前缀和` | 中等 | 第 78 场双周赛 | +| 2271 | [毯子覆盖的最多白色砖块数](/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README.md) | `贪心`,`数组`,`二分查找`,`前缀和`,`排序` | 中等 | 第 78 场双周赛 | +| 2272 | [最大波动的子字符串](/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README.md) | `数组`,`动态规划` | 困难 | 第 78 场双周赛 | +| 2273 | [移除字母异位词后的结果数组](/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 简单 | 第 293 场周赛 | +| 2274 | [不含特殊楼层的最大连续楼层数](/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README.md) | `数组`,`排序` | 中等 | 第 293 场周赛 | +| 2275 | [按位与结果大于零的最长组合](/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README.md) | `位运算`,`数组`,`哈希表`,`计数` | 中等 | 第 293 场周赛 | +| 2276 | [统计区间中的整数数目](/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README.md) | `设计`,`线段树`,`有序集合` | 困难 | 第 293 场周赛 | +| 2277 | [树中最接近路径的节点](/solution/2200-2299/2277.Closest%20Node%20to%20Path%20in%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组` | 困难 | 🔒 | +| 2278 | [字母在字符串中的百分比](/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README.md) | `字符串` | 简单 | 第 294 场周赛 | +| 2279 | [装满石头的背包的最大数量](/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 294 场周赛 | +| 2280 | [表示一个折线图的最少线段数](/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README.md) | `几何`,`数组`,`数学`,`数论`,`排序` | 中等 | 第 294 场周赛 | +| 2281 | [巫师的总力量和](/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README.md) | `栈`,`数组`,`前缀和`,`单调栈` | 困难 | 第 294 场周赛 | +| 2282 | [在一个网格中可以看到的人数](/solution/2200-2299/2282.Number%20of%20People%20That%20Can%20Be%20Seen%20in%20a%20Grid/README.md) | `栈`,`数组`,`矩阵`,`单调栈` | 中等 | 🔒 | +| 2283 | [判断一个数的数字计数是否等于数位的值](/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 79 场双周赛 | +| 2284 | [最多单词数的发件人](/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README.md) | `数组`,`哈希表`,`字符串`,`计数` | 中等 | 第 79 场双周赛 | +| 2285 | [道路的最大总重要性](/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README.md) | `贪心`,`图`,`排序`,`堆（优先队列）` | 中等 | 第 79 场双周赛 | +| 2286 | [以组为单位订音乐会的门票](/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README.md) | `设计`,`树状数组`,`线段树`,`二分查找` | 困难 | 第 79 场双周赛 | +| 2287 | [重排字符形成目标字符串](/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 295 场周赛 | +| 2288 | [价格减免](/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README.md) | `字符串` | 中等 | 第 295 场周赛 | +| 2289 | [使数组按非递减顺序排列](/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README.md) | `栈`,`数组`,`链表`,`单调栈` | 中等 | 第 295 场周赛 | +| 2290 | [到达角落需要移除障碍物的最小数目](/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README.md) | `广度优先搜索`,`图`,`数组`,`矩阵`,`最短路`,`堆（优先队列）` | 困难 | 第 295 场周赛 | +| 2291 | [最大股票收益](/solution/2200-2299/2291.Maximum%20Profit%20From%20Trading%20Stocks/README.md) | `数组`,`动态规划` | 中等 | 🔒 | +| 2292 | [连续两年有 3 个及以上订单的产品](/solution/2200-2299/2292.Products%20With%20Three%20or%20More%20Orders%20in%20Two%20Consecutive%20Years/README.md) | `数据库` | 中等 | 🔒 | +| 2293 | [极大极小游戏](/solution/2200-2299/2293.Min%20Max%20Game/README.md) | `数组`,`模拟` | 简单 | 第 296 场周赛 | +| 2294 | [划分数组使最大差为 K](/solution/2200-2299/2294.Partition%20Array%20Such%20That%20Maximum%20Difference%20Is%20K/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 296 场周赛 | +| 2295 | [替换数组中的元素](/solution/2200-2299/2295.Replace%20Elements%20in%20an%20Array/README.md) | `数组`,`哈希表`,`模拟` | 中等 | 第 296 场周赛 | +| 2296 | [设计一个文本编辑器](/solution/2200-2299/2296.Design%20a%20Text%20Editor/README.md) | `栈`,`设计`,`链表`,`字符串`,`双向链表`,`模拟` | 困难 | 第 296 场周赛 | +| 2297 | [跳跃游戏 VIII](/solution/2200-2299/2297.Jump%20Game%20VIII/README.md) | `栈`,`图`,`数组`,`动态规划`,`最短路`,`单调栈` | 中等 | 🔒 | +| 2298 | [周末任务计数](/solution/2200-2299/2298.Tasks%20Count%20in%20the%20Weekend/README.md) | `数据库` | 中等 | 🔒 | +| 2299 | [强密码检验器 II](/solution/2200-2299/2299.Strong%20Password%20Checker%20II/README.md) | `字符串` | 简单 | 第 80 场双周赛 | +| 2300 | [咒语和药水的成功对数](/solution/2300-2399/2300.Successful%20Pairs%20of%20Spells%20and%20Potions/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 80 场双周赛 | +| 2301 | [替换字符后匹配](/solution/2300-2399/2301.Match%20Substring%20After%20Replacement/README.md) | `数组`,`哈希表`,`字符串`,`字符串匹配` | 困难 | 第 80 场双周赛 | +| 2302 | [统计得分小于 K 的子数组数目](/solution/2300-2399/2302.Count%20Subarrays%20With%20Score%20Less%20Than%20K/README.md) | `数组`,`二分查找`,`前缀和`,`滑动窗口` | 困难 | 第 80 场双周赛 | +| 2303 | [计算应缴税款总额](/solution/2300-2399/2303.Calculate%20Amount%20Paid%20in%20Taxes/README.md) | `数组`,`模拟` | 简单 | 第 297 场周赛 | +| 2304 | [网格中的最小路径代价](/solution/2300-2399/2304.Minimum%20Path%20Cost%20in%20a%20Grid/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 297 场周赛 | +| 2305 | [公平分发饼干](/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README.md) | `位运算`,`数组`,`动态规划`,`回溯`,`状态压缩` | 中等 | 第 297 场周赛 | +| 2306 | [公司命名](/solution/2300-2399/2306.Naming%20a%20Company/README.md) | `位运算`,`数组`,`哈希表`,`字符串`,`枚举` | 困难 | 第 297 场周赛 | +| 2307 | [检查方程中的矛盾之处](/solution/2300-2399/2307.Check%20for%20Contradictions%20in%20Equations/README.md) | `深度优先搜索`,`并查集`,`图`,`数组` | 困难 | 🔒 | +| 2308 | [按性别排列表格](/solution/2300-2399/2308.Arrange%20Table%20by%20Gender/README.md) | `数据库` | 中等 | 🔒 | +| 2309 | [兼具大小写的最好英文字母](/solution/2300-2399/2309.Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case/README.md) | `哈希表`,`字符串`,`枚举` | 简单 | 第 298 场周赛 | +| 2310 | [个位数字为 K 的整数之和](/solution/2300-2399/2310.Sum%20of%20Numbers%20With%20Units%20Digit%20K/README.md) | `贪心`,`数学`,`动态规划`,`枚举` | 中等 | 第 298 场周赛 | +| 2311 | [小于等于 K 的最长二进制子序列](/solution/2300-2399/2311.Longest%20Binary%20Subsequence%20Less%20Than%20or%20Equal%20to%20K/README.md) | `贪心`,`记忆化搜索`,`字符串`,`动态规划` | 中等 | 第 298 场周赛 | +| 2312 | [卖木头块](/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README.md) | `记忆化搜索`,`数组`,`动态规划` | 困难 | 第 298 场周赛 | +| 2313 | [二叉树中得到结果所需的最少翻转次数](/solution/2300-2399/2313.Minimum%20Flips%20in%20Binary%20Tree%20to%20Get%20Result/README.md) | `树`,`深度优先搜索`,`动态规划`,`二叉树` | 困难 | 🔒 | +| 2314 | [每个城市最高气温的第一天](/solution/2300-2399/2314.The%20First%20Day%20of%20the%20Maximum%20Recorded%20Degree%20in%20Each%20City/README.md) | `数据库` | 中等 | 🔒 | +| 2315 | [统计星号](/solution/2300-2399/2315.Count%20Asterisks/README.md) | `字符串` | 简单 | 第 81 场双周赛 | +| 2316 | [统计无向图中无法互相到达点对数](/solution/2300-2399/2316.Count%20Unreachable%20Pairs%20of%20Nodes%20in%20an%20Undirected%20Graph/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 第 81 场双周赛 | +| 2317 | [操作后的最大异或和](/solution/2300-2399/2317.Maximum%20XOR%20After%20Operations/README.md) | `位运算`,`数组`,`数学` | 中等 | 第 81 场双周赛 | +| 2318 | [不同骰子序列的数目](/solution/2300-2399/2318.Number%20of%20Distinct%20Roll%20Sequences/README.md) | `记忆化搜索`,`动态规划` | 困难 | 第 81 场双周赛 | +| 2319 | [判断矩阵是否是一个 X 矩阵](/solution/2300-2399/2319.Check%20if%20Matrix%20Is%20X-Matrix/README.md) | `数组`,`矩阵` | 简单 | 第 299 场周赛 | +| 2320 | [统计放置房子的方式数](/solution/2300-2399/2320.Count%20Number%20of%20Ways%20to%20Place%20Houses/README.md) | `动态规划` | 中等 | 第 299 场周赛 | +| 2321 | [拼接数组的最大分数](/solution/2300-2399/2321.Maximum%20Score%20Of%20Spliced%20Array/README.md) | `数组`,`动态规划` | 困难 | 第 299 场周赛 | +| 2322 | [从树中删除边的最小分数](/solution/2300-2399/2322.Minimum%20Score%20After%20Removals%20on%20a%20Tree/README.md) | `位运算`,`树`,`深度优先搜索`,`数组` | 困难 | 第 299 场周赛 | +| 2323 | [完成所有工作的最短时间 II](/solution/2300-2399/2323.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs%20II/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | +| 2324 | [产品销售分析 IV](/solution/2300-2399/2324.Product%20Sales%20Analysis%20IV/README.md) | `数据库` | 中等 | 🔒 | +| 2325 | [解密消息](/solution/2300-2399/2325.Decode%20the%20Message/README.md) | `哈希表`,`字符串` | 简单 | 第 300 场周赛 | +| 2326 | [螺旋矩阵 IV](/solution/2300-2399/2326.Spiral%20Matrix%20IV/README.md) | `数组`,`链表`,`矩阵`,`模拟` | 中等 | 第 300 场周赛 | +| 2327 | [知道秘密的人数](/solution/2300-2399/2327.Number%20of%20People%20Aware%20of%20a%20Secret/README.md) | `队列`,`动态规划`,`模拟` | 中等 | 第 300 场周赛 | +| 2328 | [网格图中递增路径的数目](/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序`,`记忆化搜索`,`数组`,`动态规划`,`矩阵` | 困难 | 第 300 场周赛 | +| 2329 | [产品销售分析 Ⅴ](/solution/2300-2399/2329.Product%20Sales%20Analysis%20V/README.md) | `数据库` | 简单 | 🔒 | +| 2330 | [验证回文串 IV](/solution/2300-2399/2330.Valid%20Palindrome%20IV/README.md) | `双指针`,`字符串` | 中等 | 🔒 | +| 2331 | [计算布尔二叉树的值](/solution/2300-2399/2331.Evaluate%20Boolean%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | 第 82 场双周赛 | +| 2332 | [坐上公交的最晚时间](/solution/2300-2399/2332.The%20Latest%20Time%20to%20Catch%20a%20Bus/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 82 场双周赛 | +| 2333 | [最小差值平方和](/solution/2300-2399/2333.Minimum%20Sum%20of%20Squared%20Difference/README.md) | `数组`,`数学`,`排序`,`堆（优先队列）` | 中等 | 第 82 场双周赛 | +| 2334 | [元素值大于变化阈值的子数组](/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README.md) | `栈`,`并查集`,`数组`,`单调栈` | 困难 | 第 82 场双周赛 | +| 2335 | [装满杯子需要的最短总时长](/solution/2300-2399/2335.Minimum%20Amount%20of%20Time%20to%20Fill%20Cups/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 简单 | 第 301 场周赛 | +| 2336 | [无限集中的最小数字](/solution/2300-2399/2336.Smallest%20Number%20in%20Infinite%20Set/README.md) | `设计`,`哈希表`,`堆（优先队列）` | 中等 | 第 301 场周赛 | +| 2337 | [移动片段得到字符串](/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README.md) | `双指针`,`字符串` | 中等 | 第 301 场周赛 | +| 2338 | [统计理想数组的数目](/solution/2300-2399/2338.Count%20the%20Number%20of%20Ideal%20Arrays/README.md) | `数学`,`动态规划`,`组合数学`,`数论` | 困难 | 第 301 场周赛 | +| 2339 | [联赛的所有比赛](/solution/2300-2399/2339.All%20the%20Matches%20of%20the%20League/README.md) | `数据库` | 简单 | 🔒 | +| 2340 | [生成有效数组的最少交换次数](/solution/2300-2399/2340.Minimum%20Adjacent%20Swaps%20to%20Make%20a%20Valid%20Array/README.md) | `贪心`,`数组` | 中等 | 🔒 | +| 2341 | [数组能形成多少数对](/solution/2300-2399/2341.Maximum%20Number%20of%20Pairs%20in%20Array/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 302 场周赛 | +| 2342 | [数位和相等数对的最大和](/solution/2300-2399/2342.Max%20Sum%20of%20a%20Pair%20With%20Equal%20Sum%20of%20Digits/README.md) | `数组`,`哈希表`,`排序`,`堆（优先队列）` | 中等 | 第 302 场周赛 | +| 2343 | [裁剪数字后查询第 K 小的数字](/solution/2300-2399/2343.Query%20Kth%20Smallest%20Trimmed%20Number/README.md) | `数组`,`字符串`,`分治`,`快速选择`,`基数排序`,`排序`,`堆（优先队列）` | 中等 | 第 302 场周赛 | +| 2344 | [使数组可以被整除的最少删除次数](/solution/2300-2399/2344.Minimum%20Deletions%20to%20Make%20Array%20Divisible/README.md) | `数组`,`数学`,`数论`,`排序`,`堆（优先队列）` | 困难 | 第 302 场周赛 | +| 2345 | [寻找可见山的数量](/solution/2300-2399/2345.Finding%20the%20Number%20of%20Visible%20Mountains/README.md) | `栈`,`数组`,`排序`,`单调栈` | 中等 | 🔒 | +| 2346 | [以百分比计算排名](/solution/2300-2399/2346.Compute%20the%20Rank%20as%20a%20Percentage/README.md) | `数据库` | 中等 | 🔒 | +| 2347 | [最好的扑克手牌](/solution/2300-2399/2347.Best%20Poker%20Hand/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 83 场双周赛 | +| 2348 | [全 0 子数组的数目](/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README.md) | `数组`,`数学` | 中等 | 第 83 场双周赛 | +| 2349 | [设计数字容器系统](/solution/2300-2399/2349.Design%20a%20Number%20Container%20System/README.md) | `设计`,`哈希表`,`有序集合`,`堆（优先队列）` | 中等 | 第 83 场双周赛 | +| 2350 | [不可能得到的最短骰子序列](/solution/2300-2399/2350.Shortest%20Impossible%20Sequence%20of%20Rolls/README.md) | `贪心`,`数组`,`哈希表` | 困难 | 第 83 场双周赛 | +| 2351 | [第一个出现两次的字母](/solution/2300-2399/2351.First%20Letter%20to%20Appear%20Twice/README.md) | `位运算`,`哈希表`,`字符串`,`计数` | 简单 | 第 303 场周赛 | +| 2352 | [相等行列对](/solution/2300-2399/2352.Equal%20Row%20and%20Column%20Pairs/README.md) | `数组`,`哈希表`,`矩阵`,`模拟` | 中等 | 第 303 场周赛 | +| 2353 | [设计食物评分系统](/solution/2300-2399/2353.Design%20a%20Food%20Rating%20System/README.md) | `设计`,`哈希表`,`有序集合`,`堆（优先队列）` | 中等 | 第 303 场周赛 | +| 2354 | [优质数对的数目](/solution/2300-2399/2354.Number%20of%20Excellent%20Pairs/README.md) | `位运算`,`数组`,`哈希表`,`二分查找` | 困难 | 第 303 场周赛 | +| 2355 | [你能拿走的最大图书数量](/solution/2300-2399/2355.Maximum%20Number%20of%20Books%20You%20Can%20Take/README.md) | `栈`,`数组`,`动态规划`,`单调栈` | 困难 | 🔒 | +| 2356 | [每位教师所教授的科目种类的数量](/solution/2300-2399/2356.Number%20of%20Unique%20Subjects%20Taught%20by%20Each%20Teacher/README.md) | `数据库` | 简单 | | +| 2357 | [使数组中所有元素都等于零](/solution/2300-2399/2357.Make%20Array%20Zero%20by%20Subtracting%20Equal%20Amounts/README.md) | `贪心`,`数组`,`哈希表`,`排序`,`模拟`,`堆（优先队列）` | 简单 | 第 304 场周赛 | +| 2358 | [分组的最大数量](/solution/2300-2399/2358.Maximum%20Number%20of%20Groups%20Entering%20a%20Competition/README.md) | `贪心`,`数组`,`数学`,`二分查找` | 中等 | 第 304 场周赛 | +| 2359 | [找到离给定两个节点最近的节点](/solution/2300-2399/2359.Find%20Closest%20Node%20to%20Given%20Two%20Nodes/README.md) | `深度优先搜索`,`图` | 中等 | 第 304 场周赛 | +| 2360 | [图中的最长环](/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README.md) | `深度优先搜索`,`图`,`拓扑排序` | 困难 | 第 304 场周赛 | +| 2361 | [乘坐火车路线的最少费用](/solution/2300-2399/2361.Minimum%20Costs%20Using%20the%20Train%20Line/README.md) | `数组`,`动态规划` | 困难 | 🔒 | +| 2362 | [生成发票](/solution/2300-2399/2362.Generate%20the%20Invoice/README.md) | `数据库` | 困难 | 🔒 | +| 2363 | [合并相似的物品](/solution/2300-2399/2363.Merge%20Similar%20Items/README.md) | `数组`,`哈希表`,`有序集合`,`排序` | 简单 | 第 84 场双周赛 | +| 2364 | [统计坏数对的数目](/solution/2300-2399/2364.Count%20Number%20of%20Bad%20Pairs/README.md) | `数组`,`哈希表` | 中等 | 第 84 场双周赛 | +| 2365 | [任务调度器 II](/solution/2300-2399/2365.Task%20Scheduler%20II/README.md) | `数组`,`哈希表`,`模拟` | 中等 | 第 84 场双周赛 | +| 2366 | [将数组排序的最少替换次数](/solution/2300-2399/2366.Minimum%20Replacements%20to%20Sort%20the%20Array/README.md) | `贪心`,`数组`,`数学` | 困难 | 第 84 场双周赛 | +| 2367 | [算术三元组的数目](/solution/2300-2399/2367.Number%20of%20Arithmetic%20Triplets/README.md) | `数组`,`哈希表`,`双指针`,`枚举` | 简单 | 第 305 场周赛 | +| 2368 | [受限条件下可到达节点的数目](/solution/2300-2399/2368.Reachable%20Nodes%20With%20Restrictions/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`并查集`,`图`,`数组`,`哈希表` | 中等 | 第 305 场周赛 | +| 2369 | [检查数组是否存在有效划分](/solution/2300-2399/2369.Check%20if%20There%20is%20a%20Valid%20Partition%20For%20The%20Array/README.md) | `数组`,`动态规划` | 中等 | 第 305 场周赛 | +| 2370 | [最长理想子序列](/solution/2300-2399/2370.Longest%20Ideal%20Subsequence/README.md) | `哈希表`,`字符串`,`动态规划` | 中等 | 第 305 场周赛 | +| 2371 | [最小化网格中的最大值](/solution/2300-2399/2371.Minimize%20Maximum%20Value%20in%20a%20Grid/README.md) | `并查集`,`图`,`拓扑排序`,`数组`,`矩阵`,`排序` | 困难 | 🔒 | +| 2372 | [计算每个销售人员的影响力](/solution/2300-2399/2372.Calculate%20the%20Influence%20of%20Each%20Salesperson/README.md) | `数据库` | 中等 | 🔒 | +| 2373 | [矩阵中的局部最大值](/solution/2300-2399/2373.Largest%20Local%20Values%20in%20a%20Matrix/README.md) | `数组`,`矩阵` | 简单 | 第 306 场周赛 | +| 2374 | [边积分最高的节点](/solution/2300-2399/2374.Node%20With%20Highest%20Edge%20Score/README.md) | `图`,`哈希表` | 中等 | 第 306 场周赛 | +| 2375 | [根据模式串构造最小数字](/solution/2300-2399/2375.Construct%20Smallest%20Number%20From%20DI%20String/README.md) | `栈`,`贪心`,`字符串`,`回溯` | 中等 | 第 306 场周赛 | +| 2376 | [统计特殊整数](/solution/2300-2399/2376.Count%20Special%20Integers/README.md) | `数学`,`动态规划` | 困难 | 第 306 场周赛 | +| 2377 | [整理奥运表](/solution/2300-2399/2377.Sort%20the%20Olympic%20Table/README.md) | `数据库` | 简单 | 🔒 | +| 2378 | [选择边来最大化树的得分](/solution/2300-2399/2378.Choose%20Edges%20to%20Maximize%20Score%20in%20a%20Tree/README.md) | `树`,`深度优先搜索`,`动态规划` | 中等 | 🔒 | +| 2379 | [得到 K 个黑块的最少涂色次数](/solution/2300-2399/2379.Minimum%20Recolors%20to%20Get%20K%20Consecutive%20Black%20Blocks/README.md) | `字符串`,`滑动窗口` | 简单 | 第 85 场双周赛 | +| 2380 | [二进制字符串重新安排顺序需要的时间](/solution/2300-2399/2380.Time%20Needed%20to%20Rearrange%20a%20Binary%20String/README.md) | `字符串`,`动态规划`,`模拟` | 中等 | 第 85 场双周赛 | +| 2381 | [字母移位 II](/solution/2300-2399/2381.Shifting%20Letters%20II/README.md) | `数组`,`字符串`,`前缀和` | 中等 | 第 85 场双周赛 | +| 2382 | [删除操作后的最大子段和](/solution/2300-2399/2382.Maximum%20Segment%20Sum%20After%20Removals/README.md) | `并查集`,`数组`,`有序集合`,`前缀和` | 困难 | 第 85 场双周赛 | +| 2383 | [赢得比赛需要的最少训练时长](/solution/2300-2399/2383.Minimum%20Hours%20of%20Training%20to%20Win%20a%20Competition/README.md) | `贪心`,`数组` | 简单 | 第 307 场周赛 | +| 2384 | [最大回文数字](/solution/2300-2399/2384.Largest%20Palindromic%20Number/README.md) | `贪心`,`哈希表`,`字符串` | 中等 | 第 307 场周赛 | +| 2385 | [感染二叉树需要的总时间](/solution/2300-2399/2385.Amount%20of%20Time%20for%20Binary%20Tree%20to%20Be%20Infected/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 第 307 场周赛 | +| 2386 | [找出数组的第 K 大和](/solution/2300-2399/2386.Find%20the%20K-Sum%20of%20an%20Array/README.md) | `数组`,`排序`,`堆（优先队列）` | 困难 | 第 307 场周赛 | +| 2387 | [行排序矩阵的中位数](/solution/2300-2399/2387.Median%20of%20a%20Row%20Wise%20Sorted%20Matrix/README.md) | `数组`,`二分查找`,`矩阵` | 中等 | 🔒 | +| 2388 | [将表中的空值更改为前一个值](/solution/2300-2399/2388.Change%20Null%20Values%20in%20a%20Table%20to%20the%20Previous%20Value/README.md) | `数据库` | 中等 | 🔒 | +| 2389 | [和有限的最长子序列](/solution/2300-2399/2389.Longest%20Subsequence%20With%20Limited%20Sum/README.md) | `贪心`,`数组`,`二分查找`,`前缀和`,`排序` | 简单 | 第 308 场周赛 | +| 2390 | [从字符串中移除星号](/solution/2300-2399/2390.Removing%20Stars%20From%20a%20String/README.md) | `栈`,`字符串`,`模拟` | 中等 | 第 308 场周赛 | +| 2391 | [收集垃圾的最少总时间](/solution/2300-2399/2391.Minimum%20Amount%20of%20Time%20to%20Collect%20Garbage/README.md) | `数组`,`字符串`,`前缀和` | 中等 | 第 308 场周赛 | +| 2392 | [给定条件下构造矩阵](/solution/2300-2399/2392.Build%20a%20Matrix%20With%20Conditions/README.md) | `图`,`拓扑排序`,`数组`,`矩阵` | 困难 | 第 308 场周赛 | +| 2393 | [严格递增的子数组个数](/solution/2300-2399/2393.Count%20Strictly%20Increasing%20Subarrays/README.md) | `数组`,`数学`,`动态规划` | 中等 | 🔒 | +| 2394 | [开除员工](/solution/2300-2399/2394.Employees%20With%20Deductions/README.md) | `数据库` | 中等 | 🔒 | +| 2395 | [和相等的子数组](/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README.md) | `数组`,`哈希表` | 简单 | 第 86 场双周赛 | +| 2396 | [严格回文的数字](/solution/2300-2399/2396.Strictly%20Palindromic%20Number/README.md) | `脑筋急转弯`,`数学`,`双指针` | 中等 | 第 86 场双周赛 | +| 2397 | [被列覆盖的最多行数](/solution/2300-2399/2397.Maximum%20Rows%20Covered%20by%20Columns/README.md) | `位运算`,`数组`,`回溯`,`枚举`,`矩阵` | 中等 | 第 86 场双周赛 | +| 2398 | [预算内的最多机器人数目](/solution/2300-2399/2398.Maximum%20Number%20of%20Robots%20Within%20Budget/README.md) | `队列`,`数组`,`二分查找`,`前缀和`,`滑动窗口`,`堆（优先队列）` | 困难 | 第 86 场双周赛 | +| 2399 | [检查相同字母间的距离](/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 309 场周赛 | +| 2400 | [恰好移动 k 步到达某一位置的方法数目](/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README.md) | `数学`,`动态规划`,`组合数学` | 中等 | 第 309 场周赛 | +| 2401 | [最长优雅子数组](/solution/2400-2499/2401.Longest%20Nice%20Subarray/README.md) | `位运算`,`数组`,`滑动窗口` | 中等 | 第 309 场周赛 | +| 2402 | [会议室 III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README.md) | `数组`,`哈希表`,`排序`,`模拟`,`堆（优先队列）` | 困难 | 第 309 场周赛 | +| 2403 | [杀死所有怪物的最短时间](/solution/2400-2499/2403.Minimum%20Time%20to%20Kill%20All%20Monsters/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 🔒 | +| 2404 | [出现最频繁的偶数元素](/solution/2400-2499/2404.Most%20Frequent%20Even%20Element/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 310 场周赛 | +| 2405 | [子字符串的最优划分](/solution/2400-2499/2405.Optimal%20Partition%20of%20String/README.md) | `贪心`,`哈希表`,`字符串` | 中等 | 第 310 场周赛 | +| 2406 | [将区间分为最少组数](/solution/2400-2499/2406.Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/README.md) | `贪心`,`数组`,`双指针`,`前缀和`,`排序`,`堆（优先队列）` | 中等 | 第 310 场周赛 | +| 2407 | [最长递增子序列 II](/solution/2400-2499/2407.Longest%20Increasing%20Subsequence%20II/README.md) | `树状数组`,`线段树`,`队列`,`数组`,`分治`,`动态规划`,`单调队列` | 困难 | 第 310 场周赛 | +| 2408 | [设计 SQL](/solution/2400-2499/2408.Design%20SQL/README.md) | `设计`,`数组`,`哈希表`,`字符串` | 中等 | 🔒 | +| 2409 | [统计共同度过的日子数](/solution/2400-2499/2409.Count%20Days%20Spent%20Together/README.md) | `数学`,`字符串` | 简单 | 第 87 场双周赛 | +| 2410 | [运动员和训练师的最大匹配数](/solution/2400-2499/2410.Maximum%20Matching%20of%20Players%20With%20Trainers/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 87 场双周赛 | +| 2411 | [按位或最大的最小子数组长度](/solution/2400-2499/2411.Smallest%20Subarrays%20With%20Maximum%20Bitwise%20OR/README.md) | `位运算`,`数组`,`二分查找`,`滑动窗口` | 中等 | 第 87 场双周赛 | +| 2412 | [完成所有交易的初始最少钱数](/solution/2400-2499/2412.Minimum%20Money%20Required%20Before%20Transactions/README.md) | `贪心`,`数组`,`排序` | 困难 | 第 87 场双周赛 | +| 2413 | [最小偶倍数](/solution/2400-2499/2413.Smallest%20Even%20Multiple/README.md) | `数学`,`数论` | 简单 | 第 311 场周赛 | +| 2414 | [最长的字母序连续子字符串的长度](/solution/2400-2499/2414.Length%20of%20the%20Longest%20Alphabetical%20Continuous%20Substring/README.md) | `字符串` | 中等 | 第 311 场周赛 | +| 2415 | [反转二叉树的奇数层](/solution/2400-2499/2415.Reverse%20Odd%20Levels%20of%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 第 311 场周赛 | +| 2416 | [字符串的前缀分数和](/solution/2400-2499/2416.Sum%20of%20Prefix%20Scores%20of%20Strings/README.md) | `字典树`,`数组`,`字符串`,`计数` | 困难 | 第 311 场周赛 | +| 2417 | [最近的公平整数](/solution/2400-2499/2417.Closest%20Fair%20Integer/README.md) | `数学`,`枚举` | 中等 | 🔒 | +| 2418 | [按身高排序](/solution/2400-2499/2418.Sort%20the%20People/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 简单 | 第 312 场周赛 | +| 2419 | [按位与最大的最长子数组](/solution/2400-2499/2419.Longest%20Subarray%20With%20Maximum%20Bitwise%20AND/README.md) | `位运算`,`脑筋急转弯`,`数组` | 中等 | 第 312 场周赛 | +| 2420 | [找到所有好下标](/solution/2400-2499/2420.Find%20All%20Good%20Indices/README.md) | `数组`,`动态规划`,`前缀和` | 中等 | 第 312 场周赛 | +| 2421 | [好路径的数目](/solution/2400-2499/2421.Number%20of%20Good%20Paths/README.md) | `树`,`并查集`,`图`,`数组`,`哈希表`,`排序` | 困难 | 第 312 场周赛 | +| 2422 | [使用合并操作将数组转换为回文序列](/solution/2400-2499/2422.Merge%20Operations%20to%20Turn%20Array%20Into%20a%20Palindrome/README.md) | `贪心`,`数组`,`双指针` | 中等 | 🔒 | +| 2423 | [删除字符使频率相同](/solution/2400-2499/2423.Remove%20Letter%20To%20Equalize%20Frequency/README.md) | `哈希表`,`字符串`,`计数` | 简单 | 第 88 场双周赛 | +| 2424 | [最长上传前缀](/solution/2400-2499/2424.Longest%20Uploaded%20Prefix/README.md) | `并查集`,`设计`,`树状数组`,`线段树`,`二分查找`,`有序集合`,`堆（优先队列）` | 中等 | 第 88 场双周赛 | +| 2425 | [所有数对的异或和](/solution/2400-2499/2425.Bitwise%20XOR%20of%20All%20Pairings/README.md) | `位运算`,`脑筋急转弯`,`数组` | 中等 | 第 88 场双周赛 | +| 2426 | [满足不等式的数对数目](/solution/2400-2499/2426.Number%20of%20Pairs%20Satisfying%20Inequality/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | 第 88 场双周赛 | +| 2427 | [公因子的数目](/solution/2400-2499/2427.Number%20of%20Common%20Factors/README.md) | `数学`,`枚举`,`数论` | 简单 | 第 313 场周赛 | +| 2428 | [沙漏的最大总和](/solution/2400-2499/2428.Maximum%20Sum%20of%20an%20Hourglass/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 313 场周赛 | +| 2429 | [最小异或](/solution/2400-2499/2429.Minimize%20XOR/README.md) | `贪心`,`位运算` | 中等 | 第 313 场周赛 | +| 2430 | [对字母串可执行的最大删除数](/solution/2400-2499/2430.Maximum%20Deletions%20on%20a%20String/README.md) | `字符串`,`动态规划`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 313 场周赛 | +| 2431 | [最大限度地提高购买水果的口味](/solution/2400-2499/2431.Maximize%20Total%20Tastiness%20of%20Purchased%20Fruits/README.md) | `数组`,`动态规划` | 中等 | 🔒 | +| 2432 | [处理用时最长的那个任务的员工](/solution/2400-2499/2432.The%20Employee%20That%20Worked%20on%20the%20Longest%20Task/README.md) | `数组` | 简单 | 第 314 场周赛 | +| 2433 | [找出前缀异或的原始数组](/solution/2400-2499/2433.Find%20The%20Original%20Array%20of%20Prefix%20Xor/README.md) | `位运算`,`数组` | 中等 | 第 314 场周赛 | +| 2434 | [使用机器人打印字典序最小的字符串](/solution/2400-2499/2434.Using%20a%20Robot%20to%20Print%20the%20Lexicographically%20Smallest%20String/README.md) | `栈`,`贪心`,`哈希表`,`字符串` | 中等 | 第 314 场周赛 | +| 2435 | [矩阵中和能被 K 整除的路径](/solution/2400-2499/2435.Paths%20in%20Matrix%20Whose%20Sum%20Is%20Divisible%20by%20K/README.md) | `数组`,`动态规划`,`矩阵` | 困难 | 第 314 场周赛 | +| 2436 | [使子数组最大公约数大于一的最小分割数](/solution/2400-2499/2436.Minimum%20Split%20Into%20Subarrays%20With%20GCD%20Greater%20Than%20One/README.md) | `贪心`,`数组`,`数学`,`动态规划`,`数论` | 中等 | 🔒 | +| 2437 | [有效时间的数目](/solution/2400-2499/2437.Number%20of%20Valid%20Clock%20Times/README.md) | `字符串`,`枚举` | 简单 | 第 89 场双周赛 | +| 2438 | [二的幂数组中查询范围内的乘积](/solution/2400-2499/2438.Range%20Product%20Queries%20of%20Powers/README.md) | `位运算`,`数组`,`前缀和` | 中等 | 第 89 场双周赛 | +| 2439 | [最小化数组中的最大值](/solution/2400-2499/2439.Minimize%20Maximum%20of%20Array/README.md) | `贪心`,`数组`,`二分查找`,`动态规划`,`前缀和` | 中等 | 第 89 场双周赛 | +| 2440 | [创建价值相同的连通块](/solution/2400-2499/2440.Create%20Components%20With%20Same%20Value/README.md) | `树`,`深度优先搜索`,`数组`,`数学`,`枚举` | 困难 | 第 89 场双周赛 | +| 2441 | [与对应负数同时存在的最大正整数](/solution/2400-2499/2441.Largest%20Positive%20Integer%20That%20Exists%20With%20Its%20Negative/README.md) | `数组`,`哈希表`,`双指针`,`排序` | 简单 | 第 315 场周赛 | +| 2442 | [反转之后不同整数的数目](/solution/2400-2499/2442.Count%20Number%20of%20Distinct%20Integers%20After%20Reverse%20Operations/README.md) | `数组`,`哈希表`,`数学` | 中等 | 第 315 场周赛 | +| 2443 | [反转之后的数字和](/solution/2400-2499/2443.Sum%20of%20Number%20and%20Its%20Reverse/README.md) | `数学`,`枚举` | 中等 | 第 315 场周赛 | +| 2444 | [统计定界子数组的数目](/solution/2400-2499/2444.Count%20Subarrays%20With%20Fixed%20Bounds/README.md) | `队列`,`数组`,`滑动窗口`,`单调队列` | 困难 | 第 315 场周赛 | +| 2445 | [值为 1 的节点数](/solution/2400-2499/2445.Number%20of%20Nodes%20With%20Value%20One/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | +| 2446 | [判断两个事件是否存在冲突](/solution/2400-2499/2446.Determine%20if%20Two%20Events%20Have%20Conflict/README.md) | `数组`,`字符串` | 简单 | 第 316 场周赛 | +| 2447 | [最大公因数等于 K 的子数组数目](/solution/2400-2499/2447.Number%20of%20Subarrays%20With%20GCD%20Equal%20to%20K/README.md) | `数组`,`数学`,`数论` | 中等 | 第 316 场周赛 | +| 2448 | [使数组相等的最小开销](/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README.md) | `贪心`,`数组`,`二分查找`,`前缀和`,`排序` | 困难 | 第 316 场周赛 | +| 2449 | [使数组相似的最少操作次数](/solution/2400-2499/2449.Minimum%20Number%20of%20Operations%20to%20Make%20Arrays%20Similar/README.md) | `贪心`,`数组`,`排序` | 困难 | 第 316 场周赛 | +| 2450 | [应用操作后不同二进制字符串的数量](/solution/2400-2499/2450.Number%20of%20Distinct%20Binary%20Strings%20After%20Applying%20Operations/README.md) | `数学`,`字符串` | 中等 | 🔒 | +| 2451 | [差值数组不同的字符串](/solution/2400-2499/2451.Odd%20String%20Difference/README.md) | `数组`,`哈希表`,`字符串` | 简单 | 第 90 场双周赛 | +| 2452 | [距离字典两次编辑以内的单词](/solution/2400-2499/2452.Words%20Within%20Two%20Edits%20of%20Dictionary/README.md) | `数组`,`字符串` | 中等 | 第 90 场双周赛 | +| 2453 | [摧毁一系列目标](/solution/2400-2499/2453.Destroy%20Sequential%20Targets/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 90 场双周赛 | +| 2454 | [下一个更大元素 IV](/solution/2400-2499/2454.Next%20Greater%20Element%20IV/README.md) | `栈`,`数组`,`二分查找`,`排序`,`单调栈`,`堆（优先队列）` | 困难 | 第 90 场双周赛 | +| 2455 | [可被三整除的偶数的平均值](/solution/2400-2499/2455.Average%20Value%20of%20Even%20Numbers%20That%20Are%20Divisible%20by%20Three/README.md) | `数组`,`数学` | 简单 | 第 317 场周赛 | +| 2456 | [最流行的视频创作者](/solution/2400-2499/2456.Most%20Popular%20Video%20Creator/README.md) | `数组`,`哈希表`,`字符串`,`排序`,`堆（优先队列）` | 中等 | 第 317 场周赛 | +| 2457 | [美丽整数的最小增量](/solution/2400-2499/2457.Minimum%20Addition%20to%20Make%20Integer%20Beautiful/README.md) | `贪心`,`数学` | 中等 | 第 317 场周赛 | +| 2458 | [移除子树后的二叉树高度](/solution/2400-2499/2458.Height%20of%20Binary%20Tree%20After%20Subtree%20Removal%20Queries/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`数组`,`二叉树` | 困难 | 第 317 场周赛 | +| 2459 | [通过移动项目到空白区域来排序数组](/solution/2400-2499/2459.Sort%20Array%20by%20Moving%20Items%20to%20Empty%20Space/README.md) | `贪心`,`数组`,`排序` | 困难 | 🔒 | +| 2460 | [对数组执行操作](/solution/2400-2499/2460.Apply%20Operations%20to%20an%20Array/README.md) | `数组`,`双指针`,`模拟` | 简单 | 第 318 场周赛 | +| 2461 | [长度为 K 子数组中的最大和](/solution/2400-2499/2461.Maximum%20Sum%20of%20Distinct%20Subarrays%20With%20Length%20K/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 318 场周赛 | +| 2462 | [雇佣 K 位工人的总代价](/solution/2400-2499/2462.Total%20Cost%20to%20Hire%20K%20Workers/README.md) | `数组`,`双指针`,`模拟`,`堆（优先队列）` | 中等 | 第 318 场周赛 | +| 2463 | [最小移动总距离](/solution/2400-2499/2463.Minimum%20Total%20Distance%20Traveled/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 318 场周赛 | +| 2464 | [有效分割中的最少子数组数目](/solution/2400-2499/2464.Minimum%20Subarrays%20in%20a%20Valid%20Split/README.md) | `数组`,`数学`,`动态规划`,`数论` | 中等 | 🔒 | +| 2465 | [不同的平均值数目](/solution/2400-2499/2465.Number%20of%20Distinct%20Averages/README.md) | `数组`,`哈希表`,`双指针`,`排序` | 简单 | 第 91 场双周赛 | +| 2466 | [统计构造好字符串的方案数](/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README.md) | `动态规划` | 中等 | 第 91 场双周赛 | +| 2467 | [树上最大得分和路径](/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`图`,`数组` | 中等 | 第 91 场双周赛 | +| 2468 | [根据限制分割消息](/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README.md) | `字符串`,`二分查找` | 困难 | 第 91 场双周赛 | +| 2469 | [温度转换](/solution/2400-2499/2469.Convert%20the%20Temperature/README.md) | `数学` | 简单 | 第 319 场周赛 | +| 2470 | [最小公倍数为 K 的子数组数目](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README.md) | `数组`,`数学`,`数论` | 中等 | 第 319 场周赛 | +| 2471 | [逐层排序二叉树所需的最少操作数目](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README.md) | `树`,`广度优先搜索`,`二叉树` | 中等 | 第 319 场周赛 | +| 2472 | [不重叠回文子字符串的最大数目](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README.md) | `字符串`,`动态规划` | 困难 | 第 319 场周赛 | +| 2473 | [购买苹果的最低成本](/solution/2400-2499/2473.Minimum%20Cost%20to%20Buy%20Apples/README.md) | `图`,`数组`,`最短路`,`堆（优先队列）` | 中等 | 🔒 | +| 2474 | [购买量严格增加的客户](/solution/2400-2499/2474.Customers%20With%20Strictly%20Increasing%20Purchases/README.md) | `数据库` | 困难 | 🔒 | +| 2475 | [数组中不等三元组的数目](/solution/2400-2499/2475.Number%20of%20Unequal%20Triplets%20in%20Array/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 320 场周赛 | +| 2476 | [二叉搜索树最近节点查询](/solution/2400-2499/2476.Closest%20Nodes%20Queries%20in%20a%20Binary%20Search%20Tree/README.md) | `树`,`深度优先搜索`,`二叉搜索树`,`数组`,`二分查找`,`二叉树` | 中等 | 第 320 场周赛 | +| 2477 | [到达首都的最少油耗](/solution/2400-2499/2477.Minimum%20Fuel%20Cost%20to%20Report%20to%20the%20Capital/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`图` | 中等 | 第 320 场周赛 | +| 2478 | [完美分割的方案数](/solution/2400-2499/2478.Number%20of%20Beautiful%20Partitions/README.md) | `字符串`,`动态规划` | 困难 | 第 320 场周赛 | +| 2479 | [两个不重叠子树的最大异或值](/solution/2400-2499/2479.Maximum%20XOR%20of%20Two%20Non-Overlapping%20Subtrees/README.md) | `树`,`深度优先搜索`,`图`,`字典树` | 困难 | 🔒 | +| 2480 | [形成化学键](/solution/2400-2499/2480.Form%20a%20Chemical%20Bond/README.md) | `数据库` | 简单 | 🔒 | +| 2481 | [分割圆的最少切割次数](/solution/2400-2499/2481.Minimum%20Cuts%20to%20Divide%20a%20Circle/README.md) | `几何`,`数学` | 简单 | 第 92 场双周赛 | +| 2482 | [行和列中一和零的差值](/solution/2400-2499/2482.Difference%20Between%20Ones%20and%20Zeros%20in%20Row%20and%20Column/README.md) | `数组`,`矩阵`,`模拟` | 中等 | 第 92 场双周赛 | +| 2483 | [商店的最少代价](/solution/2400-2499/2483.Minimum%20Penalty%20for%20a%20Shop/README.md) | `字符串`,`前缀和` | 中等 | 第 92 场双周赛 | +| 2484 | [统计回文子序列数目](/solution/2400-2499/2484.Count%20Palindromic%20Subsequences/README.md) | `字符串`,`动态规划` | 困难 | 第 92 场双周赛 | +| 2485 | [找出中枢整数](/solution/2400-2499/2485.Find%20the%20Pivot%20Integer/README.md) | `数学`,`前缀和` | 简单 | 第 321 场周赛 | +| 2486 | [追加字符以获得子序列](/solution/2400-2499/2486.Append%20Characters%20to%20String%20to%20Make%20Subsequence/README.md) | `贪心`,`双指针`,`字符串` | 中等 | 第 321 场周赛 | +| 2487 | [从链表中移除节点](/solution/2400-2499/2487.Remove%20Nodes%20From%20Linked%20List/README.md) | `栈`,`递归`,`链表`,`单调栈` | 中等 | 第 321 场周赛 | +| 2488 | [统计中位数为 K 的子数组](/solution/2400-2499/2488.Count%20Subarrays%20With%20Median%20K/README.md) | `数组`,`哈希表`,`前缀和` | 困难 | 第 321 场周赛 | +| 2489 | [固定比率的子字符串数](/solution/2400-2499/2489.Number%20of%20Substrings%20With%20Fixed%20Ratio/README.md) | `哈希表`,`数学`,`字符串`,`前缀和` | 中等 | 🔒 | +| 2490 | [回环句](/solution/2400-2499/2490.Circular%20Sentence/README.md) | `字符串` | 简单 | 第 322 场周赛 | +| 2491 | [划分技能点相等的团队](/solution/2400-2499/2491.Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/README.md) | `数组`,`哈希表`,`双指针`,`排序` | 中等 | 第 322 场周赛 | +| 2492 | [两个城市间路径的最小分数](/solution/2400-2499/2492.Minimum%20Score%20of%20a%20Path%20Between%20Two%20Cities/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`图` | 中等 | 第 322 场周赛 | +| 2493 | [将节点分成尽可能多的组](/solution/2400-2499/2493.Divide%20Nodes%20Into%20the%20Maximum%20Number%20of%20Groups/README.md) | `广度优先搜索`,`并查集`,`图` | 困难 | 第 322 场周赛 | +| 2494 | [合并在同一个大厅重叠的活动](/solution/2400-2499/2494.Merge%20Overlapping%20Events%20in%20the%20Same%20Hall/README.md) | `数据库` | 困难 | 🔒 | +| 2495 | [乘积为偶数的子数组数](/solution/2400-2499/2495.Number%20of%20Subarrays%20Having%20Even%20Product/README.md) | `数组`,`数学`,`动态规划` | 中等 | 🔒 | +| 2496 | [数组中字符串的最大值](/solution/2400-2499/2496.Maximum%20Value%20of%20a%20String%20in%20an%20Array/README.md) | `数组`,`字符串` | 简单 | 第 93 场双周赛 | +| 2497 | [图中最大星和](/solution/2400-2499/2497.Maximum%20Star%20Sum%20of%20a%20Graph/README.md) | `贪心`,`图`,`数组`,`排序`,`堆（优先队列）` | 中等 | 第 93 场双周赛 | +| 2498 | [青蛙过河 II](/solution/2400-2499/2498.Frog%20Jump%20II/README.md) | `贪心`,`数组`,`二分查找` | 中等 | 第 93 场双周赛 | +| 2499 | [让数组不相等的最小总代价](/solution/2400-2499/2499.Minimum%20Total%20Cost%20to%20Make%20Arrays%20Unequal/README.md) | `贪心`,`数组`,`哈希表`,`计数` | 困难 | 第 93 场双周赛 | +| 2500 | [删除每行中的最大值](/solution/2500-2599/2500.Delete%20Greatest%20Value%20in%20Each%20Row/README.md) | `数组`,`矩阵`,`排序`,`模拟`,`堆（优先队列）` | 简单 | 第 323 场周赛 | +| 2501 | [数组中最长的方波](/solution/2500-2599/2501.Longest%20Square%20Streak%20in%20an%20Array/README.md) | `数组`,`哈希表`,`二分查找`,`动态规划`,`排序` | 中等 | 第 323 场周赛 | +| 2502 | [设计内存分配器](/solution/2500-2599/2502.Design%20Memory%20Allocator/README.md) | `设计`,`数组`,`哈希表`,`模拟` | 中等 | 第 323 场周赛 | +| 2503 | [矩阵查询可获得的最大分数](/solution/2500-2599/2503.Maximum%20Number%20of%20Points%20From%20Grid%20Queries/README.md) | `广度优先搜索`,`并查集`,`数组`,`双指针`,`矩阵`,`排序`,`堆（优先队列）` | 困难 | 第 323 场周赛 | +| 2504 | [把名字和职业联系起来](/solution/2500-2599/2504.Concatenate%20the%20Name%20and%20the%20Profession/README.md) | `数据库` | 简单 | 🔒 | +| 2505 | [所有子序列和的按位或](/solution/2500-2599/2505.Bitwise%20OR%20of%20All%20Subsequence%20Sums/README.md) | `位运算`,`脑筋急转弯`,`数组`,`数学` | 中等 | 🔒 | +| 2506 | [统计相似字符串对的数目](/solution/2500-2599/2506.Count%20Pairs%20Of%20Similar%20Strings/README.md) | `位运算`,`数组`,`哈希表`,`字符串` | 简单 | 第 324 场周赛 | +| 2507 | [使用质因数之和替换后可以取到的最小值](/solution/2500-2599/2507.Smallest%20Value%20After%20Replacing%20With%20Sum%20of%20Prime%20Factors/README.md) | `数学`,`数论`,`模拟` | 中等 | 第 324 场周赛 | +| 2508 | [添加边使所有节点度数都为偶数](/solution/2500-2599/2508.Add%20Edges%20to%20Make%20Degrees%20of%20All%20Nodes%20Even/README.md) | `图`,`哈希表` | 困难 | 第 324 场周赛 | +| 2509 | [查询树中环的长度](/solution/2500-2599/2509.Cycle%20Length%20Queries%20in%20a%20Tree/README.md) | `树`,`数组`,`二叉树` | 困难 | 第 324 场周赛 | +| 2510 | [检查是否有路径经过相同数量的 0 和 1](/solution/2500-2599/2510.Check%20if%20There%20is%20a%20Path%20With%20Equal%20Number%20of%200%27s%20And%201%27s/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 🔒 | +| 2511 | [最多可以摧毁的敌人城堡数目](/solution/2500-2599/2511.Maximum%20Enemy%20Forts%20That%20Can%20Be%20Captured/README.md) | `数组`,`双指针` | 简单 | 第 94 场双周赛 | +| 2512 | [奖励最顶尖的 K 名学生](/solution/2500-2599/2512.Reward%20Top%20K%20Students/README.md) | `数组`,`哈希表`,`字符串`,`排序`,`堆（优先队列）` | 中等 | 第 94 场双周赛 | +| 2513 | [最小化两个数组中的最大值](/solution/2500-2599/2513.Minimize%20the%20Maximum%20of%20Two%20Arrays/README.md) | `数学`,`二分查找`,`数论` | 中等 | 第 94 场双周赛 | +| 2514 | [统计同位异构字符串数目](/solution/2500-2599/2514.Count%20Anagrams/README.md) | `哈希表`,`数学`,`字符串`,`组合数学`,`计数` | 困难 | 第 94 场双周赛 | +| 2515 | [到目标字符串的最短距离](/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README.md) | `数组`,`字符串` | 简单 | 第 325 场周赛 | +| 2516 | [每种字符至少取 K 个](/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 第 325 场周赛 | +| 2517 | [礼盒的最大甜蜜度](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README.md) | `贪心`,`数组`,`二分查找`,`排序` | 中等 | 第 325 场周赛 | +| 2518 | [好分区的数目](/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README.md) | `数组`,`动态规划` | 困难 | 第 325 场周赛 | +| 2519 | [统计 K-Big 索引的数量](/solution/2500-2599/2519.Count%20the%20Number%20of%20K-Big%20Indices/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 困难 | 🔒 | +| 2520 | [统计能整除数字的位数](/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README.md) | `数学` | 简单 | 第 326 场周赛 | +| 2521 | [数组乘积中的不同质因数数目](/solution/2500-2599/2521.Distinct%20Prime%20Factors%20of%20Product%20of%20Array/README.md) | `数组`,`哈希表`,`数学`,`数论` | 中等 | 第 326 场周赛 | +| 2522 | [将字符串分割成值不超过 K 的子字符串](/solution/2500-2599/2522.Partition%20String%20Into%20Substrings%20With%20Values%20at%20Most%20K/README.md) | `贪心`,`字符串`,`动态规划` | 中等 | 第 326 场周赛 | +| 2523 | [范围内最接近的两个质数](/solution/2500-2599/2523.Closest%20Prime%20Numbers%20in%20Range/README.md) | `数学`,`数论` | 中等 | 第 326 场周赛 | +| 2524 | [子数组的最大频率分数](/solution/2500-2599/2524.Maximum%20Frequency%20Score%20of%20a%20Subarray/README.md) | `数组`,`哈希表`,`数学`,`滑动窗口` | 困难 | 🔒 | +| 2525 | [根据规则将箱子分类](/solution/2500-2599/2525.Categorize%20Box%20According%20to%20Criteria/README.md) | `数学` | 简单 | 第 95 场双周赛 | +| 2526 | [找到数据流中的连续整数](/solution/2500-2599/2526.Find%20Consecutive%20Integers%20from%20a%20Data%20Stream/README.md) | `设计`,`队列`,`哈希表`,`计数`,`数据流` | 中等 | 第 95 场双周赛 | +| 2527 | [查询数组异或美丽值](/solution/2500-2599/2527.Find%20Xor-Beauty%20of%20Array/README.md) | `位运算`,`数组`,`数学` | 中等 | 第 95 场双周赛 | +| 2528 | [最大化城市的最小电量](/solution/2500-2599/2528.Maximize%20the%20Minimum%20Powered%20City/README.md) | `贪心`,`队列`,`数组`,`二分查找`,`前缀和`,`滑动窗口` | 困难 | 第 95 场双周赛 | +| 2529 | [正整数和负整数的最大计数](/solution/2500-2599/2529.Maximum%20Count%20of%20Positive%20Integer%20and%20Negative%20Integer/README.md) | `数组`,`二分查找`,`计数` | 简单 | 第 327 场周赛 | +| 2530 | [执行 K 次操作后的最大分数](/solution/2500-2599/2530.Maximal%20Score%20After%20Applying%20K%20Operations/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 第 327 场周赛 | +| 2531 | [使字符串中不同字符的数目相等](/solution/2500-2599/2531.Make%20Number%20of%20Distinct%20Characters%20Equal/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 327 场周赛 | +| 2532 | [过桥的时间](/solution/2500-2599/2532.Time%20to%20Cross%20a%20Bridge/README.md) | `数组`,`模拟`,`堆（优先队列）` | 困难 | 第 327 场周赛 | +| 2533 | [好二进制字符串的数量](/solution/2500-2599/2533.Number%20of%20Good%20Binary%20Strings/README.md) | `动态规划` | 中等 | 🔒 | +| 2534 | [通过门的时间](/solution/2500-2599/2534.Time%20Taken%20to%20Cross%20the%20Door/README.md) | `队列`,`数组`,`模拟` | 困难 | 🔒 | +| 2535 | [数组元素和与数字和的绝对差](/solution/2500-2599/2535.Difference%20Between%20Element%20Sum%20and%20Digit%20Sum%20of%20an%20Array/README.md) | `数组`,`数学` | 简单 | 第 328 场周赛 | +| 2536 | [子矩阵元素加 1](/solution/2500-2599/2536.Increment%20Submatrices%20by%20One/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 328 场周赛 | +| 2537 | [统计好子数组的数目](/solution/2500-2599/2537.Count%20the%20Number%20of%20Good%20Subarrays/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 328 场周赛 | +| 2538 | [最大价值和与最小价值和的差值](/solution/2500-2599/2538.Difference%20Between%20Maximum%20and%20Minimum%20Price%20Sum/README.md) | `树`,`深度优先搜索`,`数组`,`动态规划` | 困难 | 第 328 场周赛 | +| 2539 | [好子序列的个数](/solution/2500-2599/2539.Count%20the%20Number%20of%20Good%20Subsequences/README.md) | `哈希表`,`数学`,`字符串`,`组合数学`,`计数` | 中等 | 🔒 | +| 2540 | [最小公共值](/solution/2500-2599/2540.Minimum%20Common%20Value/README.md) | `数组`,`哈希表`,`双指针`,`二分查找` | 简单 | 第 96 场双周赛 | +| 2541 | [使数组中所有元素相等的最小操作数 II](/solution/2500-2599/2541.Minimum%20Operations%20to%20Make%20Array%20Equal%20II/README.md) | `贪心`,`数组`,`数学` | 中等 | 第 96 场双周赛 | +| 2542 | [最大子序列的分数](/solution/2500-2599/2542.Maximum%20Subsequence%20Score/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 中等 | 第 96 场双周赛 | +| 2543 | [判断一个点是否可以到达](/solution/2500-2599/2543.Check%20if%20Point%20Is%20Reachable/README.md) | `数学`,`数论` | 困难 | 第 96 场双周赛 | +| 2544 | [交替数字和](/solution/2500-2599/2544.Alternating%20Digit%20Sum/README.md) | `数学` | 简单 | 第 329 场周赛 | +| 2545 | [根据第 K 场考试的分数排序](/solution/2500-2599/2545.Sort%20the%20Students%20by%20Their%20Kth%20Score/README.md) | `数组`,`矩阵`,`排序` | 中等 | 第 329 场周赛 | +| 2546 | [执行逐位运算使字符串相等](/solution/2500-2599/2546.Apply%20Bitwise%20Operations%20to%20Make%20Strings%20Equal/README.md) | `位运算`,`字符串` | 中等 | 第 329 场周赛 | +| 2547 | [拆分数组的最小代价](/solution/2500-2599/2547.Minimum%20Cost%20to%20Split%20an%20Array/README.md) | `数组`,`哈希表`,`动态规划`,`计数` | 困难 | 第 329 场周赛 | +| 2548 | [填满背包的最大价格](/solution/2500-2599/2548.Maximum%20Price%20to%20Fill%20a%20Bag/README.md) | `贪心`,`数组`,`排序` | 中等 | 🔒 | +| 2549 | [统计桌面上的不同数字](/solution/2500-2599/2549.Count%20Distinct%20Numbers%20on%20Board/README.md) | `数组`,`哈希表`,`数学`,`模拟` | 简单 | 第 330 场周赛 | +| 2550 | [猴子碰撞的方法数](/solution/2500-2599/2550.Count%20Collisions%20of%20Monkeys%20on%20a%20Polygon/README.md) | `递归`,`数学` | 中等 | 第 330 场周赛 | +| 2551 | [将珠子放入背包中](/solution/2500-2599/2551.Put%20Marbles%20in%20Bags/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 困难 | 第 330 场周赛 | +| 2552 | [统计上升四元组](/solution/2500-2599/2552.Count%20Increasing%20Quadruplets/README.md) | `树状数组`,`数组`,`动态规划`,`枚举`,`前缀和` | 困难 | 第 330 场周赛 | +| 2553 | [分割数组中数字的数位](/solution/2500-2599/2553.Separate%20the%20Digits%20in%20an%20Array/README.md) | `数组`,`模拟` | 简单 | 第 97 场双周赛 | +| 2554 | [从一个范围内选择最多整数 I](/solution/2500-2599/2554.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20I/README.md) | `贪心`,`数组`,`哈希表`,`二分查找`,`排序` | 中等 | 第 97 场双周赛 | +| 2555 | [两个线段获得的最多奖品](/solution/2500-2599/2555.Maximize%20Win%20From%20Two%20Segments/README.md) | `数组`,`二分查找`,`滑动窗口` | 中等 | 第 97 场双周赛 | +| 2556 | [二进制矩阵中翻转最多一次使路径不连通](/solution/2500-2599/2556.Disconnect%20Path%20in%20a%20Binary%20Matrix%20by%20at%20Most%20One%20Flip/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`动态规划`,`矩阵` | 中等 | 第 97 场双周赛 | +| 2557 | [从一个范围内选择最多整数 II](/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README.md) | `贪心`,`数组`,`二分查找`,`排序` | 中等 | 🔒 | +| 2558 | [从数量最多的堆取走礼物](/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README.md) | `数组`,`模拟`,`堆（优先队列）` | 简单 | 第 331 场周赛 | +| 2559 | [统计范围内的元音字符串数](/solution/2500-2599/2559.Count%20Vowel%20Strings%20in%20Ranges/README.md) | `数组`,`字符串`,`前缀和` | 中等 | 第 331 场周赛 | +| 2560 | [打家劫舍 IV](/solution/2500-2599/2560.House%20Robber%20IV/README.md) | `数组`,`二分查找` | 中等 | 第 331 场周赛 | +| 2561 | [重排水果](/solution/2500-2599/2561.Rearranging%20Fruits/README.md) | `贪心`,`数组`,`哈希表` | 困难 | 第 331 场周赛 | +| 2562 | [找出数组的串联值](/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README.md) | `数组`,`双指针`,`模拟` | 简单 | 第 332 场周赛 | +| 2563 | [统计公平数对的数目](/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 332 场周赛 | +| 2564 | [子字符串异或查询](/solution/2500-2599/2564.Substring%20XOR%20Queries/README.md) | `位运算`,`数组`,`哈希表`,`字符串` | 中等 | 第 332 场周赛 | +| 2565 | [最少得分子序列](/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README.md) | `双指针`,`字符串`,`二分查找` | 困难 | 第 332 场周赛 | +| 2566 | [替换一个数字后的最大差值](/solution/2500-2599/2566.Maximum%20Difference%20by%20Remapping%20a%20Digit/README.md) | `贪心`,`数学` | 简单 | 第 98 场双周赛 | +| 2567 | [修改两个元素的最小分数](/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 98 场双周赛 | +| 2568 | [最小无法得到的或值](/solution/2500-2599/2568.Minimum%20Impossible%20OR/README.md) | `位运算`,`脑筋急转弯`,`数组` | 中等 | 第 98 场双周赛 | +| 2569 | [更新数组后处理求和查询](/solution/2500-2599/2569.Handling%20Sum%20Queries%20After%20Update/README.md) | `线段树`,`数组` | 困难 | 第 98 场双周赛 | +| 2570 | [合并两个二维数组 - 求和法](/solution/2500-2599/2570.Merge%20Two%202D%20Arrays%20by%20Summing%20Values/README.md) | `数组`,`哈希表`,`双指针` | 简单 | 第 333 场周赛 | +| 2571 | [将整数减少到零需要的最少操作数](/solution/2500-2599/2571.Minimum%20Operations%20to%20Reduce%20an%20Integer%20to%200/README.md) | `贪心`,`位运算`,`动态规划` | 中等 | 第 333 场周赛 | +| 2572 | [无平方子集计数](/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README.md) | `位运算`,`数组`,`数学`,`动态规划`,`状态压缩` | 中等 | 第 333 场周赛 | +| 2573 | [找出对应 LCP 矩阵的字符串](/solution/2500-2599/2573.Find%20the%20String%20with%20LCP/README.md) | `贪心`,`并查集`,`数组`,`字符串`,`动态规划`,`矩阵` | 困难 | 第 333 场周赛 | +| 2574 | [左右元素和的差值](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README.md) | `数组`,`前缀和` | 简单 | 第 334 场周赛 | +| 2575 | [找出字符串的可整除数组](/solution/2500-2599/2575.Find%20the%20Divisibility%20Array%20of%20a%20String/README.md) | `数组`,`数学`,`字符串` | 中等 | 第 334 场周赛 | +| 2576 | [求出最多标记下标](/solution/2500-2599/2576.Find%20the%20Maximum%20Number%20of%20Marked%20Indices/README.md) | `贪心`,`数组`,`双指针`,`二分查找`,`排序` | 中等 | 第 334 场周赛 | +| 2577 | [在网格图中访问一个格子的最少时间](/solution/2500-2599/2577.Minimum%20Time%20to%20Visit%20a%20Cell%20In%20a%20Grid/README.md) | `广度优先搜索`,`图`,`数组`,`矩阵`,`最短路`,`堆（优先队列）` | 困难 | 第 334 场周赛 | +| 2578 | [最小和分割](/solution/2500-2599/2578.Split%20With%20Minimum%20Sum/README.md) | `贪心`,`数学`,`排序` | 简单 | 第 99 场双周赛 | +| 2579 | [统计染色格子数](/solution/2500-2599/2579.Count%20Total%20Number%20of%20Colored%20Cells/README.md) | `数学` | 中等 | 第 99 场双周赛 | +| 2580 | [统计将重叠区间合并成组的方案数](/solution/2500-2599/2580.Count%20Ways%20to%20Group%20Overlapping%20Ranges/README.md) | `数组`,`排序` | 中等 | 第 99 场双周赛 | +| 2581 | [统计可能的树根数目](/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README.md) | `树`,`深度优先搜索`,`哈希表`,`动态规划` | 困难 | 第 99 场双周赛 | +| 2582 | [递枕头](/solution/2500-2599/2582.Pass%20the%20Pillow/README.md) | `数学`,`模拟` | 简单 | 第 335 场周赛 | +| 2583 | [二叉树中的第 K 大层和](/solution/2500-2599/2583.Kth%20Largest%20Sum%20in%20a%20Binary%20Tree/README.md) | `树`,`广度优先搜索`,`二叉树`,`排序` | 中等 | 第 335 场周赛 | +| 2584 | [分割数组使乘积互质](/solution/2500-2599/2584.Split%20the%20Array%20to%20Make%20Coprime%20Products/README.md) | `数组`,`哈希表`,`数学`,`数论` | 困难 | 第 335 场周赛 | +| 2585 | [获得分数的方法数](/solution/2500-2599/2585.Number%20of%20Ways%20to%20Earn%20Points/README.md) | `数组`,`动态规划` | 困难 | 第 335 场周赛 | +| 2586 | [统计范围内的元音字符串数](/solution/2500-2599/2586.Count%20the%20Number%20of%20Vowel%20Strings%20in%20Range/README.md) | `数组`,`字符串` | 简单 | 第 336 场周赛 | +| 2587 | [重排数组以得到最大前缀分数](/solution/2500-2599/2587.Rearrange%20Array%20to%20Maximize%20Prefix%20Score/README.md) | `贪心`,`数组`,`前缀和`,`排序` | 中等 | 第 336 场周赛 | +| 2588 | [统计美丽子数组数目](/solution/2500-2599/2588.Count%20the%20Number%20of%20Beautiful%20Subarrays/README.md) | `位运算`,`数组`,`哈希表`,`前缀和` | 中等 | 第 336 场周赛 | +| 2589 | [完成所有任务的最少时间](/solution/2500-2599/2589.Minimum%20Time%20to%20Complete%20All%20Tasks/README.md) | `栈`,`贪心`,`数组`,`二分查找`,`排序` | 困难 | 第 336 场周赛 | +| 2590 | [设计一个待办事项清单](/solution/2500-2599/2590.Design%20a%20Todo%20List/README.md) | `设计`,`数组`,`哈希表`,`字符串`,`排序` | 中等 | 🔒 | +| 2591 | [将钱分给最多的儿童](/solution/2500-2599/2591.Distribute%20Money%20to%20Maximum%20Children/README.md) | `贪心`,`数学` | 简单 | 第 100 场双周赛 | +| 2592 | [最大化数组的伟大值](/solution/2500-2599/2592.Maximize%20Greatness%20of%20an%20Array/README.md) | `贪心`,`数组`,`双指针`,`排序` | 中等 | 第 100 场双周赛 | +| 2593 | [标记所有元素后数组的分数](/solution/2500-2599/2593.Find%20Score%20of%20an%20Array%20After%20Marking%20All%20Elements/README.md) | `数组`,`哈希表`,`排序`,`模拟`,`堆（优先队列）` | 中等 | 第 100 场双周赛 | +| 2594 | [修车的最少时间](/solution/2500-2599/2594.Minimum%20Time%20to%20Repair%20Cars/README.md) | `数组`,`二分查找` | 中等 | 第 100 场双周赛 | +| 2595 | [奇偶位数](/solution/2500-2599/2595.Number%20of%20Even%20and%20Odd%20Bits/README.md) | `位运算` | 简单 | 第 337 场周赛 | +| 2596 | [检查骑士巡视方案](/solution/2500-2599/2596.Check%20Knight%20Tour%20Configuration/README.md) | `深度优先搜索`,`广度优先搜索`,`数组`,`矩阵`,`模拟` | 中等 | 第 337 场周赛 | +| 2597 | [美丽子集的数目](/solution/2500-2599/2597.The%20Number%20of%20Beautiful%20Subsets/README.md) | `数组`,`动态规划`,`回溯`,`排序` | 中等 | 第 337 场周赛 | +| 2598 | [执行操作后的最大 MEX](/solution/2500-2599/2598.Smallest%20Missing%20Non-negative%20Integer%20After%20Operations/README.md) | `贪心`,`数组`,`哈希表`,`数学` | 中等 | 第 337 场周赛 | +| 2599 | [使前缀和数组非负](/solution/2500-2599/2599.Make%20the%20Prefix%20Sum%20Non-negative/README.md) | `贪心`,`数组`,`堆（优先队列）` | 中等 | 🔒 | +| 2600 | [K 件物品的最大和](/solution/2600-2699/2600.K%20Items%20With%20the%20Maximum%20Sum/README.md) | `贪心`,`数学` | 简单 | 第 338 场周赛 | +| 2601 | [质数减法运算](/solution/2600-2699/2601.Prime%20Subtraction%20Operation/README.md) | `贪心`,`数组`,`数学`,`二分查找`,`数论` | 中等 | 第 338 场周赛 | +| 2602 | [使数组元素全部相等的最少操作次数](/solution/2600-2699/2602.Minimum%20Operations%20to%20Make%20All%20Array%20Elements%20Equal/README.md) | `数组`,`二分查找`,`前缀和`,`排序` | 中等 | 第 338 场周赛 | +| 2603 | [收集树中金币](/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README.md) | `树`,`图`,`拓扑排序`,`数组` | 困难 | 第 338 场周赛 | +| 2604 | [吃掉所有谷子的最短时间](/solution/2600-2699/2604.Minimum%20Time%20to%20Eat%20All%20Grains/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 困难 | 🔒 | +| 2605 | [从两个数字数组里生成最小数字](/solution/2600-2699/2605.Form%20Smallest%20Number%20From%20Two%20Digit%20Arrays/README.md) | `数组`,`哈希表`,`枚举` | 简单 | 第 101 场双周赛 | +| 2606 | [找到最大开销的子字符串](/solution/2600-2699/2606.Find%20the%20Substring%20With%20Maximum%20Cost/README.md) | `数组`,`哈希表`,`字符串`,`动态规划` | 中等 | 第 101 场双周赛 | +| 2607 | [使子数组元素和相等](/solution/2600-2699/2607.Make%20K-Subarray%20Sums%20Equal/README.md) | `数组`,`数学`,`数论`,`排序` | 中等 | 第 101 场双周赛 | +| 2608 | [图中的最短环](/solution/2600-2699/2608.Shortest%20Cycle%20in%20a%20Graph/README.md) | `广度优先搜索`,`图` | 困难 | 第 101 场双周赛 | +| 2609 | [最长平衡子字符串](/solution/2600-2699/2609.Find%20the%20Longest%20Balanced%20Substring%20of%20a%20Binary%20String/README.md) | `字符串` | 简单 | 第 339 场周赛 | +| 2610 | [转换二维数组](/solution/2600-2699/2610.Convert%20an%20Array%20Into%20a%202D%20Array%20With%20Conditions/README.md) | `数组`,`哈希表` | 中等 | 第 339 场周赛 | +| 2611 | [老鼠和奶酪](/solution/2600-2699/2611.Mice%20and%20Cheese/README.md) | `贪心`,`数组`,`排序`,`堆（优先队列）` | 中等 | 第 339 场周赛 | +| 2612 | [最少翻转操作数](/solution/2600-2699/2612.Minimum%20Reverse%20Operations/README.md) | `广度优先搜索`,`数组`,`有序集合` | 困难 | 第 339 场周赛 | +| 2613 | [美数对](/solution/2600-2699/2613.Beautiful%20Pairs/README.md) | `几何`,`数组`,`数学`,`分治`,`有序集合`,`排序` | 困难 | 🔒 | +| 2614 | [对角线上的质数](/solution/2600-2699/2614.Prime%20In%20Diagonal/README.md) | `数组`,`数学`,`矩阵`,`数论` | 简单 | 第 340 场周赛 | +| 2615 | [等值距离和](/solution/2600-2699/2615.Sum%20of%20Distances/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 340 场周赛 | +| 2616 | [最小化数对的最大差值](/solution/2600-2699/2616.Minimize%20the%20Maximum%20Difference%20of%20Pairs/README.md) | `贪心`,`数组`,`二分查找` | 中等 | 第 340 场周赛 | +| 2617 | [网格图中最少访问的格子数](/solution/2600-2699/2617.Minimum%20Number%20of%20Visited%20Cells%20in%20a%20Grid/README.md) | `栈`,`广度优先搜索`,`并查集`,`数组`,`动态规划`,`矩阵`,`单调栈`,`堆（优先队列）` | 困难 | 第 340 场周赛 | +| 2618 | [检查是否是类的对象实例](/solution/2600-2699/2618.Check%20if%20Object%20Instance%20of%20Class/README.md) | | 中等 | | +| 2619 | [数组原型对象的最后一个元素](/solution/2600-2699/2619.Array%20Prototype%20Last/README.md) | | 简单 | | +| 2620 | [计数器](/solution/2600-2699/2620.Counter/README.md) | | 简单 | | +| 2621 | [睡眠函数](/solution/2600-2699/2621.Sleep/README.md) | | 简单 | | +| 2622 | [有时间限制的缓存](/solution/2600-2699/2622.Cache%20With%20Time%20Limit/README.md) | | 中等 | | +| 2623 | [记忆函数](/solution/2600-2699/2623.Memoize/README.md) | | 中等 | | +| 2624 | [蜗牛排序](/solution/2600-2699/2624.Snail%20Traversal/README.md) | | 中等 | | +| 2625 | [扁平化嵌套数组](/solution/2600-2699/2625.Flatten%20Deeply%20Nested%20Array/README.md) | | 中等 | | +| 2626 | [数组归约运算](/solution/2600-2699/2626.Array%20Reduce%20Transformation/README.md) | | 简单 | | +| 2627 | [函数防抖](/solution/2600-2699/2627.Debounce/README.md) | | 中等 | | +| 2628 | [完全相等的 JSON 字符串](/solution/2600-2699/2628.JSON%20Deep%20Equal/README.md) | | 中等 | 🔒 | +| 2629 | [复合函数](/solution/2600-2699/2629.Function%20Composition/README.md) | | 简单 | | +| 2630 | [记忆函数 II](/solution/2600-2699/2630.Memoize%20II/README.md) | | 困难 | | +| 2631 | [分组](/solution/2600-2699/2631.Group%20By/README.md) | | 中等 | | +| 2632 | [柯里化](/solution/2600-2699/2632.Curry/README.md) | | 中等 | 🔒 | +| 2633 | [将对象转换为 JSON 字符串](/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README.md) | | 中等 | 🔒 | +| 2634 | [过滤数组中的元素](/solution/2600-2699/2634.Filter%20Elements%20from%20Array/README.md) | | 简单 | | +| 2635 | [转换数组中的每个元素](/solution/2600-2699/2635.Apply%20Transform%20Over%20Each%20Element%20in%20Array/README.md) | | 简单 | | +| 2636 | [Promise 对象池](/solution/2600-2699/2636.Promise%20Pool/README.md) | | 中等 | 🔒 | +| 2637 | [有时间限制的 Promise 对象](/solution/2600-2699/2637.Promise%20Time%20Limit/README.md) | | 中等 | | +| 2638 | [统计 K-Free 子集的总数](/solution/2600-2699/2638.Count%20the%20Number%20of%20K-Free%20Subsets/README.md) | `数组`,`动态规划`,`排序` | 中等 | 🔒 | +| 2639 | [查询网格图中每一列的宽度](/solution/2600-2699/2639.Find%20the%20Width%20of%20Columns%20of%20a%20Grid/README.md) | `数组`,`矩阵` | 简单 | 第 102 场双周赛 | +| 2640 | [一个数组所有前缀的分数](/solution/2600-2699/2640.Find%20the%20Score%20of%20All%20Prefixes%20of%20an%20Array/README.md) | `数组`,`前缀和` | 中等 | 第 102 场双周赛 | +| 2641 | [二叉树的堂兄弟节点 II](/solution/2600-2699/2641.Cousins%20in%20Binary%20Tree%20II/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`,`二叉树` | 中等 | 第 102 场双周赛 | +| 2642 | [设计可以求最短路径的图类](/solution/2600-2699/2642.Design%20Graph%20With%20Shortest%20Path%20Calculator/README.md) | `图`,`设计`,`最短路`,`堆（优先队列）` | 困难 | 第 102 场双周赛 | +| 2643 | [一最多的行](/solution/2600-2699/2643.Row%20With%20Maximum%20Ones/README.md) | `数组`,`矩阵` | 简单 | 第 341 场周赛 | +| 2644 | [找出可整除性得分最大的整数](/solution/2600-2699/2644.Find%20the%20Maximum%20Divisibility%20Score/README.md) | `数组` | 简单 | 第 341 场周赛 | +| 2645 | [构造有效字符串的最少插入数](/solution/2600-2699/2645.Minimum%20Additions%20to%20Make%20Valid%20String/README.md) | `栈`,`贪心`,`字符串`,`动态规划` | 中等 | 第 341 场周赛 | +| 2646 | [最小化旅行的价格总和](/solution/2600-2699/2646.Minimize%20the%20Total%20Price%20of%20the%20Trips/README.md) | `树`,`深度优先搜索`,`图`,`数组`,`动态规划` | 困难 | 第 341 场周赛 | +| 2647 | [把三角形染成红色](/solution/2600-2699/2647.Color%20the%20Triangle%20Red/README.md) | `数组`,`数学` | 困难 | 🔒 | +| 2648 | [生成斐波那契数列](/solution/2600-2699/2648.Generate%20Fibonacci%20Sequence/README.md) | | 简单 | | +| 2649 | [嵌套数组生成器](/solution/2600-2699/2649.Nested%20Array%20Generator/README.md) | | 中等 | | +| 2650 | [设计可取消函数](/solution/2600-2699/2650.Design%20Cancellable%20Function/README.md) | | 困难 | | +| 2651 | [计算列车到站时间](/solution/2600-2699/2651.Calculate%20Delayed%20Arrival%20Time/README.md) | `数学` | 简单 | 第 342 场周赛 | +| 2652 | [倍数求和](/solution/2600-2699/2652.Sum%20Multiples/README.md) | `数学` | 简单 | 第 342 场周赛 | +| 2653 | [滑动子数组的美丽值](/solution/2600-2699/2653.Sliding%20Subarray%20Beauty/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 342 场周赛 | +| 2654 | [使数组所有元素变成 1 的最少操作次数](/solution/2600-2699/2654.Minimum%20Number%20of%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%201/README.md) | `数组`,`数学`,`数论` | 中等 | 第 342 场周赛 | +| 2655 | [寻找最大长度的未覆盖区间](/solution/2600-2699/2655.Find%20Maximal%20Uncovered%20Ranges/README.md) | `数组`,`排序` | 中等 | 🔒 | +| 2656 | [K 个元素的最大和](/solution/2600-2699/2656.Maximum%20Sum%20With%20Exactly%20K%20Elements/README.md) | `贪心`,`数组` | 简单 | 第 103 场双周赛 | +| 2657 | [找到两个数组的前缀公共数组](/solution/2600-2699/2657.Find%20the%20Prefix%20Common%20Array%20of%20Two%20Arrays/README.md) | `位运算`,`数组`,`哈希表` | 中等 | 第 103 场双周赛 | +| 2658 | [网格图中鱼的最大数目](/solution/2600-2699/2658.Maximum%20Number%20of%20Fish%20in%20a%20Grid/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`矩阵` | 中等 | 第 103 场双周赛 | +| 2659 | [将数组清空](/solution/2600-2699/2659.Make%20Array%20Empty/README.md) | `贪心`,`树状数组`,`线段树`,`数组`,`二分查找`,`有序集合`,`排序` | 困难 | 第 103 场双周赛 | +| 2660 | [保龄球游戏的获胜者](/solution/2600-2699/2660.Determine%20the%20Winner%20of%20a%20Bowling%20Game/README.md) | `数组`,`模拟` | 简单 | 第 343 场周赛 | +| 2661 | [找出叠涂元素](/solution/2600-2699/2661.First%20Completely%20Painted%20Row%20or%20Column/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 第 343 场周赛 | +| 2662 | [前往目标的最小代价](/solution/2600-2699/2662.Minimum%20Cost%20of%20a%20Path%20With%20Special%20Roads/README.md) | `图`,`数组`,`最短路`,`堆（优先队列）` | 中等 | 第 343 场周赛 | +| 2663 | [字典序最小的美丽字符串](/solution/2600-2699/2663.Lexicographically%20Smallest%20Beautiful%20String/README.md) | `贪心`,`字符串` | 困难 | 第 343 场周赛 | +| 2664 | [巡逻的骑士](/solution/2600-2699/2664.The%20Knight%E2%80%99s%20Tour/README.md) | `数组`,`回溯`,`矩阵` | 中等 | 🔒 | +| 2665 | [计数器 II](/solution/2600-2699/2665.Counter%20II/README.md) | | 简单 | | +| 2666 | [只允许一次函数调用](/solution/2600-2699/2666.Allow%20One%20Function%20Call/README.md) | | 简单 | | +| 2667 | [创建 Hello World 函数](/solution/2600-2699/2667.Create%20Hello%20World%20Function/README.md) | | 简单 | | +| 2668 | [查询员工当前薪水](/solution/2600-2699/2668.Find%20Latest%20Salaries/README.md) | `数据库` | 简单 | 🔒 | +| 2669 | [统计 Spotify 排行榜上艺术家出现次数](/solution/2600-2699/2669.Count%20Artist%20Occurrences%20On%20Spotify%20Ranking%20List/README.md) | `数据库` | 简单 | 🔒 | +| 2670 | [找出不同元素数目差数组](/solution/2600-2699/2670.Find%20the%20Distinct%20Difference%20Array/README.md) | `数组`,`哈希表` | 简单 | 第 344 场周赛 | +| 2671 | [频率跟踪器](/solution/2600-2699/2671.Frequency%20Tracker/README.md) | `设计`,`哈希表` | 中等 | 第 344 场周赛 | +| 2672 | [有相同颜色的相邻元素数目](/solution/2600-2699/2672.Number%20of%20Adjacent%20Elements%20With%20the%20Same%20Color/README.md) | `数组` | 中等 | 第 344 场周赛 | +| 2673 | [使二叉树所有路径值相等的最小代价](/solution/2600-2699/2673.Make%20Costs%20of%20Paths%20Equal%20in%20a%20Binary%20Tree/README.md) | `贪心`,`树`,`数组`,`动态规划`,`二叉树` | 中等 | 第 344 场周赛 | +| 2674 | [拆分循环链表](/solution/2600-2699/2674.Split%20a%20Circular%20Linked%20List/README.md) | `链表`,`双指针` | 中等 | 🔒 | +| 2675 | [将对象数组转换为矩阵](/solution/2600-2699/2675.Array%20of%20Objects%20to%20Matrix/README.md) | | 困难 | 🔒 | +| 2676 | [节流](/solution/2600-2699/2676.Throttle/README.md) | | 中等 | 🔒 | +| 2677 | [分块数组](/solution/2600-2699/2677.Chunk%20Array/README.md) | | 简单 | | +| 2678 | [老人的数目](/solution/2600-2699/2678.Number%20of%20Senior%20Citizens/README.md) | `数组`,`字符串` | 简单 | 第 104 场双周赛 | +| 2679 | [矩阵中的和](/solution/2600-2699/2679.Sum%20in%20a%20Matrix/README.md) | `数组`,`矩阵`,`排序`,`模拟`,`堆（优先队列）` | 中等 | 第 104 场双周赛 | +| 2680 | [最大或值](/solution/2600-2699/2680.Maximum%20OR/README.md) | `贪心`,`位运算`,`数组`,`前缀和` | 中等 | 第 104 场双周赛 | +| 2681 | [英雄的力量](/solution/2600-2699/2681.Power%20of%20Heroes/README.md) | `数组`,`数学`,`动态规划`,`前缀和`,`排序` | 困难 | 第 104 场双周赛 | +| 2682 | [找出转圈游戏输家](/solution/2600-2699/2682.Find%20the%20Losers%20of%20the%20Circular%20Game/README.md) | `数组`,`哈希表`,`模拟` | 简单 | 第 345 场周赛 | +| 2683 | [相邻值的按位异或](/solution/2600-2699/2683.Neighboring%20Bitwise%20XOR/README.md) | `位运算`,`数组` | 中等 | 第 345 场周赛 | +| 2684 | [矩阵中移动的最大次数](/solution/2600-2699/2684.Maximum%20Number%20of%20Moves%20in%20a%20Grid/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 345 场周赛 | +| 2685 | [统计完全连通分量的数量](/solution/2600-2699/2685.Count%20the%20Number%20of%20Complete%20Components/README.md) | `深度优先搜索`,`广度优先搜索`,`图` | 中等 | 第 345 场周赛 | +| 2686 | [即时食物配送 III](/solution/2600-2699/2686.Immediate%20Food%20Delivery%20III/README.md) | `数据库` | 中等 | 🔒 | +| 2687 | [自行车的最后使用时间](/solution/2600-2699/2687.Bikes%20Last%20Time%20Used/README.md) | `数据库` | 简单 | 🔒 | +| 2688 | [查找活跃用户](/solution/2600-2699/2688.Find%20Active%20Users/README.md) | `数据库` | 中等 | 🔒 | +| 2689 | [从 Rope 树中提取第 K 个字符](/solution/2600-2699/2689.Extract%20Kth%20Character%20From%20The%20Rope%20Tree/README.md) | `树`,`深度优先搜索`,`二叉树` | 简单 | 🔒 | +| 2690 | [无穷方法对象](/solution/2600-2699/2690.Infinite%20Method%20Object/README.md) | | 简单 | 🔒 | +| 2691 | [不可变辅助工具](/solution/2600-2699/2691.Immutability%20Helper/README.md) | | 困难 | 🔒 | +| 2692 | [使对象不可变](/solution/2600-2699/2692.Make%20Object%20Immutable/README.md) | | 中等 | 🔒 | +| 2693 | [使用自定义上下文调用函数](/solution/2600-2699/2693.Call%20Function%20with%20Custom%20Context/README.md) | | 中等 | | +| 2694 | [事件发射器](/solution/2600-2699/2694.Event%20Emitter/README.md) | | 中等 | | +| 2695 | [包装数组](/solution/2600-2699/2695.Array%20Wrapper/README.md) | | 简单 | | +| 2696 | [删除子串后的字符串最小长度](/solution/2600-2699/2696.Minimum%20String%20Length%20After%20Removing%20Substrings/README.md) | `栈`,`字符串`,`模拟` | 简单 | 第 346 场周赛 | +| 2697 | [字典序最小回文串](/solution/2600-2699/2697.Lexicographically%20Smallest%20Palindrome/README.md) | `贪心`,`双指针`,`字符串` | 简单 | 第 346 场周赛 | +| 2698 | [求一个整数的惩罚数](/solution/2600-2699/2698.Find%20the%20Punishment%20Number%20of%20an%20Integer/README.md) | `数学`,`回溯` | 中等 | 第 346 场周赛 | +| 2699 | [修改图中的边权](/solution/2600-2699/2699.Modify%20Graph%20Edge%20Weights/README.md) | `图`,`最短路`,`堆（优先队列）` | 困难 | 第 346 场周赛 | +| 2700 | [两个对象之间的差异](/solution/2700-2799/2700.Differences%20Between%20Two%20Objects/README.md) | | 中等 | 🔒 | +| 2701 | [连续递增交易](/solution/2700-2799/2701.Consecutive%20Transactions%20with%20Increasing%20Amounts/README.md) | `数据库` | 困难 | 🔒 | +| 2702 | [使数字变为非正数的最小操作次数](/solution/2700-2799/2702.Minimum%20Operations%20to%20Make%20Numbers%20Non-positive/README.md) | `数组`,`二分查找` | 困难 | 🔒 | +| 2703 | [返回传递的参数的长度](/solution/2700-2799/2703.Return%20Length%20of%20Arguments%20Passed/README.md) | | 简单 | | +| 2704 | [相等还是不相等](/solution/2700-2799/2704.To%20Be%20Or%20Not%20To%20Be/README.md) | | 简单 | | +| 2705 | [精简对象](/solution/2700-2799/2705.Compact%20Object/README.md) | | 中等 | | +| 2706 | [购买两块巧克力](/solution/2700-2799/2706.Buy%20Two%20Chocolates/README.md) | `数组`,`排序` | 简单 | 第 105 场双周赛 | +| 2707 | [字符串中的额外字符](/solution/2700-2799/2707.Extra%20Characters%20in%20a%20String/README.md) | `字典树`,`数组`,`哈希表`,`字符串`,`动态规划` | 中等 | 第 105 场双周赛 | +| 2708 | [一个小组的最大实力值](/solution/2700-2799/2708.Maximum%20Strength%20of%20a%20Group/README.md) | `贪心`,`位运算`,`数组`,`动态规划`,`回溯`,`枚举`,`排序` | 中等 | 第 105 场双周赛 | +| 2709 | [最大公约数遍历](/solution/2700-2799/2709.Greatest%20Common%20Divisor%20Traversal/README.md) | `并查集`,`数组`,`数学`,`数论` | 困难 | 第 105 场双周赛 | +| 2710 | [移除字符串中的尾随零](/solution/2700-2799/2710.Remove%20Trailing%20Zeros%20From%20a%20String/README.md) | `字符串` | 简单 | 第 347 场周赛 | +| 2711 | [对角线上不同值的数量差](/solution/2700-2799/2711.Difference%20of%20Number%20of%20Distinct%20Values%20on%20Diagonals/README.md) | `数组`,`哈希表`,`矩阵` | 中等 | 第 347 场周赛 | +| 2712 | [使所有字符相等的最小成本](/solution/2700-2799/2712.Minimum%20Cost%20to%20Make%20All%20Characters%20Equal/README.md) | `贪心`,`字符串`,`动态规划` | 中等 | 第 347 场周赛 | +| 2713 | [矩阵中严格递增的单元格数](/solution/2700-2799/2713.Maximum%20Strictly%20Increasing%20Cells%20in%20a%20Matrix/README.md) | `记忆化搜索`,`数组`,`哈希表`,`二分查找`,`动态规划`,`矩阵`,`有序集合`,`排序` | 困难 | 第 347 场周赛 | +| 2714 | [找到 K 次跨越的最短路径](/solution/2700-2799/2714.Find%20Shortest%20Path%20with%20K%20Hops/README.md) | `图`,`最短路`,`堆（优先队列）` | 困难 | 🔒 | +| 2715 | [执行可取消的延迟函数](/solution/2700-2799/2715.Timeout%20Cancellation/README.md) | | 简单 | | +| 2716 | [最小化字符串长度](/solution/2700-2799/2716.Minimize%20String%20Length/README.md) | `哈希表`,`字符串` | 简单 | 第 348 场周赛 | +| 2717 | [半有序排列](/solution/2700-2799/2717.Semi-Ordered%20Permutation/README.md) | `数组`,`模拟` | 简单 | 第 348 场周赛 | +| 2718 | [查询后矩阵的和](/solution/2700-2799/2718.Sum%20of%20Matrix%20After%20Queries/README.md) | `数组`,`哈希表` | 中等 | 第 348 场周赛 | +| 2719 | [统计整数数目](/solution/2700-2799/2719.Count%20of%20Integers/README.md) | `数学`,`字符串`,`动态规划` | 困难 | 第 348 场周赛 | +| 2720 | [受欢迎度百分比](/solution/2700-2799/2720.Popularity%20Percentage/README.md) | `数据库` | 困难 | 🔒 | +| 2721 | [并行执行异步函数](/solution/2700-2799/2721.Execute%20Asynchronous%20Functions%20in%20Parallel/README.md) | | 中等 | | +| 2722 | [根据 ID 合并两个数组](/solution/2700-2799/2722.Join%20Two%20Arrays%20by%20ID/README.md) | | 中等 | | +| 2723 | [两个 Promise 对象相加](/solution/2700-2799/2723.Add%20Two%20Promises/README.md) | | 简单 | | +| 2724 | [排序方式](/solution/2700-2799/2724.Sort%20By/README.md) | | 简单 | | +| 2725 | [间隔取消](/solution/2700-2799/2725.Interval%20Cancellation/README.md) | | 简单 | | +| 2726 | [使用方法链的计算器](/solution/2700-2799/2726.Calculator%20with%20Method%20Chaining/README.md) | | 简单 | | +| 2727 | [判断对象是否为空](/solution/2700-2799/2727.Is%20Object%20Empty/README.md) | | 简单 | | +| 2728 | [计算一个环形街道上的房屋数量](/solution/2700-2799/2728.Count%20Houses%20in%20a%20Circular%20Street/README.md) | `数组`,`交互` | 简单 | 🔒 | +| 2729 | [判断一个数是否迷人](/solution/2700-2799/2729.Check%20if%20The%20Number%20is%20Fascinating/README.md) | `哈希表`,`数学` | 简单 | 第 106 场双周赛 | +| 2730 | [找到最长的半重复子字符串](/solution/2700-2799/2730.Find%20the%20Longest%20Semi-Repetitive%20Substring/README.md) | `字符串`,`滑动窗口` | 中等 | 第 106 场双周赛 | +| 2731 | [移动机器人](/solution/2700-2799/2731.Movement%20of%20Robots/README.md) | `脑筋急转弯`,`数组`,`前缀和`,`排序` | 中等 | 第 106 场双周赛 | +| 2732 | [找到矩阵中的好子集](/solution/2700-2799/2732.Find%20a%20Good%20Subset%20of%20the%20Matrix/README.md) | `位运算`,`数组`,`哈希表`,`矩阵` | 困难 | 第 106 场双周赛 | +| 2733 | [既不是最小值也不是最大值](/solution/2700-2799/2733.Neither%20Minimum%20nor%20Maximum/README.md) | `数组`,`排序` | 简单 | 第 349 场周赛 | +| 2734 | [执行子串操作后的字典序最小字符串](/solution/2700-2799/2734.Lexicographically%20Smallest%20String%20After%20Substring%20Operation/README.md) | `贪心`,`字符串` | 中等 | 第 349 场周赛 | +| 2735 | [收集巧克力](/solution/2700-2799/2735.Collecting%20Chocolates/README.md) | `数组`,`枚举` | 中等 | 第 349 场周赛 | +| 2736 | [最大和查询](/solution/2700-2799/2736.Maximum%20Sum%20Queries/README.md) | `栈`,`树状数组`,`线段树`,`数组`,`二分查找`,`排序`,`单调栈` | 困难 | 第 349 场周赛 | +| 2737 | [找到最近的标记节点](/solution/2700-2799/2737.Find%20the%20Closest%20Marked%20Node/README.md) | `图`,`数组`,`最短路`,`堆（优先队列）` | 中等 | 🔒 | +| 2738 | [统计文本中单词的出现次数](/solution/2700-2799/2738.Count%20Occurrences%20in%20Text/README.md) | `数据库` | 中等 | 🔒 | +| 2739 | [总行驶距离](/solution/2700-2799/2739.Total%20Distance%20Traveled/README.md) | `数学`,`模拟` | 简单 | 第 350 场周赛 | +| 2740 | [找出分区值](/solution/2700-2799/2740.Find%20the%20Value%20of%20the%20Partition/README.md) | `数组`,`排序` | 中等 | 第 350 场周赛 | +| 2741 | [特别的排列](/solution/2700-2799/2741.Special%20Permutations/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 中等 | 第 350 场周赛 | +| 2742 | [给墙壁刷油漆](/solution/2700-2799/2742.Painting%20the%20Walls/README.md) | `数组`,`动态规划` | 困难 | 第 350 场周赛 | +| 2743 | [计算没有重复字符的子字符串数量](/solution/2700-2799/2743.Count%20Substrings%20Without%20Repeating%20Character/README.md) | `哈希表`,`字符串`,`滑动窗口` | 中等 | 🔒 | +| 2744 | [最大字符串配对数目](/solution/2700-2799/2744.Find%20Maximum%20Number%20of%20String%20Pairs/README.md) | `数组`,`哈希表`,`字符串`,`模拟` | 简单 | 第 107 场双周赛 | +| 2745 | [构造最长的新字符串](/solution/2700-2799/2745.Construct%20the%20Longest%20New%20String/README.md) | `贪心`,`脑筋急转弯`,`数学`,`动态规划` | 中等 | 第 107 场双周赛 | +| 2746 | [字符串连接删减字母](/solution/2700-2799/2746.Decremental%20String%20Concatenation/README.md) | `数组`,`字符串`,`动态规划` | 中等 | 第 107 场双周赛 | +| 2747 | [统计没有收到请求的服务器数目](/solution/2700-2799/2747.Count%20Zero%20Request%20Servers/README.md) | `数组`,`哈希表`,`排序`,`滑动窗口` | 中等 | 第 107 场双周赛 | +| 2748 | [美丽下标对的数目](/solution/2700-2799/2748.Number%20of%20Beautiful%20Pairs/README.md) | `数组`,`哈希表`,`数学`,`计数`,`数论` | 简单 | 第 351 场周赛 | +| 2749 | [得到整数零需要执行的最少操作数](/solution/2700-2799/2749.Minimum%20Operations%20to%20Make%20the%20Integer%20Zero/README.md) | `位运算`,`脑筋急转弯` | 中等 | 第 351 场周赛 | +| 2750 | [将数组划分成若干好子数组的方式](/solution/2700-2799/2750.Ways%20to%20Split%20Array%20Into%20Good%20Subarrays/README.md) | `数组`,`数学` | 中等 | 第 351 场周赛 | +| 2751 | [机器人碰撞](/solution/2700-2799/2751.Robot%20Collisions/README.md) | `栈`,`数组`,`排序`,`模拟` | 困难 | 第 351 场周赛 | +| 2752 | [在连续天数上进行了最多交易次数的顾客](/solution/2700-2799/2752.Customers%20with%20Maximum%20Number%20of%20Transactions%20on%20Consecutive%20Days/README.md) | `数据库` | 困难 | 🔒 | +| 2753 | [计算一个环形街道上的房屋数量 II](/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README.md) | | 困难 | 🔒 | +| 2754 | [将函数绑定到上下文](/solution/2700-2799/2754.Bind%20Function%20to%20Context/README.md) | | 中等 | 🔒 | +| 2755 | [深度合并两个对象](/solution/2700-2799/2755.Deep%20Merge%20of%20Two%20Objects/README.md) | | 中等 | 🔒 | +| 2756 | [批处理查询](/solution/2700-2799/2756.Query%20Batching/README.md) | | 困难 | 🔒 | +| 2757 | [生成循环数组的值](/solution/2700-2799/2757.Generate%20Circular%20Array%20Values/README.md) | | 中等 | 🔒 | +| 2758 | [下一天](/solution/2700-2799/2758.Next%20Day/README.md) | | 简单 | 🔒 | +| 2759 | [将 JSON 字符串转换为对象](/solution/2700-2799/2759.Convert%20JSON%20String%20to%20Object/README.md) | | 困难 | 🔒 | +| 2760 | [最长奇偶子数组](/solution/2700-2799/2760.Longest%20Even%20Odd%20Subarray%20With%20Threshold/README.md) | `数组`,`滑动窗口` | 简单 | 第 352 场周赛 | +| 2761 | [和等于目标值的质数对](/solution/2700-2799/2761.Prime%20Pairs%20With%20Target%20Sum/README.md) | `数组`,`数学`,`枚举`,`数论` | 中等 | 第 352 场周赛 | +| 2762 | [不间断子数组](/solution/2700-2799/2762.Continuous%20Subarrays/README.md) | `队列`,`数组`,`有序集合`,`滑动窗口`,`单调队列`,`堆（优先队列）` | 中等 | 第 352 场周赛 | +| 2763 | [所有子数组中不平衡数字之和](/solution/2700-2799/2763.Sum%20of%20Imbalance%20Numbers%20of%20All%20Subarrays/README.md) | `数组`,`哈希表`,`有序集合` | 困难 | 第 352 场周赛 | +| 2764 | [数组是否表示某二叉树的前序遍历](/solution/2700-2799/2764.Is%20Array%20a%20Preorder%20of%20Some%20%E2%80%8CBinary%20Tree/README.md) | `栈`,`树`,`深度优先搜索`,`二叉树` | 中等 | 🔒 | +| 2765 | [最长交替子数组](/solution/2700-2799/2765.Longest%20Alternating%20Subarray/README.md) | `数组`,`枚举` | 简单 | 第 108 场双周赛 | +| 2766 | [重新放置石块](/solution/2700-2799/2766.Relocate%20Marbles/README.md) | `数组`,`哈希表`,`排序`,`模拟` | 中等 | 第 108 场双周赛 | +| 2767 | [将字符串分割为最少的美丽子字符串](/solution/2700-2799/2767.Partition%20String%20Into%20Minimum%20Beautiful%20Substrings/README.md) | `哈希表`,`字符串`,`动态规划`,`回溯` | 中等 | 第 108 场双周赛 | +| 2768 | [黑格子的数目](/solution/2700-2799/2768.Number%20of%20Black%20Blocks/README.md) | `数组`,`哈希表`,`枚举` | 中等 | 第 108 场双周赛 | +| 2769 | [找出最大的可达成数字](/solution/2700-2799/2769.Find%20the%20Maximum%20Achievable%20Number/README.md) | `数学` | 简单 | 第 353 场周赛 | +| 2770 | [达到末尾下标所需的最大跳跃次数](/solution/2700-2799/2770.Maximum%20Number%20of%20Jumps%20to%20Reach%20the%20Last%20Index/README.md) | `数组`,`动态规划` | 中等 | 第 353 场周赛 | +| 2771 | [构造最长非递减子数组](/solution/2700-2799/2771.Longest%20Non-decreasing%20Subarray%20From%20Two%20Arrays/README.md) | `数组`,`动态规划` | 中等 | 第 353 场周赛 | +| 2772 | [使数组中的所有元素都等于零](/solution/2700-2799/2772.Apply%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%20Zero/README.md) | `数组`,`前缀和` | 中等 | 第 353 场周赛 | +| 2773 | [特殊二叉树的高度](/solution/2700-2799/2773.Height%20of%20Special%20Binary%20Tree/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | +| 2774 | [数组的上界](/solution/2700-2799/2774.Array%20Upper%20Bound/README.md) | | 简单 | 🔒 | +| 2775 | [将 undefined 转为 null](/solution/2700-2799/2775.Undefined%20to%20Null/README.md) | | 中等 | 🔒 | +| 2776 | [转换回调函数为 Promise 函数](/solution/2700-2799/2776.Convert%20Callback%20Based%20Function%20to%20Promise%20Based%20Function/README.md) | | 中等 | 🔒 | +| 2777 | [日期范围生成器](/solution/2700-2799/2777.Date%20Range%20Generator/README.md) | | 中等 | 🔒 | +| 2778 | [特殊元素平方和](/solution/2700-2799/2778.Sum%20of%20Squares%20of%20Special%20Elements/README.md) | `数组`,`枚举` | 简单 | 第 354 场周赛 | +| 2779 | [数组的最大美丽值](/solution/2700-2799/2779.Maximum%20Beauty%20of%20an%20Array%20After%20Applying%20Operation/README.md) | `数组`,`二分查找`,`排序`,`滑动窗口` | 中等 | 第 354 场周赛 | +| 2780 | [合法分割的最小下标](/solution/2700-2799/2780.Minimum%20Index%20of%20a%20Valid%20Split/README.md) | `数组`,`哈希表`,`排序` | 中等 | 第 354 场周赛 | +| 2781 | [最长合法子字符串的长度](/solution/2700-2799/2781.Length%20of%20the%20Longest%20Valid%20Substring/README.md) | `数组`,`哈希表`,`字符串`,`滑动窗口` | 困难 | 第 354 场周赛 | +| 2782 | [唯一类别的数量](/solution/2700-2799/2782.Number%20of%20Unique%20Categories/README.md) | `并查集`,`计数`,`交互` | 中等 | 🔒 | +| 2783 | [航班入座率和等待名单分析](/solution/2700-2799/2783.Flight%20Occupancy%20and%20Waitlist%20Analysis/README.md) | `数据库` | 中等 | 🔒 | +| 2784 | [检查数组是否是好的](/solution/2700-2799/2784.Check%20if%20Array%20is%20Good/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 109 场双周赛 | +| 2785 | [将字符串中的元音字母排序](/solution/2700-2799/2785.Sort%20Vowels%20in%20a%20String/README.md) | `字符串`,`排序` | 中等 | 第 109 场双周赛 | +| 2786 | [访问数组中的位置使分数最大](/solution/2700-2799/2786.Visit%20Array%20Positions%20to%20Maximize%20Score/README.md) | `数组`,`动态规划` | 中等 | 第 109 场双周赛 | +| 2787 | [将一个数字表示成幂的和的方案数](/solution/2700-2799/2787.Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers/README.md) | `动态规划` | 中等 | 第 109 场双周赛 | +| 2788 | [按分隔符拆分字符串](/solution/2700-2799/2788.Split%20Strings%20by%20Separator/README.md) | `数组`,`字符串` | 简单 | 第 355 场周赛 | +| 2789 | [合并后数组中的最大元素](/solution/2700-2799/2789.Largest%20Element%20in%20an%20Array%20after%20Merge%20Operations/README.md) | `贪心`,`数组` | 中等 | 第 355 场周赛 | +| 2790 | [长度递增组的最大数目](/solution/2700-2799/2790.Maximum%20Number%20of%20Groups%20With%20Increasing%20Length/README.md) | `贪心`,`数组`,`数学`,`二分查找`,`排序` | 困难 | 第 355 场周赛 | +| 2791 | [树中可以形成回文的路径数](/solution/2700-2799/2791.Count%20Paths%20That%20Can%20Form%20a%20Palindrome%20in%20a%20Tree/README.md) | `位运算`,`树`,`深度优先搜索`,`动态规划`,`状态压缩` | 困难 | 第 355 场周赛 | +| 2792 | [计算足够大的节点数](/solution/2700-2799/2792.Count%20Nodes%20That%20Are%20Great%20Enough/README.md) | `树`,`深度优先搜索`,`分治`,`二叉树` | 困难 | 🔒 | +| 2793 | [航班机票状态](/solution/2700-2799/2793.Status%20of%20Flight%20Tickets/README.md) | | 困难 | 🔒 | +| 2794 | [从两个数组中创建对象](/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README.md) | | 简单 | 🔒 | +| 2795 | [并行执行 Promise 以获取独有的结果](/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README.md) | | 中等 | 🔒 | +| 2796 | [重复字符串](/solution/2700-2799/2796.Repeat%20String/README.md) | | 简单 | 🔒 | +| 2797 | [带有占位符的部分函数](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README.md) | | 简单 | 🔒 | +| 2798 | [满足目标工作时长的员工数目](/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README.md) | `数组` | 简单 | 第 356 场周赛 | +| 2799 | [统计完全子数组的数目](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 356 场周赛 | +| 2800 | [包含三个字符串的最短字符串](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README.md) | `贪心`,`字符串`,`枚举` | 中等 | 第 356 场周赛 | +| 2801 | [统计范围内的步进数字数目](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README.md) | `字符串`,`动态规划` | 困难 | 第 356 场周赛 | +| 2802 | [找出第 K 个幸运数字](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README.md) | `位运算`,`数学`,`字符串` | 中等 | 🔒 | +| 2803 | [阶乘生成器](/solution/2800-2899/2803.Factorial%20Generator/README.md) | | 简单 | 🔒 | +| 2804 | [数组原型的 forEach 方法](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README.md) | | 简单 | 🔒 | +| 2805 | [自定义间隔](/solution/2800-2899/2805.Custom%20Interval/README.md) | | 中等 | 🔒 | +| 2806 | [取整购买后的账户余额](/solution/2800-2899/2806.Account%20Balance%20After%20Rounded%20Purchase/README.md) | `数学` | 简单 | 第 110 场双周赛 | +| 2807 | [在链表中插入最大公约数](/solution/2800-2899/2807.Insert%20Greatest%20Common%20Divisors%20in%20Linked%20List/README.md) | `链表`,`数学`,`数论` | 中等 | 第 110 场双周赛 | +| 2808 | [使循环数组所有元素相等的最少秒数](/solution/2800-2899/2808.Minimum%20Seconds%20to%20Equalize%20a%20Circular%20Array/README.md) | `数组`,`哈希表` | 中等 | 第 110 场双周赛 | +| 2809 | [使数组和小于等于 x 的最少时间](/solution/2800-2899/2809.Minimum%20Time%20to%20Make%20Array%20Sum%20At%20Most%20x/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 110 场双周赛 | +| 2810 | [故障键盘](/solution/2800-2899/2810.Faulty%20Keyboard/README.md) | `字符串`,`模拟` | 简单 | 第 357 场周赛 | +| 2811 | [判断是否能拆分数组](/solution/2800-2899/2811.Check%20if%20it%20is%20Possible%20to%20Split%20Array/README.md) | `贪心`,`数组`,`动态规划` | 中等 | 第 357 场周赛 | +| 2812 | [找出最安全路径](/solution/2800-2899/2812.Find%20the%20Safest%20Path%20in%20a%20Grid/README.md) | `广度优先搜索`,`并查集`,`数组`,`二分查找`,`矩阵` | 中等 | 第 357 场周赛 | +| 2813 | [子序列最大优雅度](/solution/2800-2899/2813.Maximum%20Elegance%20of%20a%20K-Length%20Subsequence/README.md) | `栈`,`贪心`,`数组`,`哈希表`,`排序`,`堆（优先队列）` | 困难 | 第 357 场周赛 | +| 2814 | [避免淹死并到达目的地的最短时间](/solution/2800-2899/2814.Minimum%20Time%20Takes%20to%20Reach%20Destination%20Without%20Drowning/README.md) | `广度优先搜索`,`数组`,`矩阵` | 困难 | 🔒 | +| 2815 | [数组中的最大数对和](/solution/2800-2899/2815.Max%20Pair%20Sum%20in%20an%20Array/README.md) | `数组`,`哈希表` | 简单 | 第 358 场周赛 | +| 2816 | [翻倍以链表形式表示的数字](/solution/2800-2899/2816.Double%20a%20Number%20Represented%20as%20a%20Linked%20List/README.md) | `栈`,`链表`,`数学` | 中等 | 第 358 场周赛 | +| 2817 | [限制条件下元素之间的最小绝对差](/solution/2800-2899/2817.Minimum%20Absolute%20Difference%20Between%20Elements%20With%20Constraint/README.md) | `数组`,`二分查找`,`有序集合` | 中等 | 第 358 场周赛 | +| 2818 | [操作使得分最大](/solution/2800-2899/2818.Apply%20Operations%20to%20Maximize%20Score/README.md) | `栈`,`贪心`,`数组`,`数学`,`数论`,`单调栈` | 困难 | 第 358 场周赛 | +| 2819 | [购买巧克力后的最小相对损失](/solution/2800-2899/2819.Minimum%20Relative%20Loss%20After%20Buying%20Chocolates/README.md) | `数组`,`二分查找`,`前缀和`,`排序` | 困难 | 🔒 | +| 2820 | [选举结果](/solution/2800-2899/2820.Election%20Results/README.md) | | 中等 | 🔒 | +| 2821 | [延迟每个 Promise 对象的解析](/solution/2800-2899/2821.Delay%20the%20Resolution%20of%20Each%20Promise/README.md) | | 中等 | 🔒 | +| 2822 | [对象反转](/solution/2800-2899/2822.Inversion%20of%20Object/README.md) | | 简单 | 🔒 | +| 2823 | [深度对象筛选](/solution/2800-2899/2823.Deep%20Object%20Filter/README.md) | | 中等 | 🔒 | +| 2824 | [统计和小于目标的下标对数目](/solution/2800-2899/2824.Count%20Pairs%20Whose%20Sum%20is%20Less%20than%20Target/README.md) | `数组`,`双指针`,`二分查找`,`排序` | 简单 | 第 111 场双周赛 | +| 2825 | [循环增长使字符串子序列等于另一个字符串](/solution/2800-2899/2825.Make%20String%20a%20Subsequence%20Using%20Cyclic%20Increments/README.md) | `双指针`,`字符串` | 中等 | 第 111 场双周赛 | +| 2826 | [将三个组排序](/solution/2800-2899/2826.Sorting%20Three%20Groups/README.md) | `数组`,`二分查找`,`动态规划` | 中等 | 第 111 场双周赛 | +| 2827 | [范围中美丽整数的数目](/solution/2800-2899/2827.Number%20of%20Beautiful%20Integers%20in%20the%20Range/README.md) | `数学`,`动态规划` | 困难 | 第 111 场双周赛 | +| 2828 | [判别首字母缩略词](/solution/2800-2899/2828.Check%20if%20a%20String%20Is%20an%20Acronym%20of%20Words/README.md) | `数组`,`字符串` | 简单 | 第 359 场周赛 | +| 2829 | [k-avoiding 数组的最小总和](/solution/2800-2899/2829.Determine%20the%20Minimum%20Sum%20of%20a%20k-avoiding%20Array/README.md) | `贪心`,`数学` | 中等 | 第 359 场周赛 | +| 2830 | [销售利润最大化](/solution/2800-2899/2830.Maximize%20the%20Profit%20as%20the%20Salesman/README.md) | `数组`,`哈希表`,`二分查找`,`动态规划`,`排序` | 中等 | 第 359 场周赛 | +| 2831 | [找出最长等值子数组](/solution/2800-2899/2831.Find%20the%20Longest%20Equal%20Subarray/README.md) | `数组`,`哈希表`,`二分查找`,`滑动窗口` | 中等 | 第 359 场周赛 | +| 2832 | [每个元素为最大值的最大范围](/solution/2800-2899/2832.Maximal%20Range%20That%20Each%20Element%20Is%20Maximum%20in%20It/README.md) | `栈`,`数组`,`单调栈` | 中等 | 🔒 | +| 2833 | [距离原点最远的点](/solution/2800-2899/2833.Furthest%20Point%20From%20Origin/README.md) | `字符串`,`计数` | 简单 | 第 360 场周赛 | +| 2834 | [找出美丽数组的最小和](/solution/2800-2899/2834.Find%20the%20Minimum%20Possible%20Sum%20of%20a%20Beautiful%20Array/README.md) | `贪心`,`数学` | 中等 | 第 360 场周赛 | +| 2835 | [使子序列的和等于目标的最少操作次数](/solution/2800-2899/2835.Minimum%20Operations%20to%20Form%20Subsequence%20With%20Target%20Sum/README.md) | `贪心`,`位运算`,`数组` | 困难 | 第 360 场周赛 | +| 2836 | [在传球游戏中最大化函数值](/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README.md) | `位运算`,`数组`,`动态规划` | 困难 | 第 360 场周赛 | +| 2837 | [总旅行距离](/solution/2800-2899/2837.Total%20Traveled%20Distance/README.md) | `数据库` | 简单 | 🔒 | +| 2838 | [英雄可以获得的最大金币数](/solution/2800-2899/2838.Maximum%20Coins%20Heroes%20Can%20Collect/README.md) | `数组`,`双指针`,`二分查找`,`前缀和`,`排序` | 中等 | 🔒 | +| 2839 | [判断通过操作能否让字符串相等 I](/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README.md) | `字符串` | 简单 | 第 112 场双周赛 | +| 2840 | [判断通过操作能否让字符串相等 II](/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README.md) | `哈希表`,`字符串`,`排序` | 中等 | 第 112 场双周赛 | +| 2841 | [几乎唯一子数组的最大和](/solution/2800-2899/2841.Maximum%20Sum%20of%20Almost%20Unique%20Subarray/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 112 场双周赛 | +| 2842 | [统计一个字符串的 k 子序列美丽值最大的数目](/solution/2800-2899/2842.Count%20K-Subsequences%20of%20a%20String%20With%20Maximum%20Beauty/README.md) | `贪心`,`哈希表`,`数学`,`字符串`,`组合数学` | 困难 | 第 112 场双周赛 | +| 2843 | [统计对称整数的数目](/solution/2800-2899/2843.Count%20Symmetric%20Integers/README.md) | `数学`,`枚举` | 简单 | 第 361 场周赛 | +| 2844 | [生成特殊数字的最少操作](/solution/2800-2899/2844.Minimum%20Operations%20to%20Make%20a%20Special%20Number/README.md) | `贪心`,`数学`,`字符串`,`枚举` | 中等 | 第 361 场周赛 | +| 2845 | [统计趣味子数组的数目](/solution/2800-2899/2845.Count%20of%20Interesting%20Subarrays/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 361 场周赛 | +| 2846 | [边权重均等查询](/solution/2800-2899/2846.Minimum%20Edge%20Weight%20Equilibrium%20Queries%20in%20a%20Tree/README.md) | `树`,`图`,`数组`,`强连通分量` | 困难 | 第 361 场周赛 | +| 2847 | [给定数字乘积的最小数字](/solution/2800-2899/2847.Smallest%20Number%20With%20Given%20Digit%20Product/README.md) | `贪心`,`数学` | 中等 | 🔒 | +| 2848 | [与车相交的点](/solution/2800-2899/2848.Points%20That%20Intersect%20With%20Cars/README.md) | `数组`,`哈希表`,`前缀和` | 简单 | 第 362 场周赛 | +| 2849 | [判断能否在给定时间到达单元格](/solution/2800-2899/2849.Determine%20if%20a%20Cell%20Is%20Reachable%20at%20a%20Given%20Time/README.md) | `数学` | 中等 | 第 362 场周赛 | +| 2850 | [将石头分散到网格图的最少移动次数](/solution/2800-2899/2850.Minimum%20Moves%20to%20Spread%20Stones%20Over%20Grid/README.md) | `广度优先搜索`,`数组`,`动态规划`,`矩阵` | 中等 | 第 362 场周赛 | +| 2851 | [字符串转换](/solution/2800-2899/2851.String%20Transformation/README.md) | `数学`,`字符串`,`动态规划`,`字符串匹配` | 困难 | 第 362 场周赛 | +| 2852 | [所有单元格的远离程度之和](/solution/2800-2899/2852.Sum%20of%20Remoteness%20of%20All%20Cells/README.md) | `深度优先搜索`,`广度优先搜索`,`并查集`,`数组`,`哈希表`,`矩阵` | 中等 | 🔒 | +| 2853 | [最高薪水差异](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README.md) | `数据库` | 简单 | 🔒 | +| 2854 | [滚动平均步数](/solution/2800-2899/2854.Rolling%20Average%20Steps/README.md) | `数据库` | 中等 | 🔒 | +| 2855 | [使数组成为递增数组的最少右移次数](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README.md) | `数组` | 简单 | 第 113 场双周赛 | +| 2856 | [删除数对后的最小数组长度](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README.md) | `贪心`,`数组`,`哈希表`,`双指针`,`二分查找`,`计数` | 中等 | 第 113 场双周赛 | +| 2857 | [统计距离为 k 的点对](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README.md) | `位运算`,`数组`,`哈希表` | 中等 | 第 113 场双周赛 | +| 2858 | [可以到达每一个节点的最少边反转次数](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`动态规划` | 困难 | 第 113 场双周赛 | +| 2859 | [计算 K 置位下标对应元素的和](/solution/2800-2899/2859.Sum%20of%20Values%20at%20Indices%20With%20K%20Set%20Bits/README.md) | `位运算`,`数组` | 简单 | 第 363 场周赛 | +| 2860 | [让所有学生保持开心的分组方法数](/solution/2800-2899/2860.Happy%20Students/README.md) | `数组`,`枚举`,`排序` | 中等 | 第 363 场周赛 | +| 2861 | [最大合金数](/solution/2800-2899/2861.Maximum%20Number%20of%20Alloys/README.md) | `数组`,`二分查找` | 中等 | 第 363 场周赛 | +| 2862 | [完全子集的最大元素和](/solution/2800-2899/2862.Maximum%20Element-Sum%20of%20a%20Complete%20Subset%20of%20Indices/README.md) | `数组`,`数学`,`数论` | 困难 | 第 363 场周赛 | +| 2863 | [最长半递减数组](/solution/2800-2899/2863.Maximum%20Length%20of%20Semi-Decreasing%20Subarrays/README.md) | `数组`,`哈希表`,`排序` | 中等 | 🔒 | +| 2864 | [最大二进制奇数](/solution/2800-2899/2864.Maximum%20Odd%20Binary%20Number/README.md) | `贪心`,`数学`,`字符串` | 简单 | 第 364 场周赛 | +| 2865 | [美丽塔 I](/solution/2800-2899/2865.Beautiful%20Towers%20I/README.md) | `栈`,`数组`,`单调栈` | 中等 | 第 364 场周赛 | +| 2866 | [美丽塔 II](/solution/2800-2899/2866.Beautiful%20Towers%20II/README.md) | `栈`,`数组`,`单调栈` | 中等 | 第 364 场周赛 | +| 2867 | [统计树中的合法路径数目](/solution/2800-2899/2867.Count%20Valid%20Paths%20in%20a%20Tree/README.md) | `树`,`深度优先搜索`,`数学`,`动态规划`,`数论` | 困难 | 第 364 场周赛 | +| 2868 | [单词游戏](/solution/2800-2899/2868.The%20Wording%20Game/README.md) | `数组`,`数学`,`双指针`,`字符串`,`博弈` | 困难 | 🔒 | +| 2869 | [收集元素的最少操作次数](/solution/2800-2899/2869.Minimum%20Operations%20to%20Collect%20Elements/README.md) | `位运算`,`数组`,`哈希表` | 简单 | 第 114 场双周赛 | +| 2870 | [使数组为空的最少操作次数](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README.md) | `贪心`,`数组`,`哈希表`,`计数` | 中等 | 第 114 场双周赛 | +| 2871 | [将数组分割成最多数目的子数组](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README.md) | `贪心`,`位运算`,`数组` | 中等 | 第 114 场双周赛 | +| 2872 | [可以被 K 整除连通块的最大数目](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README.md) | `树`,`深度优先搜索` | 困难 | 第 114 场双周赛 | +| 2873 | [有序三元组中的最大值 I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README.md) | `数组` | 简单 | 第 365 场周赛 | +| 2874 | [有序三元组中的最大值 II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README.md) | `数组` | 中等 | 第 365 场周赛 | +| 2875 | [无限数组的最短子数组](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README.md) | `数组`,`哈希表`,`前缀和`,`滑动窗口` | 中等 | 第 365 场周赛 | +| 2876 | [有向图访问计数](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README.md) | `图`,`记忆化搜索`,`动态规划` | 困难 | 第 365 场周赛 | +| 2877 | [从表中创建 DataFrame](/solution/2800-2899/2877.Create%20a%20DataFrame%20from%20List/README.md) | | 简单 | | +| 2878 | [获取 DataFrame 的大小](/solution/2800-2899/2878.Get%20the%20Size%20of%20a%20DataFrame/README.md) | | 简单 | | +| 2879 | [显示前三行](/solution/2800-2899/2879.Display%20the%20First%20Three%20Rows/README.md) | | 简单 | | +| 2880 | [数据选取](/solution/2800-2899/2880.Select%20Data/README.md) | | 简单 | | +| 2881 | [创建新列](/solution/2800-2899/2881.Create%20a%20New%20Column/README.md) | | 简单 | | +| 2882 | [删去重复的行](/solution/2800-2899/2882.Drop%20Duplicate%20Rows/README.md) | | 简单 | | +| 2883 | [删去丢失的数据](/solution/2800-2899/2883.Drop%20Missing%20Data/README.md) | | 简单 | | +| 2884 | [修改列](/solution/2800-2899/2884.Modify%20Columns/README.md) | | 简单 | | +| 2885 | [重命名列](/solution/2800-2899/2885.Rename%20Columns/README.md) | | 简单 | | +| 2886 | [改变数据类型](/solution/2800-2899/2886.Change%20Data%20Type/README.md) | | 简单 | | +| 2887 | [填充缺失值](/solution/2800-2899/2887.Fill%20Missing%20Data/README.md) | | 简单 | | +| 2888 | [重塑数据：连结](/solution/2800-2899/2888.Reshape%20Data%20Concatenate/README.md) | | 简单 | | +| 2889 | [数据重塑：透视](/solution/2800-2899/2889.Reshape%20Data%20Pivot/README.md) | | 简单 | | +| 2890 | [重塑数据：融合](/solution/2800-2899/2890.Reshape%20Data%20Melt/README.md) | | 简单 | | +| 2891 | [方法链](/solution/2800-2899/2891.Method%20Chaining/README.md) | | 简单 | | +| 2892 | [将相邻元素相乘后得到最小化数组](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README.md) | `贪心`,`数组`,`动态规划` | 中等 | 🔒 | +| 2893 | [计算每个区间内的订单](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README.md) | `数据库` | 中等 | 🔒 | +| 2894 | [分类求和并作差](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README.md) | `数学` | 简单 | 第 366 场周赛 | +| 2895 | [最小处理时间](/solution/2800-2899/2895.Minimum%20Processing%20Time/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 366 场周赛 | +| 2896 | [执行操作使两个字符串相等](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README.md) | `字符串`,`动态规划` | 中等 | 第 366 场周赛 | +| 2897 | [对数组执行操作使平方和最大](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README.md) | `贪心`,`位运算`,`数组`,`哈希表` | 困难 | 第 366 场周赛 | +| 2898 | [最大线性股票得分](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README.md) | `数组`,`哈希表` | 中等 | 🔒 | +| 2899 | [上一个遍历的整数](/solution/2800-2899/2899.Last%20Visited%20Integers/README.md) | `数组`,`模拟` | 简单 | 第 115 场双周赛 | +| 2900 | [最长相邻不相等子序列 I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README.md) | `贪心`,`数组`,`字符串`,`动态规划` | 简单 | 第 115 场双周赛 | +| 2901 | [最长相邻不相等子序列 II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README.md) | `数组`,`字符串`,`动态规划` | 中等 | 第 115 场双周赛 | +| 2902 | [和带限制的子多重集合的数目](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README.md) | `数组`,`哈希表`,`动态规划`,`滑动窗口` | 困难 | 第 115 场双周赛 | +| 2903 | [找出满足差值条件的下标 I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README.md) | `数组`,`双指针` | 简单 | 第 367 场周赛 | +| 2904 | [最短且字典序最小的美丽子字符串](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README.md) | `字符串`,`滑动窗口` | 中等 | 第 367 场周赛 | +| 2905 | [找出满足差值条件的下标 II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README.md) | `数组`,`双指针` | 中等 | 第 367 场周赛 | +| 2906 | [构造乘积矩阵](/solution/2900-2999/2906.Construct%20Product%20Matrix/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 367 场周赛 | +| 2907 | [价格递增的最大利润三元组 I](/solution/2900-2999/2907.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20I/README.md) | `树状数组`,`线段树`,`数组` | 中等 | 🔒 | +| 2908 | [元素和最小的山形三元组 I](/solution/2900-2999/2908.Minimum%20Sum%20of%20Mountain%20Triplets%20I/README.md) | `数组` | 简单 | 第 368 场周赛 | +| 2909 | [元素和最小的山形三元组 II](/solution/2900-2999/2909.Minimum%20Sum%20of%20Mountain%20Triplets%20II/README.md) | `数组` | 中等 | 第 368 场周赛 | +| 2910 | [合法分组的最少组数](/solution/2900-2999/2910.Minimum%20Number%20of%20Groups%20to%20Create%20a%20Valid%20Assignment/README.md) | `贪心`,`数组`,`哈希表` | 中等 | 第 368 场周赛 | +| 2911 | [得到 K 个半回文串的最少修改次数](/solution/2900-2999/2911.Minimum%20Changes%20to%20Make%20K%20Semi-palindromes/README.md) | `双指针`,`字符串`,`动态规划` | 困难 | 第 368 场周赛 | +| 2912 | [在网格上移动到目的地的方法数](/solution/2900-2999/2912.Number%20of%20Ways%20to%20Reach%20Destination%20in%20the%20Grid/README.md) | `数学`,`动态规划`,`组合数学` | 困难 | 🔒 | +| 2913 | [子数组不同元素数目的平方和 I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README.md) | `数组`,`哈希表` | 简单 | 第 116 场双周赛 | +| 2914 | [使二进制字符串变美丽的最少修改次数](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README.md) | `字符串` | 中等 | 第 116 场双周赛 | +| 2915 | [和为目标值的最长子序列的长度](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README.md) | `数组`,`动态规划` | 中等 | 第 116 场双周赛 | +| 2916 | [子数组不同元素数目的平方和 II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README.md) | `树状数组`,`线段树`,`数组`,`动态规划` | 困难 | 第 116 场双周赛 | +| 2917 | [找出数组中的 K-or 值](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README.md) | `位运算`,`数组` | 简单 | 第 369 场周赛 | +| 2918 | [数组的最小相等和](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README.md) | `贪心`,`数组` | 中等 | 第 369 场周赛 | +| 2919 | [使数组变美的最小增量运算数](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README.md) | `数组`,`动态规划` | 中等 | 第 369 场周赛 | +| 2920 | [收集所有金币可获得的最大积分](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README.md) | `位运算`,`树`,`深度优先搜索`,`数组`,`动态规划` | 困难 | 第 369 场周赛 | +| 2921 | [价格递增的最大利润三元组 II](/solution/2900-2999/2921.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20II/README.md) | `树状数组`,`线段树`,`数组` | 困难 | 🔒 | +| 2922 | [市场分析 III](/solution/2900-2999/2922.Market%20Analysis%20III/README.md) | `数据库` | 中等 | 🔒 | +| 2923 | [找到冠军 I](/solution/2900-2999/2923.Find%20Champion%20I/README.md) | `数组`,`矩阵` | 简单 | 第 370 场周赛 | +| 2924 | [找到冠军 II](/solution/2900-2999/2924.Find%20Champion%20II/README.md) | `图` | 中等 | 第 370 场周赛 | +| 2925 | [在树上执行操作以后得到的最大分数](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README.md) | `树`,`深度优先搜索`,`动态规划` | 中等 | 第 370 场周赛 | +| 2926 | [平衡子序列的最大和](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`动态规划` | 困难 | 第 370 场周赛 | +| 2927 | [给小朋友们分糖果 III](/solution/2900-2999/2927.Distribute%20Candies%20Among%20Children%20III/README.md) | `数学`,`组合数学` | 困难 | 🔒 | +| 2928 | [给小朋友们分糖果 I](/solution/2900-2999/2928.Distribute%20Candies%20Among%20Children%20I/README.md) | `数学`,`组合数学`,`枚举` | 简单 | 第 117 场双周赛 | +| 2929 | [给小朋友们分糖果 II](/solution/2900-2999/2929.Distribute%20Candies%20Among%20Children%20II/README.md) | `数学`,`组合数学`,`枚举` | 中等 | 第 117 场双周赛 | +| 2930 | [重新排列后包含指定子字符串的字符串数目](/solution/2900-2999/2930.Number%20of%20Strings%20Which%20Can%20Be%20Rearranged%20to%20Contain%20Substring/README.md) | `数学`,`动态规划`,`组合数学` | 中等 | 第 117 场双周赛 | +| 2931 | [购买物品的最大开销](/solution/2900-2999/2931.Maximum%20Spending%20After%20Buying%20Items/README.md) | `贪心`,`数组`,`矩阵`,`排序`,`堆（优先队列）` | 困难 | 第 117 场双周赛 | +| 2932 | [找出强数对的最大异或值 I](/solution/2900-2999/2932.Maximum%20Strong%20Pair%20XOR%20I/README.md) | `位运算`,`字典树`,`数组`,`哈希表`,`滑动窗口` | 简单 | 第 371 场周赛 | +| 2933 | [高访问员工](/solution/2900-2999/2933.High-Access%20Employees/README.md) | `数组`,`哈希表`,`字符串`,`排序` | 中等 | 第 371 场周赛 | +| 2934 | [最大化数组末位元素的最少操作次数](/solution/2900-2999/2934.Minimum%20Operations%20to%20Maximize%20Last%20Elements%20in%20Arrays/README.md) | `数组`,`枚举` | 中等 | 第 371 场周赛 | +| 2935 | [找出强数对的最大异或值 II](/solution/2900-2999/2935.Maximum%20Strong%20Pair%20XOR%20II/README.md) | `位运算`,`字典树`,`数组`,`哈希表`,`滑动窗口` | 困难 | 第 371 场周赛 | +| 2936 | [包含相等值数字块的数量](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README.md) | `数组`,`二分查找`,`交互` | 中等 | 🔒 | +| 2937 | [使三个字符串相等](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README.md) | `字符串` | 简单 | 第 372 场周赛 | +| 2938 | [区分黑球与白球](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README.md) | `贪心`,`双指针`,`字符串` | 中等 | 第 372 场周赛 | +| 2939 | [最大异或乘积](/solution/2900-2999/2939.Maximum%20Xor%20Product/README.md) | `贪心`,`位运算`,`数学` | 中等 | 第 372 场周赛 | +| 2940 | [找到 Alice 和 Bob 可以相遇的建筑](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README.md) | `栈`,`树状数组`,`线段树`,`数组`,`二分查找`,`单调栈`,`堆（优先队列）` | 困难 | 第 372 场周赛 | +| 2941 | [子数组的最大 GCD-Sum](/solution/2900-2999/2941.Maximum%20GCD-Sum%20of%20a%20Subarray/README.md) | `数组`,`数学`,`二分查找`,`数论` | 困难 | 🔒 | +| 2942 | [查找包含给定字符的单词](/solution/2900-2999/2942.Find%20Words%20Containing%20Character/README.md) | `数组`,`字符串` | 简单 | 第 118 场双周赛 | +| 2943 | [最大化网格图中正方形空洞的面积](/solution/2900-2999/2943.Maximize%20Area%20of%20Square%20Hole%20in%20Grid/README.md) | `数组`,`排序` | 中等 | 第 118 场双周赛 | +| 2944 | [购买水果需要的最少金币数](/solution/2900-2999/2944.Minimum%20Number%20of%20Coins%20for%20Fruits/README.md) | `队列`,`数组`,`动态规划`,`单调队列`,`堆（优先队列）` | 中等 | 第 118 场双周赛 | +| 2945 | [找到最大非递减数组的长度](/solution/2900-2999/2945.Find%20Maximum%20Non-decreasing%20Array%20Length/README.md) | `栈`,`队列`,`数组`,`二分查找`,`动态规划`,`单调队列`,`单调栈` | 困难 | 第 118 场双周赛 | +| 2946 | [循环移位后的矩阵相似检查](/solution/2900-2999/2946.Matrix%20Similarity%20After%20Cyclic%20Shifts/README.md) | `数组`,`数学`,`矩阵`,`模拟` | 简单 | 第 373 场周赛 | +| 2947 | [统计美丽子字符串 I](/solution/2900-2999/2947.Count%20Beautiful%20Substrings%20I/README.md) | `哈希表`,`数学`,`字符串`,`枚举`,`数论`,`前缀和` | 中等 | 第 373 场周赛 | +| 2948 | [交换得到字典序最小的数组](/solution/2900-2999/2948.Make%20Lexicographically%20Smallest%20Array%20by%20Swapping%20Elements/README.md) | `并查集`,`数组`,`排序` | 中等 | 第 373 场周赛 | +| 2949 | [统计美丽子字符串 II](/solution/2900-2999/2949.Count%20Beautiful%20Substrings%20II/README.md) | `哈希表`,`数学`,`字符串`,`数论`,`前缀和` | 困难 | 第 373 场周赛 | +| 2950 | [可整除子串的数量](/solution/2900-2999/2950.Number%20of%20Divisible%20Substrings/README.md) | `哈希表`,`字符串`,`计数`,`前缀和` | 中等 | 🔒 | +| 2951 | [找出峰值](/solution/2900-2999/2951.Find%20the%20Peaks/README.md) | `数组`,`枚举` | 简单 | 第 374 场周赛 | +| 2952 | [需要添加的硬币的最小数量](/solution/2900-2999/2952.Minimum%20Number%20of%20Coins%20to%20be%20Added/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 374 场周赛 | +| 2953 | [统计完全子字符串](/solution/2900-2999/2953.Count%20Complete%20Substrings/README.md) | `哈希表`,`字符串`,`滑动窗口` | 困难 | 第 374 场周赛 | +| 2954 | [统计感冒序列的数目](/solution/2900-2999/2954.Count%20the%20Number%20of%20Infection%20Sequences/README.md) | `数组`,`数学`,`组合数学` | 困难 | 第 374 场周赛 | +| 2955 | [同端子串的数量](/solution/2900-2999/2955.Number%20of%20Same-End%20Substrings/README.md) | `数组`,`哈希表`,`字符串`,`计数`,`前缀和` | 中等 | 🔒 | +| 2956 | [找到两个数组中的公共元素](/solution/2900-2999/2956.Find%20Common%20Elements%20Between%20Two%20Arrays/README.md) | `数组`,`哈希表` | 简单 | 第 119 场双周赛 | +| 2957 | [消除相邻近似相等字符](/solution/2900-2999/2957.Remove%20Adjacent%20Almost-Equal%20Characters/README.md) | `贪心`,`字符串`,`动态规划` | 中等 | 第 119 场双周赛 | +| 2958 | [最多 K 个重复元素的最长子数组](/solution/2900-2999/2958.Length%20of%20Longest%20Subarray%20With%20at%20Most%20K%20Frequency/README.md) | `数组`,`哈希表`,`滑动窗口` | 中等 | 第 119 场双周赛 | +| 2959 | [关闭分部的可行集合数目](/solution/2900-2999/2959.Number%20of%20Possible%20Sets%20of%20Closing%20Branches/README.md) | `位运算`,`图`,`枚举`,`最短路`,`堆（优先队列）` | 困难 | 第 119 场双周赛 | +| 2960 | [统计已测试设备](/solution/2900-2999/2960.Count%20Tested%20Devices%20After%20Test%20Operations/README.md) | `数组`,`模拟` | 简单 | 第 375 场周赛 | +| 2961 | [双模幂运算](/solution/2900-2999/2961.Double%20Modular%20Exponentiation/README.md) | `数组`,`数学`,`模拟` | 中等 | 第 375 场周赛 | +| 2962 | [统计最大元素出现至少 K 次的子数组](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README.md) | `数组`,`滑动窗口` | 中等 | 第 375 场周赛 | +| 2963 | [统计好分割方案的数目](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README.md) | `数组`,`哈希表`,`数学`,`组合数学` | 困难 | 第 375 场周赛 | +| 2964 | [可被整除的三元组数量](/solution/2900-2999/2964.Number%20of%20Divisible%20Triplet%20Sums/README.md) | `数组`,`哈希表` | 中等 | 🔒 | +| 2965 | [找出缺失和重复的数字](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README.md) | `数组`,`哈希表`,`数学`,`矩阵` | 简单 | 第 376 场周赛 | +| 2966 | [划分数组并满足最大差限制](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 376 场周赛 | +| 2967 | [使数组成为等数数组的最小代价](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README.md) | `贪心`,`数组`,`数学`,`排序` | 中等 | 第 376 场周赛 | +| 2968 | [执行操作使频率分数最大](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README.md) | `数组`,`二分查找`,`前缀和`,`排序`,`滑动窗口` | 困难 | 第 376 场周赛 | +| 2969 | [购买水果需要的最少金币数 II](/solution/2900-2999/2969.Minimum%20Number%20of%20Coins%20for%20Fruits%20II/README.md) | `队列`,`数组`,`动态规划`,`单调队列`,`堆（优先队列）` | 困难 | 🔒 | +| 2970 | [统计移除递增子数组的数目 I](/solution/2900-2999/2970.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README.md) | `数组`,`双指针`,`二分查找`,`枚举` | 简单 | 第 120 场双周赛 | +| 2971 | [找到最大周长的多边形](/solution/2900-2999/2971.Find%20Polygon%20With%20the%20Largest%20Perimeter/README.md) | `贪心`,`数组`,`前缀和`,`排序` | 中等 | 第 120 场双周赛 | +| 2972 | [统计移除递增子数组的数目 II](/solution/2900-2999/2972.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README.md) | `数组`,`双指针`,`二分查找` | 困难 | 第 120 场双周赛 | +| 2973 | [树中每个节点放置的金币数目](/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README.md) | `树`,`深度优先搜索`,`动态规划`,`排序`,`堆（优先队列）` | 困难 | 第 120 场双周赛 | +| 2974 | [最小数字游戏](/solution/2900-2999/2974.Minimum%20Number%20Game/README.md) | `数组`,`排序`,`模拟`,`堆（优先队列）` | 简单 | 第 377 场周赛 | +| 2975 | [移除栅栏得到的正方形田地的最大面积](/solution/2900-2999/2975.Maximum%20Square%20Area%20by%20Removing%20Fences%20From%20a%20Field/README.md) | `数组`,`哈希表`,`枚举` | 中等 | 第 377 场周赛 | +| 2976 | [转换字符串的最小成本 I](/solution/2900-2999/2976.Minimum%20Cost%20to%20Convert%20String%20I/README.md) | `图`,`数组`,`字符串`,`最短路` | 中等 | 第 377 场周赛 | +| 2977 | [转换字符串的最小成本 II](/solution/2900-2999/2977.Minimum%20Cost%20to%20Convert%20String%20II/README.md) | `图`,`字典树`,`数组`,`字符串`,`动态规划`,`最短路` | 困难 | 第 377 场周赛 | +| 2978 | [对称坐标](/solution/2900-2999/2978.Symmetric%20Coordinates/README.md) | `数据库` | 中等 | 🔒 | +| 2979 | [最贵的无法购买的商品](/solution/2900-2999/2979.Most%20Expensive%20Item%20That%20Can%20Not%20Be%20Bought/README.md) | `数学`,`动态规划`,`数论` | 中等 | 🔒 | +| 2980 | [检查按位或是否存在尾随零](/solution/2900-2999/2980.Check%20if%20Bitwise%20OR%20Has%20Trailing%20Zeros/README.md) | `位运算`,`数组` | 简单 | 第 378 场周赛 | +| 2981 | [找出出现至少三次的最长特殊子字符串 I](/solution/2900-2999/2981.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20I/README.md) | `哈希表`,`字符串`,`二分查找`,`计数`,`滑动窗口` | 中等 | 第 378 场周赛 | +| 2982 | [找出出现至少三次的最长特殊子字符串 II](/solution/2900-2999/2982.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20II/README.md) | `哈希表`,`字符串`,`二分查找`,`计数`,`滑动窗口` | 中等 | 第 378 场周赛 | +| 2983 | [回文串重新排列查询](/solution/2900-2999/2983.Palindrome%20Rearrangement%20Queries/README.md) | `哈希表`,`字符串`,`前缀和` | 困难 | 第 378 场周赛 | +| 2984 | [找到每座城市的高峰通话时间](/solution/2900-2999/2984.Find%20Peak%20Calling%20Hours%20for%20Each%20City/README.md) | `数据库` | 中等 | 🔒 | +| 2985 | [计算订单平均商品数量](/solution/2900-2999/2985.Calculate%20Compressed%20Mean/README.md) | `数据库` | 简单 | 🔒 | +| 2986 | [找到第三笔交易](/solution/2900-2999/2986.Find%20Third%20Transaction/README.md) | `数据库` | 中等 | 🔒 | +| 2987 | [寻找房价最贵的城市](/solution/2900-2999/2987.Find%20Expensive%20Cities/README.md) | `数据库` | 简单 | 🔒 | +| 2988 | [最大部门的经理](/solution/2900-2999/2988.Manager%20of%20the%20Largest%20Department/README.md) | `数据库` | 中等 | 🔒 | +| 2989 | [班级表现](/solution/2900-2999/2989.Class%20Performance/README.md) | `数据库` | 中等 | 🔒 | +| 2990 | [贷款类型](/solution/2900-2999/2990.Loan%20Types/README.md) | `数据库` | 简单 | 🔒 | +| 2991 | [最好的三家酒庄](/solution/2900-2999/2991.Top%20Three%20Wineries/README.md) | `数据库` | 困难 | 🔒 | +| 2992 | [自整除排列的数量](/solution/2900-2999/2992.Number%20of%20Self-Divisible%20Permutations/README.md) | `位运算`,`递归`,`数组`,`动态规划`,`状态压缩` | 中等 | 🔒 | +| 2993 | [发生在周五的交易 I](/solution/2900-2999/2993.Friday%20Purchases%20I/README.md) | `数据库` | 中等 | 🔒 | +| 2994 | [发生在周五的交易 II](/solution/2900-2999/2994.Friday%20Purchases%20II/README.md) | `数据库` | 困难 | 🔒 | +| 2995 | [观众变主播](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README.md) | `数据库` | 困难 | 🔒 | +| 2996 | [大于等于顺序前缀和的最小缺失整数](/solution/2900-2999/2996.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README.md) | `数组`,`哈希表`,`排序` | 简单 | 第 121 场双周赛 | +| 2997 | [使数组异或和等于 K 的最少操作次数](/solution/2900-2999/2997.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README.md) | `位运算`,`数组` | 中等 | 第 121 场双周赛 | +| 2998 | [使 X 和 Y 相等的最少操作次数](/solution/2900-2999/2998.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README.md) | `广度优先搜索`,`记忆化搜索`,`动态规划` | 中等 | 第 121 场双周赛 | +| 2999 | [统计强大整数的数目](/solution/2900-2999/2999.Count%20the%20Number%20of%20Powerful%20Integers/README.md) | `数学`,`字符串`,`动态规划` | 困难 | 第 121 场双周赛 | +| 3000 | [对角线最长的矩形的面积](/solution/3000-3099/3000.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README.md) | `数组` | 简单 | 第 379 场周赛 | +| 3001 | [捕获黑皇后需要的最少移动次数](/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/README.md) | `数组`,`枚举` | 中等 | 第 379 场周赛 | +| 3002 | [移除后集合的最多元素数](/solution/3000-3099/3002.Maximum%20Size%20of%20a%20Set%20After%20Removals/README.md) | `贪心`,`数组`,`哈希表` | 中等 | 第 379 场周赛 | +| 3003 | [执行操作后的最大分割数量](/solution/3000-3099/3003.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README.md) | `位运算`,`字符串`,`动态规划`,`状态压缩` | 困难 | 第 379 场周赛 | +| 3004 | [相同颜色的最大子树](/solution/3000-3099/3004.Maximum%20Subtree%20of%20the%20Same%20Color/README.md) | `树`,`深度优先搜索`,`数组`,`动态规划` | 中等 | 🔒 | +| 3005 | [最大频率元素计数](/solution/3000-3099/3005.Count%20Elements%20With%20Maximum%20Frequency/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 380 场周赛 | +| 3006 | [找出数组中的美丽下标 I](/solution/3000-3099/3006.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I/README.md) | `双指针`,`字符串`,`二分查找`,`字符串匹配`,`哈希函数`,`滚动哈希` | 中等 | 第 380 场周赛 | +| 3007 | [价值和小于等于 K 的最大数字](/solution/3000-3099/3007.Maximum%20Number%20That%20Sum%20of%20the%20Prices%20Is%20Less%20Than%20or%20Equal%20to%20K/README.md) | `位运算`,`二分查找`,`动态规划` | 中等 | 第 380 场周赛 | +| 3008 | [找出数组中的美丽下标 II](/solution/3000-3099/3008.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20II/README.md) | `双指针`,`字符串`,`二分查找`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 380 场周赛 | +| 3009 | [折线图上的最大交点数量](/solution/3000-3099/3009.Maximum%20Number%20of%20Intersections%20on%20the%20Chart/README.md) | `树状数组`,`几何`,`数组`,`数学` | 困难 | 🔒 | +| 3010 | [将数组分成最小总代价的子数组 I](/solution/3000-3099/3010.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20I/README.md) | `数组`,`枚举`,`排序` | 简单 | 第 122 场双周赛 | +| 3011 | [判断一个数组是否可以变为有序](/solution/3000-3099/3011.Find%20if%20Array%20Can%20Be%20Sorted/README.md) | `位运算`,`数组`,`排序` | 中等 | 第 122 场双周赛 | +| 3012 | [通过操作使数组长度最小](/solution/3000-3099/3012.Minimize%20Length%20of%20Array%20Using%20Operations/README.md) | `贪心`,`数组`,`数学`,`数论` | 中等 | 第 122 场双周赛 | +| 3013 | [将数组分成最小总代价的子数组 II](/solution/3000-3099/3013.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20II/README.md) | `数组`,`哈希表`,`滑动窗口`,`堆（优先队列）` | 困难 | 第 122 场双周赛 | +| 3014 | [输入单词需要的最少按键次数 I](/solution/3000-3099/3014.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20I/README.md) | `贪心`,`数学`,`字符串` | 简单 | 第 381 场周赛 | +| 3015 | [按距离统计房屋对数目 I](/solution/3000-3099/3015.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20I/README.md) | `广度优先搜索`,`图`,`前缀和` | 中等 | 第 381 场周赛 | +| 3016 | [输入单词需要的最少按键次数 II](/solution/3000-3099/3016.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20II/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序` | 中等 | 第 381 场周赛 | +| 3017 | [按距离统计房屋对数目 II](/solution/3000-3099/3017.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20II/README.md) | `图`,`前缀和` | 困难 | 第 381 场周赛 | +| 3018 | [可处理的最大删除操作数 I](/solution/3000-3099/3018.Maximum%20Number%20of%20Removal%20Queries%20That%20Can%20Be%20Processed%20I/README.md) | `数组`,`动态规划` | 困难 | 🔒 | +| 3019 | [按键变更的次数](/solution/3000-3099/3019.Number%20of%20Changing%20Keys/README.md) | `字符串` | 简单 | 第 382 场周赛 | +| 3020 | [子集中元素的最大数量](/solution/3000-3099/3020.Find%20the%20Maximum%20Number%20of%20Elements%20in%20Subset/README.md) | `数组`,`哈希表`,`枚举` | 中等 | 第 382 场周赛 | +| 3021 | [Alice 和 Bob 玩鲜花游戏](/solution/3000-3099/3021.Alice%20and%20Bob%20Playing%20Flower%20Game/README.md) | `数学` | 中等 | 第 382 场周赛 | +| 3022 | [给定操作次数内使剩余元素的或值最小](/solution/3000-3099/3022.Minimize%20OR%20of%20Remaining%20Elements%20Using%20Operations/README.md) | `贪心`,`位运算`,`数组` | 困难 | 第 382 场周赛 | +| 3023 | [在无限流中寻找模式 I](/solution/3000-3099/3023.Find%20Pattern%20in%20Infinite%20Stream%20I/README.md) | `数组`,`字符串匹配`,`滑动窗口`,`哈希函数`,`滚动哈希` | 中等 | 🔒 | +| 3024 | [三角形类型](/solution/3000-3099/3024.Type%20of%20Triangle/README.md) | `数组`,`数学`,`排序` | 简单 | 第 123 场双周赛 | +| 3025 | [人员站位的方案数 I](/solution/3000-3099/3025.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20I/README.md) | `几何`,`数组`,`数学`,`枚举`,`排序` | 中等 | 第 123 场双周赛 | +| 3026 | [最大好子数组和](/solution/3000-3099/3026.Maximum%20Good%20Subarray%20Sum/README.md) | `数组`,`哈希表`,`前缀和` | 中等 | 第 123 场双周赛 | +| 3027 | [人员站位的方案数 II](/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/README.md) | `几何`,`数组`,`数学`,`枚举`,`排序` | 困难 | 第 123 场双周赛 | +| 3028 | [边界上的蚂蚁](/solution/3000-3099/3028.Ant%20on%20the%20Boundary/README.md) | `数组`,`前缀和`,`模拟` | 简单 | 第 383 场周赛 | +| 3029 | [将单词恢复初始状态所需的最短时间 I](/solution/3000-3099/3029.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20I/README.md) | `字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 中等 | 第 383 场周赛 | +| 3030 | [找出网格的区域平均强度](/solution/3000-3099/3030.Find%20the%20Grid%20of%20Region%20Average/README.md) | `数组`,`矩阵` | 中等 | 第 383 场周赛 | +| 3031 | [将单词恢复初始状态所需的最短时间 II](/solution/3000-3099/3031.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20II/README.md) | `字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 383 场周赛 | +| 3032 | [统计各位数字都不同的数字个数 II](/solution/3000-3099/3032.Count%20Numbers%20With%20Unique%20Digits%20II/README.md) | `哈希表`,`数学`,`动态规划` | 简单 | 🔒 | +| 3033 | [修改矩阵](/solution/3000-3099/3033.Modify%20the%20Matrix/README.md) | `数组`,`矩阵` | 简单 | 第 384 场周赛 | +| 3034 | [匹配模式数组的子数组数目 I](/solution/3000-3099/3034.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20I/README.md) | `数组`,`字符串匹配`,`哈希函数`,`滚动哈希` | 中等 | 第 384 场周赛 | +| 3035 | [回文字符串的最大数量](/solution/3000-3099/3035.Maximum%20Palindromes%20After%20Operations/README.md) | `贪心`,`数组`,`哈希表`,`字符串`,`计数`,`排序` | 中等 | 第 384 场周赛 | +| 3036 | [匹配模式数组的子数组数目 II](/solution/3000-3099/3036.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20II/README.md) | `数组`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 384 场周赛 | +| 3037 | [在无限流中寻找模式 II](/solution/3000-3099/3037.Find%20Pattern%20in%20Infinite%20Stream%20II/README.md) | `数组`,`字符串匹配`,`滑动窗口`,`哈希函数`,`滚动哈希` | 困难 | 🔒 | +| 3038 | [相同分数的最大操作数目 I](/solution/3000-3099/3038.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20I/README.md) | `数组`,`模拟` | 简单 | 第 124 场双周赛 | +| 3039 | [进行操作使字符串为空](/solution/3000-3099/3039.Apply%20Operations%20to%20Make%20String%20Empty/README.md) | `数组`,`哈希表`,`计数`,`排序` | 中等 | 第 124 场双周赛 | +| 3040 | [相同分数的最大操作数目 II](/solution/3000-3099/3040.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20II/README.md) | `记忆化搜索`,`数组`,`动态规划` | 中等 | 第 124 场双周赛 | +| 3041 | [修改数组后最大化数组中的连续元素数目](/solution/3000-3099/3041.Maximize%20Consecutive%20Elements%20in%20an%20Array%20After%20Modification/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 124 场双周赛 | +| 3042 | [统计前后缀下标对 I](/solution/3000-3099/3042.Count%20Prefix%20and%20Suffix%20Pairs%20I/README.md) | `字典树`,`数组`,`字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 简单 | 第 385 场周赛 | +| 3043 | [最长公共前缀的长度](/solution/3000-3099/3043.Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/README.md) | `字典树`,`数组`,`哈希表`,`字符串` | 中等 | 第 385 场周赛 | +| 3044 | [出现频率最高的质数](/solution/3000-3099/3044.Most%20Frequent%20Prime/README.md) | `数组`,`哈希表`,`数学`,`计数`,`枚举`,`矩阵`,`数论` | 中等 | 第 385 场周赛 | +| 3045 | [统计前后缀下标对 II](/solution/3000-3099/3045.Count%20Prefix%20and%20Suffix%20Pairs%20II/README.md) | `字典树`,`数组`,`字符串`,`字符串匹配`,`哈希函数`,`滚动哈希` | 困难 | 第 385 场周赛 | +| 3046 | [分割数组](/solution/3000-3099/3046.Split%20the%20Array/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 386 场周赛 | +| 3047 | [求交集区域内的最大正方形面积](/solution/3000-3099/3047.Find%20the%20Largest%20Area%20of%20Square%20Inside%20Two%20Rectangles/README.md) | `几何`,`数组`,`数学` | 中等 | 第 386 场周赛 | +| 3048 | [标记所有下标的最早秒数 I](/solution/3000-3099/3048.Earliest%20Second%20to%20Mark%20Indices%20I/README.md) | `数组`,`二分查找` | 中等 | 第 386 场周赛 | +| 3049 | [标记所有下标的最早秒数 II](/solution/3000-3099/3049.Earliest%20Second%20to%20Mark%20Indices%20II/README.md) | `贪心`,`数组`,`二分查找`,`堆（优先队列）` | 困难 | 第 386 场周赛 | +| 3050 | [披萨配料成本分析](/solution/3000-3099/3050.Pizza%20Toppings%20Cost%20Analysis/README.md) | `数据库` | 中等 | 🔒 | +| 3051 | [寻找数据科学家职位的候选人](/solution/3000-3099/3051.Find%20Candidates%20for%20Data%20Scientist%20Position/README.md) | `数据库` | 简单 | 🔒 | +| 3052 | [最大化商品](/solution/3000-3099/3052.Maximize%20Items/README.md) | `数据库` | 困难 | 🔒 | +| 3053 | [根据长度分类三角形](/solution/3000-3099/3053.Classifying%20Triangles%20by%20Lengths/README.md) | `数据库` | 简单 | 🔒 | +| 3054 | [二叉树节点](/solution/3000-3099/3054.Binary%20Tree%20Nodes/README.md) | `数据库` | 中等 | 🔒 | +| 3055 | [最高欺诈百分位数](/solution/3000-3099/3055.Top%20Percentile%20Fraud/README.md) | `数据库` | 中等 | 🔒 | +| 3056 | [快照分析](/solution/3000-3099/3056.Snaps%20Analysis/README.md) | `数据库` | 中等 | 🔒 | +| 3057 | [员工项目分配](/solution/3000-3099/3057.Employees%20Project%20Allocation/README.md) | `数据库` | 困难 | 🔒 | +| 3058 | [没有共同朋友的朋友](/solution/3000-3099/3058.Friends%20With%20No%20Mutual%20Friends/README.md) | `数据库` | 中等 | 🔒 | +| 3059 | [找到所有不同的邮件域名](/solution/3000-3099/3059.Find%20All%20Unique%20Email%20Domains/README.md) | `数据库` | 简单 | 🔒 | +| 3060 | [时间范围内的用户活动](/solution/3000-3099/3060.User%20Activities%20within%20Time%20Bounds/README.md) | `数据库` | 困难 | 🔒 | +| 3061 | [计算滞留雨水](/solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README.md) | `数据库` | 困难 | 🔒 | +| 3062 | [链表游戏的获胜者](/solution/3000-3099/3062.Winner%20of%20the%20Linked%20List%20Game/README.md) | `链表` | 简单 | 🔒 | +| 3063 | [链表频率](/solution/3000-3099/3063.Linked%20List%20Frequency/README.md) | `哈希表`,`链表`,`计数` | 简单 | 🔒 | +| 3064 | [使用按位查询猜测数字 I](/solution/3000-3099/3064.Guess%20the%20Number%20Using%20Bitwise%20Questions%20I/README.md) | `位运算`,`交互` | 中等 | 🔒 | +| 3065 | [超过阈值的最少操作数 I](/solution/3000-3099/3065.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20I/README.md) | `数组` | 简单 | 第 125 场双周赛 | +| 3066 | [超过阈值的最少操作数 II](/solution/3000-3099/3066.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20II/README.md) | `数组`,`模拟`,`堆（优先队列）` | 中等 | 第 125 场双周赛 | +| 3067 | [在带权树网络中统计可连接服务器对数目](/solution/3000-3099/3067.Count%20Pairs%20of%20Connectable%20Servers%20in%20a%20Weighted%20Tree%20Network/README.md) | `树`,`深度优先搜索`,`数组` | 中等 | 第 125 场双周赛 | +| 3068 | [最大节点价值之和](/solution/3000-3099/3068.Find%20the%20Maximum%20Sum%20of%20Node%20Values/README.md) | `贪心`,`位运算`,`树`,`数组`,`动态规划`,`排序` | 困难 | 第 125 场双周赛 | +| 3069 | [将元素分配到两个数组中 I](/solution/3000-3099/3069.Distribute%20Elements%20Into%20Two%20Arrays%20I/README.md) | `数组`,`模拟` | 简单 | 第 387 场周赛 | +| 3070 | [元素和小于等于 k 的子矩阵的数目](/solution/3000-3099/3070.Count%20Submatrices%20with%20Top-Left%20Element%20and%20Sum%20Less%20Than%20k/README.md) | `数组`,`矩阵`,`前缀和` | 中等 | 第 387 场周赛 | +| 3071 | [在矩阵上写出字母 Y 所需的最少操作次数](/solution/3000-3099/3071.Minimum%20Operations%20to%20Write%20the%20Letter%20Y%20on%20a%20Grid/README.md) | `数组`,`哈希表`,`计数`,`矩阵` | 中等 | 第 387 场周赛 | +| 3072 | [将元素分配到两个数组中 II](/solution/3000-3099/3072.Distribute%20Elements%20Into%20Two%20Arrays%20II/README.md) | `树状数组`,`线段树`,`数组`,`模拟` | 困难 | 第 387 场周赛 | +| 3073 | [最大递增三元组](/solution/3000-3099/3073.Maximum%20Increasing%20Triplet%20Value/README.md) | `数组`,`有序集合` | 中等 | 🔒 | +| 3074 | [重新分装苹果](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README.md) | `贪心`,`数组`,`排序` | 简单 | 第 388 场周赛 | +| 3075 | [幸福值最大化的选择方案](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 388 场周赛 | +| 3076 | [数组中的最短非公共子字符串](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README.md) | `字典树`,`数组`,`哈希表`,`字符串` | 中等 | 第 388 场周赛 | +| 3077 | [K 个不相交子数组的最大能量值](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README.md) | `数组`,`动态规划`,`前缀和` | 困难 | 第 388 场周赛 | +| 3078 | [矩阵中的字母数字模式匹配 I](/solution/3000-3099/3078.Match%20Alphanumerical%20Pattern%20in%20Matrix%20I/README.md) | `数组`,`哈希表`,`字符串`,`矩阵` | 中等 | 🔒 | +| 3079 | [求出加密整数的和](/solution/3000-3099/3079.Find%20the%20Sum%20of%20Encrypted%20Integers/README.md) | `数组`,`数学` | 简单 | 第 126 场双周赛 | +| 3080 | [执行操作标记数组中的元素](/solution/3000-3099/3080.Mark%20Elements%20on%20Array%20by%20Performing%20Queries/README.md) | `数组`,`哈希表`,`排序`,`模拟`,`堆（优先队列）` | 中等 | 第 126 场双周赛 | +| 3081 | [替换字符串中的问号使分数最小](/solution/3000-3099/3081.Replace%20Question%20Marks%20in%20String%20to%20Minimize%20Its%20Value/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序`,`堆（优先队列）` | 中等 | 第 126 场双周赛 | +| 3082 | [求出所有子序列的能量和](/solution/3000-3099/3082.Find%20the%20Sum%20of%20the%20Power%20of%20All%20Subsequences/README.md) | `数组`,`动态规划` | 困难 | 第 126 场双周赛 | +| 3083 | [字符串及其反转中是否存在同一子字符串](/solution/3000-3099/3083.Existence%20of%20a%20Substring%20in%20a%20String%20and%20Its%20Reverse/README.md) | `哈希表`,`字符串` | 简单 | 第 389 场周赛 | +| 3084 | [统计以给定字符开头和结尾的子字符串总数](/solution/3000-3099/3084.Count%20Substrings%20Starting%20and%20Ending%20with%20Given%20Character/README.md) | `数学`,`字符串`,`计数` | 中等 | 第 389 场周赛 | +| 3085 | [成为 K 特殊字符串需要删除的最少字符数](/solution/3000-3099/3085.Minimum%20Deletions%20to%20Make%20String%20K-Special/README.md) | `贪心`,`哈希表`,`字符串`,`计数`,`排序` | 中等 | 第 389 场周赛 | +| 3086 | [拾起 K 个 1 需要的最少行动次数](/solution/3000-3099/3086.Minimum%20Moves%20to%20Pick%20K%20Ones/README.md) | `贪心`,`数组`,`前缀和`,`滑动窗口` | 困难 | 第 389 场周赛 | +| 3087 | [查找热门话题标签](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README.md) | `数据库` | 中等 | 🔒 | +| 3088 | [使字符串反回文](/solution/3000-3099/3088.Make%20String%20Anti-palindrome/README.md) | `贪心`,`字符串`,`排序` | 困难 | 🔒 | +| 3089 | [查找突发行为](/solution/3000-3099/3089.Find%20Bursty%20Behavior/README.md) | `数据库` | 中等 | 🔒 | +| 3090 | [每个字符最多出现两次的最长子字符串](/solution/3000-3099/3090.Maximum%20Length%20Substring%20With%20Two%20Occurrences/README.md) | `哈希表`,`字符串`,`滑动窗口` | 简单 | 第 390 场周赛 | +| 3091 | [执行操作使数据元素之和大于等于 K](/solution/3000-3099/3091.Apply%20Operations%20to%20Make%20Sum%20of%20Array%20Greater%20Than%20or%20Equal%20to%20k/README.md) | `贪心`,`数学`,`枚举` | 中等 | 第 390 场周赛 | +| 3092 | [最高频率的 ID](/solution/3000-3099/3092.Most%20Frequent%20IDs/README.md) | `数组`,`哈希表`,`有序集合`,`堆（优先队列）` | 中等 | 第 390 场周赛 | +| 3093 | [最长公共后缀查询](/solution/3000-3099/3093.Longest%20Common%20Suffix%20Queries/README.md) | `字典树`,`数组`,`字符串` | 困难 | 第 390 场周赛 | +| 3094 | [使用按位查询猜测数字 II](/solution/3000-3099/3094.Guess%20the%20Number%20Using%20Bitwise%20Questions%20II/README.md) | `位运算`,`交互` | 中等 | 🔒 | +| 3095 | [或值至少 K 的最短子数组 I](/solution/3000-3099/3095.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20I/README.md) | `位运算`,`数组`,`滑动窗口` | 简单 | 第 127 场双周赛 | +| 3096 | [得到更多分数的最少关卡数目](/solution/3000-3099/3096.Minimum%20Levels%20to%20Gain%20More%20Points/README.md) | `数组`,`前缀和` | 中等 | 第 127 场双周赛 | +| 3097 | [或值至少为 K 的最短子数组 II](/solution/3000-3099/3097.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20II/README.md) | `位运算`,`数组`,`滑动窗口` | 中等 | 第 127 场双周赛 | +| 3098 | [求出所有子序列的能量和](/solution/3000-3099/3098.Find%20the%20Sum%20of%20Subsequence%20Powers/README.md) | `数组`,`动态规划`,`排序` | 困难 | 第 127 场双周赛 | +| 3099 | [哈沙德数](/solution/3000-3099/3099.Harshad%20Number/README.md) | `数学` | 简单 | 第 391 场周赛 | +| 3100 | [换水问题 II](/solution/3100-3199/3100.Water%20Bottles%20II/README.md) | `数学`,`模拟` | 中等 | 第 391 场周赛 | +| 3101 | [交替子数组计数](/solution/3100-3199/3101.Count%20Alternating%20Subarrays/README.md) | `数组`,`数学` | 中等 | 第 391 场周赛 | +| 3102 | [最小化曼哈顿距离](/solution/3100-3199/3102.Minimize%20Manhattan%20Distances/README.md) | `几何`,`数组`,`数学`,`有序集合`,`排序` | 困难 | 第 391 场周赛 | +| 3103 | [查找热门话题标签 II](/solution/3100-3199/3103.Find%20Trending%20Hashtags%20II/README.md) | `数据库` | 困难 | 🔒 | +| 3104 | [Find Longest Self-Contained Substring](/solution/3100-3199/3104.Find%20Longest%20Self-Contained%20Substring/README.md) | `哈希表`,`字符串`,`二分查找`,`前缀和` | 困难 | 🔒 | +| 3105 | [最长的严格递增或递减子数组](/solution/3100-3199/3105.Longest%20Strictly%20Increasing%20or%20Strictly%20Decreasing%20Subarray/README.md) | `数组` | 简单 | 第 392 场周赛 | +| 3106 | [满足距离约束且字典序最小的字符串](/solution/3100-3199/3106.Lexicographically%20Smallest%20String%20After%20Operations%20With%20Constraint/README.md) | `贪心`,`字符串` | 中等 | 第 392 场周赛 | +| 3107 | [使数组中位数等于 K 的最少操作数](/solution/3100-3199/3107.Minimum%20Operations%20to%20Make%20Median%20of%20Array%20Equal%20to%20K/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 392 场周赛 | +| 3108 | [带权图里旅途的最小代价](/solution/3100-3199/3108.Minimum%20Cost%20Walk%20in%20Weighted%20Graph/README.md) | `位运算`,`并查集`,`图`,`数组` | 困难 | 第 392 场周赛 | +| 3109 | [Find the Index of Permutation](/solution/3100-3199/3109.Find%20the%20Index%20of%20Permutation/README.md) | `树状数组`,`线段树`,`数组`,`二分查找`,`分治`,`有序集合`,`归并排序` | 中等 | 🔒 | +| 3110 | [字符串的分数](/solution/3100-3199/3110.Score%20of%20a%20String/README.md) | `字符串` | 简单 | 第 128 场双周赛 | +| 3111 | [覆盖所有点的最少矩形数目](/solution/3100-3199/3111.Minimum%20Rectangles%20to%20Cover%20Points/README.md) | `贪心`,`数组`,`排序` | 中等 | 第 128 场双周赛 | +| 3112 | [访问消失节点的最少时间](/solution/3100-3199/3112.Minimum%20Time%20to%20Visit%20Disappearing%20Nodes/README.md) | `图`,`数组`,`最短路`,`堆（优先队列）` | 中等 | 第 128 场双周赛 | +| 3113 | [边界元素是最大值的子数组数目](/solution/3100-3199/3113.Find%20the%20Number%20of%20Subarrays%20Where%20Boundary%20Elements%20Are%20Maximum/README.md) | `栈`,`数组`,`二分查找`,`单调栈` | 困难 | 第 128 场双周赛 | +| 3114 | [替换字符可以得到的最晚时间](/solution/3100-3199/3114.Latest%20Time%20You%20Can%20Obtain%20After%20Replacing%20Characters/README.md) | `字符串`,`枚举` | 简单 | 第 393 场周赛 | +| 3115 | [质数的最大距离](/solution/3100-3199/3115.Maximum%20Prime%20Difference/README.md) | `数组`,`数学`,`数论` | 中等 | 第 393 场周赛 | +| 3116 | [单面值组合的第 K 小金额](/solution/3100-3199/3116.Kth%20Smallest%20Amount%20With%20Single%20Denomination%20Combination/README.md) | `位运算`,`数组`,`数学`,`二分查找`,`组合数学`,`数论` | 困难 | 第 393 场周赛 | +| 3117 | [划分数组得到最小的值之和](/solution/3100-3199/3117.Minimum%20Sum%20of%20Values%20by%20Dividing%20Array/README.md) | `位运算`,`线段树`,`队列`,`数组`,`二分查找`,`动态规划` | 困难 | 第 393 场周赛 | +| 3118 | [Friday Purchase III](/solution/3100-3199/3118.Friday%20Purchase%20III/README.md) | `数据库` | 中等 | 🔒 | +| 3119 | [最大数量的可修复坑洼](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README.md) | `贪心`,`字符串`,`排序` | 中等 | 🔒 | +| 3120 | [统计特殊字母的数量 I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README.md) | `哈希表`,`字符串` | 简单 | 第 394 场周赛 | +| 3121 | [统计特殊字母的数量 II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README.md) | `哈希表`,`字符串` | 中等 | 第 394 场周赛 | +| 3122 | [使矩阵满足条件的最少操作次数](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 394 场周赛 | +| 3123 | [最短路径中的边](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README.md) | `深度优先搜索`,`广度优先搜索`,`图`,`最短路`,`堆（优先队列）` | 困难 | 第 394 场周赛 | +| 3124 | [查找最长的电话](/solution/3100-3199/3124.Find%20Longest%20Calls/README.md) | `数据库` | 中等 | 🔒 | +| 3125 | [使得按位与结果为 0 的最大数字](/solution/3100-3199/3125.Maximum%20Number%20That%20Makes%20Result%20of%20Bitwise%20AND%20Zero/README.md) | `贪心`,`字符串`,`排序` | 中等 | 🔒 | +| 3126 | [服务器利用时间](/solution/3100-3199/3126.Server%20Utilization%20Time/README.md) | `数据库` | 中等 | 🔒 | +| 3127 | [构造相同颜色的正方形](/solution/3100-3199/3127.Make%20a%20Square%20with%20the%20Same%20Color/README.md) | `数组`,`枚举`,`矩阵` | 简单 | 第 129 场双周赛 | +| 3128 | [直角三角形](/solution/3100-3199/3128.Right%20Triangles/README.md) | `数组`,`哈希表`,`数学`,`组合数学`,`计数` | 中等 | 第 129 场双周赛 | +| 3129 | [找出所有稳定的二进制数组 I](/solution/3100-3199/3129.Find%20All%20Possible%20Stable%20Binary%20Arrays%20I/README.md) | `动态规划`,`前缀和` | 中等 | 第 129 场双周赛 | +| 3130 | [找出所有稳定的二进制数组 II](/solution/3100-3199/3130.Find%20All%20Possible%20Stable%20Binary%20Arrays%20II/README.md) | `动态规划`,`前缀和` | 困难 | 第 129 场双周赛 | +| 3131 | [找出与数组相加的整数 I](/solution/3100-3199/3131.Find%20the%20Integer%20Added%20to%20Array%20I/README.md) | `数组` | 简单 | 第 395 场周赛 | +| 3132 | [找出与数组相加的整数 II](/solution/3100-3199/3132.Find%20the%20Integer%20Added%20to%20Array%20II/README.md) | `数组`,`双指针`,`枚举`,`排序` | 中等 | 第 395 场周赛 | +| 3133 | [数组最后一个元素的最小值](/solution/3100-3199/3133.Minimum%20Array%20End/README.md) | `位运算` | 中等 | 第 395 场周赛 | +| 3134 | [找出唯一性数组的中位数](/solution/3100-3199/3134.Find%20the%20Median%20of%20the%20Uniqueness%20Array/README.md) | `数组`,`哈希表`,`二分查找`,`滑动窗口` | 困难 | 第 395 场周赛 | +| 3135 | [通过添加或删除结尾字符来同化字符串](/solution/3100-3199/3135.Equalize%20Strings%20by%20Adding%20or%20Removing%20Characters%20at%20Ends/README.md) | `字符串`,`二分查找`,`动态规划`,`滑动窗口`,`哈希函数` | 中等 | 🔒 | +| 3136 | [有效单词](/solution/3100-3199/3136.Valid%20Word/README.md) | `字符串` | 简单 | 第 396 场周赛 | +| 3137 | [K 周期字符串需要的最少操作次数](/solution/3100-3199/3137.Minimum%20Number%20of%20Operations%20to%20Make%20Word%20K-Periodic/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 396 场周赛 | +| 3138 | [同位字符串连接的最小长度](/solution/3100-3199/3138.Minimum%20Length%20of%20Anagram%20Concatenation/README.md) | `哈希表`,`字符串`,`计数` | 中等 | 第 396 场周赛 | +| 3139 | [使数组中所有元素相等的最小开销](/solution/3100-3199/3139.Minimum%20Cost%20to%20Equalize%20Array/README.md) | `贪心`,`数组`,`枚举` | 困难 | 第 396 场周赛 | +| 3140 | [连续空余座位 II](/solution/3100-3199/3140.Consecutive%20Available%20Seats%20II/README.md) | `数据库` | 中等 | 🔒 | +| 3141 | [最大汉明距离](/solution/3100-3199/3141.Maximum%20Hamming%20Distances/README.md) | `位运算`,`广度优先搜索`,`数组` | 困难 | 🔒 | +| 3142 | [判断矩阵是否满足条件](/solution/3100-3199/3142.Check%20if%20Grid%20Satisfies%20Conditions/README.md) | `数组`,`矩阵` | 简单 | 第 130 场双周赛 | +| 3143 | [正方形中的最多点数](/solution/3100-3199/3143.Maximum%20Points%20Inside%20the%20Square/README.md) | `数组`,`哈希表`,`字符串`,`二分查找`,`排序` | 中等 | 第 130 场双周赛 | +| 3144 | [分割字符频率相等的最少子字符串](/solution/3100-3199/3144.Minimum%20Substring%20Partition%20of%20Equal%20Character%20Frequency/README.md) | `哈希表`,`字符串`,`动态规划`,`计数` | 中等 | 第 130 场双周赛 | +| 3145 | [大数组元素的乘积](/solution/3100-3199/3145.Find%20Products%20of%20Elements%20of%20Big%20Array/README.md) | `位运算`,`数组`,`二分查找` | 困难 | 第 130 场双周赛 | +| 3146 | [两个字符串的排列差](/solution/3100-3199/3146.Permutation%20Difference%20between%20Two%20Strings/README.md) | `哈希表`,`字符串` | 简单 | 第 397 场周赛 | +| 3147 | [从魔法师身上吸取的最大能量](/solution/3100-3199/3147.Taking%20Maximum%20Energy%20From%20the%20Mystic%20Dungeon/README.md) | `数组`,`前缀和` | 中等 | 第 397 场周赛 | +| 3148 | [矩阵中的最大得分](/solution/3100-3199/3148.Maximum%20Difference%20Score%20in%20a%20Grid/README.md) | `数组`,`动态规划`,`矩阵` | 中等 | 第 397 场周赛 | +| 3149 | [找出分数最低的排列](/solution/3100-3199/3149.Find%20the%20Minimum%20Cost%20Array%20Permutation/README.md) | `位运算`,`数组`,`动态规划`,`状态压缩` | 困难 | 第 397 场周赛 | +| 3150 | [无效的推文 II](/solution/3100-3199/3150.Invalid%20Tweets%20II/README.md) | `数据库` | 简单 | 🔒 | +| 3151 | [特殊数组 I](/solution/3100-3199/3151.Special%20Array%20I/README.md) | `数组` | 简单 | 第 398 场周赛 | +| 3152 | [特殊数组 II](/solution/3100-3199/3152.Special%20Array%20II/README.md) | `数组`,`二分查找`,`前缀和` | 中等 | 第 398 场周赛 | +| 3153 | [所有数对中数位不同之和](/solution/3100-3199/3153.Sum%20of%20Digit%20Differences%20of%20All%20Pairs/README.md) | `数组`,`哈希表`,`数学`,`计数` | 中等 | 第 398 场周赛 | +| 3154 | [到达第 K 级台阶的方案数](/solution/3100-3199/3154.Find%20Number%20of%20Ways%20to%20Reach%20the%20K-th%20Stair/README.md) | `位运算`,`记忆化搜索`,`数学`,`动态规划`,`组合数学` | 困难 | 第 398 场周赛 | +| 3155 | [可升级服务器的最大数量](/solution/3100-3199/3155.Maximum%20Number%20of%20Upgradable%20Servers/README.md) | `数组`,`数学`,`二分查找` | 中等 | 🔒 | +| 3156 | [员工任务持续时间和并发任务](/solution/3100-3199/3156.Employee%20Task%20Duration%20and%20Concurrent%20Tasks/README.md) | `数据库` | 困难 | 🔒 | +| 3157 | [找到具有最小和的树的层数](/solution/3100-3199/3157.Find%20the%20Level%20of%20Tree%20with%20Minimum%20Sum/README.md) | `树`,`深度优先搜索`,`广度优先搜索`,`二叉树` | 中等 | 🔒 | +| 3158 | [求出出现两次数字的 XOR 值](/solution/3100-3199/3158.Find%20the%20XOR%20of%20Numbers%20Which%20Appear%20Twice/README.md) | `位运算`,`数组`,`哈希表` | 简单 | 第 131 场双周赛 | +| 3159 | [查询数组中元素的出现位置](/solution/3100-3199/3159.Find%20Occurrences%20of%20an%20Element%20in%20an%20Array/README.md) | `数组`,`哈希表` | 中等 | 第 131 场双周赛 | +| 3160 | [所有球里面不同颜色的数目](/solution/3100-3199/3160.Find%20the%20Number%20of%20Distinct%20Colors%20Among%20the%20Balls/README.md) | `数组`,`哈希表`,`模拟` | 中等 | 第 131 场双周赛 | +| 3161 | [物块放置查询](/solution/3100-3199/3161.Block%20Placement%20Queries/README.md) | `树状数组`,`线段树`,`数组`,`二分查找` | 困难 | 第 131 场双周赛 | +| 3162 | [优质数对的总数 I](/solution/3100-3199/3162.Find%20the%20Number%20of%20Good%20Pairs%20I/README.md) | `数组`,`哈希表` | 简单 | 第 399 场周赛 | +| 3163 | [压缩字符串 III](/solution/3100-3199/3163.String%20Compression%20III/README.md) | `字符串` | 中等 | 第 399 场周赛 | +| 3164 | [优质数对的总数 II](/solution/3100-3199/3164.Find%20the%20Number%20of%20Good%20Pairs%20II/README.md) | `数组`,`哈希表` | 中等 | 第 399 场周赛 | +| 3165 | [不包含相邻元素的子序列的最大和](/solution/3100-3199/3165.Maximum%20Sum%20of%20Subsequence%20With%20Non-adjacent%20Elements/README.md) | `线段树`,`数组`,`分治`,`动态规划` | 困难 | 第 399 场周赛 | +| 3166 | [计算停车费与时长](/solution/3100-3199/3166.Calculate%20Parking%20Fees%20and%20Duration/README.md) | `数据库` | 中等 | 🔒 | +| 3167 | [字符串的更好压缩](/solution/3100-3199/3167.Better%20Compression%20of%20String/README.md) | `哈希表`,`字符串`,`计数`,`排序` | 中等 | 🔒 | +| 3168 | [候诊室中的最少椅子数](/solution/3100-3199/3168.Minimum%20Number%20of%20Chairs%20in%20a%20Waiting%20Room/README.md) | `字符串`,`模拟` | 简单 | 第 400 场周赛 | +| 3169 | [无需开会的工作日](/solution/3100-3199/3169.Count%20Days%20Without%20Meetings/README.md) | `数组`,`排序` | 中等 | 第 400 场周赛 | +| 3170 | [删除星号以后字典序最小的字符串](/solution/3100-3199/3170.Lexicographically%20Minimum%20String%20After%20Removing%20Stars/README.md) | `栈`,`贪心`,`哈希表`,`字符串`,`堆（优先队列）` | 中等 | 第 400 场周赛 | +| 3171 | [找到按位或最接近 K 的子数组](/solution/3100-3199/3171.Find%20Subarray%20With%20Bitwise%20OR%20Closest%20to%20K/README.md) | `位运算`,`线段树`,`数组`,`二分查找` | 困难 | 第 400 场周赛 | +| 3172 | [第二天验证](/solution/3100-3199/3172.Second%20Day%20Verification/README.md) | `数据库` | 简单 | 🔒 | +| 3173 | [相邻元素的按位或](/solution/3100-3199/3173.Bitwise%20OR%20of%20Adjacent%20Elements/README.md) | `位运算`,`数组` | 简单 | 🔒 | +| 3174 | [清除数字](/solution/3100-3199/3174.Clear%20Digits/README.md) | `哈希表`,`字符串`,`模拟` | 简单 | 第 132 场双周赛 | +| 3175 | [找到连续赢 K 场比赛的第一位玩家](/solution/3100-3199/3175.Find%20The%20First%20Player%20to%20win%20K%20Games%20in%20a%20Row/README.md) | `数组`,`模拟` | 中等 | 第 132 场双周赛 | +| 3176 | [求出最长好子序列 I](/solution/3100-3199/3176.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20I/README.md) | `数组`,`哈希表`,`动态规划` | 中等 | 第 132 场双周赛 | +| 3177 | [求出最长好子序列 II](/solution/3100-3199/3177.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20II/README.md) | `数组`,`哈希表`,`动态规划` | 困难 | 第 132 场双周赛 | +| 3178 | [找出 K 秒后拿着球的孩子](/solution/3100-3199/3178.Find%20the%20Child%20Who%20Has%20the%20Ball%20After%20K%20Seconds/README.md) | `数学`,`模拟` | 简单 | 第 401 场周赛 | +| 3179 | [K 秒后第 N 个元素的值](/solution/3100-3199/3179.Find%20the%20N-th%20Value%20After%20K%20Seconds/README.md) | `数组`,`数学`,`组合数学`,`前缀和`,`模拟` | 中等 | 第 401 场周赛 | +| 3180 | [执行操作可获得的最大总奖励 I](/solution/3100-3199/3180.Maximum%20Total%20Reward%20Using%20Operations%20I/README.md) | `数组`,`动态规划` | 中等 | 第 401 场周赛 | +| 3181 | [执行操作可获得的最大总奖励 II](/solution/3100-3199/3181.Maximum%20Total%20Reward%20Using%20Operations%20II/README.md) | `位运算`,`数组`,`动态规划` | 困难 | 第 401 场周赛 | +| 3182 | [查找得分最高的学生](/solution/3100-3199/3182.Find%20Top%20Scoring%20Students/README.md) | `数据库` | 中等 | 🔒 | +| 3183 | [达到总和的方法数量](/solution/3100-3199/3183.The%20Number%20of%20Ways%20to%20Make%20the%20Sum/README.md) | `数组`,`动态规划` | 中等 | 🔒 | +| 3184 | [构成整天的下标对数目 I](/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README.md) | `数组`,`哈希表`,`计数` | 简单 | 第 402 场周赛 | +| 3185 | [构成整天的下标对数目 II](/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README.md) | `数组`,`哈希表`,`计数` | 中等 | 第 402 场周赛 | +| 3186 | [施咒的最大总伤害](/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README.md) | `数组`,`哈希表`,`双指针`,`二分查找`,`动态规划`,`计数`,`排序` | 中等 | 第 402 场周赛 | +| 3187 | [数组中的峰值](/solution/3100-3199/3187.Peaks%20in%20Array/README.md) | `树状数组`,`线段树`,`数组` | 困难 | 第 402 场周赛 | +| 3188 | [查找得分最高的学生 II](/solution/3100-3199/3188.Find%20Top%20Scoring%20Students%20II/README.md) | | 困难 | 🔒 | +| 3189 | [Minimum Moves to Get a Peaceful Board](/solution/3100-3199/3189.Minimum%20Moves%20to%20Get%20a%20Peaceful%20Board/README.md) | | 中等 | 🔒 | + +## 版权 + +本项目著作权归 [GitHub 开源社区 Doocs](https://github.com/doocs) 所有，商业转载请联系 @yanglbme 获得授权，非商业转载请注明出处。 + +## 联系我们 + +欢迎各位小伙伴们添加 @yanglbme 的个人微信（微信号：YLB0109），备注 「**leetcode**」。后续我们会创建算法、技术相关的交流群，大家一起交流学习，分享经验，共同进步。 + +| | +| ------------------------------------------------------------------------------------------------------------------------------ | diff --git a/solution/README_EN.md b/solution/README_EN.md index 6d3e1cf11174e..545c697ee03da 100644 --- a/solution/README_EN.md +++ b/solution/README_EN.md @@ -1,3214 +1,3214 @@ -# LeetCode - -[中文文档](/solution/README.md) - -## Solutions - -Press Control + F(or Command + F on the Mac) to search anything you want. - -| # | Solution | Tags | Difficulty | Remark | -| ---- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------------------------------------- | ---------- | -------------------- | -| 0001 | [Two Sum](/solution/0000-0099/0001.Two%20Sum/README_EN.md) | `Array`,`Hash Table` | Easy | | -| 0002 | [Add Two Numbers](/solution/0000-0099/0002.Add%20Two%20Numbers/README_EN.md) | `Recursion`,`Linked List`,`Math` | Medium | | -| 0003 | [Longest Substring Without Repeating Characters](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | | -| 0004 | [Median of Two Sorted Arrays](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README_EN.md) | `Array`,`Binary Search`,`Divide and Conquer` | Hard | | -| 0005 | [Longest Palindromic Substring](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Medium | | -| 0006 | [Zigzag Conversion](/solution/0000-0099/0006.Zigzag%20Conversion/README_EN.md) | `String` | Medium | | -| 0007 | [Reverse Integer](/solution/0000-0099/0007.Reverse%20Integer/README_EN.md) | `Math` | Medium | | -| 0008 | [String to Integer (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README_EN.md) | `String` | Medium | | -| 0009 | [Palindrome Number](/solution/0000-0099/0009.Palindrome%20Number/README_EN.md) | `Math` | Easy | | -| 0010 | [Regular Expression Matching](/solution/0000-0099/0010.Regular%20Expression%20Matching/README_EN.md) | `Recursion`,`String`,`Dynamic Programming` | Hard | | -| 0011 | [Container With Most Water](/solution/0000-0099/0011.Container%20With%20Most%20Water/README_EN.md) | `Greedy`,`Array`,`Two Pointers` | Medium | | -| 0012 | [Integer to Roman](/solution/0000-0099/0012.Integer%20to%20Roman/README_EN.md) | `Hash Table`,`Math`,`String` | Medium | | -| 0013 | [Roman to Integer](/solution/0000-0099/0013.Roman%20to%20Integer/README_EN.md) | `Hash Table`,`Math`,`String` | Easy | | -| 0014 | [Longest Common Prefix](/solution/0000-0099/0014.Longest%20Common%20Prefix/README_EN.md) | `Trie`,`String` | Easy | | -| 0015 | [3Sum](/solution/0000-0099/0015.3Sum/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | | -| 0016 | [3Sum Closest](/solution/0000-0099/0016.3Sum%20Closest/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | | -| 0017 | [Letter Combinations of a Phone Number](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README_EN.md) | `Hash Table`,`String`,`Backtracking` | Medium | | -| 0018 | [4Sum](/solution/0000-0099/0018.4Sum/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | | -| 0019 | [Remove Nth Node From End of List](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | | -| 0020 | [Valid Parentheses](/solution/0000-0099/0020.Valid%20Parentheses/README_EN.md) | `Stack`,`String` | Easy | | -| 0021 | [Merge Two Sorted Lists](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README_EN.md) | `Recursion`,`Linked List` | Easy | | -| 0022 | [Generate Parentheses](/solution/0000-0099/0022.Generate%20Parentheses/README_EN.md) | `String`,`Dynamic Programming`,`Backtracking` | Medium | | -| 0023 | [Merge k Sorted Lists](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README_EN.md) | `Linked List`,`Divide and Conquer`,`Heap (Priority Queue)`,`Merge Sort` | Hard | | -| 0024 | [Swap Nodes in Pairs](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README_EN.md) | `Recursion`,`Linked List` | Medium | | -| 0025 | [Reverse Nodes in k-Group](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README_EN.md) | `Recursion`,`Linked List` | Hard | | -| 0026 | [Remove Duplicates from Sorted Array](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README_EN.md) | `Array`,`Two Pointers` | Easy | | -| 0027 | [Remove Element](/solution/0000-0099/0027.Remove%20Element/README_EN.md) | `Array`,`Two Pointers` | Easy | | -| 0028 | [Find the Index of the First Occurrence in a String](/solution/0000-0099/0028.Find%20the%20Index%20of%20the%20First%20Occurrence%20in%20a%20String/README_EN.md) | `Two Pointers`,`String`,`String Matching` | Easy | | -| 0029 | [Divide Two Integers](/solution/0000-0099/0029.Divide%20Two%20Integers/README_EN.md) | `Bit Manipulation`,`Math` | Medium | | -| 0030 | [Substring with Concatenation of All Words](/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | | -| 0031 | [Next Permutation](/solution/0000-0099/0031.Next%20Permutation/README_EN.md) | `Array`,`Two Pointers` | Medium | | -| 0032 | [Longest Valid Parentheses](/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README_EN.md) | `Stack`,`String`,`Dynamic Programming` | Hard | | -| 0033 | [Search in Rotated Sorted Array](/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | | -| 0034 | [Find First and Last Position of Element in Sorted Array](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | | -| 0035 | [Search Insert Position](/solution/0000-0099/0035.Search%20Insert%20Position/README_EN.md) | `Array`,`Binary Search` | Easy | | -| 0036 | [Valid Sudoku](/solution/0000-0099/0036.Valid%20Sudoku/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | | -| 0037 | [Sudoku Solver](/solution/0000-0099/0037.Sudoku%20Solver/README_EN.md) | `Array`,`Hash Table`,`Backtracking`,`Matrix` | Hard | | -| 0038 | [Count and Say](/solution/0000-0099/0038.Count%20and%20Say/README_EN.md) | `String` | Medium | | -| 0039 | [Combination Sum](/solution/0000-0099/0039.Combination%20Sum/README_EN.md) | `Array`,`Backtracking` | Medium | | -| 0040 | [Combination Sum II](/solution/0000-0099/0040.Combination%20Sum%20II/README_EN.md) | `Array`,`Backtracking` | Medium | | -| 0041 | [First Missing Positive](/solution/0000-0099/0041.First%20Missing%20Positive/README_EN.md) | `Array`,`Hash Table` | Hard | | -| 0042 | [Trapping Rain Water](/solution/0000-0099/0042.Trapping%20Rain%20Water/README_EN.md) | `Stack`,`Array`,`Two Pointers`,`Dynamic Programming`,`Monotonic Stack` | Hard | | -| 0043 | [Multiply Strings](/solution/0000-0099/0043.Multiply%20Strings/README_EN.md) | `Math`,`String`,`Simulation` | Medium | | -| 0044 | [Wildcard Matching](/solution/0000-0099/0044.Wildcard%20Matching/README_EN.md) | `Greedy`,`Recursion`,`String`,`Dynamic Programming` | Hard | | -| 0045 | [Jump Game II](/solution/0000-0099/0045.Jump%20Game%20II/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | | -| 0046 | [Permutations](/solution/0000-0099/0046.Permutations/README_EN.md) | `Array`,`Backtracking` | Medium | | -| 0047 | [Permutations II](/solution/0000-0099/0047.Permutations%20II/README_EN.md) | `Array`,`Backtracking` | Medium | | -| 0048 | [Rotate Image](/solution/0000-0099/0048.Rotate%20Image/README_EN.md) | `Array`,`Math`,`Matrix` | Medium | | -| 0049 | [Group Anagrams](/solution/0000-0099/0049.Group%20Anagrams/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | | -| 0050 | [Pow(x, n)](/solution/0000-0099/0050.Pow%28x%2C%20n%29/README_EN.md) | `Recursion`,`Math` | Medium | | -| 0051 | [N-Queens](/solution/0000-0099/0051.N-Queens/README_EN.md) | `Array`,`Backtracking` | Hard | | -| 0052 | [N-Queens II](/solution/0000-0099/0052.N-Queens%20II/README_EN.md) | `Backtracking` | Hard | | -| 0053 | [Maximum Subarray](/solution/0000-0099/0053.Maximum%20Subarray/README_EN.md) | `Array`,`Divide and Conquer`,`Dynamic Programming` | Medium | | -| 0054 | [Spiral Matrix](/solution/0000-0099/0054.Spiral%20Matrix/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | | -| 0055 | [Jump Game](/solution/0000-0099/0055.Jump%20Game/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | | -| 0056 | [Merge Intervals](/solution/0000-0099/0056.Merge%20Intervals/README_EN.md) | `Array`,`Sorting` | Medium | | -| 0057 | [Insert Interval](/solution/0000-0099/0057.Insert%20Interval/README_EN.md) | `Array` | Medium | | -| 0058 | [Length of Last Word](/solution/0000-0099/0058.Length%20of%20Last%20Word/README_EN.md) | `String` | Easy | | -| 0059 | [Spiral Matrix II](/solution/0000-0099/0059.Spiral%20Matrix%20II/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | | -| 0060 | [Permutation Sequence](/solution/0000-0099/0060.Permutation%20Sequence/README_EN.md) | `Recursion`,`Math` | Hard | | -| 0061 | [Rotate List](/solution/0000-0099/0061.Rotate%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | | -| 0062 | [Unique Paths](/solution/0000-0099/0062.Unique%20Paths/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | | -| 0063 | [Unique Paths II](/solution/0000-0099/0063.Unique%20Paths%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | | -| 0064 | [Minimum Path Sum](/solution/0000-0099/0064.Minimum%20Path%20Sum/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | | -| 0065 | [Valid Number](/solution/0000-0099/0065.Valid%20Number/README_EN.md) | `String` | Hard | | -| 0066 | [Plus One](/solution/0000-0099/0066.Plus%20One/README_EN.md) | `Array`,`Math` | Easy | | -| 0067 | [Add Binary](/solution/0000-0099/0067.Add%20Binary/README_EN.md) | `Bit Manipulation`,`Math`,`String`,`Simulation` | Easy | | -| 0068 | [Text Justification](/solution/0000-0099/0068.Text%20Justification/README_EN.md) | `Array`,`String`,`Simulation` | Hard | | -| 0069 | [Sqrt(x)](/solution/0000-0099/0069.Sqrt%28x%29/README_EN.md) | `Math`,`Binary Search` | Easy | | -| 0070 | [Climbing Stairs](/solution/0000-0099/0070.Climbing%20Stairs/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming` | Easy | | -| 0071 | [Simplify Path](/solution/0000-0099/0071.Simplify%20Path/README_EN.md) | `Stack`,`String` | Medium | | -| 0072 | [Edit Distance](/solution/0000-0099/0072.Edit%20Distance/README_EN.md) | `String`,`Dynamic Programming` | Medium | | -| 0073 | [Set Matrix Zeroes](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | | -| 0074 | [Search a 2D Matrix](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | | -| 0075 | [Sort Colors](/solution/0000-0099/0075.Sort%20Colors/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | | -| 0076 | [Minimum Window Substring](/solution/0000-0099/0076.Minimum%20Window%20Substring/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | | -| 0077 | [Combinations](/solution/0000-0099/0077.Combinations/README_EN.md) | `Backtracking` | Medium | | -| 0078 | [Subsets](/solution/0000-0099/0078.Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking` | Medium | | -| 0079 | [Word Search](/solution/0000-0099/0079.Word%20Search/README_EN.md) | `Array`,`String`,`Backtracking`,`Matrix` | Medium | | -| 0080 | [Remove Duplicates from Sorted Array II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README_EN.md) | `Array`,`Two Pointers` | Medium | | -| 0081 | [Search in Rotated Sorted Array II](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README_EN.md) | `Array`,`Binary Search` | Medium | | -| 0082 | [Remove Duplicates from Sorted List II](/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README_EN.md) | `Linked List`,`Two Pointers` | Medium | | -| 0083 | [Remove Duplicates from Sorted List](/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README_EN.md) | `Linked List` | Easy | | -| 0084 | [Largest Rectangle in Histogram](/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Hard | | -| 0085 | [Maximal Rectangle](/solution/0000-0099/0085.Maximal%20Rectangle/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Matrix`,`Monotonic Stack` | Hard | | -| 0086 | [Partition List](/solution/0000-0099/0086.Partition%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | | -| 0087 | [Scramble String](/solution/0000-0099/0087.Scramble%20String/README_EN.md) | `String`,`Dynamic Programming` | Hard | | -| 0088 | [Merge Sorted Array](/solution/0000-0099/0088.Merge%20Sorted%20Array/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | | -| 0089 | [Gray Code](/solution/0000-0099/0089.Gray%20Code/README_EN.md) | `Bit Manipulation`,`Math`,`Backtracking` | Medium | | -| 0090 | [Subsets II](/solution/0000-0099/0090.Subsets%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking` | Medium | | -| 0091 | [Decode Ways](/solution/0000-0099/0091.Decode%20Ways/README_EN.md) | `String`,`Dynamic Programming` | Medium | | -| 0092 | [Reverse Linked List II](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README_EN.md) | `Linked List` | Medium | | -| 0093 | [Restore IP Addresses](/solution/0000-0099/0093.Restore%20IP%20Addresses/README_EN.md) | `String`,`Backtracking` | Medium | | -| 0094 | [Binary Tree Inorder Traversal](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Easy | | -| 0095 | [Unique Binary Search Trees II](/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README_EN.md) | `Tree`,`Binary Search Tree`,`Dynamic Programming`,`Backtracking`,`Binary Tree` | Medium | | -| 0096 | [Unique Binary Search Trees](/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README_EN.md) | `Tree`,`Binary Search Tree`,`Math`,`Dynamic Programming`,`Binary Tree` | Medium | | -| 0097 | [Interleaving String](/solution/0000-0099/0097.Interleaving%20String/README_EN.md) | `String`,`Dynamic Programming` | Medium | | -| 0098 | [Validate Binary Search Tree](/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | -| 0099 | [Recover Binary Search Tree](/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | -| 0100 | [Same Tree](/solution/0100-0199/0100.Same%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | -| 0101 | [Symmetric Tree](/solution/0100-0199/0101.Symmetric%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | -| 0102 | [Binary Tree Level Order Traversal](/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | | -| 0103 | [Binary Tree Zigzag Level Order Traversal](/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | | -| 0104 | [Maximum Depth of Binary Tree](/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | -| 0105 | [Construct Binary Tree from Preorder and Inorder Traversal](/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README_EN.md) | `Tree`,`Array`,`Hash Table`,`Divide and Conquer`,`Binary Tree` | Medium | | -| 0106 | [Construct Binary Tree from Inorder and Postorder Traversal](/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README_EN.md) | `Tree`,`Array`,`Hash Table`,`Divide and Conquer`,`Binary Tree` | Medium | | -| 0107 | [Binary Tree Level Order Traversal II](/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | | -| 0108 | [Convert Sorted Array to Binary Search Tree](/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Binary Search Tree`,`Array`,`Divide and Conquer`,`Binary Tree` | Easy | | -| 0109 | [Convert Sorted List to Binary Search Tree](/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Binary Search Tree`,`Linked List`,`Divide and Conquer`,`Binary Tree` | Medium | | -| 0110 | [Balanced Binary Tree](/solution/0100-0199/0110.Balanced%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | | -| 0111 | [Minimum Depth of Binary Tree](/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | -| 0112 | [Path Sum](/solution/0100-0199/0112.Path%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | -| 0113 | [Path Sum II](/solution/0100-0199/0113.Path%20Sum%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Backtracking`,`Binary Tree` | Medium | | -| 0114 | [Flatten Binary Tree to Linked List](/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Linked List`,`Binary Tree` | Medium | | -| 0115 | [Distinct Subsequences](/solution/0100-0199/0115.Distinct%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | | -| 0116 | [Populating Next Right Pointers in Each Node](/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Linked List`,`Binary Tree` | Medium | | -| 0117 | [Populating Next Right Pointers in Each Node II](/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Linked List`,`Binary Tree` | Medium | | -| 0118 | [Pascal's Triangle](/solution/0100-0199/0118.Pascal%27s%20Triangle/README_EN.md) | `Array`,`Dynamic Programming` | Easy | | -| 0119 | [Pascal's Triangle II](/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README_EN.md) | `Array`,`Dynamic Programming` | Easy | | -| 0120 | [Triangle](/solution/0100-0199/0120.Triangle/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | -| 0121 | [Best Time to Buy and Sell Stock](/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README_EN.md) | `Array`,`Dynamic Programming` | Easy | | -| 0122 | [Best Time to Buy and Sell Stock II](/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | | -| 0123 | [Best Time to Buy and Sell Stock III](/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | -| 0124 | [Binary Tree Maximum Path Sum](/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Hard | | -| 0125 | [Valid Palindrome](/solution/0100-0199/0125.Valid%20Palindrome/README_EN.md) | `Two Pointers`,`String` | Easy | | -| 0126 | [Word Ladder II](/solution/0100-0199/0126.Word%20Ladder%20II/README_EN.md) | `Breadth-First Search`,`Hash Table`,`String`,`Backtracking` | Hard | | -| 0127 | [Word Ladder](/solution/0100-0199/0127.Word%20Ladder/README_EN.md) | `Breadth-First Search`,`Hash Table`,`String` | Hard | | -| 0128 | [Longest Consecutive Sequence](/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README_EN.md) | `Union Find`,`Array`,`Hash Table` | Medium | | -| 0129 | [Sum Root to Leaf Numbers](/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | | -| 0130 | [Surrounded Regions](/solution/0100-0199/0130.Surrounded%20Regions/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | | -| 0131 | [Palindrome Partitioning](/solution/0100-0199/0131.Palindrome%20Partitioning/README_EN.md) | `String`,`Dynamic Programming`,`Backtracking` | Medium | | -| 0132 | [Palindrome Partitioning II](/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | | -| 0133 | [Clone Graph](/solution/0100-0199/0133.Clone%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Hash Table` | Medium | | -| 0134 | [Gas Station](/solution/0100-0199/0134.Gas%20Station/README_EN.md) | `Greedy`,`Array` | Medium | | -| 0135 | [Candy](/solution/0100-0199/0135.Candy/README_EN.md) | `Greedy`,`Array` | Hard | | -| 0136 | [Single Number](/solution/0100-0199/0136.Single%20Number/README_EN.md) | `Bit Manipulation`,`Array` | Easy | | -| 0137 | [Single Number II](/solution/0100-0199/0137.Single%20Number%20II/README_EN.md) | `Bit Manipulation`,`Array` | Medium | | -| 0138 | [Copy List with Random Pointer](/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README_EN.md) | `Hash Table`,`Linked List` | Medium | | -| 0139 | [Word Break](/solution/0100-0199/0139.Word%20Break/README_EN.md) | `Trie`,`Memoization`,`Array`,`Hash Table`,`String`,`Dynamic Programming` | Medium | | -| 0140 | [Word Break II](/solution/0100-0199/0140.Word%20Break%20II/README_EN.md) | `Trie`,`Memoization`,`Array`,`Hash Table`,`String`,`Dynamic Programming`,`Backtracking` | Hard | | -| 0141 | [Linked List Cycle](/solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md) | `Hash Table`,`Linked List`,`Two Pointers` | Easy | | -| 0142 | [Linked List Cycle II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md) | `Hash Table`,`Linked List`,`Two Pointers` | Medium | | -| 0143 | [Reorder List](/solution/0100-0199/0143.Reorder%20List/README_EN.md) | `Stack`,`Recursion`,`Linked List`,`Two Pointers` | Medium | | -| 0144 | [Binary Tree Preorder Traversal](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Easy | | -| 0145 | [Binary Tree Postorder Traversal](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Easy | | -| 0146 | [LRU Cache](/solution/0100-0199/0146.LRU%20Cache/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List` | Medium | | -| 0147 | [Insertion Sort List](/solution/0100-0199/0147.Insertion%20Sort%20List/README_EN.md) | `Linked List`,`Sorting` | Medium | | -| 0148 | [Sort List](/solution/0100-0199/0148.Sort%20List/README_EN.md) | `Linked List`,`Two Pointers`,`Divide and Conquer`,`Sorting`,`Merge Sort` | Medium | | -| 0149 | [Max Points on a Line](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README_EN.md) | `Geometry`,`Array`,`Hash Table`,`Math` | Hard | | -| 0150 | [Evaluate Reverse Polish Notation](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README_EN.md) | `Stack`,`Array`,`Math` | Medium | | -| 0151 | [Reverse Words in a String](/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README_EN.md) | `Two Pointers`,`String` | Medium | | -| 0152 | [Maximum Product Subarray](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | -| 0153 | [Find Minimum in Rotated Sorted Array](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | | -| 0154 | [Find Minimum in Rotated Sorted Array II](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README_EN.md) | `Array`,`Binary Search` | Hard | | -| 0155 | [Min Stack](/solution/0100-0199/0155.Min%20Stack/README_EN.md) | `Stack`,`Design` | Medium | | -| 0156 | [Binary Tree Upside Down](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | -| 0157 | [Read N Characters Given Read4](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README_EN.md) | `Array`,`Interactive`,`Simulation` | Easy | 🔒 | -| 0158 | [Read N Characters Given read4 II - Call Multiple Times](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20read4%20II%20-%20Call%20Multiple%20Times/README_EN.md) | `Array`,`Interactive`,`Simulation` | Hard | 🔒 | -| 0159 | [Longest Substring with At Most Two Distinct Characters](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | 🔒 | -| 0160 | [Intersection of Two Linked Lists](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README_EN.md) | `Hash Table`,`Linked List`,`Two Pointers` | Easy | | -| 0161 | [One Edit Distance](/solution/0100-0199/0161.One%20Edit%20Distance/README_EN.md) | `Two Pointers`,`String` | Medium | 🔒 | -| 0162 | [Find Peak Element](/solution/0100-0199/0162.Find%20Peak%20Element/README_EN.md) | `Array`,`Binary Search` | Medium | | -| 0163 | [Missing Ranges](/solution/0100-0199/0163.Missing%20Ranges/README_EN.md) | `Array` | Easy | 🔒 | -| 0164 | [Maximum Gap](/solution/0100-0199/0164.Maximum%20Gap/README_EN.md) | `Array`,`Bucket Sort`,`Radix Sort`,`Sorting` | Medium | | -| 0165 | [Compare Version Numbers](/solution/0100-0199/0165.Compare%20Version%20Numbers/README_EN.md) | `Two Pointers`,`String` | Medium | | -| 0166 | [Fraction to Recurring Decimal](/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README_EN.md) | `Hash Table`,`Math`,`String` | Medium | | -| 0167 | [Two Sum II - Input Array Is Sorted](/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted/README_EN.md) | `Array`,`Two Pointers`,`Binary Search` | Medium | | -| 0168 | [Excel Sheet Column Title](/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README_EN.md) | `Math`,`String` | Easy | | -| 0169 | [Majority Element](/solution/0100-0199/0169.Majority%20Element/README_EN.md) | `Array`,`Hash Table`,`Divide and Conquer`,`Counting`,`Sorting` | Easy | | -| 0170 | [Two Sum III - Data structure design](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README_EN.md) | `Design`,`Array`,`Hash Table`,`Two Pointers`,`Data Stream` | Easy | 🔒 | -| 0171 | [Excel Sheet Column Number](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README_EN.md) | `Math`,`String` | Easy | | -| 0172 | [Factorial Trailing Zeroes](/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README_EN.md) | `Math` | Medium | | -| 0173 | [Binary Search Tree Iterator](/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README_EN.md) | `Stack`,`Tree`,`Design`,`Binary Search Tree`,`Binary Tree`,`Iterator` | Medium | | -| 0174 | [Dungeon Game](/solution/0100-0199/0174.Dungeon%20Game/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | | -| 0175 | [Combine Two Tables](/solution/0100-0199/0175.Combine%20Two%20Tables/README_EN.md) | `Database` | Easy | | -| 0176 | [Second Highest Salary](/solution/0100-0199/0176.Second%20Highest%20Salary/README_EN.md) | `Database` | Medium | | -| 0177 | [Nth Highest Salary](/solution/0100-0199/0177.Nth%20Highest%20Salary/README_EN.md) | `Database` | Medium | | -| 0178 | [Rank Scores](/solution/0100-0199/0178.Rank%20Scores/README_EN.md) | `Database` | Medium | | -| 0179 | [Largest Number](/solution/0100-0199/0179.Largest%20Number/README_EN.md) | `Greedy`,`Array`,`String`,`Sorting` | Medium | | -| 0180 | [Consecutive Numbers](/solution/0100-0199/0180.Consecutive%20Numbers/README_EN.md) | `Database` | Medium | | -| 0181 | [Employees Earning More Than Their Managers](/solution/0100-0199/0181.Employees%20Earning%20More%20Than%20Their%20Managers/README_EN.md) | `Database` | Easy | | -| 0182 | [Duplicate Emails](/solution/0100-0199/0182.Duplicate%20Emails/README_EN.md) | `Database` | Easy | | -| 0183 | [Customers Who Never Order](/solution/0100-0199/0183.Customers%20Who%20Never%20Order/README_EN.md) | `Database` | Easy | | -| 0184 | [Department Highest Salary](/solution/0100-0199/0184.Department%20Highest%20Salary/README_EN.md) | `Database` | Medium | | -| 0185 | [Department Top Three Salaries](/solution/0100-0199/0185.Department%20Top%20Three%20Salaries/README_EN.md) | `Database` | Hard | | -| 0186 | [Reverse Words in a String II](/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README_EN.md) | `Two Pointers`,`String` | Medium | 🔒 | -| 0187 | [Repeated DNA Sequences](/solution/0100-0199/0187.Repeated%20DNA%20Sequences/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Medium | | -| 0188 | [Best Time to Buy and Sell Stock IV](/solution/0100-0199/0188.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | -| 0189 | [Rotate Array](/solution/0100-0199/0189.Rotate%20Array/README_EN.md) | `Array`,`Math`,`Two Pointers` | Medium | | -| 0190 | [Reverse Bits](/solution/0100-0199/0190.Reverse%20Bits/README_EN.md) | `Bit Manipulation`,`Divide and Conquer` | Easy | | -| 0191 | [Number of 1 Bits](/solution/0100-0199/0191.Number%20of%201%20Bits/README_EN.md) | `Bit Manipulation`,`Divide and Conquer` | Easy | | -| 0192 | [Word Frequency](/solution/0100-0199/0192.Word%20Frequency/README_EN.md) | `Shell` | Medium | | -| 0193 | [Valid Phone Numbers](/solution/0100-0199/0193.Valid%20Phone%20Numbers/README_EN.md) | `Shell` | Easy | | -| 0194 | [Transpose File](/solution/0100-0199/0194.Transpose%20File/README_EN.md) | `Shell` | Medium | | -| 0195 | [Tenth Line](/solution/0100-0199/0195.Tenth%20Line/README_EN.md) | `Shell` | Easy | | -| 0196 | [Delete Duplicate Emails](/solution/0100-0199/0196.Delete%20Duplicate%20Emails/README_EN.md) | `Database` | Easy | | -| 0197 | [Rising Temperature](/solution/0100-0199/0197.Rising%20Temperature/README_EN.md) | `Database` | Easy | | -| 0198 | [House Robber](/solution/0100-0199/0198.House%20Robber/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | -| 0199 | [Binary Tree Right Side View](/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | -| 0200 | [Number of Islands](/solution/0200-0299/0200.Number%20of%20Islands/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | | -| 0201 | [Bitwise AND of Numbers Range](/solution/0200-0299/0201.Bitwise%20AND%20of%20Numbers%20Range/README_EN.md) | `Bit Manipulation` | Medium | | -| 0202 | [Happy Number](/solution/0200-0299/0202.Happy%20Number/README_EN.md) | `Hash Table`,`Math`,`Two Pointers` | Easy | | -| 0203 | [Remove Linked List Elements](/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README_EN.md) | `Recursion`,`Linked List` | Easy | | -| 0204 | [Count Primes](/solution/0200-0299/0204.Count%20Primes/README_EN.md) | `Array`,`Math`,`Enumeration`,`Number Theory` | Medium | | -| 0205 | [Isomorphic Strings](/solution/0200-0299/0205.Isomorphic%20Strings/README_EN.md) | `Hash Table`,`String` | Easy | | -| 0206 | [Reverse Linked List](/solution/0200-0299/0206.Reverse%20Linked%20List/README_EN.md) | `Recursion`,`Linked List` | Easy | | -| 0207 | [Course Schedule](/solution/0200-0299/0207.Course%20Schedule/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | | -| 0208 | [Implement Trie (Prefix Tree)](/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | | -| 0209 | [Minimum Size Subarray Sum](/solution/0200-0299/0209.Minimum%20Size%20Subarray%20Sum/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | | -| 0210 | [Course Schedule II](/solution/0200-0299/0210.Course%20Schedule%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | | -| 0211 | [Design Add and Search Words Data Structure](/solution/0200-0299/0211.Design%20Add%20and%20Search%20Words%20Data%20Structure/README_EN.md) | `Depth-First Search`,`Design`,`Trie`,`String` | Medium | | -| 0212 | [Word Search II](/solution/0200-0299/0212.Word%20Search%20II/README_EN.md) | `Trie`,`Array`,`String`,`Backtracking`,`Matrix` | Hard | | -| 0213 | [House Robber II](/solution/0200-0299/0213.House%20Robber%20II/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | -| 0214 | [Shortest Palindrome](/solution/0200-0299/0214.Shortest%20Palindrome/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | | -| 0215 | [Kth Largest Element in an Array](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README_EN.md) | `Array`,`Divide and Conquer`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | | -| 0216 | [Combination Sum III](/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md) | `Array`,`Backtracking` | Medium | | -| 0217 | [Contains Duplicate](/solution/0200-0299/0217.Contains%20Duplicate/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | | -| 0218 | [The Skyline Problem](/solution/0200-0299/0218.The%20Skyline%20Problem/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Divide and Conquer`,`Ordered Set`,`Line Sweep`,`Heap (Priority Queue)` | Hard | | -| 0219 | [Contains Duplicate II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Easy | | -| 0220 | [Contains Duplicate III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README_EN.md) | `Array`,`Bucket Sort`,`Ordered Set`,`Sorting`,`Sliding Window` | Hard | | -| 0221 | [Maximal Square](/solution/0200-0299/0221.Maximal%20Square/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | | -| 0222 | [Count Complete Tree Nodes](/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README_EN.md) | `Bit Manipulation`,`Tree`,`Binary Search`,`Binary Tree` | Easy | | -| 0223 | [Rectangle Area](/solution/0200-0299/0223.Rectangle%20Area/README_EN.md) | `Geometry`,`Math` | Medium | | -| 0224 | [Basic Calculator](/solution/0200-0299/0224.Basic%20Calculator/README_EN.md) | `Stack`,`Recursion`,`Math`,`String` | Hard | | -| 0225 | [Implement Stack using Queues](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README_EN.md) | `Stack`,`Design`,`Queue` | Easy | | -| 0226 | [Invert Binary Tree](/solution/0200-0299/0226.Invert%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | -| 0227 | [Basic Calculator II](/solution/0200-0299/0227.Basic%20Calculator%20II/README_EN.md) | `Stack`,`Math`,`String` | Medium | | -| 0228 | [Summary Ranges](/solution/0200-0299/0228.Summary%20Ranges/README_EN.md) | `Array` | Easy | | -| 0229 | [Majority Element II](/solution/0200-0299/0229.Majority%20Element%20II/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Medium | | -| 0230 | [Kth Smallest Element in a BST](/solution/0200-0299/0230.Kth%20Smallest%20Element%20in%20a%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | -| 0231 | [Power of Two](/solution/0200-0299/0231.Power%20of%20Two/README_EN.md) | `Bit Manipulation`,`Recursion`,`Math` | Easy | | -| 0232 | [Implement Queue using Stacks](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README_EN.md) | `Stack`,`Design`,`Queue` | Easy | | -| 0233 | [Number of Digit One](/solution/0200-0299/0233.Number%20of%20Digit%20One/README_EN.md) | `Recursion`,`Math`,`Dynamic Programming` | Hard | | -| 0234 | [Palindrome Linked List](/solution/0200-0299/0234.Palindrome%20Linked%20List/README_EN.md) | `Stack`,`Recursion`,`Linked List`,`Two Pointers` | Easy | | -| 0235 | [Lowest Common Ancestor of a Binary Search Tree](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | -| 0236 | [Lowest Common Ancestor of a Binary Tree](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | | -| 0237 | [Delete Node in a Linked List](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README_EN.md) | `Linked List` | Medium | | -| 0238 | [Product of Array Except Self](/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README_EN.md) | `Array`,`Prefix Sum` | Medium | | -| 0239 | [Sliding Window Maximum](/solution/0200-0299/0239.Sliding%20Window%20Maximum/README_EN.md) | `Queue`,`Array`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | | -| 0240 | [Search a 2D Matrix II](/solution/0200-0299/0240.Search%20a%202D%20Matrix%20II/README_EN.md) | `Array`,`Binary Search`,`Divide and Conquer`,`Matrix` | Medium | | -| 0241 | [Different Ways to Add Parentheses](/solution/0200-0299/0241.Different%20Ways%20to%20Add%20Parentheses/README_EN.md) | `Recursion`,`Memoization`,`Math`,`String`,`Dynamic Programming` | Medium | | -| 0242 | [Valid Anagram](/solution/0200-0299/0242.Valid%20Anagram/README_EN.md) | `Hash Table`,`String`,`Sorting` | Easy | | -| 0243 | [Shortest Word Distance](/solution/0200-0299/0243.Shortest%20Word%20Distance/README_EN.md) | `Array`,`String` | Easy | 🔒 | -| 0244 | [Shortest Word Distance II](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README_EN.md) | `Design`,`Array`,`Hash Table`,`Two Pointers`,`String` | Medium | 🔒 | -| 0245 | [Shortest Word Distance III](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README_EN.md) | `Array`,`String` | Medium | 🔒 | -| 0246 | [Strobogrammatic Number](/solution/0200-0299/0246.Strobogrammatic%20Number/README_EN.md) | `Hash Table`,`Two Pointers`,`String` | Easy | 🔒 | -| 0247 | [Strobogrammatic Number II](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README_EN.md) | `Recursion`,`Array`,`String` | Medium | 🔒 | -| 0248 | [Strobogrammatic Number III](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README_EN.md) | `Recursion`,`Array`,`String` | Hard | 🔒 | -| 0249 | [Group Shifted Strings](/solution/0200-0299/0249.Group%20Shifted%20Strings/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | 🔒 | -| 0250 | [Count Univalue Subtrees](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | -| 0251 | [Flatten 2D Vector](/solution/0200-0299/0251.Flatten%202D%20Vector/README_EN.md) | `Design`,`Array`,`Two Pointers`,`Iterator` | Medium | 🔒 | -| 0252 | [Meeting Rooms](/solution/0200-0299/0252.Meeting%20Rooms/README_EN.md) | `Array`,`Sorting` | Easy | 🔒 | -| 0253 | [Meeting Rooms II](/solution/0200-0299/0253.Meeting%20Rooms%20II/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Prefix Sum`,`Sorting`,`Heap (Priority Queue)` | Medium | 🔒 | -| 0254 | [Factor Combinations](/solution/0200-0299/0254.Factor%20Combinations/README_EN.md) | `Backtracking` | Medium | 🔒 | -| 0255 | [Verify Preorder Sequence in Binary Search Tree](/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README_EN.md) | `Stack`,`Tree`,`Binary Search Tree`,`Recursion`,`Array`,`Binary Tree`,`Monotonic Stack` | Medium | 🔒 | -| 0256 | [Paint House](/solution/0200-0299/0256.Paint%20House/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | -| 0257 | [Binary Tree Paths](/solution/0200-0299/0257.Binary%20Tree%20Paths/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Backtracking`,`Binary Tree` | Easy | | -| 0258 | [Add Digits](/solution/0200-0299/0258.Add%20Digits/README_EN.md) | `Math`,`Number Theory`,`Simulation` | Easy | | -| 0259 | [3Sum Smaller](/solution/0200-0299/0259.3Sum%20Smaller/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | 🔒 | -| 0260 | [Single Number III](/solution/0200-0299/0260.Single%20Number%20III/README_EN.md) | `Bit Manipulation`,`Array` | Medium | | -| 0261 | [Graph Valid Tree](/solution/0200-0299/0261.Graph%20Valid%20Tree/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | 🔒 | -| 0262 | [Trips and Users](/solution/0200-0299/0262.Trips%20and%20Users/README_EN.md) | `Database` | Hard | | -| 0263 | [Ugly Number](/solution/0200-0299/0263.Ugly%20Number/README_EN.md) | `Math` | Easy | | -| 0264 | [Ugly Number II](/solution/0200-0299/0264.Ugly%20Number%20II/README_EN.md) | `Hash Table`,`Math`,`Dynamic Programming`,`Heap (Priority Queue)` | Medium | | -| 0265 | [Paint House II](/solution/0200-0299/0265.Paint%20House%20II/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | -| 0266 | [Palindrome Permutation](/solution/0200-0299/0266.Palindrome%20Permutation/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String` | Easy | 🔒 | -| 0267 | [Palindrome Permutation II](/solution/0200-0299/0267.Palindrome%20Permutation%20II/README_EN.md) | `Hash Table`,`String`,`Backtracking` | Medium | 🔒 | -| 0268 | [Missing Number](/solution/0200-0299/0268.Missing%20Number/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Math`,`Binary Search`,`Sorting` | Easy | | -| 0269 | [Alien Dictionary](/solution/0200-0299/0269.Alien%20Dictionary/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`,`Array`,`String` | Hard | 🔒 | -| 0270 | [Closest Binary Search Tree Value](/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Search`,`Binary Tree` | Easy | 🔒 | -| 0271 | [Encode and Decode Strings](/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README_EN.md) | `Design`,`Array`,`String` | Medium | 🔒 | -| 0272 | [Closest Binary Search Tree Value II](/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Two Pointers`,`Binary Tree`,`Heap (Priority Queue)` | Hard | 🔒 | -| 0273 | [Integer to English Words](/solution/0200-0299/0273.Integer%20to%20English%20Words/README_EN.md) | `Recursion`,`Math`,`String` | Hard | | -| 0274 | [H-Index](/solution/0200-0299/0274.H-Index/README_EN.md) | `Array`,`Counting Sort`,`Sorting` | Medium | | -| 0275 | [H-Index II](/solution/0200-0299/0275.H-Index%20II/README_EN.md) | `Array`,`Binary Search` | Medium | | -| 0276 | [Paint Fence](/solution/0200-0299/0276.Paint%20Fence/README_EN.md) | `Dynamic Programming` | Medium | 🔒 | -| 0277 | [Find the Celebrity](/solution/0200-0299/0277.Find%20the%20Celebrity/README_EN.md) | `Graph`,`Two Pointers`,`Interactive` | Medium | 🔒 | -| 0278 | [First Bad Version](/solution/0200-0299/0278.First%20Bad%20Version/README_EN.md) | `Binary Search`,`Interactive` | Easy | | -| 0279 | [Perfect Squares](/solution/0200-0299/0279.Perfect%20Squares/README_EN.md) | `Breadth-First Search`,`Math`,`Dynamic Programming` | Medium | | -| 0280 | [Wiggle Sort](/solution/0200-0299/0280.Wiggle%20Sort/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | -| 0281 | [Zigzag Iterator](/solution/0200-0299/0281.Zigzag%20Iterator/README_EN.md) | `Design`,`Queue`,`Array`,`Iterator` | Medium | 🔒 | -| 0282 | [Expression Add Operators](/solution/0200-0299/0282.Expression%20Add%20Operators/README_EN.md) | `Math`,`String`,`Backtracking` | Hard | | -| 0283 | [Move Zeroes](/solution/0200-0299/0283.Move%20Zeroes/README_EN.md) | `Array`,`Two Pointers` | Easy | | -| 0284 | [Peeking Iterator](/solution/0200-0299/0284.Peeking%20Iterator/README_EN.md) | `Design`,`Array`,`Iterator` | Medium | | -| 0285 | [Inorder Successor in BST](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | 🔒 | -| 0286 | [Walls and Gates](/solution/0200-0299/0286.Walls%20and%20Gates/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 | -| 0287 | [Find the Duplicate Number](/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Binary Search` | Medium | | -| 0288 | [Unique Word Abbreviation](/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README_EN.md) | `Design`,`Array`,`Hash Table`,`String` | Medium | 🔒 | -| 0289 | [Game of Life](/solution/0200-0299/0289.Game%20of%20Life/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | | -| 0290 | [Word Pattern](/solution/0200-0299/0290.Word%20Pattern/README_EN.md) | `Hash Table`,`String` | Easy | | -| 0291 | [Word Pattern II](/solution/0200-0299/0291.Word%20Pattern%20II/README_EN.md) | `Hash Table`,`String`,`Backtracking` | Medium | 🔒 | -| 0292 | [Nim Game](/solution/0200-0299/0292.Nim%20Game/README_EN.md) | `Brainteaser`,`Math`,`Game Theory` | Easy | | -| 0293 | [Flip Game](/solution/0200-0299/0293.Flip%20Game/README_EN.md) | `String` | Easy | 🔒 | -| 0294 | [Flip Game II](/solution/0200-0299/0294.Flip%20Game%20II/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming`,`Backtracking`,`Game Theory` | Medium | 🔒 | -| 0295 | [Find Median from Data Stream](/solution/0200-0299/0295.Find%20Median%20from%20Data%20Stream/README_EN.md) | `Design`,`Two Pointers`,`Data Stream`,`Sorting`,`Heap (Priority Queue)` | Hard | | -| 0296 | [Best Meeting Point](/solution/0200-0299/0296.Best%20Meeting%20Point/README_EN.md) | `Array`,`Math`,`Matrix`,`Sorting` | Hard | 🔒 | -| 0297 | [Serialize and Deserialize Binary Tree](/solution/0200-0299/0297.Serialize%20and%20Deserialize%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`String`,`Binary Tree` | Hard | | -| 0298 | [Binary Tree Longest Consecutive Sequence](/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | -| 0299 | [Bulls and Cows](/solution/0200-0299/0299.Bulls%20and%20Cows/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | | -| 0300 | [Longest Increasing Subsequence](/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming` | Medium | | -| 0301 | [Remove Invalid Parentheses](/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README_EN.md) | `Breadth-First Search`,`String`,`Backtracking` | Hard | | -| 0302 | [Smallest Rectangle Enclosing Black Pixels](/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Binary Search`,`Matrix` | Hard | 🔒 | -| 0303 | [Range Sum Query - Immutable](/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README_EN.md) | `Design`,`Array`,`Prefix Sum` | Easy | | -| 0304 | [Range Sum Query 2D - Immutable](/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README_EN.md) | `Design`,`Array`,`Matrix`,`Prefix Sum` | Medium | | -| 0305 | [Number of Islands II](/solution/0300-0399/0305.Number%20of%20Islands%20II/README_EN.md) | `Union Find`,`Array`,`Hash Table` | Hard | 🔒 | -| 0306 | [Additive Number](/solution/0300-0399/0306.Additive%20Number/README_EN.md) | `String`,`Backtracking` | Medium | | -| 0307 | [Range Sum Query - Mutable](/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README_EN.md) | `Design`,`Binary Indexed Tree`,`Segment Tree`,`Array` | Medium | | -| 0308 | [Range Sum Query 2D - Mutable](/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README_EN.md) | `Design`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Matrix` | Hard | 🔒 | -| 0309 | [Best Time to Buy and Sell Stock with Cooldown](/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | -| 0310 | [Minimum Height Trees](/solution/0300-0399/0310.Minimum%20Height%20Trees/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | | -| 0311 | [Sparse Matrix Multiplication](/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | 🔒 | -| 0312 | [Burst Balloons](/solution/0300-0399/0312.Burst%20Balloons/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | -| 0313 | [Super Ugly Number](/solution/0300-0399/0313.Super%20Ugly%20Number/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | | -| 0314 | [Binary Tree Vertical Order Traversal](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`,`Sorting` | Medium | 🔒 | -| 0315 | [Count of Smaller Numbers After Self](/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | | -| 0316 | [Remove Duplicate Letters](/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Medium | | -| 0317 | [Shortest Distance from All Buildings](/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | 🔒 | -| 0318 | [Maximum Product of Word Lengths](/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README_EN.md) | `Bit Manipulation`,`Array`,`String` | Medium | | -| 0319 | [Bulb Switcher](/solution/0300-0399/0319.Bulb%20Switcher/README_EN.md) | `Brainteaser`,`Math` | Medium | | -| 0320 | [Generalized Abbreviation](/solution/0300-0399/0320.Generalized%20Abbreviation/README_EN.md) | `Bit Manipulation`,`String`,`Backtracking` | Medium | 🔒 | -| 0321 | [Create Maximum Number](/solution/0300-0399/0321.Create%20Maximum%20Number/README_EN.md) | `Stack`,`Greedy`,`Array`,`Two Pointers`,`Monotonic Stack` | Hard | | -| 0322 | [Coin Change](/solution/0300-0399/0322.Coin%20Change/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming` | Medium | | -| 0323 | [Number of Connected Components in an Undirected Graph](/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | 🔒 | -| 0324 | [Wiggle Sort II](/solution/0300-0399/0324.Wiggle%20Sort%20II/README_EN.md) | `Greedy`,`Array`,`Divide and Conquer`,`Quickselect`,`Sorting` | Medium | | -| 0325 | [Maximum Size Subarray Sum Equals k](/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | 🔒 | -| 0326 | [Power of Three](/solution/0300-0399/0326.Power%20of%20Three/README_EN.md) | `Recursion`,`Math` | Easy | | -| 0327 | [Count of Range Sum](/solution/0300-0399/0327.Count%20of%20Range%20Sum/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | | -| 0328 | [Odd Even Linked List](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README_EN.md) | `Linked List` | Medium | | -| 0329 | [Longest Increasing Path in a Matrix](/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`,`Memoization`,`Array`,`Dynamic Programming`,`Matrix` | Hard | | -| 0330 | [Patching Array](/solution/0300-0399/0330.Patching%20Array/README_EN.md) | `Greedy`,`Array` | Hard | | -| 0331 | [Verify Preorder Serialization of a Binary Tree](/solution/0300-0399/0331.Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README_EN.md) | `Stack`,`Tree`,`String`,`Binary Tree` | Medium | | -| 0332 | [Reconstruct Itinerary](/solution/0300-0399/0332.Reconstruct%20Itinerary/README_EN.md) | `Depth-First Search`,`Graph`,`Eulerian Circuit` | Hard | | -| 0333 | [Largest BST Subtree](/solution/0300-0399/0333.Largest%20BST%20Subtree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Dynamic Programming`,`Binary Tree` | Medium | 🔒 | -| 0334 | [Increasing Triplet Subsequence](/solution/0300-0399/0334.Increasing%20Triplet%20Subsequence/README_EN.md) | `Greedy`,`Array` | Medium | | -| 0335 | [Self Crossing](/solution/0300-0399/0335.Self%20Crossing/README_EN.md) | `Geometry`,`Array`,`Math` | Hard | | -| 0336 | [Palindrome Pairs](/solution/0300-0399/0336.Palindrome%20Pairs/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Hard | | -| 0337 | [House Robber III](/solution/0300-0399/0337.House%20Robber%20III/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Medium | | -| 0338 | [Counting Bits](/solution/0300-0399/0338.Counting%20Bits/README_EN.md) | `Bit Manipulation`,`Dynamic Programming` | Easy | | -| 0339 | [Nested List Weight Sum](/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README_EN.md) | `Depth-First Search`,`Breadth-First Search` | Medium | 🔒 | -| 0340 | [Longest Substring with At Most K Distinct Characters](/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | 🔒 | -| 0341 | [Flatten Nested List Iterator](/solution/0300-0399/0341.Flatten%20Nested%20List%20Iterator/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Design`,`Queue`,`Iterator` | Medium | | -| 0342 | [Power of Four](/solution/0300-0399/0342.Power%20of%20Four/README_EN.md) | `Bit Manipulation`,`Recursion`,`Math` | Easy | | -| 0343 | [Integer Break](/solution/0300-0399/0343.Integer%20Break/README_EN.md) | `Math`,`Dynamic Programming` | Medium | | -| 0344 | [Reverse String](/solution/0300-0399/0344.Reverse%20String/README_EN.md) | `Two Pointers`,`String` | Easy | | -| 0345 | [Reverse Vowels of a String](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README_EN.md) | `Two Pointers`,`String` | Easy | | -| 0346 | [Moving Average from Data Stream](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README_EN.md) | `Design`,`Queue`,`Array`,`Data Stream` | Easy | 🔒 | -| 0347 | [Top K Frequent Elements](/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README_EN.md) | `Array`,`Hash Table`,`Divide and Conquer`,`Bucket Sort`,`Counting`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | | -| 0348 | [Design Tic-Tac-Toe](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README_EN.md) | `Design`,`Array`,`Hash Table`,`Matrix`,`Simulation` | Medium | 🔒 | -| 0349 | [Intersection of Two Arrays](/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | | -| 0350 | [Intersection of Two Arrays II](/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | | -| 0351 | [Android Unlock Patterns](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README_EN.md) | `Bit Manipulation`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | 🔒 | -| 0352 | [Data Stream as Disjoint Intervals](/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README_EN.md) | `Design`,`Binary Search`,`Ordered Set` | Hard | | -| 0353 | [Design Snake Game](/solution/0300-0399/0353.Design%20Snake%20Game/README_EN.md) | `Design`,`Queue`,`Array`,`Hash Table`,`Simulation` | Medium | 🔒 | -| 0354 | [Russian Doll Envelopes](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | | -| 0355 | [Design Twitter](/solution/0300-0399/0355.Design%20Twitter/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Heap (Priority Queue)` | Medium | | -| 0356 | [Line Reflection](/solution/0300-0399/0356.Line%20Reflection/README_EN.md) | `Array`,`Hash Table`,`Math` | Medium | 🔒 | -| 0357 | [Count Numbers with Unique Digits](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README_EN.md) | `Math`,`Dynamic Programming`,`Backtracking` | Medium | | -| 0358 | [Rearrange String k Distance Apart](/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Hard | 🔒 | -| 0359 | [Logger Rate Limiter](/solution/0300-0399/0359.Logger%20Rate%20Limiter/README_EN.md) | `Design`,`Hash Table`,`Data Stream` | Easy | 🔒 | -| 0360 | [Sort Transformed Array](/solution/0300-0399/0360.Sort%20Transformed%20Array/README_EN.md) | `Array`,`Math`,`Two Pointers`,`Sorting` | Medium | 🔒 | -| 0361 | [Bomb Enemy](/solution/0300-0399/0361.Bomb%20Enemy/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | 🔒 | -| 0362 | [Design Hit Counter](/solution/0300-0399/0362.Design%20Hit%20Counter/README_EN.md) | `Design`,`Queue`,`Array`,`Binary Search`,`Data Stream` | Medium | 🔒 | -| 0363 | [Max Sum of Rectangle No Larger Than K](/solution/0300-0399/0363.Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/README_EN.md) | `Array`,`Binary Search`,`Matrix`,`Ordered Set`,`Prefix Sum` | Hard | | -| 0364 | [Nested List Weight Sum II](/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README_EN.md) | `Stack`,`Depth-First Search`,`Breadth-First Search` | Medium | 🔒 | -| 0365 | [Water and Jug Problem](/solution/0300-0399/0365.Water%20and%20Jug%20Problem/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Math` | Medium | | -| 0366 | [Find Leaves of Binary Tree](/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | -| 0367 | [Valid Perfect Square](/solution/0300-0399/0367.Valid%20Perfect%20Square/README_EN.md) | `Math`,`Binary Search` | Easy | | -| 0368 | [Largest Divisible Subset](/solution/0300-0399/0368.Largest%20Divisible%20Subset/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Sorting` | Medium | | -| 0369 | [Plus One Linked List](/solution/0300-0399/0369.Plus%20One%20Linked%20List/README_EN.md) | `Linked List`,`Math` | Medium | 🔒 | -| 0370 | [Range Addition](/solution/0300-0399/0370.Range%20Addition/README_EN.md) | `Array`,`Prefix Sum` | Medium | 🔒 | -| 0371 | [Sum of Two Integers](/solution/0300-0399/0371.Sum%20of%20Two%20Integers/README_EN.md) | `Bit Manipulation`,`Math` | Medium | | -| 0372 | [Super Pow](/solution/0300-0399/0372.Super%20Pow/README_EN.md) | `Math`,`Divide and Conquer` | Medium | | -| 0373 | [Find K Pairs with Smallest Sums](/solution/0300-0399/0373.Find%20K%20Pairs%20with%20Smallest%20Sums/README_EN.md) | `Array`,`Heap (Priority Queue)` | Medium | | -| 0374 | [Guess Number Higher or Lower](/solution/0300-0399/0374.Guess%20Number%20Higher%20or%20Lower/README_EN.md) | `Binary Search`,`Interactive` | Easy | | -| 0375 | [Guess Number Higher or Lower II](/solution/0300-0399/0375.Guess%20Number%20Higher%20or%20Lower%20II/README_EN.md) | `Math`,`Dynamic Programming`,`Game Theory` | Medium | | -| 0376 | [Wiggle Subsequence](/solution/0300-0399/0376.Wiggle%20Subsequence/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | | -| 0377 | [Combination Sum IV](/solution/0300-0399/0377.Combination%20Sum%20IV/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | -| 0378 | [Kth Smallest Element in a Sorted Matrix](/solution/0300-0399/0378.Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Medium | | -| 0379 | [Design Phone Directory](/solution/0300-0399/0379.Design%20Phone%20Directory/README_EN.md) | `Design`,`Queue`,`Array`,`Hash Table`,`Linked List` | Medium | 🔒 | -| 0380 | [Insert Delete GetRandom O(1)](/solution/0300-0399/0380.Insert%20Delete%20GetRandom%20O%281%29/README_EN.md) | `Design`,`Array`,`Hash Table`,`Math`,`Randomized` | Medium | | -| 0381 | [Insert Delete GetRandom O(1) - Duplicates allowed](/solution/0300-0399/0381.Insert%20Delete%20GetRandom%20O%281%29%20-%20Duplicates%20allowed/README_EN.md) | `Design`,`Array`,`Hash Table`,`Math`,`Randomized` | Hard | | -| 0382 | [Linked List Random Node](/solution/0300-0399/0382.Linked%20List%20Random%20Node/README_EN.md) | `Reservoir Sampling`,`Linked List`,`Math`,`Randomized` | Medium | | -| 0383 | [Ransom Note](/solution/0300-0399/0383.Ransom%20Note/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | | -| 0384 | [Shuffle an Array](/solution/0300-0399/0384.Shuffle%20an%20Array/README_EN.md) | `Array`,`Math`,`Randomized` | Medium | | -| 0385 | [Mini Parser](/solution/0300-0399/0385.Mini%20Parser/README_EN.md) | `Stack`,`Depth-First Search`,`String` | Medium | | -| 0386 | [Lexicographical Numbers](/solution/0300-0399/0386.Lexicographical%20Numbers/README_EN.md) | `Depth-First Search`,`Trie` | Medium | | -| 0387 | [First Unique Character in a String](/solution/0300-0399/0387.First%20Unique%20Character%20in%20a%20String/README_EN.md) | `Queue`,`Hash Table`,`String`,`Counting` | Easy | | -| 0388 | [Longest Absolute File Path](/solution/0300-0399/0388.Longest%20Absolute%20File%20Path/README_EN.md) | `Stack`,`Depth-First Search`,`String` | Medium | | -| 0389 | [Find the Difference](/solution/0300-0399/0389.Find%20the%20Difference/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Sorting` | Easy | | -| 0390 | [Elimination Game](/solution/0300-0399/0390.Elimination%20Game/README_EN.md) | `Recursion`,`Math` | Medium | | -| 0391 | [Perfect Rectangle](/solution/0300-0399/0391.Perfect%20Rectangle/README_EN.md) | `Array`,`Line Sweep` | Hard | | -| 0392 | [Is Subsequence](/solution/0300-0399/0392.Is%20Subsequence/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Easy | | -| 0393 | [UTF-8 Validation](/solution/0300-0399/0393.UTF-8%20Validation/README_EN.md) | `Bit Manipulation`,`Array` | Medium | | -| 0394 | [Decode String](/solution/0300-0399/0394.Decode%20String/README_EN.md) | `Stack`,`Recursion`,`String` | Medium | | -| 0395 | [Longest Substring with At Least K Repeating Characters](/solution/0300-0399/0395.Longest%20Substring%20with%20At%20Least%20K%20Repeating%20Characters/README_EN.md) | `Hash Table`,`String`,`Divide and Conquer`,`Sliding Window` | Medium | | -| 0396 | [Rotate Function](/solution/0300-0399/0396.Rotate%20Function/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | | -| 0397 | [Integer Replacement](/solution/0300-0399/0397.Integer%20Replacement/README_EN.md) | `Greedy`,`Bit Manipulation`,`Memoization`,`Dynamic Programming` | Medium | | -| 0398 | [Random Pick Index](/solution/0300-0399/0398.Random%20Pick%20Index/README_EN.md) | `Reservoir Sampling`,`Hash Table`,`Math`,`Randomized` | Medium | | -| 0399 | [Evaluate Division](/solution/0300-0399/0399.Evaluate%20Division/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`String`,`Shortest Path` | Medium | | -| 0400 | [Nth Digit](/solution/0400-0499/0400.Nth%20Digit/README_EN.md) | `Math`,`Binary Search` | Medium | | -| 0401 | [Binary Watch](/solution/0400-0499/0401.Binary%20Watch/README_EN.md) | `Bit Manipulation`,`Backtracking` | Easy | | -| 0402 | [Remove K Digits](/solution/0400-0499/0402.Remove%20K%20Digits/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Medium | | -| 0403 | [Frog Jump](/solution/0400-0499/0403.Frog%20Jump/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | -| 0404 | [Sum of Left Leaves](/solution/0400-0499/0404.Sum%20of%20Left%20Leaves/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | -| 0405 | [Convert a Number to Hexadecimal](/solution/0400-0499/0405.Convert%20a%20Number%20to%20Hexadecimal/README_EN.md) | `Bit Manipulation`,`Math` | Easy | | -| 0406 | [Queue Reconstruction by Height](/solution/0400-0499/0406.Queue%20Reconstruction%20by%20Height/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Sorting` | Medium | | -| 0407 | [Trapping Rain Water II](/solution/0400-0499/0407.Trapping%20Rain%20Water%20II/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix`,`Heap (Priority Queue)` | Hard | | -| 0408 | [Valid Word Abbreviation](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README_EN.md) | `Two Pointers`,`String` | Easy | 🔒 | -| 0409 | [Longest Palindrome](/solution/0400-0499/0409.Longest%20Palindrome/README_EN.md) | `Greedy`,`Hash Table`,`String` | Easy | | -| 0410 | [Split Array Largest Sum](/solution/0400-0499/0410.Split%20Array%20Largest%20Sum/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Dynamic Programming`,`Prefix Sum` | Hard | | -| 0411 | [Minimum Unique Word Abbreviation](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README_EN.md) | `Bit Manipulation`,`String`,`Backtracking` | Hard | 🔒 | -| 0412 | [Fizz Buzz](/solution/0400-0499/0412.Fizz%20Buzz/README_EN.md) | `Math`,`String`,`Simulation` | Easy | | -| 0413 | [Arithmetic Slices](/solution/0400-0499/0413.Arithmetic%20Slices/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | -| 0414 | [Third Maximum Number](/solution/0400-0499/0414.Third%20Maximum%20Number/README_EN.md) | `Array`,`Sorting` | Easy | | -| 0415 | [Add Strings](/solution/0400-0499/0415.Add%20Strings/README_EN.md) | `Math`,`String`,`Simulation` | Easy | | -| 0416 | [Partition Equal Subset Sum](/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | -| 0417 | [Pacific Atlantic Water Flow](/solution/0400-0499/0417.Pacific%20Atlantic%20Water%20Flow/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | | -| 0418 | [Sentence Screen Fitting](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | 🔒 | -| 0419 | [Battleships in a Board](/solution/0400-0499/0419.Battleships%20in%20a%20Board/README_EN.md) | `Depth-First Search`,`Array`,`Matrix` | Medium | | -| 0420 | [Strong Password Checker](/solution/0400-0499/0420.Strong%20Password%20Checker/README_EN.md) | `Greedy`,`String`,`Heap (Priority Queue)` | Hard | | -| 0421 | [Maximum XOR of Two Numbers in an Array](/solution/0400-0499/0421.Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/README_EN.md) | `Bit Manipulation`,`Trie`,`Array`,`Hash Table` | Medium | | -| 0422 | [Valid Word Square](/solution/0400-0499/0422.Valid%20Word%20Square/README_EN.md) | `Array`,`Matrix` | Easy | 🔒 | -| 0423 | [Reconstruct Original Digits from English](/solution/0400-0499/0423.Reconstruct%20Original%20Digits%20from%20English/README_EN.md) | `Hash Table`,`Math`,`String` | Medium | | -| 0424 | [Longest Repeating Character Replacement](/solution/0400-0499/0424.Longest%20Repeating%20Character%20Replacement/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | | -| 0425 | [Word Squares](/solution/0400-0499/0425.Word%20Squares/README_EN.md) | `Trie`,`Array`,`String`,`Backtracking` | Hard | 🔒 | -| 0426 | [Convert Binary Search Tree to Sorted Doubly Linked List](/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Linked List`,`Binary Tree`,`Doubly-Linked List` | Medium | 🔒 | -| 0427 | [Construct Quad Tree](/solution/0400-0499/0427.Construct%20Quad%20Tree/README_EN.md) | `Tree`,`Array`,`Divide and Conquer`,`Matrix` | Medium | | -| 0428 | [Serialize and Deserialize N-ary Tree](/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`String` | Hard | 🔒 | -| 0429 | [N-ary Tree Level Order Traversal](/solution/0400-0499/0429.N-ary%20Tree%20Level%20Order%20Traversal/README_EN.md) | `Tree`,`Breadth-First Search` | Medium | | -| 0430 | [Flatten a Multilevel Doubly Linked List](/solution/0400-0499/0430.Flatten%20a%20Multilevel%20Doubly%20Linked%20List/README_EN.md) | `Depth-First Search`,`Linked List`,`Doubly-Linked List` | Medium | | -| 0431 | [Encode N-ary Tree to Binary Tree](/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Tree` | Hard | 🔒 | -| 0432 | [All O`one Data Structure](/solution/0400-0499/0432.All%20O%60one%20Data%20Structure/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List` | Hard | | -| 0433 | [Minimum Genetic Mutation](/solution/0400-0499/0433.Minimum%20Genetic%20Mutation/README_EN.md) | `Breadth-First Search`,`Hash Table`,`String` | Medium | | -| 0434 | [Number of Segments in a String](/solution/0400-0499/0434.Number%20of%20Segments%20in%20a%20String/README_EN.md) | `String` | Easy | | -| 0435 | [Non-overlapping Intervals](/solution/0400-0499/0435.Non-overlapping%20Intervals/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Medium | | -| 0436 | [Find Right Interval](/solution/0400-0499/0436.Find%20Right%20Interval/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Medium | | -| 0437 | [Path Sum III](/solution/0400-0499/0437.Path%20Sum%20III/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | | -| 0438 | [Find All Anagrams in a String](/solution/0400-0499/0438.Find%20All%20Anagrams%20in%20a%20String/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | | -| 0439 | [Ternary Expression Parser](/solution/0400-0499/0439.Ternary%20Expression%20Parser/README_EN.md) | `Stack`,`Recursion`,`String` | Medium | 🔒 | -| 0440 | [K-th Smallest in Lexicographical Order](/solution/0400-0499/0440.K-th%20Smallest%20in%20Lexicographical%20Order/README_EN.md) | `Trie` | Hard | | -| 0441 | [Arranging Coins](/solution/0400-0499/0441.Arranging%20Coins/README_EN.md) | `Math`,`Binary Search` | Easy | | -| 0442 | [Find All Duplicates in an Array](/solution/0400-0499/0442.Find%20All%20Duplicates%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Medium | | -| 0443 | [String Compression](/solution/0400-0499/0443.String%20Compression/README_EN.md) | `Two Pointers`,`String` | Medium | | -| 0444 | [Sequence Reconstruction](/solution/0400-0499/0444.Sequence%20Reconstruction/README_EN.md) | `Graph`,`Topological Sort`,`Array` | Medium | 🔒 | -| 0445 | [Add Two Numbers II](/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README_EN.md) | `Stack`,`Linked List`,`Math` | Medium | | -| 0446 | [Arithmetic Slices II - Subsequence](/solution/0400-0499/0446.Arithmetic%20Slices%20II%20-%20Subsequence/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | -| 0447 | [Number of Boomerangs](/solution/0400-0499/0447.Number%20of%20Boomerangs/README_EN.md) | `Array`,`Hash Table`,`Math` | Medium | | -| 0448 | [Find All Numbers Disappeared in an Array](/solution/0400-0499/0448.Find%20All%20Numbers%20Disappeared%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | | -| 0449 | [Serialize and Deserialize BST](/solution/0400-0499/0449.Serialize%20and%20Deserialize%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Search Tree`,`String`,`Binary Tree` | Medium | | -| 0450 | [Delete Node in a BST](/solution/0400-0499/0450.Delete%20Node%20in%20a%20BST/README_EN.md) | `Tree`,`Binary Search Tree`,`Binary Tree` | Medium | | -| 0451 | [Sort Characters By Frequency](/solution/0400-0499/0451.Sort%20Characters%20By%20Frequency/README_EN.md) | `Hash Table`,`String`,`Bucket Sort`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | | -| 0452 | [Minimum Number of Arrows to Burst Balloons](/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | | -| 0453 | [Minimum Moves to Equal Array Elements](/solution/0400-0499/0453.Minimum%20Moves%20to%20Equal%20Array%20Elements/README_EN.md) | `Array`,`Math` | Medium | | -| 0454 | [4Sum II](/solution/0400-0499/0454.4Sum%20II/README_EN.md) | `Array`,`Hash Table` | Medium | | -| 0455 | [Assign Cookies](/solution/0400-0499/0455.Assign%20Cookies/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Easy | | -| 0456 | [132 Pattern](/solution/0400-0499/0456.132%20Pattern/README_EN.md) | `Stack`,`Array`,`Binary Search`,`Ordered Set`,`Monotonic Stack` | Medium | | -| 0457 | [Circular Array Loop](/solution/0400-0499/0457.Circular%20Array%20Loop/README_EN.md) | `Array`,`Hash Table`,`Two Pointers` | Medium | | -| 0458 | [Poor Pigs](/solution/0400-0499/0458.Poor%20Pigs/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | | -| 0459 | [Repeated Substring Pattern](/solution/0400-0499/0459.Repeated%20Substring%20Pattern/README_EN.md) | `String`,`String Matching` | Easy | | -| 0460 | [LFU Cache](/solution/0400-0499/0460.LFU%20Cache/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List` | Hard | | -| 0461 | [Hamming Distance](/solution/0400-0499/0461.Hamming%20Distance/README_EN.md) | `Bit Manipulation` | Easy | | -| 0462 | [Minimum Moves to Equal Array Elements II](/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README_EN.md) | `Array`,`Math`,`Sorting` | Medium | | -| 0463 | [Island Perimeter](/solution/0400-0499/0463.Island%20Perimeter/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Easy | | -| 0464 | [Can I Win](/solution/0400-0499/0464.Can%20I%20Win/README_EN.md) | `Bit Manipulation`,`Memoization`,`Math`,`Dynamic Programming`,`Bitmask`,`Game Theory` | Medium | | -| 0465 | [Optimal Account Balancing](/solution/0400-0499/0465.Optimal%20Account%20Balancing/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | 🔒 | -| 0466 | [Count The Repetitions](/solution/0400-0499/0466.Count%20The%20Repetitions/README_EN.md) | `String`,`Dynamic Programming` | Hard | | -| 0467 | [Unique Substrings in Wraparound String](/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README_EN.md) | `String`,`Dynamic Programming` | Medium | | -| 0468 | [Validate IP Address](/solution/0400-0499/0468.Validate%20IP%20Address/README_EN.md) | `String` | Medium | | -| 0469 | [Convex Polygon](/solution/0400-0499/0469.Convex%20Polygon/README_EN.md) | `Geometry`,`Array`,`Math` | Medium | 🔒 | -| 0470 | [Implement Rand10() Using Rand7()](/solution/0400-0499/0470.Implement%20Rand10%28%29%20Using%20Rand7%28%29/README_EN.md) | `Math`,`Rejection Sampling`,`Probability and Statistics`,`Randomized` | Medium | | -| 0471 | [Encode String with Shortest Length](/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README_EN.md) | `String`,`Dynamic Programming` | Hard | 🔒 | -| 0472 | [Concatenated Words](/solution/0400-0499/0472.Concatenated%20Words/README_EN.md) | `Depth-First Search`,`Trie`,`Array`,`String`,`Dynamic Programming` | Hard | | -| 0473 | [Matchsticks to Square](/solution/0400-0499/0473.Matchsticks%20to%20Square/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | | -| 0474 | [Ones and Zeroes](/solution/0400-0499/0474.Ones%20and%20Zeroes/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | | -| 0475 | [Heaters](/solution/0400-0499/0475.Heaters/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | | -| 0476 | [Number Complement](/solution/0400-0499/0476.Number%20Complement/README_EN.md) | `Bit Manipulation` | Easy | | -| 0477 | [Total Hamming Distance](/solution/0400-0499/0477.Total%20Hamming%20Distance/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Medium | | -| 0478 | [Generate Random Point in a Circle](/solution/0400-0499/0478.Generate%20Random%20Point%20in%20a%20Circle/README_EN.md) | `Geometry`,`Math`,`Rejection Sampling`,`Randomized` | Medium | | -| 0479 | [Largest Palindrome Product](/solution/0400-0499/0479.Largest%20Palindrome%20Product/README_EN.md) | `Math`,`Enumeration` | Hard | | -| 0480 | [Sliding Window Median](/solution/0400-0499/0480.Sliding%20Window%20Median/README_EN.md) | `Array`,`Hash Table`,`Sliding Window`,`Heap (Priority Queue)` | Hard | | -| 0481 | [Magical String](/solution/0400-0499/0481.Magical%20String/README_EN.md) | `Two Pointers`,`String` | Medium | | -| 0482 | [License Key Formatting](/solution/0400-0499/0482.License%20Key%20Formatting/README_EN.md) | `String` | Easy | | -| 0483 | [Smallest Good Base](/solution/0400-0499/0483.Smallest%20Good%20Base/README_EN.md) | `Math`,`Binary Search` | Hard | | -| 0484 | [Find Permutation](/solution/0400-0499/0484.Find%20Permutation/README_EN.md) | `Stack`,`Greedy`,`Array`,`String` | Medium | 🔒 | -| 0485 | [Max Consecutive Ones](/solution/0400-0499/0485.Max%20Consecutive%20Ones/README_EN.md) | `Array` | Easy | | -| 0486 | [Predict the Winner](/solution/0400-0499/0486.Predict%20the%20Winner/README_EN.md) | `Recursion`,`Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | | -| 0487 | [Max Consecutive Ones II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | 🔒 | -| 0488 | [Zuma Game](/solution/0400-0499/0488.Zuma%20Game/README_EN.md) | `Stack`,`Breadth-First Search`,`Memoization`,`String`,`Dynamic Programming` | Hard | | -| 0489 | [Robot Room Cleaner](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README_EN.md) | `Backtracking`,`Interactive` | Hard | 🔒 | -| 0490 | [The Maze](/solution/0400-0499/0490.The%20Maze/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 | -| 0491 | [Non-decreasing Subsequences](/solution/0400-0499/0491.Non-decreasing%20Subsequences/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Backtracking` | Medium | | -| 0492 | [Construct the Rectangle](/solution/0400-0499/0492.Construct%20the%20Rectangle/README_EN.md) | `Math` | Easy | | -| 0493 | [Reverse Pairs](/solution/0400-0499/0493.Reverse%20Pairs/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | | -| 0494 | [Target Sum](/solution/0400-0499/0494.Target%20Sum/README_EN.md) | `Array`,`Dynamic Programming`,`Backtracking` | Medium | | -| 0495 | [Teemo Attacking](/solution/0400-0499/0495.Teemo%20Attacking/README_EN.md) | `Array`,`Simulation` | Easy | | -| 0496 | [Next Greater Element I](/solution/0400-0499/0496.Next%20Greater%20Element%20I/README_EN.md) | `Stack`,`Array`,`Hash Table`,`Monotonic Stack` | Easy | | -| 0497 | [Random Point in Non-overlapping Rectangles](/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README_EN.md) | `Reservoir Sampling`,`Array`,`Math`,`Binary Search`,`Ordered Set`,`Prefix Sum`,`Randomized` | Medium | | -| 0498 | [Diagonal Traverse](/solution/0400-0499/0498.Diagonal%20Traverse/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | | -| 0499 | [The Maze III](/solution/0400-0499/0499.The%20Maze%20III/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Array`,`String`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | 🔒 | -| 0500 | [Keyboard Row](/solution/0500-0599/0500.Keyboard%20Row/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | | -| 0501 | [Find Mode in Binary Search Tree](/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Easy | | -| 0502 | [IPO](/solution/0500-0599/0502.IPO/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | | -| 0503 | [Next Greater Element II](/solution/0500-0599/0503.Next%20Greater%20Element%20II/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | | -| 0504 | [Base 7](/solution/0500-0599/0504.Base%207/README_EN.md) | `Math` | Easy | | -| 0505 | [The Maze II](/solution/0500-0599/0505.The%20Maze%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 | -| 0506 | [Relative Ranks](/solution/0500-0599/0506.Relative%20Ranks/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Easy | | -| 0507 | [Perfect Number](/solution/0500-0599/0507.Perfect%20Number/README_EN.md) | `Math` | Easy | | -| 0508 | [Most Frequent Subtree Sum](/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree` | Medium | | -| 0509 | [Fibonacci Number](/solution/0500-0599/0509.Fibonacci%20Number/README_EN.md) | `Recursion`,`Memoization`,`Math`,`Dynamic Programming` | Easy | | -| 0510 | [Inorder Successor in BST II](/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README_EN.md) | `Tree`,`Binary Search Tree`,`Binary Tree` | Medium | 🔒 | -| 0511 | [Game Play Analysis I](/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README_EN.md) | `Database` | Easy | | -| 0512 | [Game Play Analysis II](/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README_EN.md) | `Database` | Easy | 🔒 | -| 0513 | [Find Bottom Left Tree Value](/solution/0500-0599/0513.Find%20Bottom%20Left%20Tree%20Value/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | -| 0514 | [Freedom Trail](/solution/0500-0599/0514.Freedom%20Trail/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`String`,`Dynamic Programming` | Hard | | -| 0515 | [Find Largest Value in Each Tree Row](/solution/0500-0599/0515.Find%20Largest%20Value%20in%20Each%20Tree%20Row/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | -| 0516 | [Longest Palindromic Subsequence](/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README_EN.md) | `String`,`Dynamic Programming` | Medium | | -| 0517 | [Super Washing Machines](/solution/0500-0599/0517.Super%20Washing%20Machines/README_EN.md) | `Greedy`,`Array` | Hard | | -| 0518 | [Coin Change II](/solution/0500-0599/0518.Coin%20Change%20II/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | -| 0519 | [Random Flip Matrix](/solution/0500-0599/0519.Random%20Flip%20Matrix/README_EN.md) | `Reservoir Sampling`,`Hash Table`,`Math`,`Randomized` | Medium | | -| 0520 | [Detect Capital](/solution/0500-0599/0520.Detect%20Capital/README_EN.md) | `String` | Easy | | -| 0521 | [Longest Uncommon Subsequence I](/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README_EN.md) | `String` | Easy | | -| 0522 | [Longest Uncommon Subsequence II](/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`String`,`Sorting` | Medium | | -| 0523 | [Continuous Subarray Sum](/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README_EN.md) | `Array`,`Hash Table`,`Math`,`Prefix Sum` | Medium | | -| 0524 | [Longest Word in Dictionary through Deleting](/solution/0500-0599/0524.Longest%20Word%20in%20Dictionary%20through%20Deleting/README_EN.md) | `Array`,`Two Pointers`,`String`,`Sorting` | Medium | | -| 0525 | [Contiguous Array](/solution/0500-0599/0525.Contiguous%20Array/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | | -| 0526 | [Beautiful Arrangement](/solution/0500-0599/0526.Beautiful%20Arrangement/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | | -| 0527 | [Word Abbreviation](/solution/0500-0599/0527.Word%20Abbreviation/README_EN.md) | `Greedy`,`Trie`,`Array`,`String`,`Sorting` | Hard | 🔒 | -| 0528 | [Random Pick with Weight](/solution/0500-0599/0528.Random%20Pick%20with%20Weight/README_EN.md) | `Array`,`Math`,`Binary Search`,`Prefix Sum`,`Randomized` | Medium | | -| 0529 | [Minesweeper](/solution/0500-0599/0529.Minesweeper/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | | -| 0530 | [Minimum Absolute Difference in BST](/solution/0500-0599/0530.Minimum%20Absolute%20Difference%20in%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Search Tree`,`Binary Tree` | Easy | | -| 0531 | [Lonely Pixel I](/solution/0500-0599/0531.Lonely%20Pixel%20I/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | 🔒 | -| 0532 | [K-diff Pairs in an Array](/solution/0500-0599/0532.K-diff%20Pairs%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | | -| 0533 | [Lonely Pixel II](/solution/0500-0599/0533.Lonely%20Pixel%20II/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | 🔒 | -| 0534 | [Game Play Analysis III](/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README_EN.md) | `Database` | Medium | 🔒 | -| 0535 | [Encode and Decode TinyURL](/solution/0500-0599/0535.Encode%20and%20Decode%20TinyURL/README_EN.md) | `Design`,`Hash Table`,`String`,`Hash Function` | Medium | | -| 0536 | [Construct Binary Tree from String](/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`String`,`Binary Tree` | Medium | 🔒 | -| 0537 | [Complex Number Multiplication](/solution/0500-0599/0537.Complex%20Number%20Multiplication/README_EN.md) | `Math`,`String`,`Simulation` | Medium | | -| 0538 | [Convert BST to Greater Tree](/solution/0500-0599/0538.Convert%20BST%20to%20Greater%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | -| 0539 | [Minimum Time Difference](/solution/0500-0599/0539.Minimum%20Time%20Difference/README_EN.md) | `Array`,`Math`,`String`,`Sorting` | Medium | | -| 0540 | [Single Element in a Sorted Array](/solution/0500-0599/0540.Single%20Element%20in%20a%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | | -| 0541 | [Reverse String II](/solution/0500-0599/0541.Reverse%20String%20II/README_EN.md) | `Two Pointers`,`String` | Easy | | -| 0542 | [01 Matrix](/solution/0500-0599/0542.01%20Matrix/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix` | Medium | | -| 0543 | [Diameter of Binary Tree](/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | | -| 0544 | [Output Contest Matches](/solution/0500-0599/0544.Output%20Contest%20Matches/README_EN.md) | `Recursion`,`String`,`Simulation` | Medium | 🔒 | -| 0545 | [Boundary of Binary Tree](/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | -| 0546 | [Remove Boxes](/solution/0500-0599/0546.Remove%20Boxes/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Hard | | -| 0547 | [Number of Provinces](/solution/0500-0599/0547.Number%20of%20Provinces/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | | -| 0548 | [Split Array with Equal Sum](/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Hard | 🔒 | -| 0549 | [Binary Tree Longest Consecutive Sequence II](/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | -| 0550 | [Game Play Analysis IV](/solution/0500-0599/0550.Game%20Play%20Analysis%20IV/README_EN.md) | `Database` | Medium | | -| 0551 | [Student Attendance Record I](/solution/0500-0599/0551.Student%20Attendance%20Record%20I/README_EN.md) | `String` | Easy | | -| 0552 | [Student Attendance Record II](/solution/0500-0599/0552.Student%20Attendance%20Record%20II/README_EN.md) | `Dynamic Programming` | Hard | | -| 0553 | [Optimal Division](/solution/0500-0599/0553.Optimal%20Division/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | | -| 0554 | [Brick Wall](/solution/0500-0599/0554.Brick%20Wall/README_EN.md) | `Array`,`Hash Table` | Medium | | -| 0555 | [Split Concatenated Strings](/solution/0500-0599/0555.Split%20Concatenated%20Strings/README_EN.md) | `Greedy`,`Array`,`String` | Medium | 🔒 | -| 0556 | [Next Greater Element III](/solution/0500-0599/0556.Next%20Greater%20Element%20III/README_EN.md) | `Math`,`Two Pointers`,`String` | Medium | | -| 0557 | [Reverse Words in a String III](/solution/0500-0599/0557.Reverse%20Words%20in%20a%20String%20III/README_EN.md) | `Two Pointers`,`String` | Easy | | -| 0558 | [Logical OR of Two Binary Grids Represented as Quad-Trees](/solution/0500-0599/0558.Logical%20OR%20of%20Two%20Binary%20Grids%20Represented%20as%20Quad-Trees/README_EN.md) | `Tree`,`Divide and Conquer` | Medium | | -| 0559 | [Maximum Depth of N-ary Tree](/solution/0500-0599/0559.Maximum%20Depth%20of%20N-ary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search` | Easy | | -| 0560 | [Subarray Sum Equals K](/solution/0500-0599/0560.Subarray%20Sum%20Equals%20K/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | | -| 0561 | [Array Partition](/solution/0500-0599/0561.Array%20Partition/README_EN.md) | `Greedy`,`Array`,`Counting Sort`,`Sorting` | Easy | | -| 0562 | [Longest Line of Consecutive One in Matrix](/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | 🔒 | -| 0563 | [Binary Tree Tilt](/solution/0500-0599/0563.Binary%20Tree%20Tilt/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | | -| 0564 | [Find the Closest Palindrome](/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README_EN.md) | `Math`,`String` | Hard | | -| 0565 | [Array Nesting](/solution/0500-0599/0565.Array%20Nesting/README_EN.md) | `Depth-First Search`,`Array` | Medium | | -| 0566 | [Reshape the Matrix](/solution/0500-0599/0566.Reshape%20the%20Matrix/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | | -| 0567 | [Permutation in String](/solution/0500-0599/0567.Permutation%20in%20String/README_EN.md) | `Hash Table`,`Two Pointers`,`String`,`Sliding Window` | Medium | | -| 0568 | [Maximum Vacation Days](/solution/0500-0599/0568.Maximum%20Vacation%20Days/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | 🔒 | -| 0569 | [Median Employee Salary](/solution/0500-0599/0569.Median%20Employee%20Salary/README_EN.md) | `Database` | Hard | 🔒 | -| 0570 | [Managers with at Least 5 Direct Reports](/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README_EN.md) | `Database` | Medium | | -| 0571 | [Find Median Given Frequency of Numbers](/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README_EN.md) | `Database` | Hard | 🔒 | -| 0572 | [Subtree of Another Tree](/solution/0500-0599/0572.Subtree%20of%20Another%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree`,`String Matching`,`Hash Function` | Easy | | -| 0573 | [Squirrel Simulation](/solution/0500-0599/0573.Squirrel%20Simulation/README_EN.md) | `Array`,`Math` | Medium | 🔒 | -| 0574 | [Winning Candidate](/solution/0500-0599/0574.Winning%20Candidate/README_EN.md) | `Database` | Medium | 🔒 | -| 0575 | [Distribute Candies](/solution/0500-0599/0575.Distribute%20Candies/README_EN.md) | `Array`,`Hash Table` | Easy | | -| 0576 | [Out of Boundary Paths](/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README_EN.md) | `Dynamic Programming` | Medium | | -| 0577 | [Employee Bonus](/solution/0500-0599/0577.Employee%20Bonus/README_EN.md) | `Database` | Easy | | -| 0578 | [Get Highest Answer Rate Question](/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README_EN.md) | `Database` | Medium | 🔒 | -| 0579 | [Find Cumulative Salary of an Employee](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README_EN.md) | `Database` | Hard | 🔒 | -| 0580 | [Count Student Number in Departments](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README_EN.md) | `Database` | Medium | 🔒 | -| 0581 | [Shortest Unsorted Continuous Subarray](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README_EN.md) | `Stack`,`Greedy`,`Array`,`Two Pointers`,`Sorting`,`Monotonic Stack` | Medium | | -| 0582 | [Kill Process](/solution/0500-0599/0582.Kill%20Process/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table` | Medium | 🔒 | -| 0583 | [Delete Operation for Two Strings](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README_EN.md) | `String`,`Dynamic Programming` | Medium | | -| 0584 | [Find Customer Referee](/solution/0500-0599/0584.Find%20Customer%20Referee/README_EN.md) | `Database` | Easy | | -| 0585 | [Investments in 2016](/solution/0500-0599/0585.Investments%20in%202016/README_EN.md) | `Database` | Medium | | -| 0586 | [Customer Placing the Largest Number of Orders](/solution/0500-0599/0586.Customer%20Placing%20the%20Largest%20Number%20of%20Orders/README_EN.md) | `Database` | Easy | | -| 0587 | [Erect the Fence](/solution/0500-0599/0587.Erect%20the%20Fence/README_EN.md) | `Geometry`,`Array`,`Math` | Hard | | -| 0588 | [Design In-Memory File System](/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Hard | 🔒 | -| 0589 | [N-ary Tree Preorder Traversal](/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search` | Easy | | -| 0590 | [N-ary Tree Postorder Traversal](/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search` | Easy | | -| 0591 | [Tag Validator](/solution/0500-0599/0591.Tag%20Validator/README_EN.md) | `Stack`,`String` | Hard | | -| 0592 | [Fraction Addition and Subtraction](/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README_EN.md) | `Math`,`String`,`Simulation` | Medium | | -| 0593 | [Valid Square](/solution/0500-0599/0593.Valid%20Square/README_EN.md) | `Geometry`,`Math` | Medium | | -| 0594 | [Longest Harmonious Subsequence](/solution/0500-0599/0594.Longest%20Harmonious%20Subsequence/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting`,`Sliding Window` | Easy | | -| 0595 | [Big Countries](/solution/0500-0599/0595.Big%20Countries/README_EN.md) | `Database` | Easy | | -| 0596 | [Classes More Than 5 Students](/solution/0500-0599/0596.Classes%20More%20Than%205%20Students/README_EN.md) | `Database` | Easy | | -| 0597 | [Friend Requests I Overall Acceptance Rate](/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README_EN.md) | `Database` | Easy | 🔒 | -| 0598 | [Range Addition II](/solution/0500-0599/0598.Range%20Addition%20II/README_EN.md) | `Array`,`Math` | Easy | | -| 0599 | [Minimum Index Sum of Two Lists](/solution/0500-0599/0599.Minimum%20Index%20Sum%20of%20Two%20Lists/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | | -| 0600 | [Non-negative Integers without Consecutive Ones](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README_EN.md) | `Dynamic Programming` | Hard | | -| 0601 | [Human Traffic of Stadium](/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README_EN.md) | `Database` | Hard | | -| 0602 | [Friend Requests II Who Has the Most Friends](/solution/0600-0699/0602.Friend%20Requests%20II%20Who%20Has%20the%20Most%20Friends/README_EN.md) | `Database` | Medium | | -| 0603 | [Consecutive Available Seats](/solution/0600-0699/0603.Consecutive%20Available%20Seats/README_EN.md) | `Database` | Easy | 🔒 | -| 0604 | [Design Compressed String Iterator](/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README_EN.md) | `Design`,`Array`,`String`,`Iterator` | Easy | 🔒 | -| 0605 | [Can Place Flowers](/solution/0600-0699/0605.Can%20Place%20Flowers/README_EN.md) | `Greedy`,`Array` | Easy | | -| 0606 | [Construct String from Binary Tree](/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Binary Tree` | Medium | | -| 0607 | [Sales Person](/solution/0600-0699/0607.Sales%20Person/README_EN.md) | `Database` | Easy | | -| 0608 | [Tree Node](/solution/0600-0699/0608.Tree%20Node/README_EN.md) | `Database` | Medium | | -| 0609 | [Find Duplicate File in System](/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | | -| 0610 | [Triangle Judgement](/solution/0600-0699/0610.Triangle%20Judgement/README_EN.md) | `Database` | Easy | | -| 0611 | [Valid Triangle Number](/solution/0600-0699/0611.Valid%20Triangle%20Number/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | | -| 0612 | [Shortest Distance in a Plane](/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README_EN.md) | `Database` | Medium | 🔒 | -| 0613 | [Shortest Distance in a Line](/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README_EN.md) | `Database` | Easy | 🔒 | -| 0614 | [Second Degree Follower](/solution/0600-0699/0614.Second%20Degree%20Follower/README_EN.md) | `Database` | Medium | 🔒 | -| 0615 | [Average Salary Departments VS Company](/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README_EN.md) | `Database` | Hard | 🔒 | -| 0616 | [Add Bold Tag in String](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`String Matching` | Medium | 🔒 | -| 0617 | [Merge Two Binary Trees](/solution/0600-0699/0617.Merge%20Two%20Binary%20Trees/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | -| 0618 | [Students Report By Geography](/solution/0600-0699/0618.Students%20Report%20By%20Geography/README_EN.md) | `Database` | Hard | 🔒 | -| 0619 | [Biggest Single Number](/solution/0600-0699/0619.Biggest%20Single%20Number/README_EN.md) | `Database` | Easy | | -| 0620 | [Not Boring Movies](/solution/0600-0699/0620.Not%20Boring%20Movies/README_EN.md) | `Database` | Easy | | -| 0621 | [Task Scheduler](/solution/0600-0699/0621.Task%20Scheduler/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | | -| 0622 | [Design Circular Queue](/solution/0600-0699/0622.Design%20Circular%20Queue/README_EN.md) | `Design`,`Queue`,`Array`,`Linked List` | Medium | | -| 0623 | [Add One Row to Tree](/solution/0600-0699/0623.Add%20One%20Row%20to%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | -| 0624 | [Maximum Distance in Arrays](/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 | -| 0625 | [Minimum Factorization](/solution/0600-0699/0625.Minimum%20Factorization/README_EN.md) | `Greedy`,`Math` | Medium | 🔒 | -| 0626 | [Exchange Seats](/solution/0600-0699/0626.Exchange%20Seats/README_EN.md) | `Database` | Medium | | -| 0627 | [Swap Salary](/solution/0600-0699/0627.Swap%20Salary/README_EN.md) | `Database` | Easy | | -| 0628 | [Maximum Product of Three Numbers](/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README_EN.md) | `Array`,`Math`,`Sorting` | Easy | | -| 0629 | [K Inverse Pairs Array](/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README_EN.md) | `Dynamic Programming` | Hard | | -| 0630 | [Course Schedule III](/solution/0600-0699/0630.Course%20Schedule%20III/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | | -| 0631 | [Design Excel Sum Formula](/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README_EN.md) | `Graph`,`Design`,`Topological Sort`,`Array`,`Matrix` | Hard | 🔒 | -| 0632 | [Smallest Range Covering Elements from K Lists](/solution/0600-0699/0632.Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting`,`Sliding Window`,`Heap (Priority Queue)` | Hard | | -| 0633 | [Sum of Square Numbers](/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README_EN.md) | `Math`,`Two Pointers`,`Binary Search` | Medium | | -| 0634 | [Find the Derangement of An Array](/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README_EN.md) | `Math`,`Dynamic Programming` | Medium | 🔒 | -| 0635 | [Design Log Storage System](/solution/0600-0699/0635.Design%20Log%20Storage%20System/README_EN.md) | `Design`,`Hash Table`,`String`,`Ordered Set` | Medium | 🔒 | -| 0636 | [Exclusive Time of Functions](/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README_EN.md) | `Stack`,`Array` | Medium | | -| 0637 | [Average of Levels in Binary Tree](/solution/0600-0699/0637.Average%20of%20Levels%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | -| 0638 | [Shopping Offers](/solution/0600-0699/0638.Shopping%20Offers/README_EN.md) | `Bit Manipulation`,`Memoization`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | | -| 0639 | [Decode Ways II](/solution/0600-0699/0639.Decode%20Ways%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | | -| 0640 | [Solve the Equation](/solution/0600-0699/0640.Solve%20the%20Equation/README_EN.md) | `Math`,`String`,`Simulation` | Medium | | -| 0641 | [Design Circular Deque](/solution/0600-0699/0641.Design%20Circular%20Deque/README_EN.md) | `Design`,`Queue`,`Array`,`Linked List` | Medium | | -| 0642 | [Design Search Autocomplete System](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README_EN.md) | `Design`,`Trie`,`String`,`Data Stream`,`Sorting`,`Heap (Priority Queue)` | Hard | 🔒 | -| 0643 | [Maximum Average Subarray I](/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README_EN.md) | `Array`,`Sliding Window` | Easy | | -| 0644 | [Maximum Average Subarray II](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum` | Hard | 🔒 | -| 0645 | [Set Mismatch](/solution/0600-0699/0645.Set%20Mismatch/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Sorting` | Easy | | -| 0646 | [Maximum Length of Pair Chain](/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Medium | | -| 0647 | [Palindromic Substrings](/solution/0600-0699/0647.Palindromic%20Substrings/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Medium | | -| 0648 | [Replace Words](/solution/0600-0699/0648.Replace%20Words/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | | -| 0649 | [Dota2 Senate](/solution/0600-0699/0649.Dota2%20Senate/README_EN.md) | `Greedy`,`Queue`,`String` | Medium | | -| 0650 | [2 Keys Keyboard](/solution/0600-0699/0650.2%20Keys%20Keyboard/README_EN.md) | `Math`,`Dynamic Programming` | Medium | | -| 0651 | [4 Keys Keyboard](/solution/0600-0699/0651.4%20Keys%20Keyboard/README_EN.md) | `Math`,`Dynamic Programming` | Medium | 🔒 | -| 0652 | [Find Duplicate Subtrees](/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree` | Medium | | -| 0653 | [Two Sum IV - Input is a BST](/solution/0600-0699/0653.Two%20Sum%20IV%20-%20Input%20is%20a%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Search Tree`,`Hash Table`,`Two Pointers`,`Binary Tree` | Easy | | -| 0654 | [Maximum Binary Tree](/solution/0600-0699/0654.Maximum%20Binary%20Tree/README_EN.md) | `Stack`,`Tree`,`Array`,`Divide and Conquer`,`Binary Tree`,`Monotonic Stack` | Medium | | -| 0655 | [Print Binary Tree](/solution/0600-0699/0655.Print%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | -| 0656 | [Coin Path](/solution/0600-0699/0656.Coin%20Path/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | -| 0657 | [Robot Return to Origin](/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README_EN.md) | `String`,`Simulation` | Easy | | -| 0658 | [Find K Closest Elements](/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting`,`Sliding Window`,`Heap (Priority Queue)` | Medium | | -| 0659 | [Split Array into Consecutive Subsequences](/solution/0600-0699/0659.Split%20Array%20into%20Consecutive%20Subsequences/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Heap (Priority Queue)` | Medium | | -| 0660 | [Remove 9](/solution/0600-0699/0660.Remove%209/README_EN.md) | `Math` | Hard | 🔒 | -| 0661 | [Image Smoother](/solution/0600-0699/0661.Image%20Smoother/README_EN.md) | `Array`,`Matrix` | Easy | | -| 0662 | [Maximum Width of Binary Tree](/solution/0600-0699/0662.Maximum%20Width%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | -| 0663 | [Equal Tree Partition](/solution/0600-0699/0663.Equal%20Tree%20Partition/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | -| 0664 | [Strange Printer](/solution/0600-0699/0664.Strange%20Printer/README_EN.md) | `String`,`Dynamic Programming` | Hard | | -| 0665 | [Non-decreasing Array](/solution/0600-0699/0665.Non-decreasing%20Array/README_EN.md) | `Array` | Medium | | -| 0666 | [Path Sum IV](/solution/0600-0699/0666.Path%20Sum%20IV/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`Binary Tree` | Medium | 🔒 | -| 0667 | [Beautiful Arrangement II](/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README_EN.md) | `Array`,`Math` | Medium | | -| 0668 | [Kth Smallest Number in Multiplication Table](/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README_EN.md) | `Math`,`Binary Search` | Hard | | -| 0669 | [Trim a Binary Search Tree](/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | -| 0670 | [Maximum Swap](/solution/0600-0699/0670.Maximum%20Swap/README_EN.md) | `Greedy`,`Math` | Medium | | -| 0671 | [Second Minimum Node In a Binary Tree](/solution/0600-0699/0671.Second%20Minimum%20Node%20In%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | | -| 0672 | [Bulb Switcher II](/solution/0600-0699/0672.Bulb%20Switcher%20II/README_EN.md) | `Bit Manipulation`,`Depth-First Search`,`Breadth-First Search`,`Math` | Medium | | -| 0673 | [Number of Longest Increasing Subsequence](/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Dynamic Programming` | Medium | | -| 0674 | [Longest Continuous Increasing Subsequence](/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README_EN.md) | `Array` | Easy | | -| 0675 | [Cut Off Trees for Golf Event](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix`,`Heap (Priority Queue)` | Hard | | -| 0676 | [Implement Magic Dictionary](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README_EN.md) | `Depth-First Search`,`Design`,`Trie`,`Hash Table`,`String` | Medium | | -| 0677 | [Map Sum Pairs](/solution/0600-0699/0677.Map%20Sum%20Pairs/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | | -| 0678 | [Valid Parenthesis String](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README_EN.md) | `Stack`,`Greedy`,`String`,`Dynamic Programming` | Medium | | -| 0679 | [24 Game](/solution/0600-0699/0679.24%20Game/README_EN.md) | `Array`,`Math`,`Backtracking` | Hard | | -| 0680 | [Valid Palindrome II](/solution/0600-0699/0680.Valid%20Palindrome%20II/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Easy | | -| 0681 | [Next Closest Time](/solution/0600-0699/0681.Next%20Closest%20Time/README_EN.md) | `Hash Table`,`String`,`Backtracking`,`Enumeration` | Medium | 🔒 | -| 0682 | [Baseball Game](/solution/0600-0699/0682.Baseball%20Game/README_EN.md) | `Stack`,`Array`,`Simulation` | Easy | | -| 0683 | [K Empty Slots](/solution/0600-0699/0683.K%20Empty%20Slots/README_EN.md) | `Binary Indexed Tree`,`Array`,`Ordered Set`,`Sliding Window` | Hard | 🔒 | -| 0684 | [Redundant Connection](/solution/0600-0699/0684.Redundant%20Connection/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | | -| 0685 | [Redundant Connection II](/solution/0600-0699/0685.Redundant%20Connection%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Hard | | -| 0686 | [Repeated String Match](/solution/0600-0699/0686.Repeated%20String%20Match/README_EN.md) | `String`,`String Matching` | Medium | | -| 0687 | [Longest Univalue Path](/solution/0600-0699/0687.Longest%20Univalue%20Path/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | | -| 0688 | [Knight Probability in Chessboard](/solution/0600-0699/0688.Knight%20Probability%20in%20Chessboard/README_EN.md) | `Dynamic Programming` | Medium | | -| 0689 | [Maximum Sum of 3 Non-Overlapping Subarrays](/solution/0600-0699/0689.Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | -| 0690 | [Employee Importance](/solution/0600-0699/0690.Employee%20Importance/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table` | Medium | | -| 0691 | [Stickers to Spell Word](/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README_EN.md) | `Bit Manipulation`,`Array`,`String`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | | -| 0692 | [Top K Frequent Words](/solution/0600-0699/0692.Top%20K%20Frequent%20Words/README_EN.md) | `Trie`,`Hash Table`,`String`,`Bucket Sort`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | | -| 0693 | [Binary Number with Alternating Bits](/solution/0600-0699/0693.Binary%20Number%20with%20Alternating%20Bits/README_EN.md) | `Bit Manipulation` | Easy | | -| 0694 | [Number of Distinct Islands](/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Hash Table`,`Hash Function` | Medium | 🔒 | -| 0695 | [Max Area of Island](/solution/0600-0699/0695.Max%20Area%20of%20Island/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | | -| 0696 | [Count Binary Substrings](/solution/0600-0699/0696.Count%20Binary%20Substrings/README_EN.md) | `Two Pointers`,`String` | Easy | | -| 0697 | [Degree of an Array](/solution/0600-0699/0697.Degree%20of%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | | -| 0698 | [Partition to K Equal Sum Subsets](/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README_EN.md) | `Bit Manipulation`,`Memoization`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | | -| 0699 | [Falling Squares](/solution/0600-0699/0699.Falling%20Squares/README_EN.md) | `Segment Tree`,`Array`,`Ordered Set` | Hard | | -| 0700 | [Search in a Binary Search Tree](/solution/0700-0799/0700.Search%20in%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Binary Search Tree`,`Binary Tree` | Easy | | -| 0701 | [Insert into a Binary Search Tree](/solution/0700-0799/0701.Insert%20into%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Binary Search Tree`,`Binary Tree` | Medium | | -| 0702 | [Search in a Sorted Array of Unknown Size](/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README_EN.md) | `Array`,`Binary Search`,`Interactive` | Medium | 🔒 | -| 0703 | [Kth Largest Element in a Stream](/solution/0700-0799/0703.Kth%20Largest%20Element%20in%20a%20Stream/README_EN.md) | `Tree`,`Design`,`Binary Search Tree`,`Binary Tree`,`Data Stream`,`Heap (Priority Queue)` | Easy | | -| 0704 | [Binary Search](/solution/0700-0799/0704.Binary%20Search/README_EN.md) | `Array`,`Binary Search` | Easy | | -| 0705 | [Design HashSet](/solution/0700-0799/0705.Design%20HashSet/README_EN.md) | `Design`,`Array`,`Hash Table`,`Linked List`,`Hash Function` | Easy | | -| 0706 | [Design HashMap](/solution/0700-0799/0706.Design%20HashMap/README_EN.md) | `Design`,`Array`,`Hash Table`,`Linked List`,`Hash Function` | Easy | | -| 0707 | [Design Linked List](/solution/0700-0799/0707.Design%20Linked%20List/README_EN.md) | `Design`,`Linked List` | Medium | | -| 0708 | [Insert into a Sorted Circular Linked List](/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README_EN.md) | `Linked List` | Medium | 🔒 | -| 0709 | [To Lower Case](/solution/0700-0799/0709.To%20Lower%20Case/README_EN.md) | `String` | Easy | | -| 0710 | [Random Pick with Blacklist](/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README_EN.md) | `Array`,`Hash Table`,`Math`,`Binary Search`,`Sorting`,`Randomized` | Hard | | -| 0711 | [Number of Distinct Islands II](/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Hash Table`,`Hash Function` | Hard | 🔒 | -| 0712 | [Minimum ASCII Delete Sum for Two Strings](/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README_EN.md) | `String`,`Dynamic Programming` | Medium | | -| 0713 | [Subarray Product Less Than K](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README_EN.md) | `Array`,`Sliding Window` | Medium | | -| 0714 | [Best Time to Buy and Sell Stock with Transaction Fee](/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | | -| 0715 | [Range Module](/solution/0700-0799/0715.Range%20Module/README_EN.md) | `Design`,`Segment Tree`,`Ordered Set` | Hard | | -| 0716 | [Max Stack](/solution/0700-0799/0716.Max%20Stack/README_EN.md) | `Stack`,`Design`,`Linked List`,`Doubly-Linked List`,`Ordered Set` | Hard | 🔒 | -| 0717 | [1-bit and 2-bit Characters](/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README_EN.md) | `Array` | Easy | | -| 0718 | [Maximum Length of Repeated Subarray](/solution/0700-0799/0718.Maximum%20Length%20of%20Repeated%20Subarray/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Medium | | -| 0719 | [Find K-th Smallest Pair Distance](/solution/0700-0799/0719.Find%20K-th%20Smallest%20Pair%20Distance/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Hard | | -| 0720 | [Longest Word in Dictionary](/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | | -| 0721 | [Accounts Merge](/solution/0700-0799/0721.Accounts%20Merge/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | | -| 0722 | [Remove Comments](/solution/0700-0799/0722.Remove%20Comments/README_EN.md) | `Array`,`String` | Medium | | -| 0723 | [Candy Crush](/solution/0700-0799/0723.Candy%20Crush/README_EN.md) | `Array`,`Two Pointers`,`Matrix`,`Simulation` | Medium | 🔒 | -| 0724 | [Find Pivot Index](/solution/0700-0799/0724.Find%20Pivot%20Index/README_EN.md) | `Array`,`Prefix Sum` | Easy | | -| 0725 | [Split Linked List in Parts](/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README_EN.md) | `Linked List` | Medium | | -| 0726 | [Number of Atoms](/solution/0700-0799/0726.Number%20of%20Atoms/README_EN.md) | `Stack`,`Hash Table`,`String`,`Sorting` | Hard | | -| 0727 | [Minimum Window Subsequence](/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README_EN.md) | `String`,`Dynamic Programming`,`Sliding Window` | Hard | 🔒 | -| 0728 | [Self Dividing Numbers](/solution/0700-0799/0728.Self%20Dividing%20Numbers/README_EN.md) | `Math` | Easy | | -| 0729 | [My Calendar I](/solution/0700-0799/0729.My%20Calendar%20I/README_EN.md) | `Design`,`Segment Tree`,`Array`,`Binary Search`,`Ordered Set` | Medium | | -| 0730 | [Count Different Palindromic Subsequences](/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | | -| 0731 | [My Calendar II](/solution/0700-0799/0731.My%20Calendar%20II/README_EN.md) | `Design`,`Segment Tree`,`Array`,`Binary Search`,`Ordered Set`,`Prefix Sum` | Medium | | -| 0732 | [My Calendar III](/solution/0700-0799/0732.My%20Calendar%20III/README_EN.md) | `Design`,`Segment Tree`,`Binary Search`,`Ordered Set`,`Prefix Sum` | Hard | | -| 0733 | [Flood Fill](/solution/0700-0799/0733.Flood%20Fill/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Easy | | -| 0734 | [Sentence Similarity](/solution/0700-0799/0734.Sentence%20Similarity/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | 🔒 | -| 0735 | [Asteroid Collision](/solution/0700-0799/0735.Asteroid%20Collision/README_EN.md) | `Stack`,`Array`,`Simulation` | Medium | | -| 0736 | [Parse Lisp Expression](/solution/0700-0799/0736.Parse%20Lisp%20Expression/README_EN.md) | `Stack`,`Recursion`,`Hash Table`,`String` | Hard | | -| 0737 | [Sentence Similarity II](/solution/0700-0799/0737.Sentence%20Similarity%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String` | Medium | 🔒 | -| 0738 | [Monotone Increasing Digits](/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README_EN.md) | `Greedy`,`Math` | Medium | | -| 0739 | [Daily Temperatures](/solution/0700-0799/0739.Daily%20Temperatures/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | | -| 0740 | [Delete and Earn](/solution/0700-0799/0740.Delete%20and%20Earn/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Medium | | -| 0741 | [Cherry Pickup](/solution/0700-0799/0741.Cherry%20Pickup/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | | -| 0742 | [Closest Leaf in a Binary Tree](/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | -| 0743 | [Network Delay Time](/solution/0700-0799/0743.Network%20Delay%20Time/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Shortest Path`,`Heap (Priority Queue)` | Medium | | -| 0744 | [Find Smallest Letter Greater Than Target](/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README_EN.md) | `Array`,`Binary Search` | Easy | | -| 0745 | [Prefix and Suffix Search](/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README_EN.md) | `Design`,`Trie`,`Array`,`Hash Table`,`String` | Hard | | -| 0746 | [Min Cost Climbing Stairs](/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README_EN.md) | `Array`,`Dynamic Programming` | Easy | | -| 0747 | [Largest Number At Least Twice of Others](/solution/0700-0799/0747.Largest%20Number%20At%20Least%20Twice%20of%20Others/README_EN.md) | `Array`,`Sorting` | Easy | | -| 0748 | [Shortest Completing Word](/solution/0700-0799/0748.Shortest%20Completing%20Word/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | | -| 0749 | [Contain Virus](/solution/0700-0799/0749.Contain%20Virus/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`,`Simulation` | Hard | | -| 0750 | [Number Of Corner Rectangles](/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Matrix` | Medium | 🔒 | -| 0751 | [IP to CIDR](/solution/0700-0799/0751.IP%20to%20CIDR/README_EN.md) | `Bit Manipulation`,`String` | Medium | 🔒 | -| 0752 | [Open the Lock](/solution/0700-0799/0752.Open%20the%20Lock/README_EN.md) | `Breadth-First Search`,`Array`,`Hash Table`,`String` | Medium | | -| 0753 | [Cracking the Safe](/solution/0700-0799/0753.Cracking%20the%20Safe/README_EN.md) | `Depth-First Search`,`Graph`,`Eulerian Circuit` | Hard | | -| 0754 | [Reach a Number](/solution/0700-0799/0754.Reach%20a%20Number/README_EN.md) | `Math`,`Binary Search` | Medium | | -| 0755 | [Pour Water](/solution/0700-0799/0755.Pour%20Water/README_EN.md) | `Array`,`Simulation` | Medium | 🔒 | -| 0756 | [Pyramid Transition Matrix](/solution/0700-0799/0756.Pyramid%20Transition%20Matrix/README_EN.md) | `Bit Manipulation`,`Depth-First Search`,`Breadth-First Search` | Medium | | -| 0757 | [Set Intersection Size At Least Two](/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | | -| 0758 | [Bold Words in String](/solution/0700-0799/0758.Bold%20Words%20in%20String/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`String Matching` | Medium | 🔒 | -| 0759 | [Employee Free Time](/solution/0700-0799/0759.Employee%20Free%20Time/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Hard | 🔒 | -| 0760 | [Find Anagram Mappings](/solution/0700-0799/0760.Find%20Anagram%20Mappings/README_EN.md) | `Array`,`Hash Table` | Easy | 🔒 | -| 0761 | [Special Binary String](/solution/0700-0799/0761.Special%20Binary%20String/README_EN.md) | `Recursion`,`String` | Hard | | -| 0762 | [Prime Number of Set Bits in Binary Representation](/solution/0700-0799/0762.Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation/README_EN.md) | `Bit Manipulation`,`Math` | Easy | | -| 0763 | [Partition Labels](/solution/0700-0799/0763.Partition%20Labels/README_EN.md) | `Greedy`,`Hash Table`,`Two Pointers`,`String` | Medium | | -| 0764 | [Largest Plus Sign](/solution/0700-0799/0764.Largest%20Plus%20Sign/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | -| 0765 | [Couples Holding Hands](/solution/0700-0799/0765.Couples%20Holding%20Hands/README_EN.md) | `Greedy`,`Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Hard | | -| 0766 | [Toeplitz Matrix](/solution/0700-0799/0766.Toeplitz%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | | -| 0767 | [Reorganize String](/solution/0700-0799/0767.Reorganize%20String/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | | -| 0768 | [Max Chunks To Make Sorted II](/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README_EN.md) | `Stack`,`Greedy`,`Array`,`Sorting`,`Monotonic Stack` | Hard | | -| 0769 | [Max Chunks To Make Sorted](/solution/0700-0799/0769.Max%20Chunks%20To%20Make%20Sorted/README_EN.md) | `Stack`,`Greedy`,`Array`,`Sorting`,`Monotonic Stack` | Medium | | -| 0770 | [Basic Calculator IV](/solution/0700-0799/0770.Basic%20Calculator%20IV/README_EN.md) | `Stack`,`Recursion`,`Hash Table`,`Math`,`String` | Hard | | -| 0771 | [Jewels and Stones](/solution/0700-0799/0771.Jewels%20and%20Stones/README_EN.md) | `Hash Table`,`String` | Easy | | -| 0772 | [Basic Calculator III](/solution/0700-0799/0772.Basic%20Calculator%20III/README_EN.md) | `Stack`,`Recursion`,`Math`,`String` | Hard | 🔒 | -| 0773 | [Sliding Puzzle](/solution/0700-0799/0773.Sliding%20Puzzle/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | | -| 0774 | [Minimize Max Distance to Gas Station](/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README_EN.md) | `Array`,`Binary Search` | Hard | 🔒 | -| 0775 | [Global and Local Inversions](/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README_EN.md) | `Array`,`Math` | Medium | | -| 0776 | [Split BST](/solution/0700-0799/0776.Split%20BST/README_EN.md) | `Tree`,`Binary Search Tree`,`Recursion`,`Binary Tree` | Medium | 🔒 | -| 0777 | [Swap Adjacent in LR String](/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README_EN.md) | `Two Pointers`,`String` | Medium | | -| 0778 | [Swim in Rising Water](/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)` | Hard | | -| 0779 | [K-th Symbol in Grammar](/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README_EN.md) | `Bit Manipulation`,`Recursion`,`Math` | Medium | | -| 0780 | [Reaching Points](/solution/0700-0799/0780.Reaching%20Points/README_EN.md) | `Math` | Hard | | -| 0781 | [Rabbits in Forest](/solution/0700-0799/0781.Rabbits%20in%20Forest/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Math` | Medium | | -| 0782 | [Transform to Chessboard](/solution/0700-0799/0782.Transform%20to%20Chessboard/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Matrix` | Hard | | -| 0783 | [Minimum Distance Between BST Nodes](/solution/0700-0799/0783.Minimum%20Distance%20Between%20BST%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Search Tree`,`Binary Tree` | Easy | | -| 0784 | [Letter Case Permutation](/solution/0700-0799/0784.Letter%20Case%20Permutation/README_EN.md) | `Bit Manipulation`,`String`,`Backtracking` | Medium | | -| 0785 | [Is Graph Bipartite](/solution/0700-0799/0785.Is%20Graph%20Bipartite/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | | -| 0786 | [K-th Smallest Prime Fraction](/solution/0700-0799/0786.K-th%20Smallest%20Prime%20Fraction/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting`,`Heap (Priority Queue)` | Medium | | -| 0787 | [Cheapest Flights Within K Stops](/solution/0700-0799/0787.Cheapest%20Flights%20Within%20K%20Stops/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Dynamic Programming`,`Shortest Path`,`Heap (Priority Queue)` | Medium | | -| 0788 | [Rotated Digits](/solution/0700-0799/0788.Rotated%20Digits/README_EN.md) | `Math`,`Dynamic Programming` | Medium | | -| 0789 | [Escape The Ghosts](/solution/0700-0799/0789.Escape%20The%20Ghosts/README_EN.md) | `Array`,`Math` | Medium | | -| 0790 | [Domino and Tromino Tiling](/solution/0700-0799/0790.Domino%20and%20Tromino%20Tiling/README_EN.md) | `Dynamic Programming` | Medium | | -| 0791 | [Custom Sort String](/solution/0700-0799/0791.Custom%20Sort%20String/README_EN.md) | `Hash Table`,`String`,`Sorting` | Medium | | -| 0792 | [Number of Matching Subsequences](/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | | -| 0793 | [Preimage Size of Factorial Zeroes Function](/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README_EN.md) | `Math`,`Binary Search` | Hard | | -| 0794 | [Valid Tic-Tac-Toe State](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README_EN.md) | `Array`,`Matrix` | Medium | | -| 0795 | [Number of Subarrays with Bounded Maximum](/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README_EN.md) | `Array`,`Two Pointers` | Medium | | -| 0796 | [Rotate String](/solution/0700-0799/0796.Rotate%20String/README_EN.md) | `String`,`String Matching` | Easy | | -| 0797 | [All Paths From Source to Target](/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Backtracking` | Medium | | -| 0798 | [Smallest Rotation with Highest Score](/solution/0700-0799/0798.Smallest%20Rotation%20with%20Highest%20Score/README_EN.md) | `Array`,`Prefix Sum` | Hard | | -| 0799 | [Champagne Tower](/solution/0700-0799/0799.Champagne%20Tower/README_EN.md) | `Dynamic Programming` | Medium | | -| 0800 | [Similar RGB Color](/solution/0800-0899/0800.Similar%20RGB%20Color/README_EN.md) | `Math`,`String`,`Enumeration` | Easy | 🔒 | -| 0801 | [Minimum Swaps To Make Sequences Increasing](/solution/0800-0899/0801.Minimum%20Swaps%20To%20Make%20Sequences%20Increasing/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | -| 0802 | [Find Eventual Safe States](/solution/0800-0899/0802.Find%20Eventual%20Safe%20States/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | | -| 0803 | [Bricks Falling When Hit](/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README_EN.md) | `Union Find`,`Array`,`Matrix` | Hard | | -| 0804 | [Unique Morse Code Words](/solution/0800-0899/0804.Unique%20Morse%20Code%20Words/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | | -| 0805 | [Split Array With Same Average](/solution/0800-0899/0805.Split%20Array%20With%20Same%20Average/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Bitmask` | Hard | | -| 0806 | [Number of Lines To Write String](/solution/0800-0899/0806.Number%20of%20Lines%20To%20Write%20String/README_EN.md) | `Array`,`String` | Easy | | -| 0807 | [Max Increase to Keep City Skyline](/solution/0800-0899/0807.Max%20Increase%20to%20Keep%20City%20Skyline/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | | -| 0808 | [Soup Servings](/solution/0800-0899/0808.Soup%20Servings/README_EN.md) | `Math`,`Dynamic Programming`,`Probability and Statistics` | Medium | | -| 0809 | [Expressive Words](/solution/0800-0899/0809.Expressive%20Words/README_EN.md) | `Array`,`Two Pointers`,`String` | Medium | | -| 0810 | [Chalkboard XOR Game](/solution/0800-0899/0810.Chalkboard%20XOR%20Game/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array`,`Math`,`Game Theory` | Hard | | -| 0811 | [Subdomain Visit Count](/solution/0800-0899/0811.Subdomain%20Visit%20Count/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Medium | | -| 0812 | [Largest Triangle Area](/solution/0800-0899/0812.Largest%20Triangle%20Area/README_EN.md) | `Geometry`,`Array`,`Math` | Easy | | -| 0813 | [Largest Sum of Averages](/solution/0800-0899/0813.Largest%20Sum%20of%20Averages/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Medium | | -| 0814 | [Binary Tree Pruning](/solution/0800-0899/0814.Binary%20Tree%20Pruning/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | | -| 0815 | [Bus Routes](/solution/0800-0899/0815.Bus%20Routes/README_EN.md) | `Breadth-First Search`,`Array`,`Hash Table` | Hard | | -| 0816 | [Ambiguous Coordinates](/solution/0800-0899/0816.Ambiguous%20Coordinates/README_EN.md) | `String`,`Backtracking`,`Enumeration` | Medium | | -| 0817 | [Linked List Components](/solution/0800-0899/0817.Linked%20List%20Components/README_EN.md) | `Array`,`Hash Table`,`Linked List` | Medium | | -| 0818 | [Race Car](/solution/0800-0899/0818.Race%20Car/README_EN.md) | `Dynamic Programming` | Hard | | -| 0819 | [Most Common Word](/solution/0800-0899/0819.Most%20Common%20Word/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Easy | | -| 0820 | [Short Encoding of Words](/solution/0800-0899/0820.Short%20Encoding%20of%20Words/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | | -| 0821 | [Shortest Distance to a Character](/solution/0800-0899/0821.Shortest%20Distance%20to%20a%20Character/README_EN.md) | `Array`,`Two Pointers`,`String` | Easy | | -| 0822 | [Card Flipping Game](/solution/0800-0899/0822.Card%20Flipping%20Game/README_EN.md) | `Array`,`Hash Table` | Medium | | -| 0823 | [Binary Trees With Factors](/solution/0800-0899/0823.Binary%20Trees%20With%20Factors/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming`,`Sorting` | Medium | | -| 0824 | [Goat Latin](/solution/0800-0899/0824.Goat%20Latin/README_EN.md) | `String` | Easy | | -| 0825 | [Friends Of Appropriate Ages](/solution/0800-0899/0825.Friends%20Of%20Appropriate%20Ages/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | | -| 0826 | [Most Profit Assigning Work](/solution/0800-0899/0826.Most%20Profit%20Assigning%20Work/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | | -| 0827 | [Making A Large Island](/solution/0800-0899/0827.Making%20A%20Large%20Island/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Hard | | -| 0828 | [Count Unique Characters of All Substrings of a Given String](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming` | Hard | Weekly Contest 83 | -| 0829 | [Consecutive Numbers Sum](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README_EN.md) | `Math`,`Enumeration` | Hard | Weekly Contest 83 | -| 0830 | [Positions of Large Groups](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README_EN.md) | `String` | Easy | Weekly Contest 83 | -| 0831 | [Masking Personal Information](/solution/0800-0899/0831.Masking%20Personal%20Information/README_EN.md) | `String` | Medium | Weekly Contest 83 | -| 0832 | [Flipping an Image](/solution/0800-0899/0832.Flipping%20an%20Image/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Matrix`,`Simulation` | Easy | Weekly Contest 84 | -| 0833 | [Find And Replace in String](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README_EN.md) | `Array`,`String`,`Sorting` | Medium | Weekly Contest 84 | -| 0834 | [Sum of Distances in Tree](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Dynamic Programming` | Hard | Weekly Contest 84 | -| 0835 | [Image Overlap](/solution/0800-0899/0835.Image%20Overlap/README_EN.md) | `Array`,`Matrix` | Medium | Weekly Contest 84 | -| 0836 | [Rectangle Overlap](/solution/0800-0899/0836.Rectangle%20Overlap/README_EN.md) | `Geometry`,`Math` | Easy | Weekly Contest 85 | -| 0837 | [New 21 Game](/solution/0800-0899/0837.New%2021%20Game/README_EN.md) | `Math`,`Dynamic Programming`,`Sliding Window`,`Probability and Statistics` | Medium | Weekly Contest 85 | -| 0838 | [Push Dominoes](/solution/0800-0899/0838.Push%20Dominoes/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Medium | Weekly Contest 85 | -| 0839 | [Similar String Groups](/solution/0800-0899/0839.Similar%20String%20Groups/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String` | Hard | Weekly Contest 85 | -| 0840 | [Magic Squares In Grid](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README_EN.md) | `Array`,`Hash Table`,`Math`,`Matrix` | Medium | Weekly Contest 86 | -| 0841 | [Keys and Rooms](/solution/0800-0899/0841.Keys%20and%20Rooms/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 86 | -| 0842 | [Split Array into Fibonacci Sequence](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README_EN.md) | `String`,`Backtracking` | Medium | Weekly Contest 86 | -| 0843 | [Guess the Word](/solution/0800-0899/0843.Guess%20the%20Word/README_EN.md) | `Array`,`Math`,`String`,`Game Theory`,`Interactive` | Hard | Weekly Contest 86 | -| 0844 | [Backspace String Compare](/solution/0800-0899/0844.Backspace%20String%20Compare/README_EN.md) | `Stack`,`Two Pointers`,`String`,`Simulation` | Easy | Weekly Contest 87 | -| 0845 | [Longest Mountain in Array](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README_EN.md) | `Array`,`Two Pointers`,`Dynamic Programming`,`Enumeration` | Medium | Weekly Contest 87 | -| 0846 | [Hand of Straights](/solution/0800-0899/0846.Hand%20of%20Straights/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 87 | -| 0847 | [Shortest Path Visiting All Nodes](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Graph`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 87 | -| 0848 | [Shifting Letters](/solution/0800-0899/0848.Shifting%20Letters/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Weekly Contest 88 | -| 0849 | [Maximize Distance to Closest Person](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README_EN.md) | `Array` | Medium | Weekly Contest 88 | -| 0850 | [Rectangle Area II](/solution/0800-0899/0850.Rectangle%20Area%20II/README_EN.md) | `Segment Tree`,`Array`,`Ordered Set`,`Line Sweep` | Hard | Weekly Contest 88 | -| 0851 | [Loud and Rich](/solution/0800-0899/0851.Loud%20and%20Rich/README_EN.md) | `Depth-First Search`,`Graph`,`Topological Sort`,`Array` | Medium | Weekly Contest 88 | -| 0852 | [Peak Index in a Mountain Array](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 89 | -| 0853 | [Car Fleet](/solution/0800-0899/0853.Car%20Fleet/README_EN.md) | `Stack`,`Array`,`Sorting`,`Monotonic Stack` | Medium | Weekly Contest 89 | -| 0854 | [K-Similar Strings](/solution/0800-0899/0854.K-Similar%20Strings/README_EN.md) | `Breadth-First Search`,`String` | Hard | Weekly Contest 89 | -| 0855 | [Exam Room](/solution/0800-0899/0855.Exam%20Room/README_EN.md) | `Design`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 89 | -| 0856 | [Score of Parentheses](/solution/0800-0899/0856.Score%20of%20Parentheses/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 90 | -| 0857 | [Minimum Cost to Hire K Workers](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 90 | -| 0858 | [Mirror Reflection](/solution/0800-0899/0858.Mirror%20Reflection/README_EN.md) | `Geometry`,`Math`,`Number Theory` | Medium | Weekly Contest 90 | -| 0859 | [Buddy Strings](/solution/0800-0899/0859.Buddy%20Strings/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 90 | -| 0860 | [Lemonade Change](/solution/0800-0899/0860.Lemonade%20Change/README_EN.md) | `Greedy`,`Array` | Easy | Weekly Contest 91 | -| 0861 | [Score After Flipping Matrix](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Matrix` | Medium | Weekly Contest 91 | -| 0862 | [Shortest Subarray with Sum at Least K](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README_EN.md) | `Queue`,`Array`,`Binary Search`,`Prefix Sum`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | Weekly Contest 91 | -| 0863 | [All Nodes Distance K in Binary Tree](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 91 | -| 0864 | [Shortest Path to Get All Keys](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array`,`Matrix` | Hard | Weekly Contest 92 | -| 0865 | [Smallest Subtree with all the Deepest Nodes](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 92 | -| 0866 | [Prime Palindrome](/solution/0800-0899/0866.Prime%20Palindrome/README_EN.md) | `Math`,`Number Theory` | Medium | Weekly Contest 92 | -| 0867 | [Transpose Matrix](/solution/0800-0899/0867.Transpose%20Matrix/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Weekly Contest 92 | -| 0868 | [Binary Gap](/solution/0800-0899/0868.Binary%20Gap/README_EN.md) | `Bit Manipulation` | Easy | Weekly Contest 93 | -| 0869 | [Reordered Power of 2](/solution/0800-0899/0869.Reordered%20Power%20of%202/README_EN.md) | `Hash Table`,`Math`,`Counting`,`Enumeration`,`Sorting` | Medium | Weekly Contest 93 | -| 0870 | [Advantage Shuffle](/solution/0800-0899/0870.Advantage%20Shuffle/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 93 | -| 0871 | [Minimum Number of Refueling Stops](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Heap (Priority Queue)` | Hard | Weekly Contest 93 | -| 0872 | [Leaf-Similar Trees](/solution/0800-0899/0872.Leaf-Similar%20Trees/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | Weekly Contest 94 | -| 0873 | [Length of Longest Fibonacci Subsequence](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Medium | Weekly Contest 94 | -| 0874 | [Walking Robot Simulation](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 94 | -| 0875 | [Koko Eating Bananas](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 94 | -| 0876 | [Middle of the Linked List](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Easy | Weekly Contest 95 | -| 0877 | [Stone Game](/solution/0800-0899/0877.Stone%20Game/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | Weekly Contest 95 | -| 0878 | [Nth Magical Number](/solution/0800-0899/0878.Nth%20Magical%20Number/README_EN.md) | `Math`,`Binary Search` | Hard | Weekly Contest 95 | -| 0879 | [Profitable Schemes](/solution/0800-0899/0879.Profitable%20Schemes/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 95 | -| 0880 | [Decoded String at Index](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 96 | -| 0881 | [Boats to Save People](/solution/0800-0899/0881.Boats%20to%20Save%20People/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 96 | -| 0882 | [Reachable Nodes In Subdivided Graph](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 96 | -| 0883 | [Projection Area of 3D Shapes](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README_EN.md) | `Geometry`,`Array`,`Math`,`Matrix` | Easy | Weekly Contest 96 | -| 0884 | [Uncommon Words from Two Sentences](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 97 | -| 0885 | [Spiral Matrix III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 97 | -| 0886 | [Possible Bipartition](/solution/0800-0899/0886.Possible%20Bipartition/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Weekly Contest 97 | -| 0887 | [Super Egg Drop](/solution/0800-0899/0887.Super%20Egg%20Drop/README_EN.md) | `Math`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 97 | -| 0888 | [Fair Candy Swap](/solution/0800-0899/0888.Fair%20Candy%20Swap/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sorting` | Easy | Weekly Contest 98 | -| 0889 | [Construct Binary Tree from Preorder and Postorder Traversal](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README_EN.md) | `Tree`,`Array`,`Hash Table`,`Divide and Conquer`,`Binary Tree` | Medium | Weekly Contest 98 | -| 0890 | [Find and Replace Pattern](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 98 | -| 0891 | [Sum of Subsequence Widths](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README_EN.md) | `Array`,`Math`,`Sorting` | Hard | Weekly Contest 98 | -| 0892 | [Surface Area of 3D Shapes](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README_EN.md) | `Geometry`,`Array`,`Math`,`Matrix` | Easy | Weekly Contest 99 | -| 0893 | [Groups of Special-Equivalent Strings](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 99 | -| 0894 | [All Possible Full Binary Trees](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README_EN.md) | `Tree`,`Recursion`,`Memoization`,`Dynamic Programming`,`Binary Tree` | Medium | Weekly Contest 99 | -| 0895 | [Maximum Frequency Stack](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README_EN.md) | `Stack`,`Design`,`Hash Table`,`Ordered Set` | Hard | Weekly Contest 99 | -| 0896 | [Monotonic Array](/solution/0800-0899/0896.Monotonic%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 100 | -| 0897 | [Increasing Order Search Tree](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Easy | Weekly Contest 100 | -| 0898 | [Bitwise ORs of Subarrays](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 100 | -| 0899 | [Orderly Queue](/solution/0800-0899/0899.Orderly%20Queue/README_EN.md) | `Math`,`String`,`Sorting` | Hard | Weekly Contest 100 | -| 0900 | [RLE Iterator](/solution/0900-0999/0900.RLE%20Iterator/README_EN.md) | `Design`,`Array`,`Counting`,`Iterator` | Medium | Weekly Contest 101 | -| 0901 | [Online Stock Span](/solution/0900-0999/0901.Online%20Stock%20Span/README_EN.md) | `Stack`,`Design`,`Data Stream`,`Monotonic Stack` | Medium | Weekly Contest 101 | -| 0902 | [Numbers At Most N Given Digit Set](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README_EN.md) | `Array`,`Math`,`String`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 101 | -| 0903 | [Valid Permutations for DI Sequence](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 101 | -| 0904 | [Fruit Into Baskets](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 102 | -| 0905 | [Sort Array By Parity](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 102 | -| 0906 | [Super Palindromes](/solution/0900-0999/0906.Super%20Palindromes/README_EN.md) | `Math`,`Enumeration` | Hard | Weekly Contest 102 | -| 0907 | [Sum of Subarray Minimums](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Medium | Weekly Contest 102 | -| 0908 | [Smallest Range I](/solution/0900-0999/0908.Smallest%20Range%20I/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 103 | -| 0909 | [Snakes and Ladders](/solution/0900-0999/0909.Snakes%20and%20Ladders/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 103 | -| 0910 | [Smallest Range II](/solution/0900-0999/0910.Smallest%20Range%20II/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Medium | Weekly Contest 103 | -| 0911 | [Online Election](/solution/0900-0999/0911.Online%20Election/README_EN.md) | `Design`,`Array`,`Hash Table`,`Binary Search` | Medium | Weekly Contest 103 | -| 0912 | [Sort an Array](/solution/0900-0999/0912.Sort%20an%20Array/README_EN.md) | `Array`,`Divide and Conquer`,`Bucket Sort`,`Counting Sort`,`Radix Sort`,`Sorting`,`Heap (Priority Queue)`,`Merge Sort` | Medium | | -| 0913 | [Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README_EN.md) | `Graph`,`Topological Sort`,`Memoization`,`Math`,`Dynamic Programming`,`Game Theory` | Hard | Weekly Contest 104 | -| 0914 | [X of a Kind in a Deck of Cards](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory` | Easy | Weekly Contest 104 | -| 0915 | [Partition Array into Disjoint Intervals](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README_EN.md) | `Array` | Medium | Weekly Contest 104 | -| 0916 | [Word Subsets](/solution/0900-0999/0916.Word%20Subsets/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 104 | -| 0917 | [Reverse Only Letters](/solution/0900-0999/0917.Reverse%20Only%20Letters/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 105 | -| 0918 | [Maximum Sum Circular Subarray](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README_EN.md) | `Queue`,`Array`,`Divide and Conquer`,`Dynamic Programming`,`Monotonic Queue` | Medium | Weekly Contest 105 | -| 0919 | [Complete Binary Tree Inserter](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README_EN.md) | `Tree`,`Breadth-First Search`,`Design`,`Binary Tree` | Medium | Weekly Contest 105 | -| 0920 | [Number of Music Playlists](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 105 | -| 0921 | [Minimum Add to Make Parentheses Valid](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README_EN.md) | `Stack`,`Greedy`,`String` | Medium | Weekly Contest 106 | -| 0922 | [Sort Array By Parity II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 106 | -| 0923 | [3Sum With Multiplicity](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Counting`,`Sorting` | Medium | Weekly Contest 106 | -| 0924 | [Minimize Malware Spread](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table` | Hard | Weekly Contest 106 | -| 0925 | [Long Pressed Name](/solution/0900-0999/0925.Long%20Pressed%20Name/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 107 | -| 0926 | [Flip String to Monotone Increasing](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README_EN.md) | `String`,`Dynamic Programming` | Medium | Weekly Contest 107 | -| 0927 | [Three Equal Parts](/solution/0900-0999/0927.Three%20Equal%20Parts/README_EN.md) | `Array`,`Math` | Hard | Weekly Contest 107 | -| 0928 | [Minimize Malware Spread II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table` | Hard | Weekly Contest 107 | -| 0929 | [Unique Email Addresses](/solution/0900-0999/0929.Unique%20Email%20Addresses/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 108 | -| 0930 | [Binary Subarrays With Sum](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 108 | -| 0931 | [Minimum Falling Path Sum](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 108 | -| 0932 | [Beautiful Array](/solution/0900-0999/0932.Beautiful%20Array/README_EN.md) | `Array`,`Math`,`Divide and Conquer` | Medium | Weekly Contest 108 | -| 0933 | [Number of Recent Calls](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README_EN.md) | `Design`,`Queue`,`Data Stream` | Easy | Weekly Contest 109 | -| 0934 | [Shortest Bridge](/solution/0900-0999/0934.Shortest%20Bridge/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 109 | -| 0935 | [Knight Dialer](/solution/0900-0999/0935.Knight%20Dialer/README_EN.md) | `Dynamic Programming` | Medium | Weekly Contest 109 | -| 0936 | [Stamping The Sequence](/solution/0900-0999/0936.Stamping%20The%20Sequence/README_EN.md) | `Stack`,`Greedy`,`Queue`,`String` | Hard | Weekly Contest 109 | -| 0937 | [Reorder Data in Log Files](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README_EN.md) | `Array`,`String`,`Sorting` | Medium | Weekly Contest 110 | -| 0938 | [Range Sum of BST](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Easy | Weekly Contest 110 | -| 0939 | [Minimum Area Rectangle](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README_EN.md) | `Geometry`,`Array`,`Hash Table`,`Math`,`Sorting` | Medium | Weekly Contest 110 | -| 0940 | [Distinct Subsequences II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 110 | -| 0941 | [Valid Mountain Array](/solution/0900-0999/0941.Valid%20Mountain%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 111 | -| 0942 | [DI String Match](/solution/0900-0999/0942.DI%20String%20Match/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`String` | Easy | Weekly Contest 111 | -| 0943 | [Find the Shortest Superstring](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README_EN.md) | `Bit Manipulation`,`Array`,`String`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 111 | -| 0944 | [Delete Columns to Make Sorted](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 111 | -| 0945 | [Minimum Increment to Make Array Unique](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README_EN.md) | `Greedy`,`Array`,`Counting`,`Sorting` | Medium | Weekly Contest 112 | -| 0946 | [Validate Stack Sequences](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README_EN.md) | `Stack`,`Array`,`Simulation` | Medium | Weekly Contest 112 | -| 0947 | [Most Stones Removed with Same Row or Column](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README_EN.md) | `Depth-First Search`,`Union Find`,`Graph`,`Hash Table` | Medium | Weekly Contest 112 | -| 0948 | [Bag of Tokens](/solution/0900-0999/0948.Bag%20of%20Tokens/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 112 | -| 0949 | [Largest Time for Given Digits](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README_EN.md) | `Array`,`String`,`Enumeration` | Medium | Weekly Contest 113 | -| 0950 | [Reveal Cards In Increasing Order](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README_EN.md) | `Queue`,`Array`,`Sorting`,`Simulation` | Medium | Weekly Contest 113 | -| 0951 | [Flip Equivalent Binary Trees](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 113 | -| 0952 | [Largest Component Size by Common Factor](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README_EN.md) | `Union Find`,`Array`,`Hash Table`,`Math`,`Number Theory` | Hard | Weekly Contest 113 | -| 0953 | [Verifying an Alien Dictionary](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 114 | -| 0954 | [Array of Doubled Pairs](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 114 | -| 0955 | [Delete Columns to Make Sorted II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README_EN.md) | `Greedy`,`Array`,`String` | Medium | Weekly Contest 114 | -| 0956 | [Tallest Billboard](/solution/0900-0999/0956.Tallest%20Billboard/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 114 | -| 0957 | [Prison Cells After N Days](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Math` | Medium | Weekly Contest 115 | -| 0958 | [Check Completeness of a Binary Tree](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 115 | -| 0959 | [Regions Cut By Slashes](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 115 | -| 0960 | [Delete Columns to Make Sorted III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Hard | Weekly Contest 115 | -| 0961 | [N-Repeated Element in Size 2N Array](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 116 | -| 0962 | [Maximum Width Ramp](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 116 | -| 0963 | [Minimum Area Rectangle II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README_EN.md) | `Geometry`,`Array`,`Math` | Medium | Weekly Contest 116 | -| 0964 | [Least Operators to Express Number](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming` | Hard | Weekly Contest 116 | -| 0965 | [Univalued Binary Tree](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | Weekly Contest 117 | -| 0966 | [Vowel Spellchecker](/solution/0900-0999/0966.Vowel%20Spellchecker/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 117 | -| 0967 | [Numbers With Same Consecutive Differences](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README_EN.md) | `Breadth-First Search`,`Backtracking` | Medium | Weekly Contest 117 | -| 0968 | [Binary Tree Cameras](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Hard | Weekly Contest 117 | -| 0969 | [Pancake Sorting](/solution/0900-0999/0969.Pancake%20Sorting/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 118 | -| 0970 | [Powerful Integers](/solution/0900-0999/0970.Powerful%20Integers/README_EN.md) | `Hash Table`,`Math`,`Enumeration` | Medium | Weekly Contest 118 | -| 0971 | [Flip Binary Tree To Match Preorder Traversal](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 118 | -| 0972 | [Equal Rational Numbers](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README_EN.md) | `Math`,`String` | Hard | Weekly Contest 118 | -| 0973 | [K Closest Points to Origin](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README_EN.md) | `Geometry`,`Array`,`Math`,`Divide and Conquer`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 119 | -| 0974 | [Subarray Sums Divisible by K](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 119 | -| 0975 | [Odd Even Jump](/solution/0900-0999/0975.Odd%20Even%20Jump/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Ordered Set`,`Monotonic Stack` | Hard | Weekly Contest 119 | -| 0976 | [Largest Perimeter Triangle](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Easy | Weekly Contest 119 | -| 0977 | [Squares of a Sorted Array](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 120 | -| 0978 | [Longest Turbulent Subarray](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | Weekly Contest 120 | -| 0979 | [Distribute Coins in Binary Tree](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 120 | -| 0980 | [Unique Paths III](/solution/0900-0999/0980.Unique%20Paths%20III/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Matrix` | Hard | Weekly Contest 120 | -| 0981 | [Time Based Key-Value Store](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README_EN.md) | `Design`,`Hash Table`,`String`,`Binary Search` | Medium | Weekly Contest 121 | -| 0982 | [Triples with Bitwise AND Equal To Zero](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Hard | Weekly Contest 121 | -| 0983 | [Minimum Cost For Tickets](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 121 | -| 0984 | [String Without AAA or BBB](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 121 | -| 0985 | [Sum of Even Numbers After Queries](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 122 | -| 0986 | [Interval List Intersections](/solution/0900-0999/0986.Interval%20List%20Intersections/README_EN.md) | `Array`,`Two Pointers` | Medium | Weekly Contest 122 | -| 0987 | [Vertical Order Traversal of a Binary Tree](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`,`Sorting` | Hard | Weekly Contest 122 | -| 0988 | [Smallest String Starting From Leaf](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Backtracking`,`Binary Tree` | Medium | Weekly Contest 122 | -| 0989 | [Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 123 | -| 0990 | [Satisfiability of Equality Equations](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README_EN.md) | `Union Find`,`Graph`,`Array`,`String` | Medium | Weekly Contest 123 | -| 0991 | [Broken Calculator](/solution/0900-0999/0991.Broken%20Calculator/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 123 | -| 0992 | [Subarrays with K Different Integers](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sliding Window` | Hard | Weekly Contest 123 | -| 0993 | [Cousins in Binary Tree](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | Weekly Contest 124 | -| 0994 | [Rotting Oranges](/solution/0900-0999/0994.Rotting%20Oranges/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 124 | -| 0995 | [Minimum Number of K Consecutive Bit Flips](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README_EN.md) | `Bit Manipulation`,`Queue`,`Array`,`Prefix Sum`,`Sliding Window` | Hard | Weekly Contest 124 | -| 0996 | [Number of Squareful Arrays](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Math`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | Weekly Contest 124 | -| 0997 | [Find the Town Judge](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README_EN.md) | `Graph`,`Array`,`Hash Table` | Easy | Weekly Contest 125 | -| 0998 | [Maximum Binary Tree II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README_EN.md) | `Tree`,`Binary Tree` | Medium | Weekly Contest 125 | -| 0999 | [Available Captures for Rook](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Weekly Contest 125 | -| 1000 | [Minimum Cost to Merge Stones](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 126 | -| 1001 | [Grid Illumination](/solution/1000-1099/1001.Grid%20Illumination/README_EN.md) | `Array`,`Hash Table` | Hard | Weekly Contest 125 | -| 1002 | [Find Common Characters](/solution/1000-1099/1002.Find%20Common%20Characters/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 126 | -| 1003 | [Check If Word Is Valid After Substitutions](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 126 | -| 1004 | [Max Consecutive Ones III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 126 | -| 1005 | [Maximize Sum Of Array After K Negations](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 127 | -| 1006 | [Clumsy Factorial](/solution/1000-1099/1006.Clumsy%20Factorial/README_EN.md) | `Stack`,`Math`,`Simulation` | Medium | Weekly Contest 127 | -| 1007 | [Minimum Domino Rotations For Equal Row](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 127 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Binary Search Tree`,`Array`,`Binary Tree`,`Monotonic Stack` | Medium | Weekly Contest 127 | -| 1009 | [Complement of Base 10 Integer](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README_EN.md) | `Bit Manipulation` | Easy | Weekly Contest 128 | -| 1010 | [Pairs of Songs With Total Durations Divisible by 60](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 128 | -| 1011 | [Capacity To Ship Packages Within D Days](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 128 | -| 1012 | [Numbers With Repeated Digits](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Weekly Contest 128 | -| 1013 | [Partition Array Into Three Parts With Equal Sum](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README_EN.md) | `Greedy`,`Array` | Easy | Weekly Contest 129 | -| 1014 | [Best Sightseeing Pair](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 129 | -| 1015 | [Smallest Integer Divisible by K](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README_EN.md) | `Hash Table`,`Math` | Medium | Weekly Contest 129 | -| 1016 | [Binary String With Substrings Representing 1 To N](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README_EN.md) | `String` | Medium | Weekly Contest 129 | -| 1017 | [Convert to Base -2](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README_EN.md) | `Math` | Medium | Weekly Contest 130 | -| 1018 | [Binary Prefix Divisible By 5](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 130 | -| 1019 | [Next Greater Node In Linked List](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README_EN.md) | `Stack`,`Array`,`Linked List`,`Monotonic Stack` | Medium | Weekly Contest 130 | -| 1020 | [Number of Enclaves](/solution/1000-1099/1020.Number%20of%20Enclaves/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Weekly Contest 130 | -| 1021 | [Remove Outermost Parentheses](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 131 | -| 1022 | [Sum of Root To Leaf Binary Numbers](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | Weekly Contest 131 | -| 1023 | [Camelcase Matching](/solution/1000-1099/1023.Camelcase%20Matching/README_EN.md) | `Trie`,`Array`,`Two Pointers`,`String`,`String Matching` | Medium | Weekly Contest 131 | -| 1024 | [Video Stitching](/solution/1000-1099/1024.Video%20Stitching/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 131 | -| 1025 | [Divisor Game](/solution/1000-1099/1025.Divisor%20Game/README_EN.md) | `Brainteaser`,`Math`,`Dynamic Programming`,`Game Theory` | Easy | Weekly Contest 132 | -| 1026 | [Maximum Difference Between Node and Ancestor](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 132 | -| 1027 | [Longest Arithmetic Subsequence](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming` | Medium | Weekly Contest 132 | -| 1028 | [Recover a Tree From Preorder Traversal](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Binary Tree` | Hard | Weekly Contest 132 | -| 1029 | [Two City Scheduling](/solution/1000-1099/1029.Two%20City%20Scheduling/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 133 | -| 1030 | [Matrix Cells in Distance Order](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README_EN.md) | `Geometry`,`Array`,`Math`,`Matrix`,`Sorting` | Easy | Weekly Contest 133 | -| 1031 | [Maximum Sum of Two Non-Overlapping Subarrays](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | Weekly Contest 133 | -| 1032 | [Stream of Characters](/solution/1000-1099/1032.Stream%20of%20Characters/README_EN.md) | `Design`,`Trie`,`Array`,`String`,`Data Stream` | Hard | Weekly Contest 133 | -| 1033 | [Moving Stones Until Consecutive](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README_EN.md) | `Brainteaser`,`Math` | Medium | Weekly Contest 134 | -| 1034 | [Coloring A Border](/solution/1000-1099/1034.Coloring%20A%20Border/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 134 | -| 1035 | [Uncrossed Lines](/solution/1000-1099/1035.Uncrossed%20Lines/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 134 | -| 1036 | [Escape a Large Maze](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table` | Hard | Weekly Contest 134 | -| 1037 | [Valid Boomerang](/solution/1000-1099/1037.Valid%20Boomerang/README_EN.md) | `Geometry`,`Array`,`Math` | Easy | Weekly Contest 135 | -| 1038 | [Binary Search Tree to Greater Sum Tree](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | Weekly Contest 135 | -| 1039 | [Minimum Score Triangulation of Polygon](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 135 | -| 1040 | [Moving Stones Until Consecutive II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README_EN.md) | `Array`,`Math`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 135 | -| 1041 | [Robot Bounded In Circle](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README_EN.md) | `Math`,`String`,`Simulation` | Medium | Weekly Contest 136 | -| 1042 | [Flower Planting With No Adjacent](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 136 | -| 1043 | [Partition Array for Maximum Sum](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 136 | -| 1044 | [Longest Duplicate Substring](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README_EN.md) | `String`,`Binary Search`,`Suffix Array`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 136 | -| 1045 | [Customers Who Bought All Products](/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README_EN.md) | `Database` | Medium | | -| 1046 | [Last Stone Weight](/solution/1000-1099/1046.Last%20Stone%20Weight/README_EN.md) | `Array`,`Heap (Priority Queue)` | Easy | Weekly Contest 137 | -| 1047 | [Remove All Adjacent Duplicates In String](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 137 | -| 1048 | [Longest String Chain](/solution/1000-1099/1048.Longest%20String%20Chain/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`String`,`Dynamic Programming` | Medium | Weekly Contest 137 | -| 1049 | [Last Stone Weight II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 137 | -| 1050 | [Actors and Directors Who Cooperated At Least Three Times](/solution/1000-1099/1050.Actors%20and%20Directors%20Who%20Cooperated%20At%20Least%20Three%20Times/README_EN.md) | `Database` | Easy | | -| 1051 | [Height Checker](/solution/1000-1099/1051.Height%20Checker/README_EN.md) | `Array`,`Counting Sort`,`Sorting` | Easy | Weekly Contest 138 | -| 1052 | [Grumpy Bookstore Owner](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 138 | -| 1053 | [Previous Permutation With One Swap](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 138 | -| 1054 | [Distant Barcodes](/solution/1000-1099/1054.Distant%20Barcodes/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 138 | -| 1055 | [Shortest Way to Form String](/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | 🔒 | -| 1056 | [Confusing Number](/solution/1000-1099/1056.Confusing%20Number/README_EN.md) | `Math` | Easy | 🔒 | -| 1057 | [Campus Bikes](/solution/1000-1099/1057.Campus%20Bikes/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | -| 1058 | [Minimize Rounding Error to Meet Target](/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README_EN.md) | `Greedy`,`Array`,`Math`,`String`,`Sorting` | Medium | 🔒 | -| 1059 | [All Paths from Source Lead to Destination](/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README_EN.md) | `Graph`,`Topological Sort` | Medium | 🔒 | -| 1060 | [Missing Element in Sorted Array](/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 | -| 1061 | [Lexicographically Smallest Equivalent String](/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README_EN.md) | `Union Find`,`String` | Medium | | -| 1062 | [Longest Repeating Substring](/solution/1000-1099/1062.Longest%20Repeating%20Substring/README_EN.md) | `String`,`Binary Search`,`Dynamic Programming`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Medium | 🔒 | -| 1063 | [Number of Valid Subarrays](/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Hard | 🔒 | -| 1064 | [Fixed Point](/solution/1000-1099/1064.Fixed%20Point/README_EN.md) | `Array`,`Binary Search` | Easy | Biweekly Contest 1 | -| 1065 | [Index Pairs of a String](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README_EN.md) | `Trie`,`Array`,`String`,`Sorting` | Easy | Biweekly Contest 1 | -| 1066 | [Campus Bikes II](/solution/1000-1099/1066.Campus%20Bikes%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Biweekly Contest 1 | -| 1067 | [Digit Count in Range](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Biweekly Contest 1 | -| 1068 | [Product Sales Analysis I](/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README_EN.md) | `Database` | Easy | | -| 1069 | [Product Sales Analysis II](/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README_EN.md) | `Database` | Easy | 🔒 | -| 1070 | [Product Sales Analysis III](/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README_EN.md) | `Database` | Medium | | -| 1071 | [Greatest Common Divisor of Strings](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 139 | -| 1072 | [Flip Columns For Maximum Number of Equal Rows](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 139 | -| 1073 | [Adding Two Negabinary Numbers](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 139 | -| 1074 | [Number of Submatrices That Sum to Target](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README_EN.md) | `Array`,`Hash Table`,`Matrix`,`Prefix Sum` | Hard | Weekly Contest 139 | -| 1075 | [Project Employees I](/solution/1000-1099/1075.Project%20Employees%20I/README_EN.md) | `Database` | Easy | | -| 1076 | [Project Employees II](/solution/1000-1099/1076.Project%20Employees%20II/README_EN.md) | `Database` | Easy | 🔒 | -| 1077 | [Project Employees III](/solution/1000-1099/1077.Project%20Employees%20III/README_EN.md) | `Database` | Medium | 🔒 | -| 1078 | [Occurrences After Bigram](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README_EN.md) | `String` | Easy | Weekly Contest 140 | -| 1079 | [Letter Tile Possibilities](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README_EN.md) | `Hash Table`,`String`,`Backtracking`,`Counting` | Medium | Weekly Contest 140 | -| 1080 | [Insufficient Nodes in Root to Leaf Paths](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 140 | -| 1081 | [Smallest Subsequence of Distinct Characters](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Medium | Weekly Contest 140 | -| 1082 | [Sales Analysis I](/solution/1000-1099/1082.Sales%20Analysis%20I/README_EN.md) | `Database` | Easy | 🔒 | -| 1083 | [Sales Analysis II](/solution/1000-1099/1083.Sales%20Analysis%20II/README_EN.md) | `Database` | Easy | 🔒 | -| 1084 | [Sales Analysis III](/solution/1000-1099/1084.Sales%20Analysis%20III/README_EN.md) | `Database` | Easy | | -| 1085 | [Sum of Digits in the Minimum Number](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 2 | -| 1086 | [High Five](/solution/1000-1099/1086.High%20Five/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Easy | Biweekly Contest 2 | -| 1087 | [Brace Expansion](/solution/1000-1099/1087.Brace%20Expansion/README_EN.md) | `Breadth-First Search`,`String`,`Backtracking` | Medium | Biweekly Contest 2 | -| 1088 | [Confusing Number II](/solution/1000-1099/1088.Confusing%20Number%20II/README_EN.md) | `Math`,`Backtracking` | Hard | Biweekly Contest 2 | -| 1089 | [Duplicate Zeros](/solution/1000-1099/1089.Duplicate%20Zeros/README_EN.md) | `Array`,`Two Pointers` | Easy | Weekly Contest 141 | -| 1090 | [Largest Values From Labels](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Weekly Contest 141 | -| 1091 | [Shortest Path in Binary Matrix](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 141 | -| 1092 | [Shortest Common Supersequence](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 141 | -| 1093 | [Statistics from a Large Sample](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README_EN.md) | `Array`,`Math`,`Probability and Statistics` | Medium | Weekly Contest 142 | -| 1094 | [Car Pooling](/solution/1000-1099/1094.Car%20Pooling/README_EN.md) | `Array`,`Prefix Sum`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Weekly Contest 142 | -| 1095 | [Find in Mountain Array](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README_EN.md) | `Array`,`Binary Search`,`Interactive` | Hard | Weekly Contest 142 | -| 1096 | [Brace Expansion II](/solution/1000-1099/1096.Brace%20Expansion%20II/README_EN.md) | `Stack`,`Breadth-First Search`,`String`,`Backtracking` | Hard | Weekly Contest 142 | -| 1097 | [Game Play Analysis V](/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README_EN.md) | `Database` | Hard | 🔒 | -| 1098 | [Unpopular Books](/solution/1000-1099/1098.Unpopular%20Books/README_EN.md) | `Database` | Medium | 🔒 | -| 1099 | [Two Sum Less Than K](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | Biweekly Contest 3 | -| 1100 | [Find K-Length Substrings With No Repeated Characters](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Biweekly Contest 3 | -| 1101 | [The Earliest Moment When Everyone Become Friends](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README_EN.md) | `Union Find`,`Array`,`Sorting` | Medium | Biweekly Contest 3 | -| 1102 | [Path With Maximum Minimum Value](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)` | Medium | Biweekly Contest 3 | -| 1103 | [Distribute Candies to People](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 143 | -| 1104 | [Path In Zigzag Labelled Binary Tree](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README_EN.md) | `Tree`,`Math`,`Binary Tree` | Medium | Weekly Contest 143 | -| 1105 | [Filling Bookcase Shelves](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 143 | -| 1106 | [Parsing A Boolean Expression](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README_EN.md) | `Stack`,`Recursion`,`String` | Hard | Weekly Contest 143 | -| 1107 | [New Users Daily Count](/solution/1100-1199/1107.New%20Users%20Daily%20Count/README_EN.md) | `Database` | Medium | 🔒 | -| 1108 | [Defanging an IP Address](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README_EN.md) | `String` | Easy | Weekly Contest 144 | -| 1109 | [Corporate Flight Bookings](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 144 | -| 1110 | [Delete Nodes And Return Forest](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 144 | -| 1111 | [Maximum Nesting Depth of Two Valid Parentheses Strings](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 144 | -| 1112 | [Highest Grade For Each Student](/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README_EN.md) | `Database` | Medium | 🔒 | -| 1113 | [Reported Posts](/solution/1100-1199/1113.Reported%20Posts/README_EN.md) | `Database` | Easy | 🔒 | -| 1114 | [Print in Order](/solution/1100-1199/1114.Print%20in%20Order/README_EN.md) | `Concurrency` | Easy | | -| 1115 | [Print FooBar Alternately](/solution/1100-1199/1115.Print%20FooBar%20Alternately/README_EN.md) | `Concurrency` | Medium | | -| 1116 | [Print Zero Even Odd](/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README_EN.md) | `Concurrency` | Medium | | -| 1117 | [Building H2O](/solution/1100-1199/1117.Building%20H2O/README_EN.md) | `Concurrency` | Medium | | -| 1118 | [Number of Days in a Month](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README_EN.md) | `Math` | Easy | Biweekly Contest 4 | -| 1119 | [Remove Vowels from a String](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README_EN.md) | `String` | Easy | Biweekly Contest 4 | -| 1120 | [Maximum Average Subtree](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Biweekly Contest 4 | -| 1121 | [Divide Array Into Increasing Sequences](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README_EN.md) | `Array`,`Counting` | Hard | Biweekly Contest 4 | -| 1122 | [Relative Sort Array](/solution/1100-1199/1122.Relative%20Sort%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting Sort`,`Sorting` | Easy | Weekly Contest 145 | -| 1123 | [Lowest Common Ancestor of Deepest Leaves](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 145 | -| 1124 | [Longest Well-Performing Interval](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README_EN.md) | `Stack`,`Array`,`Hash Table`,`Prefix Sum`,`Monotonic Stack` | Medium | Weekly Contest 145 | -| 1125 | [Smallest Sufficient Team](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 145 | -| 1126 | [Active Businesses](/solution/1100-1199/1126.Active%20Businesses/README_EN.md) | `Database` | Medium | 🔒 | -| 1127 | [User Purchase Platform](/solution/1100-1199/1127.User%20Purchase%20Platform/README_EN.md) | `Database` | Hard | 🔒 | -| 1128 | [Number of Equivalent Domino Pairs](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 146 | -| 1129 | [Shortest Path with Alternating Colors](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README_EN.md) | `Breadth-First Search`,`Graph` | Medium | Weekly Contest 146 | -| 1130 | [Minimum Cost Tree From Leaf Values](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README_EN.md) | `Stack`,`Greedy`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Medium | Weekly Contest 146 | -| 1131 | [Maximum of Absolute Value Expression](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 146 | -| 1132 | [Reported Posts II](/solution/1100-1199/1132.Reported%20Posts%20II/README_EN.md) | `Database` | Medium | 🔒 | -| 1133 | [Largest Unique Number](/solution/1100-1199/1133.Largest%20Unique%20Number/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 5 | -| 1134 | [Armstrong Number](/solution/1100-1199/1134.Armstrong%20Number/README_EN.md) | `Math` | Easy | Biweekly Contest 5 | -| 1135 | [Connecting Cities With Minimum Cost](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README_EN.md) | `Union Find`,`Graph`,`Minimum Spanning Tree`,`Heap (Priority Queue)` | Medium | Biweekly Contest 5 | -| 1136 | [Parallel Courses](/solution/1100-1199/1136.Parallel%20Courses/README_EN.md) | `Graph`,`Topological Sort` | Medium | Biweekly Contest 5 | -| 1137 | [N-th Tribonacci Number](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming` | Easy | Weekly Contest 147 | -| 1138 | [Alphabet Board Path](/solution/1100-1199/1138.Alphabet%20Board%20Path/README_EN.md) | `Hash Table`,`String` | Medium | Weekly Contest 147 | -| 1139 | [Largest 1-Bordered Square](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 147 | -| 1140 | [Stone Game II](/solution/1100-1199/1140.Stone%20Game%20II/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory`,`Prefix Sum` | Medium | Weekly Contest 147 | -| 1141 | [User Activity for the Past 30 Days I](/solution/1100-1199/1141.User%20Activity%20for%20the%20Past%2030%20Days%20I/README_EN.md) | `Database` | Easy | | -| 1142 | [User Activity for the Past 30 Days II](/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README_EN.md) | `Database` | Easy | 🔒 | -| 1143 | [Longest Common Subsequence](/solution/1100-1199/1143.Longest%20Common%20Subsequence/README_EN.md) | `String`,`Dynamic Programming` | Medium | | -| 1144 | [Decrease Elements To Make Array Zigzag](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 148 | -| 1145 | [Binary Tree Coloring Game](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 148 | -| 1146 | [Snapshot Array](/solution/1100-1199/1146.Snapshot%20Array/README_EN.md) | `Design`,`Array`,`Hash Table`,`Binary Search` | Medium | Weekly Contest 148 | -| 1147 | [Longest Chunked Palindrome Decomposition](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README_EN.md) | `Greedy`,`Two Pointers`,`String`,`Dynamic Programming`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 148 | -| 1148 | [Article Views I](/solution/1100-1199/1148.Article%20Views%20I/README_EN.md) | `Database` | Easy | | -| 1149 | [Article Views II](/solution/1100-1199/1149.Article%20Views%20II/README_EN.md) | `Database` | Medium | 🔒 | -| 1150 | [Check If a Number Is Majority Element in a Sorted Array](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Easy | Biweekly Contest 6 | -| 1151 | [Minimum Swaps to Group All 1's Together](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README_EN.md) | `Array`,`Sliding Window` | Medium | Biweekly Contest 6 | -| 1152 | [Analyze User Website Visit Pattern](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | Biweekly Contest 6 | -| 1153 | [String Transforms Into Another String](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README_EN.md) | `Hash Table`,`String` | Hard | Biweekly Contest 6 | -| 1154 | [Day of the Year](/solution/1100-1199/1154.Day%20of%20the%20Year/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 149 | -| 1155 | [Number of Dice Rolls With Target Sum](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README_EN.md) | `Dynamic Programming` | Medium | Weekly Contest 149 | -| 1156 | [Swap For Longest Repeated Character Substring](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 149 | -| 1157 | [Online Majority Element In Subarray](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README_EN.md) | `Design`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search` | Hard | Weekly Contest 149 | -| 1158 | [Market Analysis I](/solution/1100-1199/1158.Market%20Analysis%20I/README_EN.md) | `Database` | Medium | | -| 1159 | [Market Analysis II](/solution/1100-1199/1159.Market%20Analysis%20II/README_EN.md) | `Database` | Hard | 🔒 | -| 1160 | [Find Words That Can Be Formed by Characters](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 150 | -| 1161 | [Maximum Level Sum of a Binary Tree](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 150 | -| 1162 | [As Far from Land as Possible](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 150 | -| 1163 | [Last Substring in Lexicographical Order](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README_EN.md) | `Two Pointers`,`String` | Hard | Weekly Contest 150 | -| 1164 | [Product Price at a Given Date](/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README_EN.md) | `Database` | Medium | | -| 1165 | [Single-Row Keyboard](/solution/1100-1199/1165.Single-Row%20Keyboard/README_EN.md) | `Hash Table`,`String` | Easy | Biweekly Contest 7 | -| 1166 | [Design File System](/solution/1100-1199/1166.Design%20File%20System/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | Biweekly Contest 7 | -| 1167 | [Minimum Cost to Connect Sticks](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Biweekly Contest 7 | -| 1168 | [Optimize Water Distribution in a Village](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README_EN.md) | `Union Find`,`Graph`,`Minimum Spanning Tree`,`Heap (Priority Queue)` | Hard | Biweekly Contest 7 | -| 1169 | [Invalid Transactions](/solution/1100-1199/1169.Invalid%20Transactions/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 151 | -| 1170 | [Compare Strings by Frequency of the Smallest Character](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README_EN.md) | `Array`,`Hash Table`,`String`,`Binary Search`,`Sorting` | Medium | Weekly Contest 151 | -| 1171 | [Remove Zero Sum Consecutive Nodes from Linked List](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README_EN.md) | `Hash Table`,`Linked List` | Medium | Weekly Contest 151 | -| 1172 | [Dinner Plate Stacks](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README_EN.md) | `Stack`,`Design`,`Hash Table`,`Heap (Priority Queue)` | Hard | Weekly Contest 151 | -| 1173 | [Immediate Food Delivery I](/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README_EN.md) | `Database` | Easy | 🔒 | -| 1174 | [Immediate Food Delivery II](/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README_EN.md) | `Database` | Medium | | -| 1175 | [Prime Arrangements](/solution/1100-1199/1175.Prime%20Arrangements/README_EN.md) | `Math` | Easy | Weekly Contest 152 | -| 1176 | [Diet Plan Performance](/solution/1100-1199/1176.Diet%20Plan%20Performance/README_EN.md) | `Array`,`Sliding Window` | Easy | Weekly Contest 152 | -| 1177 | [Can Make Palindrome from Substring](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String`,`Prefix Sum` | Medium | Weekly Contest 152 | -| 1178 | [Number of Valid Words for Each Puzzle](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README_EN.md) | `Bit Manipulation`,`Trie`,`Array`,`Hash Table`,`String` | Hard | Weekly Contest 152 | -| 1179 | [Reformat Department Table](/solution/1100-1199/1179.Reformat%20Department%20Table/README_EN.md) | `Database` | Easy | | -| 1180 | [Count Substrings with Only One Distinct Letter](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 8 | -| 1181 | [Before and After Puzzle](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Biweekly Contest 8 | -| 1182 | [Shortest Distance to Target Color](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming` | Medium | Biweekly Contest 8 | -| 1183 | [Maximum Number of Ones](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README_EN.md) | `Greedy`,`Heap (Priority Queue)` | Hard | Biweekly Contest 8 | -| 1184 | [Distance Between Bus Stops](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README_EN.md) | `Array` | Easy | Weekly Contest 153 | -| 1185 | [Day of the Week](/solution/1100-1199/1185.Day%20of%20the%20Week/README_EN.md) | `Math` | Easy | Weekly Contest 153 | -| 1186 | [Maximum Subarray Sum with One Deletion](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 153 | -| 1187 | [Make Array Strictly Increasing](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 153 | -| 1188 | [Design Bounded Blocking Queue](/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README_EN.md) | `Concurrency` | Medium | 🔒 | -| 1189 | [Maximum Number of Balloons](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 154 | -| 1190 | [Reverse Substrings Between Each Pair of Parentheses](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 154 | -| 1191 | [K-Concatenation Maximum Sum](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 154 | -| 1192 | [Critical Connections in a Network](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README_EN.md) | `Depth-First Search`,`Graph`,`Biconnected Component` | Hard | Weekly Contest 154 | -| 1193 | [Monthly Transactions I](/solution/1100-1199/1193.Monthly%20Transactions%20I/README_EN.md) | `Database` | Medium | | -| 1194 | [Tournament Winners](/solution/1100-1199/1194.Tournament%20Winners/README_EN.md) | `Database` | Hard | 🔒 | -| 1195 | [Fizz Buzz Multithreaded](/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README_EN.md) | `Concurrency` | Medium | | -| 1196 | [How Many Apples Can You Put into the Basket](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Biweekly Contest 9 | -| 1197 | [Minimum Knight Moves](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README_EN.md) | `Breadth-First Search` | Medium | Biweekly Contest 9 | -| 1198 | [Find Smallest Common Element in All Rows](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Counting`,`Matrix` | Medium | Biweekly Contest 9 | -| 1199 | [Minimum Time to Build Blocks](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README_EN.md) | `Greedy`,`Array`,`Math`,`Heap (Priority Queue)` | Hard | Biweekly Contest 9 | -| 1200 | [Minimum Absolute Difference](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 155 | -| 1201 | [Ugly Number III](/solution/1200-1299/1201.Ugly%20Number%20III/README_EN.md) | `Math`,`Binary Search`,`Combinatorics`,`Number Theory` | Medium | Weekly Contest 155 | -| 1202 | [Smallest String With Swaps](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 155 | -| 1203 | [Sort Items by Groups Respecting Dependencies](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Hard | Weekly Contest 155 | -| 1204 | [Last Person to Fit in the Bus](/solution/1200-1299/1204.Last%20Person%20to%20Fit%20in%20the%20Bus/README_EN.md) | `Database` | Medium | | -| 1205 | [Monthly Transactions II](/solution/1200-1299/1205.Monthly%20Transactions%20II/README_EN.md) | `Database` | Medium | 🔒 | -| 1206 | [Design Skiplist](/solution/1200-1299/1206.Design%20Skiplist/README_EN.md) | `Design`,`Linked List` | Hard | | -| 1207 | [Unique Number of Occurrences](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 156 | -| 1208 | [Get Equal Substrings Within Budget](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README_EN.md) | `String`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 156 | -| 1209 | [Remove All Adjacent Duplicates in String II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 156 | -| 1210 | [Minimum Moves to Reach Target with Rotations](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | Weekly Contest 156 | -| 1211 | [Queries Quality and Percentage](/solution/1200-1299/1211.Queries%20Quality%20and%20Percentage/README_EN.md) | `Database` | Easy | | -| 1212 | [Team Scores in Football Tournament](/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README_EN.md) | `Database` | Medium | 🔒 | -| 1213 | [Intersection of Three Sorted Arrays](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Counting` | Easy | Biweekly Contest 10 | -| 1214 | [Two Sum BSTs](/solution/1200-1299/1214.Two%20Sum%20BSTs/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Two Pointers`,`Binary Search`,`Binary Tree` | Medium | Biweekly Contest 10 | -| 1215 | [Stepping Numbers](/solution/1200-1299/1215.Stepping%20Numbers/README_EN.md) | `Breadth-First Search`,`Backtracking` | Medium | Biweekly Contest 10 | -| 1216 | [Valid Palindrome III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README_EN.md) | `String`,`Dynamic Programming` | Hard | Biweekly Contest 10 | -| 1217 | [Minimum Cost to Move Chips to The Same Position](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README_EN.md) | `Greedy`,`Array`,`Math` | Easy | Weekly Contest 157 | -| 1218 | [Longest Arithmetic Subsequence of Given Difference](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Medium | Weekly Contest 157 | -| 1219 | [Path with Maximum Gold](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README_EN.md) | `Array`,`Backtracking`,`Matrix` | Medium | Weekly Contest 157 | -| 1220 | [Count Vowels Permutation](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README_EN.md) | `Dynamic Programming` | Hard | Weekly Contest 157 | -| 1221 | [Split a String in Balanced Strings](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README_EN.md) | `Greedy`,`String`,`Counting` | Easy | Weekly Contest 158 | -| 1222 | [Queens That Can Attack the King](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 158 | -| 1223 | [Dice Roll Simulation](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 158 | -| 1224 | [Maximum Equal Frequency](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README_EN.md) | `Array`,`Hash Table` | Hard | Weekly Contest 158 | -| 1225 | [Report Contiguous Dates](/solution/1200-1299/1225.Report%20Contiguous%20Dates/README_EN.md) | `Database` | Hard | 🔒 | -| 1226 | [The Dining Philosophers](/solution/1200-1299/1226.The%20Dining%20Philosophers/README_EN.md) | `Concurrency` | Medium | | -| 1227 | [Airplane Seat Assignment Probability](/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README_EN.md) | `Brainteaser`,`Math`,`Dynamic Programming`,`Probability and Statistics` | Medium | | -| 1228 | [Missing Number In Arithmetic Progression](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 11 | -| 1229 | [Meeting Scheduler](/solution/1200-1299/1229.Meeting%20Scheduler/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | Biweekly Contest 11 | -| 1230 | [Toss Strange Coins](/solution/1200-1299/1230.Toss%20Strange%20Coins/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Probability and Statistics` | Medium | Biweekly Contest 11 | -| 1231 | [Divide Chocolate](/solution/1200-1299/1231.Divide%20Chocolate/README_EN.md) | `Array`,`Binary Search` | Hard | Biweekly Contest 11 | -| 1232 | [Check If It Is a Straight Line](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README_EN.md) | `Geometry`,`Array`,`Math` | Easy | Weekly Contest 159 | -| 1233 | [Remove Sub-Folders from the Filesystem](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README_EN.md) | `Depth-First Search`,`Trie`,`Array`,`String` | Medium | Weekly Contest 159 | -| 1234 | [Replace the Substring for Balanced String](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README_EN.md) | `String`,`Sliding Window` | Medium | Weekly Contest 159 | -| 1235 | [Maximum Profit in Job Scheduling](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 159 | -| 1236 | [Web Crawler](/solution/1200-1299/1236.Web%20Crawler/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`String`,`Interactive` | Medium | 🔒 | -| 1237 | [Find Positive Integer Solution for a Given Equation](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README_EN.md) | `Math`,`Two Pointers`,`Binary Search`,`Interactive` | Medium | Weekly Contest 160 | -| 1238 | [Circular Permutation in Binary Representation](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README_EN.md) | `Bit Manipulation`,`Math`,`Backtracking` | Medium | Weekly Contest 160 | -| 1239 | [Maximum Length of a Concatenated String with Unique Characters](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README_EN.md) | `Bit Manipulation`,`Array`,`String`,`Backtracking` | Medium | Weekly Contest 160 | -| 1240 | [Tiling a Rectangle with the Fewest Squares](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README_EN.md) | `Backtracking` | Hard | Weekly Contest 160 | -| 1241 | [Number of Comments per Post](/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README_EN.md) | `Database` | Easy | 🔒 | -| 1242 | [Web Crawler Multithreaded](/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Concurrency` | Medium | 🔒 | -| 1243 | [Array Transformation](/solution/1200-1299/1243.Array%20Transformation/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 12 | -| 1244 | [Design A Leaderboard](/solution/1200-1299/1244.Design%20A%20Leaderboard/README_EN.md) | `Design`,`Hash Table`,`Sorting` | Medium | Biweekly Contest 12 | -| 1245 | [Tree Diameter](/solution/1200-1299/1245.Tree%20Diameter/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | Biweekly Contest 12 | -| 1246 | [Palindrome Removal](/solution/1200-1299/1246.Palindrome%20Removal/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 12 | -| 1247 | [Minimum Swaps to Make Strings Equal](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README_EN.md) | `Greedy`,`Math`,`String` | Medium | Weekly Contest 161 | -| 1248 | [Count Number of Nice Subarrays](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Math`,`Sliding Window` | Medium | Weekly Contest 161 | -| 1249 | [Minimum Remove to Make Valid Parentheses](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 161 | -| 1250 | [Check If It Is a Good Array](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README_EN.md) | `Array`,`Math`,`Number Theory` | Hard | Weekly Contest 161 | -| 1251 | [Average Selling Price](/solution/1200-1299/1251.Average%20Selling%20Price/README_EN.md) | `Database` | Easy | | -| 1252 | [Cells with Odd Values in a Matrix](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README_EN.md) | `Array`,`Math`,`Simulation` | Easy | Weekly Contest 162 | -| 1253 | [Reconstruct a 2-Row Binary Matrix](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | Weekly Contest 162 | -| 1254 | [Number of Closed Islands](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Weekly Contest 162 | -| 1255 | [Maximum Score Words Formed by Letters](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README_EN.md) | `Bit Manipulation`,`Array`,`String`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | Weekly Contest 162 | -| 1256 | [Encode Number](/solution/1200-1299/1256.Encode%20Number/README_EN.md) | `Bit Manipulation`,`Math`,`String` | Medium | Biweekly Contest 13 | -| 1257 | [Smallest Common Region](/solution/1200-1299/1257.Smallest%20Common%20Region/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table`,`String` | Medium | Biweekly Contest 13 | -| 1258 | [Synonymous Sentences](/solution/1200-1299/1258.Synonymous%20Sentences/README_EN.md) | `Union Find`,`Array`,`Hash Table`,`String`,`Backtracking` | Medium | Biweekly Contest 13 | -| 1259 | [Handshakes That Don't Cross](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Biweekly Contest 13 | -| 1260 | [Shift 2D Grid](/solution/1200-1299/1260.Shift%202D%20Grid/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Weekly Contest 163 | -| 1261 | [Find Elements in a Contaminated Binary Tree](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 163 | -| 1262 | [Greatest Sum Divisible by Three](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 163 | -| 1263 | [Minimum Moves to Move a Box to Their Target Location](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix`,`Heap (Priority Queue)` | Hard | Weekly Contest 163 | -| 1264 | [Page Recommendations](/solution/1200-1299/1264.Page%20Recommendations/README_EN.md) | `Database` | Medium | 🔒 | -| 1265 | [Print Immutable Linked List in Reverse](/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README_EN.md) | `Stack`,`Recursion`,`Linked List`,`Two Pointers` | Medium | 🔒 | -| 1266 | [Minimum Time Visiting All Points](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README_EN.md) | `Geometry`,`Array`,`Math` | Easy | Weekly Contest 164 | -| 1267 | [Count Servers that Communicate](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Counting`,`Matrix` | Medium | Weekly Contest 164 | -| 1268 | [Search Suggestions System](/solution/1200-1299/1268.Search%20Suggestions%20System/README_EN.md) | `Trie`,`Array`,`String`,`Binary Search`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 164 | -| 1269 | [Number of Ways to Stay in the Same Place After Some Steps](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README_EN.md) | `Dynamic Programming` | Hard | Weekly Contest 164 | -| 1270 | [All People Report to the Given Manager](/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README_EN.md) | `Database` | Medium | 🔒 | -| 1271 | [Hexspeak](/solution/1200-1299/1271.Hexspeak/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 14 | -| 1272 | [Remove Interval](/solution/1200-1299/1272.Remove%20Interval/README_EN.md) | `Array` | Medium | Biweekly Contest 14 | -| 1273 | [Delete Tree Nodes](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array` | Medium | Biweekly Contest 14 | -| 1274 | [Number of Ships in a Rectangle](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README_EN.md) | `Array`,`Divide and Conquer`,`Interactive` | Hard | Biweekly Contest 14 | -| 1275 | [Find Winner on a Tic Tac Toe Game](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README_EN.md) | `Array`,`Hash Table`,`Matrix`,`Simulation` | Easy | Weekly Contest 165 | -| 1276 | [Number of Burgers with No Waste of Ingredients](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README_EN.md) | `Math` | Medium | Weekly Contest 165 | -| 1277 | [Count Square Submatrices with All Ones](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 165 | -| 1278 | [Palindrome Partitioning III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 165 | -| 1279 | [Traffic Light Controlled Intersection](/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README_EN.md) | `Concurrency` | Easy | 🔒 | -| 1280 | [Students and Examinations](/solution/1200-1299/1280.Students%20and%20Examinations/README_EN.md) | `Database` | Easy | | -| 1281 | [Subtract the Product and Sum of Digits of an Integer](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README_EN.md) | `Math` | Easy | Weekly Contest 166 | -| 1282 | [Group the People Given the Group Size They Belong To](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 166 | -| 1283 | [Find the Smallest Divisor Given a Threshold](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 166 | -| 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array`,`Hash Table`,`Matrix` | Hard | Weekly Contest 166 | -| 1285 | [Find the Start and End Number of Continuous Ranges](/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README_EN.md) | `Database` | Medium | 🔒 | -| 1286 | [Iterator for Combination](/solution/1200-1299/1286.Iterator%20for%20Combination/README_EN.md) | `Design`,`String`,`Backtracking`,`Iterator` | Medium | Biweekly Contest 15 | -| 1287 | [Element Appearing More Than 25% In Sorted Array](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README_EN.md) | `Array` | Easy | Biweekly Contest 15 | -| 1288 | [Remove Covered Intervals](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 15 | -| 1289 | [Minimum Falling Path Sum II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 15 | -| 1290 | [Convert Binary Number in a Linked List to Integer](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README_EN.md) | `Linked List`,`Math` | Easy | Weekly Contest 167 | -| 1291 | [Sequential Digits](/solution/1200-1299/1291.Sequential%20Digits/README_EN.md) | `Enumeration` | Medium | Weekly Contest 167 | -| 1292 | [Maximum Side Length of a Square with Sum Less than or Equal to Threshold](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README_EN.md) | `Array`,`Binary Search`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 167 | -| 1293 | [Shortest Path in a Grid with Obstacles Elimination](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | Weekly Contest 167 | -| 1294 | [Weather Type in Each Country](/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README_EN.md) | `Database` | Easy | 🔒 | -| 1295 | [Find Numbers with Even Number of Digits](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README_EN.md) | `Array` | Easy | Weekly Contest 168 | -| 1296 | [Divide Array in Sets of K Consecutive Numbers](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 168 | -| 1297 | [Maximum Number of Occurrences of a Substring](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 168 | -| 1298 | [Maximum Candies You Can Get from Boxes](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README_EN.md) | `Breadth-First Search`,`Graph`,`Array` | Hard | Weekly Contest 168 | -| 1299 | [Replace Elements with Greatest Element on Right Side](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README_EN.md) | `Array` | Easy | Biweekly Contest 16 | -| 1300 | [Sum of Mutated Array Closest to Target](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 16 | -| 1301 | [Number of Paths with Max Score](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 16 | -| 1302 | [Deepest Leaves Sum](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Biweekly Contest 16 | -| 1303 | [Find the Team Size](/solution/1300-1399/1303.Find%20the%20Team%20Size/README_EN.md) | `Database` | Easy | 🔒 | -| 1304 | [Find N Unique Integers Sum up to Zero](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 169 | -| 1305 | [All Elements in Two Binary Search Trees](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`,`Sorting` | Medium | Weekly Contest 169 | -| 1306 | [Jump Game III](/solution/1300-1399/1306.Jump%20Game%20III/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array` | Medium | Weekly Contest 169 | -| 1307 | [Verbal Arithmetic Puzzle](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README_EN.md) | `Array`,`Math`,`String`,`Backtracking` | Hard | Weekly Contest 169 | -| 1308 | [Running Total for Different Genders](/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README_EN.md) | `Database` | Medium | 🔒 | -| 1309 | [Decrypt String from Alphabet to Integer Mapping](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README_EN.md) | `String` | Easy | Weekly Contest 170 | -| 1310 | [XOR Queries of a Subarray](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README_EN.md) | `Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Weekly Contest 170 | -| 1311 | [Get Watched Videos by Your Friends](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 170 | -| 1312 | [Minimum Insertion Steps to Make a String Palindrome](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 170 | -| 1313 | [Decompress Run-Length Encoded List](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README_EN.md) | `Array` | Easy | Biweekly Contest 17 | -| 1314 | [Matrix Block Sum](/solution/1300-1399/1314.Matrix%20Block%20Sum/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Biweekly Contest 17 | -| 1315 | [Sum of Nodes with Even-Valued Grandparent](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Biweekly Contest 17 | -| 1316 | [Distinct Echo Substrings](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README_EN.md) | `Trie`,`String`,`Hash Function`,`Rolling Hash` | Hard | Biweekly Contest 17 | -| 1317 | [Convert Integer to the Sum of Two No-Zero Integers](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README_EN.md) | `Math` | Easy | Weekly Contest 171 | -| 1318 | [Minimum Flips to Make a OR b Equal to c](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README_EN.md) | `Bit Manipulation` | Medium | Weekly Contest 171 | -| 1319 | [Number of Operations to Make Network Connected](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Weekly Contest 171 | -| 1320 | [Minimum Distance to Type a Word Using Two Fingers](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 171 | -| 1321 | [Restaurant Growth](/solution/1300-1399/1321.Restaurant%20Growth/README_EN.md) | `Database` | Medium | | -| 1322 | [Ads Performance](/solution/1300-1399/1322.Ads%20Performance/README_EN.md) | `Database` | Easy | 🔒 | -| 1323 | [Maximum 69 Number](/solution/1300-1399/1323.Maximum%2069%20Number/README_EN.md) | `Greedy`,`Math` | Easy | Weekly Contest 172 | -| 1324 | [Print Words Vertically](/solution/1300-1399/1324.Print%20Words%20Vertically/README_EN.md) | `Array`,`String`,`Simulation` | Medium | Weekly Contest 172 | -| 1325 | [Delete Leaves With a Given Value](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 172 | -| 1326 | [Minimum Number of Taps to Open to Water a Garden](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 172 | -| 1327 | [List the Products Ordered in a Period](/solution/1300-1399/1327.List%20the%20Products%20Ordered%20in%20a%20Period/README_EN.md) | `Database` | Easy | | -| 1328 | [Break a Palindrome](/solution/1300-1399/1328.Break%20a%20Palindrome/README_EN.md) | `Greedy`,`String` | Medium | Biweekly Contest 18 | -| 1329 | [Sort the Matrix Diagonally](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README_EN.md) | `Array`,`Matrix`,`Sorting` | Medium | Biweekly Contest 18 | -| 1330 | [Reverse Subarray To Maximize Array Value](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README_EN.md) | `Greedy`,`Array`,`Math` | Hard | Biweekly Contest 18 | -| 1331 | [Rank Transform of an Array](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 18 | -| 1332 | [Remove Palindromic Subsequences](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 173 | -| 1333 | [Filter Restaurants by Vegan-Friendly, Price and Distance](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 173 | -| 1334 | [Find the City With the Smallest Number of Neighbors at a Threshold Distance](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README_EN.md) | `Graph`,`Dynamic Programming`,`Shortest Path` | Medium | Weekly Contest 173 | -| 1335 | [Minimum Difficulty of a Job Schedule](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 173 | -| 1336 | [Number of Transactions per Visit](/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README_EN.md) | `Database` | Hard | 🔒 | -| 1337 | [The K Weakest Rows in a Matrix](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Easy | Weekly Contest 174 | -| 1338 | [Reduce Array Size to The Half](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 174 | -| 1339 | [Maximum Product of Splitted Binary Tree](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 174 | -| 1340 | [Jump Game V](/solution/1300-1399/1340.Jump%20Game%20V/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 174 | -| 1341 | [Movie Rating](/solution/1300-1399/1341.Movie%20Rating/README_EN.md) | `Database` | Medium | | -| 1342 | [Number of Steps to Reduce a Number to Zero](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README_EN.md) | `Bit Manipulation`,`Math` | Easy | Biweekly Contest 19 | -| 1343 | [Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README_EN.md) | `Array`,`Sliding Window` | Medium | Biweekly Contest 19 | -| 1344 | [Angle Between Hands of a Clock](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README_EN.md) | `Math` | Medium | Biweekly Contest 19 | -| 1345 | [Jump Game IV](/solution/1300-1399/1345.Jump%20Game%20IV/README_EN.md) | `Breadth-First Search`,`Array`,`Hash Table` | Hard | Biweekly Contest 19 | -| 1346 | [Check If N and Its Double Exist](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | Weekly Contest 175 | -| 1347 | [Minimum Number of Steps to Make Two Strings Anagram](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 175 | -| 1348 | [Tweet Counts Per Frequency](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README_EN.md) | `Design`,`Hash Table`,`Binary Search`,`Ordered Set`,`Sorting` | Medium | Weekly Contest 175 | -| 1349 | [Maximum Students Taking Exam](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`,`Matrix` | Hard | Weekly Contest 175 | -| 1350 | [Students With Invalid Departments](/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README_EN.md) | `Database` | Easy | 🔒 | -| 1351 | [Count Negative Numbers in a Sorted Matrix](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Easy | Weekly Contest 176 | -| 1352 | [Product of the Last K Numbers](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README_EN.md) | `Design`,`Queue`,`Array`,`Math`,`Data Stream` | Medium | Weekly Contest 176 | -| 1353 | [Maximum Number of Events That Can Be Attended](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 176 | -| 1354 | [Construct Target Array With Multiple Sums](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README_EN.md) | `Array`,`Heap (Priority Queue)` | Hard | Weekly Contest 176 | -| 1355 | [Activity Participants](/solution/1300-1399/1355.Activity%20Participants/README_EN.md) | `Database` | Medium | 🔒 | -| 1356 | [Sort Integers by The Number of 1 Bits](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README_EN.md) | `Bit Manipulation`,`Array`,`Counting`,`Sorting` | Easy | Biweekly Contest 20 | -| 1357 | [Apply Discount Every n Orders](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README_EN.md) | `Design`,`Array`,`Hash Table` | Medium | Biweekly Contest 20 | -| 1358 | [Number of Substrings Containing All Three Characters](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Biweekly Contest 20 | -| 1359 | [Count All Valid Pickup and Delivery Options](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | Biweekly Contest 20 | -| 1360 | [Number of Days Between Two Dates](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 177 | -| 1361 | [Validate Binary Tree Nodes](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Binary Tree` | Medium | Weekly Contest 177 | -| 1362 | [Closest Divisors](/solution/1300-1399/1362.Closest%20Divisors/README_EN.md) | `Math` | Medium | Weekly Contest 177 | -| 1363 | [Largest Multiple of Three](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 177 | -| 1364 | [Number of Trusted Contacts of a Customer](/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README_EN.md) | `Database` | Medium | 🔒 | -| 1365 | [How Many Numbers Are Smaller Than the Current Number](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Easy | Weekly Contest 178 | -| 1366 | [Rank Teams by Votes](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 178 | -| 1367 | [Linked List in Binary Tree](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Linked List`,`Binary Tree` | Medium | Weekly Contest 178 | -| 1368 | [Minimum Cost to Make at Least One Valid Path in a Grid](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 178 | -| 1369 | [Get the Second Most Recent Activity](/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README_EN.md) | `Database` | Hard | 🔒 | -| 1370 | [Increasing Decreasing String](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 21 | -| 1371 | [Find the Longest Substring Containing Vowels in Even Counts](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Prefix Sum` | Medium | Biweekly Contest 21 | -| 1372 | [Longest ZigZag Path in a Binary Tree](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Medium | Biweekly Contest 21 | -| 1373 | [Maximum Sum BST in Binary Tree](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Dynamic Programming`,`Binary Tree` | Hard | Biweekly Contest 21 | -| 1374 | [Generate a String With Characters That Have Odd Counts](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README_EN.md) | `String` | Easy | Weekly Contest 179 | -| 1375 | [Number of Times Binary String Is Prefix-Aligned](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README_EN.md) | `Array` | Medium | Weekly Contest 179 | -| 1376 | [Time Needed to Inform All Employees](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search` | Medium | Weekly Contest 179 | -| 1377 | [Frog Position After T Seconds](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph` | Hard | Weekly Contest 179 | -| 1378 | [Replace Employee ID With The Unique Identifier](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README_EN.md) | `Database` | Easy | | -| 1379 | [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | -| 1380 | [Lucky Numbers in a Matrix](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 180 | -| 1381 | [Design a Stack With Increment Operation](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README_EN.md) | `Stack`,`Design`,`Array` | Medium | Weekly Contest 180 | -| 1382 | [Balance a Binary Search Tree](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README_EN.md) | `Greedy`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Divide and Conquer`,`Binary Tree` | Medium | Weekly Contest 180 | -| 1383 | [Maximum Performance of a Team](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 180 | -| 1384 | [Total Sales Amount by Year](/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README_EN.md) | `Database` | Hard | 🔒 | -| 1385 | [Find the Distance Value Between Two Arrays](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | Biweekly Contest 22 | -| 1386 | [Cinema Seat Allocation](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Hash Table` | Medium | Biweekly Contest 22 | -| 1387 | [Sort Integers by The Power Value](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README_EN.md) | `Memoization`,`Dynamic Programming`,`Sorting` | Medium | Biweekly Contest 22 | -| 1388 | [Pizza With 3n Slices](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Heap (Priority Queue)` | Hard | Biweekly Contest 22 | -| 1389 | [Create Target Array in the Given Order](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 181 | -| 1390 | [Four Divisors](/solution/1300-1399/1390.Four%20Divisors/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 181 | -| 1391 | [Check if There is a Valid Path in a Grid](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Weekly Contest 181 | -| 1392 | [Longest Happy Prefix](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 181 | -| 1393 | [Capital GainLoss](/solution/1300-1399/1393.Capital%20GainLoss/README_EN.md) | `Database` | Medium | | -| 1394 | [Find Lucky Integer in an Array](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 182 | -| 1395 | [Count Number of Teams](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README_EN.md) | `Binary Indexed Tree`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 182 | -| 1396 | [Design Underground System](/solution/1300-1399/1396.Design%20Underground%20System/README_EN.md) | `Design`,`Hash Table`,`String` | Medium | Weekly Contest 182 | -| 1397 | [Find All Good Strings](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README_EN.md) | `String`,`Dynamic Programming`,`String Matching` | Hard | Weekly Contest 182 | -| 1398 | [Customers Who Bought Products A and B but Not C](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README_EN.md) | `Database` | Medium | 🔒 | -| 1399 | [Count Largest Group](/solution/1300-1399/1399.Count%20Largest%20Group/README_EN.md) | `Hash Table`,`Math` | Easy | Biweekly Contest 23 | -| 1400 | [Construct K Palindrome Strings](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 23 | -| 1401 | [Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README_EN.md) | `Geometry`,`Math` | Medium | Biweekly Contest 23 | -| 1402 | [Reducing Dishes](/solution/1400-1499/1402.Reducing%20Dishes/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 23 | -| 1403 | [Minimum Subsequence in Non-Increasing Order](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 183 | -| 1404 | [Number of Steps to Reduce a Number in Binary Representation to One](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README_EN.md) | `Bit Manipulation`,`String` | Medium | Weekly Contest 183 | -| 1405 | [Longest Happy String](/solution/1400-1499/1405.Longest%20Happy%20String/README_EN.md) | `Greedy`,`String`,`Heap (Priority Queue)` | Medium | Weekly Contest 183 | -| 1406 | [Stone Game III](/solution/1400-1499/1406.Stone%20Game%20III/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Hard | Weekly Contest 183 | -| 1407 | [Top Travellers](/solution/1400-1499/1407.Top%20Travellers/README_EN.md) | `Database` | Easy | | -| 1408 | [String Matching in an Array](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README_EN.md) | `Array`,`String`,`String Matching` | Easy | Weekly Contest 184 | -| 1409 | [Queries on a Permutation With Key](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README_EN.md) | `Binary Indexed Tree`,`Array`,`Simulation` | Medium | Weekly Contest 184 | -| 1410 | [HTML Entity Parser](/solution/1400-1499/1410.HTML%20Entity%20Parser/README_EN.md) | `Hash Table`,`String` | Medium | Weekly Contest 184 | -| 1411 | [Number of Ways to Paint N × 3 Grid](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README_EN.md) | `Dynamic Programming` | Hard | Weekly Contest 184 | -| 1412 | [Find the Quiet Students in All Exams](/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README_EN.md) | `Database` | Hard | 🔒 | -| 1413 | [Minimum Value to Get Positive Step by Step Sum](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README_EN.md) | `Array`,`Prefix Sum` | Easy | Biweekly Contest 24 | -| 1414 | [Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README_EN.md) | `Greedy`,`Math` | Medium | Biweekly Contest 24 | -| 1415 | [The k-th Lexicographical String of All Happy Strings of Length n](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README_EN.md) | `String`,`Backtracking` | Medium | Biweekly Contest 24 | -| 1416 | [Restore The Array](/solution/1400-1499/1416.Restore%20The%20Array/README_EN.md) | `String`,`Dynamic Programming` | Hard | Biweekly Contest 24 | -| 1417 | [Reformat The String](/solution/1400-1499/1417.Reformat%20The%20String/README_EN.md) | `String` | Easy | Weekly Contest 185 | -| 1418 | [Display Table of Food Orders in a Restaurant](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README_EN.md) | `Array`,`Hash Table`,`String`,`Ordered Set`,`Sorting` | Medium | Weekly Contest 185 | -| 1419 | [Minimum Number of Frogs Croaking](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README_EN.md) | `String`,`Counting` | Medium | Weekly Contest 185 | -| 1420 | [Build Array Where You Can Find The Maximum Exactly K Comparisons](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README_EN.md) | `Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 185 | -| 1421 | [NPV Queries](/solution/1400-1499/1421.NPV%20Queries/README_EN.md) | `Database` | Easy | 🔒 | -| 1422 | [Maximum Score After Splitting a String](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README_EN.md) | `String`,`Prefix Sum` | Easy | Weekly Contest 186 | -| 1423 | [Maximum Points You Can Obtain from Cards](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README_EN.md) | `Array`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 186 | -| 1424 | [Diagonal Traverse II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 186 | -| 1425 | [Constrained Subsequence Sum](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | Weekly Contest 186 | -| 1426 | [Counting Elements](/solution/1400-1499/1426.Counting%20Elements/README_EN.md) | `Array`,`Hash Table` | Easy | 🔒 | -| 1427 | [Perform String Shifts](/solution/1400-1499/1427.Perform%20String%20Shifts/README_EN.md) | `Array`,`Math`,`String` | Easy | 🔒 | -| 1428 | [Leftmost Column with at Least a One](/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README_EN.md) | `Array`,`Binary Search`,`Interactive`,`Matrix` | Medium | 🔒 | -| 1429 | [First Unique Number](/solution/1400-1499/1429.First%20Unique%20Number/README_EN.md) | `Design`,`Queue`,`Array`,`Hash Table`,`Data Stream` | Medium | 🔒 | -| 1430 | [Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](/solution/1400-1499/1430.Check%20If%20a%20String%20Is%20a%20Valid%20Sequence%20from%20Root%20to%20Leaves%20Path%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | -| 1431 | [Kids With the Greatest Number of Candies](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README_EN.md) | `Array` | Easy | Biweekly Contest 25 | -| 1432 | [Max Difference You Can Get From Changing an Integer](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README_EN.md) | `Greedy`,`Math` | Medium | Biweekly Contest 25 | -| 1433 | [Check If a String Can Break Another String](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README_EN.md) | `Greedy`,`String`,`Sorting` | Medium | Biweekly Contest 25 | -| 1434 | [Number of Ways to Wear Different Hats to Each Other](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 25 | -| 1435 | [Create a Session Bar Chart](/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README_EN.md) | `Database` | Easy | 🔒 | -| 1436 | [Destination City](/solution/1400-1499/1436.Destination%20City/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 187 | -| 1437 | [Check If All 1's Are at Least Length K Places Away](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README_EN.md) | `Array` | Easy | Weekly Contest 187 | -| 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README_EN.md) | `Queue`,`Array`,`Ordered Set`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | Weekly Contest 187 | -| 1439 | [Find the Kth Smallest Sum of a Matrix With Sorted Rows](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README_EN.md) | `Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)` | Hard | Weekly Contest 187 | -| 1440 | [Evaluate Boolean Expression](/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README_EN.md) | `Database` | Medium | 🔒 | -| 1441 | [Build an Array With Stack Operations](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README_EN.md) | `Stack`,`Array`,`Simulation` | Medium | Weekly Contest 188 | -| 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Math`,`Prefix Sum` | Medium | Weekly Contest 188 | -| 1443 | [Minimum Time to Collect All Apples in a Tree](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table` | Medium | Weekly Contest 188 | -| 1444 | [Number of Ways of Cutting a Pizza](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 188 | -| 1445 | [Apples & Oranges](/solution/1400-1499/1445.Apples%20%26%20Oranges/README_EN.md) | `Database` | Medium | 🔒 | -| 1446 | [Consecutive Characters](/solution/1400-1499/1446.Consecutive%20Characters/README_EN.md) | `String` | Easy | Biweekly Contest 26 | -| 1447 | [Simplified Fractions](/solution/1400-1499/1447.Simplified%20Fractions/README_EN.md) | `Math`,`String`,`Number Theory` | Medium | Biweekly Contest 26 | -| 1448 | [Count Good Nodes in Binary Tree](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Biweekly Contest 26 | -| 1449 | [Form Largest Integer With Digits That Add up to Target](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 26 | -| 1450 | [Number of Students Doing Homework at a Given Time](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README_EN.md) | `Array` | Easy | Weekly Contest 189 | -| 1451 | [Rearrange Words in a Sentence](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README_EN.md) | `String`,`Sorting` | Medium | Weekly Contest 189 | -| 1452 | [People Whose List of Favorite Companies Is Not a Subset of Another List](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 189 | -| 1453 | [Maximum Number of Darts Inside of a Circular Dartboard](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README_EN.md) | `Geometry`,`Array`,`Math` | Hard | Weekly Contest 189 | -| 1454 | [Active Users](/solution/1400-1499/1454.Active%20Users/README_EN.md) | `Database` | Medium | 🔒 | -| 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README_EN.md) | `Two Pointers`,`String`,`String Matching` | Easy | Weekly Contest 190 | -| 1456 | [Maximum Number of Vowels in a Substring of Given Length](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README_EN.md) | `String`,`Sliding Window` | Medium | Weekly Contest 190 | -| 1457 | [Pseudo-Palindromic Paths in a Binary Tree](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 190 | -| 1458 | [Max Dot Product of Two Subsequences](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 190 | -| 1459 | [Rectangles Area](/solution/1400-1499/1459.Rectangles%20Area/README_EN.md) | `Database` | Medium | 🔒 | -| 1460 | [Make Two Arrays Equal by Reversing Subarrays](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 27 | -| 1461 | [Check If a String Contains All Binary Codes of Size K](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Hash Function`,`Rolling Hash` | Medium | Biweekly Contest 27 | -| 1462 | [Course Schedule IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | Biweekly Contest 27 | -| 1463 | [Cherry Pickup II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 27 | -| 1464 | [Maximum Product of Two Elements in an Array](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Easy | Weekly Contest 191 | -| 1465 | [Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 191 | -| 1466 | [Reorder Routes to Make All Paths Lead to the City Zero](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 191 | -| 1467 | [Probability of a Two Boxes Having The Same Number of Distinct Balls](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Backtracking`,`Combinatorics`,`Probability and Statistics` | Hard | Weekly Contest 191 | -| 1468 | [Calculate Salaries](/solution/1400-1499/1468.Calculate%20Salaries/README_EN.md) | `Database` | Medium | 🔒 | -| 1469 | [Find All The Lonely Nodes](/solution/1400-1499/1469.Find%20All%20The%20Lonely%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | 🔒 | -| 1470 | [Shuffle the Array](/solution/1400-1499/1470.Shuffle%20the%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 192 | -| 1471 | [The k Strongest Values in an Array](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 192 | -| 1472 | [Design Browser History](/solution/1400-1499/1472.Design%20Browser%20History/README_EN.md) | `Stack`,`Design`,`Array`,`Linked List`,`Data Stream`,`Doubly-Linked List` | Medium | Weekly Contest 192 | -| 1473 | [Paint House III](/solution/1400-1499/1473.Paint%20House%20III/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 192 | -| 1474 | [Delete N Nodes After M Nodes of a Linked List](/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README_EN.md) | `Linked List` | Easy | 🔒 | -| 1475 | [Final Prices With a Special Discount in a Shop](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Easy | Biweekly Contest 28 | -| 1476 | [Subrectangle Queries](/solution/1400-1499/1476.Subrectangle%20Queries/README_EN.md) | `Design`,`Array`,`Matrix` | Medium | Biweekly Contest 28 | -| 1477 | [Find Two Non-overlapping Sub-arrays Each With Target Sum](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sliding Window` | Medium | Biweekly Contest 28 | -| 1478 | [Allocate Mailboxes](/solution/1400-1499/1478.Allocate%20Mailboxes/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 28 | -| 1479 | [Sales by Day of the Week](/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README_EN.md) | `Database` | Hard | 🔒 | -| 1480 | [Running Sum of 1d Array](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README_EN.md) | `Array`,`Prefix Sum` | Easy | Weekly Contest 193 | -| 1481 | [Least Number of Unique Integers after K Removals](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Weekly Contest 193 | -| 1482 | [Minimum Number of Days to Make m Bouquets](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 193 | -| 1483 | [Kth Ancestor of a Tree Node](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 193 | -| 1484 | [Group Sold Products By The Date](/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README_EN.md) | `Database` | Easy | | -| 1485 | [Clone Binary Tree With Random Pointer](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 | -| 1486 | [XOR Operation in an Array](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README_EN.md) | `Bit Manipulation`,`Math` | Easy | Weekly Contest 194 | -| 1487 | [Making File Names Unique](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 194 | -| 1488 | [Avoid Flood in The City](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Binary Search`,`Heap (Priority Queue)` | Medium | Weekly Contest 194 | -| 1489 | [Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README_EN.md) | `Union Find`,`Graph`,`Minimum Spanning Tree`,`Sorting`,`Strongly Connected Component` | Hard | Weekly Contest 194 | -| 1490 | [Clone N-ary Tree](/solution/1400-1499/1490.Clone%20N-ary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table` | Medium | 🔒 | -| 1491 | [Average Salary Excluding the Minimum and Maximum Salary](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README_EN.md) | `Array`,`Sorting` | Easy | Biweekly Contest 29 | -| 1492 | [The kth Factor of n](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README_EN.md) | `Math`,`Number Theory` | Medium | Biweekly Contest 29 | -| 1493 | [Longest Subarray of 1's After Deleting One Element](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | Biweekly Contest 29 | -| 1494 | [Parallel Courses II](/solution/1400-1499/1494.Parallel%20Courses%20II/README_EN.md) | `Bit Manipulation`,`Graph`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 29 | -| 1495 | [Friendly Movies Streamed Last Month](/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README_EN.md) | `Database` | Easy | 🔒 | -| 1496 | [Path Crossing](/solution/1400-1499/1496.Path%20Crossing/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 195 | -| 1497 | [Check If Array Pairs Are Divisible by k](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 195 | -| 1498 | [Number of Subsequences That Satisfy the Given Sum Condition](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Weekly Contest 195 | -| 1499 | [Max Value of Equation](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README_EN.md) | `Queue`,`Array`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | Weekly Contest 195 | -| 1500 | [Design a File Sharing System](/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README_EN.md) | `Design`,`Hash Table`,`Data Stream`,`Heap (Priority Queue)` | Medium | 🔒 | -| 1501 | [Countries You Can Safely Invest In](/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README_EN.md) | `Database` | Medium | 🔒 | -| 1502 | [Can Make Arithmetic Progression From Sequence](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 196 | -| 1503 | [Last Moment Before All Ants Fall Out of a Plank](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README_EN.md) | `Brainteaser`,`Array`,`Simulation` | Medium | Weekly Contest 196 | -| 1504 | [Count Submatrices With All Ones](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Matrix`,`Monotonic Stack` | Medium | Weekly Contest 196 | -| 1505 | [Minimum Possible Integer After at Most K Adjacent Swaps On Digits](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README_EN.md) | `Greedy`,`Binary Indexed Tree`,`Segment Tree`,`String` | Hard | Weekly Contest 196 | -| 1506 | [Find Root of N-Ary Tree](/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Hash Table` | Medium | 🔒 | -| 1507 | [Reformat Date](/solution/1500-1599/1507.Reformat%20Date/README_EN.md) | `String` | Easy | Biweekly Contest 30 | -| 1508 | [Range Sum of Sorted Subarray Sums](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 30 | -| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 30 | -| 1510 | [Stone Game IV](/solution/1500-1599/1510.Stone%20Game%20IV/README_EN.md) | `Math`,`Dynamic Programming`,`Game Theory` | Hard | Biweekly Contest 30 | -| 1511 | [Customer Order Frequency](/solution/1500-1599/1511.Customer%20Order%20Frequency/README_EN.md) | `Database` | Easy | 🔒 | -| 1512 | [Number of Good Pairs](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting` | Easy | Weekly Contest 197 | -| 1513 | [Number of Substrings With Only 1s](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README_EN.md) | `Math`,`String` | Medium | Weekly Contest 197 | -| 1514 | [Path with Maximum Probability](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Weekly Contest 197 | -| 1515 | [Best Position for a Service Centre](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README_EN.md) | `Geometry`,`Math`,`Randomized` | Hard | Weekly Contest 197 | -| 1516 | [Move Sub-Tree of N-Ary Tree](/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README_EN.md) | `Tree`,`Depth-First Search` | Hard | 🔒 | -| 1517 | [Find Users With Valid E-Mails](/solution/1500-1599/1517.Find%20Users%20With%20Valid%20E-Mails/README_EN.md) | `Database` | Easy | | -| 1518 | [Water Bottles](/solution/1500-1599/1518.Water%20Bottles/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 198 | -| 1519 | [Number of Nodes in the Sub-Tree With the Same Label](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Counting` | Medium | Weekly Contest 198 | -| 1520 | [Maximum Number of Non-Overlapping Substrings](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README_EN.md) | `Greedy`,`String` | Hard | Weekly Contest 198 | -| 1521 | [Find a Value of a Mysterious Function Closest to Target](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README_EN.md) | `Bit Manipulation`,`Segment Tree`,`Array`,`Binary Search` | Hard | Weekly Contest 198 | -| 1522 | [Diameter of N-Ary Tree](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README_EN.md) | `Tree`,`Depth-First Search` | Medium | 🔒 | -| 1523 | [Count Odd Numbers in an Interval Range](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README_EN.md) | `Math` | Easy | Biweekly Contest 31 | -| 1524 | [Number of Sub-arrays With Odd Sum](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 31 | -| 1525 | [Number of Good Ways to Split a String](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 31 | -| 1526 | [Minimum Number of Increments on Subarrays to Form a Target Array](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README_EN.md) | `Stack`,`Greedy`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Hard | Biweekly Contest 31 | -| 1527 | [Patients With a Condition](/solution/1500-1599/1527.Patients%20With%20a%20Condition/README_EN.md) | `Database` | Easy | | -| 1528 | [Shuffle String](/solution/1500-1599/1528.Shuffle%20String/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 199 | -| 1529 | [Minimum Suffix Flips](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 199 | -| 1530 | [Number of Good Leaf Nodes Pairs](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 199 | -| 1531 | [String Compression II](/solution/1500-1599/1531.String%20Compression%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 199 | -| 1532 | [The Most Recent Three Orders](/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README_EN.md) | `Database` | Medium | 🔒 | -| 1533 | [Find the Index of the Large Integer](/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README_EN.md) | `Array`,`Binary Search`,`Interactive` | Medium | 🔒 | -| 1534 | [Count Good Triplets](/solution/1500-1599/1534.Count%20Good%20Triplets/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 200 | -| 1535 | [Find the Winner of an Array Game](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 200 | -| 1536 | [Minimum Swaps to Arrange a Binary Grid](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | Weekly Contest 200 | -| 1537 | [Get the Maximum Score](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Dynamic Programming` | Hard | Weekly Contest 200 | -| 1538 | [Guess the Majority in a Hidden Array](/solution/1500-1599/1538.Guess%20the%20Majority%20in%20a%20Hidden%20Array/README_EN.md) | `Array`,`Math`,`Interactive` | Medium | 🔒 | -| 1539 | [Kth Missing Positive Number](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README_EN.md) | `Array`,`Binary Search` | Easy | Biweekly Contest 32 | -| 1540 | [Can Convert String in K Moves](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README_EN.md) | `Hash Table`,`String` | Medium | Biweekly Contest 32 | -| 1541 | [Minimum Insertions to Balance a Parentheses String](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README_EN.md) | `Stack`,`Greedy`,`String` | Medium | Biweekly Contest 32 | -| 1542 | [Find Longest Awesome Substring](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String` | Hard | Biweekly Contest 32 | -| 1543 | [Fix Product Name Format](/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README_EN.md) | `Database` | Easy | 🔒 | -| 1544 | [Make The String Great](/solution/1500-1599/1544.Make%20The%20String%20Great/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 201 | -| 1545 | [Find Kth Bit in Nth Binary String](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README_EN.md) | `Recursion`,`String`,`Simulation` | Medium | Weekly Contest 201 | -| 1546 | [Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 201 | -| 1547 | [Minimum Cost to Cut a Stick](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 201 | -| 1548 | [The Most Similar Path in a Graph](/solution/1500-1599/1548.The%20Most%20Similar%20Path%20in%20a%20Graph/README_EN.md) | `Graph`,`Dynamic Programming` | Hard | 🔒 | -| 1549 | [The Most Recent Orders for Each Product](/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README_EN.md) | `Database` | Medium | 🔒 | -| 1550 | [Three Consecutive Odds](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README_EN.md) | `Array` | Easy | Weekly Contest 202 | -| 1551 | [Minimum Operations to Make Array Equal](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README_EN.md) | `Math` | Medium | Weekly Contest 202 | -| 1552 | [Magnetic Force Between Two Balls](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Medium | Weekly Contest 202 | -| 1553 | [Minimum Number of Days to Eat N Oranges](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README_EN.md) | `Memoization`,`Dynamic Programming` | Hard | Weekly Contest 202 | -| 1554 | [Strings Differ by One Character](/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README_EN.md) | `Hash Table`,`String`,`Hash Function`,`Rolling Hash` | Medium | 🔒 | -| 1555 | [Bank Account Summary](/solution/1500-1599/1555.Bank%20Account%20Summary/README_EN.md) | `Database` | Medium | 🔒 | -| 1556 | [Thousand Separator](/solution/1500-1599/1556.Thousand%20Separator/README_EN.md) | `String` | Easy | Biweekly Contest 33 | -| 1557 | [Minimum Number of Vertices to Reach All Nodes](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README_EN.md) | `Graph` | Medium | Biweekly Contest 33 | -| 1558 | [Minimum Numbers of Function Calls to Make Target Array](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array` | Medium | Biweekly Contest 33 | -| 1559 | [Detect Cycles in 2D Grid](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Biweekly Contest 33 | -| 1560 | [Most Visited Sector in a Circular Track](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 203 | -| 1561 | [Maximum Number of Coins You Can Get](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README_EN.md) | `Greedy`,`Array`,`Math`,`Game Theory`,`Sorting` | Medium | Weekly Contest 203 | -| 1562 | [Find Latest Group of Size M](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README_EN.md) | `Array`,`Binary Search`,`Simulation` | Medium | Weekly Contest 203 | -| 1563 | [Stone Game V](/solution/1500-1599/1563.Stone%20Game%20V/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Hard | Weekly Contest 203 | -| 1564 | [Put Boxes Into the Warehouse I](/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | -| 1565 | [Unique Orders and Customers Per Month](/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README_EN.md) | `Database` | Easy | 🔒 | -| 1566 | [Detect Pattern of Length M Repeated K or More Times](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 204 | -| 1567 | [Maximum Length of Subarray With Positive Product](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 204 | -| 1568 | [Minimum Number of Days to Disconnect Island](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`,`Strongly Connected Component` | Hard | Weekly Contest 204 | -| 1569 | [Number of Ways to Reorder Array to Get Same BST](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README_EN.md) | `Tree`,`Union Find`,`Binary Search Tree`,`Memoization`,`Array`,`Math`,`Divide and Conquer`,`Dynamic Programming`,`Binary Tree`,`Combinatorics` | Hard | Weekly Contest 204 | -| 1570 | [Dot Product of Two Sparse Vectors](/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README_EN.md) | `Design`,`Array`,`Hash Table`,`Two Pointers` | Medium | 🔒 | -| 1571 | [Warehouse Manager](/solution/1500-1599/1571.Warehouse%20Manager/README_EN.md) | `Database` | Easy | 🔒 | -| 1572 | [Matrix Diagonal Sum](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README_EN.md) | `Array`,`Matrix` | Easy | Biweekly Contest 34 | -| 1573 | [Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README_EN.md) | `Math`,`String` | Medium | Biweekly Contest 34 | -| 1574 | [Shortest Subarray to be Removed to Make Array Sorted](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README_EN.md) | `Stack`,`Array`,`Two Pointers`,`Binary Search`,`Monotonic Stack` | Medium | Biweekly Contest 34 | -| 1575 | [Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 34 | -| 1576 | [Replace All 's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md) | `String` | Easy | Weekly Contest 205 | -| 1577 | [Number of Ways Where Square of Number Is Equal to Product of Two Numbers](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README_EN.md) | `Array`,`Hash Table`,`Math`,`Two Pointers` | Medium | Weekly Contest 205 | -| 1578 | [Minimum Time to Make Rope Colorful](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README_EN.md) | `Greedy`,`Array`,`String`,`Dynamic Programming` | Medium | Weekly Contest 205 | -| 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README_EN.md) | `Union Find`,`Graph` | Hard | Weekly Contest 205 | -| 1580 | [Put Boxes Into the Warehouse II](/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | -| 1581 | [Customer Who Visited but Did Not Make Any Transactions](/solution/1500-1599/1581.Customer%20Who%20Visited%20but%20Did%20Not%20Make%20Any%20Transactions/README_EN.md) | `Database` | Easy | | -| 1582 | [Special Positions in a Binary Matrix](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 206 | -| 1583 | [Count Unhappy Friends](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 206 | -| 1584 | [Min Cost to Connect All Points](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README_EN.md) | `Union Find`,`Graph`,`Array`,`Minimum Spanning Tree` | Medium | Weekly Contest 206 | -| 1585 | [Check If String Is Transformable With Substring Sort Operations](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README_EN.md) | `Greedy`,`String`,`Sorting` | Hard | Weekly Contest 206 | -| 1586 | [Binary Search Tree Iterator II](/solution/1500-1599/1586.Binary%20Search%20Tree%20Iterator%20II/README_EN.md) | `Stack`,`Tree`,`Design`,`Binary Search Tree`,`Binary Tree`,`Iterator` | Medium | 🔒 | -| 1587 | [Bank Account Summary II](/solution/1500-1599/1587.Bank%20Account%20Summary%20II/README_EN.md) | `Database` | Easy | | -| 1588 | [Sum of All Odd Length Subarrays](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README_EN.md) | `Array`,`Math`,`Prefix Sum` | Easy | Biweekly Contest 35 | -| 1589 | [Maximum Sum Obtained of Any Permutation](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 35 | -| 1590 | [Make Sum Divisible by P](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Biweekly Contest 35 | -| 1591 | [Strange Printer II](/solution/1500-1599/1591.Strange%20Printer%20II/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Matrix` | Hard | Biweekly Contest 35 | -| 1592 | [Rearrange Spaces Between Words](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README_EN.md) | `String` | Easy | Weekly Contest 207 | -| 1593 | [Split a String Into the Max Number of Unique Substrings](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README_EN.md) | `Hash Table`,`String`,`Backtracking` | Medium | Weekly Contest 207 | -| 1594 | [Maximum Non Negative Product in a Matrix](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 207 | -| 1595 | [Minimum Cost to Connect Two Groups of Points](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`,`Matrix` | Hard | Weekly Contest 207 | -| 1596 | [The Most Frequently Ordered Products for Each Customer](/solution/1500-1599/1596.The%20Most%20Frequently%20Ordered%20Products%20for%20Each%20Customer/README_EN.md) | `Database` | Medium | 🔒 | -| 1597 | [Build Binary Expression Tree From Infix Expression](/solution/1500-1599/1597.Build%20Binary%20Expression%20Tree%20From%20Infix%20Expression/README_EN.md) | `Stack`,`Tree`,`String`,`Binary Tree` | Hard | 🔒 | -| 1598 | [Crawler Log Folder](/solution/1500-1599/1598.Crawler%20Log%20Folder/README_EN.md) | `Stack`,`Array`,`String` | Easy | Weekly Contest 208 | -| 1599 | [Maximum Profit of Operating a Centennial Wheel](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 208 | -| 1600 | [Throne Inheritance](/solution/1600-1699/1600.Throne%20Inheritance/README_EN.md) | `Tree`,`Depth-First Search`,`Design`,`Hash Table` | Medium | Weekly Contest 208 | -| 1601 | [Maximum Number of Achievable Transfer Requests](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Hard | Weekly Contest 208 | -| 1602 | [Find Nearest Right Node in Binary Tree](/solution/1600-1699/1602.Find%20Nearest%20Right%20Node%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | -| 1603 | [Design Parking System](/solution/1600-1699/1603.Design%20Parking%20System/README_EN.md) | `Design`,`Counting`,`Simulation` | Easy | Biweekly Contest 36 | -| 1604 | [Alert Using Same Key-Card Three or More Times in a One Hour Period](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Biweekly Contest 36 | -| 1605 | [Find Valid Matrix Given Row and Column Sums](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | Biweekly Contest 36 | -| 1606 | [Find Servers That Handled Most Number of Requests](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README_EN.md) | `Greedy`,`Array`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Biweekly Contest 36 | -| 1607 | [Sellers With No Sales](/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README_EN.md) | `Database` | Easy | 🔒 | -| 1608 | [Special Array With X Elements Greater Than or Equal X](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Easy | Weekly Contest 209 | -| 1609 | [Even Odd Tree](/solution/1600-1699/1609.Even%20Odd%20Tree/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 209 | -| 1610 | [Maximum Number of Visible Points](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README_EN.md) | `Geometry`,`Array`,`Math`,`Sorting`,`Sliding Window` | Hard | Weekly Contest 209 | -| 1611 | [Minimum One Bit Operations to Make Integers Zero](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README_EN.md) | `Bit Manipulation`,`Memoization`,`Dynamic Programming` | Hard | Weekly Contest 209 | -| 1612 | [Check If Two Expression Trees are Equivalent](/solution/1600-1699/1612.Check%20If%20Two%20Expression%20Trees%20are%20Equivalent/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree`,`Counting` | Medium | 🔒 | -| 1613 | [Find the Missing IDs](/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README_EN.md) | `Database` | Medium | 🔒 | -| 1614 | [Maximum Nesting Depth of the Parentheses](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 210 | -| 1615 | [Maximal Network Rank](/solution/1600-1699/1615.Maximal%20Network%20Rank/README_EN.md) | `Graph` | Medium | Weekly Contest 210 | -| 1616 | [Split Two Strings to Make Palindrome](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README_EN.md) | `Two Pointers`,`String` | Medium | Weekly Contest 210 | -| 1617 | [Count Subtrees With Max Distance Between Cities](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README_EN.md) | `Bit Manipulation`,`Tree`,`Dynamic Programming`,`Bitmask`,`Enumeration` | Hard | Weekly Contest 210 | -| 1618 | [Maximum Font to Fit a Sentence in a Screen](/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README_EN.md) | `Array`,`String`,`Binary Search`,`Interactive` | Medium | 🔒 | -| 1619 | [Mean of Array After Removing Some Elements](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README_EN.md) | `Array`,`Sorting` | Easy | Biweekly Contest 37 | -| 1620 | [Coordinate With Maximum Network Quality](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README_EN.md) | `Array`,`Enumeration` | Medium | Biweekly Contest 37 | -| 1621 | [Number of Sets of K Non-Overlapping Line Segments](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | Biweekly Contest 37 | -| 1622 | [Fancy Sequence](/solution/1600-1699/1622.Fancy%20Sequence/README_EN.md) | `Design`,`Segment Tree`,`Math` | Hard | Biweekly Contest 37 | -| 1623 | [All Valid Triplets That Can Represent a Country](/solution/1600-1699/1623.All%20Valid%20Triplets%20That%20Can%20Represent%20a%20Country/README_EN.md) | `Database` | Easy | 🔒 | -| 1624 | [Largest Substring Between Two Equal Characters](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 211 | -| 1625 | [Lexicographically Smallest String After Applying Operations](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`String`,`Enumeration` | Medium | Weekly Contest 211 | -| 1626 | [Best Team With No Conflicts](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 211 | -| 1627 | [Graph Connectivity With Threshold](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README_EN.md) | `Union Find`,`Array`,`Math`,`Number Theory` | Hard | Weekly Contest 211 | -| 1628 | [Design an Expression Tree With Evaluate Function](/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README_EN.md) | `Stack`,`Tree`,`Design`,`Array`,`Math`,`Binary Tree` | Medium | 🔒 | -| 1629 | [Slowest Key](/solution/1600-1699/1629.Slowest%20Key/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 212 | -| 1630 | [Arithmetic Subarrays](/solution/1600-1699/1630.Arithmetic%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 212 | -| 1631 | [Path With Minimum Effort](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)` | Medium | Weekly Contest 212 | -| 1632 | [Rank Transform of a Matrix](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README_EN.md) | `Union Find`,`Graph`,`Topological Sort`,`Array`,`Matrix`,`Sorting` | Hard | Weekly Contest 212 | -| 1633 | [Percentage of Users Attended a Contest](/solution/1600-1699/1633.Percentage%20of%20Users%20Attended%20a%20Contest/README_EN.md) | `Database` | Easy | | -| 1634 | [Add Two Polynomials Represented as Linked Lists](/solution/1600-1699/1634.Add%20Two%20Polynomials%20Represented%20as%20Linked%20Lists/README_EN.md) | `Linked List`,`Math`,`Two Pointers` | Medium | 🔒 | -| 1635 | [Hopper Company Queries I](/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README_EN.md) | `Database` | Hard | 🔒 | -| 1636 | [Sort Array by Increasing Frequency](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 38 | -| 1637 | [Widest Vertical Area Between Two Points Containing No Points](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README_EN.md) | `Array`,`Sorting` | Easy | Biweekly Contest 38 | -| 1638 | [Count Substrings That Differ by One Character](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming`,`Enumeration` | Medium | Biweekly Contest 38 | -| 1639 | [Number of Ways to Form a Target String Given a Dictionary](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Hard | Biweekly Contest 38 | -| 1640 | [Check Array Formation Through Concatenation](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 213 | -| 1641 | [Count Sorted Vowel Strings](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | Weekly Contest 213 | -| 1642 | [Furthest Building You Can Reach](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 213 | -| 1643 | [Kth Smallest Instructions](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 213 | -| 1644 | [Lowest Common Ancestor of a Binary Tree II](/solution/1600-1699/1644.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | -| 1645 | [Hopper Company Queries II](/solution/1600-1699/1645.Hopper%20Company%20Queries%20II/README_EN.md) | `Database` | Hard | 🔒 | -| 1646 | [Get Maximum in Generated Array](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 214 | -| 1647 | [Minimum Deletions to Make Character Frequencies Unique](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 214 | -| 1648 | [Sell Diminishing-Valued Colored Balls](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 214 | -| 1649 | [Create Sorted Array through Instructions](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | Weekly Contest 214 | -| 1650 | [Lowest Common Ancestor of a Binary Tree III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README_EN.md) | `Tree`,`Hash Table`,`Two Pointers`,`Binary Tree` | Medium | 🔒 | -| 1651 | [Hopper Company Queries III](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README_EN.md) | `Database` | Hard | 🔒 | -| 1652 | [Defuse the Bomb](/solution/1600-1699/1652.Defuse%20the%20Bomb/README_EN.md) | `Array`,`Sliding Window` | Easy | Biweekly Contest 39 | -| 1653 | [Minimum Deletions to Make String Balanced](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README_EN.md) | `Stack`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 39 | -| 1654 | [Minimum Jumps to Reach Home](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming` | Medium | Biweekly Contest 39 | -| 1655 | [Distribute Repeating Integers](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | Biweekly Contest 39 | -| 1656 | [Design an Ordered Stream](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README_EN.md) | `Design`,`Array`,`Hash Table`,`Data Stream` | Easy | Weekly Contest 215 | -| 1657 | [Determine if Two Strings Are Close](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README_EN.md) | `Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 215 | -| 1658 | [Minimum Operations to Reduce X to Zero](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 215 | -| 1659 | [Maximize Grid Happiness](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README_EN.md) | `Bit Manipulation`,`Memoization`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 215 | -| 1660 | [Correct a Binary Tree](/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 | -| 1661 | [Average Time of Process per Machine](/solution/1600-1699/1661.Average%20Time%20of%20Process%20per%20Machine/README_EN.md) | `Database` | Easy | | -| 1662 | [Check If Two String Arrays are Equivalent](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 216 | -| 1663 | [Smallest String With A Given Numeric Value](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 216 | -| 1664 | [Ways to Make a Fair Array](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 216 | -| 1665 | [Minimum Initial Energy to Finish Tasks](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Weekly Contest 216 | -| 1666 | [Change the Root of a Binary Tree](/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | -| 1667 | [Fix Names in a Table](/solution/1600-1699/1667.Fix%20Names%20in%20a%20Table/README_EN.md) | `Database` | Easy | | -| 1668 | [Maximum Repeating Substring](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README_EN.md) | `String`,`Dynamic Programming`,`String Matching` | Easy | Biweekly Contest 40 | -| 1669 | [Merge In Between Linked Lists](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README_EN.md) | `Linked List` | Medium | Biweekly Contest 40 | -| 1670 | [Design Front Middle Back Queue](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README_EN.md) | `Design`,`Queue`,`Array`,`Linked List`,`Data Stream` | Medium | Biweekly Contest 40 | -| 1671 | [Minimum Number of Removals to Make Mountain Array](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Dynamic Programming` | Hard | Biweekly Contest 40 | -| 1672 | [Richest Customer Wealth](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 217 | -| 1673 | [Find the Most Competitive Subsequence](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README_EN.md) | `Stack`,`Greedy`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 217 | -| 1674 | [Minimum Moves to Make Array Complementary](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 217 | -| 1675 | [Minimize Deviation in Array](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README_EN.md) | `Greedy`,`Array`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Weekly Contest 217 | -| 1676 | [Lowest Common Ancestor of a Binary Tree IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 | -| 1677 | [Product's Worth Over Invoices](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README_EN.md) | `Database` | Easy | 🔒 | -| 1678 | [Goal Parser Interpretation](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README_EN.md) | `String` | Easy | Weekly Contest 218 | -| 1679 | [Max Number of K-Sum Pairs](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 218 | -| 1680 | [Concatenation of Consecutive Binary Numbers](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README_EN.md) | `Bit Manipulation`,`Math`,`Simulation` | Medium | Weekly Contest 218 | -| 1681 | [Minimum Incompatibility](/solution/1600-1699/1681.Minimum%20Incompatibility/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 218 | -| 1682 | [Longest Palindromic Subsequence II](/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README_EN.md) | `String`,`Dynamic Programming` | Medium | 🔒 | -| 1683 | [Invalid Tweets](/solution/1600-1699/1683.Invalid%20Tweets/README_EN.md) | `Database` | Easy | | -| 1684 | [Count the Number of Consistent Strings](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String` | Easy | Biweekly Contest 41 | -| 1685 | [Sum of Absolute Differences in a Sorted Array](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README_EN.md) | `Array`,`Math`,`Prefix Sum` | Medium | Biweekly Contest 41 | -| 1686 | [Stone Game VI](/solution/1600-1699/1686.Stone%20Game%20VI/README_EN.md) | `Greedy`,`Array`,`Math`,`Game Theory`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 41 | -| 1687 | [Delivering Boxes from Storage to Ports](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README_EN.md) | `Segment Tree`,`Queue`,`Array`,`Dynamic Programming`,`Prefix Sum`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | Biweekly Contest 41 | -| 1688 | [Count of Matches in Tournament](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 219 | -| 1689 | [Partitioning Into Minimum Number Of Deci-Binary Numbers](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 219 | -| 1690 | [Stone Game VII](/solution/1600-1699/1690.Stone%20Game%20VII/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | Weekly Contest 219 | -| 1691 | [Maximum Height by Stacking Cuboids](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 219 | -| 1692 | [Count Ways to Distribute Candies](/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README_EN.md) | `Dynamic Programming` | Hard | 🔒 | -| 1693 | [Daily Leads and Partners](/solution/1600-1699/1693.Daily%20Leads%20and%20Partners/README_EN.md) | `Database` | Easy | | -| 1694 | [Reformat Phone Number](/solution/1600-1699/1694.Reformat%20Phone%20Number/README_EN.md) | `String` | Easy | Weekly Contest 220 | -| 1695 | [Maximum Erasure Value](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 220 | -| 1696 | [Jump Game VI](/solution/1600-1699/1696.Jump%20Game%20VI/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | Weekly Contest 220 | -| 1697 | [Checking Existence of Edge Length Limited Paths](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README_EN.md) | `Union Find`,`Graph`,`Array`,`Two Pointers`,`Sorting` | Hard | Weekly Contest 220 | -| 1698 | [Number of Distinct Substrings in a String](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README_EN.md) | `Trie`,`String`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Medium | 🔒 | -| 1699 | [Number of Calls Between Two Persons](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README_EN.md) | `Database` | Medium | 🔒 | -| 1700 | [Number of Students Unable to Eat Lunch](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README_EN.md) | `Stack`,`Queue`,`Array`,`Simulation` | Easy | Biweekly Contest 42 | -| 1701 | [Average Waiting Time](/solution/1700-1799/1701.Average%20Waiting%20Time/README_EN.md) | `Array`,`Simulation` | Medium | Biweekly Contest 42 | -| 1702 | [Maximum Binary String After Change](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README_EN.md) | `Greedy`,`String` | Medium | Biweekly Contest 42 | -| 1703 | [Minimum Adjacent Swaps for K Consecutive Ones](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sliding Window` | Hard | Biweekly Contest 42 | -| 1704 | [Determine if String Halves Are Alike](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README_EN.md) | `String`,`Counting` | Easy | Weekly Contest 221 | -| 1705 | [Maximum Number of Eaten Apples](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 221 | -| 1706 | [Where Will the Ball Fall](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 221 | -| 1707 | [Maximum XOR With an Element From Array](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README_EN.md) | `Bit Manipulation`,`Trie`,`Array` | Hard | Weekly Contest 221 | -| 1708 | [Largest Subarray Length K](/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README_EN.md) | `Greedy`,`Array` | Easy | 🔒 | -| 1709 | [Biggest Window Between Visits](/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README_EN.md) | `Database` | Medium | 🔒 | -| 1710 | [Maximum Units on a Truck](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 222 | -| 1711 | [Count Good Meals](/solution/1700-1799/1711.Count%20Good%20Meals/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 222 | -| 1712 | [Ways to Split Array Into Three Subarrays](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Prefix Sum` | Medium | Weekly Contest 222 | -| 1713 | [Minimum Operations to Make a Subsequence](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Binary Search` | Hard | Weekly Contest 222 | -| 1714 | [Sum Of Special Evenly-Spaced Elements In Array](/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | -| 1715 | [Count Apples and Oranges](/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README_EN.md) | `Database` | Medium | 🔒 | -| 1716 | [Calculate Money in Leetcode Bank](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README_EN.md) | `Math` | Easy | Biweekly Contest 43 | -| 1717 | [Maximum Score From Removing Substrings](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README_EN.md) | `Stack`,`Greedy`,`String` | Medium | Biweekly Contest 43 | -| 1718 | [Construct the Lexicographically Largest Valid Sequence](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README_EN.md) | `Array`,`Backtracking` | Medium | Biweekly Contest 43 | -| 1719 | [Number Of Ways To Reconstruct A Tree](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README_EN.md) | `Tree`,`Graph` | Hard | Biweekly Contest 43 | -| 1720 | [Decode XORed Array](/solution/1700-1799/1720.Decode%20XORed%20Array/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 223 | -| 1721 | [Swapping Nodes in a Linked List](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | Weekly Contest 223 | -| 1722 | [Minimize Hamming Distance After Swap Operations](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README_EN.md) | `Depth-First Search`,`Union Find`,`Array` | Medium | Weekly Contest 223 | -| 1723 | [Find Minimum Time to Finish All Jobs](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | Weekly Contest 223 | -| 1724 | [Checking Existence of Edge Length Limited Paths II](/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README_EN.md) | `Union Find`,`Graph`,`Minimum Spanning Tree` | Hard | 🔒 | -| 1725 | [Number Of Rectangles That Can Form The Largest Square](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README_EN.md) | `Array` | Easy | Weekly Contest 224 | -| 1726 | [Tuple with Same Product](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 224 | -| 1727 | [Largest Submatrix With Rearrangements](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README_EN.md) | `Greedy`,`Array`,`Matrix`,`Sorting` | Medium | Weekly Contest 224 | -| 1728 | [Cat and Mouse II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README_EN.md) | `Graph`,`Topological Sort`,`Memoization`,`Array`,`Math`,`Dynamic Programming`,`Game Theory`,`Matrix` | Hard | Weekly Contest 224 | -| 1729 | [Find Followers Count](/solution/1700-1799/1729.Find%20Followers%20Count/README_EN.md) | `Database` | Easy | | -| 1730 | [Shortest Path to Get Food](/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 | -| 1731 | [The Number of Employees Which Report to Each Employee](/solution/1700-1799/1731.The%20Number%20of%20Employees%20Which%20Report%20to%20Each%20Employee/README_EN.md) | `Database` | Easy | | -| 1732 | [Find the Highest Altitude](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README_EN.md) | `Array`,`Prefix Sum` | Easy | Biweekly Contest 44 | -| 1733 | [Minimum Number of People to Teach](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Medium | Biweekly Contest 44 | -| 1734 | [Decode XORed Permutation](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Biweekly Contest 44 | -| 1735 | [Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Combinatorics`,`Number Theory` | Hard | Biweekly Contest 44 | -| 1736 | [Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README_EN.md) | `Greedy`,`String` | Easy | Weekly Contest 225 | -| 1737 | [Change Minimum Characters to Satisfy One of Three Conditions](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README_EN.md) | `Hash Table`,`String`,`Counting`,`Prefix Sum` | Medium | Weekly Contest 225 | -| 1738 | [Find Kth Largest XOR Coordinate Value](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README_EN.md) | `Bit Manipulation`,`Array`,`Divide and Conquer`,`Matrix`,`Prefix Sum`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 225 | -| 1739 | [Building Boxes](/solution/1700-1799/1739.Building%20Boxes/README_EN.md) | `Greedy`,`Math`,`Binary Search` | Hard | Weekly Contest 225 | -| 1740 | [Find Distance in a Binary Tree](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 | -| 1741 | [Find Total Time Spent by Each Employee](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README_EN.md) | `Database` | Easy | | -| 1742 | [Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README_EN.md) | `Hash Table`,`Math`,`Counting` | Easy | Weekly Contest 226 | -| 1743 | [Restore the Array From Adjacent Pairs](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 226 | -| 1744 | [Can You Eat Your Favorite Candy on Your Favorite Day](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 226 | -| 1745 | [Palindrome Partitioning IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 226 | -| 1746 | [Maximum Subarray Sum After One Operation](/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | -| 1747 | [Leetflex Banned Accounts](/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README_EN.md) | `Database` | Medium | 🔒 | -| 1748 | [Sum of Unique Elements](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 45 | -| 1749 | [Maximum Absolute Sum of Any Subarray](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 45 | -| 1750 | [Minimum Length of String After Deleting Similar Ends](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README_EN.md) | `Two Pointers`,`String` | Medium | Biweekly Contest 45 | -| 1751 | [Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 45 | -| 1752 | [Check if Array Is Sorted and Rotated](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README_EN.md) | `Array` | Easy | Weekly Contest 227 | -| 1753 | [Maximum Score From Removing Stones](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README_EN.md) | `Greedy`,`Math`,`Heap (Priority Queue)` | Medium | Weekly Contest 227 | -| 1754 | [Largest Merge Of Two Strings](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 227 | -| 1755 | [Closest Subsequence Sum](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 227 | -| 1756 | [Design Most Recently Used Queue](/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README_EN.md) | `Stack`,`Design`,`Binary Indexed Tree`,`Array`,`Hash Table`,`Ordered Set` | Medium | 🔒 | -| 1757 | [Recyclable and Low Fat Products](/solution/1700-1799/1757.Recyclable%20and%20Low%20Fat%20Products/README_EN.md) | `Database` | Easy | | -| 1758 | [Minimum Changes To Make Alternating Binary String](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README_EN.md) | `String` | Easy | Weekly Contest 228 | -| 1759 | [Count Number of Homogenous Substrings](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README_EN.md) | `Math`,`String` | Medium | Weekly Contest 228 | -| 1760 | [Minimum Limit of Balls in a Bag](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 228 | -| 1761 | [Minimum Degree of a Connected Trio in a Graph](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README_EN.md) | `Graph` | Hard | Weekly Contest 228 | -| 1762 | [Buildings With an Ocean View](/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | 🔒 | -| 1763 | [Longest Nice Substring](/solution/1700-1799/1763.Longest%20Nice%20Substring/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Divide and Conquer`,`Sliding Window` | Easy | Biweekly Contest 46 | -| 1764 | [Form Array by Concatenating Subarrays of Another Array](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`String Matching` | Medium | Biweekly Contest 46 | -| 1765 | [Map of Highest Peak](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Biweekly Contest 46 | -| 1766 | [Tree of Coprimes](/solution/1700-1799/1766.Tree%20of%20Coprimes/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Math`,`Number Theory` | Hard | Biweekly Contest 46 | -| 1767 | [Find the Subtasks That Did Not Execute](/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README_EN.md) | `Database` | Hard | 🔒 | -| 1768 | [Merge Strings Alternately](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 229 | -| 1769 | [Minimum Number of Operations to Move All Balls to Each Box](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README_EN.md) | `Array`,`String` | Medium | Weekly Contest 229 | -| 1770 | [Maximum Score from Performing Multiplication Operations](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 229 | -| 1771 | [Maximize Palindrome Length From Subsequences](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 229 | -| 1772 | [Sort Features by Popularity](/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | 🔒 | -| 1773 | [Count Items Matching a Rule](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 230 | -| 1774 | [Closest Dessert Cost](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README_EN.md) | `Array`,`Dynamic Programming`,`Backtracking` | Medium | Weekly Contest 230 | -| 1775 | [Equal Sum Arrays With Minimum Number of Operations](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 230 | -| 1776 | [Car Fleet II](/solution/1700-1799/1776.Car%20Fleet%20II/README_EN.md) | `Stack`,`Array`,`Math`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Weekly Contest 230 | -| 1777 | [Product's Price for Each Store](/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README_EN.md) | `Database` | Easy | 🔒 | -| 1778 | [Shortest Path in a Hidden Grid](/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Interactive` | Medium | 🔒 | -| 1779 | [Find Nearest Point That Has the Same X or Y Coordinate](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README_EN.md) | `Array` | Easy | Biweekly Contest 47 | -| 1780 | [Check if Number is a Sum of Powers of Three](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README_EN.md) | `Math` | Medium | Biweekly Contest 47 | -| 1781 | [Sum of Beauty of All Substrings](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 47 | -| 1782 | [Count Pairs Of Nodes](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README_EN.md) | `Graph`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Hard | Biweekly Contest 47 | -| 1783 | [Grand Slam Titles](/solution/1700-1799/1783.Grand%20Slam%20Titles/README_EN.md) | `Database` | Medium | 🔒 | -| 1784 | [Check if Binary String Has at Most One Segment of Ones](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README_EN.md) | `String` | Easy | Weekly Contest 231 | -| 1785 | [Minimum Elements to Add to Form a Given Sum](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 231 | -| 1786 | [Number of Restricted Paths From First to Last Node](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README_EN.md) | `Graph`,`Topological Sort`,`Dynamic Programming`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Weekly Contest 231 | -| 1787 | [Make the XOR of All Segments Equal to Zero](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 231 | -| 1788 | [Maximize the Beauty of the Garden](/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README_EN.md) | `Greedy`,`Array`,`Prefix Sum` | Hard | 🔒 | -| 1789 | [Primary Department for Each Employee](/solution/1700-1799/1789.Primary%20Department%20for%20Each%20Employee/README_EN.md) | `Database` | Easy | | -| 1790 | [Check if One String Swap Can Make Strings Equal](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 232 | -| 1791 | [Find Center of Star Graph](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README_EN.md) | `Graph` | Easy | Weekly Contest 232 | -| 1792 | [Maximum Average Pass Ratio](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 232 | -| 1793 | [Maximum Score of a Good Subarray](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README_EN.md) | `Stack`,`Array`,`Two Pointers`,`Binary Search`,`Monotonic Stack` | Hard | Weekly Contest 232 | -| 1794 | [Count Pairs of Equal Substrings With Minimum Difference](/solution/1700-1799/1794.Count%20Pairs%20of%20Equal%20Substrings%20With%20Minimum%20Difference/README_EN.md) | `Greedy`,`Hash Table`,`String` | Medium | 🔒 | -| 1795 | [Rearrange Products Table](/solution/1700-1799/1795.Rearrange%20Products%20Table/README_EN.md) | `Database` | Easy | | -| 1796 | [Second Largest Digit in a String](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README_EN.md) | `Hash Table`,`String` | Easy | Biweekly Contest 48 | -| 1797 | [Design Authentication Manager](/solution/1700-1799/1797.Design%20Authentication%20Manager/README_EN.md) | `Design`,`Hash Table` | Medium | Biweekly Contest 48 | -| 1798 | [Maximum Number of Consecutive Values You Can Make](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 48 | -| 1799 | [Maximize Score After N Operations](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Backtracking`,`Bitmask`,`Number Theory` | Hard | Biweekly Contest 48 | -| 1800 | [Maximum Ascending Subarray Sum](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README_EN.md) | `Array` | Easy | Weekly Contest 233 | -| 1801 | [Number of Orders in the Backlog](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Medium | Weekly Contest 233 | -| 1802 | [Maximum Value at a Given Index in a Bounded Array](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README_EN.md) | `Greedy`,`Binary Search` | Medium | Weekly Contest 233 | -| 1803 | [Count Pairs With XOR in a Range](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README_EN.md) | `Bit Manipulation`,`Trie`,`Array` | Hard | Weekly Contest 233 | -| 1804 | [Implement Trie II (Prefix Tree)](/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | 🔒 | -| 1805 | [Number of Different Integers in a String](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 234 | -| 1806 | [Minimum Number of Operations to Reinitialize a Permutation](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README_EN.md) | `Array`,`Math`,`Simulation` | Medium | Weekly Contest 234 | -| 1807 | [Evaluate the Bracket Pairs of a String](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 234 | -| 1808 | [Maximize Number of Nice Divisors](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README_EN.md) | `Recursion`,`Math` | Hard | Weekly Contest 234 | -| 1809 | [Ad-Free Sessions](/solution/1800-1899/1809.Ad-Free%20Sessions/README_EN.md) | `Database` | Easy | 🔒 | -| 1810 | [Minimum Path Cost in a Hidden Grid](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Interactive`,`Heap (Priority Queue)` | Medium | 🔒 | -| 1811 | [Find Interview Candidates](/solution/1800-1899/1811.Find%20Interview%20Candidates/README_EN.md) | `Database` | Medium | 🔒 | -| 1812 | [Determine Color of a Chessboard Square](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 49 | -| 1813 | [Sentence Similarity III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README_EN.md) | `Array`,`Two Pointers`,`String` | Medium | Biweekly Contest 49 | -| 1814 | [Count Nice Pairs in an Array](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting` | Medium | Biweekly Contest 49 | -| 1815 | [Maximum Number of Groups Getting Fresh Donuts](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README_EN.md) | `Bit Manipulation`,`Memoization`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 49 | -| 1816 | [Truncate Sentence](/solution/1800-1899/1816.Truncate%20Sentence/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 235 | -| 1817 | [Finding the Users Active Minutes](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 235 | -| 1818 | [Minimum Absolute Sum Difference](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README_EN.md) | `Array`,`Binary Search`,`Ordered Set`,`Sorting` | Medium | Weekly Contest 235 | -| 1819 | [Number of Different Subsequences GCDs](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README_EN.md) | `Array`,`Math`,`Counting`,`Number Theory` | Hard | Weekly Contest 235 | -| 1820 | [Maximum Number of Accepted Invitations](/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README_EN.md) | `Array`,`Backtracking`,`Matrix` | Medium | 🔒 | -| 1821 | [Find Customers With Positive Revenue this Year](/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README_EN.md) | `Database` | Easy | 🔒 | -| 1822 | [Sign of the Product of an Array](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 236 | -| 1823 | [Find the Winner of the Circular Game](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README_EN.md) | `Recursion`,`Queue`,`Array`,`Math`,`Simulation` | Medium | Weekly Contest 236 | -| 1824 | [Minimum Sideway Jumps](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 236 | -| 1825 | [Finding MK Average](/solution/1800-1899/1825.Finding%20MK%20Average/README_EN.md) | `Design`,`Queue`,`Data Stream`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Weekly Contest 236 | -| 1826 | [Faulty Sensor](/solution/1800-1899/1826.Faulty%20Sensor/README_EN.md) | `Array`,`Two Pointers` | Easy | 🔒 | -| 1827 | [Minimum Operations to Make the Array Increasing](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README_EN.md) | `Greedy`,`Array` | Easy | Biweekly Contest 50 | -| 1828 | [Queries on Number of Points Inside a Circle](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README_EN.md) | `Geometry`,`Array`,`Math` | Medium | Biweekly Contest 50 | -| 1829 | [Maximum XOR for Each Query](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README_EN.md) | `Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Biweekly Contest 50 | -| 1830 | [Minimum Number of Operations to Make String Sorted](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README_EN.md) | `Math`,`String`,`Combinatorics` | Hard | Biweekly Contest 50 | -| 1831 | [Maximum Transaction Each Day](/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README_EN.md) | `Database` | Medium | 🔒 | -| 1832 | [Check if the Sentence Is Pangram](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 237 | -| 1833 | [Maximum Ice Cream Bars](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 237 | -| 1834 | [Single-Threaded CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 237 | -| 1835 | [Find XOR Sum of All Pairs Bitwise AND](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Hard | Weekly Contest 237 | -| 1836 | [Remove Duplicates From an Unsorted Linked List](/solution/1800-1899/1836.Remove%20Duplicates%20From%20an%20Unsorted%20Linked%20List/README_EN.md) | `Hash Table`,`Linked List` | Medium | 🔒 | -| 1837 | [Sum of Digits in Base K](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README_EN.md) | `Math` | Easy | Weekly Contest 238 | -| 1838 | [Frequency of the Most Frequent Element](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting`,`Sliding Window` | Medium | Weekly Contest 238 | -| 1839 | [Longest Substring Of All Vowels in Order](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README_EN.md) | `String`,`Sliding Window` | Medium | Weekly Contest 238 | -| 1840 | [Maximum Building Height](/solution/1800-1899/1840.Maximum%20Building%20Height/README_EN.md) | `Array`,`Math`,`Sorting` | Hard | Weekly Contest 238 | -| 1841 | [League Statistics](/solution/1800-1899/1841.League%20Statistics/README_EN.md) | `Database` | Medium | 🔒 | -| 1842 | [Next Palindrome Using Same Digits](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README_EN.md) | `Two Pointers`,`String` | Hard | 🔒 | -| 1843 | [Suspicious Bank Accounts](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README_EN.md) | `Database` | Medium | 🔒 | -| 1844 | [Replace All Digits with Characters](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README_EN.md) | `String` | Easy | Biweekly Contest 51 | -| 1845 | [Seat Reservation Manager](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README_EN.md) | `Design`,`Heap (Priority Queue)` | Medium | Biweekly Contest 51 | -| 1846 | [Maximum Element After Decreasing and Rearranging](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 51 | -| 1847 | [Closest Room](/solution/1800-1899/1847.Closest%20Room/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Hard | Biweekly Contest 51 | -| 1848 | [Minimum Distance to the Target Element](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README_EN.md) | `Array` | Easy | Weekly Contest 239 | -| 1849 | [Splitting a String Into Descending Consecutive Values](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README_EN.md) | `String`,`Backtracking` | Medium | Weekly Contest 239 | -| 1850 | [Minimum Adjacent Swaps to Reach the Kth Smallest Number](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 239 | -| 1851 | [Minimum Interval to Include Each Query](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README_EN.md) | `Array`,`Binary Search`,`Sorting`,`Line Sweep`,`Heap (Priority Queue)` | Hard | Weekly Contest 239 | -| 1852 | [Distinct Numbers in Each Subarray](/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | 🔒 | -| 1853 | [Convert Date Format](/solution/1800-1899/1853.Convert%20Date%20Format/README_EN.md) | `Database` | Easy | 🔒 | -| 1854 | [Maximum Population Year](/solution/1800-1899/1854.Maximum%20Population%20Year/README_EN.md) | `Array`,`Counting`,`Prefix Sum` | Easy | Weekly Contest 240 | -| 1855 | [Maximum Distance Between a Pair of Values](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README_EN.md) | `Array`,`Two Pointers`,`Binary Search` | Medium | Weekly Contest 240 | -| 1856 | [Maximum Subarray Min-Product](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README_EN.md) | `Stack`,`Array`,`Prefix Sum`,`Monotonic Stack` | Medium | Weekly Contest 240 | -| 1857 | [Largest Color Value in a Directed Graph](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README_EN.md) | `Graph`,`Topological Sort`,`Memoization`,`Hash Table`,`Dynamic Programming`,`Counting` | Hard | Weekly Contest 240 | -| 1858 | [Longest Word With All Prefixes](/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README_EN.md) | `Depth-First Search`,`Trie` | Medium | 🔒 | -| 1859 | [Sorting the Sentence](/solution/1800-1899/1859.Sorting%20the%20Sentence/README_EN.md) | `String`,`Sorting` | Easy | Biweekly Contest 52 | -| 1860 | [Incremental Memory Leak](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README_EN.md) | `Math`,`Simulation` | Medium | Biweekly Contest 52 | -| 1861 | [Rotating the Box](/solution/1800-1899/1861.Rotating%20the%20Box/README_EN.md) | `Array`,`Two Pointers`,`Matrix` | Medium | Biweekly Contest 52 | -| 1862 | [Sum of Floored Pairs](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README_EN.md) | `Array`,`Math`,`Binary Search`,`Prefix Sum` | Hard | Biweekly Contest 52 | -| 1863 | [Sum of All Subset XOR Totals](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Backtracking`,`Combinatorics`,`Enumeration` | Easy | Weekly Contest 241 | -| 1864 | [Minimum Number of Swaps to Make the Binary String Alternating](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 241 | -| 1865 | [Finding Pairs With a Certain Sum](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README_EN.md) | `Design`,`Array`,`Hash Table` | Medium | Weekly Contest 241 | -| 1866 | [Number of Ways to Rearrange Sticks With K Sticks Visible](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 241 | -| 1867 | [Orders With Maximum Quantity Above Average](/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README_EN.md) | `Database` | Medium | 🔒 | -| 1868 | [Product of Two Run-Length Encoded Arrays](/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README_EN.md) | `Array`,`Two Pointers` | Medium | 🔒 | -| 1869 | [Longer Contiguous Segments of Ones than Zeros](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README_EN.md) | `String` | Easy | Weekly Contest 242 | -| 1870 | [Minimum Speed to Arrive on Time](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 242 | -| 1871 | [Jump Game VII](/solution/1800-1899/1871.Jump%20Game%20VII/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 242 | -| 1872 | [Stone Game VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory`,`Prefix Sum` | Hard | Weekly Contest 242 | -| 1873 | [Calculate Special Bonus](/solution/1800-1899/1873.Calculate%20Special%20Bonus/README_EN.md) | `Database` | Easy | | -| 1874 | [Minimize Product Sum of Two Arrays](/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | -| 1875 | [Group Employees of the Same Salary](/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README_EN.md) | `Database` | Medium | 🔒 | -| 1876 | [Substrings of Size Three with Distinct Characters](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README_EN.md) | `Hash Table`,`String`,`Counting`,`Sliding Window` | Easy | Biweekly Contest 53 | -| 1877 | [Minimize Maximum Pair Sum in Array](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Biweekly Contest 53 | -| 1878 | [Get Biggest Three Rhombus Sums in a Grid](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README_EN.md) | `Array`,`Math`,`Matrix`,`Prefix Sum`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 53 | -| 1879 | [Minimum XOR Sum of Two Arrays](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 53 | -| 1880 | [Check if Word Equals Summation of Two Words](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README_EN.md) | `String` | Easy | Weekly Contest 243 | -| 1881 | [Maximum Value after Insertion](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 243 | -| 1882 | [Process Tasks Using Servers](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README_EN.md) | `Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 243 | -| 1883 | [Minimum Skips to Arrive at Meeting On Time](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 243 | -| 1884 | [Egg Drop With 2 Eggs and N Floors](/solution/1800-1899/1884.Egg%20Drop%20With%202%20Eggs%20and%20N%20Floors/README_EN.md) | `Math`,`Dynamic Programming` | Medium | | -| 1885 | [Count Pairs in Two Arrays](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | 🔒 | -| 1886 | [Determine Whether Matrix Can Be Obtained By Rotation](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 244 | -| 1887 | [Reduction Operations to Make the Array Elements Equal](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 244 | -| 1888 | [Minimum Number of Flips to Make the Binary String Alternating](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md) | `Greedy`,`String`,`Dynamic Programming`,`Sliding Window` | Medium | Weekly Contest 244 | -| 1889 | [Minimum Space Wasted From Packaging](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Hard | Weekly Contest 244 | -| 1890 | [The Latest Login in 2020](/solution/1800-1899/1890.The%20Latest%20Login%20in%202020/README_EN.md) | `Database` | Easy | | -| 1891 | [Cutting Ribbons](/solution/1800-1899/1891.Cutting%20Ribbons/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 | -| 1892 | [Page Recommendations II](/solution/1800-1899/1892.Page%20Recommendations%20II/README_EN.md) | `Database` | Hard | 🔒 | -| 1893 | [Check if All the Integers in a Range Are Covered](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Easy | Biweekly Contest 54 | -| 1894 | [Find the Student that Will Replace the Chalk](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Simulation` | Medium | Biweekly Contest 54 | -| 1895 | [Largest Magic Square](/solution/1800-1899/1895.Largest%20Magic%20Square/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Biweekly Contest 54 | -| 1896 | [Minimum Cost to Change the Final Value of Expression](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README_EN.md) | `Stack`,`Math`,`String`,`Dynamic Programming` | Hard | Biweekly Contest 54 | -| 1897 | [Redistribute Characters to Make All Strings Equal](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 245 | -| 1898 | [Maximum Number of Removable Characters](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README_EN.md) | `Array`,`Two Pointers`,`String`,`Binary Search` | Medium | Weekly Contest 245 | -| 1899 | [Merge Triplets to Form Target Triplet](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 245 | -| 1900 | [The Earliest and Latest Rounds Where Players Compete](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README_EN.md) | `Memoization`,`Dynamic Programming` | Hard | Weekly Contest 245 | -| 1901 | [Find a Peak Element II](/solution/1900-1999/1901.Find%20a%20Peak%20Element%20II/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | | -| 1902 | [Depth of BST Given Insertion Order](/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README_EN.md) | `Tree`,`Binary Search Tree`,`Binary Tree`,`Ordered Set` | Medium | 🔒 | -| 1903 | [Largest Odd Number in String](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README_EN.md) | `Greedy`,`Math`,`String` | Easy | Weekly Contest 246 | -| 1904 | [The Number of Full Rounds You Have Played](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README_EN.md) | `Math`,`String` | Medium | Weekly Contest 246 | -| 1905 | [Count Sub Islands](/solution/1900-1999/1905.Count%20Sub%20Islands/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Weekly Contest 246 | -| 1906 | [Minimum Absolute Difference Queries](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 246 | -| 1907 | [Count Salary Categories](/solution/1900-1999/1907.Count%20Salary%20Categories/README_EN.md) | `Database` | Medium | | -| 1908 | [Game of Nim](/solution/1900-1999/1908.Game%20of%20Nim/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | 🔒 | -| 1909 | [Remove One Element to Make the Array Strictly Increasing](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README_EN.md) | `Array` | Easy | Biweekly Contest 55 | -| 1910 | [Remove All Occurrences of a Substring](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README_EN.md) | `String` | Medium | Biweekly Contest 55 | -| 1911 | [Maximum Alternating Subsequence Sum](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 55 | -| 1912 | [Design Movie Rental System](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README_EN.md) | `Design`,`Array`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Biweekly Contest 55 | -| 1913 | [Maximum Product Difference Between Two Pairs](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 247 | -| 1914 | [Cyclically Rotating a Grid](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 247 | -| 1915 | [Number of Wonderful Substrings](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Prefix Sum` | Medium | Weekly Contest 247 | -| 1916 | [Count Ways to Build Rooms in an Ant Colony](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README_EN.md) | `Tree`,`Graph`,`Topological Sort`,`Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 247 | -| 1917 | [Leetcodify Friends Recommendations](/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README_EN.md) | `Database` | Hard | 🔒 | -| 1918 | [Kth Smallest Subarray Sum](/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README_EN.md) | `Array`,`Binary Search`,`Sliding Window` | Medium | 🔒 | -| 1919 | [Leetcodify Similar Friends](/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README_EN.md) | `Database` | Hard | 🔒 | -| 1920 | [Build Array from Permutation](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 248 | -| 1921 | [Eliminate Maximum Number of Monsters](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 248 | -| 1922 | [Count Good Numbers](/solution/1900-1999/1922.Count%20Good%20Numbers/README_EN.md) | `Recursion`,`Math` | Medium | Weekly Contest 248 | -| 1923 | [Longest Common Subpath](/solution/1900-1999/1923.Longest%20Common%20Subpath/README_EN.md) | `Array`,`Binary Search`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 248 | -| 1924 | [Erect the Fence II](/solution/1900-1999/1924.Erect%20the%20Fence%20II/README_EN.md) | `Geometry`,`Array`,`Math` | Hard | 🔒 | -| 1925 | [Count Square Sum Triples](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README_EN.md) | `Math`,`Enumeration` | Easy | Biweekly Contest 56 | -| 1926 | [Nearest Exit from Entrance in Maze](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Biweekly Contest 56 | -| 1927 | [Sum Game](/solution/1900-1999/1927.Sum%20Game/README_EN.md) | `Greedy`,`Math`,`String`,`Game Theory` | Medium | Biweekly Contest 56 | -| 1928 | [Minimum Cost to Reach Destination in Time](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README_EN.md) | `Graph`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 56 | -| 1929 | [Concatenation of Array](/solution/1900-1999/1929.Concatenation%20of%20Array/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 249 | -| 1930 | [Unique Length-3 Palindromic Subsequences](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Prefix Sum` | Medium | Weekly Contest 249 | -| 1931 | [Painting a Grid With Three Different Colors](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README_EN.md) | `Dynamic Programming` | Hard | Weekly Contest 249 | -| 1932 | [Merge BSTs to Create Single BST](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Search`,`Binary Tree` | Hard | Weekly Contest 249 | -| 1933 | [Check if String Is Decomposable Into Value-Equal Substrings](/solution/1900-1999/1933.Check%20if%20String%20Is%20Decomposable%20Into%20Value-Equal%20Substrings/README_EN.md) | `String` | Easy | 🔒 | -| 1934 | [Confirmation Rate](/solution/1900-1999/1934.Confirmation%20Rate/README_EN.md) | `Database` | Medium | | -| 1935 | [Maximum Number of Words You Can Type](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 250 | -| 1936 | [Add Minimum Number of Rungs](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 250 | -| 1937 | [Maximum Number of Points with Cost](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 250 | -| 1938 | [Maximum Genetic Difference Query](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README_EN.md) | `Bit Manipulation`,`Trie`,`Array` | Hard | Weekly Contest 250 | -| 1939 | [Users That Actively Request Confirmation Messages](/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README_EN.md) | `Database` | Easy | 🔒 | -| 1940 | [Longest Common Subsequence Between Sorted Arrays](/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | 🔒 | -| 1941 | [Check if All Characters Have Equal Number of Occurrences](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 57 | -| 1942 | [The Number of the Smallest Unoccupied Chair](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README_EN.md) | `Array`,`Hash Table`,`Heap (Priority Queue)` | Medium | Biweekly Contest 57 | -| 1943 | [Describe the Painting](/solution/1900-1999/1943.Describe%20the%20Painting/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 57 | -| 1944 | [Number of Visible People in a Queue](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Hard | Biweekly Contest 57 | -| 1945 | [Sum of Digits of String After Convert](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 251 | -| 1946 | [Largest Number After Mutating Substring](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README_EN.md) | `Greedy`,`Array`,`String` | Medium | Weekly Contest 251 | -| 1947 | [Maximum Compatibility Score Sum](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 251 | -| 1948 | [Delete Duplicate Folders in System](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Hash Function` | Hard | Weekly Contest 251 | -| 1949 | [Strong Friendship](/solution/1900-1999/1949.Strong%20Friendship/README_EN.md) | `Database` | Medium | 🔒 | -| 1950 | [Maximum of Minimum Values in All Subarrays](/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | 🔒 | -| 1951 | [All the Pairs With the Maximum Number of Common Followers](/solution/1900-1999/1951.All%20the%20Pairs%20With%20the%20Maximum%20Number%20of%20Common%20Followers/README_EN.md) | `Database` | Medium | 🔒 | -| 1952 | [Three Divisors](/solution/1900-1999/1952.Three%20Divisors/README_EN.md) | `Math`,`Enumeration`,`Number Theory` | Easy | Weekly Contest 252 | -| 1953 | [Maximum Number of Weeks for Which You Can Work](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 252 | -| 1954 | [Minimum Garden Perimeter to Collect Enough Apples](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README_EN.md) | `Math`,`Binary Search` | Medium | Weekly Contest 252 | -| 1955 | [Count Number of Special Subsequences](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 252 | -| 1956 | [Minimum Time For K Virus Variants to Spread](/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README_EN.md) | `Geometry`,`Array`,`Math`,`Binary Search`,`Enumeration` | Hard | 🔒 | -| 1957 | [Delete Characters to Make Fancy String](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README_EN.md) | `String` | Easy | Biweekly Contest 58 | -| 1958 | [Check if Move is Legal](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README_EN.md) | `Array`,`Enumeration`,`Matrix` | Medium | Biweekly Contest 58 | -| 1959 | [Minimum Total Space Wasted With K Resizing Operations](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 58 | -| 1960 | [Maximum Product of the Length of Two Palindromic Substrings](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README_EN.md) | `String`,`Hash Function`,`Rolling Hash` | Hard | Biweekly Contest 58 | -| 1961 | [Check If String Is a Prefix of Array](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README_EN.md) | `Array`,`Two Pointers`,`String` | Easy | Weekly Contest 253 | -| 1962 | [Remove Stones to Minimize the Total](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 253 | -| 1963 | [Minimum Number of Swaps to Make the String Balanced](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README_EN.md) | `Stack`,`Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 253 | -| 1964 | [Find the Longest Valid Obstacle Course at Each Position](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README_EN.md) | `Binary Indexed Tree`,`Array`,`Binary Search` | Hard | Weekly Contest 253 | -| 1965 | [Employees With Missing Information](/solution/1900-1999/1965.Employees%20With%20Missing%20Information/README_EN.md) | `Database` | Easy | | -| 1966 | [Binary Searchable Numbers in an Unsorted Array](/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 | -| 1967 | [Number of Strings That Appear as Substrings in Word](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README_EN.md) | `String` | Easy | Weekly Contest 254 | -| 1968 | [Array With Elements Not Equal to Average of Neighbors](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 254 | -| 1969 | [Minimum Non-Zero Product of the Array Elements](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README_EN.md) | `Greedy`,`Recursion`,`Math` | Medium | Weekly Contest 254 | -| 1970 | [Last Day Where You Can Still Cross](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix` | Hard | Weekly Contest 254 | -| 1971 | [Find if Path Exists in Graph](/solution/1900-1999/1971.Find%20if%20Path%20Exists%20in%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Easy | | -| 1972 | [First and Last Call On the Same Day](/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README_EN.md) | `Database` | Hard | 🔒 | -| 1973 | [Count Nodes Equal to Sum of Descendants](/solution/1900-1999/1973.Count%20Nodes%20Equal%20to%20Sum%20of%20Descendants/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | -| 1974 | [Minimum Time to Type Word Using Special Typewriter](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README_EN.md) | `Greedy`,`String` | Easy | Biweekly Contest 59 | -| 1975 | [Maximum Matrix Sum](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | Biweekly Contest 59 | -| 1976 | [Number of Ways to Arrive at Destination](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README_EN.md) | `Graph`,`Topological Sort`,`Dynamic Programming`,`Shortest Path` | Medium | Biweekly Contest 59 | -| 1977 | [Number of Ways to Separate Numbers](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README_EN.md) | `String`,`Dynamic Programming`,`Suffix Array` | Hard | Biweekly Contest 59 | -| 1978 | [Employees Whose Manager Left the Company](/solution/1900-1999/1978.Employees%20Whose%20Manager%20Left%20the%20Company/README_EN.md) | `Database` | Easy | | -| 1979 | [Find Greatest Common Divisor of Array](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README_EN.md) | `Array`,`Math`,`Number Theory` | Easy | Weekly Contest 255 | -| 1980 | [Find Unique Binary String](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README_EN.md) | `Array`,`Hash Table`,`String`,`Backtracking` | Medium | Weekly Contest 255 | -| 1981 | [Minimize the Difference Between Target and Chosen Elements](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 255 | -| 1982 | [Find Array Given Subset Sums](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README_EN.md) | `Array`,`Divide and Conquer` | Hard | Weekly Contest 255 | -| 1983 | [Widest Pair of Indices With Equal Range Sum](/solution/1900-1999/1983.Widest%20Pair%20of%20Indices%20With%20Equal%20Range%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | 🔒 | -| 1984 | [Minimum Difference Between Highest and Lowest of K Scores](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README_EN.md) | `Array`,`Sorting`,`Sliding Window` | Easy | Weekly Contest 256 | -| 1985 | [Find the Kth Largest Integer in the Array](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README_EN.md) | `Array`,`String`,`Divide and Conquer`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 256 | -| 1986 | [Minimum Number of Work Sessions to Finish the Tasks](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 256 | -| 1987 | [Number of Unique Good Subsequences](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 256 | -| 1988 | [Find Cutoff Score for Each School](/solution/1900-1999/1988.Find%20Cutoff%20Score%20for%20Each%20School/README_EN.md) | `Database` | Medium | 🔒 | -| 1989 | [Maximum Number of People That Can Be Caught in Tag](/solution/1900-1999/1989.Maximum%20Number%20of%20People%20That%20Can%20Be%20Caught%20in%20Tag/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 | -| 1990 | [Count the Number of Experiments](/solution/1900-1999/1990.Count%20the%20Number%20of%20Experiments/README_EN.md) | `Database` | Medium | 🔒 | -| 1991 | [Find the Middle Index in Array](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README_EN.md) | `Array`,`Prefix Sum` | Easy | Biweekly Contest 60 | -| 1992 | [Find All Groups of Farmland](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | Biweekly Contest 60 | -| 1993 | [Operations on Tree](/solution/1900-1999/1993.Operations%20on%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Array`,`Hash Table` | Medium | Biweekly Contest 60 | -| 1994 | [The Number of Good Subsets](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 60 | -| 1995 | [Count Special Quadruplets](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Easy | Weekly Contest 257 | -| 1996 | [The Number of Weak Characters in the Game](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README_EN.md) | `Stack`,`Greedy`,`Array`,`Sorting`,`Monotonic Stack` | Medium | Weekly Contest 257 | -| 1997 | [First Day Where You Have Been in All the Rooms](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 257 | -| 1998 | [GCD Sort of an Array](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README_EN.md) | `Union Find`,`Array`,`Math`,`Number Theory`,`Sorting` | Hard | Weekly Contest 257 | -| 1999 | [Smallest Greater Multiple Made of Two Digits](/solution/1900-1999/1999.Smallest%20Greater%20Multiple%20Made%20of%20Two%20Digits/README_EN.md) | `Math`,`Enumeration` | Medium | 🔒 | -| 2000 | [Reverse Prefix of Word](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 258 | -| 2001 | [Number of Pairs of Interchangeable Rectangles](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory` | Medium | Weekly Contest 258 | -| 2002 | [Maximum Product of the Length of Two Palindromic Subsequences](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README_EN.md) | `Bit Manipulation`,`String`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 258 | -| 2003 | [Smallest Missing Genetic Value in Each Subtree](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README_EN.md) | `Tree`,`Depth-First Search`,`Union Find`,`Dynamic Programming` | Hard | Weekly Contest 258 | -| 2004 | [The Number of Seniors and Juniors to Join the Company](/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README_EN.md) | `Database` | Hard | 🔒 | -| 2005 | [Subtree Removal Game with Fibonacci Tree](/solution/2000-2099/2005.Subtree%20Removal%20Game%20with%20Fibonacci%20Tree/README_EN.md) | `Tree`,`Math`,`Dynamic Programming`,`Binary Tree`,`Game Theory` | Hard | 🔒 | -| 2006 | [Count Number of Pairs With Absolute Difference K](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 61 | -| 2007 | [Find Original Array From Doubled Array](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting` | Medium | Biweekly Contest 61 | -| 2008 | [Maximum Earnings From Taxi](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | Biweekly Contest 61 | -| 2009 | [Minimum Number of Operations to Make Array Continuous](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sliding Window` | Hard | Biweekly Contest 61 | -| 2010 | [The Number of Seniors and Juniors to Join the Company II](/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README_EN.md) | `Database` | Hard | 🔒 | -| 2011 | [Final Value of Variable After Performing Operations](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README_EN.md) | `Array`,`String`,`Simulation` | Easy | Weekly Contest 259 | -| 2012 | [Sum of Beauty in the Array](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README_EN.md) | `Array` | Medium | Weekly Contest 259 | -| 2013 | [Detect Squares](/solution/2000-2099/2013.Detect%20Squares/README_EN.md) | `Design`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 259 | -| 2014 | [Longest Subsequence Repeated k Times](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README_EN.md) | `Greedy`,`String`,`Backtracking`,`Counting`,`Enumeration` | Hard | Weekly Contest 259 | -| 2015 | [Average Height of Buildings in Each Segment](/solution/2000-2099/2015.Average%20Height%20of%20Buildings%20in%20Each%20Segment/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | 🔒 | -| 2016 | [Maximum Difference Between Increasing Elements](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README_EN.md) | `Array` | Easy | Weekly Contest 260 | -| 2017 | [Grid Game](/solution/2000-2099/2017.Grid%20Game/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 260 | -| 2018 | [Check if Word Can Be Placed In Crossword](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README_EN.md) | `Array`,`Enumeration`,`Matrix` | Medium | Weekly Contest 260 | -| 2019 | [The Score of Students Solving Math Expression](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README_EN.md) | `Stack`,`Memoization`,`Array`,`Math`,`String`,`Dynamic Programming` | Hard | Weekly Contest 260 | -| 2020 | [Number of Accounts That Did Not Stream](/solution/2000-2099/2020.Number%20of%20Accounts%20That%20Did%20Not%20Stream/README_EN.md) | `Database` | Medium | 🔒 | -| 2021 | [Brightest Position on Street](/solution/2000-2099/2021.Brightest%20Position%20on%20Street/README_EN.md) | `Array`,`Ordered Set`,`Prefix Sum` | Medium | 🔒 | -| 2022 | [Convert 1D Array Into 2D Array](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Biweekly Contest 62 | -| 2023 | [Number of Pairs of Strings With Concatenation Equal to Target](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 62 | -| 2024 | [Maximize the Confusion of an Exam](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README_EN.md) | `String`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | Biweekly Contest 62 | -| 2025 | [Maximum Number of Ways to Partition an Array](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Enumeration`,`Prefix Sum` | Hard | Biweekly Contest 62 | -| 2026 | [Low-Quality Problems](/solution/2000-2099/2026.Low-Quality%20Problems/README_EN.md) | `Database` | Easy | 🔒 | -| 2027 | [Minimum Moves to Convert String](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README_EN.md) | `Greedy`,`String` | Easy | Weekly Contest 261 | -| 2028 | [Find Missing Observations](/solution/2000-2099/2028.Find%20Missing%20Observations/README_EN.md) | `Array`,`Math`,`Simulation` | Medium | Weekly Contest 261 | -| 2029 | [Stone Game IX](/solution/2000-2099/2029.Stone%20Game%20IX/README_EN.md) | `Greedy`,`Array`,`Math`,`Counting`,`Game Theory` | Medium | Weekly Contest 261 | -| 2030 | [Smallest K-Length Subsequence With Occurrences of a Letter](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Hard | Weekly Contest 261 | -| 2031 | [Count Subarrays With More Ones Than Zeros](/solution/2000-2099/2031.Count%20Subarrays%20With%20More%20Ones%20Than%20Zeros/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Medium | 🔒 | -| 2032 | [Two Out of Three](/solution/2000-2099/2032.Two%20Out%20of%20Three/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Easy | Weekly Contest 262 | -| 2033 | [Minimum Operations to Make a Uni-Value Grid](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README_EN.md) | `Array`,`Math`,`Matrix`,`Sorting` | Medium | Weekly Contest 262 | -| 2034 | [Stock Price Fluctuation](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README_EN.md) | `Design`,`Hash Table`,`Data Stream`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 262 | -| 2035 | [Partition Array Into Two Arrays to Minimize Sum Difference](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Binary Search`,`Dynamic Programming`,`Bitmask`,`Ordered Set` | Hard | Weekly Contest 262 | -| 2036 | [Maximum Alternating Subarray Sum](/solution/2000-2099/2036.Maximum%20Alternating%20Subarray%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | -| 2037 | [Minimum Number of Moves to Seat Everyone](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Biweekly Contest 63 | -| 2038 | [Remove Colored Pieces if Both Neighbors are the Same Color](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README_EN.md) | `Greedy`,`Math`,`String`,`Game Theory` | Medium | Biweekly Contest 63 | -| 2039 | [The Time When the Network Becomes Idle](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README_EN.md) | `Breadth-First Search`,`Graph`,`Array` | Medium | Biweekly Contest 63 | -| 2040 | [Kth Smallest Product of Two Sorted Arrays](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README_EN.md) | `Array`,`Binary Search` | Hard | Biweekly Contest 63 | -| 2041 | [Accepted Candidates From the Interviews](/solution/2000-2099/2041.Accepted%20Candidates%20From%20the%20Interviews/README_EN.md) | `Database` | Medium | 🔒 | -| 2042 | [Check if Numbers Are Ascending in a Sentence](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README_EN.md) | `String` | Easy | Weekly Contest 263 | -| 2043 | [Simple Bank System](/solution/2000-2099/2043.Simple%20Bank%20System/README_EN.md) | `Design`,`Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 263 | -| 2044 | [Count Number of Maximum Bitwise-OR Subsets](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Medium | Weekly Contest 263 | -| 2045 | [Second Minimum Time to Reach Destination](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README_EN.md) | `Breadth-First Search`,`Graph`,`Shortest Path` | Hard | Weekly Contest 263 | -| 2046 | [Sort Linked List Already Sorted Using Absolute Values](/solution/2000-2099/2046.Sort%20Linked%20List%20Already%20Sorted%20Using%20Absolute%20Values/README_EN.md) | `Linked List`,`Two Pointers`,`Sorting` | Medium | 🔒 | -| 2047 | [Number of Valid Words in a Sentence](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README_EN.md) | `String` | Easy | Weekly Contest 264 | -| 2048 | [Next Greater Numerically Balanced Number](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README_EN.md) | `Math`,`Backtracking`,`Enumeration` | Medium | Weekly Contest 264 | -| 2049 | [Count Nodes With the Highest Score](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Binary Tree` | Medium | Weekly Contest 264 | -| 2050 | [Parallel Courses III](/solution/2000-2099/2050.Parallel%20Courses%20III/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 264 | -| 2051 | [The Category of Each Member in the Store](/solution/2000-2099/2051.The%20Category%20of%20Each%20Member%20in%20the%20Store/README_EN.md) | `Database` | Medium | 🔒 | -| 2052 | [Minimum Cost to Separate Sentence Into Rows](/solution/2000-2099/2052.Minimum%20Cost%20to%20Separate%20Sentence%20Into%20Rows/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | -| 2053 | [Kth Distinct String in an Array](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 64 | -| 2054 | [Two Best Non-Overlapping Events](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 64 | -| 2055 | [Plates Between Candles](/solution/2000-2099/2055.Plates%20Between%20Candles/README_EN.md) | `Array`,`String`,`Binary Search`,`Prefix Sum` | Medium | Biweekly Contest 64 | -| 2056 | [Number of Valid Move Combinations On Chessboard](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README_EN.md) | `Array`,`String`,`Backtracking`,`Simulation` | Hard | Biweekly Contest 64 | -| 2057 | [Smallest Index With Equal Value](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README_EN.md) | `Array` | Easy | Weekly Contest 265 | -| 2058 | [Find the Minimum and Maximum Number of Nodes Between Critical Points](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README_EN.md) | `Linked List` | Medium | Weekly Contest 265 | -| 2059 | [Minimum Operations to Convert Number](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README_EN.md) | `Breadth-First Search`,`Array` | Medium | Weekly Contest 265 | -| 2060 | [Check if an Original String Exists Given Two Encoded Strings](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 265 | -| 2061 | [Number of Spaces Cleaning Robot Cleaned](/solution/2000-2099/2061.Number%20of%20Spaces%20Cleaning%20Robot%20Cleaned/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | 🔒 | -| 2062 | [Count Vowel Substrings of a String](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 266 | -| 2063 | [Vowels of All Substrings](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README_EN.md) | `Math`,`String`,`Dynamic Programming`,`Combinatorics` | Medium | Weekly Contest 266 | -| 2064 | [Minimized Maximum of Products Distributed to Any Store](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 266 | -| 2065 | [Maximum Path Quality of a Graph](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README_EN.md) | `Graph`,`Array`,`Backtracking` | Hard | Weekly Contest 266 | -| 2066 | [Account Balance](/solution/2000-2099/2066.Account%20Balance/README_EN.md) | `Database` | Medium | 🔒 | -| 2067 | [Number of Equal Count Substrings](/solution/2000-2099/2067.Number%20of%20Equal%20Count%20Substrings/README_EN.md) | `String`,`Counting`,`Prefix Sum` | Medium | 🔒 | -| 2068 | [Check Whether Two Strings are Almost Equivalent](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 65 | -| 2069 | [Walking Robot Simulation II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README_EN.md) | `Design`,`Simulation` | Medium | Biweekly Contest 65 | -| 2070 | [Most Beautiful Item for Each Query](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 65 | -| 2071 | [Maximum Number of Tasks You Can Assign](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README_EN.md) | `Greedy`,`Queue`,`Array`,`Binary Search`,`Sorting`,`Monotonic Queue` | Hard | Biweekly Contest 65 | -| 2072 | [The Winner University](/solution/2000-2099/2072.The%20Winner%20University/README_EN.md) | `Database` | Easy | 🔒 | -| 2073 | [Time Needed to Buy Tickets](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README_EN.md) | `Queue`,`Array`,`Simulation` | Easy | Weekly Contest 267 | -| 2074 | [Reverse Nodes in Even Length Groups](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README_EN.md) | `Linked List` | Medium | Weekly Contest 267 | -| 2075 | [Decode the Slanted Ciphertext](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README_EN.md) | `String`,`Simulation` | Medium | Weekly Contest 267 | -| 2076 | [Process Restricted Friend Requests](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README_EN.md) | `Union Find`,`Graph` | Hard | Weekly Contest 267 | -| 2077 | [Paths in Maze That Lead to Same Room](/solution/2000-2099/2077.Paths%20in%20Maze%20That%20Lead%20to%20Same%20Room/README_EN.md) | `Graph` | Medium | 🔒 | -| 2078 | [Two Furthest Houses With Different Colors](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README_EN.md) | `Greedy`,`Array` | Easy | Weekly Contest 268 | -| 2079 | [Watering Plants](/solution/2000-2099/2079.Watering%20Plants/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 268 | -| 2080 | [Range Frequency Queries](/solution/2000-2099/2080.Range%20Frequency%20Queries/README_EN.md) | `Design`,`Segment Tree`,`Array`,`Hash Table`,`Binary Search` | Medium | Weekly Contest 268 | -| 2081 | [Sum of k-Mirror Numbers](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README_EN.md) | `Math`,`Enumeration` | Hard | Weekly Contest 268 | -| 2082 | [The Number of Rich Customers](/solution/2000-2099/2082.The%20Number%20of%20Rich%20Customers/README_EN.md) | `Database` | Easy | 🔒 | -| 2083 | [Substrings That Begin and End With the Same Letter](/solution/2000-2099/2083.Substrings%20That%20Begin%20and%20End%20With%20the%20Same%20Letter/README_EN.md) | `Hash Table`,`Math`,`String`,`Counting`,`Prefix Sum` | Medium | 🔒 | -| 2084 | [Drop Type 1 Orders for Customers With Type 0 Orders](/solution/2000-2099/2084.Drop%20Type%201%20Orders%20for%20Customers%20With%20Type%200%20Orders/README_EN.md) | `Database` | Medium | 🔒 | -| 2085 | [Count Common Words With One Occurrence](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 66 | -| 2086 | [Minimum Number of Food Buckets to Feed the Hamsters](/solution/2000-2099/2086.Minimum%20Number%20of%20Food%20Buckets%20to%20Feed%20the%20Hamsters/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 66 | -| 2087 | [Minimum Cost Homecoming of a Robot in a Grid](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README_EN.md) | `Greedy`,`Array` | Medium | Biweekly Contest 66 | -| 2088 | [Count Fertile Pyramids in a Land](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 66 | -| 2089 | [Find Target Indices After Sorting Array](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Easy | Weekly Contest 269 | -| 2090 | [K Radius Subarray Averages](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 269 | -| 2091 | [Removing Minimum and Maximum From Array](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 269 | -| 2092 | [Find All People With Secret](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Sorting` | Hard | Weekly Contest 269 | -| 2093 | [Minimum Cost to Reach City With Discounts](/solution/2000-2099/2093.Minimum%20Cost%20to%20Reach%20City%20With%20Discounts/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 | -| 2094 | [Finding 3-Digit Even Numbers](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README_EN.md) | `Array`,`Hash Table`,`Enumeration`,`Sorting` | Easy | Weekly Contest 270 | -| 2095 | [Delete the Middle Node of a Linked List](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | Weekly Contest 270 | -| 2096 | [Step-By-Step Directions From a Binary Tree Node to Another](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Binary Tree` | Medium | Weekly Contest 270 | -| 2097 | [Valid Arrangement of Pairs](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README_EN.md) | `Depth-First Search`,`Graph`,`Eulerian Circuit` | Hard | Weekly Contest 270 | -| 2098 | [Subsequence of Size K With the Largest Even Sum](/solution/2000-2099/2098.Subsequence%20of%20Size%20K%20With%20the%20Largest%20Even%20Sum/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | -| 2099 | [Find Subsequence of Length K With the Largest Sum](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Easy | Biweekly Contest 67 | -| 2100 | [Find Good Days to Rob the Bank](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 67 | -| 2101 | [Detonate the Maximum Bombs](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Geometry`,`Array`,`Math` | Medium | Biweekly Contest 67 | -| 2102 | [Sequentially Ordinal Rank Tracker](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README_EN.md) | `Design`,`Data Stream`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Biweekly Contest 67 | -| 2103 | [Rings and Rods](/solution/2100-2199/2103.Rings%20and%20Rods/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 271 | -| 2104 | [Sum of Subarray Ranges](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 271 | -| 2105 | [Watering Plants II](/solution/2100-2199/2105.Watering%20Plants%20II/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Medium | Weekly Contest 271 | -| 2106 | [Maximum Fruits Harvested After at Most K Steps](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Hard | Weekly Contest 271 | -| 2107 | [Number of Unique Flavors After Sharing K Candies](/solution/2100-2199/2107.Number%20of%20Unique%20Flavors%20After%20Sharing%20K%20Candies/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | 🔒 | -| 2108 | [Find First Palindromic String in the Array](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README_EN.md) | `Array`,`Two Pointers`,`String` | Easy | Weekly Contest 272 | -| 2109 | [Adding Spaces to a String](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README_EN.md) | `Array`,`Two Pointers`,`String`,`Simulation` | Medium | Weekly Contest 272 | -| 2110 | [Number of Smooth Descent Periods of a Stock](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | Weekly Contest 272 | -| 2111 | [Minimum Operations to Make the Array K-Increasing](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README_EN.md) | `Array`,`Binary Search` | Hard | Weekly Contest 272 | -| 2112 | [The Airport With the Most Traffic](/solution/2100-2199/2112.The%20Airport%20With%20the%20Most%20Traffic/README_EN.md) | `Database` | Medium | 🔒 | -| 2113 | [Elements in Array After Removing and Replacing Elements](/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README_EN.md) | `Array` | Medium | 🔒 | -| 2114 | [Maximum Number of Words Found in Sentences](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 68 | -| 2115 | [Find All Possible Recipes from Given Supplies](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Hash Table`,`String` | Medium | Biweekly Contest 68 | -| 2116 | [Check if a Parentheses String Can Be Valid](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README_EN.md) | `Stack`,`Greedy`,`String` | Medium | Biweekly Contest 68 | -| 2117 | [Abbreviating the Product of a Range](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README_EN.md) | `Math` | Hard | Biweekly Contest 68 | -| 2118 | [Build the Equation](/solution/2100-2199/2118.Build%20the%20Equation/README_EN.md) | `Database` | Hard | 🔒 | -| 2119 | [A Number After a Double Reversal](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README_EN.md) | `Math` | Easy | Weekly Contest 273 | -| 2120 | [Execution of All Suffix Instructions Staying in a Grid](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README_EN.md) | `String`,`Simulation` | Medium | Weekly Contest 273 | -| 2121 | [Intervals Between Identical Elements](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 273 | -| 2122 | [Recover the Original Array](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README_EN.md) | `Array`,`Hash Table`,`Enumeration`,`Sorting` | Hard | Weekly Contest 273 | -| 2123 | [Minimum Operations to Remove Adjacent Ones in Matrix](/solution/2100-2199/2123.Minimum%20Operations%20to%20Remove%20Adjacent%20Ones%20in%20Matrix/README_EN.md) | `Graph`,`Array`,`Matrix` | Hard | 🔒 | -| 2124 | [Check if All A's Appears Before All B's](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README_EN.md) | `String` | Easy | Weekly Contest 274 | -| 2125 | [Number of Laser Beams in a Bank](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README_EN.md) | `Array`,`Math`,`String`,`Matrix` | Medium | Weekly Contest 274 | -| 2126 | [Destroying Asteroids](/solution/2100-2199/2126.Destroying%20Asteroids/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 274 | -| 2127 | [Maximum Employees to Be Invited to a Meeting](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README_EN.md) | `Depth-First Search`,`Graph`,`Topological Sort` | Hard | Weekly Contest 274 | -| 2128 | [Remove All Ones With Row and Column Flips](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Matrix` | Medium | 🔒 | -| 2129 | [Capitalize the Title](/solution/2100-2199/2129.Capitalize%20the%20Title/README_EN.md) | `String` | Easy | Biweekly Contest 69 | -| 2130 | [Maximum Twin Sum of a Linked List](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README_EN.md) | `Stack`,`Linked List`,`Two Pointers` | Medium | Biweekly Contest 69 | -| 2131 | [Longest Palindrome by Concatenating Two Letter Words](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 69 | -| 2132 | [Stamping the Grid](/solution/2100-2199/2132.Stamping%20the%20Grid/README_EN.md) | `Greedy`,`Array`,`Matrix`,`Prefix Sum` | Hard | Biweekly Contest 69 | -| 2133 | [Check if Every Row and Column Contains All Numbers](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Easy | Weekly Contest 275 | -| 2134 | [Minimum Swaps to Group All 1's Together II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 275 | -| 2135 | [Count Words Obtained After Adding a Letter](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 275 | -| 2136 | [Earliest Possible Day of Full Bloom](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Weekly Contest 275 | -| 2137 | [Pour Water Between Buckets to Make Water Levels Equal](/solution/2100-2199/2137.Pour%20Water%20Between%20Buckets%20to%20Make%20Water%20Levels%20Equal/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 | -| 2138 | [Divide a String Into Groups of Size k](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 276 | -| 2139 | [Minimum Moves to Reach Target Score](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 276 | -| 2140 | [Solving Questions With Brainpower](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 276 | -| 2141 | [Maximum Running Time of N Computers](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Sorting` | Hard | Weekly Contest 276 | -| 2142 | [The Number of Passengers in Each Bus I](/solution/2100-2199/2142.The%20Number%20of%20Passengers%20in%20Each%20Bus%20I/README_EN.md) | `Database` | Medium | 🔒 | -| 2143 | [Choose Numbers From Two Arrays in Range](/solution/2100-2199/2143.Choose%20Numbers%20From%20Two%20Arrays%20in%20Range/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | -| 2144 | [Minimum Cost of Buying Candies With Discount](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Biweekly Contest 70 | -| 2145 | [Count the Hidden Sequences](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 70 | -| 2146 | [K Highest Ranked Items Within a Price Range](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 70 | -| 2147 | [Number of Ways to Divide a Long Corridor](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README_EN.md) | `Math`,`String`,`Dynamic Programming` | Hard | Biweekly Contest 70 | -| 2148 | [Count Elements With Strictly Smaller and Greater Elements](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 277 | -| 2149 | [Rearrange Array Elements by Sign](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Medium | Weekly Contest 277 | -| 2150 | [Find All Lonely Numbers in the Array](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 277 | -| 2151 | [Maximum Good People Based on Statements](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Hard | Weekly Contest 277 | -| 2152 | [Minimum Number of Lines to Cover Points](/solution/2100-2199/2152.Minimum%20Number%20of%20Lines%20to%20Cover%20Points/README_EN.md) | `Bit Manipulation`,`Geometry`,`Array`,`Hash Table`,`Math`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | 🔒 | -| 2153 | [The Number of Passengers in Each Bus II](/solution/2100-2199/2153.The%20Number%20of%20Passengers%20in%20Each%20Bus%20II/README_EN.md) | `Database` | Hard | 🔒 | -| 2154 | [Keep Multiplying Found Values by Two](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation` | Easy | Weekly Contest 278 | -| 2155 | [All Divisions With the Highest Score of a Binary Array](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README_EN.md) | `Array` | Medium | Weekly Contest 278 | -| 2156 | [Find Substring With Given Hash Value](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README_EN.md) | `String`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 278 | -| 2157 | [Groups of Strings](/solution/2100-2199/2157.Groups%20of%20Strings/README_EN.md) | `Bit Manipulation`,`Union Find`,`String` | Hard | Weekly Contest 278 | -| 2158 | [Amount of New Area Painted Each Day](/solution/2100-2199/2158.Amount%20of%20New%20Area%20Painted%20Each%20Day/README_EN.md) | `Segment Tree`,`Array`,`Ordered Set` | Hard | 🔒 | -| 2159 | [Order Two Columns Independently](/solution/2100-2199/2159.Order%20Two%20Columns%20Independently/README_EN.md) | `Database` | Medium | 🔒 | -| 2160 | [Minimum Sum of Four Digit Number After Splitting Digits](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README_EN.md) | `Greedy`,`Math`,`Sorting` | Easy | Biweekly Contest 71 | -| 2161 | [Partition Array According to Given Pivot](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Medium | Biweekly Contest 71 | -| 2162 | [Minimum Cost to Set Cooking Time](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README_EN.md) | `Math`,`Enumeration` | Medium | Biweekly Contest 71 | -| 2163 | [Minimum Difference in Sums After Removal of Elements](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README_EN.md) | `Array`,`Dynamic Programming`,`Heap (Priority Queue)` | Hard | Biweekly Contest 71 | -| 2164 | [Sort Even and Odd Indices Independently](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 279 | -| 2165 | [Smallest Value of the Rearranged Number](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README_EN.md) | `Math`,`Sorting` | Medium | Weekly Contest 279 | -| 2166 | [Design Bitset](/solution/2100-2199/2166.Design%20Bitset/README_EN.md) | `Design`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 279 | -| 2167 | [Minimum Time to Remove All Cars Containing Illegal Goods](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 279 | -| 2168 | [Unique Substrings With Equal Digit Frequency](/solution/2100-2199/2168.Unique%20Substrings%20With%20Equal%20Digit%20Frequency/README_EN.md) | `Hash Table`,`String`,`Counting`,`Hash Function`,`Rolling Hash` | Medium | 🔒 | -| 2169 | [Count Operations to Obtain Zero](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 280 | -| 2170 | [Minimum Operations to Make the Array Alternating](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 280 | -| 2171 | [Removing Minimum Number of Magic Beans](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README_EN.md) | `Greedy`,`Array`,`Enumeration`,`Prefix Sum`,`Sorting` | Medium | Weekly Contest 280 | -| 2172 | [Maximum AND Sum of Array](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 280 | -| 2173 | [Longest Winning Streak](/solution/2100-2199/2173.Longest%20Winning%20Streak/README_EN.md) | `Database` | Hard | 🔒 | -| 2174 | [Remove All Ones With Row and Column Flips II](/solution/2100-2199/2174.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips%20II/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 | -| 2175 | [The Change in Global Rankings](/solution/2100-2199/2175.The%20Change%20in%20Global%20Rankings/README_EN.md) | `Database` | Medium | 🔒 | -| 2176 | [Count Equal and Divisible Pairs in an Array](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README_EN.md) | `Array` | Easy | Biweekly Contest 72 | -| 2177 | [Find Three Consecutive Integers That Sum to a Given Number](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README_EN.md) | `Math`,`Simulation` | Medium | Biweekly Contest 72 | -| 2178 | [Maximum Split of Positive Even Integers](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README_EN.md) | `Greedy`,`Math`,`Backtracking` | Medium | Biweekly Contest 72 | -| 2179 | [Count Good Triplets in an Array](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | Biweekly Contest 72 | -| 2180 | [Count Integers With Even Digit Sum](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 281 | -| 2181 | [Merge Nodes in Between Zeros](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README_EN.md) | `Linked List`,`Simulation` | Medium | Weekly Contest 281 | -| 2182 | [Construct String With Repeat Limit](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Heap (Priority Queue)` | Medium | Weekly Contest 281 | -| 2183 | [Count Array Pairs Divisible by K](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README_EN.md) | `Array`,`Math`,`Number Theory` | Hard | Weekly Contest 281 | -| 2184 | [Number of Ways to Build Sturdy Brick Wall](/solution/2100-2199/2184.Number%20of%20Ways%20to%20Build%20Sturdy%20Brick%20Wall/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Medium | 🔒 | -| 2185 | [Counting Words With a Given Prefix](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README_EN.md) | `Array`,`String`,`String Matching` | Easy | Weekly Contest 282 | -| 2186 | [Minimum Number of Steps to Make Two Strings Anagram II](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 282 | -| 2187 | [Minimum Time to Complete Trips](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 282 | -| 2188 | [Minimum Time to Finish the Race](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 282 | -| 2189 | [Number of Ways to Build House of Cards](/solution/2100-2199/2189.Number%20of%20Ways%20to%20Build%20House%20of%20Cards/README_EN.md) | `Math`,`Dynamic Programming` | Medium | 🔒 | -| 2190 | [Most Frequent Number Following Key In an Array](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 73 | -| 2191 | [Sort the Jumbled Numbers](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 73 | -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | Biweekly Contest 73 | -| 2193 | [Minimum Number of Moves to Make Palindrome](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README_EN.md) | `Greedy`,`Binary Indexed Tree`,`Two Pointers`,`String` | Hard | Biweekly Contest 73 | -| 2194 | [Cells in a Range on an Excel Sheet](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README_EN.md) | `String` | Easy | Weekly Contest 283 | -| 2195 | [Append K Integers With Minimal Sum](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Medium | Weekly Contest 283 | -| 2196 | [Create Binary Tree From Descriptions](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README_EN.md) | `Tree`,`Array`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 283 | -| 2197 | [Replace Non-Coprime Numbers in Array](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README_EN.md) | `Stack`,`Array`,`Math`,`Number Theory` | Hard | Weekly Contest 283 | -| 2198 | [Number of Single Divisor Triplets](/solution/2100-2199/2198.Number%20of%20Single%20Divisor%20Triplets/README_EN.md) | `Math` | Medium | 🔒 | -| 2199 | [Finding the Topic of Each Post](/solution/2100-2199/2199.Finding%20the%20Topic%20of%20Each%20Post/README_EN.md) | `Database` | Hard | 🔒 | -| 2200 | [Find All K-Distant Indices in an Array](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README_EN.md) | `Array`,`Two Pointers` | Easy | Weekly Contest 284 | -| 2201 | [Count Artifacts That Can Be Extracted](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 284 | -| 2202 | [Maximize the Topmost Element After K Moves](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 284 | -| 2203 | [Minimum Weighted Subgraph With the Required Paths](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README_EN.md) | `Graph`,`Shortest Path` | Hard | Weekly Contest 284 | -| 2204 | [Distance to a Cycle in Undirected Graph](/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Hard | 🔒 | -| 2205 | [The Number of Users That Are Eligible for Discount](/solution/2200-2299/2205.The%20Number%20of%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) | `Database` | Easy | 🔒 | -| 2206 | [Divide Array Into Equal Pairs](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 74 | -| 2207 | [Maximize Number of Subsequences in a String](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README_EN.md) | `Greedy`,`String`,`Prefix Sum` | Medium | Biweekly Contest 74 | -| 2208 | [Minimum Operations to Halve Array Sum](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Biweekly Contest 74 | -| 2209 | [Minimum White Tiles After Covering With Carpets](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum` | Hard | Biweekly Contest 74 | -| 2210 | [Count Hills and Valleys in an Array](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 285 | -| 2211 | [Count Collisions on a Road](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README_EN.md) | `Stack`,`String`,`Simulation` | Medium | Weekly Contest 285 | -| 2212 | [Maximum Points in an Archery Competition](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Medium | Weekly Contest 285 | -| 2213 | [Longest Substring of One Repeating Character](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README_EN.md) | `Segment Tree`,`Array`,`String`,`Ordered Set` | Hard | Weekly Contest 285 | -| 2214 | [Minimum Health to Beat Game](/solution/2200-2299/2214.Minimum%20Health%20to%20Beat%20Game/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 | -| 2215 | [Find the Difference of Two Arrays](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 286 | -| 2216 | [Minimum Deletions to Make Array Beautiful](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README_EN.md) | `Stack`,`Greedy`,`Array` | Medium | Weekly Contest 286 | -| 2217 | [Find Palindrome With Fixed Length](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 286 | -| 2218 | [Maximum Value of K Coins From Piles](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 286 | -| 2219 | [Maximum Sum Score of Array](/solution/2200-2299/2219.Maximum%20Sum%20Score%20of%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | 🔒 | -| 2220 | [Minimum Bit Flips to Convert Number](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README_EN.md) | `Bit Manipulation` | Easy | Biweekly Contest 75 | -| 2221 | [Find Triangular Sum of an Array](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README_EN.md) | `Array`,`Math`,`Combinatorics`,`Simulation` | Medium | Biweekly Contest 75 | -| 2222 | [Number of Ways to Select Buildings](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 75 | -| 2223 | [Sum of Scores of Built Strings](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README_EN.md) | `String`,`Binary Search`,`String Matching`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Hard | Biweekly Contest 75 | -| 2224 | [Minimum Number of Operations to Convert Time](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README_EN.md) | `Greedy`,`String` | Easy | Weekly Contest 287 | -| 2225 | [Find Players With Zero or One Losses](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Weekly Contest 287 | -| 2226 | [Maximum Candies Allocated to K Children](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 287 | -| 2227 | [Encrypt and Decrypt Strings](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README_EN.md) | `Design`,`Trie`,`Array`,`Hash Table`,`String` | Hard | Weekly Contest 287 | -| 2228 | [Users With Two Purchases Within Seven Days](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README_EN.md) | `Database` | Medium | 🔒 | -| 2229 | [Check if an Array Is Consecutive](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | 🔒 | -| 2230 | [The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) | `Database` | Easy | 🔒 | -| 2231 | [Largest Number After Digit Swaps by Parity](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README_EN.md) | `Sorting`,`Heap (Priority Queue)` | Easy | Weekly Contest 288 | -| 2232 | [Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md) | `String`,`Enumeration` | Medium | Weekly Contest 288 | -| 2233 | [Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 288 | -| 2234 | [Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Hard | Weekly Contest 288 | -| 2235 | [Add Two Integers](/solution/2200-2299/2235.Add%20Two%20Integers/README_EN.md) | `Math` | Easy | | -| 2236 | [Root Equals Sum of Children](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README_EN.md) | `Tree`,`Binary Tree` | Easy | | -| 2237 | [Count Positions on Street With Required Brightness](/solution/2200-2299/2237.Count%20Positions%20on%20Street%20With%20Required%20Brightness/README_EN.md) | `Array`,`Prefix Sum` | Medium | 🔒 | -| 2238 | [Number of Times a Driver Was a Passenger](/solution/2200-2299/2238.Number%20of%20Times%20a%20Driver%20Was%20a%20Passenger/README_EN.md) | `Database` | Medium | 🔒 | -| 2239 | [Find Closest Number to Zero](/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README_EN.md) | `Array` | Easy | Biweekly Contest 76 | -| 2240 | [Number of Ways to Buy Pens and Pencils](/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README_EN.md) | `Math`,`Enumeration` | Medium | Biweekly Contest 76 | -| 2241 | [Design an ATM Machine](/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README_EN.md) | `Greedy`,`Design`,`Array` | Medium | Biweekly Contest 76 | -| 2242 | [Maximum Score of a Node Sequence](/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README_EN.md) | `Graph`,`Array`,`Enumeration`,`Sorting` | Hard | Biweekly Contest 76 | -| 2243 | [Calculate Digit Sum of a String](/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 289 | -| 2244 | [Minimum Rounds to Complete All Tasks](/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 289 | -| 2245 | [Maximum Trailing Zeros in a Cornered Path](/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 289 | -| 2246 | [Longest Path With Different Adjacent Characters](/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Topological Sort`,`Array`,`String` | Hard | Weekly Contest 289 | -| 2247 | [Maximum Cost of Trip With K Highways](/solution/2200-2299/2247.Maximum%20Cost%20of%20Trip%20With%20K%20Highways/README_EN.md) | `Bit Manipulation`,`Graph`,`Dynamic Programming`,`Bitmask` | Hard | 🔒 | -| 2248 | [Intersection of Multiple Arrays](/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Easy | Weekly Contest 290 | -| 2249 | [Count Lattice Points Inside a Circle](/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README_EN.md) | `Geometry`,`Array`,`Hash Table`,`Math`,`Enumeration` | Medium | Weekly Contest 290 | -| 2250 | [Count Number of Rectangles Containing Each Point](/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README_EN.md) | `Binary Indexed Tree`,`Array`,`Binary Search`,`Sorting` | Medium | Weekly Contest 290 | -| 2251 | [Number of Flowers in Full Bloom](/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Ordered Set`,`Prefix Sum`,`Sorting` | Hard | Weekly Contest 290 | -| 2252 | [Dynamic Pivoting of a Table](/solution/2200-2299/2252.Dynamic%20Pivoting%20of%20a%20Table/README_EN.md) | `Database` | Hard | 🔒 | -| 2253 | [Dynamic Unpivoting of a Table](/solution/2200-2299/2253.Dynamic%20Unpivoting%20of%20a%20Table/README_EN.md) | `Database` | Hard | 🔒 | -| 2254 | [Design Video Sharing Platform](/solution/2200-2299/2254.Design%20Video%20Sharing%20Platform/README_EN.md) | `Stack`,`Design`,`Hash Table`,`Ordered Set` | Hard | 🔒 | -| 2255 | [Count Prefixes of a Given String](/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 77 | -| 2256 | [Minimum Average Difference](/solution/2200-2299/2256.Minimum%20Average%20Difference/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 77 | -| 2257 | [Count Unguarded Cells in the Grid](/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Biweekly Contest 77 | -| 2258 | [Escape the Spreading Fire](/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README_EN.md) | `Breadth-First Search`,`Array`,`Binary Search`,`Matrix` | Hard | Biweekly Contest 77 | -| 2259 | [Remove Digit From Number to Maximize Result](/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README_EN.md) | `Greedy`,`String`,`Enumeration` | Easy | Weekly Contest 291 | -| 2260 | [Minimum Consecutive Cards to Pick Up](/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 291 | -| 2261 | [K Divisible Elements Subarrays](/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README_EN.md) | `Trie`,`Array`,`Hash Table`,`Enumeration`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 291 | -| 2262 | [Total Appeal of A String](/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming` | Hard | Weekly Contest 291 | -| 2263 | [Make Array Non-decreasing or Non-increasing](/solution/2200-2299/2263.Make%20Array%20Non-decreasing%20or%20Non-increasing/README_EN.md) | `Greedy`,`Dynamic Programming` | Hard | 🔒 | -| 2264 | [Largest 3-Same-Digit Number in String](/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README_EN.md) | `String` | Easy | Weekly Contest 292 | -| 2265 | [Count Nodes Equal to Average of Subtree](/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 292 | -| 2266 | [Count Number of Texts](/solution/2200-2299/2266.Count%20Number%20of%20Texts/README_EN.md) | `Hash Table`,`Math`,`String`,`Dynamic Programming` | Medium | Weekly Contest 292 | -| 2267 | [Check if There Is a Valid Parentheses String Path](/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 292 | -| 2268 | [Minimum Number of Keypresses](/solution/2200-2299/2268.Minimum%20Number%20of%20Keypresses/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | 🔒 | -| 2269 | [Find the K-Beauty of a Number](/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README_EN.md) | `Math`,`String`,`Sliding Window` | Easy | Biweekly Contest 78 | -| 2270 | [Number of Ways to Split Array](/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 78 | -| 2271 | [Maximum White Tiles Covered by a Carpet](/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 78 | -| 2272 | [Substring With Largest Variance](/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 78 | -| 2273 | [Find Resultant Array After Removing Anagrams](/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Easy | Weekly Contest 293 | -| 2274 | [Maximum Consecutive Floors Without Special Floors](/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 293 | -| 2275 | [Largest Combination With Bitwise AND Greater Than Zero](/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 293 | -| 2276 | [Count Integers in Intervals](/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README_EN.md) | `Design`,`Segment Tree`,`Ordered Set` | Hard | Weekly Contest 293 | -| 2277 | [Closest Node to Path in Tree](/solution/2200-2299/2277.Closest%20Node%20to%20Path%20in%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array` | Hard | 🔒 | -| 2278 | [Percentage of Letter in String](/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README_EN.md) | `String` | Easy | Weekly Contest 294 | -| 2279 | [Maximum Bags With Full Capacity of Rocks](/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 294 | -| 2280 | [Minimum Lines to Represent a Line Chart](/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README_EN.md) | `Geometry`,`Array`,`Math`,`Number Theory`,`Sorting` | Medium | Weekly Contest 294 | -| 2281 | [Sum of Total Strength of Wizards](/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README_EN.md) | `Stack`,`Array`,`Prefix Sum`,`Monotonic Stack` | Hard | Weekly Contest 294 | -| 2282 | [Number of People That Can Be Seen in a Grid](/solution/2200-2299/2282.Number%20of%20People%20That%20Can%20Be%20Seen%20in%20a%20Grid/README_EN.md) | `Stack`,`Array`,`Matrix`,`Monotonic Stack` | Medium | 🔒 | -| 2283 | [Check if Number Has Equal Digit Count and Digit Value](/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 79 | -| 2284 | [Sender With Largest Word Count](/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 79 | -| 2285 | [Maximum Total Importance of Roads](/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README_EN.md) | `Greedy`,`Graph`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 79 | -| 2286 | [Booking Concert Tickets in Groups](/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README_EN.md) | `Design`,`Binary Indexed Tree`,`Segment Tree`,`Binary Search` | Hard | Biweekly Contest 79 | -| 2287 | [Rearrange Characters to Make Target String](/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 295 | -| 2288 | [Apply Discount to Prices](/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README_EN.md) | `String` | Medium | Weekly Contest 295 | -| 2289 | [Steps to Make Array Non-decreasing](/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README_EN.md) | `Stack`,`Array`,`Linked List`,`Monotonic Stack` | Medium | Weekly Contest 295 | -| 2290 | [Minimum Obstacle Removal to Reach Corner](/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 295 | -| 2291 | [Maximum Profit From Trading Stocks](/solution/2200-2299/2291.Maximum%20Profit%20From%20Trading%20Stocks/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | -| 2292 | [Products With Three or More Orders in Two Consecutive Years](/solution/2200-2299/2292.Products%20With%20Three%20or%20More%20Orders%20in%20Two%20Consecutive%20Years/README_EN.md) | `Database` | Medium | 🔒 | -| 2293 | [Min Max Game](/solution/2200-2299/2293.Min%20Max%20Game/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 296 | -| 2294 | [Partition Array Such That Maximum Difference Is K](/solution/2200-2299/2294.Partition%20Array%20Such%20That%20Maximum%20Difference%20Is%20K/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 296 | -| 2295 | [Replace Elements in an Array](/solution/2200-2299/2295.Replace%20Elements%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 296 | -| 2296 | [Design a Text Editor](/solution/2200-2299/2296.Design%20a%20Text%20Editor/README_EN.md) | `Stack`,`Design`,`Linked List`,`String`,`Doubly-Linked List`,`Simulation` | Hard | Weekly Contest 296 | -| 2297 | [Jump Game VIII](/solution/2200-2299/2297.Jump%20Game%20VIII/README_EN.md) | `Stack`,`Graph`,`Array`,`Dynamic Programming`,`Shortest Path`,`Monotonic Stack` | Medium | 🔒 | -| 2298 | [Tasks Count in the Weekend](/solution/2200-2299/2298.Tasks%20Count%20in%20the%20Weekend/README_EN.md) | `Database` | Medium | 🔒 | -| 2299 | [Strong Password Checker II](/solution/2200-2299/2299.Strong%20Password%20Checker%20II/README_EN.md) | `String` | Easy | Biweekly Contest 80 | -| 2300 | [Successful Pairs of Spells and Potions](/solution/2300-2399/2300.Successful%20Pairs%20of%20Spells%20and%20Potions/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 80 | -| 2301 | [Match Substring After Replacement](/solution/2300-2399/2301.Match%20Substring%20After%20Replacement/README_EN.md) | `Array`,`Hash Table`,`String`,`String Matching` | Hard | Biweekly Contest 80 | -| 2302 | [Count Subarrays With Score Less Than K](/solution/2300-2399/2302.Count%20Subarrays%20With%20Score%20Less%20Than%20K/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Hard | Biweekly Contest 80 | -| 2303 | [Calculate Amount Paid in Taxes](/solution/2300-2399/2303.Calculate%20Amount%20Paid%20in%20Taxes/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 297 | -| 2304 | [Minimum Path Cost in a Grid](/solution/2300-2399/2304.Minimum%20Path%20Cost%20in%20a%20Grid/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 297 | -| 2305 | [Fair Distribution of Cookies](/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 297 | -| 2306 | [Naming a Company](/solution/2300-2399/2306.Naming%20a%20Company/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String`,`Enumeration` | Hard | Weekly Contest 297 | -| 2307 | [Check for Contradictions in Equations](/solution/2300-2399/2307.Check%20for%20Contradictions%20in%20Equations/README_EN.md) | `Depth-First Search`,`Union Find`,`Graph`,`Array` | Hard | 🔒 | -| 2308 | [Arrange Table by Gender](/solution/2300-2399/2308.Arrange%20Table%20by%20Gender/README_EN.md) | `Database` | Medium | 🔒 | -| 2309 | [Greatest English Letter in Upper and Lower Case](/solution/2300-2399/2309.Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case/README_EN.md) | `Hash Table`,`String`,`Enumeration` | Easy | Weekly Contest 298 | -| 2310 | [Sum of Numbers With Units Digit K](/solution/2300-2399/2310.Sum%20of%20Numbers%20With%20Units%20Digit%20K/README_EN.md) | `Greedy`,`Math`,`Dynamic Programming`,`Enumeration` | Medium | Weekly Contest 298 | -| 2311 | [Longest Binary Subsequence Less Than or Equal to K](/solution/2300-2399/2311.Longest%20Binary%20Subsequence%20Less%20Than%20or%20Equal%20to%20K/README_EN.md) | `Greedy`,`Memoization`,`String`,`Dynamic Programming` | Medium | Weekly Contest 298 | -| 2312 | [Selling Pieces of Wood](/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 298 | -| 2313 | [Minimum Flips in Binary Tree to Get Result](/solution/2300-2399/2313.Minimum%20Flips%20in%20Binary%20Tree%20to%20Get%20Result/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Hard | 🔒 | -| 2314 | [The First Day of the Maximum Recorded Degree in Each City](/solution/2300-2399/2314.The%20First%20Day%20of%20the%20Maximum%20Recorded%20Degree%20in%20Each%20City/README_EN.md) | `Database` | Medium | 🔒 | -| 2315 | [Count Asterisks](/solution/2300-2399/2315.Count%20Asterisks/README_EN.md) | `String` | Easy | Biweekly Contest 81 | -| 2316 | [Count Unreachable Pairs of Nodes in an Undirected Graph](/solution/2300-2399/2316.Count%20Unreachable%20Pairs%20of%20Nodes%20in%20an%20Undirected%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Biweekly Contest 81 | -| 2317 | [Maximum XOR After Operations](/solution/2300-2399/2317.Maximum%20XOR%20After%20Operations/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Medium | Biweekly Contest 81 | -| 2318 | [Number of Distinct Roll Sequences](/solution/2300-2399/2318.Number%20of%20Distinct%20Roll%20Sequences/README_EN.md) | `Memoization`,`Dynamic Programming` | Hard | Biweekly Contest 81 | -| 2319 | [Check if Matrix Is X-Matrix](/solution/2300-2399/2319.Check%20if%20Matrix%20Is%20X-Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 299 | -| 2320 | [Count Number of Ways to Place Houses](/solution/2300-2399/2320.Count%20Number%20of%20Ways%20to%20Place%20Houses/README_EN.md) | `Dynamic Programming` | Medium | Weekly Contest 299 | -| 2321 | [Maximum Score Of Spliced Array](/solution/2300-2399/2321.Maximum%20Score%20Of%20Spliced%20Array/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 299 | -| 2322 | [Minimum Score After Removals on a Tree](/solution/2300-2399/2322.Minimum%20Score%20After%20Removals%20on%20a%20Tree/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Array` | Hard | Weekly Contest 299 | -| 2323 | [Find Minimum Time to Finish All Jobs II](/solution/2300-2399/2323.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs%20II/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | -| 2324 | [Product Sales Analysis IV](/solution/2300-2399/2324.Product%20Sales%20Analysis%20IV/README_EN.md) | `Database` | Medium | 🔒 | -| 2325 | [Decode the Message](/solution/2300-2399/2325.Decode%20the%20Message/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 300 | -| 2326 | [Spiral Matrix IV](/solution/2300-2399/2326.Spiral%20Matrix%20IV/README_EN.md) | `Array`,`Linked List`,`Matrix`,`Simulation` | Medium | Weekly Contest 300 | -| 2327 | [Number of People Aware of a Secret](/solution/2300-2399/2327.Number%20of%20People%20Aware%20of%20a%20Secret/README_EN.md) | `Queue`,`Dynamic Programming`,`Simulation` | Medium | Weekly Contest 300 | -| 2328 | [Number of Increasing Paths in a Grid](/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`,`Memoization`,`Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 300 | -| 2329 | [Product Sales Analysis V](/solution/2300-2399/2329.Product%20Sales%20Analysis%20V/README_EN.md) | `Database` | Easy | 🔒 | -| 2330 | [Valid Palindrome IV](/solution/2300-2399/2330.Valid%20Palindrome%20IV/README_EN.md) | `Two Pointers`,`String` | Medium | 🔒 | -| 2331 | [Evaluate Boolean Binary Tree](/solution/2300-2399/2331.Evaluate%20Boolean%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | Biweekly Contest 82 | -| 2332 | [The Latest Time to Catch a Bus](/solution/2300-2399/2332.The%20Latest%20Time%20to%20Catch%20a%20Bus/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 82 | -| 2333 | [Minimum Sum of Squared Difference](/solution/2300-2399/2333.Minimum%20Sum%20of%20Squared%20Difference/README_EN.md) | `Array`,`Math`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 82 | -| 2334 | [Subarray With Elements Greater Than Varying Threshold](/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README_EN.md) | `Stack`,`Union Find`,`Array`,`Monotonic Stack` | Hard | Biweekly Contest 82 | -| 2335 | [Minimum Amount of Time to Fill Cups](/solution/2300-2399/2335.Minimum%20Amount%20of%20Time%20to%20Fill%20Cups/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Easy | Weekly Contest 301 | -| 2336 | [Smallest Number in Infinite Set](/solution/2300-2399/2336.Smallest%20Number%20in%20Infinite%20Set/README_EN.md) | `Design`,`Hash Table`,`Heap (Priority Queue)` | Medium | Weekly Contest 301 | -| 2337 | [Move Pieces to Obtain a String](/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README_EN.md) | `Two Pointers`,`String` | Medium | Weekly Contest 301 | -| 2338 | [Count the Number of Ideal Arrays](/solution/2300-2399/2338.Count%20the%20Number%20of%20Ideal%20Arrays/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics`,`Number Theory` | Hard | Weekly Contest 301 | -| 2339 | [All the Matches of the League](/solution/2300-2399/2339.All%20the%20Matches%20of%20the%20League/README_EN.md) | `Database` | Easy | 🔒 | -| 2340 | [Minimum Adjacent Swaps to Make a Valid Array](/solution/2300-2399/2340.Minimum%20Adjacent%20Swaps%20to%20Make%20a%20Valid%20Array/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 | -| 2341 | [Maximum Number of Pairs in Array](/solution/2300-2399/2341.Maximum%20Number%20of%20Pairs%20in%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 302 | -| 2342 | [Max Sum of a Pair With Equal Sum of Digits](/solution/2300-2399/2342.Max%20Sum%20of%20a%20Pair%20With%20Equal%20Sum%20of%20Digits/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 302 | -| 2343 | [Query Kth Smallest Trimmed Number](/solution/2300-2399/2343.Query%20Kth%20Smallest%20Trimmed%20Number/README_EN.md) | `Array`,`String`,`Divide and Conquer`,`Quickselect`,`Radix Sort`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 302 | -| 2344 | [Minimum Deletions to Make Array Divisible](/solution/2300-2399/2344.Minimum%20Deletions%20to%20Make%20Array%20Divisible/README_EN.md) | `Array`,`Math`,`Number Theory`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 302 | -| 2345 | [Finding the Number of Visible Mountains](/solution/2300-2399/2345.Finding%20the%20Number%20of%20Visible%20Mountains/README_EN.md) | `Stack`,`Array`,`Sorting`,`Monotonic Stack` | Medium | 🔒 | -| 2346 | [Compute the Rank as a Percentage](/solution/2300-2399/2346.Compute%20the%20Rank%20as%20a%20Percentage/README_EN.md) | `Database` | Medium | 🔒 | -| 2347 | [Best Poker Hand](/solution/2300-2399/2347.Best%20Poker%20Hand/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 83 | -| 2348 | [Number of Zero-Filled Subarrays](/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README_EN.md) | `Array`,`Math` | Medium | Biweekly Contest 83 | -| 2349 | [Design a Number Container System](/solution/2300-2399/2349.Design%20a%20Number%20Container%20System/README_EN.md) | `Design`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Biweekly Contest 83 | -| 2350 | [Shortest Impossible Sequence of Rolls](/solution/2300-2399/2350.Shortest%20Impossible%20Sequence%20of%20Rolls/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Hard | Biweekly Contest 83 | -| 2351 | [First Letter to Appear Twice](/solution/2300-2399/2351.First%20Letter%20to%20Appear%20Twice/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Counting` | Easy | Weekly Contest 303 | -| 2352 | [Equal Row and Column Pairs](/solution/2300-2399/2352.Equal%20Row%20and%20Column%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Matrix`,`Simulation` | Medium | Weekly Contest 303 | -| 2353 | [Design a Food Rating System](/solution/2300-2399/2353.Design%20a%20Food%20Rating%20System/README_EN.md) | `Design`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 303 | -| 2354 | [Number of Excellent Pairs](/solution/2300-2399/2354.Number%20of%20Excellent%20Pairs/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Binary Search` | Hard | Weekly Contest 303 | -| 2355 | [Maximum Number of Books You Can Take](/solution/2300-2399/2355.Maximum%20Number%20of%20Books%20You%20Can%20Take/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Hard | 🔒 | -| 2356 | [Number of Unique Subjects Taught by Each Teacher](/solution/2300-2399/2356.Number%20of%20Unique%20Subjects%20Taught%20by%20Each%20Teacher/README_EN.md) | `Database` | Easy | | -| 2357 | [Make Array Zero by Subtracting Equal Amounts](/solution/2300-2399/2357.Make%20Array%20Zero%20by%20Subtracting%20Equal%20Amounts/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 304 | -| 2358 | [Maximum Number of Groups Entering a Competition](/solution/2300-2399/2358.Maximum%20Number%20of%20Groups%20Entering%20a%20Competition/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search` | Medium | Weekly Contest 304 | -| 2359 | [Find Closest Node to Given Two Nodes](/solution/2300-2399/2359.Find%20Closest%20Node%20to%20Given%20Two%20Nodes/README_EN.md) | `Depth-First Search`,`Graph` | Medium | Weekly Contest 304 | -| 2360 | [Longest Cycle in a Graph](/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README_EN.md) | `Depth-First Search`,`Graph`,`Topological Sort` | Hard | Weekly Contest 304 | -| 2361 | [Minimum Costs Using the Train Line](/solution/2300-2399/2361.Minimum%20Costs%20Using%20the%20Train%20Line/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | -| 2362 | [Generate the Invoice](/solution/2300-2399/2362.Generate%20the%20Invoice/README_EN.md) | `Database` | Hard | 🔒 | -| 2363 | [Merge Similar Items](/solution/2300-2399/2363.Merge%20Similar%20Items/README_EN.md) | `Array`,`Hash Table`,`Ordered Set`,`Sorting` | Easy | Biweekly Contest 84 | -| 2364 | [Count Number of Bad Pairs](/solution/2300-2399/2364.Count%20Number%20of%20Bad%20Pairs/README_EN.md) | `Array`,`Hash Table` | Medium | Biweekly Contest 84 | -| 2365 | [Task Scheduler II](/solution/2300-2399/2365.Task%20Scheduler%20II/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Biweekly Contest 84 | -| 2366 | [Minimum Replacements to Sort the Array](/solution/2300-2399/2366.Minimum%20Replacements%20to%20Sort%20the%20Array/README_EN.md) | `Greedy`,`Array`,`Math` | Hard | Biweekly Contest 84 | -| 2367 | [Number of Arithmetic Triplets](/solution/2300-2399/2367.Number%20of%20Arithmetic%20Triplets/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Enumeration` | Easy | Weekly Contest 305 | -| 2368 | [Reachable Nodes With Restrictions](/solution/2300-2399/2368.Reachable%20Nodes%20With%20Restrictions/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table` | Medium | Weekly Contest 305 | -| 2369 | [Check if There is a Valid Partition For The Array](/solution/2300-2399/2369.Check%20if%20There%20is%20a%20Valid%20Partition%20For%20The%20Array/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 305 | -| 2370 | [Longest Ideal Subsequence](/solution/2300-2399/2370.Longest%20Ideal%20Subsequence/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming` | Medium | Weekly Contest 305 | -| 2371 | [Minimize Maximum Value in a Grid](/solution/2300-2399/2371.Minimize%20Maximum%20Value%20in%20a%20Grid/README_EN.md) | `Union Find`,`Graph`,`Topological Sort`,`Array`,`Matrix`,`Sorting` | Hard | 🔒 | -| 2372 | [Calculate the Influence of Each Salesperson](/solution/2300-2399/2372.Calculate%20the%20Influence%20of%20Each%20Salesperson/README_EN.md) | `Database` | Medium | 🔒 | -| 2373 | [Largest Local Values in a Matrix](/solution/2300-2399/2373.Largest%20Local%20Values%20in%20a%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 306 | -| 2374 | [Node With Highest Edge Score](/solution/2300-2399/2374.Node%20With%20Highest%20Edge%20Score/README_EN.md) | `Graph`,`Hash Table` | Medium | Weekly Contest 306 | -| 2375 | [Construct Smallest Number From DI String](/solution/2300-2399/2375.Construct%20Smallest%20Number%20From%20DI%20String/README_EN.md) | `Stack`,`Greedy`,`String`,`Backtracking` | Medium | Weekly Contest 306 | -| 2376 | [Count Special Integers](/solution/2300-2399/2376.Count%20Special%20Integers/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Weekly Contest 306 | -| 2377 | [Sort the Olympic Table](/solution/2300-2399/2377.Sort%20the%20Olympic%20Table/README_EN.md) | `Database` | Easy | 🔒 | -| 2378 | [Choose Edges to Maximize Score in a Tree](/solution/2300-2399/2378.Choose%20Edges%20to%20Maximize%20Score%20in%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming` | Medium | 🔒 | -| 2379 | [Minimum Recolors to Get K Consecutive Black Blocks](/solution/2300-2399/2379.Minimum%20Recolors%20to%20Get%20K%20Consecutive%20Black%20Blocks/README_EN.md) | `String`,`Sliding Window` | Easy | Biweekly Contest 85 | -| 2380 | [Time Needed to Rearrange a Binary String](/solution/2300-2399/2380.Time%20Needed%20to%20Rearrange%20a%20Binary%20String/README_EN.md) | `String`,`Dynamic Programming`,`Simulation` | Medium | Biweekly Contest 85 | -| 2381 | [Shifting Letters II](/solution/2300-2399/2381.Shifting%20Letters%20II/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Biweekly Contest 85 | -| 2382 | [Maximum Segment Sum After Removals](/solution/2300-2399/2382.Maximum%20Segment%20Sum%20After%20Removals/README_EN.md) | `Union Find`,`Array`,`Ordered Set`,`Prefix Sum` | Hard | Biweekly Contest 85 | -| 2383 | [Minimum Hours of Training to Win a Competition](/solution/2300-2399/2383.Minimum%20Hours%20of%20Training%20to%20Win%20a%20Competition/README_EN.md) | `Greedy`,`Array` | Easy | Weekly Contest 307 | -| 2384 | [Largest Palindromic Number](/solution/2300-2399/2384.Largest%20Palindromic%20Number/README_EN.md) | `Greedy`,`Hash Table`,`String` | Medium | Weekly Contest 307 | -| 2385 | [Amount of Time for Binary Tree to Be Infected](/solution/2300-2399/2385.Amount%20of%20Time%20for%20Binary%20Tree%20to%20Be%20Infected/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 307 | -| 2386 | [Find the K-Sum of an Array](/solution/2300-2399/2386.Find%20the%20K-Sum%20of%20an%20Array/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 307 | -| 2387 | [Median of a Row Wise Sorted Matrix](/solution/2300-2399/2387.Median%20of%20a%20Row%20Wise%20Sorted%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | 🔒 | -| 2388 | [Change Null Values in a Table to the Previous Value](/solution/2300-2399/2388.Change%20Null%20Values%20in%20a%20Table%20to%20the%20Previous%20Value/README_EN.md) | `Database` | Medium | 🔒 | -| 2389 | [Longest Subsequence With Limited Sum](/solution/2300-2399/2389.Longest%20Subsequence%20With%20Limited%20Sum/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Easy | Weekly Contest 308 | -| 2390 | [Removing Stars From a String](/solution/2300-2399/2390.Removing%20Stars%20From%20a%20String/README_EN.md) | `Stack`,`String`,`Simulation` | Medium | Weekly Contest 308 | -| 2391 | [Minimum Amount of Time to Collect Garbage](/solution/2300-2399/2391.Minimum%20Amount%20of%20Time%20to%20Collect%20Garbage/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Weekly Contest 308 | -| 2392 | [Build a Matrix With Conditions](/solution/2300-2399/2392.Build%20a%20Matrix%20With%20Conditions/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Matrix` | Hard | Weekly Contest 308 | -| 2393 | [Count Strictly Increasing Subarrays](/solution/2300-2399/2393.Count%20Strictly%20Increasing%20Subarrays/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | 🔒 | -| 2394 | [Employees With Deductions](/solution/2300-2399/2394.Employees%20With%20Deductions/README_EN.md) | `Database` | Medium | 🔒 | -| 2395 | [Find Subarrays With Equal Sum](/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README_EN.md) | `Array`,`Hash Table` | Easy | Biweekly Contest 86 | -| 2396 | [Strictly Palindromic Number](/solution/2300-2399/2396.Strictly%20Palindromic%20Number/README_EN.md) | `Brainteaser`,`Math`,`Two Pointers` | Medium | Biweekly Contest 86 | -| 2397 | [Maximum Rows Covered by Columns](/solution/2300-2399/2397.Maximum%20Rows%20Covered%20by%20Columns/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration`,`Matrix` | Medium | Biweekly Contest 86 | -| 2398 | [Maximum Number of Robots Within Budget](/solution/2300-2399/2398.Maximum%20Number%20of%20Robots%20Within%20Budget/README_EN.md) | `Queue`,`Array`,`Binary Search`,`Prefix Sum`,`Sliding Window`,`Heap (Priority Queue)` | Hard | Biweekly Contest 86 | -| 2399 | [Check Distances Between Same Letters](/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 309 | -| 2400 | [Number of Ways to Reach a Position After Exactly k Steps](/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | Weekly Contest 309 | -| 2401 | [Longest Nice Subarray](/solution/2400-2499/2401.Longest%20Nice%20Subarray/README_EN.md) | `Bit Manipulation`,`Array`,`Sliding Window` | Medium | Weekly Contest 309 | -| 2402 | [Meeting Rooms III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Hard | Weekly Contest 309 | -| 2403 | [Minimum Time to Kill All Monsters](/solution/2400-2499/2403.Minimum%20Time%20to%20Kill%20All%20Monsters/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | 🔒 | -| 2404 | [Most Frequent Even Element](/solution/2400-2499/2404.Most%20Frequent%20Even%20Element/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 310 | -| 2405 | [Optimal Partition of String](/solution/2400-2499/2405.Optimal%20Partition%20of%20String/README_EN.md) | `Greedy`,`Hash Table`,`String` | Medium | Weekly Contest 310 | -| 2406 | [Divide Intervals Into Minimum Number of Groups](/solution/2400-2499/2406.Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Prefix Sum`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 310 | -| 2407 | [Longest Increasing Subsequence II](/solution/2400-2499/2407.Longest%20Increasing%20Subsequence%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Queue`,`Array`,`Divide and Conquer`,`Dynamic Programming`,`Monotonic Queue` | Hard | Weekly Contest 310 | -| 2408 | [Design SQL](/solution/2400-2499/2408.Design%20SQL/README_EN.md) | `Design`,`Array`,`Hash Table`,`String` | Medium | 🔒 | -| 2409 | [Count Days Spent Together](/solution/2400-2499/2409.Count%20Days%20Spent%20Together/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 87 | -| 2410 | [Maximum Matching of Players With Trainers](/solution/2400-2499/2410.Maximum%20Matching%20of%20Players%20With%20Trainers/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Biweekly Contest 87 | -| 2411 | [Smallest Subarrays With Maximum Bitwise OR](/solution/2400-2499/2411.Smallest%20Subarrays%20With%20Maximum%20Bitwise%20OR/README_EN.md) | `Bit Manipulation`,`Array`,`Binary Search`,`Sliding Window` | Medium | Biweekly Contest 87 | -| 2412 | [Minimum Money Required Before Transactions](/solution/2400-2499/2412.Minimum%20Money%20Required%20Before%20Transactions/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Biweekly Contest 87 | -| 2413 | [Smallest Even Multiple](/solution/2400-2499/2413.Smallest%20Even%20Multiple/README_EN.md) | `Math`,`Number Theory` | Easy | Weekly Contest 311 | -| 2414 | [Length of the Longest Alphabetical Continuous Substring](/solution/2400-2499/2414.Length%20of%20the%20Longest%20Alphabetical%20Continuous%20Substring/README_EN.md) | `String` | Medium | Weekly Contest 311 | -| 2415 | [Reverse Odd Levels of Binary Tree](/solution/2400-2499/2415.Reverse%20Odd%20Levels%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 311 | -| 2416 | [Sum of Prefix Scores of Strings](/solution/2400-2499/2416.Sum%20of%20Prefix%20Scores%20of%20Strings/README_EN.md) | `Trie`,`Array`,`String`,`Counting` | Hard | Weekly Contest 311 | -| 2417 | [Closest Fair Integer](/solution/2400-2499/2417.Closest%20Fair%20Integer/README_EN.md) | `Math`,`Enumeration` | Medium | 🔒 | -| 2418 | [Sort the People](/solution/2400-2499/2418.Sort%20the%20People/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Easy | Weekly Contest 312 | -| 2419 | [Longest Subarray With Maximum Bitwise AND](/solution/2400-2499/2419.Longest%20Subarray%20With%20Maximum%20Bitwise%20AND/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array` | Medium | Weekly Contest 312 | -| 2420 | [Find All Good Indices](/solution/2400-2499/2420.Find%20All%20Good%20Indices/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Medium | Weekly Contest 312 | -| 2421 | [Number of Good Paths](/solution/2400-2499/2421.Number%20of%20Good%20Paths/README_EN.md) | `Tree`,`Union Find`,`Graph`,`Array`,`Hash Table`,`Sorting` | Hard | Weekly Contest 312 | -| 2422 | [Merge Operations to Turn Array Into a Palindrome](/solution/2400-2499/2422.Merge%20Operations%20to%20Turn%20Array%20Into%20a%20Palindrome/README_EN.md) | `Greedy`,`Array`,`Two Pointers` | Medium | 🔒 | -| 2423 | [Remove Letter To Equalize Frequency](/solution/2400-2499/2423.Remove%20Letter%20To%20Equalize%20Frequency/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 88 | -| 2424 | [Longest Uploaded Prefix](/solution/2400-2499/2424.Longest%20Uploaded%20Prefix/README_EN.md) | `Union Find`,`Design`,`Binary Indexed Tree`,`Segment Tree`,`Binary Search`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Biweekly Contest 88 | -| 2425 | [Bitwise XOR of All Pairings](/solution/2400-2499/2425.Bitwise%20XOR%20of%20All%20Pairings/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array` | Medium | Biweekly Contest 88 | -| 2426 | [Number of Pairs Satisfying Inequality](/solution/2400-2499/2426.Number%20of%20Pairs%20Satisfying%20Inequality/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | Biweekly Contest 88 | -| 2427 | [Number of Common Factors](/solution/2400-2499/2427.Number%20of%20Common%20Factors/README_EN.md) | `Math`,`Enumeration`,`Number Theory` | Easy | Weekly Contest 313 | -| 2428 | [Maximum Sum of an Hourglass](/solution/2400-2499/2428.Maximum%20Sum%20of%20an%20Hourglass/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 313 | -| 2429 | [Minimize XOR](/solution/2400-2499/2429.Minimize%20XOR/README_EN.md) | `Greedy`,`Bit Manipulation` | Medium | Weekly Contest 313 | -| 2430 | [Maximum Deletions on a String](/solution/2400-2499/2430.Maximum%20Deletions%20on%20a%20String/README_EN.md) | `String`,`Dynamic Programming`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 313 | -| 2431 | [Maximize Total Tastiness of Purchased Fruits](/solution/2400-2499/2431.Maximize%20Total%20Tastiness%20of%20Purchased%20Fruits/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | -| 2432 | [The Employee That Worked on the Longest Task](/solution/2400-2499/2432.The%20Employee%20That%20Worked%20on%20the%20Longest%20Task/README_EN.md) | `Array` | Easy | Weekly Contest 314 | -| 2433 | [Find The Original Array of Prefix Xor](/solution/2400-2499/2433.Find%20The%20Original%20Array%20of%20Prefix%20Xor/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Weekly Contest 314 | -| 2434 | [Using a Robot to Print the Lexicographically Smallest String](/solution/2400-2499/2434.Using%20a%20Robot%20to%20Print%20the%20Lexicographically%20Smallest%20String/README_EN.md) | `Stack`,`Greedy`,`Hash Table`,`String` | Medium | Weekly Contest 314 | -| 2435 | [Paths in Matrix Whose Sum Is Divisible by K](/solution/2400-2499/2435.Paths%20in%20Matrix%20Whose%20Sum%20Is%20Divisible%20by%20K/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 314 | -| 2436 | [Minimum Split Into Subarrays With GCD Greater Than One](/solution/2400-2499/2436.Minimum%20Split%20Into%20Subarrays%20With%20GCD%20Greater%20Than%20One/README_EN.md) | `Greedy`,`Array`,`Math`,`Dynamic Programming`,`Number Theory` | Medium | 🔒 | -| 2437 | [Number of Valid Clock Times](/solution/2400-2499/2437.Number%20of%20Valid%20Clock%20Times/README_EN.md) | `String`,`Enumeration` | Easy | Biweekly Contest 89 | -| 2438 | [Range Product Queries of Powers](/solution/2400-2499/2438.Range%20Product%20Queries%20of%20Powers/README_EN.md) | `Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Biweekly Contest 89 | -| 2439 | [Minimize Maximum of Array](/solution/2400-2499/2439.Minimize%20Maximum%20of%20Array/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 89 | -| 2440 | [Create Components With Same Value](/solution/2400-2499/2440.Create%20Components%20With%20Same%20Value/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Math`,`Enumeration` | Hard | Biweekly Contest 89 | -| 2441 | [Largest Positive Integer That Exists With Its Negative](/solution/2400-2499/2441.Largest%20Positive%20Integer%20That%20Exists%20With%20Its%20Negative/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 315 | -| 2442 | [Count Number of Distinct Integers After Reverse Operations](/solution/2400-2499/2442.Count%20Number%20of%20Distinct%20Integers%20After%20Reverse%20Operations/README_EN.md) | `Array`,`Hash Table`,`Math` | Medium | Weekly Contest 315 | -| 2443 | [Sum of Number and Its Reverse](/solution/2400-2499/2443.Sum%20of%20Number%20and%20Its%20Reverse/README_EN.md) | `Math`,`Enumeration` | Medium | Weekly Contest 315 | -| 2444 | [Count Subarrays With Fixed Bounds](/solution/2400-2499/2444.Count%20Subarrays%20With%20Fixed%20Bounds/README_EN.md) | `Queue`,`Array`,`Sliding Window`,`Monotonic Queue` | Hard | Weekly Contest 315 | -| 2445 | [Number of Nodes With Value One](/solution/2400-2499/2445.Number%20of%20Nodes%20With%20Value%20One/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | -| 2446 | [Determine if Two Events Have Conflict](/solution/2400-2499/2446.Determine%20if%20Two%20Events%20Have%20Conflict/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 316 | -| 2447 | [Number of Subarrays With GCD Equal to K](/solution/2400-2499/2447.Number%20of%20Subarrays%20With%20GCD%20Equal%20to%20K/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 316 | -| 2448 | [Minimum Cost to Make Array Equal](/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Hard | Weekly Contest 316 | -| 2449 | [Minimum Number of Operations to Make Arrays Similar](/solution/2400-2499/2449.Minimum%20Number%20of%20Operations%20to%20Make%20Arrays%20Similar/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Weekly Contest 316 | -| 2450 | [Number of Distinct Binary Strings After Applying Operations](/solution/2400-2499/2450.Number%20of%20Distinct%20Binary%20Strings%20After%20Applying%20Operations/README_EN.md) | `Math`,`String` | Medium | 🔒 | -| 2451 | [Odd String Difference](/solution/2400-2499/2451.Odd%20String%20Difference/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Biweekly Contest 90 | -| 2452 | [Words Within Two Edits of Dictionary](/solution/2400-2499/2452.Words%20Within%20Two%20Edits%20of%20Dictionary/README_EN.md) | `Array`,`String` | Medium | Biweekly Contest 90 | -| 2453 | [Destroy Sequential Targets](/solution/2400-2499/2453.Destroy%20Sequential%20Targets/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Biweekly Contest 90 | -| 2454 | [Next Greater Element IV](/solution/2400-2499/2454.Next%20Greater%20Element%20IV/README_EN.md) | `Stack`,`Array`,`Binary Search`,`Sorting`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Biweekly Contest 90 | -| 2455 | [Average Value of Even Numbers That Are Divisible by Three](/solution/2400-2499/2455.Average%20Value%20of%20Even%20Numbers%20That%20Are%20Divisible%20by%20Three/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 317 | -| 2456 | [Most Popular Video Creator](/solution/2400-2499/2456.Most%20Popular%20Video%20Creator/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 317 | -| 2457 | [Minimum Addition to Make Integer Beautiful](/solution/2400-2499/2457.Minimum%20Addition%20to%20Make%20Integer%20Beautiful/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 317 | -| 2458 | [Height of Binary Tree After Subtree Removal Queries](/solution/2400-2499/2458.Height%20of%20Binary%20Tree%20After%20Subtree%20Removal%20Queries/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Binary Tree` | Hard | Weekly Contest 317 | -| 2459 | [Sort Array by Moving Items to Empty Space](/solution/2400-2499/2459.Sort%20Array%20by%20Moving%20Items%20to%20Empty%20Space/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | 🔒 | -| 2460 | [Apply Operations to an Array](/solution/2400-2499/2460.Apply%20Operations%20to%20an%20Array/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Easy | Weekly Contest 318 | -| 2461 | [Maximum Sum of Distinct Subarrays With Length K](/solution/2400-2499/2461.Maximum%20Sum%20of%20Distinct%20Subarrays%20With%20Length%20K/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 318 | -| 2462 | [Total Cost to Hire K Workers](/solution/2400-2499/2462.Total%20Cost%20to%20Hire%20K%20Workers/README_EN.md) | `Array`,`Two Pointers`,`Simulation`,`Heap (Priority Queue)` | Medium | Weekly Contest 318 | -| 2463 | [Minimum Total Distance Traveled](/solution/2400-2499/2463.Minimum%20Total%20Distance%20Traveled/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 318 | -| 2464 | [Minimum Subarrays in a Valid Split](/solution/2400-2499/2464.Minimum%20Subarrays%20in%20a%20Valid%20Split/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Number Theory` | Medium | 🔒 | -| 2465 | [Number of Distinct Averages](/solution/2400-2499/2465.Number%20of%20Distinct%20Averages/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Easy | Biweekly Contest 91 | -| 2466 | [Count Ways To Build Good Strings](/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README_EN.md) | `Dynamic Programming` | Medium | Biweekly Contest 91 | -| 2467 | [Most Profitable Path in a Tree](/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph`,`Array` | Medium | Biweekly Contest 91 | -| 2468 | [Split Message Based on Limit](/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README_EN.md) | `String`,`Binary Search` | Hard | Biweekly Contest 91 | -| 2469 | [Convert the Temperature](/solution/2400-2499/2469.Convert%20the%20Temperature/README_EN.md) | `Math` | Easy | Weekly Contest 319 | -| 2470 | [Number of Subarrays With LCM Equal to K](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 319 | -| 2471 | [Minimum Number of Operations to Sort a Binary Tree by Level](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 319 | -| 2472 | [Maximum Number of Non-overlapping Palindrome Substrings](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 319 | -| 2473 | [Minimum Cost to Buy Apples](/solution/2400-2499/2473.Minimum%20Cost%20to%20Buy%20Apples/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 | -| 2474 | [Customers With Strictly Increasing Purchases](/solution/2400-2499/2474.Customers%20With%20Strictly%20Increasing%20Purchases/README_EN.md) | `Database` | Hard | 🔒 | -| 2475 | [Number of Unequal Triplets in Array](/solution/2400-2499/2475.Number%20of%20Unequal%20Triplets%20in%20Array/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Weekly Contest 320 | -| 2476 | [Closest Nodes Queries in a Binary Search Tree](/solution/2400-2499/2476.Closest%20Nodes%20Queries%20in%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Array`,`Binary Search`,`Binary Tree` | Medium | Weekly Contest 320 | -| 2477 | [Minimum Fuel Cost to Report to the Capital](/solution/2400-2499/2477.Minimum%20Fuel%20Cost%20to%20Report%20to%20the%20Capital/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 320 | -| 2478 | [Number of Beautiful Partitions](/solution/2400-2499/2478.Number%20of%20Beautiful%20Partitions/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 320 | -| 2479 | [Maximum XOR of Two Non-Overlapping Subtrees](/solution/2400-2499/2479.Maximum%20XOR%20of%20Two%20Non-Overlapping%20Subtrees/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Trie` | Hard | 🔒 | -| 2480 | [Form a Chemical Bond](/solution/2400-2499/2480.Form%20a%20Chemical%20Bond/README_EN.md) | `Database` | Easy | 🔒 | -| 2481 | [Minimum Cuts to Divide a Circle](/solution/2400-2499/2481.Minimum%20Cuts%20to%20Divide%20a%20Circle/README_EN.md) | `Geometry`,`Math` | Easy | Biweekly Contest 92 | -| 2482 | [Difference Between Ones and Zeros in Row and Column](/solution/2400-2499/2482.Difference%20Between%20Ones%20and%20Zeros%20in%20Row%20and%20Column/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Biweekly Contest 92 | -| 2483 | [Minimum Penalty for a Shop](/solution/2400-2499/2483.Minimum%20Penalty%20for%20a%20Shop/README_EN.md) | `String`,`Prefix Sum` | Medium | Biweekly Contest 92 | -| 2484 | [Count Palindromic Subsequences](/solution/2400-2499/2484.Count%20Palindromic%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | Biweekly Contest 92 | -| 2485 | [Find the Pivot Integer](/solution/2400-2499/2485.Find%20the%20Pivot%20Integer/README_EN.md) | `Math`,`Prefix Sum` | Easy | Weekly Contest 321 | -| 2486 | [Append Characters to String to Make Subsequence](/solution/2400-2499/2486.Append%20Characters%20to%20String%20to%20Make%20Subsequence/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 321 | -| 2487 | [Remove Nodes From Linked List](/solution/2400-2499/2487.Remove%20Nodes%20From%20Linked%20List/README_EN.md) | `Stack`,`Recursion`,`Linked List`,`Monotonic Stack` | Medium | Weekly Contest 321 | -| 2488 | [Count Subarrays With Median K](/solution/2400-2499/2488.Count%20Subarrays%20With%20Median%20K/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Hard | Weekly Contest 321 | -| 2489 | [Number of Substrings With Fixed Ratio](/solution/2400-2499/2489.Number%20of%20Substrings%20With%20Fixed%20Ratio/README_EN.md) | `Hash Table`,`Math`,`String`,`Prefix Sum` | Medium | 🔒 | -| 2490 | [Circular Sentence](/solution/2400-2499/2490.Circular%20Sentence/README_EN.md) | `String` | Easy | Weekly Contest 322 | -| 2491 | [Divide Players Into Teams of Equal Skill](/solution/2400-2499/2491.Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 322 | -| 2492 | [Minimum Score of a Path Between Two Cities](/solution/2400-2499/2492.Minimum%20Score%20of%20a%20Path%20Between%20Two%20Cities/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Weekly Contest 322 | -| 2493 | [Divide Nodes Into the Maximum Number of Groups](/solution/2400-2499/2493.Divide%20Nodes%20Into%20the%20Maximum%20Number%20of%20Groups/README_EN.md) | `Breadth-First Search`,`Union Find`,`Graph` | Hard | Weekly Contest 322 | -| 2494 | [Merge Overlapping Events in the Same Hall](/solution/2400-2499/2494.Merge%20Overlapping%20Events%20in%20the%20Same%20Hall/README_EN.md) | `Database` | Hard | 🔒 | -| 2495 | [Number of Subarrays Having Even Product](/solution/2400-2499/2495.Number%20of%20Subarrays%20Having%20Even%20Product/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | 🔒 | -| 2496 | [Maximum Value of a String in an Array](/solution/2400-2499/2496.Maximum%20Value%20of%20a%20String%20in%20an%20Array/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 93 | -| 2497 | [Maximum Star Sum of a Graph](/solution/2400-2499/2497.Maximum%20Star%20Sum%20of%20a%20Graph/README_EN.md) | `Greedy`,`Graph`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 93 | -| 2498 | [Frog Jump II](/solution/2400-2499/2498.Frog%20Jump%20II/README_EN.md) | `Greedy`,`Array`,`Binary Search` | Medium | Biweekly Contest 93 | -| 2499 | [Minimum Total Cost to Make Arrays Unequal](/solution/2400-2499/2499.Minimum%20Total%20Cost%20to%20Make%20Arrays%20Unequal/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Hard | Biweekly Contest 93 | -| 2500 | [Delete Greatest Value in Each Row](/solution/2500-2599/2500.Delete%20Greatest%20Value%20in%20Each%20Row/README_EN.md) | `Array`,`Matrix`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 323 | -| 2501 | [Longest Square Streak in an Array](/solution/2500-2599/2501.Longest%20Square%20Streak%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 323 | -| 2502 | [Design Memory Allocator](/solution/2500-2599/2502.Design%20Memory%20Allocator/README_EN.md) | `Design`,`Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 323 | -| 2503 | [Maximum Number of Points From Grid Queries](/solution/2500-2599/2503.Maximum%20Number%20of%20Points%20From%20Grid%20Queries/README_EN.md) | `Breadth-First Search`,`Union Find`,`Array`,`Two Pointers`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 323 | -| 2504 | [Concatenate the Name and the Profession](/solution/2500-2599/2504.Concatenate%20the%20Name%20and%20the%20Profession/README_EN.md) | `Database` | Easy | 🔒 | -| 2505 | [Bitwise OR of All Subsequence Sums](/solution/2500-2599/2505.Bitwise%20OR%20of%20All%20Subsequence%20Sums/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array`,`Math` | Medium | 🔒 | -| 2506 | [Count Pairs Of Similar Strings](/solution/2500-2599/2506.Count%20Pairs%20Of%20Similar%20Strings/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String` | Easy | Weekly Contest 324 | -| 2507 | [Smallest Value After Replacing With Sum of Prime Factors](/solution/2500-2599/2507.Smallest%20Value%20After%20Replacing%20With%20Sum%20of%20Prime%20Factors/README_EN.md) | `Math`,`Number Theory`,`Simulation` | Medium | Weekly Contest 324 | -| 2508 | [Add Edges to Make Degrees of All Nodes Even](/solution/2500-2599/2508.Add%20Edges%20to%20Make%20Degrees%20of%20All%20Nodes%20Even/README_EN.md) | `Graph`,`Hash Table` | Hard | Weekly Contest 324 | -| 2509 | [Cycle Length Queries in a Tree](/solution/2500-2599/2509.Cycle%20Length%20Queries%20in%20a%20Tree/README_EN.md) | `Tree`,`Array`,`Binary Tree` | Hard | Weekly Contest 324 | -| 2510 | [Check if There is a Path With Equal Number of 0's And 1's](/solution/2500-2599/2510.Check%20if%20There%20is%20a%20Path%20With%20Equal%20Number%20of%200%27s%20And%201%27s/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | 🔒 | -| 2511 | [Maximum Enemy Forts That Can Be Captured](/solution/2500-2599/2511.Maximum%20Enemy%20Forts%20That%20Can%20Be%20Captured/README_EN.md) | `Array`,`Two Pointers` | Easy | Biweekly Contest 94 | -| 2512 | [Reward Top K Students](/solution/2500-2599/2512.Reward%20Top%20K%20Students/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 94 | -| 2513 | [Minimize the Maximum of Two Arrays](/solution/2500-2599/2513.Minimize%20the%20Maximum%20of%20Two%20Arrays/README_EN.md) | `Math`,`Binary Search`,`Number Theory` | Medium | Biweekly Contest 94 | -| 2514 | [Count Anagrams](/solution/2500-2599/2514.Count%20Anagrams/README_EN.md) | `Hash Table`,`Math`,`String`,`Combinatorics`,`Counting` | Hard | Biweekly Contest 94 | -| 2515 | [Shortest Distance to Target String in a Circular Array](/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 325 | -| 2516 | [Take K of Each Character From Left and Right](/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 325 | -| 2517 | [Maximum Tastiness of Candy Basket](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Sorting` | Medium | Weekly Contest 325 | -| 2518 | [Number of Great Partitions](/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 325 | -| 2519 | [Count the Number of K-Big Indices](/solution/2500-2599/2519.Count%20the%20Number%20of%20K-Big%20Indices/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | 🔒 | -| 2520 | [Count the Digits That Divide a Number](/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README_EN.md) | `Math` | Easy | Weekly Contest 326 | -| 2521 | [Distinct Prime Factors of Product of Array](/solution/2500-2599/2521.Distinct%20Prime%20Factors%20of%20Product%20of%20Array/README_EN.md) | `Array`,`Hash Table`,`Math`,`Number Theory` | Medium | Weekly Contest 326 | -| 2522 | [Partition String Into Substrings With Values at Most K](/solution/2500-2599/2522.Partition%20String%20Into%20Substrings%20With%20Values%20at%20Most%20K/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Weekly Contest 326 | -| 2523 | [Closest Prime Numbers in Range](/solution/2500-2599/2523.Closest%20Prime%20Numbers%20in%20Range/README_EN.md) | `Math`,`Number Theory` | Medium | Weekly Contest 326 | -| 2524 | [Maximum Frequency Score of a Subarray](/solution/2500-2599/2524.Maximum%20Frequency%20Score%20of%20a%20Subarray/README_EN.md) | `Array`,`Hash Table`,`Math`,`Sliding Window` | Hard | 🔒 | -| 2525 | [Categorize Box According to Criteria](/solution/2500-2599/2525.Categorize%20Box%20According%20to%20Criteria/README_EN.md) | `Math` | Easy | Biweekly Contest 95 | -| 2526 | [Find Consecutive Integers from a Data Stream](/solution/2500-2599/2526.Find%20Consecutive%20Integers%20from%20a%20Data%20Stream/README_EN.md) | `Design`,`Queue`,`Hash Table`,`Counting`,`Data Stream` | Medium | Biweekly Contest 95 | -| 2527 | [Find Xor-Beauty of Array](/solution/2500-2599/2527.Find%20Xor-Beauty%20of%20Array/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Medium | Biweekly Contest 95 | -| 2528 | [Maximize the Minimum Powered City](/solution/2500-2599/2528.Maximize%20the%20Minimum%20Powered%20City/README_EN.md) | `Greedy`,`Queue`,`Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Hard | Biweekly Contest 95 | -| 2529 | [Maximum Count of Positive Integer and Negative Integer](/solution/2500-2599/2529.Maximum%20Count%20of%20Positive%20Integer%20and%20Negative%20Integer/README_EN.md) | `Array`,`Binary Search`,`Counting` | Easy | Weekly Contest 327 | -| 2530 | [Maximal Score After Applying K Operations](/solution/2500-2599/2530.Maximal%20Score%20After%20Applying%20K%20Operations/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 327 | -| 2531 | [Make Number of Distinct Characters Equal](/solution/2500-2599/2531.Make%20Number%20of%20Distinct%20Characters%20Equal/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 327 | -| 2532 | [Time to Cross a Bridge](/solution/2500-2599/2532.Time%20to%20Cross%20a%20Bridge/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Hard | Weekly Contest 327 | -| 2533 | [Number of Good Binary Strings](/solution/2500-2599/2533.Number%20of%20Good%20Binary%20Strings/README_EN.md) | `Dynamic Programming` | Medium | 🔒 | -| 2534 | [Time Taken to Cross the Door](/solution/2500-2599/2534.Time%20Taken%20to%20Cross%20the%20Door/README_EN.md) | `Queue`,`Array`,`Simulation` | Hard | 🔒 | -| 2535 | [Difference Between Element Sum and Digit Sum of an Array](/solution/2500-2599/2535.Difference%20Between%20Element%20Sum%20and%20Digit%20Sum%20of%20an%20Array/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 328 | -| 2536 | [Increment Submatrices by One](/solution/2500-2599/2536.Increment%20Submatrices%20by%20One/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 328 | -| 2537 | [Count the Number of Good Subarrays](/solution/2500-2599/2537.Count%20the%20Number%20of%20Good%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 328 | -| 2538 | [Difference Between Maximum and Minimum Price Sum](/solution/2500-2599/2538.Difference%20Between%20Maximum%20and%20Minimum%20Price%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 328 | -| 2539 | [Count the Number of Good Subsequences](/solution/2500-2599/2539.Count%20the%20Number%20of%20Good%20Subsequences/README_EN.md) | `Hash Table`,`Math`,`String`,`Combinatorics`,`Counting` | Medium | 🔒 | -| 2540 | [Minimum Common Value](/solution/2500-2599/2540.Minimum%20Common%20Value/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search` | Easy | Biweekly Contest 96 | -| 2541 | [Minimum Operations to Make Array Equal II](/solution/2500-2599/2541.Minimum%20Operations%20to%20Make%20Array%20Equal%20II/README_EN.md) | `Greedy`,`Array`,`Math` | Medium | Biweekly Contest 96 | -| 2542 | [Maximum Subsequence Score](/solution/2500-2599/2542.Maximum%20Subsequence%20Score/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 96 | -| 2543 | [Check if Point Is Reachable](/solution/2500-2599/2543.Check%20if%20Point%20Is%20Reachable/README_EN.md) | `Math`,`Number Theory` | Hard | Biweekly Contest 96 | -| 2544 | [Alternating Digit Sum](/solution/2500-2599/2544.Alternating%20Digit%20Sum/README_EN.md) | `Math` | Easy | Weekly Contest 329 | -| 2545 | [Sort the Students by Their Kth Score](/solution/2500-2599/2545.Sort%20the%20Students%20by%20Their%20Kth%20Score/README_EN.md) | `Array`,`Matrix`,`Sorting` | Medium | Weekly Contest 329 | -| 2546 | [Apply Bitwise Operations to Make Strings Equal](/solution/2500-2599/2546.Apply%20Bitwise%20Operations%20to%20Make%20Strings%20Equal/README_EN.md) | `Bit Manipulation`,`String` | Medium | Weekly Contest 329 | -| 2547 | [Minimum Cost to Split an Array](/solution/2500-2599/2547.Minimum%20Cost%20to%20Split%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming`,`Counting` | Hard | Weekly Contest 329 | -| 2548 | [Maximum Price to Fill a Bag](/solution/2500-2599/2548.Maximum%20Price%20to%20Fill%20a%20Bag/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | -| 2549 | [Count Distinct Numbers on Board](/solution/2500-2599/2549.Count%20Distinct%20Numbers%20on%20Board/README_EN.md) | `Array`,`Hash Table`,`Math`,`Simulation` | Easy | Weekly Contest 330 | -| 2550 | [Count Collisions of Monkeys on a Polygon](/solution/2500-2599/2550.Count%20Collisions%20of%20Monkeys%20on%20a%20Polygon/README_EN.md) | `Recursion`,`Math` | Medium | Weekly Contest 330 | -| 2551 | [Put Marbles in Bags](/solution/2500-2599/2551.Put%20Marbles%20in%20Bags/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 330 | -| 2552 | [Count Increasing Quadruplets](/solution/2500-2599/2552.Count%20Increasing%20Quadruplets/README_EN.md) | `Binary Indexed Tree`,`Array`,`Dynamic Programming`,`Enumeration`,`Prefix Sum` | Hard | Weekly Contest 330 | -| 2553 | [Separate the Digits in an Array](/solution/2500-2599/2553.Separate%20the%20Digits%20in%20an%20Array/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 97 | -| 2554 | [Maximum Number of Integers to Choose From a Range I](/solution/2500-2599/2554.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20I/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 97 | -| 2555 | [Maximize Win From Two Segments](/solution/2500-2599/2555.Maximize%20Win%20From%20Two%20Segments/README_EN.md) | `Array`,`Binary Search`,`Sliding Window` | Medium | Biweekly Contest 97 | -| 2556 | [Disconnect Path in a Binary Matrix by at Most One Flip](/solution/2500-2599/2556.Disconnect%20Path%20in%20a%20Binary%20Matrix%20by%20at%20Most%20One%20Flip/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix` | Medium | Biweekly Contest 97 | -| 2557 | [Maximum Number of Integers to Choose From a Range II](/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Sorting` | Medium | 🔒 | -| 2558 | [Take Gifts From the Richest Pile](/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 331 | -| 2559 | [Count Vowel Strings in Ranges](/solution/2500-2599/2559.Count%20Vowel%20Strings%20in%20Ranges/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Weekly Contest 331 | -| 2560 | [House Robber IV](/solution/2500-2599/2560.House%20Robber%20IV/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 331 | -| 2561 | [Rearranging Fruits](/solution/2500-2599/2561.Rearranging%20Fruits/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Hard | Weekly Contest 331 | -| 2562 | [Find the Array Concatenation Value](/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Easy | Weekly Contest 332 | -| 2563 | [Count the Number of Fair Pairs](/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Weekly Contest 332 | -| 2564 | [Substring XOR Queries](/solution/2500-2599/2564.Substring%20XOR%20Queries/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 332 | -| 2565 | [Subsequence With the Minimum Score](/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README_EN.md) | `Two Pointers`,`String`,`Binary Search` | Hard | Weekly Contest 332 | -| 2566 | [Maximum Difference by Remapping a Digit](/solution/2500-2599/2566.Maximum%20Difference%20by%20Remapping%20a%20Digit/README_EN.md) | `Greedy`,`Math` | Easy | Biweekly Contest 98 | -| 2567 | [Minimum Score by Changing Two Elements](/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 98 | -| 2568 | [Minimum Impossible OR](/solution/2500-2599/2568.Minimum%20Impossible%20OR/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array` | Medium | Biweekly Contest 98 | -| 2569 | [Handling Sum Queries After Update](/solution/2500-2599/2569.Handling%20Sum%20Queries%20After%20Update/README_EN.md) | `Segment Tree`,`Array` | Hard | Biweekly Contest 98 | -| 2570 | [Merge Two 2D Arrays by Summing Values](/solution/2500-2599/2570.Merge%20Two%202D%20Arrays%20by%20Summing%20Values/README_EN.md) | `Array`,`Hash Table`,`Two Pointers` | Easy | Weekly Contest 333 | -| 2571 | [Minimum Operations to Reduce an Integer to 0](/solution/2500-2599/2571.Minimum%20Operations%20to%20Reduce%20an%20Integer%20to%200/README_EN.md) | `Greedy`,`Bit Manipulation`,`Dynamic Programming` | Medium | Weekly Contest 333 | -| 2572 | [Count the Number of Square-Free Subsets](/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Bitmask` | Medium | Weekly Contest 333 | -| 2573 | [Find the String with LCP](/solution/2500-2599/2573.Find%20the%20String%20with%20LCP/README_EN.md) | `Greedy`,`Union Find`,`Array`,`String`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 333 | -| 2574 | [Left and Right Sum Differences](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README_EN.md) | `Array`,`Prefix Sum` | Easy | Weekly Contest 334 | -| 2575 | [Find the Divisibility Array of a String](/solution/2500-2599/2575.Find%20the%20Divisibility%20Array%20of%20a%20String/README_EN.md) | `Array`,`Math`,`String` | Medium | Weekly Contest 334 | -| 2576 | [Find the Maximum Number of Marked Indices](/solution/2500-2599/2576.Find%20the%20Maximum%20Number%20of%20Marked%20Indices/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Weekly Contest 334 | -| 2577 | [Minimum Time to Visit a Cell In a Grid](/solution/2500-2599/2577.Minimum%20Time%20to%20Visit%20a%20Cell%20In%20a%20Grid/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 334 | -| 2578 | [Split With Minimum Sum](/solution/2500-2599/2578.Split%20With%20Minimum%20Sum/README_EN.md) | `Greedy`,`Math`,`Sorting` | Easy | Biweekly Contest 99 | -| 2579 | [Count Total Number of Colored Cells](/solution/2500-2599/2579.Count%20Total%20Number%20of%20Colored%20Cells/README_EN.md) | `Math` | Medium | Biweekly Contest 99 | -| 2580 | [Count Ways to Group Overlapping Ranges](/solution/2500-2599/2580.Count%20Ways%20to%20Group%20Overlapping%20Ranges/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 99 | -| 2581 | [Count Number of Possible Root Nodes](/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Dynamic Programming` | Hard | Biweekly Contest 99 | -| 2582 | [Pass the Pillow](/solution/2500-2599/2582.Pass%20the%20Pillow/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 335 | -| 2583 | [Kth Largest Sum in a Binary Tree](/solution/2500-2599/2583.Kth%20Largest%20Sum%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree`,`Sorting` | Medium | Weekly Contest 335 | -| 2584 | [Split the Array to Make Coprime Products](/solution/2500-2599/2584.Split%20the%20Array%20to%20Make%20Coprime%20Products/README_EN.md) | `Array`,`Hash Table`,`Math`,`Number Theory` | Hard | Weekly Contest 335 | -| 2585 | [Number of Ways to Earn Points](/solution/2500-2599/2585.Number%20of%20Ways%20to%20Earn%20Points/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 335 | -| 2586 | [Count the Number of Vowel Strings in Range](/solution/2500-2599/2586.Count%20the%20Number%20of%20Vowel%20Strings%20in%20Range/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 336 | -| 2587 | [Rearrange Array to Maximize Prefix Score](/solution/2500-2599/2587.Rearrange%20Array%20to%20Maximize%20Prefix%20Score/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sorting` | Medium | Weekly Contest 336 | -| 2588 | [Count the Number of Beautiful Subarrays](/solution/2500-2599/2588.Count%20the%20Number%20of%20Beautiful%20Subarrays/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 336 | -| 2589 | [Minimum Time to Complete All Tasks](/solution/2500-2599/2589.Minimum%20Time%20to%20Complete%20All%20Tasks/README_EN.md) | `Stack`,`Greedy`,`Array`,`Binary Search`,`Sorting` | Hard | Weekly Contest 336 | -| 2590 | [Design a Todo List](/solution/2500-2599/2590.Design%20a%20Todo%20List/README_EN.md) | `Design`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | 🔒 | -| 2591 | [Distribute Money to Maximum Children](/solution/2500-2599/2591.Distribute%20Money%20to%20Maximum%20Children/README_EN.md) | `Greedy`,`Math` | Easy | Biweekly Contest 100 | -| 2592 | [Maximize Greatness of an Array](/solution/2500-2599/2592.Maximize%20Greatness%20of%20an%20Array/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Biweekly Contest 100 | -| 2593 | [Find Score of an Array After Marking All Elements](/solution/2500-2599/2593.Find%20Score%20of%20an%20Array%20After%20Marking%20All%20Elements/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 100 | -| 2594 | [Minimum Time to Repair Cars](/solution/2500-2599/2594.Minimum%20Time%20to%20Repair%20Cars/README_EN.md) | `Array`,`Binary Search` | Medium | Biweekly Contest 100 | -| 2595 | [Number of Even and Odd Bits](/solution/2500-2599/2595.Number%20of%20Even%20and%20Odd%20Bits/README_EN.md) | `Bit Manipulation` | Easy | Weekly Contest 337 | -| 2596 | [Check Knight Tour Configuration](/solution/2500-2599/2596.Check%20Knight%20Tour%20Configuration/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 337 | -| 2597 | [The Number of Beautiful Subsets](/solution/2500-2599/2597.The%20Number%20of%20Beautiful%20Subsets/README_EN.md) | `Array`,`Dynamic Programming`,`Backtracking`,`Sorting` | Medium | Weekly Contest 337 | -| 2598 | [Smallest Missing Non-negative Integer After Operations](/solution/2500-2599/2598.Smallest%20Missing%20Non-negative%20Integer%20After%20Operations/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Math` | Medium | Weekly Contest 337 | -| 2599 | [Make the Prefix Sum Non-negative](/solution/2500-2599/2599.Make%20the%20Prefix%20Sum%20Non-negative/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | 🔒 | -| 2600 | [K Items With the Maximum Sum](/solution/2600-2699/2600.K%20Items%20With%20the%20Maximum%20Sum/README_EN.md) | `Greedy`,`Math` | Easy | Weekly Contest 338 | -| 2601 | [Prime Subtraction Operation](/solution/2600-2699/2601.Prime%20Subtraction%20Operation/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search`,`Number Theory` | Medium | Weekly Contest 338 | -| 2602 | [Minimum Operations to Make All Array Elements Equal](/solution/2600-2699/2602.Minimum%20Operations%20to%20Make%20All%20Array%20Elements%20Equal/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Medium | Weekly Contest 338 | -| 2603 | [Collect Coins in a Tree](/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README_EN.md) | `Tree`,`Graph`,`Topological Sort`,`Array` | Hard | Weekly Contest 338 | -| 2604 | [Minimum Time to Eat All Grains](/solution/2600-2699/2604.Minimum%20Time%20to%20Eat%20All%20Grains/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Hard | 🔒 | -| 2605 | [Form Smallest Number From Two Digit Arrays](/solution/2600-2699/2605.Form%20Smallest%20Number%20From%20Two%20Digit%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Easy | Biweekly Contest 101 | -| 2606 | [Find the Substring With Maximum Cost](/solution/2600-2699/2606.Find%20the%20Substring%20With%20Maximum%20Cost/README_EN.md) | `Array`,`Hash Table`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 101 | -| 2607 | [Make K-Subarray Sums Equal](/solution/2600-2699/2607.Make%20K-Subarray%20Sums%20Equal/README_EN.md) | `Array`,`Math`,`Number Theory`,`Sorting` | Medium | Biweekly Contest 101 | -| 2608 | [Shortest Cycle in a Graph](/solution/2600-2699/2608.Shortest%20Cycle%20in%20a%20Graph/README_EN.md) | `Breadth-First Search`,`Graph` | Hard | Biweekly Contest 101 | -| 2609 | [Find the Longest Balanced Substring of a Binary String](/solution/2600-2699/2609.Find%20the%20Longest%20Balanced%20Substring%20of%20a%20Binary%20String/README_EN.md) | `String` | Easy | Weekly Contest 339 | -| 2610 | [Convert an Array Into a 2D Array With Conditions](/solution/2600-2699/2610.Convert%20an%20Array%20Into%20a%202D%20Array%20With%20Conditions/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 339 | -| 2611 | [Mice and Cheese](/solution/2600-2699/2611.Mice%20and%20Cheese/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 339 | -| 2612 | [Minimum Reverse Operations](/solution/2600-2699/2612.Minimum%20Reverse%20Operations/README_EN.md) | `Breadth-First Search`,`Array`,`Ordered Set` | Hard | Weekly Contest 339 | -| 2613 | [Beautiful Pairs](/solution/2600-2699/2613.Beautiful%20Pairs/README_EN.md) | `Geometry`,`Array`,`Math`,`Divide and Conquer`,`Ordered Set`,`Sorting` | Hard | 🔒 | -| 2614 | [Prime In Diagonal](/solution/2600-2699/2614.Prime%20In%20Diagonal/README_EN.md) | `Array`,`Math`,`Matrix`,`Number Theory` | Easy | Weekly Contest 340 | -| 2615 | [Sum of Distances](/solution/2600-2699/2615.Sum%20of%20Distances/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 340 | -| 2616 | [Minimize the Maximum Difference of Pairs](/solution/2600-2699/2616.Minimize%20the%20Maximum%20Difference%20of%20Pairs/README_EN.md) | `Greedy`,`Array`,`Binary Search` | Medium | Weekly Contest 340 | -| 2617 | [Minimum Number of Visited Cells in a Grid](/solution/2600-2699/2617.Minimum%20Number%20of%20Visited%20Cells%20in%20a%20Grid/README_EN.md) | `Stack`,`Breadth-First Search`,`Union Find`,`Array`,`Dynamic Programming`,`Matrix`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Weekly Contest 340 | -| 2618 | [Check if Object Instance of Class](/solution/2600-2699/2618.Check%20if%20Object%20Instance%20of%20Class/README_EN.md) | | Medium | | -| 2619 | [Array Prototype Last](/solution/2600-2699/2619.Array%20Prototype%20Last/README_EN.md) | | Easy | | -| 2620 | [Counter](/solution/2600-2699/2620.Counter/README_EN.md) | | Easy | | -| 2621 | [Sleep](/solution/2600-2699/2621.Sleep/README_EN.md) | | Easy | | -| 2622 | [Cache With Time Limit](/solution/2600-2699/2622.Cache%20With%20Time%20Limit/README_EN.md) | | Medium | | -| 2623 | [Memoize](/solution/2600-2699/2623.Memoize/README_EN.md) | | Medium | | -| 2624 | [Snail Traversal](/solution/2600-2699/2624.Snail%20Traversal/README_EN.md) | | Medium | | -| 2625 | [Flatten Deeply Nested Array](/solution/2600-2699/2625.Flatten%20Deeply%20Nested%20Array/README_EN.md) | | Medium | | -| 2626 | [Array Reduce Transformation](/solution/2600-2699/2626.Array%20Reduce%20Transformation/README_EN.md) | | Easy | | -| 2627 | [Debounce](/solution/2600-2699/2627.Debounce/README_EN.md) | | Medium | | -| 2628 | [JSON Deep Equal](/solution/2600-2699/2628.JSON%20Deep%20Equal/README_EN.md) | | Medium | 🔒 | -| 2629 | [Function Composition](/solution/2600-2699/2629.Function%20Composition/README_EN.md) | | Easy | | -| 2630 | [Memoize II](/solution/2600-2699/2630.Memoize%20II/README_EN.md) | | Hard | | -| 2631 | [Group By](/solution/2600-2699/2631.Group%20By/README_EN.md) | | Medium | | -| 2632 | [Curry](/solution/2600-2699/2632.Curry/README_EN.md) | | Medium | 🔒 | -| 2633 | [Convert Object to JSON String](/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README_EN.md) | | Medium | 🔒 | -| 2634 | [Filter Elements from Array](/solution/2600-2699/2634.Filter%20Elements%20from%20Array/README_EN.md) | | Easy | | -| 2635 | [Apply Transform Over Each Element in Array](/solution/2600-2699/2635.Apply%20Transform%20Over%20Each%20Element%20in%20Array/README_EN.md) | | Easy | | -| 2636 | [Promise Pool](/solution/2600-2699/2636.Promise%20Pool/README_EN.md) | | Medium | 🔒 | -| 2637 | [Promise Time Limit](/solution/2600-2699/2637.Promise%20Time%20Limit/README_EN.md) | | Medium | | -| 2638 | [Count the Number of K-Free Subsets](/solution/2600-2699/2638.Count%20the%20Number%20of%20K-Free%20Subsets/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Medium | 🔒 | -| 2639 | [Find the Width of Columns of a Grid](/solution/2600-2699/2639.Find%20the%20Width%20of%20Columns%20of%20a%20Grid/README_EN.md) | `Array`,`Matrix` | Easy | Biweekly Contest 102 | -| 2640 | [Find the Score of All Prefixes of an Array](/solution/2600-2699/2640.Find%20the%20Score%20of%20All%20Prefixes%20of%20an%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 102 | -| 2641 | [Cousins in Binary Tree II](/solution/2600-2699/2641.Cousins%20in%20Binary%20Tree%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Biweekly Contest 102 | -| 2642 | [Design Graph With Shortest Path Calculator](/solution/2600-2699/2642.Design%20Graph%20With%20Shortest%20Path%20Calculator/README_EN.md) | `Graph`,`Design`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Biweekly Contest 102 | -| 2643 | [Row With Maximum Ones](/solution/2600-2699/2643.Row%20With%20Maximum%20Ones/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 341 | -| 2644 | [Find the Maximum Divisibility Score](/solution/2600-2699/2644.Find%20the%20Maximum%20Divisibility%20Score/README_EN.md) | `Array` | Easy | Weekly Contest 341 | -| 2645 | [Minimum Additions to Make Valid String](/solution/2600-2699/2645.Minimum%20Additions%20to%20Make%20Valid%20String/README_EN.md) | `Stack`,`Greedy`,`String`,`Dynamic Programming` | Medium | Weekly Contest 341 | -| 2646 | [Minimize the Total Price of the Trips](/solution/2600-2699/2646.Minimize%20the%20Total%20Price%20of%20the%20Trips/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 341 | -| 2647 | [Color the Triangle Red](/solution/2600-2699/2647.Color%20the%20Triangle%20Red/README_EN.md) | `Array`,`Math` | Hard | 🔒 | -| 2648 | [Generate Fibonacci Sequence](/solution/2600-2699/2648.Generate%20Fibonacci%20Sequence/README_EN.md) | | Easy | | -| 2649 | [Nested Array Generator](/solution/2600-2699/2649.Nested%20Array%20Generator/README_EN.md) | | Medium | | -| 2650 | [Design Cancellable Function](/solution/2600-2699/2650.Design%20Cancellable%20Function/README_EN.md) | | Hard | | -| 2651 | [Calculate Delayed Arrival Time](/solution/2600-2699/2651.Calculate%20Delayed%20Arrival%20Time/README_EN.md) | `Math` | Easy | Weekly Contest 342 | -| 2652 | [Sum Multiples](/solution/2600-2699/2652.Sum%20Multiples/README_EN.md) | `Math` | Easy | Weekly Contest 342 | -| 2653 | [Sliding Subarray Beauty](/solution/2600-2699/2653.Sliding%20Subarray%20Beauty/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 342 | -| 2654 | [Minimum Number of Operations to Make All Array Elements Equal to 1](/solution/2600-2699/2654.Minimum%20Number%20of%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%201/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 342 | -| 2655 | [Find Maximal Uncovered Ranges](/solution/2600-2699/2655.Find%20Maximal%20Uncovered%20Ranges/README_EN.md) | `Array`,`Sorting` | Medium | 🔒 | -| 2656 | [Maximum Sum With Exactly K Elements](/solution/2600-2699/2656.Maximum%20Sum%20With%20Exactly%20K%20Elements/README_EN.md) | `Greedy`,`Array` | Easy | Biweekly Contest 103 | -| 2657 | [Find the Prefix Common Array of Two Arrays](/solution/2600-2699/2657.Find%20the%20Prefix%20Common%20Array%20of%20Two%20Arrays/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Medium | Biweekly Contest 103 | -| 2658 | [Maximum Number of Fish in a Grid](/solution/2600-2699/2658.Maximum%20Number%20of%20Fish%20in%20a%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Biweekly Contest 103 | -| 2659 | [Make Array Empty](/solution/2600-2699/2659.Make%20Array%20Empty/README_EN.md) | `Greedy`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Ordered Set`,`Sorting` | Hard | Biweekly Contest 103 | -| 2660 | [Determine the Winner of a Bowling Game](/solution/2600-2699/2660.Determine%20the%20Winner%20of%20a%20Bowling%20Game/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 343 | -| 2661 | [First Completely Painted Row or Column](/solution/2600-2699/2661.First%20Completely%20Painted%20Row%20or%20Column/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 343 | -| 2662 | [Minimum Cost of a Path With Special Roads](/solution/2600-2699/2662.Minimum%20Cost%20of%20a%20Path%20With%20Special%20Roads/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Weekly Contest 343 | -| 2663 | [Lexicographically Smallest Beautiful String](/solution/2600-2699/2663.Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) | `Greedy`,`String` | Hard | Weekly Contest 343 | -| 2664 | [The Knight’s Tour](/solution/2600-2699/2664.The%20Knight%E2%80%99s%20Tour/README_EN.md) | `Array`,`Backtracking`,`Matrix` | Medium | 🔒 | -| 2665 | [Counter II](/solution/2600-2699/2665.Counter%20II/README_EN.md) | | Easy | | -| 2666 | [Allow One Function Call](/solution/2600-2699/2666.Allow%20One%20Function%20Call/README_EN.md) | | Easy | | -| 2667 | [Create Hello World Function](/solution/2600-2699/2667.Create%20Hello%20World%20Function/README_EN.md) | | Easy | | -| 2668 | [Find Latest Salaries](/solution/2600-2699/2668.Find%20Latest%20Salaries/README_EN.md) | `Database` | Easy | 🔒 | -| 2669 | [Count Artist Occurrences On Spotify Ranking List](/solution/2600-2699/2669.Count%20Artist%20Occurrences%20On%20Spotify%20Ranking%20List/README_EN.md) | `Database` | Easy | 🔒 | -| 2670 | [Find the Distinct Difference Array](/solution/2600-2699/2670.Find%20the%20Distinct%20Difference%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 344 | -| 2671 | [Frequency Tracker](/solution/2600-2699/2671.Frequency%20Tracker/README_EN.md) | `Design`,`Hash Table` | Medium | Weekly Contest 344 | -| 2672 | [Number of Adjacent Elements With the Same Color](/solution/2600-2699/2672.Number%20of%20Adjacent%20Elements%20With%20the%20Same%20Color/README_EN.md) | `Array` | Medium | Weekly Contest 344 | -| 2673 | [Make Costs of Paths Equal in a Binary Tree](/solution/2600-2699/2673.Make%20Costs%20of%20Paths%20Equal%20in%20a%20Binary%20Tree/README_EN.md) | `Greedy`,`Tree`,`Array`,`Dynamic Programming`,`Binary Tree` | Medium | Weekly Contest 344 | -| 2674 | [Split a Circular Linked List](/solution/2600-2699/2674.Split%20a%20Circular%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | 🔒 | -| 2675 | [Array of Objects to Matrix](/solution/2600-2699/2675.Array%20of%20Objects%20to%20Matrix/README_EN.md) | | Hard | 🔒 | -| 2676 | [Throttle](/solution/2600-2699/2676.Throttle/README_EN.md) | | Medium | 🔒 | -| 2677 | [Chunk Array](/solution/2600-2699/2677.Chunk%20Array/README_EN.md) | | Easy | | -| 2678 | [Number of Senior Citizens](/solution/2600-2699/2678.Number%20of%20Senior%20Citizens/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 104 | -| 2679 | [Sum in a Matrix](/solution/2600-2699/2679.Sum%20in%20a%20Matrix/README_EN.md) | `Array`,`Matrix`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 104 | -| 2680 | [Maximum OR](/solution/2600-2699/2680.Maximum%20OR/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Biweekly Contest 104 | -| 2681 | [Power of Heroes](/solution/2600-2699/2681.Power%20of%20Heroes/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Prefix Sum`,`Sorting` | Hard | Biweekly Contest 104 | -| 2682 | [Find the Losers of the Circular Game](/solution/2600-2699/2682.Find%20the%20Losers%20of%20the%20Circular%20Game/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Easy | Weekly Contest 345 | -| 2683 | [Neighboring Bitwise XOR](/solution/2600-2699/2683.Neighboring%20Bitwise%20XOR/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Weekly Contest 345 | -| 2684 | [Maximum Number of Moves in a Grid](/solution/2600-2699/2684.Maximum%20Number%20of%20Moves%20in%20a%20Grid/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 345 | -| 2685 | [Count the Number of Complete Components](/solution/2600-2699/2685.Count%20the%20Number%20of%20Complete%20Components/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 345 | -| 2686 | [Immediate Food Delivery III](/solution/2600-2699/2686.Immediate%20Food%20Delivery%20III/README_EN.md) | `Database` | Medium | 🔒 | -| 2687 | [Bikes Last Time Used](/solution/2600-2699/2687.Bikes%20Last%20Time%20Used/README_EN.md) | `Database` | Easy | 🔒 | -| 2688 | [Find Active Users](/solution/2600-2699/2688.Find%20Active%20Users/README_EN.md) | `Database` | Medium | 🔒 | -| 2689 | [Extract Kth Character From The Rope Tree](/solution/2600-2699/2689.Extract%20Kth%20Character%20From%20The%20Rope%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | 🔒 | -| 2690 | [Infinite Method Object](/solution/2600-2699/2690.Infinite%20Method%20Object/README_EN.md) | | Easy | 🔒 | -| 2691 | [Immutability Helper](/solution/2600-2699/2691.Immutability%20Helper/README_EN.md) | | Hard | 🔒 | -| 2692 | [Make Object Immutable](/solution/2600-2699/2692.Make%20Object%20Immutable/README_EN.md) | | Medium | 🔒 | -| 2693 | [Call Function with Custom Context](/solution/2600-2699/2693.Call%20Function%20with%20Custom%20Context/README_EN.md) | | Medium | | -| 2694 | [Event Emitter](/solution/2600-2699/2694.Event%20Emitter/README_EN.md) | | Medium | | -| 2695 | [Array Wrapper](/solution/2600-2699/2695.Array%20Wrapper/README_EN.md) | | Easy | | -| 2696 | [Minimum String Length After Removing Substrings](/solution/2600-2699/2696.Minimum%20String%20Length%20After%20Removing%20Substrings/README_EN.md) | `Stack`,`String`,`Simulation` | Easy | Weekly Contest 346 | -| 2697 | [Lexicographically Smallest Palindrome](/solution/2600-2699/2697.Lexicographically%20Smallest%20Palindrome/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Easy | Weekly Contest 346 | -| 2698 | [Find the Punishment Number of an Integer](/solution/2600-2699/2698.Find%20the%20Punishment%20Number%20of%20an%20Integer/README_EN.md) | `Math`,`Backtracking` | Medium | Weekly Contest 346 | -| 2699 | [Modify Graph Edge Weights](/solution/2600-2699/2699.Modify%20Graph%20Edge%20Weights/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 346 | -| 2700 | [Differences Between Two Objects](/solution/2700-2799/2700.Differences%20Between%20Two%20Objects/README_EN.md) | | Medium | 🔒 | -| 2701 | [Consecutive Transactions with Increasing Amounts](/solution/2700-2799/2701.Consecutive%20Transactions%20with%20Increasing%20Amounts/README_EN.md) | `Database` | Hard | 🔒 | -| 2702 | [Minimum Operations to Make Numbers Non-positive](/solution/2700-2799/2702.Minimum%20Operations%20to%20Make%20Numbers%20Non-positive/README_EN.md) | `Array`,`Binary Search` | Hard | 🔒 | -| 2703 | [Return Length of Arguments Passed](/solution/2700-2799/2703.Return%20Length%20of%20Arguments%20Passed/README_EN.md) | | Easy | | -| 2704 | [To Be Or Not To Be](/solution/2700-2799/2704.To%20Be%20Or%20Not%20To%20Be/README_EN.md) | | Easy | | -| 2705 | [Compact Object](/solution/2700-2799/2705.Compact%20Object/README_EN.md) | | Medium | | -| 2706 | [Buy Two Chocolates](/solution/2700-2799/2706.Buy%20Two%20Chocolates/README_EN.md) | `Array`,`Sorting` | Easy | Biweekly Contest 105 | -| 2707 | [Extra Characters in a String](/solution/2700-2799/2707.Extra%20Characters%20in%20a%20String/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 105 | -| 2708 | [Maximum Strength of a Group](/solution/2700-2799/2708.Maximum%20Strength%20of%20a%20Group/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Enumeration`,`Sorting` | Medium | Biweekly Contest 105 | -| 2709 | [Greatest Common Divisor Traversal](/solution/2700-2799/2709.Greatest%20Common%20Divisor%20Traversal/README_EN.md) | `Union Find`,`Array`,`Math`,`Number Theory` | Hard | Biweekly Contest 105 | -| 2710 | [Remove Trailing Zeros From a String](/solution/2700-2799/2710.Remove%20Trailing%20Zeros%20From%20a%20String/README_EN.md) | `String` | Easy | Weekly Contest 347 | -| 2711 | [Difference of Number of Distinct Values on Diagonals](/solution/2700-2799/2711.Difference%20of%20Number%20of%20Distinct%20Values%20on%20Diagonals/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 347 | -| 2712 | [Minimum Cost to Make All Characters Equal](/solution/2700-2799/2712.Minimum%20Cost%20to%20Make%20All%20Characters%20Equal/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Weekly Contest 347 | -| 2713 | [Maximum Strictly Increasing Cells in a Matrix](/solution/2700-2799/2713.Maximum%20Strictly%20Increasing%20Cells%20in%20a%20Matrix/README_EN.md) | `Memoization`,`Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Matrix`,`Ordered Set`,`Sorting` | Hard | Weekly Contest 347 | -| 2714 | [Find Shortest Path with K Hops](/solution/2700-2799/2714.Find%20Shortest%20Path%20with%20K%20Hops/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | 🔒 | -| 2715 | [Timeout Cancellation](/solution/2700-2799/2715.Timeout%20Cancellation/README_EN.md) | | Easy | | -| 2716 | [Minimize String Length](/solution/2700-2799/2716.Minimize%20String%20Length/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 348 | -| 2717 | [Semi-Ordered Permutation](/solution/2700-2799/2717.Semi-Ordered%20Permutation/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 348 | -| 2718 | [Sum of Matrix After Queries](/solution/2700-2799/2718.Sum%20of%20Matrix%20After%20Queries/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 348 | -| 2719 | [Count of Integers](/solution/2700-2799/2719.Count%20of%20Integers/README_EN.md) | `Math`,`String`,`Dynamic Programming` | Hard | Weekly Contest 348 | -| 2720 | [Popularity Percentage](/solution/2700-2799/2720.Popularity%20Percentage/README_EN.md) | `Database` | Hard | 🔒 | -| 2721 | [Execute Asynchronous Functions in Parallel](/solution/2700-2799/2721.Execute%20Asynchronous%20Functions%20in%20Parallel/README_EN.md) | | Medium | | -| 2722 | [Join Two Arrays by ID](/solution/2700-2799/2722.Join%20Two%20Arrays%20by%20ID/README_EN.md) | | Medium | | -| 2723 | [Add Two Promises](/solution/2700-2799/2723.Add%20Two%20Promises/README_EN.md) | | Easy | | -| 2724 | [Sort By](/solution/2700-2799/2724.Sort%20By/README_EN.md) | | Easy | | -| 2725 | [Interval Cancellation](/solution/2700-2799/2725.Interval%20Cancellation/README_EN.md) | | Easy | | -| 2726 | [Calculator with Method Chaining](/solution/2700-2799/2726.Calculator%20with%20Method%20Chaining/README_EN.md) | | Easy | | -| 2727 | [Is Object Empty](/solution/2700-2799/2727.Is%20Object%20Empty/README_EN.md) | | Easy | | -| 2728 | [Count Houses in a Circular Street](/solution/2700-2799/2728.Count%20Houses%20in%20a%20Circular%20Street/README_EN.md) | `Array`,`Interactive` | Easy | 🔒 | -| 2729 | [Check if The Number is Fascinating](/solution/2700-2799/2729.Check%20if%20The%20Number%20is%20Fascinating/README_EN.md) | `Hash Table`,`Math` | Easy | Biweekly Contest 106 | -| 2730 | [Find the Longest Semi-Repetitive Substring](/solution/2700-2799/2730.Find%20the%20Longest%20Semi-Repetitive%20Substring/README_EN.md) | `String`,`Sliding Window` | Medium | Biweekly Contest 106 | -| 2731 | [Movement of Robots](/solution/2700-2799/2731.Movement%20of%20Robots/README_EN.md) | `Brainteaser`,`Array`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 106 | -| 2732 | [Find a Good Subset of the Matrix](/solution/2700-2799/2732.Find%20a%20Good%20Subset%20of%20the%20Matrix/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Matrix` | Hard | Biweekly Contest 106 | -| 2733 | [Neither Minimum nor Maximum](/solution/2700-2799/2733.Neither%20Minimum%20nor%20Maximum/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 349 | -| 2734 | [Lexicographically Smallest String After Substring Operation](/solution/2700-2799/2734.Lexicographically%20Smallest%20String%20After%20Substring%20Operation/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 349 | -| 2735 | [Collecting Chocolates](/solution/2700-2799/2735.Collecting%20Chocolates/README_EN.md) | `Array`,`Enumeration` | Medium | Weekly Contest 349 | -| 2736 | [Maximum Sum Queries](/solution/2700-2799/2736.Maximum%20Sum%20Queries/README_EN.md) | `Stack`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Sorting`,`Monotonic Stack` | Hard | Weekly Contest 349 | -| 2737 | [Find the Closest Marked Node](/solution/2700-2799/2737.Find%20the%20Closest%20Marked%20Node/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 | -| 2738 | [Count Occurrences in Text](/solution/2700-2799/2738.Count%20Occurrences%20in%20Text/README_EN.md) | `Database` | Medium | 🔒 | -| 2739 | [Total Distance Traveled](/solution/2700-2799/2739.Total%20Distance%20Traveled/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 350 | -| 2740 | [Find the Value of the Partition](/solution/2700-2799/2740.Find%20the%20Value%20of%20the%20Partition/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 350 | -| 2741 | [Special Permutations](/solution/2700-2799/2741.Special%20Permutations/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Medium | Weekly Contest 350 | -| 2742 | [Painting the Walls](/solution/2700-2799/2742.Painting%20the%20Walls/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 350 | -| 2743 | [Count Substrings Without Repeating Character](/solution/2700-2799/2743.Count%20Substrings%20Without%20Repeating%20Character/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | 🔒 | -| 2744 | [Find Maximum Number of String Pairs](/solution/2700-2799/2744.Find%20Maximum%20Number%20of%20String%20Pairs/README_EN.md) | `Array`,`Hash Table`,`String`,`Simulation` | Easy | Biweekly Contest 107 | -| 2745 | [Construct the Longest New String](/solution/2700-2799/2745.Construct%20the%20Longest%20New%20String/README_EN.md) | `Greedy`,`Brainteaser`,`Math`,`Dynamic Programming` | Medium | Biweekly Contest 107 | -| 2746 | [Decremental String Concatenation](/solution/2700-2799/2746.Decremental%20String%20Concatenation/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 107 | -| 2747 | [Count Zero Request Servers](/solution/2700-2799/2747.Count%20Zero%20Request%20Servers/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Sliding Window` | Medium | Biweekly Contest 107 | -| 2748 | [Number of Beautiful Pairs](/solution/2700-2799/2748.Number%20of%20Beautiful%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory` | Easy | Weekly Contest 351 | -| 2749 | [Minimum Operations to Make the Integer Zero](/solution/2700-2799/2749.Minimum%20Operations%20to%20Make%20the%20Integer%20Zero/README_EN.md) | `Bit Manipulation`,`Brainteaser` | Medium | Weekly Contest 351 | -| 2750 | [Ways to Split Array Into Good Subarrays](/solution/2700-2799/2750.Ways%20to%20Split%20Array%20Into%20Good%20Subarrays/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 351 | -| 2751 | [Robot Collisions](/solution/2700-2799/2751.Robot%20Collisions/README_EN.md) | `Stack`,`Array`,`Sorting`,`Simulation` | Hard | Weekly Contest 351 | -| 2752 | [Customers with Maximum Number of Transactions on Consecutive Days](/solution/2700-2799/2752.Customers%20with%20Maximum%20Number%20of%20Transactions%20on%20Consecutive%20Days/README_EN.md) | `Database` | Hard | 🔒 | -| 2753 | [Count Houses in a Circular Street II](/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README_EN.md) | | Hard | 🔒 | -| 2754 | [Bind Function to Context](/solution/2700-2799/2754.Bind%20Function%20to%20Context/README_EN.md) | | Medium | 🔒 | -| 2755 | [Deep Merge of Two Objects](/solution/2700-2799/2755.Deep%20Merge%20of%20Two%20Objects/README_EN.md) | | Medium | 🔒 | -| 2756 | [Query Batching](/solution/2700-2799/2756.Query%20Batching/README_EN.md) | | Hard | 🔒 | -| 2757 | [Generate Circular Array Values](/solution/2700-2799/2757.Generate%20Circular%20Array%20Values/README_EN.md) | | Medium | 🔒 | -| 2758 | [Next Day](/solution/2700-2799/2758.Next%20Day/README_EN.md) | | Easy | 🔒 | -| 2759 | [Convert JSON String to Object](/solution/2700-2799/2759.Convert%20JSON%20String%20to%20Object/README_EN.md) | | Hard | 🔒 | -| 2760 | [Longest Even Odd Subarray With Threshold](/solution/2700-2799/2760.Longest%20Even%20Odd%20Subarray%20With%20Threshold/README_EN.md) | `Array`,`Sliding Window` | Easy | Weekly Contest 352 | -| 2761 | [Prime Pairs With Target Sum](/solution/2700-2799/2761.Prime%20Pairs%20With%20Target%20Sum/README_EN.md) | `Array`,`Math`,`Enumeration`,`Number Theory` | Medium | Weekly Contest 352 | -| 2762 | [Continuous Subarrays](/solution/2700-2799/2762.Continuous%20Subarrays/README_EN.md) | `Queue`,`Array`,`Ordered Set`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | Weekly Contest 352 | -| 2763 | [Sum of Imbalance Numbers of All Subarrays](/solution/2700-2799/2763.Sum%20of%20Imbalance%20Numbers%20of%20All%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Ordered Set` | Hard | Weekly Contest 352 | -| 2764 | [Is Array a Preorder of Some ‌Binary Tree](/solution/2700-2799/2764.Is%20Array%20a%20Preorder%20of%20Some%20%E2%80%8CBinary%20Tree/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | -| 2765 | [Longest Alternating Subarray](/solution/2700-2799/2765.Longest%20Alternating%20Subarray/README_EN.md) | `Array`,`Enumeration` | Easy | Biweekly Contest 108 | -| 2766 | [Relocate Marbles](/solution/2700-2799/2766.Relocate%20Marbles/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation` | Medium | Biweekly Contest 108 | -| 2767 | [Partition String Into Minimum Beautiful Substrings](/solution/2700-2799/2767.Partition%20String%20Into%20Minimum%20Beautiful%20Substrings/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming`,`Backtracking` | Medium | Biweekly Contest 108 | -| 2768 | [Number of Black Blocks](/solution/2700-2799/2768.Number%20of%20Black%20Blocks/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Medium | Biweekly Contest 108 | -| 2769 | [Find the Maximum Achievable Number](/solution/2700-2799/2769.Find%20the%20Maximum%20Achievable%20Number/README_EN.md) | `Math` | Easy | Weekly Contest 353 | -| 2770 | [Maximum Number of Jumps to Reach the Last Index](/solution/2700-2799/2770.Maximum%20Number%20of%20Jumps%20to%20Reach%20the%20Last%20Index/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 353 | -| 2771 | [Longest Non-decreasing Subarray From Two Arrays](/solution/2700-2799/2771.Longest%20Non-decreasing%20Subarray%20From%20Two%20Arrays/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 353 | -| 2772 | [Apply Operations to Make All Array Elements Equal to Zero](/solution/2700-2799/2772.Apply%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%20Zero/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 353 | -| 2773 | [Height of Special Binary Tree](/solution/2700-2799/2773.Height%20of%20Special%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | -| 2774 | [Array Upper Bound](/solution/2700-2799/2774.Array%20Upper%20Bound/README_EN.md) | | Easy | 🔒 | -| 2775 | [Undefined to Null](/solution/2700-2799/2775.Undefined%20to%20Null/README_EN.md) | | Medium | 🔒 | -| 2776 | [Convert Callback Based Function to Promise Based Function](/solution/2700-2799/2776.Convert%20Callback%20Based%20Function%20to%20Promise%20Based%20Function/README_EN.md) | | Medium | 🔒 | -| 2777 | [Date Range Generator](/solution/2700-2799/2777.Date%20Range%20Generator/README_EN.md) | | Medium | 🔒 | -| 2778 | [Sum of Squares of Special Elements](/solution/2700-2799/2778.Sum%20of%20Squares%20of%20Special%20Elements/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 354 | -| 2779 | [Maximum Beauty of an Array After Applying Operation](/solution/2700-2799/2779.Maximum%20Beauty%20of%20an%20Array%20After%20Applying%20Operation/README_EN.md) | `Array`,`Binary Search`,`Sorting`,`Sliding Window` | Medium | Weekly Contest 354 | -| 2780 | [Minimum Index of a Valid Split](/solution/2700-2799/2780.Minimum%20Index%20of%20a%20Valid%20Split/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 354 | -| 2781 | [Length of the Longest Valid Substring](/solution/2700-2799/2781.Length%20of%20the%20Longest%20Valid%20Substring/README_EN.md) | `Array`,`Hash Table`,`String`,`Sliding Window` | Hard | Weekly Contest 354 | -| 2782 | [Number of Unique Categories](/solution/2700-2799/2782.Number%20of%20Unique%20Categories/README_EN.md) | `Union Find`,`Counting`,`Interactive` | Medium | 🔒 | -| 2783 | [Flight Occupancy and Waitlist Analysis](/solution/2700-2799/2783.Flight%20Occupancy%20and%20Waitlist%20Analysis/README_EN.md) | `Database` | Medium | 🔒 | -| 2784 | [Check if Array is Good](/solution/2700-2799/2784.Check%20if%20Array%20is%20Good/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 109 | -| 2785 | [Sort Vowels in a String](/solution/2700-2799/2785.Sort%20Vowels%20in%20a%20String/README_EN.md) | `String`,`Sorting` | Medium | Biweekly Contest 109 | -| 2786 | [Visit Array Positions to Maximize Score](/solution/2700-2799/2786.Visit%20Array%20Positions%20to%20Maximize%20Score/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 109 | -| 2787 | [Ways to Express an Integer as Sum of Powers](/solution/2700-2799/2787.Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers/README_EN.md) | `Dynamic Programming` | Medium | Biweekly Contest 109 | -| 2788 | [Split Strings by Separator](/solution/2700-2799/2788.Split%20Strings%20by%20Separator/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 355 | -| 2789 | [Largest Element in an Array after Merge Operations](/solution/2700-2799/2789.Largest%20Element%20in%20an%20Array%20after%20Merge%20Operations/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 355 | -| 2790 | [Maximum Number of Groups With Increasing Length](/solution/2700-2799/2790.Maximum%20Number%20of%20Groups%20With%20Increasing%20Length/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search`,`Sorting` | Hard | Weekly Contest 355 | -| 2791 | [Count Paths That Can Form a Palindrome in a Tree](/solution/2700-2799/2791.Count%20Paths%20That%20Can%20Form%20a%20Palindrome%20in%20a%20Tree/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 355 | -| 2792 | [Count Nodes That Are Great Enough](/solution/2700-2799/2792.Count%20Nodes%20That%20Are%20Great%20Enough/README_EN.md) | `Tree`,`Depth-First Search`,`Divide and Conquer`,`Binary Tree` | Hard | 🔒 | -| 2793 | [Status of Flight Tickets](/solution/2700-2799/2793.Status%20of%20Flight%20Tickets/README_EN.md) | | Hard | 🔒 | -| 2794 | [Create Object from Two Arrays](/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README_EN.md) | | Easy | 🔒 | -| 2795 | [Parallel Execution of Promises for Individual Results Retrieval](/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README_EN.md) | | Medium | 🔒 | -| 2796 | [Repeat String](/solution/2700-2799/2796.Repeat%20String/README_EN.md) | | Easy | 🔒 | -| 2797 | [Partial Function with Placeholders](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README_EN.md) | | Easy | 🔒 | -| 2798 | [Number of Employees Who Met the Target](/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README_EN.md) | `Array` | Easy | Weekly Contest 356 | -| 2799 | [Count Complete Subarrays in an Array](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 356 | -| 2800 | [Shortest String That Contains Three Strings](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README_EN.md) | `Greedy`,`String`,`Enumeration` | Medium | Weekly Contest 356 | -| 2801 | [Count Stepping Numbers in Range](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 356 | -| 2802 | [Find The K-th Lucky Number](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README_EN.md) | `Bit Manipulation`,`Math`,`String` | Medium | 🔒 | -| 2803 | [Factorial Generator](/solution/2800-2899/2803.Factorial%20Generator/README_EN.md) | | Easy | 🔒 | -| 2804 | [Array Prototype ForEach](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README_EN.md) | | Easy | 🔒 | -| 2805 | [Custom Interval](/solution/2800-2899/2805.Custom%20Interval/README_EN.md) | | Medium | 🔒 | -| 2806 | [Account Balance After Rounded Purchase](/solution/2800-2899/2806.Account%20Balance%20After%20Rounded%20Purchase/README_EN.md) | `Math` | Easy | Biweekly Contest 110 | -| 2807 | [Insert Greatest Common Divisors in Linked List](/solution/2800-2899/2807.Insert%20Greatest%20Common%20Divisors%20in%20Linked%20List/README_EN.md) | `Linked List`,`Math`,`Number Theory` | Medium | Biweekly Contest 110 | -| 2808 | [Minimum Seconds to Equalize a Circular Array](/solution/2800-2899/2808.Minimum%20Seconds%20to%20Equalize%20a%20Circular%20Array/README_EN.md) | `Array`,`Hash Table` | Medium | Biweekly Contest 110 | -| 2809 | [Minimum Time to Make Array Sum At Most x](/solution/2800-2899/2809.Minimum%20Time%20to%20Make%20Array%20Sum%20At%20Most%20x/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 110 | -| 2810 | [Faulty Keyboard](/solution/2800-2899/2810.Faulty%20Keyboard/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 357 | -| 2811 | [Check if it is Possible to Split Array](/solution/2800-2899/2811.Check%20if%20it%20is%20Possible%20to%20Split%20Array/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 357 | -| 2812 | [Find the Safest Path in a Grid](/solution/2800-2899/2812.Find%20the%20Safest%20Path%20in%20a%20Grid/README_EN.md) | `Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix` | Medium | Weekly Contest 357 | -| 2813 | [Maximum Elegance of a K-Length Subsequence](/solution/2800-2899/2813.Maximum%20Elegance%20of%20a%20K-Length%20Subsequence/README_EN.md) | `Stack`,`Greedy`,`Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 357 | -| 2814 | [Minimum Time Takes to Reach Destination Without Drowning](/solution/2800-2899/2814.Minimum%20Time%20Takes%20to%20Reach%20Destination%20Without%20Drowning/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | 🔒 | -| 2815 | [Max Pair Sum in an Array](/solution/2800-2899/2815.Max%20Pair%20Sum%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 358 | -| 2816 | [Double a Number Represented as a Linked List](/solution/2800-2899/2816.Double%20a%20Number%20Represented%20as%20a%20Linked%20List/README_EN.md) | `Stack`,`Linked List`,`Math` | Medium | Weekly Contest 358 | -| 2817 | [Minimum Absolute Difference Between Elements With Constraint](/solution/2800-2899/2817.Minimum%20Absolute%20Difference%20Between%20Elements%20With%20Constraint/README_EN.md) | `Array`,`Binary Search`,`Ordered Set` | Medium | Weekly Contest 358 | -| 2818 | [Apply Operations to Maximize Score](/solution/2800-2899/2818.Apply%20Operations%20to%20Maximize%20Score/README_EN.md) | `Stack`,`Greedy`,`Array`,`Math`,`Number Theory`,`Monotonic Stack` | Hard | Weekly Contest 358 | -| 2819 | [Minimum Relative Loss After Buying Chocolates](/solution/2800-2899/2819.Minimum%20Relative%20Loss%20After%20Buying%20Chocolates/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Hard | 🔒 | -| 2820 | [Election Results](/solution/2800-2899/2820.Election%20Results/README_EN.md) | | Medium | 🔒 | -| 2821 | [Delay the Resolution of Each Promise](/solution/2800-2899/2821.Delay%20the%20Resolution%20of%20Each%20Promise/README_EN.md) | | Medium | 🔒 | -| 2822 | [Inversion of Object](/solution/2800-2899/2822.Inversion%20of%20Object/README_EN.md) | | Easy | 🔒 | -| 2823 | [Deep Object Filter](/solution/2800-2899/2823.Deep%20Object%20Filter/README_EN.md) | | Medium | 🔒 | -| 2824 | [Count Pairs Whose Sum is Less than Target](/solution/2800-2899/2824.Count%20Pairs%20Whose%20Sum%20is%20Less%20than%20Target/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | Biweekly Contest 111 | -| 2825 | [Make String a Subsequence Using Cyclic Increments](/solution/2800-2899/2825.Make%20String%20a%20Subsequence%20Using%20Cyclic%20Increments/README_EN.md) | `Two Pointers`,`String` | Medium | Biweekly Contest 111 | -| 2826 | [Sorting Three Groups](/solution/2800-2899/2826.Sorting%20Three%20Groups/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming` | Medium | Biweekly Contest 111 | -| 2827 | [Number of Beautiful Integers in the Range](/solution/2800-2899/2827.Number%20of%20Beautiful%20Integers%20in%20the%20Range/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Biweekly Contest 111 | -| 2828 | [Check if a String Is an Acronym of Words](/solution/2800-2899/2828.Check%20if%20a%20String%20Is%20an%20Acronym%20of%20Words/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 359 | -| 2829 | [Determine the Minimum Sum of a k-avoiding Array](/solution/2800-2899/2829.Determine%20the%20Minimum%20Sum%20of%20a%20k-avoiding%20Array/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 359 | -| 2830 | [Maximize the Profit as the Salesman](/solution/2800-2899/2830.Maximize%20the%20Profit%20as%20the%20Salesman/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 359 | -| 2831 | [Find the Longest Equal Subarray](/solution/2800-2899/2831.Find%20the%20Longest%20Equal%20Subarray/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sliding Window` | Medium | Weekly Contest 359 | -| 2832 | [Maximal Range That Each Element Is Maximum in It](/solution/2800-2899/2832.Maximal%20Range%20That%20Each%20Element%20Is%20Maximum%20in%20It/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | 🔒 | -| 2833 | [Furthest Point From Origin](/solution/2800-2899/2833.Furthest%20Point%20From%20Origin/README_EN.md) | `String`,`Counting` | Easy | Weekly Contest 360 | -| 2834 | [Find the Minimum Possible Sum of a Beautiful Array](/solution/2800-2899/2834.Find%20the%20Minimum%20Possible%20Sum%20of%20a%20Beautiful%20Array/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 360 | -| 2835 | [Minimum Operations to Form Subsequence With Target Sum](/solution/2800-2899/2835.Minimum%20Operations%20to%20Form%20Subsequence%20With%20Target%20Sum/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array` | Hard | Weekly Contest 360 | -| 2836 | [Maximize Value of Function in a Ball Passing Game](/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 360 | -| 2837 | [Total Traveled Distance](/solution/2800-2899/2837.Total%20Traveled%20Distance/README_EN.md) | `Database` | Easy | 🔒 | -| 2838 | [Maximum Coins Heroes Can Collect](/solution/2800-2899/2838.Maximum%20Coins%20Heroes%20Can%20Collect/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Prefix Sum`,`Sorting` | Medium | 🔒 | -| 2839 | [Check if Strings Can be Made Equal With Operations I](/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README_EN.md) | `String` | Easy | Biweekly Contest 112 | -| 2840 | [Check if Strings Can be Made Equal With Operations II](/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README_EN.md) | `Hash Table`,`String`,`Sorting` | Medium | Biweekly Contest 112 | -| 2841 | [Maximum Sum of Almost Unique Subarray](/solution/2800-2899/2841.Maximum%20Sum%20of%20Almost%20Unique%20Subarray/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Biweekly Contest 112 | -| 2842 | [Count K-Subsequences of a String With Maximum Beauty](/solution/2800-2899/2842.Count%20K-Subsequences%20of%20a%20String%20With%20Maximum%20Beauty/README_EN.md) | `Greedy`,`Hash Table`,`Math`,`String`,`Combinatorics` | Hard | Biweekly Contest 112 | -| 2843 | [Count Symmetric Integers](/solution/2800-2899/2843.Count%20Symmetric%20Integers/README_EN.md) | `Math`,`Enumeration` | Easy | Weekly Contest 361 | -| 2844 | [Minimum Operations to Make a Special Number](/solution/2800-2899/2844.Minimum%20Operations%20to%20Make%20a%20Special%20Number/README_EN.md) | `Greedy`,`Math`,`String`,`Enumeration` | Medium | Weekly Contest 361 | -| 2845 | [Count of Interesting Subarrays](/solution/2800-2899/2845.Count%20of%20Interesting%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 361 | -| 2846 | [Minimum Edge Weight Equilibrium Queries in a Tree](/solution/2800-2899/2846.Minimum%20Edge%20Weight%20Equilibrium%20Queries%20in%20a%20Tree/README_EN.md) | `Tree`,`Graph`,`Array`,`Strongly Connected Component` | Hard | Weekly Contest 361 | -| 2847 | [Smallest Number With Given Digit Product](/solution/2800-2899/2847.Smallest%20Number%20With%20Given%20Digit%20Product/README_EN.md) | `Greedy`,`Math` | Medium | 🔒 | -| 2848 | [Points That Intersect With Cars](/solution/2800-2899/2848.Points%20That%20Intersect%20With%20Cars/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Easy | Weekly Contest 362 | -| 2849 | [Determine if a Cell Is Reachable at a Given Time](/solution/2800-2899/2849.Determine%20if%20a%20Cell%20Is%20Reachable%20at%20a%20Given%20Time/README_EN.md) | `Math` | Medium | Weekly Contest 362 | -| 2850 | [Minimum Moves to Spread Stones Over Grid](/solution/2800-2899/2850.Minimum%20Moves%20to%20Spread%20Stones%20Over%20Grid/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 362 | -| 2851 | [String Transformation](/solution/2800-2899/2851.String%20Transformation/README_EN.md) | `Math`,`String`,`Dynamic Programming`,`String Matching` | Hard | Weekly Contest 362 | -| 2852 | [Sum of Remoteness of All Cells](/solution/2800-2899/2852.Sum%20of%20Remoteness%20of%20All%20Cells/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`Matrix` | Medium | 🔒 | -| 2853 | [Highest Salaries Difference](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README_EN.md) | `Database` | Easy | 🔒 | -| 2854 | [Rolling Average Steps](/solution/2800-2899/2854.Rolling%20Average%20Steps/README_EN.md) | `Database` | Medium | 🔒 | -| 2855 | [Minimum Right Shifts to Sort the Array](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README_EN.md) | `Array` | Easy | Biweekly Contest 113 | -| 2856 | [Minimum Array Length After Pair Removals](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Counting` | Medium | Biweekly Contest 113 | -| 2857 | [Count Pairs of Points With Distance k](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Medium | Biweekly Contest 113 | -| 2858 | [Minimum Edge Reversals So Every Node Is Reachable](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Dynamic Programming` | Hard | Biweekly Contest 113 | -| 2859 | [Sum of Values at Indices With K Set Bits](/solution/2800-2899/2859.Sum%20of%20Values%20at%20Indices%20With%20K%20Set%20Bits/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 363 | -| 2860 | [Happy Students](/solution/2800-2899/2860.Happy%20Students/README_EN.md) | `Array`,`Enumeration`,`Sorting` | Medium | Weekly Contest 363 | -| 2861 | [Maximum Number of Alloys](/solution/2800-2899/2861.Maximum%20Number%20of%20Alloys/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 363 | -| 2862 | [Maximum Element-Sum of a Complete Subset of Indices](/solution/2800-2899/2862.Maximum%20Element-Sum%20of%20a%20Complete%20Subset%20of%20Indices/README_EN.md) | `Array`,`Math`,`Number Theory` | Hard | Weekly Contest 363 | -| 2863 | [Maximum Length of Semi-Decreasing Subarrays](/solution/2800-2899/2863.Maximum%20Length%20of%20Semi-Decreasing%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | 🔒 | -| 2864 | [Maximum Odd Binary Number](/solution/2800-2899/2864.Maximum%20Odd%20Binary%20Number/README_EN.md) | `Greedy`,`Math`,`String` | Easy | Weekly Contest 364 | -| 2865 | [Beautiful Towers I](/solution/2800-2899/2865.Beautiful%20Towers%20I/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 364 | -| 2866 | [Beautiful Towers II](/solution/2800-2899/2866.Beautiful%20Towers%20II/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 364 | -| 2867 | [Count Valid Paths in a Tree](/solution/2800-2899/2867.Count%20Valid%20Paths%20in%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Math`,`Dynamic Programming`,`Number Theory` | Hard | Weekly Contest 364 | -| 2868 | [The Wording Game](/solution/2800-2899/2868.The%20Wording%20Game/README_EN.md) | `Array`,`Math`,`Two Pointers`,`String`,`Game Theory` | Hard | 🔒 | -| 2869 | [Minimum Operations to Collect Elements](/solution/2800-2899/2869.Minimum%20Operations%20to%20Collect%20Elements/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Easy | Biweekly Contest 114 | -| 2870 | [Minimum Number of Operations to Make Array Empty](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Medium | Biweekly Contest 114 | -| 2871 | [Split Array Into Maximum Number of Subarrays](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array` | Medium | Biweekly Contest 114 | -| 2872 | [Maximum Number of K-Divisible Components](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README_EN.md) | `Tree`,`Depth-First Search` | Hard | Biweekly Contest 114 | -| 2873 | [Maximum Value of an Ordered Triplet I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README_EN.md) | `Array` | Easy | Weekly Contest 365 | -| 2874 | [Maximum Value of an Ordered Triplet II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README_EN.md) | `Array` | Medium | Weekly Contest 365 | -| 2875 | [Minimum Size Subarray in Infinite Array](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 365 | -| 2876 | [Count Visited Nodes in a Directed Graph](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README_EN.md) | `Graph`,`Memoization`,`Dynamic Programming` | Hard | Weekly Contest 365 | -| 2877 | [Create a DataFrame from List](/solution/2800-2899/2877.Create%20a%20DataFrame%20from%20List/README_EN.md) | | Easy | | -| 2878 | [Get the Size of a DataFrame](/solution/2800-2899/2878.Get%20the%20Size%20of%20a%20DataFrame/README_EN.md) | | Easy | | -| 2879 | [Display the First Three Rows](/solution/2800-2899/2879.Display%20the%20First%20Three%20Rows/README_EN.md) | | Easy | | -| 2880 | [Select Data](/solution/2800-2899/2880.Select%20Data/README_EN.md) | | Easy | | -| 2881 | [Create a New Column](/solution/2800-2899/2881.Create%20a%20New%20Column/README_EN.md) | | Easy | | -| 2882 | [Drop Duplicate Rows](/solution/2800-2899/2882.Drop%20Duplicate%20Rows/README_EN.md) | | Easy | | -| 2883 | [Drop Missing Data](/solution/2800-2899/2883.Drop%20Missing%20Data/README_EN.md) | | Easy | | -| 2884 | [Modify Columns](/solution/2800-2899/2884.Modify%20Columns/README_EN.md) | | Easy | | -| 2885 | [Rename Columns](/solution/2800-2899/2885.Rename%20Columns/README_EN.md) | | Easy | | -| 2886 | [Change Data Type](/solution/2800-2899/2886.Change%20Data%20Type/README_EN.md) | | Easy | | -| 2887 | [Fill Missing Data](/solution/2800-2899/2887.Fill%20Missing%20Data/README_EN.md) | | Easy | | -| 2888 | [Reshape Data Concatenate](/solution/2800-2899/2888.Reshape%20Data%20Concatenate/README_EN.md) | | Easy | | -| 2889 | [Reshape Data Pivot](/solution/2800-2899/2889.Reshape%20Data%20Pivot/README_EN.md) | | Easy | | -| 2890 | [Reshape Data Melt](/solution/2800-2899/2890.Reshape%20Data%20Melt/README_EN.md) | | Easy | | -| 2891 | [Method Chaining](/solution/2800-2899/2891.Method%20Chaining/README_EN.md) | | Easy | | -| 2892 | [Minimizing Array After Replacing Pairs With Their Product](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | 🔒 | -| 2893 | [Calculate Orders Within Each Interval](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README_EN.md) | `Database` | Medium | 🔒 | -| 2894 | [Divisible and Non-divisible Sums Difference](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README_EN.md) | `Math` | Easy | Weekly Contest 366 | -| 2895 | [Minimum Processing Time](/solution/2800-2899/2895.Minimum%20Processing%20Time/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 366 | -| 2896 | [Apply Operations to Make Two Strings Equal](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README_EN.md) | `String`,`Dynamic Programming` | Medium | Weekly Contest 366 | -| 2897 | [Apply Operations on Array to Maximize Sum of Squares](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Hash Table` | Hard | Weekly Contest 366 | -| 2898 | [Maximum Linear Stock Score](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README_EN.md) | `Array`,`Hash Table` | Medium | 🔒 | -| 2899 | [Last Visited Integers](/solution/2800-2899/2899.Last%20Visited%20Integers/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 115 | -| 2900 | [Longest Unequal Adjacent Groups Subsequence I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README_EN.md) | `Greedy`,`Array`,`String`,`Dynamic Programming` | Easy | Biweekly Contest 115 | -| 2901 | [Longest Unequal Adjacent Groups Subsequence II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 115 | -| 2902 | [Count of Sub-Multisets With Bounded Sum](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming`,`Sliding Window` | Hard | Biweekly Contest 115 | -| 2903 | [Find Indices With Index and Value Difference I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README_EN.md) | `Array`,`Two Pointers` | Easy | Weekly Contest 367 | -| 2904 | [Shortest and Lexicographically Smallest Beautiful String](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) | `String`,`Sliding Window` | Medium | Weekly Contest 367 | -| 2905 | [Find Indices With Index and Value Difference II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README_EN.md) | `Array`,`Two Pointers` | Medium | Weekly Contest 367 | -| 2906 | [Construct Product Matrix](/solution/2900-2999/2906.Construct%20Product%20Matrix/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 367 | -| 2907 | [Maximum Profitable Triplets With Increasing Prices I](/solution/2900-2999/2907.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20I/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array` | Medium | 🔒 | -| 2908 | [Minimum Sum of Mountain Triplets I](/solution/2900-2999/2908.Minimum%20Sum%20of%20Mountain%20Triplets%20I/README_EN.md) | `Array` | Easy | Weekly Contest 368 | -| 2909 | [Minimum Sum of Mountain Triplets II](/solution/2900-2999/2909.Minimum%20Sum%20of%20Mountain%20Triplets%20II/README_EN.md) | `Array` | Medium | Weekly Contest 368 | -| 2910 | [Minimum Number of Groups to Create a Valid Assignment](/solution/2900-2999/2910.Minimum%20Number%20of%20Groups%20to%20Create%20a%20Valid%20Assignment/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Medium | Weekly Contest 368 | -| 2911 | [Minimum Changes to Make K Semi-palindromes](/solution/2900-2999/2911.Minimum%20Changes%20to%20Make%20K%20Semi-palindromes/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Hard | Weekly Contest 368 | -| 2912 | [Number of Ways to Reach Destination in the Grid](/solution/2900-2999/2912.Number%20of%20Ways%20to%20Reach%20Destination%20in%20the%20Grid/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | 🔒 | -| 2913 | [Subarrays Distinct Element Sum of Squares I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README_EN.md) | `Array`,`Hash Table` | Easy | Biweekly Contest 116 | -| 2914 | [Minimum Number of Changes to Make Binary String Beautiful](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README_EN.md) | `String` | Medium | Biweekly Contest 116 | -| 2915 | [Length of the Longest Subsequence That Sums to Target](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 116 | -| 2916 | [Subarrays Distinct Element Sum of Squares II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 116 | -| 2917 | [Find the K-or of an Array](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 369 | -| 2918 | [Minimum Equal Sum of Two Arrays After Replacing Zeros](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 369 | -| 2919 | [Minimum Increment Operations to Make Array Beautiful](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 369 | -| 2920 | [Maximum Points After Collecting Coins From All Nodes](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 369 | -| 2921 | [Maximum Profitable Triplets With Increasing Prices II](/solution/2900-2999/2921.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array` | Hard | 🔒 | -| 2922 | [Market Analysis III](/solution/2900-2999/2922.Market%20Analysis%20III/README_EN.md) | `Database` | Medium | 🔒 | -| 2923 | [Find Champion I](/solution/2900-2999/2923.Find%20Champion%20I/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 370 | -| 2924 | [Find Champion II](/solution/2900-2999/2924.Find%20Champion%20II/README_EN.md) | `Graph` | Medium | Weekly Contest 370 | -| 2925 | [Maximum Score After Applying Operations on a Tree](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming` | Medium | Weekly Contest 370 | -| 2926 | [Maximum Balanced Subsequence Sum](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 370 | -| 2927 | [Distribute Candies Among Children III](/solution/2900-2999/2927.Distribute%20Candies%20Among%20Children%20III/README_EN.md) | `Math`,`Combinatorics` | Hard | 🔒 | -| 2928 | [Distribute Candies Among Children I](/solution/2900-2999/2928.Distribute%20Candies%20Among%20Children%20I/README_EN.md) | `Math`,`Combinatorics`,`Enumeration` | Easy | Biweekly Contest 117 | -| 2929 | [Distribute Candies Among Children II](/solution/2900-2999/2929.Distribute%20Candies%20Among%20Children%20II/README_EN.md) | `Math`,`Combinatorics`,`Enumeration` | Medium | Biweekly Contest 117 | -| 2930 | [Number of Strings Which Can Be Rearranged to Contain Substring](/solution/2900-2999/2930.Number%20of%20Strings%20Which%20Can%20Be%20Rearranged%20to%20Contain%20Substring/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | Biweekly Contest 117 | -| 2931 | [Maximum Spending After Buying Items](/solution/2900-2999/2931.Maximum%20Spending%20After%20Buying%20Items/README_EN.md) | `Greedy`,`Array`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Hard | Biweekly Contest 117 | -| 2932 | [Maximum Strong Pair XOR I](/solution/2900-2999/2932.Maximum%20Strong%20Pair%20XOR%20I/README_EN.md) | `Bit Manipulation`,`Trie`,`Array`,`Hash Table`,`Sliding Window` | Easy | Weekly Contest 371 | -| 2933 | [High-Access Employees](/solution/2900-2999/2933.High-Access%20Employees/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 371 | -| 2934 | [Minimum Operations to Maximize Last Elements in Arrays](/solution/2900-2999/2934.Minimum%20Operations%20to%20Maximize%20Last%20Elements%20in%20Arrays/README_EN.md) | `Array`,`Enumeration` | Medium | Weekly Contest 371 | -| 2935 | [Maximum Strong Pair XOR II](/solution/2900-2999/2935.Maximum%20Strong%20Pair%20XOR%20II/README_EN.md) | `Bit Manipulation`,`Trie`,`Array`,`Hash Table`,`Sliding Window` | Hard | Weekly Contest 371 | -| 2936 | [Number of Equal Numbers Blocks](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README_EN.md) | `Array`,`Binary Search`,`Interactive` | Medium | 🔒 | -| 2937 | [Make Three Strings Equal](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README_EN.md) | `String` | Easy | Weekly Contest 372 | -| 2938 | [Separate Black and White Balls](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 372 | -| 2939 | [Maximum Xor Product](/solution/2900-2999/2939.Maximum%20Xor%20Product/README_EN.md) | `Greedy`,`Bit Manipulation`,`Math` | Medium | Weekly Contest 372 | -| 2940 | [Find Building Where Alice and Bob Can Meet](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README_EN.md) | `Stack`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Weekly Contest 372 | -| 2941 | [Maximum GCD-Sum of a Subarray](/solution/2900-2999/2941.Maximum%20GCD-Sum%20of%20a%20Subarray/README_EN.md) | `Array`,`Math`,`Binary Search`,`Number Theory` | Hard | 🔒 | -| 2942 | [Find Words Containing Character](/solution/2900-2999/2942.Find%20Words%20Containing%20Character/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 118 | -| 2943 | [Maximize Area of Square Hole in Grid](/solution/2900-2999/2943.Maximize%20Area%20of%20Square%20Hole%20in%20Grid/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 118 | -| 2944 | [Minimum Number of Coins for Fruits](/solution/2900-2999/2944.Minimum%20Number%20of%20Coins%20for%20Fruits/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | Biweekly Contest 118 | -| 2945 | [Find Maximum Non-decreasing Array Length](/solution/2900-2999/2945.Find%20Maximum%20Non-decreasing%20Array%20Length/README_EN.md) | `Stack`,`Queue`,`Array`,`Binary Search`,`Dynamic Programming`,`Monotonic Queue`,`Monotonic Stack` | Hard | Biweekly Contest 118 | -| 2946 | [Matrix Similarity After Cyclic Shifts](/solution/2900-2999/2946.Matrix%20Similarity%20After%20Cyclic%20Shifts/README_EN.md) | `Array`,`Math`,`Matrix`,`Simulation` | Easy | Weekly Contest 373 | -| 2947 | [Count Beautiful Substrings I](/solution/2900-2999/2947.Count%20Beautiful%20Substrings%20I/README_EN.md) | `Hash Table`,`Math`,`String`,`Enumeration`,`Number Theory`,`Prefix Sum` | Medium | Weekly Contest 373 | -| 2948 | [Make Lexicographically Smallest Array by Swapping Elements](/solution/2900-2999/2948.Make%20Lexicographically%20Smallest%20Array%20by%20Swapping%20Elements/README_EN.md) | `Union Find`,`Array`,`Sorting` | Medium | Weekly Contest 373 | -| 2949 | [Count Beautiful Substrings II](/solution/2900-2999/2949.Count%20Beautiful%20Substrings%20II/README_EN.md) | `Hash Table`,`Math`,`String`,`Number Theory`,`Prefix Sum` | Hard | Weekly Contest 373 | -| 2950 | [Number of Divisible Substrings](/solution/2900-2999/2950.Number%20of%20Divisible%20Substrings/README_EN.md) | `Hash Table`,`String`,`Counting`,`Prefix Sum` | Medium | 🔒 | -| 2951 | [Find the Peaks](/solution/2900-2999/2951.Find%20the%20Peaks/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 374 | -| 2952 | [Minimum Number of Coins to be Added](/solution/2900-2999/2952.Minimum%20Number%20of%20Coins%20to%20be%20Added/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 374 | -| 2953 | [Count Complete Substrings](/solution/2900-2999/2953.Count%20Complete%20Substrings/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | Weekly Contest 374 | -| 2954 | [Count the Number of Infection Sequences](/solution/2900-2999/2954.Count%20the%20Number%20of%20Infection%20Sequences/README_EN.md) | `Array`,`Math`,`Combinatorics` | Hard | Weekly Contest 374 | -| 2955 | [Number of Same-End Substrings](/solution/2900-2999/2955.Number%20of%20Same-End%20Substrings/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting`,`Prefix Sum` | Medium | 🔒 | -| 2956 | [Find Common Elements Between Two Arrays](/solution/2900-2999/2956.Find%20Common%20Elements%20Between%20Two%20Arrays/README_EN.md) | `Array`,`Hash Table` | Easy | Biweekly Contest 119 | -| 2957 | [Remove Adjacent Almost-Equal Characters](/solution/2900-2999/2957.Remove%20Adjacent%20Almost-Equal%20Characters/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 119 | -| 2958 | [Length of Longest Subarray With at Most K Frequency](/solution/2900-2999/2958.Length%20of%20Longest%20Subarray%20With%20at%20Most%20K%20Frequency/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Biweekly Contest 119 | -| 2959 | [Number of Possible Sets of Closing Branches](/solution/2900-2999/2959.Number%20of%20Possible%20Sets%20of%20Closing%20Branches/README_EN.md) | `Bit Manipulation`,`Graph`,`Enumeration`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Biweekly Contest 119 | -| 2960 | [Count Tested Devices After Test Operations](/solution/2900-2999/2960.Count%20Tested%20Devices%20After%20Test%20Operations/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 375 | -| 2961 | [Double Modular Exponentiation](/solution/2900-2999/2961.Double%20Modular%20Exponentiation/README_EN.md) | `Array`,`Math`,`Simulation` | Medium | Weekly Contest 375 | -| 2962 | [Count Subarrays Where Max Element Appears at Least K Times](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 375 | -| 2963 | [Count the Number of Good Partitions](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README_EN.md) | `Array`,`Hash Table`,`Math`,`Combinatorics` | Hard | Weekly Contest 375 | -| 2964 | [Number of Divisible Triplet Sums](/solution/2900-2999/2964.Number%20of%20Divisible%20Triplet%20Sums/README_EN.md) | `Array`,`Hash Table` | Medium | 🔒 | -| 2965 | [Find Missing and Repeated Values](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README_EN.md) | `Array`,`Hash Table`,`Math`,`Matrix` | Easy | Weekly Contest 376 | -| 2966 | [Divide Array Into Arrays With Max Difference](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 376 | -| 2967 | [Minimum Cost to Make Array Equalindromic](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Medium | Weekly Contest 376 | -| 2968 | [Apply Operations to Maximize Frequency Score](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting`,`Sliding Window` | Hard | Weekly Contest 376 | -| 2969 | [Minimum Number of Coins for Fruits II](/solution/2900-2999/2969.Minimum%20Number%20of%20Coins%20for%20Fruits%20II/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | 🔒 | -| 2970 | [Count the Number of Incremovable Subarrays I](/solution/2900-2999/2970.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Enumeration` | Easy | Biweekly Contest 120 | -| 2971 | [Find Polygon With the Largest Perimeter](/solution/2900-2999/2971.Find%20Polygon%20With%20the%20Largest%20Perimeter/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 120 | -| 2972 | [Count the Number of Incremovable Subarrays II](/solution/2900-2999/2972.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README_EN.md) | `Array`,`Two Pointers`,`Binary Search` | Hard | Biweekly Contest 120 | -| 2973 | [Find Number of Coins to Place in Tree Nodes](/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Sorting`,`Heap (Priority Queue)` | Hard | Biweekly Contest 120 | -| 2974 | [Minimum Number Game](/solution/2900-2999/2974.Minimum%20Number%20Game/README_EN.md) | `Array`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 377 | -| 2975 | [Maximum Square Area by Removing Fences From a Field](/solution/2900-2999/2975.Maximum%20Square%20Area%20by%20Removing%20Fences%20From%20a%20Field/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Medium | Weekly Contest 377 | -| 2976 | [Minimum Cost to Convert String I](/solution/2900-2999/2976.Minimum%20Cost%20to%20Convert%20String%20I/README_EN.md) | `Graph`,`Array`,`String`,`Shortest Path` | Medium | Weekly Contest 377 | -| 2977 | [Minimum Cost to Convert String II](/solution/2900-2999/2977.Minimum%20Cost%20to%20Convert%20String%20II/README_EN.md) | `Graph`,`Trie`,`Array`,`String`,`Dynamic Programming`,`Shortest Path` | Hard | Weekly Contest 377 | -| 2978 | [Symmetric Coordinates](/solution/2900-2999/2978.Symmetric%20Coordinates/README_EN.md) | `Database` | Medium | 🔒 | -| 2979 | [Most Expensive Item That Can Not Be Bought](/solution/2900-2999/2979.Most%20Expensive%20Item%20That%20Can%20Not%20Be%20Bought/README_EN.md) | `Math`,`Dynamic Programming`,`Number Theory` | Medium | 🔒 | -| 2980 | [Check if Bitwise OR Has Trailing Zeros](/solution/2900-2999/2980.Check%20if%20Bitwise%20OR%20Has%20Trailing%20Zeros/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 378 | -| 2981 | [Find Longest Special Substring That Occurs Thrice I](/solution/2900-2999/2981.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20I/README_EN.md) | `Hash Table`,`String`,`Binary Search`,`Counting`,`Sliding Window` | Medium | Weekly Contest 378 | -| 2982 | [Find Longest Special Substring That Occurs Thrice II](/solution/2900-2999/2982.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20II/README_EN.md) | `Hash Table`,`String`,`Binary Search`,`Counting`,`Sliding Window` | Medium | Weekly Contest 378 | -| 2983 | [Palindrome Rearrangement Queries](/solution/2900-2999/2983.Palindrome%20Rearrangement%20Queries/README_EN.md) | `Hash Table`,`String`,`Prefix Sum` | Hard | Weekly Contest 378 | -| 2984 | [Find Peak Calling Hours for Each City](/solution/2900-2999/2984.Find%20Peak%20Calling%20Hours%20for%20Each%20City/README_EN.md) | `Database` | Medium | 🔒 | -| 2985 | [Calculate Compressed Mean](/solution/2900-2999/2985.Calculate%20Compressed%20Mean/README_EN.md) | `Database` | Easy | 🔒 | -| 2986 | [Find Third Transaction](/solution/2900-2999/2986.Find%20Third%20Transaction/README_EN.md) | `Database` | Medium | 🔒 | -| 2987 | [Find Expensive Cities](/solution/2900-2999/2987.Find%20Expensive%20Cities/README_EN.md) | `Database` | Easy | 🔒 | -| 2988 | [Manager of the Largest Department](/solution/2900-2999/2988.Manager%20of%20the%20Largest%20Department/README_EN.md) | `Database` | Medium | 🔒 | -| 2989 | [Class Performance](/solution/2900-2999/2989.Class%20Performance/README_EN.md) | `Database` | Medium | 🔒 | -| 2990 | [Loan Types](/solution/2900-2999/2990.Loan%20Types/README_EN.md) | `Database` | Easy | 🔒 | -| 2991 | [Top Three Wineries](/solution/2900-2999/2991.Top%20Three%20Wineries/README_EN.md) | `Database` | Hard | 🔒 | -| 2992 | [Number of Self-Divisible Permutations](/solution/2900-2999/2992.Number%20of%20Self-Divisible%20Permutations/README_EN.md) | `Bit Manipulation`,`Recursion`,`Array`,`Dynamic Programming`,`Bitmask` | Medium | 🔒 | -| 2993 | [Friday Purchases I](/solution/2900-2999/2993.Friday%20Purchases%20I/README_EN.md) | `Database` | Medium | 🔒 | -| 2994 | [Friday Purchases II](/solution/2900-2999/2994.Friday%20Purchases%20II/README_EN.md) | `Database` | Hard | 🔒 | -| 2995 | [Viewers Turned Streamers](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README_EN.md) | `Database` | Hard | 🔒 | -| 2996 | [Smallest Missing Integer Greater Than Sequential Prefix Sum](/solution/2900-2999/2996.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 121 | -| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K](/solution/2900-2999/2997.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Biweekly Contest 121 | -| 2998 | [Minimum Number of Operations to Make X and Y Equal](/solution/2900-2999/2998.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README_EN.md) | `Breadth-First Search`,`Memoization`,`Dynamic Programming` | Medium | Biweekly Contest 121 | -| 2999 | [Count the Number of Powerful Integers](/solution/2900-2999/2999.Count%20the%20Number%20of%20Powerful%20Integers/README_EN.md) | `Math`,`String`,`Dynamic Programming` | Hard | Biweekly Contest 121 | -| 3000 | [Maximum Area of Longest Diagonal Rectangle](/solution/3000-3099/3000.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README_EN.md) | `Array` | Easy | Weekly Contest 379 | -| 3001 | [Minimum Moves to Capture The Queen](/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/README_EN.md) | `Array`,`Enumeration` | Medium | Weekly Contest 379 | -| 3002 | [Maximum Size of a Set After Removals](/solution/3000-3099/3002.Maximum%20Size%20of%20a%20Set%20After%20Removals/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Medium | Weekly Contest 379 | -| 3003 | [Maximize the Number of Partitions After Operations](/solution/3000-3099/3003.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README_EN.md) | `Bit Manipulation`,`String`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 379 | -| 3004 | [Maximum Subtree of the Same Color](/solution/3000-3099/3004.Maximum%20Subtree%20of%20the%20Same%20Color/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Medium | 🔒 | -| 3005 | [Count Elements With Maximum Frequency](/solution/3000-3099/3005.Count%20Elements%20With%20Maximum%20Frequency/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 380 | -| 3006 | [Find Beautiful Indices in the Given Array I](/solution/3000-3099/3006.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I/README_EN.md) | `Two Pointers`,`String`,`Binary Search`,`String Matching`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 380 | -| 3007 | [Maximum Number That Sum of the Prices Is Less Than or Equal to K](/solution/3000-3099/3007.Maximum%20Number%20That%20Sum%20of%20the%20Prices%20Is%20Less%20Than%20or%20Equal%20to%20K/README_EN.md) | `Bit Manipulation`,`Binary Search`,`Dynamic Programming` | Medium | Weekly Contest 380 | -| 3008 | [Find Beautiful Indices in the Given Array II](/solution/3000-3099/3008.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20II/README_EN.md) | `Two Pointers`,`String`,`Binary Search`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 380 | -| 3009 | [Maximum Number of Intersections on the Chart](/solution/3000-3099/3009.Maximum%20Number%20of%20Intersections%20on%20the%20Chart/README_EN.md) | `Binary Indexed Tree`,`Geometry`,`Array`,`Math` | Hard | 🔒 | -| 3010 | [Divide an Array Into Subarrays With Minimum Cost I](/solution/3000-3099/3010.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20I/README_EN.md) | `Array`,`Enumeration`,`Sorting` | Easy | Biweekly Contest 122 | -| 3011 | [Find if Array Can Be Sorted](/solution/3000-3099/3011.Find%20if%20Array%20Can%20Be%20Sorted/README_EN.md) | `Bit Manipulation`,`Array`,`Sorting` | Medium | Biweekly Contest 122 | -| 3012 | [Minimize Length of Array Using Operations](/solution/3000-3099/3012.Minimize%20Length%20of%20Array%20Using%20Operations/README_EN.md) | `Greedy`,`Array`,`Math`,`Number Theory` | Medium | Biweekly Contest 122 | -| 3013 | [Divide an Array Into Subarrays With Minimum Cost II](/solution/3000-3099/3013.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20II/README_EN.md) | `Array`,`Hash Table`,`Sliding Window`,`Heap (Priority Queue)` | Hard | Biweekly Contest 122 | -| 3014 | [Minimum Number of Pushes to Type Word I](/solution/3000-3099/3014.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20I/README_EN.md) | `Greedy`,`Math`,`String` | Easy | Weekly Contest 381 | -| 3015 | [Count the Number of Houses at a Certain Distance I](/solution/3000-3099/3015.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20I/README_EN.md) | `Breadth-First Search`,`Graph`,`Prefix Sum` | Medium | Weekly Contest 381 | -| 3016 | [Minimum Number of Pushes to Type Word II](/solution/3000-3099/3016.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20II/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 381 | -| 3017 | [Count the Number of Houses at a Certain Distance II](/solution/3000-3099/3017.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20II/README_EN.md) | `Graph`,`Prefix Sum` | Hard | Weekly Contest 381 | -| 3018 | [Maximum Number of Removal Queries That Can Be Processed I](/solution/3000-3099/3018.Maximum%20Number%20of%20Removal%20Queries%20That%20Can%20Be%20Processed%20I/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | -| 3019 | [Number of Changing Keys](/solution/3000-3099/3019.Number%20of%20Changing%20Keys/README_EN.md) | `String` | Easy | Weekly Contest 382 | -| 3020 | [Find the Maximum Number of Elements in Subset](/solution/3000-3099/3020.Find%20the%20Maximum%20Number%20of%20Elements%20in%20Subset/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Medium | Weekly Contest 382 | -| 3021 | [Alice and Bob Playing Flower Game](/solution/3000-3099/3021.Alice%20and%20Bob%20Playing%20Flower%20Game/README_EN.md) | `Math` | Medium | Weekly Contest 382 | -| 3022 | [Minimize OR of Remaining Elements Using Operations](/solution/3000-3099/3022.Minimize%20OR%20of%20Remaining%20Elements%20Using%20Operations/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array` | Hard | Weekly Contest 382 | -| 3023 | [Find Pattern in Infinite Stream I](/solution/3000-3099/3023.Find%20Pattern%20in%20Infinite%20Stream%20I/README_EN.md) | `Array`,`String Matching`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Medium | 🔒 | -| 3024 | [Type of Triangle](/solution/3000-3099/3024.Type%20of%20Triangle/README_EN.md) | `Array`,`Math`,`Sorting` | Easy | Biweekly Contest 123 | -| 3025 | [Find the Number of Ways to Place People I](/solution/3000-3099/3025.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20I/README_EN.md) | `Geometry`,`Array`,`Math`,`Enumeration`,`Sorting` | Medium | Biweekly Contest 123 | -| 3026 | [Maximum Good Subarray Sum](/solution/3000-3099/3026.Maximum%20Good%20Subarray%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Biweekly Contest 123 | -| 3027 | [Find the Number of Ways to Place People II](/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/README_EN.md) | `Geometry`,`Array`,`Math`,`Enumeration`,`Sorting` | Hard | Biweekly Contest 123 | -| 3028 | [Ant on the Boundary](/solution/3000-3099/3028.Ant%20on%20the%20Boundary/README_EN.md) | `Array`,`Prefix Sum`,`Simulation` | Easy | Weekly Contest 383 | -| 3029 | [Minimum Time to Revert Word to Initial State I](/solution/3000-3099/3029.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20I/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 383 | -| 3030 | [Find the Grid of Region Average](/solution/3000-3099/3030.Find%20the%20Grid%20of%20Region%20Average/README_EN.md) | `Array`,`Matrix` | Medium | Weekly Contest 383 | -| 3031 | [Minimum Time to Revert Word to Initial State II](/solution/3000-3099/3031.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20II/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 383 | -| 3032 | [Count Numbers With Unique Digits II](/solution/3000-3099/3032.Count%20Numbers%20With%20Unique%20Digits%20II/README_EN.md) | `Hash Table`,`Math`,`Dynamic Programming` | Easy | 🔒 | -| 3033 | [Modify the Matrix](/solution/3000-3099/3033.Modify%20the%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 384 | -| 3034 | [Number of Subarrays That Match a Pattern I](/solution/3000-3099/3034.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20I/README_EN.md) | `Array`,`String Matching`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 384 | -| 3035 | [Maximum Palindromes After Operations](/solution/3000-3099/3035.Maximum%20Palindromes%20After%20Operations/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 384 | -| 3036 | [Number of Subarrays That Match a Pattern II](/solution/3000-3099/3036.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20II/README_EN.md) | `Array`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 384 | -| 3037 | [Find Pattern in Infinite Stream II](/solution/3000-3099/3037.Find%20Pattern%20in%20Infinite%20Stream%20II/README_EN.md) | `Array`,`String Matching`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Hard | 🔒 | -| 3038 | [Maximum Number of Operations With the Same Score I](/solution/3000-3099/3038.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20I/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 124 | -| 3039 | [Apply Operations to Make String Empty](/solution/3000-3099/3039.Apply%20Operations%20to%20Make%20String%20Empty/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Biweekly Contest 124 | -| 3040 | [Maximum Number of Operations With the Same Score II](/solution/3000-3099/3040.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20II/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Medium | Biweekly Contest 124 | -| 3041 | [Maximize Consecutive Elements in an Array After Modification](/solution/3000-3099/3041.Maximize%20Consecutive%20Elements%20in%20an%20Array%20After%20Modification/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 124 | -| 3042 | [Count Prefix and Suffix Pairs I](/solution/3000-3099/3042.Count%20Prefix%20and%20Suffix%20Pairs%20I/README_EN.md) | `Trie`,`Array`,`String`,`String Matching`,`Hash Function`,`Rolling Hash` | Easy | Weekly Contest 385 | -| 3043 | [Find the Length of the Longest Common Prefix](/solution/3000-3099/3043.Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 385 | -| 3044 | [Most Frequent Prime](/solution/3000-3099/3044.Most%20Frequent%20Prime/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Enumeration`,`Matrix`,`Number Theory` | Medium | Weekly Contest 385 | -| 3045 | [Count Prefix and Suffix Pairs II](/solution/3000-3099/3045.Count%20Prefix%20and%20Suffix%20Pairs%20II/README_EN.md) | `Trie`,`Array`,`String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 385 | -| 3046 | [Split the Array](/solution/3000-3099/3046.Split%20the%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 386 | -| 3047 | [Find the Largest Area of Square Inside Two Rectangles](/solution/3000-3099/3047.Find%20the%20Largest%20Area%20of%20Square%20Inside%20Two%20Rectangles/README_EN.md) | `Geometry`,`Array`,`Math` | Medium | Weekly Contest 386 | -| 3048 | [Earliest Second to Mark Indices I](/solution/3000-3099/3048.Earliest%20Second%20to%20Mark%20Indices%20I/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 386 | -| 3049 | [Earliest Second to Mark Indices II](/solution/3000-3099/3049.Earliest%20Second%20to%20Mark%20Indices%20II/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Heap (Priority Queue)` | Hard | Weekly Contest 386 | -| 3050 | [Pizza Toppings Cost Analysis](/solution/3000-3099/3050.Pizza%20Toppings%20Cost%20Analysis/README_EN.md) | `Database` | Medium | 🔒 | -| 3051 | [Find Candidates for Data Scientist Position](/solution/3000-3099/3051.Find%20Candidates%20for%20Data%20Scientist%20Position/README_EN.md) | `Database` | Easy | 🔒 | -| 3052 | [Maximize Items](/solution/3000-3099/3052.Maximize%20Items/README_EN.md) | `Database` | Hard | 🔒 | -| 3053 | [Classifying Triangles by Lengths](/solution/3000-3099/3053.Classifying%20Triangles%20by%20Lengths/README_EN.md) | `Database` | Easy | 🔒 | -| 3054 | [Binary Tree Nodes](/solution/3000-3099/3054.Binary%20Tree%20Nodes/README_EN.md) | `Database` | Medium | 🔒 | -| 3055 | [Top Percentile Fraud](/solution/3000-3099/3055.Top%20Percentile%20Fraud/README_EN.md) | `Database` | Medium | 🔒 | -| 3056 | [Snaps Analysis](/solution/3000-3099/3056.Snaps%20Analysis/README_EN.md) | `Database` | Medium | 🔒 | -| 3057 | [Employees Project Allocation](/solution/3000-3099/3057.Employees%20Project%20Allocation/README_EN.md) | `Database` | Hard | 🔒 | -| 3058 | [Friends With No Mutual Friends](/solution/3000-3099/3058.Friends%20With%20No%20Mutual%20Friends/README_EN.md) | `Database` | Medium | 🔒 | -| 3059 | [Find All Unique Email Domains](/solution/3000-3099/3059.Find%20All%20Unique%20Email%20Domains/README_EN.md) | `Database` | Easy | 🔒 | -| 3060 | [User Activities within Time Bounds](/solution/3000-3099/3060.User%20Activities%20within%20Time%20Bounds/README_EN.md) | `Database` | Hard | 🔒 | -| 3061 | [Calculate Trapping Rain Water](/solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README_EN.md) | `Database` | Hard | 🔒 | -| 3062 | [Winner of the Linked List Game](/solution/3000-3099/3062.Winner%20of%20the%20Linked%20List%20Game/README_EN.md) | `Linked List` | Easy | 🔒 | -| 3063 | [Linked List Frequency](/solution/3000-3099/3063.Linked%20List%20Frequency/README_EN.md) | `Hash Table`,`Linked List`,`Counting` | Easy | 🔒 | -| 3064 | [Guess the Number Using Bitwise Questions I](/solution/3000-3099/3064.Guess%20the%20Number%20Using%20Bitwise%20Questions%20I/README_EN.md) | `Bit Manipulation`,`Interactive` | Medium | 🔒 | -| 3065 | [Minimum Operations to Exceed Threshold Value I](/solution/3000-3099/3065.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20I/README_EN.md) | `Array` | Easy | Biweekly Contest 125 | -| 3066 | [Minimum Operations to Exceed Threshold Value II](/solution/3000-3099/3066.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20II/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 125 | -| 3067 | [Count Pairs of Connectable Servers in a Weighted Tree Network](/solution/3000-3099/3067.Count%20Pairs%20of%20Connectable%20Servers%20in%20a%20Weighted%20Tree%20Network/README_EN.md) | `Tree`,`Depth-First Search`,`Array` | Medium | Biweekly Contest 125 | -| 3068 | [Find the Maximum Sum of Node Values](/solution/3000-3099/3068.Find%20the%20Maximum%20Sum%20of%20Node%20Values/README_EN.md) | `Greedy`,`Bit Manipulation`,`Tree`,`Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 125 | -| 3069 | [Distribute Elements Into Two Arrays I](/solution/3000-3099/3069.Distribute%20Elements%20Into%20Two%20Arrays%20I/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 387 | -| 3070 | [Count Submatrices with Top-Left Element and Sum Less Than k](/solution/3000-3099/3070.Count%20Submatrices%20with%20Top-Left%20Element%20and%20Sum%20Less%20Than%20k/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 387 | -| 3071 | [Minimum Operations to Write the Letter Y on a Grid](/solution/3000-3099/3071.Minimum%20Operations%20to%20Write%20the%20Letter%20Y%20on%20a%20Grid/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Matrix` | Medium | Weekly Contest 387 | -| 3072 | [Distribute Elements Into Two Arrays II](/solution/3000-3099/3072.Distribute%20Elements%20Into%20Two%20Arrays%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Simulation` | Hard | Weekly Contest 387 | -| 3073 | [Maximum Increasing Triplet Value](/solution/3000-3099/3073.Maximum%20Increasing%20Triplet%20Value/README_EN.md) | `Array`,`Ordered Set` | Medium | 🔒 | -| 3074 | [Apple Redistribution into Boxes](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 388 | -| 3075 | [Maximize Happiness of Selected Children](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 388 | -| 3076 | [Shortest Uncommon Substring in an Array](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 388 | -| 3077 | [Maximum Strength of K Disjoint Subarrays](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 388 | -| 3078 | [Match Alphanumerical Pattern in Matrix I](/solution/3000-3099/3078.Match%20Alphanumerical%20Pattern%20in%20Matrix%20I/README_EN.md) | `Array`,`Hash Table`,`String`,`Matrix` | Medium | 🔒 | -| 3079 | [Find the Sum of Encrypted Integers](/solution/3000-3099/3079.Find%20the%20Sum%20of%20Encrypted%20Integers/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 126 | -| 3080 | [Mark Elements on Array by Performing Queries](/solution/3000-3099/3080.Mark%20Elements%20on%20Array%20by%20Performing%20Queries/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 126 | -| 3081 | [Replace Question Marks in String to Minimize Its Value](/solution/3000-3099/3081.Replace%20Question%20Marks%20in%20String%20to%20Minimize%20Its%20Value/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 126 | -| 3082 | [Find the Sum of the Power of All Subsequences](/solution/3000-3099/3082.Find%20the%20Sum%20of%20the%20Power%20of%20All%20Subsequences/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 126 | -| 3083 | [Existence of a Substring in a String and Its Reverse](/solution/3000-3099/3083.Existence%20of%20a%20Substring%20in%20a%20String%20and%20Its%20Reverse/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 389 | -| 3084 | [Count Substrings Starting and Ending with Given Character](/solution/3000-3099/3084.Count%20Substrings%20Starting%20and%20Ending%20with%20Given%20Character/README_EN.md) | `Math`,`String`,`Counting` | Medium | Weekly Contest 389 | -| 3085 | [Minimum Deletions to Make String K-Special](/solution/3000-3099/3085.Minimum%20Deletions%20to%20Make%20String%20K-Special/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 389 | -| 3086 | [Minimum Moves to Pick K Ones](/solution/3000-3099/3086.Minimum%20Moves%20to%20Pick%20K%20Ones/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sliding Window` | Hard | Weekly Contest 389 | -| 3087 | [Find Trending Hashtags](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README_EN.md) | `Database` | Medium | 🔒 | -| 3088 | [Make String Anti-palindrome](/solution/3000-3099/3088.Make%20String%20Anti-palindrome/README_EN.md) | `Greedy`,`String`,`Sorting` | Hard | 🔒 | -| 3089 | [Find Bursty Behavior](/solution/3000-3099/3089.Find%20Bursty%20Behavior/README_EN.md) | `Database` | Medium | 🔒 | -| 3090 | [Maximum Length Substring With Two Occurrences](/solution/3000-3099/3090.Maximum%20Length%20Substring%20With%20Two%20Occurrences/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Easy | Weekly Contest 390 | -| 3091 | [Apply Operations to Make Sum of Array Greater Than or Equal to k](/solution/3000-3099/3091.Apply%20Operations%20to%20Make%20Sum%20of%20Array%20Greater%20Than%20or%20Equal%20to%20k/README_EN.md) | `Greedy`,`Math`,`Enumeration` | Medium | Weekly Contest 390 | -| 3092 | [Most Frequent IDs](/solution/3000-3099/3092.Most%20Frequent%20IDs/README_EN.md) | `Array`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 390 | -| 3093 | [Longest Common Suffix Queries](/solution/3000-3099/3093.Longest%20Common%20Suffix%20Queries/README_EN.md) | `Trie`,`Array`,`String` | Hard | Weekly Contest 390 | -| 3094 | [Guess the Number Using Bitwise Questions II](/solution/3000-3099/3094.Guess%20the%20Number%20Using%20Bitwise%20Questions%20II/README_EN.md) | `Bit Manipulation`,`Interactive` | Medium | 🔒 | -| 3095 | [Shortest Subarray With OR at Least K I](/solution/3000-3099/3095.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20I/README_EN.md) | `Bit Manipulation`,`Array`,`Sliding Window` | Easy | Biweekly Contest 127 | -| 3096 | [Minimum Levels to Gain More Points](/solution/3000-3099/3096.Minimum%20Levels%20to%20Gain%20More%20Points/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 127 | -| 3097 | [Shortest Subarray With OR at Least K II](/solution/3000-3099/3097.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Sliding Window` | Medium | Biweekly Contest 127 | -| 3098 | [Find the Sum of Subsequence Powers](/solution/3000-3099/3098.Find%20the%20Sum%20of%20Subsequence%20Powers/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 127 | -| 3099 | [Harshad Number](/solution/3000-3099/3099.Harshad%20Number/README_EN.md) | `Math` | Easy | Weekly Contest 391 | -| 3100 | [Water Bottles II](/solution/3100-3199/3100.Water%20Bottles%20II/README_EN.md) | `Math`,`Simulation` | Medium | Weekly Contest 391 | -| 3101 | [Count Alternating Subarrays](/solution/3100-3199/3101.Count%20Alternating%20Subarrays/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 391 | -| 3102 | [Minimize Manhattan Distances](/solution/3100-3199/3102.Minimize%20Manhattan%20Distances/README_EN.md) | `Geometry`,`Array`,`Math`,`Ordered Set`,`Sorting` | Hard | Weekly Contest 391 | -| 3103 | [Find Trending Hashtags II](/solution/3100-3199/3103.Find%20Trending%20Hashtags%20II/README_EN.md) | `Database` | Hard | 🔒 | -| 3104 | [Find Longest Self-Contained Substring](/solution/3100-3199/3104.Find%20Longest%20Self-Contained%20Substring/README_EN.md) | `Hash Table`,`String`,`Binary Search`,`Prefix Sum` | Hard | 🔒 | -| 3105 | [Longest Strictly Increasing or Strictly Decreasing Subarray](/solution/3100-3199/3105.Longest%20Strictly%20Increasing%20or%20Strictly%20Decreasing%20Subarray/README_EN.md) | `Array` | Easy | Weekly Contest 392 | -| 3106 | [Lexicographically Smallest String After Operations With Constraint](/solution/3100-3199/3106.Lexicographically%20Smallest%20String%20After%20Operations%20With%20Constraint/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 392 | -| 3107 | [Minimum Operations to Make Median of Array Equal to K](/solution/3100-3199/3107.Minimum%20Operations%20to%20Make%20Median%20of%20Array%20Equal%20to%20K/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 392 | -| 3108 | [Minimum Cost Walk in Weighted Graph](/solution/3100-3199/3108.Minimum%20Cost%20Walk%20in%20Weighted%20Graph/README_EN.md) | `Bit Manipulation`,`Union Find`,`Graph`,`Array` | Hard | Weekly Contest 392 | -| 3109 | [Find the Index of Permutation](/solution/3100-3199/3109.Find%20the%20Index%20of%20Permutation/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Medium | 🔒 | -| 3110 | [Score of a String](/solution/3100-3199/3110.Score%20of%20a%20String/README_EN.md) | `String` | Easy | Biweekly Contest 128 | -| 3111 | [Minimum Rectangles to Cover Points](/solution/3100-3199/3111.Minimum%20Rectangles%20to%20Cover%20Points/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 128 | -| 3112 | [Minimum Time to Visit Disappearing Nodes](/solution/3100-3199/3112.Minimum%20Time%20to%20Visit%20Disappearing%20Nodes/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Biweekly Contest 128 | -| 3113 | [Find the Number of Subarrays Where Boundary Elements Are Maximum](/solution/3100-3199/3113.Find%20the%20Number%20of%20Subarrays%20Where%20Boundary%20Elements%20Are%20Maximum/README_EN.md) | `Stack`,`Array`,`Binary Search`,`Monotonic Stack` | Hard | Biweekly Contest 128 | -| 3114 | [Latest Time You Can Obtain After Replacing Characters](/solution/3100-3199/3114.Latest%20Time%20You%20Can%20Obtain%20After%20Replacing%20Characters/README_EN.md) | `String`,`Enumeration` | Easy | Weekly Contest 393 | -| 3115 | [Maximum Prime Difference](/solution/3100-3199/3115.Maximum%20Prime%20Difference/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 393 | -| 3116 | [Kth Smallest Amount With Single Denomination Combination](/solution/3100-3199/3116.Kth%20Smallest%20Amount%20With%20Single%20Denomination%20Combination/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Binary Search`,`Combinatorics`,`Number Theory` | Hard | Weekly Contest 393 | -| 3117 | [Minimum Sum of Values by Dividing Array](/solution/3100-3199/3117.Minimum%20Sum%20of%20Values%20by%20Dividing%20Array/README_EN.md) | `Bit Manipulation`,`Segment Tree`,`Queue`,`Array`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 393 | -| 3118 | [Friday Purchase III](/solution/3100-3199/3118.Friday%20Purchase%20III/README_EN.md) | `Database` | Medium | 🔒 | -| 3119 | [Maximum Number of Potholes That Can Be Fixed](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README_EN.md) | `Greedy`,`String`,`Sorting` | Medium | 🔒 | -| 3120 | [Count the Number of Special Characters I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 394 | -| 3121 | [Count the Number of Special Characters II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README_EN.md) | `Hash Table`,`String` | Medium | Weekly Contest 394 | -| 3122 | [Minimum Number of Operations to Satisfy Conditions](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 394 | -| 3123 | [Find Edges in Shortest Paths](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 394 | -| 3124 | [Find Longest Calls](/solution/3100-3199/3124.Find%20Longest%20Calls/README_EN.md) | `Database` | Medium | 🔒 | -| 3125 | [Maximum Number That Makes Result of Bitwise AND Zero](/solution/3100-3199/3125.Maximum%20Number%20That%20Makes%20Result%20of%20Bitwise%20AND%20Zero/README_EN.md) | `Greedy`,`String`,`Sorting` | Medium | 🔒 | -| 3126 | [Server Utilization Time](/solution/3100-3199/3126.Server%20Utilization%20Time/README_EN.md) | `Database` | Medium | 🔒 | -| 3127 | [Make a Square with the Same Color](/solution/3100-3199/3127.Make%20a%20Square%20with%20the%20Same%20Color/README_EN.md) | `Array`,`Enumeration`,`Matrix` | Easy | Biweekly Contest 129 | -| 3128 | [Right Triangles](/solution/3100-3199/3128.Right%20Triangles/README_EN.md) | `Array`,`Hash Table`,`Math`,`Combinatorics`,`Counting` | Medium | Biweekly Contest 129 | -| 3129 | [Find All Possible Stable Binary Arrays I](/solution/3100-3199/3129.Find%20All%20Possible%20Stable%20Binary%20Arrays%20I/README_EN.md) | `Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 129 | -| 3130 | [Find All Possible Stable Binary Arrays II](/solution/3100-3199/3130.Find%20All%20Possible%20Stable%20Binary%20Arrays%20II/README_EN.md) | `Dynamic Programming`,`Prefix Sum` | Hard | Biweekly Contest 129 | -| 3131 | [Find the Integer Added to Array I](/solution/3100-3199/3131.Find%20the%20Integer%20Added%20to%20Array%20I/README_EN.md) | `Array` | Easy | Weekly Contest 395 | -| 3132 | [Find the Integer Added to Array II](/solution/3100-3199/3132.Find%20the%20Integer%20Added%20to%20Array%20II/README_EN.md) | `Array`,`Two Pointers`,`Enumeration`,`Sorting` | Medium | Weekly Contest 395 | -| 3133 | [Minimum Array End](/solution/3100-3199/3133.Minimum%20Array%20End/README_EN.md) | `Bit Manipulation` | Medium | Weekly Contest 395 | -| 3134 | [Find the Median of the Uniqueness Array](/solution/3100-3199/3134.Find%20the%20Median%20of%20the%20Uniqueness%20Array/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sliding Window` | Hard | Weekly Contest 395 | -| 3135 | [Equalize Strings by Adding or Removing Characters at Ends](/solution/3100-3199/3135.Equalize%20Strings%20by%20Adding%20or%20Removing%20Characters%20at%20Ends/README_EN.md) | `String`,`Binary Search`,`Dynamic Programming`,`Sliding Window`,`Hash Function` | Medium | 🔒 | -| 3136 | [Valid Word](/solution/3100-3199/3136.Valid%20Word/README_EN.md) | `String` | Easy | Weekly Contest 396 | -| 3137 | [Minimum Number of Operations to Make Word K-Periodic](/solution/3100-3199/3137.Minimum%20Number%20of%20Operations%20to%20Make%20Word%20K-Periodic/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 396 | -| 3138 | [Minimum Length of Anagram Concatenation](/solution/3100-3199/3138.Minimum%20Length%20of%20Anagram%20Concatenation/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 396 | -| 3139 | [Minimum Cost to Equalize Array](/solution/3100-3199/3139.Minimum%20Cost%20to%20Equalize%20Array/README_EN.md) | `Greedy`,`Array`,`Enumeration` | Hard | Weekly Contest 396 | -| 3140 | [Consecutive Available Seats II](/solution/3100-3199/3140.Consecutive%20Available%20Seats%20II/README_EN.md) | `Database` | Medium | 🔒 | -| 3141 | [Maximum Hamming Distances](/solution/3100-3199/3141.Maximum%20Hamming%20Distances/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array` | Hard | 🔒 | -| 3142 | [Check if Grid Satisfies Conditions](/solution/3100-3199/3142.Check%20if%20Grid%20Satisfies%20Conditions/README_EN.md) | `Array`,`Matrix` | Easy | Biweekly Contest 130 | -| 3143 | [Maximum Points Inside the Square](/solution/3100-3199/3143.Maximum%20Points%20Inside%20the%20Square/README_EN.md) | `Array`,`Hash Table`,`String`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 130 | -| 3144 | [Minimum Substring Partition of Equal Character Frequency](/solution/3100-3199/3144.Minimum%20Substring%20Partition%20of%20Equal%20Character%20Frequency/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming`,`Counting` | Medium | Biweekly Contest 130 | -| 3145 | [Find Products of Elements of Big Array](/solution/3100-3199/3145.Find%20Products%20of%20Elements%20of%20Big%20Array/README_EN.md) | `Bit Manipulation`,`Array`,`Binary Search` | Hard | Biweekly Contest 130 | -| 3146 | [Permutation Difference between Two Strings](/solution/3100-3199/3146.Permutation%20Difference%20between%20Two%20Strings/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 397 | -| 3147 | [Taking Maximum Energy From the Mystic Dungeon](/solution/3100-3199/3147.Taking%20Maximum%20Energy%20From%20the%20Mystic%20Dungeon/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 397 | -| 3148 | [Maximum Difference Score in a Grid](/solution/3100-3199/3148.Maximum%20Difference%20Score%20in%20a%20Grid/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 397 | -| 3149 | [Find the Minimum Cost Array Permutation](/solution/3100-3199/3149.Find%20the%20Minimum%20Cost%20Array%20Permutation/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 397 | -| 3150 | [Invalid Tweets II](/solution/3100-3199/3150.Invalid%20Tweets%20II/README_EN.md) | `Database` | Easy | 🔒 | -| 3151 | [Special Array I](/solution/3100-3199/3151.Special%20Array%20I/README_EN.md) | `Array` | Easy | Weekly Contest 398 | -| 3152 | [Special Array II](/solution/3100-3199/3152.Special%20Array%20II/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum` | Medium | Weekly Contest 398 | -| 3153 | [Sum of Digit Differences of All Pairs](/solution/3100-3199/3153.Sum%20of%20Digit%20Differences%20of%20All%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting` | Medium | Weekly Contest 398 | -| 3154 | [Find Number of Ways to Reach the K-th Stair](/solution/3100-3199/3154.Find%20Number%20of%20Ways%20to%20Reach%20the%20K-th%20Stair/README_EN.md) | `Bit Manipulation`,`Memoization`,`Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 398 | -| 3155 | [Maximum Number of Upgradable Servers](/solution/3100-3199/3155.Maximum%20Number%20of%20Upgradable%20Servers/README_EN.md) | `Array`,`Math`,`Binary Search` | Medium | 🔒 | -| 3156 | [Employee Task Duration and Concurrent Tasks](/solution/3100-3199/3156.Employee%20Task%20Duration%20and%20Concurrent%20Tasks/README_EN.md) | `Database` | Hard | 🔒 | -| 3157 | [Find the Level of Tree with Minimum Sum](/solution/3100-3199/3157.Find%20the%20Level%20of%20Tree%20with%20Minimum%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | -| 3158 | [Find the XOR of Numbers Which Appear Twice](/solution/3100-3199/3158.Find%20the%20XOR%20of%20Numbers%20Which%20Appear%20Twice/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Easy | Biweekly Contest 131 | -| 3159 | [Find Occurrences of an Element in an Array](/solution/3100-3199/3159.Find%20Occurrences%20of%20an%20Element%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Medium | Biweekly Contest 131 | -| 3160 | [Find the Number of Distinct Colors Among the Balls](/solution/3100-3199/3160.Find%20the%20Number%20of%20Distinct%20Colors%20Among%20the%20Balls/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Biweekly Contest 131 | -| 3161 | [Block Placement Queries](/solution/3100-3199/3161.Block%20Placement%20Queries/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search` | Hard | Biweekly Contest 131 | -| 3162 | [Find the Number of Good Pairs I](/solution/3100-3199/3162.Find%20the%20Number%20of%20Good%20Pairs%20I/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 399 | -| 3163 | [String Compression III](/solution/3100-3199/3163.String%20Compression%20III/README_EN.md) | `String` | Medium | Weekly Contest 399 | -| 3164 | [Find the Number of Good Pairs II](/solution/3100-3199/3164.Find%20the%20Number%20of%20Good%20Pairs%20II/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 399 | -| 3165 | [Maximum Sum of Subsequence With Non-adjacent Elements](/solution/3100-3199/3165.Maximum%20Sum%20of%20Subsequence%20With%20Non-adjacent%20Elements/README_EN.md) | `Segment Tree`,`Array`,`Divide and Conquer`,`Dynamic Programming` | Hard | Weekly Contest 399 | -| 3166 | [Calculate Parking Fees and Duration](/solution/3100-3199/3166.Calculate%20Parking%20Fees%20and%20Duration/README_EN.md) | `Database` | Medium | 🔒 | -| 3167 | [Better Compression of String](/solution/3100-3199/3167.Better%20Compression%20of%20String/README_EN.md) | `Hash Table`,`String`,`Counting`,`Sorting` | Medium | 🔒 | -| 3168 | [Minimum Number of Chairs in a Waiting Room](/solution/3100-3199/3168.Minimum%20Number%20of%20Chairs%20in%20a%20Waiting%20Room/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 400 | -| 3169 | [Count Days Without Meetings](/solution/3100-3199/3169.Count%20Days%20Without%20Meetings/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 400 | -| 3170 | [Lexicographically Minimum String After Removing Stars](/solution/3100-3199/3170.Lexicographically%20Minimum%20String%20After%20Removing%20Stars/README_EN.md) | `Stack`,`Greedy`,`Hash Table`,`String`,`Heap (Priority Queue)` | Medium | Weekly Contest 400 | -| 3171 | [Find Subarray With Bitwise OR Closest to K](/solution/3100-3199/3171.Find%20Subarray%20With%20Bitwise%20OR%20Closest%20to%20K/README_EN.md) | `Bit Manipulation`,`Segment Tree`,`Array`,`Binary Search` | Hard | Weekly Contest 400 | -| 3172 | [Second Day Verification](/solution/3100-3199/3172.Second%20Day%20Verification/README_EN.md) | `Database` | Easy | 🔒 | -| 3173 | [Bitwise OR of Adjacent Elements](/solution/3100-3199/3173.Bitwise%20OR%20of%20Adjacent%20Elements/README_EN.md) | `Bit Manipulation`,`Array` | Easy | 🔒 | -| 3174 | [Clear Digits](/solution/3100-3199/3174.Clear%20Digits/README_EN.md) | `Hash Table`,`String`,`Simulation` | Easy | Biweekly Contest 132 | -| 3175 | [Find The First Player to win K Games in a Row](/solution/3100-3199/3175.Find%20The%20First%20Player%20to%20win%20K%20Games%20in%20a%20Row/README_EN.md) | `Array`,`Simulation` | Medium | Biweekly Contest 132 | -| 3176 | [Find the Maximum Length of a Good Subsequence I](/solution/3100-3199/3176.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20I/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Medium | Biweekly Contest 132 | -| 3177 | [Find the Maximum Length of a Good Subsequence II](/solution/3100-3199/3177.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20II/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Hard | Biweekly Contest 132 | -| 3178 | [Find the Child Who Has the Ball After K Seconds](/solution/3100-3199/3178.Find%20the%20Child%20Who%20Has%20the%20Ball%20After%20K%20Seconds/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 401 | -| 3179 | [Find the N-th Value After K Seconds](/solution/3100-3199/3179.Find%20the%20N-th%20Value%20After%20K%20Seconds/README_EN.md) | `Array`,`Math`,`Combinatorics`,`Prefix Sum`,`Simulation` | Medium | Weekly Contest 401 | -| 3180 | [Maximum Total Reward Using Operations I](/solution/3100-3199/3180.Maximum%20Total%20Reward%20Using%20Operations%20I/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 401 | -| 3181 | [Maximum Total Reward Using Operations II](/solution/3100-3199/3181.Maximum%20Total%20Reward%20Using%20Operations%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 401 | -| 3182 | [Find Top Scoring Students](/solution/3100-3199/3182.Find%20Top%20Scoring%20Students/README_EN.md) | `Database` | Medium | 🔒 | -| 3183 | [The Number of Ways to Make the Sum](/solution/3100-3199/3183.The%20Number%20of%20Ways%20to%20Make%20the%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | -| 3184 | [Count Pairs That Form a Complete Day I](/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 402 | -| 3185 | [Count Pairs That Form a Complete Day II](/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 402 | -| 3186 | [Maximum Total Damage With Spell Casting](/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Dynamic Programming`,`Counting`,`Sorting` | Medium | Weekly Contest 402 | -| 3187 | [Peaks in Array](/solution/3100-3199/3187.Peaks%20in%20Array/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array` | Hard | Weekly Contest 402 | -| 3188 | [Find Top Scoring Students II](/solution/3100-3199/3188.Find%20Top%20Scoring%20Students%20II/README_EN.md) | | Hard | 🔒 | -| 3189 | [Minimum Moves to Get a Peaceful Board](/solution/3100-3199/3189.Minimum%20Moves%20to%20Get%20a%20Peaceful%20Board/README_EN.md) | | Medium | 🔒 | - -## Copyright - -The copyright of this project belongs to [Doocs](https://github.com/doocs) community. For commercial reprints, please contact [@yanglbme](mailto:contact@yanglibin.info) for authorization. For non-commercial reprints, please indicate the source. - -## Contact Us - -We welcome everyone to add @yanglbme's personal WeChat (WeChat ID: YLB0109), with the note "leetcode". In the future, we will create algorithm and technology related discussion groups, where we can learn and share experiences together, and make progress together. - -| | -| --------------------------------------------------------------------------------------------------------------------------------- | - -## License - -This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. +# LeetCode + +[中文文档](/solution/README.md) + +## Solutions + +Press Control + F(or Command + F on the Mac) to search anything you want. + +| # | Solution | Tags | Difficulty | Remark | +| ---- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------------------------------------- | ---------- | -------------------- | +| 0001 | [Two Sum](/solution/0000-0099/0001.Two%20Sum/README_EN.md) | `Array`,`Hash Table` | Easy | | +| 0002 | [Add Two Numbers](/solution/0000-0099/0002.Add%20Two%20Numbers/README_EN.md) | `Recursion`,`Linked List`,`Math` | Medium | | +| 0003 | [Longest Substring Without Repeating Characters](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | | +| 0004 | [Median of Two Sorted Arrays](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README_EN.md) | `Array`,`Binary Search`,`Divide and Conquer` | Hard | | +| 0005 | [Longest Palindromic Substring](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Medium | | +| 0006 | [Zigzag Conversion](/solution/0000-0099/0006.Zigzag%20Conversion/README_EN.md) | `String` | Medium | | +| 0007 | [Reverse Integer](/solution/0000-0099/0007.Reverse%20Integer/README_EN.md) | `Math` | Medium | | +| 0008 | [String to Integer (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README_EN.md) | `String` | Medium | | +| 0009 | [Palindrome Number](/solution/0000-0099/0009.Palindrome%20Number/README_EN.md) | `Math` | Easy | | +| 0010 | [Regular Expression Matching](/solution/0000-0099/0010.Regular%20Expression%20Matching/README_EN.md) | `Recursion`,`String`,`Dynamic Programming` | Hard | | +| 0011 | [Container With Most Water](/solution/0000-0099/0011.Container%20With%20Most%20Water/README_EN.md) | `Greedy`,`Array`,`Two Pointers` | Medium | | +| 0012 | [Integer to Roman](/solution/0000-0099/0012.Integer%20to%20Roman/README_EN.md) | `Hash Table`,`Math`,`String` | Medium | | +| 0013 | [Roman to Integer](/solution/0000-0099/0013.Roman%20to%20Integer/README_EN.md) | `Hash Table`,`Math`,`String` | Easy | | +| 0014 | [Longest Common Prefix](/solution/0000-0099/0014.Longest%20Common%20Prefix/README_EN.md) | `Trie`,`String` | Easy | | +| 0015 | [3Sum](/solution/0000-0099/0015.3Sum/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | | +| 0016 | [3Sum Closest](/solution/0000-0099/0016.3Sum%20Closest/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | | +| 0017 | [Letter Combinations of a Phone Number](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README_EN.md) | `Hash Table`,`String`,`Backtracking` | Medium | | +| 0018 | [4Sum](/solution/0000-0099/0018.4Sum/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | | +| 0019 | [Remove Nth Node From End of List](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | | +| 0020 | [Valid Parentheses](/solution/0000-0099/0020.Valid%20Parentheses/README_EN.md) | `Stack`,`String` | Easy | | +| 0021 | [Merge Two Sorted Lists](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README_EN.md) | `Recursion`,`Linked List` | Easy | | +| 0022 | [Generate Parentheses](/solution/0000-0099/0022.Generate%20Parentheses/README_EN.md) | `String`,`Dynamic Programming`,`Backtracking` | Medium | | +| 0023 | [Merge k Sorted Lists](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README_EN.md) | `Linked List`,`Divide and Conquer`,`Heap (Priority Queue)`,`Merge Sort` | Hard | | +| 0024 | [Swap Nodes in Pairs](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README_EN.md) | `Recursion`,`Linked List` | Medium | | +| 0025 | [Reverse Nodes in k-Group](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README_EN.md) | `Recursion`,`Linked List` | Hard | | +| 0026 | [Remove Duplicates from Sorted Array](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README_EN.md) | `Array`,`Two Pointers` | Easy | | +| 0027 | [Remove Element](/solution/0000-0099/0027.Remove%20Element/README_EN.md) | `Array`,`Two Pointers` | Easy | | +| 0028 | [Find the Index of the First Occurrence in a String](/solution/0000-0099/0028.Find%20the%20Index%20of%20the%20First%20Occurrence%20in%20a%20String/README_EN.md) | `Two Pointers`,`String`,`String Matching` | Easy | | +| 0029 | [Divide Two Integers](/solution/0000-0099/0029.Divide%20Two%20Integers/README_EN.md) | `Bit Manipulation`,`Math` | Medium | | +| 0030 | [Substring with Concatenation of All Words](/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | | +| 0031 | [Next Permutation](/solution/0000-0099/0031.Next%20Permutation/README_EN.md) | `Array`,`Two Pointers` | Medium | | +| 0032 | [Longest Valid Parentheses](/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README_EN.md) | `Stack`,`String`,`Dynamic Programming` | Hard | | +| 0033 | [Search in Rotated Sorted Array](/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | | +| 0034 | [Find First and Last Position of Element in Sorted Array](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | | +| 0035 | [Search Insert Position](/solution/0000-0099/0035.Search%20Insert%20Position/README_EN.md) | `Array`,`Binary Search` | Easy | | +| 0036 | [Valid Sudoku](/solution/0000-0099/0036.Valid%20Sudoku/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | | +| 0037 | [Sudoku Solver](/solution/0000-0099/0037.Sudoku%20Solver/README_EN.md) | `Array`,`Hash Table`,`Backtracking`,`Matrix` | Hard | | +| 0038 | [Count and Say](/solution/0000-0099/0038.Count%20and%20Say/README_EN.md) | `String` | Medium | | +| 0039 | [Combination Sum](/solution/0000-0099/0039.Combination%20Sum/README_EN.md) | `Array`,`Backtracking` | Medium | | +| 0040 | [Combination Sum II](/solution/0000-0099/0040.Combination%20Sum%20II/README_EN.md) | `Array`,`Backtracking` | Medium | | +| 0041 | [First Missing Positive](/solution/0000-0099/0041.First%20Missing%20Positive/README_EN.md) | `Array`,`Hash Table` | Hard | | +| 0042 | [Trapping Rain Water](/solution/0000-0099/0042.Trapping%20Rain%20Water/README_EN.md) | `Stack`,`Array`,`Two Pointers`,`Dynamic Programming`,`Monotonic Stack` | Hard | | +| 0043 | [Multiply Strings](/solution/0000-0099/0043.Multiply%20Strings/README_EN.md) | `Math`,`String`,`Simulation` | Medium | | +| 0044 | [Wildcard Matching](/solution/0000-0099/0044.Wildcard%20Matching/README_EN.md) | `Greedy`,`Recursion`,`String`,`Dynamic Programming` | Hard | | +| 0045 | [Jump Game II](/solution/0000-0099/0045.Jump%20Game%20II/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | | +| 0046 | [Permutations](/solution/0000-0099/0046.Permutations/README_EN.md) | `Array`,`Backtracking` | Medium | | +| 0047 | [Permutations II](/solution/0000-0099/0047.Permutations%20II/README_EN.md) | `Array`,`Backtracking` | Medium | | +| 0048 | [Rotate Image](/solution/0000-0099/0048.Rotate%20Image/README_EN.md) | `Array`,`Math`,`Matrix` | Medium | | +| 0049 | [Group Anagrams](/solution/0000-0099/0049.Group%20Anagrams/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | | +| 0050 | [Pow(x, n)](/solution/0000-0099/0050.Pow%28x%2C%20n%29/README_EN.md) | `Recursion`,`Math` | Medium | | +| 0051 | [N-Queens](/solution/0000-0099/0051.N-Queens/README_EN.md) | `Array`,`Backtracking` | Hard | | +| 0052 | [N-Queens II](/solution/0000-0099/0052.N-Queens%20II/README_EN.md) | `Backtracking` | Hard | | +| 0053 | [Maximum Subarray](/solution/0000-0099/0053.Maximum%20Subarray/README_EN.md) | `Array`,`Divide and Conquer`,`Dynamic Programming` | Medium | | +| 0054 | [Spiral Matrix](/solution/0000-0099/0054.Spiral%20Matrix/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | | +| 0055 | [Jump Game](/solution/0000-0099/0055.Jump%20Game/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | | +| 0056 | [Merge Intervals](/solution/0000-0099/0056.Merge%20Intervals/README_EN.md) | `Array`,`Sorting` | Medium | | +| 0057 | [Insert Interval](/solution/0000-0099/0057.Insert%20Interval/README_EN.md) | `Array` | Medium | | +| 0058 | [Length of Last Word](/solution/0000-0099/0058.Length%20of%20Last%20Word/README_EN.md) | `String` | Easy | | +| 0059 | [Spiral Matrix II](/solution/0000-0099/0059.Spiral%20Matrix%20II/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | | +| 0060 | [Permutation Sequence](/solution/0000-0099/0060.Permutation%20Sequence/README_EN.md) | `Recursion`,`Math` | Hard | | +| 0061 | [Rotate List](/solution/0000-0099/0061.Rotate%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | | +| 0062 | [Unique Paths](/solution/0000-0099/0062.Unique%20Paths/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | | +| 0063 | [Unique Paths II](/solution/0000-0099/0063.Unique%20Paths%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | | +| 0064 | [Minimum Path Sum](/solution/0000-0099/0064.Minimum%20Path%20Sum/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | | +| 0065 | [Valid Number](/solution/0000-0099/0065.Valid%20Number/README_EN.md) | `String` | Hard | | +| 0066 | [Plus One](/solution/0000-0099/0066.Plus%20One/README_EN.md) | `Array`,`Math` | Easy | | +| 0067 | [Add Binary](/solution/0000-0099/0067.Add%20Binary/README_EN.md) | `Bit Manipulation`,`Math`,`String`,`Simulation` | Easy | | +| 0068 | [Text Justification](/solution/0000-0099/0068.Text%20Justification/README_EN.md) | `Array`,`String`,`Simulation` | Hard | | +| 0069 | [Sqrt(x)](/solution/0000-0099/0069.Sqrt%28x%29/README_EN.md) | `Math`,`Binary Search` | Easy | | +| 0070 | [Climbing Stairs](/solution/0000-0099/0070.Climbing%20Stairs/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming` | Easy | | +| 0071 | [Simplify Path](/solution/0000-0099/0071.Simplify%20Path/README_EN.md) | `Stack`,`String` | Medium | | +| 0072 | [Edit Distance](/solution/0000-0099/0072.Edit%20Distance/README_EN.md) | `String`,`Dynamic Programming` | Medium | | +| 0073 | [Set Matrix Zeroes](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | | +| 0074 | [Search a 2D Matrix](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | | +| 0075 | [Sort Colors](/solution/0000-0099/0075.Sort%20Colors/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | | +| 0076 | [Minimum Window Substring](/solution/0000-0099/0076.Minimum%20Window%20Substring/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | | +| 0077 | [Combinations](/solution/0000-0099/0077.Combinations/README_EN.md) | `Backtracking` | Medium | | +| 0078 | [Subsets](/solution/0000-0099/0078.Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking` | Medium | | +| 0079 | [Word Search](/solution/0000-0099/0079.Word%20Search/README_EN.md) | `Array`,`String`,`Backtracking`,`Matrix` | Medium | | +| 0080 | [Remove Duplicates from Sorted Array II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README_EN.md) | `Array`,`Two Pointers` | Medium | | +| 0081 | [Search in Rotated Sorted Array II](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README_EN.md) | `Array`,`Binary Search` | Medium | | +| 0082 | [Remove Duplicates from Sorted List II](/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README_EN.md) | `Linked List`,`Two Pointers` | Medium | | +| 0083 | [Remove Duplicates from Sorted List](/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README_EN.md) | `Linked List` | Easy | | +| 0084 | [Largest Rectangle in Histogram](/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Hard | | +| 0085 | [Maximal Rectangle](/solution/0000-0099/0085.Maximal%20Rectangle/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Matrix`,`Monotonic Stack` | Hard | | +| 0086 | [Partition List](/solution/0000-0099/0086.Partition%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | | +| 0087 | [Scramble String](/solution/0000-0099/0087.Scramble%20String/README_EN.md) | `String`,`Dynamic Programming` | Hard | | +| 0088 | [Merge Sorted Array](/solution/0000-0099/0088.Merge%20Sorted%20Array/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | | +| 0089 | [Gray Code](/solution/0000-0099/0089.Gray%20Code/README_EN.md) | `Bit Manipulation`,`Math`,`Backtracking` | Medium | | +| 0090 | [Subsets II](/solution/0000-0099/0090.Subsets%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking` | Medium | | +| 0091 | [Decode Ways](/solution/0000-0099/0091.Decode%20Ways/README_EN.md) | `String`,`Dynamic Programming` | Medium | | +| 0092 | [Reverse Linked List II](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README_EN.md) | `Linked List` | Medium | | +| 0093 | [Restore IP Addresses](/solution/0000-0099/0093.Restore%20IP%20Addresses/README_EN.md) | `String`,`Backtracking` | Medium | | +| 0094 | [Binary Tree Inorder Traversal](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Easy | | +| 0095 | [Unique Binary Search Trees II](/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README_EN.md) | `Tree`,`Binary Search Tree`,`Dynamic Programming`,`Backtracking`,`Binary Tree` | Medium | | +| 0096 | [Unique Binary Search Trees](/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README_EN.md) | `Tree`,`Binary Search Tree`,`Math`,`Dynamic Programming`,`Binary Tree` | Medium | | +| 0097 | [Interleaving String](/solution/0000-0099/0097.Interleaving%20String/README_EN.md) | `String`,`Dynamic Programming` | Medium | | +| 0098 | [Validate Binary Search Tree](/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | +| 0099 | [Recover Binary Search Tree](/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | +| 0100 | [Same Tree](/solution/0100-0199/0100.Same%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | +| 0101 | [Symmetric Tree](/solution/0100-0199/0101.Symmetric%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | +| 0102 | [Binary Tree Level Order Traversal](/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | | +| 0103 | [Binary Tree Zigzag Level Order Traversal](/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | | +| 0104 | [Maximum Depth of Binary Tree](/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | +| 0105 | [Construct Binary Tree from Preorder and Inorder Traversal](/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README_EN.md) | `Tree`,`Array`,`Hash Table`,`Divide and Conquer`,`Binary Tree` | Medium | | +| 0106 | [Construct Binary Tree from Inorder and Postorder Traversal](/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README_EN.md) | `Tree`,`Array`,`Hash Table`,`Divide and Conquer`,`Binary Tree` | Medium | | +| 0107 | [Binary Tree Level Order Traversal II](/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | | +| 0108 | [Convert Sorted Array to Binary Search Tree](/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Binary Search Tree`,`Array`,`Divide and Conquer`,`Binary Tree` | Easy | | +| 0109 | [Convert Sorted List to Binary Search Tree](/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Binary Search Tree`,`Linked List`,`Divide and Conquer`,`Binary Tree` | Medium | | +| 0110 | [Balanced Binary Tree](/solution/0100-0199/0110.Balanced%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | | +| 0111 | [Minimum Depth of Binary Tree](/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | +| 0112 | [Path Sum](/solution/0100-0199/0112.Path%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | +| 0113 | [Path Sum II](/solution/0100-0199/0113.Path%20Sum%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Backtracking`,`Binary Tree` | Medium | | +| 0114 | [Flatten Binary Tree to Linked List](/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Linked List`,`Binary Tree` | Medium | | +| 0115 | [Distinct Subsequences](/solution/0100-0199/0115.Distinct%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | | +| 0116 | [Populating Next Right Pointers in Each Node](/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Linked List`,`Binary Tree` | Medium | | +| 0117 | [Populating Next Right Pointers in Each Node II](/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Linked List`,`Binary Tree` | Medium | | +| 0118 | [Pascal's Triangle](/solution/0100-0199/0118.Pascal%27s%20Triangle/README_EN.md) | `Array`,`Dynamic Programming` | Easy | | +| 0119 | [Pascal's Triangle II](/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README_EN.md) | `Array`,`Dynamic Programming` | Easy | | +| 0120 | [Triangle](/solution/0100-0199/0120.Triangle/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | +| 0121 | [Best Time to Buy and Sell Stock](/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README_EN.md) | `Array`,`Dynamic Programming` | Easy | | +| 0122 | [Best Time to Buy and Sell Stock II](/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | | +| 0123 | [Best Time to Buy and Sell Stock III](/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | +| 0124 | [Binary Tree Maximum Path Sum](/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Hard | | +| 0125 | [Valid Palindrome](/solution/0100-0199/0125.Valid%20Palindrome/README_EN.md) | `Two Pointers`,`String` | Easy | | +| 0126 | [Word Ladder II](/solution/0100-0199/0126.Word%20Ladder%20II/README_EN.md) | `Breadth-First Search`,`Hash Table`,`String`,`Backtracking` | Hard | | +| 0127 | [Word Ladder](/solution/0100-0199/0127.Word%20Ladder/README_EN.md) | `Breadth-First Search`,`Hash Table`,`String` | Hard | | +| 0128 | [Longest Consecutive Sequence](/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README_EN.md) | `Union Find`,`Array`,`Hash Table` | Medium | | +| 0129 | [Sum Root to Leaf Numbers](/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | | +| 0130 | [Surrounded Regions](/solution/0100-0199/0130.Surrounded%20Regions/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | | +| 0131 | [Palindrome Partitioning](/solution/0100-0199/0131.Palindrome%20Partitioning/README_EN.md) | `String`,`Dynamic Programming`,`Backtracking` | Medium | | +| 0132 | [Palindrome Partitioning II](/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | | +| 0133 | [Clone Graph](/solution/0100-0199/0133.Clone%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Hash Table` | Medium | | +| 0134 | [Gas Station](/solution/0100-0199/0134.Gas%20Station/README_EN.md) | `Greedy`,`Array` | Medium | | +| 0135 | [Candy](/solution/0100-0199/0135.Candy/README_EN.md) | `Greedy`,`Array` | Hard | | +| 0136 | [Single Number](/solution/0100-0199/0136.Single%20Number/README_EN.md) | `Bit Manipulation`,`Array` | Easy | | +| 0137 | [Single Number II](/solution/0100-0199/0137.Single%20Number%20II/README_EN.md) | `Bit Manipulation`,`Array` | Medium | | +| 0138 | [Copy List with Random Pointer](/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README_EN.md) | `Hash Table`,`Linked List` | Medium | | +| 0139 | [Word Break](/solution/0100-0199/0139.Word%20Break/README_EN.md) | `Trie`,`Memoization`,`Array`,`Hash Table`,`String`,`Dynamic Programming` | Medium | | +| 0140 | [Word Break II](/solution/0100-0199/0140.Word%20Break%20II/README_EN.md) | `Trie`,`Memoization`,`Array`,`Hash Table`,`String`,`Dynamic Programming`,`Backtracking` | Hard | | +| 0141 | [Linked List Cycle](/solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md) | `Hash Table`,`Linked List`,`Two Pointers` | Easy | | +| 0142 | [Linked List Cycle II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md) | `Hash Table`,`Linked List`,`Two Pointers` | Medium | | +| 0143 | [Reorder List](/solution/0100-0199/0143.Reorder%20List/README_EN.md) | `Stack`,`Recursion`,`Linked List`,`Two Pointers` | Medium | | +| 0144 | [Binary Tree Preorder Traversal](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Easy | | +| 0145 | [Binary Tree Postorder Traversal](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Easy | | +| 0146 | [LRU Cache](/solution/0100-0199/0146.LRU%20Cache/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List` | Medium | | +| 0147 | [Insertion Sort List](/solution/0100-0199/0147.Insertion%20Sort%20List/README_EN.md) | `Linked List`,`Sorting` | Medium | | +| 0148 | [Sort List](/solution/0100-0199/0148.Sort%20List/README_EN.md) | `Linked List`,`Two Pointers`,`Divide and Conquer`,`Sorting`,`Merge Sort` | Medium | | +| 0149 | [Max Points on a Line](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README_EN.md) | `Geometry`,`Array`,`Hash Table`,`Math` | Hard | | +| 0150 | [Evaluate Reverse Polish Notation](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README_EN.md) | `Stack`,`Array`,`Math` | Medium | | +| 0151 | [Reverse Words in a String](/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README_EN.md) | `Two Pointers`,`String` | Medium | | +| 0152 | [Maximum Product Subarray](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | +| 0153 | [Find Minimum in Rotated Sorted Array](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | | +| 0154 | [Find Minimum in Rotated Sorted Array II](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README_EN.md) | `Array`,`Binary Search` | Hard | | +| 0155 | [Min Stack](/solution/0100-0199/0155.Min%20Stack/README_EN.md) | `Stack`,`Design` | Medium | | +| 0156 | [Binary Tree Upside Down](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | +| 0157 | [Read N Characters Given Read4](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README_EN.md) | `Array`,`Interactive`,`Simulation` | Easy | 🔒 | +| 0158 | [Read N Characters Given read4 II - Call Multiple Times](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20read4%20II%20-%20Call%20Multiple%20Times/README_EN.md) | `Array`,`Interactive`,`Simulation` | Hard | 🔒 | +| 0159 | [Longest Substring with At Most Two Distinct Characters](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | 🔒 | +| 0160 | [Intersection of Two Linked Lists](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README_EN.md) | `Hash Table`,`Linked List`,`Two Pointers` | Easy | | +| 0161 | [One Edit Distance](/solution/0100-0199/0161.One%20Edit%20Distance/README_EN.md) | `Two Pointers`,`String` | Medium | 🔒 | +| 0162 | [Find Peak Element](/solution/0100-0199/0162.Find%20Peak%20Element/README_EN.md) | `Array`,`Binary Search` | Medium | | +| 0163 | [Missing Ranges](/solution/0100-0199/0163.Missing%20Ranges/README_EN.md) | `Array` | Easy | 🔒 | +| 0164 | [Maximum Gap](/solution/0100-0199/0164.Maximum%20Gap/README_EN.md) | `Array`,`Bucket Sort`,`Radix Sort`,`Sorting` | Medium | | +| 0165 | [Compare Version Numbers](/solution/0100-0199/0165.Compare%20Version%20Numbers/README_EN.md) | `Two Pointers`,`String` | Medium | | +| 0166 | [Fraction to Recurring Decimal](/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README_EN.md) | `Hash Table`,`Math`,`String` | Medium | | +| 0167 | [Two Sum II - Input Array Is Sorted](/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted/README_EN.md) | `Array`,`Two Pointers`,`Binary Search` | Medium | | +| 0168 | [Excel Sheet Column Title](/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README_EN.md) | `Math`,`String` | Easy | | +| 0169 | [Majority Element](/solution/0100-0199/0169.Majority%20Element/README_EN.md) | `Array`,`Hash Table`,`Divide and Conquer`,`Counting`,`Sorting` | Easy | | +| 0170 | [Two Sum III - Data structure design](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README_EN.md) | `Design`,`Array`,`Hash Table`,`Two Pointers`,`Data Stream` | Easy | 🔒 | +| 0171 | [Excel Sheet Column Number](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README_EN.md) | `Math`,`String` | Easy | | +| 0172 | [Factorial Trailing Zeroes](/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README_EN.md) | `Math` | Medium | | +| 0173 | [Binary Search Tree Iterator](/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README_EN.md) | `Stack`,`Tree`,`Design`,`Binary Search Tree`,`Binary Tree`,`Iterator` | Medium | | +| 0174 | [Dungeon Game](/solution/0100-0199/0174.Dungeon%20Game/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | | +| 0175 | [Combine Two Tables](/solution/0100-0199/0175.Combine%20Two%20Tables/README_EN.md) | `Database` | Easy | | +| 0176 | [Second Highest Salary](/solution/0100-0199/0176.Second%20Highest%20Salary/README_EN.md) | `Database` | Medium | | +| 0177 | [Nth Highest Salary](/solution/0100-0199/0177.Nth%20Highest%20Salary/README_EN.md) | `Database` | Medium | | +| 0178 | [Rank Scores](/solution/0100-0199/0178.Rank%20Scores/README_EN.md) | `Database` | Medium | | +| 0179 | [Largest Number](/solution/0100-0199/0179.Largest%20Number/README_EN.md) | `Greedy`,`Array`,`String`,`Sorting` | Medium | | +| 0180 | [Consecutive Numbers](/solution/0100-0199/0180.Consecutive%20Numbers/README_EN.md) | `Database` | Medium | | +| 0181 | [Employees Earning More Than Their Managers](/solution/0100-0199/0181.Employees%20Earning%20More%20Than%20Their%20Managers/README_EN.md) | `Database` | Easy | | +| 0182 | [Duplicate Emails](/solution/0100-0199/0182.Duplicate%20Emails/README_EN.md) | `Database` | Easy | | +| 0183 | [Customers Who Never Order](/solution/0100-0199/0183.Customers%20Who%20Never%20Order/README_EN.md) | `Database` | Easy | | +| 0184 | [Department Highest Salary](/solution/0100-0199/0184.Department%20Highest%20Salary/README_EN.md) | `Database` | Medium | | +| 0185 | [Department Top Three Salaries](/solution/0100-0199/0185.Department%20Top%20Three%20Salaries/README_EN.md) | `Database` | Hard | | +| 0186 | [Reverse Words in a String II](/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README_EN.md) | `Two Pointers`,`String` | Medium | 🔒 | +| 0187 | [Repeated DNA Sequences](/solution/0100-0199/0187.Repeated%20DNA%20Sequences/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Medium | | +| 0188 | [Best Time to Buy and Sell Stock IV](/solution/0100-0199/0188.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | +| 0189 | [Rotate Array](/solution/0100-0199/0189.Rotate%20Array/README_EN.md) | `Array`,`Math`,`Two Pointers` | Medium | | +| 0190 | [Reverse Bits](/solution/0100-0199/0190.Reverse%20Bits/README_EN.md) | `Bit Manipulation`,`Divide and Conquer` | Easy | | +| 0191 | [Number of 1 Bits](/solution/0100-0199/0191.Number%20of%201%20Bits/README_EN.md) | `Bit Manipulation`,`Divide and Conquer` | Easy | | +| 0192 | [Word Frequency](/solution/0100-0199/0192.Word%20Frequency/README_EN.md) | `Shell` | Medium | | +| 0193 | [Valid Phone Numbers](/solution/0100-0199/0193.Valid%20Phone%20Numbers/README_EN.md) | `Shell` | Easy | | +| 0194 | [Transpose File](/solution/0100-0199/0194.Transpose%20File/README_EN.md) | `Shell` | Medium | | +| 0195 | [Tenth Line](/solution/0100-0199/0195.Tenth%20Line/README_EN.md) | `Shell` | Easy | | +| 0196 | [Delete Duplicate Emails](/solution/0100-0199/0196.Delete%20Duplicate%20Emails/README_EN.md) | `Database` | Easy | | +| 0197 | [Rising Temperature](/solution/0100-0199/0197.Rising%20Temperature/README_EN.md) | `Database` | Easy | | +| 0198 | [House Robber](/solution/0100-0199/0198.House%20Robber/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | +| 0199 | [Binary Tree Right Side View](/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | +| 0200 | [Number of Islands](/solution/0200-0299/0200.Number%20of%20Islands/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | | +| 0201 | [Bitwise AND of Numbers Range](/solution/0200-0299/0201.Bitwise%20AND%20of%20Numbers%20Range/README_EN.md) | `Bit Manipulation` | Medium | | +| 0202 | [Happy Number](/solution/0200-0299/0202.Happy%20Number/README_EN.md) | `Hash Table`,`Math`,`Two Pointers` | Easy | | +| 0203 | [Remove Linked List Elements](/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README_EN.md) | `Recursion`,`Linked List` | Easy | | +| 0204 | [Count Primes](/solution/0200-0299/0204.Count%20Primes/README_EN.md) | `Array`,`Math`,`Enumeration`,`Number Theory` | Medium | | +| 0205 | [Isomorphic Strings](/solution/0200-0299/0205.Isomorphic%20Strings/README_EN.md) | `Hash Table`,`String` | Easy | | +| 0206 | [Reverse Linked List](/solution/0200-0299/0206.Reverse%20Linked%20List/README_EN.md) | `Recursion`,`Linked List` | Easy | | +| 0207 | [Course Schedule](/solution/0200-0299/0207.Course%20Schedule/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | | +| 0208 | [Implement Trie (Prefix Tree)](/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | | +| 0209 | [Minimum Size Subarray Sum](/solution/0200-0299/0209.Minimum%20Size%20Subarray%20Sum/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | | +| 0210 | [Course Schedule II](/solution/0200-0299/0210.Course%20Schedule%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | | +| 0211 | [Design Add and Search Words Data Structure](/solution/0200-0299/0211.Design%20Add%20and%20Search%20Words%20Data%20Structure/README_EN.md) | `Depth-First Search`,`Design`,`Trie`,`String` | Medium | | +| 0212 | [Word Search II](/solution/0200-0299/0212.Word%20Search%20II/README_EN.md) | `Trie`,`Array`,`String`,`Backtracking`,`Matrix` | Hard | | +| 0213 | [House Robber II](/solution/0200-0299/0213.House%20Robber%20II/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | +| 0214 | [Shortest Palindrome](/solution/0200-0299/0214.Shortest%20Palindrome/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | | +| 0215 | [Kth Largest Element in an Array](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README_EN.md) | `Array`,`Divide and Conquer`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | | +| 0216 | [Combination Sum III](/solution/0200-0299/0216.Combination%20Sum%20III/README_EN.md) | `Array`,`Backtracking` | Medium | | +| 0217 | [Contains Duplicate](/solution/0200-0299/0217.Contains%20Duplicate/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | | +| 0218 | [The Skyline Problem](/solution/0200-0299/0218.The%20Skyline%20Problem/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Divide and Conquer`,`Ordered Set`,`Line Sweep`,`Heap (Priority Queue)` | Hard | | +| 0219 | [Contains Duplicate II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Easy | | +| 0220 | [Contains Duplicate III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README_EN.md) | `Array`,`Bucket Sort`,`Ordered Set`,`Sorting`,`Sliding Window` | Hard | | +| 0221 | [Maximal Square](/solution/0200-0299/0221.Maximal%20Square/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | | +| 0222 | [Count Complete Tree Nodes](/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README_EN.md) | `Bit Manipulation`,`Tree`,`Binary Search`,`Binary Tree` | Easy | | +| 0223 | [Rectangle Area](/solution/0200-0299/0223.Rectangle%20Area/README_EN.md) | `Geometry`,`Math` | Medium | | +| 0224 | [Basic Calculator](/solution/0200-0299/0224.Basic%20Calculator/README_EN.md) | `Stack`,`Recursion`,`Math`,`String` | Hard | | +| 0225 | [Implement Stack using Queues](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README_EN.md) | `Stack`,`Design`,`Queue` | Easy | | +| 0226 | [Invert Binary Tree](/solution/0200-0299/0226.Invert%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | +| 0227 | [Basic Calculator II](/solution/0200-0299/0227.Basic%20Calculator%20II/README_EN.md) | `Stack`,`Math`,`String` | Medium | | +| 0228 | [Summary Ranges](/solution/0200-0299/0228.Summary%20Ranges/README_EN.md) | `Array` | Easy | | +| 0229 | [Majority Element II](/solution/0200-0299/0229.Majority%20Element%20II/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Medium | | +| 0230 | [Kth Smallest Element in a BST](/solution/0200-0299/0230.Kth%20Smallest%20Element%20in%20a%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | +| 0231 | [Power of Two](/solution/0200-0299/0231.Power%20of%20Two/README_EN.md) | `Bit Manipulation`,`Recursion`,`Math` | Easy | | +| 0232 | [Implement Queue using Stacks](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README_EN.md) | `Stack`,`Design`,`Queue` | Easy | | +| 0233 | [Number of Digit One](/solution/0200-0299/0233.Number%20of%20Digit%20One/README_EN.md) | `Recursion`,`Math`,`Dynamic Programming` | Hard | | +| 0234 | [Palindrome Linked List](/solution/0200-0299/0234.Palindrome%20Linked%20List/README_EN.md) | `Stack`,`Recursion`,`Linked List`,`Two Pointers` | Easy | | +| 0235 | [Lowest Common Ancestor of a Binary Search Tree](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | +| 0236 | [Lowest Common Ancestor of a Binary Tree](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | | +| 0237 | [Delete Node in a Linked List](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README_EN.md) | `Linked List` | Medium | | +| 0238 | [Product of Array Except Self](/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README_EN.md) | `Array`,`Prefix Sum` | Medium | | +| 0239 | [Sliding Window Maximum](/solution/0200-0299/0239.Sliding%20Window%20Maximum/README_EN.md) | `Queue`,`Array`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | | +| 0240 | [Search a 2D Matrix II](/solution/0200-0299/0240.Search%20a%202D%20Matrix%20II/README_EN.md) | `Array`,`Binary Search`,`Divide and Conquer`,`Matrix` | Medium | | +| 0241 | [Different Ways to Add Parentheses](/solution/0200-0299/0241.Different%20Ways%20to%20Add%20Parentheses/README_EN.md) | `Recursion`,`Memoization`,`Math`,`String`,`Dynamic Programming` | Medium | | +| 0242 | [Valid Anagram](/solution/0200-0299/0242.Valid%20Anagram/README_EN.md) | `Hash Table`,`String`,`Sorting` | Easy | | +| 0243 | [Shortest Word Distance](/solution/0200-0299/0243.Shortest%20Word%20Distance/README_EN.md) | `Array`,`String` | Easy | 🔒 | +| 0244 | [Shortest Word Distance II](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README_EN.md) | `Design`,`Array`,`Hash Table`,`Two Pointers`,`String` | Medium | 🔒 | +| 0245 | [Shortest Word Distance III](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README_EN.md) | `Array`,`String` | Medium | 🔒 | +| 0246 | [Strobogrammatic Number](/solution/0200-0299/0246.Strobogrammatic%20Number/README_EN.md) | `Hash Table`,`Two Pointers`,`String` | Easy | 🔒 | +| 0247 | [Strobogrammatic Number II](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README_EN.md) | `Recursion`,`Array`,`String` | Medium | 🔒 | +| 0248 | [Strobogrammatic Number III](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README_EN.md) | `Recursion`,`Array`,`String` | Hard | 🔒 | +| 0249 | [Group Shifted Strings](/solution/0200-0299/0249.Group%20Shifted%20Strings/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | 🔒 | +| 0250 | [Count Univalue Subtrees](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | +| 0251 | [Flatten 2D Vector](/solution/0200-0299/0251.Flatten%202D%20Vector/README_EN.md) | `Design`,`Array`,`Two Pointers`,`Iterator` | Medium | 🔒 | +| 0252 | [Meeting Rooms](/solution/0200-0299/0252.Meeting%20Rooms/README_EN.md) | `Array`,`Sorting` | Easy | 🔒 | +| 0253 | [Meeting Rooms II](/solution/0200-0299/0253.Meeting%20Rooms%20II/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Prefix Sum`,`Sorting`,`Heap (Priority Queue)` | Medium | 🔒 | +| 0254 | [Factor Combinations](/solution/0200-0299/0254.Factor%20Combinations/README_EN.md) | `Backtracking` | Medium | 🔒 | +| 0255 | [Verify Preorder Sequence in Binary Search Tree](/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README_EN.md) | `Stack`,`Tree`,`Binary Search Tree`,`Recursion`,`Array`,`Binary Tree`,`Monotonic Stack` | Medium | 🔒 | +| 0256 | [Paint House](/solution/0200-0299/0256.Paint%20House/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | +| 0257 | [Binary Tree Paths](/solution/0200-0299/0257.Binary%20Tree%20Paths/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Backtracking`,`Binary Tree` | Easy | | +| 0258 | [Add Digits](/solution/0200-0299/0258.Add%20Digits/README_EN.md) | `Math`,`Number Theory`,`Simulation` | Easy | | +| 0259 | [3Sum Smaller](/solution/0200-0299/0259.3Sum%20Smaller/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | 🔒 | +| 0260 | [Single Number III](/solution/0200-0299/0260.Single%20Number%20III/README_EN.md) | `Bit Manipulation`,`Array` | Medium | | +| 0261 | [Graph Valid Tree](/solution/0200-0299/0261.Graph%20Valid%20Tree/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | 🔒 | +| 0262 | [Trips and Users](/solution/0200-0299/0262.Trips%20and%20Users/README_EN.md) | `Database` | Hard | | +| 0263 | [Ugly Number](/solution/0200-0299/0263.Ugly%20Number/README_EN.md) | `Math` | Easy | | +| 0264 | [Ugly Number II](/solution/0200-0299/0264.Ugly%20Number%20II/README_EN.md) | `Hash Table`,`Math`,`Dynamic Programming`,`Heap (Priority Queue)` | Medium | | +| 0265 | [Paint House II](/solution/0200-0299/0265.Paint%20House%20II/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | +| 0266 | [Palindrome Permutation](/solution/0200-0299/0266.Palindrome%20Permutation/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String` | Easy | 🔒 | +| 0267 | [Palindrome Permutation II](/solution/0200-0299/0267.Palindrome%20Permutation%20II/README_EN.md) | `Hash Table`,`String`,`Backtracking` | Medium | 🔒 | +| 0268 | [Missing Number](/solution/0200-0299/0268.Missing%20Number/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Math`,`Binary Search`,`Sorting` | Easy | | +| 0269 | [Alien Dictionary](/solution/0200-0299/0269.Alien%20Dictionary/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`,`Array`,`String` | Hard | 🔒 | +| 0270 | [Closest Binary Search Tree Value](/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Search`,`Binary Tree` | Easy | 🔒 | +| 0271 | [Encode and Decode Strings](/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README_EN.md) | `Design`,`Array`,`String` | Medium | 🔒 | +| 0272 | [Closest Binary Search Tree Value II](/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Two Pointers`,`Binary Tree`,`Heap (Priority Queue)` | Hard | 🔒 | +| 0273 | [Integer to English Words](/solution/0200-0299/0273.Integer%20to%20English%20Words/README_EN.md) | `Recursion`,`Math`,`String` | Hard | | +| 0274 | [H-Index](/solution/0200-0299/0274.H-Index/README_EN.md) | `Array`,`Counting Sort`,`Sorting` | Medium | | +| 0275 | [H-Index II](/solution/0200-0299/0275.H-Index%20II/README_EN.md) | `Array`,`Binary Search` | Medium | | +| 0276 | [Paint Fence](/solution/0200-0299/0276.Paint%20Fence/README_EN.md) | `Dynamic Programming` | Medium | 🔒 | +| 0277 | [Find the Celebrity](/solution/0200-0299/0277.Find%20the%20Celebrity/README_EN.md) | `Graph`,`Two Pointers`,`Interactive` | Medium | 🔒 | +| 0278 | [First Bad Version](/solution/0200-0299/0278.First%20Bad%20Version/README_EN.md) | `Binary Search`,`Interactive` | Easy | | +| 0279 | [Perfect Squares](/solution/0200-0299/0279.Perfect%20Squares/README_EN.md) | `Breadth-First Search`,`Math`,`Dynamic Programming` | Medium | | +| 0280 | [Wiggle Sort](/solution/0200-0299/0280.Wiggle%20Sort/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | +| 0281 | [Zigzag Iterator](/solution/0200-0299/0281.Zigzag%20Iterator/README_EN.md) | `Design`,`Queue`,`Array`,`Iterator` | Medium | 🔒 | +| 0282 | [Expression Add Operators](/solution/0200-0299/0282.Expression%20Add%20Operators/README_EN.md) | `Math`,`String`,`Backtracking` | Hard | | +| 0283 | [Move Zeroes](/solution/0200-0299/0283.Move%20Zeroes/README_EN.md) | `Array`,`Two Pointers` | Easy | | +| 0284 | [Peeking Iterator](/solution/0200-0299/0284.Peeking%20Iterator/README_EN.md) | `Design`,`Array`,`Iterator` | Medium | | +| 0285 | [Inorder Successor in BST](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | 🔒 | +| 0286 | [Walls and Gates](/solution/0200-0299/0286.Walls%20and%20Gates/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 | +| 0287 | [Find the Duplicate Number](/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Binary Search` | Medium | | +| 0288 | [Unique Word Abbreviation](/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README_EN.md) | `Design`,`Array`,`Hash Table`,`String` | Medium | 🔒 | +| 0289 | [Game of Life](/solution/0200-0299/0289.Game%20of%20Life/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | | +| 0290 | [Word Pattern](/solution/0200-0299/0290.Word%20Pattern/README_EN.md) | `Hash Table`,`String` | Easy | | +| 0291 | [Word Pattern II](/solution/0200-0299/0291.Word%20Pattern%20II/README_EN.md) | `Hash Table`,`String`,`Backtracking` | Medium | 🔒 | +| 0292 | [Nim Game](/solution/0200-0299/0292.Nim%20Game/README_EN.md) | `Brainteaser`,`Math`,`Game Theory` | Easy | | +| 0293 | [Flip Game](/solution/0200-0299/0293.Flip%20Game/README_EN.md) | `String` | Easy | 🔒 | +| 0294 | [Flip Game II](/solution/0200-0299/0294.Flip%20Game%20II/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming`,`Backtracking`,`Game Theory` | Medium | 🔒 | +| 0295 | [Find Median from Data Stream](/solution/0200-0299/0295.Find%20Median%20from%20Data%20Stream/README_EN.md) | `Design`,`Two Pointers`,`Data Stream`,`Sorting`,`Heap (Priority Queue)` | Hard | | +| 0296 | [Best Meeting Point](/solution/0200-0299/0296.Best%20Meeting%20Point/README_EN.md) | `Array`,`Math`,`Matrix`,`Sorting` | Hard | 🔒 | +| 0297 | [Serialize and Deserialize Binary Tree](/solution/0200-0299/0297.Serialize%20and%20Deserialize%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`String`,`Binary Tree` | Hard | | +| 0298 | [Binary Tree Longest Consecutive Sequence](/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | +| 0299 | [Bulls and Cows](/solution/0200-0299/0299.Bulls%20and%20Cows/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | | +| 0300 | [Longest Increasing Subsequence](/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming` | Medium | | +| 0301 | [Remove Invalid Parentheses](/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README_EN.md) | `Breadth-First Search`,`String`,`Backtracking` | Hard | | +| 0302 | [Smallest Rectangle Enclosing Black Pixels](/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Binary Search`,`Matrix` | Hard | 🔒 | +| 0303 | [Range Sum Query - Immutable](/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README_EN.md) | `Design`,`Array`,`Prefix Sum` | Easy | | +| 0304 | [Range Sum Query 2D - Immutable](/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README_EN.md) | `Design`,`Array`,`Matrix`,`Prefix Sum` | Medium | | +| 0305 | [Number of Islands II](/solution/0300-0399/0305.Number%20of%20Islands%20II/README_EN.md) | `Union Find`,`Array`,`Hash Table` | Hard | 🔒 | +| 0306 | [Additive Number](/solution/0300-0399/0306.Additive%20Number/README_EN.md) | `String`,`Backtracking` | Medium | | +| 0307 | [Range Sum Query - Mutable](/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README_EN.md) | `Design`,`Binary Indexed Tree`,`Segment Tree`,`Array` | Medium | | +| 0308 | [Range Sum Query 2D - Mutable](/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README_EN.md) | `Design`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Matrix` | Hard | 🔒 | +| 0309 | [Best Time to Buy and Sell Stock with Cooldown](/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | +| 0310 | [Minimum Height Trees](/solution/0300-0399/0310.Minimum%20Height%20Trees/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | | +| 0311 | [Sparse Matrix Multiplication](/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | 🔒 | +| 0312 | [Burst Balloons](/solution/0300-0399/0312.Burst%20Balloons/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | +| 0313 | [Super Ugly Number](/solution/0300-0399/0313.Super%20Ugly%20Number/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | | +| 0314 | [Binary Tree Vertical Order Traversal](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`,`Sorting` | Medium | 🔒 | +| 0315 | [Count of Smaller Numbers After Self](/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | | +| 0316 | [Remove Duplicate Letters](/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Medium | | +| 0317 | [Shortest Distance from All Buildings](/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | 🔒 | +| 0318 | [Maximum Product of Word Lengths](/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README_EN.md) | `Bit Manipulation`,`Array`,`String` | Medium | | +| 0319 | [Bulb Switcher](/solution/0300-0399/0319.Bulb%20Switcher/README_EN.md) | `Brainteaser`,`Math` | Medium | | +| 0320 | [Generalized Abbreviation](/solution/0300-0399/0320.Generalized%20Abbreviation/README_EN.md) | `Bit Manipulation`,`String`,`Backtracking` | Medium | 🔒 | +| 0321 | [Create Maximum Number](/solution/0300-0399/0321.Create%20Maximum%20Number/README_EN.md) | `Stack`,`Greedy`,`Array`,`Two Pointers`,`Monotonic Stack` | Hard | | +| 0322 | [Coin Change](/solution/0300-0399/0322.Coin%20Change/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming` | Medium | | +| 0323 | [Number of Connected Components in an Undirected Graph](/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | 🔒 | +| 0324 | [Wiggle Sort II](/solution/0300-0399/0324.Wiggle%20Sort%20II/README_EN.md) | `Greedy`,`Array`,`Divide and Conquer`,`Quickselect`,`Sorting` | Medium | | +| 0325 | [Maximum Size Subarray Sum Equals k](/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | 🔒 | +| 0326 | [Power of Three](/solution/0300-0399/0326.Power%20of%20Three/README_EN.md) | `Recursion`,`Math` | Easy | | +| 0327 | [Count of Range Sum](/solution/0300-0399/0327.Count%20of%20Range%20Sum/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | | +| 0328 | [Odd Even Linked List](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README_EN.md) | `Linked List` | Medium | | +| 0329 | [Longest Increasing Path in a Matrix](/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`,`Memoization`,`Array`,`Dynamic Programming`,`Matrix` | Hard | | +| 0330 | [Patching Array](/solution/0300-0399/0330.Patching%20Array/README_EN.md) | `Greedy`,`Array` | Hard | | +| 0331 | [Verify Preorder Serialization of a Binary Tree](/solution/0300-0399/0331.Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README_EN.md) | `Stack`,`Tree`,`String`,`Binary Tree` | Medium | | +| 0332 | [Reconstruct Itinerary](/solution/0300-0399/0332.Reconstruct%20Itinerary/README_EN.md) | `Depth-First Search`,`Graph`,`Eulerian Circuit` | Hard | | +| 0333 | [Largest BST Subtree](/solution/0300-0399/0333.Largest%20BST%20Subtree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Dynamic Programming`,`Binary Tree` | Medium | 🔒 | +| 0334 | [Increasing Triplet Subsequence](/solution/0300-0399/0334.Increasing%20Triplet%20Subsequence/README_EN.md) | `Greedy`,`Array` | Medium | | +| 0335 | [Self Crossing](/solution/0300-0399/0335.Self%20Crossing/README_EN.md) | `Geometry`,`Array`,`Math` | Hard | | +| 0336 | [Palindrome Pairs](/solution/0300-0399/0336.Palindrome%20Pairs/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Hard | | +| 0337 | [House Robber III](/solution/0300-0399/0337.House%20Robber%20III/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Medium | | +| 0338 | [Counting Bits](/solution/0300-0399/0338.Counting%20Bits/README_EN.md) | `Bit Manipulation`,`Dynamic Programming` | Easy | | +| 0339 | [Nested List Weight Sum](/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README_EN.md) | `Depth-First Search`,`Breadth-First Search` | Medium | 🔒 | +| 0340 | [Longest Substring with At Most K Distinct Characters](/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | 🔒 | +| 0341 | [Flatten Nested List Iterator](/solution/0300-0399/0341.Flatten%20Nested%20List%20Iterator/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Design`,`Queue`,`Iterator` | Medium | | +| 0342 | [Power of Four](/solution/0300-0399/0342.Power%20of%20Four/README_EN.md) | `Bit Manipulation`,`Recursion`,`Math` | Easy | | +| 0343 | [Integer Break](/solution/0300-0399/0343.Integer%20Break/README_EN.md) | `Math`,`Dynamic Programming` | Medium | | +| 0344 | [Reverse String](/solution/0300-0399/0344.Reverse%20String/README_EN.md) | `Two Pointers`,`String` | Easy | | +| 0345 | [Reverse Vowels of a String](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README_EN.md) | `Two Pointers`,`String` | Easy | | +| 0346 | [Moving Average from Data Stream](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README_EN.md) | `Design`,`Queue`,`Array`,`Data Stream` | Easy | 🔒 | +| 0347 | [Top K Frequent Elements](/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README_EN.md) | `Array`,`Hash Table`,`Divide and Conquer`,`Bucket Sort`,`Counting`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | | +| 0348 | [Design Tic-Tac-Toe](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README_EN.md) | `Design`,`Array`,`Hash Table`,`Matrix`,`Simulation` | Medium | 🔒 | +| 0349 | [Intersection of Two Arrays](/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | | +| 0350 | [Intersection of Two Arrays II](/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | | +| 0351 | [Android Unlock Patterns](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README_EN.md) | `Bit Manipulation`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | 🔒 | +| 0352 | [Data Stream as Disjoint Intervals](/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README_EN.md) | `Design`,`Binary Search`,`Ordered Set` | Hard | | +| 0353 | [Design Snake Game](/solution/0300-0399/0353.Design%20Snake%20Game/README_EN.md) | `Design`,`Queue`,`Array`,`Hash Table`,`Simulation` | Medium | 🔒 | +| 0354 | [Russian Doll Envelopes](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | | +| 0355 | [Design Twitter](/solution/0300-0399/0355.Design%20Twitter/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Heap (Priority Queue)` | Medium | | +| 0356 | [Line Reflection](/solution/0300-0399/0356.Line%20Reflection/README_EN.md) | `Array`,`Hash Table`,`Math` | Medium | 🔒 | +| 0357 | [Count Numbers with Unique Digits](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README_EN.md) | `Math`,`Dynamic Programming`,`Backtracking` | Medium | | +| 0358 | [Rearrange String k Distance Apart](/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Hard | 🔒 | +| 0359 | [Logger Rate Limiter](/solution/0300-0399/0359.Logger%20Rate%20Limiter/README_EN.md) | `Design`,`Hash Table`,`Data Stream` | Easy | 🔒 | +| 0360 | [Sort Transformed Array](/solution/0300-0399/0360.Sort%20Transformed%20Array/README_EN.md) | `Array`,`Math`,`Two Pointers`,`Sorting` | Medium | 🔒 | +| 0361 | [Bomb Enemy](/solution/0300-0399/0361.Bomb%20Enemy/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | 🔒 | +| 0362 | [Design Hit Counter](/solution/0300-0399/0362.Design%20Hit%20Counter/README_EN.md) | `Design`,`Queue`,`Array`,`Binary Search`,`Data Stream` | Medium | 🔒 | +| 0363 | [Max Sum of Rectangle No Larger Than K](/solution/0300-0399/0363.Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/README_EN.md) | `Array`,`Binary Search`,`Matrix`,`Ordered Set`,`Prefix Sum` | Hard | | +| 0364 | [Nested List Weight Sum II](/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README_EN.md) | `Stack`,`Depth-First Search`,`Breadth-First Search` | Medium | 🔒 | +| 0365 | [Water and Jug Problem](/solution/0300-0399/0365.Water%20and%20Jug%20Problem/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Math` | Medium | | +| 0366 | [Find Leaves of Binary Tree](/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | +| 0367 | [Valid Perfect Square](/solution/0300-0399/0367.Valid%20Perfect%20Square/README_EN.md) | `Math`,`Binary Search` | Easy | | +| 0368 | [Largest Divisible Subset](/solution/0300-0399/0368.Largest%20Divisible%20Subset/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Sorting` | Medium | | +| 0369 | [Plus One Linked List](/solution/0300-0399/0369.Plus%20One%20Linked%20List/README_EN.md) | `Linked List`,`Math` | Medium | 🔒 | +| 0370 | [Range Addition](/solution/0300-0399/0370.Range%20Addition/README_EN.md) | `Array`,`Prefix Sum` | Medium | 🔒 | +| 0371 | [Sum of Two Integers](/solution/0300-0399/0371.Sum%20of%20Two%20Integers/README_EN.md) | `Bit Manipulation`,`Math` | Medium | | +| 0372 | [Super Pow](/solution/0300-0399/0372.Super%20Pow/README_EN.md) | `Math`,`Divide and Conquer` | Medium | | +| 0373 | [Find K Pairs with Smallest Sums](/solution/0300-0399/0373.Find%20K%20Pairs%20with%20Smallest%20Sums/README_EN.md) | `Array`,`Heap (Priority Queue)` | Medium | | +| 0374 | [Guess Number Higher or Lower](/solution/0300-0399/0374.Guess%20Number%20Higher%20or%20Lower/README_EN.md) | `Binary Search`,`Interactive` | Easy | | +| 0375 | [Guess Number Higher or Lower II](/solution/0300-0399/0375.Guess%20Number%20Higher%20or%20Lower%20II/README_EN.md) | `Math`,`Dynamic Programming`,`Game Theory` | Medium | | +| 0376 | [Wiggle Subsequence](/solution/0300-0399/0376.Wiggle%20Subsequence/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | | +| 0377 | [Combination Sum IV](/solution/0300-0399/0377.Combination%20Sum%20IV/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | +| 0378 | [Kth Smallest Element in a Sorted Matrix](/solution/0300-0399/0378.Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Medium | | +| 0379 | [Design Phone Directory](/solution/0300-0399/0379.Design%20Phone%20Directory/README_EN.md) | `Design`,`Queue`,`Array`,`Hash Table`,`Linked List` | Medium | 🔒 | +| 0380 | [Insert Delete GetRandom O(1)](/solution/0300-0399/0380.Insert%20Delete%20GetRandom%20O%281%29/README_EN.md) | `Design`,`Array`,`Hash Table`,`Math`,`Randomized` | Medium | | +| 0381 | [Insert Delete GetRandom O(1) - Duplicates allowed](/solution/0300-0399/0381.Insert%20Delete%20GetRandom%20O%281%29%20-%20Duplicates%20allowed/README_EN.md) | `Design`,`Array`,`Hash Table`,`Math`,`Randomized` | Hard | | +| 0382 | [Linked List Random Node](/solution/0300-0399/0382.Linked%20List%20Random%20Node/README_EN.md) | `Reservoir Sampling`,`Linked List`,`Math`,`Randomized` | Medium | | +| 0383 | [Ransom Note](/solution/0300-0399/0383.Ransom%20Note/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | | +| 0384 | [Shuffle an Array](/solution/0300-0399/0384.Shuffle%20an%20Array/README_EN.md) | `Array`,`Math`,`Randomized` | Medium | | +| 0385 | [Mini Parser](/solution/0300-0399/0385.Mini%20Parser/README_EN.md) | `Stack`,`Depth-First Search`,`String` | Medium | | +| 0386 | [Lexicographical Numbers](/solution/0300-0399/0386.Lexicographical%20Numbers/README_EN.md) | `Depth-First Search`,`Trie` | Medium | | +| 0387 | [First Unique Character in a String](/solution/0300-0399/0387.First%20Unique%20Character%20in%20a%20String/README_EN.md) | `Queue`,`Hash Table`,`String`,`Counting` | Easy | | +| 0388 | [Longest Absolute File Path](/solution/0300-0399/0388.Longest%20Absolute%20File%20Path/README_EN.md) | `Stack`,`Depth-First Search`,`String` | Medium | | +| 0389 | [Find the Difference](/solution/0300-0399/0389.Find%20the%20Difference/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Sorting` | Easy | | +| 0390 | [Elimination Game](/solution/0300-0399/0390.Elimination%20Game/README_EN.md) | `Recursion`,`Math` | Medium | | +| 0391 | [Perfect Rectangle](/solution/0300-0399/0391.Perfect%20Rectangle/README_EN.md) | `Array`,`Line Sweep` | Hard | | +| 0392 | [Is Subsequence](/solution/0300-0399/0392.Is%20Subsequence/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Easy | | +| 0393 | [UTF-8 Validation](/solution/0300-0399/0393.UTF-8%20Validation/README_EN.md) | `Bit Manipulation`,`Array` | Medium | | +| 0394 | [Decode String](/solution/0300-0399/0394.Decode%20String/README_EN.md) | `Stack`,`Recursion`,`String` | Medium | | +| 0395 | [Longest Substring with At Least K Repeating Characters](/solution/0300-0399/0395.Longest%20Substring%20with%20At%20Least%20K%20Repeating%20Characters/README_EN.md) | `Hash Table`,`String`,`Divide and Conquer`,`Sliding Window` | Medium | | +| 0396 | [Rotate Function](/solution/0300-0399/0396.Rotate%20Function/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | | +| 0397 | [Integer Replacement](/solution/0300-0399/0397.Integer%20Replacement/README_EN.md) | `Greedy`,`Bit Manipulation`,`Memoization`,`Dynamic Programming` | Medium | | +| 0398 | [Random Pick Index](/solution/0300-0399/0398.Random%20Pick%20Index/README_EN.md) | `Reservoir Sampling`,`Hash Table`,`Math`,`Randomized` | Medium | | +| 0399 | [Evaluate Division](/solution/0300-0399/0399.Evaluate%20Division/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`String`,`Shortest Path` | Medium | | +| 0400 | [Nth Digit](/solution/0400-0499/0400.Nth%20Digit/README_EN.md) | `Math`,`Binary Search` | Medium | | +| 0401 | [Binary Watch](/solution/0400-0499/0401.Binary%20Watch/README_EN.md) | `Bit Manipulation`,`Backtracking` | Easy | | +| 0402 | [Remove K Digits](/solution/0400-0499/0402.Remove%20K%20Digits/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Medium | | +| 0403 | [Frog Jump](/solution/0400-0499/0403.Frog%20Jump/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | +| 0404 | [Sum of Left Leaves](/solution/0400-0499/0404.Sum%20of%20Left%20Leaves/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | +| 0405 | [Convert a Number to Hexadecimal](/solution/0400-0499/0405.Convert%20a%20Number%20to%20Hexadecimal/README_EN.md) | `Bit Manipulation`,`Math` | Easy | | +| 0406 | [Queue Reconstruction by Height](/solution/0400-0499/0406.Queue%20Reconstruction%20by%20Height/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Sorting` | Medium | | +| 0407 | [Trapping Rain Water II](/solution/0400-0499/0407.Trapping%20Rain%20Water%20II/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix`,`Heap (Priority Queue)` | Hard | | +| 0408 | [Valid Word Abbreviation](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README_EN.md) | `Two Pointers`,`String` | Easy | 🔒 | +| 0409 | [Longest Palindrome](/solution/0400-0499/0409.Longest%20Palindrome/README_EN.md) | `Greedy`,`Hash Table`,`String` | Easy | | +| 0410 | [Split Array Largest Sum](/solution/0400-0499/0410.Split%20Array%20Largest%20Sum/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Dynamic Programming`,`Prefix Sum` | Hard | | +| 0411 | [Minimum Unique Word Abbreviation](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README_EN.md) | `Bit Manipulation`,`String`,`Backtracking` | Hard | 🔒 | +| 0412 | [Fizz Buzz](/solution/0400-0499/0412.Fizz%20Buzz/README_EN.md) | `Math`,`String`,`Simulation` | Easy | | +| 0413 | [Arithmetic Slices](/solution/0400-0499/0413.Arithmetic%20Slices/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | +| 0414 | [Third Maximum Number](/solution/0400-0499/0414.Third%20Maximum%20Number/README_EN.md) | `Array`,`Sorting` | Easy | | +| 0415 | [Add Strings](/solution/0400-0499/0415.Add%20Strings/README_EN.md) | `Math`,`String`,`Simulation` | Easy | | +| 0416 | [Partition Equal Subset Sum](/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | +| 0417 | [Pacific Atlantic Water Flow](/solution/0400-0499/0417.Pacific%20Atlantic%20Water%20Flow/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | | +| 0418 | [Sentence Screen Fitting](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | 🔒 | +| 0419 | [Battleships in a Board](/solution/0400-0499/0419.Battleships%20in%20a%20Board/README_EN.md) | `Depth-First Search`,`Array`,`Matrix` | Medium | | +| 0420 | [Strong Password Checker](/solution/0400-0499/0420.Strong%20Password%20Checker/README_EN.md) | `Greedy`,`String`,`Heap (Priority Queue)` | Hard | | +| 0421 | [Maximum XOR of Two Numbers in an Array](/solution/0400-0499/0421.Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/README_EN.md) | `Bit Manipulation`,`Trie`,`Array`,`Hash Table` | Medium | | +| 0422 | [Valid Word Square](/solution/0400-0499/0422.Valid%20Word%20Square/README_EN.md) | `Array`,`Matrix` | Easy | 🔒 | +| 0423 | [Reconstruct Original Digits from English](/solution/0400-0499/0423.Reconstruct%20Original%20Digits%20from%20English/README_EN.md) | `Hash Table`,`Math`,`String` | Medium | | +| 0424 | [Longest Repeating Character Replacement](/solution/0400-0499/0424.Longest%20Repeating%20Character%20Replacement/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | | +| 0425 | [Word Squares](/solution/0400-0499/0425.Word%20Squares/README_EN.md) | `Trie`,`Array`,`String`,`Backtracking` | Hard | 🔒 | +| 0426 | [Convert Binary Search Tree to Sorted Doubly Linked List](/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Linked List`,`Binary Tree`,`Doubly-Linked List` | Medium | 🔒 | +| 0427 | [Construct Quad Tree](/solution/0400-0499/0427.Construct%20Quad%20Tree/README_EN.md) | `Tree`,`Array`,`Divide and Conquer`,`Matrix` | Medium | | +| 0428 | [Serialize and Deserialize N-ary Tree](/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`String` | Hard | 🔒 | +| 0429 | [N-ary Tree Level Order Traversal](/solution/0400-0499/0429.N-ary%20Tree%20Level%20Order%20Traversal/README_EN.md) | `Tree`,`Breadth-First Search` | Medium | | +| 0430 | [Flatten a Multilevel Doubly Linked List](/solution/0400-0499/0430.Flatten%20a%20Multilevel%20Doubly%20Linked%20List/README_EN.md) | `Depth-First Search`,`Linked List`,`Doubly-Linked List` | Medium | | +| 0431 | [Encode N-ary Tree to Binary Tree](/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Tree` | Hard | 🔒 | +| 0432 | [All O`one Data Structure](/solution/0400-0499/0432.All%20O%60one%20Data%20Structure/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List` | Hard | | +| 0433 | [Minimum Genetic Mutation](/solution/0400-0499/0433.Minimum%20Genetic%20Mutation/README_EN.md) | `Breadth-First Search`,`Hash Table`,`String` | Medium | | +| 0434 | [Number of Segments in a String](/solution/0400-0499/0434.Number%20of%20Segments%20in%20a%20String/README_EN.md) | `String` | Easy | | +| 0435 | [Non-overlapping Intervals](/solution/0400-0499/0435.Non-overlapping%20Intervals/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Medium | | +| 0436 | [Find Right Interval](/solution/0400-0499/0436.Find%20Right%20Interval/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Medium | | +| 0437 | [Path Sum III](/solution/0400-0499/0437.Path%20Sum%20III/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | | +| 0438 | [Find All Anagrams in a String](/solution/0400-0499/0438.Find%20All%20Anagrams%20in%20a%20String/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | | +| 0439 | [Ternary Expression Parser](/solution/0400-0499/0439.Ternary%20Expression%20Parser/README_EN.md) | `Stack`,`Recursion`,`String` | Medium | 🔒 | +| 0440 | [K-th Smallest in Lexicographical Order](/solution/0400-0499/0440.K-th%20Smallest%20in%20Lexicographical%20Order/README_EN.md) | `Trie` | Hard | | +| 0441 | [Arranging Coins](/solution/0400-0499/0441.Arranging%20Coins/README_EN.md) | `Math`,`Binary Search` | Easy | | +| 0442 | [Find All Duplicates in an Array](/solution/0400-0499/0442.Find%20All%20Duplicates%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Medium | | +| 0443 | [String Compression](/solution/0400-0499/0443.String%20Compression/README_EN.md) | `Two Pointers`,`String` | Medium | | +| 0444 | [Sequence Reconstruction](/solution/0400-0499/0444.Sequence%20Reconstruction/README_EN.md) | `Graph`,`Topological Sort`,`Array` | Medium | 🔒 | +| 0445 | [Add Two Numbers II](/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README_EN.md) | `Stack`,`Linked List`,`Math` | Medium | | +| 0446 | [Arithmetic Slices II - Subsequence](/solution/0400-0499/0446.Arithmetic%20Slices%20II%20-%20Subsequence/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | +| 0447 | [Number of Boomerangs](/solution/0400-0499/0447.Number%20of%20Boomerangs/README_EN.md) | `Array`,`Hash Table`,`Math` | Medium | | +| 0448 | [Find All Numbers Disappeared in an Array](/solution/0400-0499/0448.Find%20All%20Numbers%20Disappeared%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | | +| 0449 | [Serialize and Deserialize BST](/solution/0400-0499/0449.Serialize%20and%20Deserialize%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Search Tree`,`String`,`Binary Tree` | Medium | | +| 0450 | [Delete Node in a BST](/solution/0400-0499/0450.Delete%20Node%20in%20a%20BST/README_EN.md) | `Tree`,`Binary Search Tree`,`Binary Tree` | Medium | | +| 0451 | [Sort Characters By Frequency](/solution/0400-0499/0451.Sort%20Characters%20By%20Frequency/README_EN.md) | `Hash Table`,`String`,`Bucket Sort`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | | +| 0452 | [Minimum Number of Arrows to Burst Balloons](/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | | +| 0453 | [Minimum Moves to Equal Array Elements](/solution/0400-0499/0453.Minimum%20Moves%20to%20Equal%20Array%20Elements/README_EN.md) | `Array`,`Math` | Medium | | +| 0454 | [4Sum II](/solution/0400-0499/0454.4Sum%20II/README_EN.md) | `Array`,`Hash Table` | Medium | | +| 0455 | [Assign Cookies](/solution/0400-0499/0455.Assign%20Cookies/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Easy | | +| 0456 | [132 Pattern](/solution/0400-0499/0456.132%20Pattern/README_EN.md) | `Stack`,`Array`,`Binary Search`,`Ordered Set`,`Monotonic Stack` | Medium | | +| 0457 | [Circular Array Loop](/solution/0400-0499/0457.Circular%20Array%20Loop/README_EN.md) | `Array`,`Hash Table`,`Two Pointers` | Medium | | +| 0458 | [Poor Pigs](/solution/0400-0499/0458.Poor%20Pigs/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | | +| 0459 | [Repeated Substring Pattern](/solution/0400-0499/0459.Repeated%20Substring%20Pattern/README_EN.md) | `String`,`String Matching` | Easy | | +| 0460 | [LFU Cache](/solution/0400-0499/0460.LFU%20Cache/README_EN.md) | `Design`,`Hash Table`,`Linked List`,`Doubly-Linked List` | Hard | | +| 0461 | [Hamming Distance](/solution/0400-0499/0461.Hamming%20Distance/README_EN.md) | `Bit Manipulation` | Easy | | +| 0462 | [Minimum Moves to Equal Array Elements II](/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README_EN.md) | `Array`,`Math`,`Sorting` | Medium | | +| 0463 | [Island Perimeter](/solution/0400-0499/0463.Island%20Perimeter/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Easy | | +| 0464 | [Can I Win](/solution/0400-0499/0464.Can%20I%20Win/README_EN.md) | `Bit Manipulation`,`Memoization`,`Math`,`Dynamic Programming`,`Bitmask`,`Game Theory` | Medium | | +| 0465 | [Optimal Account Balancing](/solution/0400-0499/0465.Optimal%20Account%20Balancing/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | 🔒 | +| 0466 | [Count The Repetitions](/solution/0400-0499/0466.Count%20The%20Repetitions/README_EN.md) | `String`,`Dynamic Programming` | Hard | | +| 0467 | [Unique Substrings in Wraparound String](/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README_EN.md) | `String`,`Dynamic Programming` | Medium | | +| 0468 | [Validate IP Address](/solution/0400-0499/0468.Validate%20IP%20Address/README_EN.md) | `String` | Medium | | +| 0469 | [Convex Polygon](/solution/0400-0499/0469.Convex%20Polygon/README_EN.md) | `Geometry`,`Array`,`Math` | Medium | 🔒 | +| 0470 | [Implement Rand10() Using Rand7()](/solution/0400-0499/0470.Implement%20Rand10%28%29%20Using%20Rand7%28%29/README_EN.md) | `Math`,`Rejection Sampling`,`Probability and Statistics`,`Randomized` | Medium | | +| 0471 | [Encode String with Shortest Length](/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README_EN.md) | `String`,`Dynamic Programming` | Hard | 🔒 | +| 0472 | [Concatenated Words](/solution/0400-0499/0472.Concatenated%20Words/README_EN.md) | `Depth-First Search`,`Trie`,`Array`,`String`,`Dynamic Programming` | Hard | | +| 0473 | [Matchsticks to Square](/solution/0400-0499/0473.Matchsticks%20to%20Square/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | | +| 0474 | [Ones and Zeroes](/solution/0400-0499/0474.Ones%20and%20Zeroes/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | | +| 0475 | [Heaters](/solution/0400-0499/0475.Heaters/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | | +| 0476 | [Number Complement](/solution/0400-0499/0476.Number%20Complement/README_EN.md) | `Bit Manipulation` | Easy | | +| 0477 | [Total Hamming Distance](/solution/0400-0499/0477.Total%20Hamming%20Distance/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Medium | | +| 0478 | [Generate Random Point in a Circle](/solution/0400-0499/0478.Generate%20Random%20Point%20in%20a%20Circle/README_EN.md) | `Geometry`,`Math`,`Rejection Sampling`,`Randomized` | Medium | | +| 0479 | [Largest Palindrome Product](/solution/0400-0499/0479.Largest%20Palindrome%20Product/README_EN.md) | `Math`,`Enumeration` | Hard | | +| 0480 | [Sliding Window Median](/solution/0400-0499/0480.Sliding%20Window%20Median/README_EN.md) | `Array`,`Hash Table`,`Sliding Window`,`Heap (Priority Queue)` | Hard | | +| 0481 | [Magical String](/solution/0400-0499/0481.Magical%20String/README_EN.md) | `Two Pointers`,`String` | Medium | | +| 0482 | [License Key Formatting](/solution/0400-0499/0482.License%20Key%20Formatting/README_EN.md) | `String` | Easy | | +| 0483 | [Smallest Good Base](/solution/0400-0499/0483.Smallest%20Good%20Base/README_EN.md) | `Math`,`Binary Search` | Hard | | +| 0484 | [Find Permutation](/solution/0400-0499/0484.Find%20Permutation/README_EN.md) | `Stack`,`Greedy`,`Array`,`String` | Medium | 🔒 | +| 0485 | [Max Consecutive Ones](/solution/0400-0499/0485.Max%20Consecutive%20Ones/README_EN.md) | `Array` | Easy | | +| 0486 | [Predict the Winner](/solution/0400-0499/0486.Predict%20the%20Winner/README_EN.md) | `Recursion`,`Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | | +| 0487 | [Max Consecutive Ones II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | 🔒 | +| 0488 | [Zuma Game](/solution/0400-0499/0488.Zuma%20Game/README_EN.md) | `Stack`,`Breadth-First Search`,`Memoization`,`String`,`Dynamic Programming` | Hard | | +| 0489 | [Robot Room Cleaner](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README_EN.md) | `Backtracking`,`Interactive` | Hard | 🔒 | +| 0490 | [The Maze](/solution/0400-0499/0490.The%20Maze/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 | +| 0491 | [Non-decreasing Subsequences](/solution/0400-0499/0491.Non-decreasing%20Subsequences/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Backtracking` | Medium | | +| 0492 | [Construct the Rectangle](/solution/0400-0499/0492.Construct%20the%20Rectangle/README_EN.md) | `Math` | Easy | | +| 0493 | [Reverse Pairs](/solution/0400-0499/0493.Reverse%20Pairs/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | | +| 0494 | [Target Sum](/solution/0400-0499/0494.Target%20Sum/README_EN.md) | `Array`,`Dynamic Programming`,`Backtracking` | Medium | | +| 0495 | [Teemo Attacking](/solution/0400-0499/0495.Teemo%20Attacking/README_EN.md) | `Array`,`Simulation` | Easy | | +| 0496 | [Next Greater Element I](/solution/0400-0499/0496.Next%20Greater%20Element%20I/README_EN.md) | `Stack`,`Array`,`Hash Table`,`Monotonic Stack` | Easy | | +| 0497 | [Random Point in Non-overlapping Rectangles](/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README_EN.md) | `Reservoir Sampling`,`Array`,`Math`,`Binary Search`,`Ordered Set`,`Prefix Sum`,`Randomized` | Medium | | +| 0498 | [Diagonal Traverse](/solution/0400-0499/0498.Diagonal%20Traverse/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | | +| 0499 | [The Maze III](/solution/0400-0499/0499.The%20Maze%20III/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Array`,`String`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | 🔒 | +| 0500 | [Keyboard Row](/solution/0500-0599/0500.Keyboard%20Row/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | | +| 0501 | [Find Mode in Binary Search Tree](/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Easy | | +| 0502 | [IPO](/solution/0500-0599/0502.IPO/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | | +| 0503 | [Next Greater Element II](/solution/0500-0599/0503.Next%20Greater%20Element%20II/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | | +| 0504 | [Base 7](/solution/0500-0599/0504.Base%207/README_EN.md) | `Math` | Easy | | +| 0505 | [The Maze II](/solution/0500-0599/0505.The%20Maze%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 | +| 0506 | [Relative Ranks](/solution/0500-0599/0506.Relative%20Ranks/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Easy | | +| 0507 | [Perfect Number](/solution/0500-0599/0507.Perfect%20Number/README_EN.md) | `Math` | Easy | | +| 0508 | [Most Frequent Subtree Sum](/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree` | Medium | | +| 0509 | [Fibonacci Number](/solution/0500-0599/0509.Fibonacci%20Number/README_EN.md) | `Recursion`,`Memoization`,`Math`,`Dynamic Programming` | Easy | | +| 0510 | [Inorder Successor in BST II](/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README_EN.md) | `Tree`,`Binary Search Tree`,`Binary Tree` | Medium | 🔒 | +| 0511 | [Game Play Analysis I](/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README_EN.md) | `Database` | Easy | | +| 0512 | [Game Play Analysis II](/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README_EN.md) | `Database` | Easy | 🔒 | +| 0513 | [Find Bottom Left Tree Value](/solution/0500-0599/0513.Find%20Bottom%20Left%20Tree%20Value/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | +| 0514 | [Freedom Trail](/solution/0500-0599/0514.Freedom%20Trail/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`String`,`Dynamic Programming` | Hard | | +| 0515 | [Find Largest Value in Each Tree Row](/solution/0500-0599/0515.Find%20Largest%20Value%20in%20Each%20Tree%20Row/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | +| 0516 | [Longest Palindromic Subsequence](/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README_EN.md) | `String`,`Dynamic Programming` | Medium | | +| 0517 | [Super Washing Machines](/solution/0500-0599/0517.Super%20Washing%20Machines/README_EN.md) | `Greedy`,`Array` | Hard | | +| 0518 | [Coin Change II](/solution/0500-0599/0518.Coin%20Change%20II/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | +| 0519 | [Random Flip Matrix](/solution/0500-0599/0519.Random%20Flip%20Matrix/README_EN.md) | `Reservoir Sampling`,`Hash Table`,`Math`,`Randomized` | Medium | | +| 0520 | [Detect Capital](/solution/0500-0599/0520.Detect%20Capital/README_EN.md) | `String` | Easy | | +| 0521 | [Longest Uncommon Subsequence I](/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README_EN.md) | `String` | Easy | | +| 0522 | [Longest Uncommon Subsequence II](/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`String`,`Sorting` | Medium | | +| 0523 | [Continuous Subarray Sum](/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README_EN.md) | `Array`,`Hash Table`,`Math`,`Prefix Sum` | Medium | | +| 0524 | [Longest Word in Dictionary through Deleting](/solution/0500-0599/0524.Longest%20Word%20in%20Dictionary%20through%20Deleting/README_EN.md) | `Array`,`Two Pointers`,`String`,`Sorting` | Medium | | +| 0525 | [Contiguous Array](/solution/0500-0599/0525.Contiguous%20Array/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | | +| 0526 | [Beautiful Arrangement](/solution/0500-0599/0526.Beautiful%20Arrangement/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | | +| 0527 | [Word Abbreviation](/solution/0500-0599/0527.Word%20Abbreviation/README_EN.md) | `Greedy`,`Trie`,`Array`,`String`,`Sorting` | Hard | 🔒 | +| 0528 | [Random Pick with Weight](/solution/0500-0599/0528.Random%20Pick%20with%20Weight/README_EN.md) | `Array`,`Math`,`Binary Search`,`Prefix Sum`,`Randomized` | Medium | | +| 0529 | [Minesweeper](/solution/0500-0599/0529.Minesweeper/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | | +| 0530 | [Minimum Absolute Difference in BST](/solution/0500-0599/0530.Minimum%20Absolute%20Difference%20in%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Search Tree`,`Binary Tree` | Easy | | +| 0531 | [Lonely Pixel I](/solution/0500-0599/0531.Lonely%20Pixel%20I/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | 🔒 | +| 0532 | [K-diff Pairs in an Array](/solution/0500-0599/0532.K-diff%20Pairs%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | | +| 0533 | [Lonely Pixel II](/solution/0500-0599/0533.Lonely%20Pixel%20II/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | 🔒 | +| 0534 | [Game Play Analysis III](/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README_EN.md) | `Database` | Medium | 🔒 | +| 0535 | [Encode and Decode TinyURL](/solution/0500-0599/0535.Encode%20and%20Decode%20TinyURL/README_EN.md) | `Design`,`Hash Table`,`String`,`Hash Function` | Medium | | +| 0536 | [Construct Binary Tree from String](/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`String`,`Binary Tree` | Medium | 🔒 | +| 0537 | [Complex Number Multiplication](/solution/0500-0599/0537.Complex%20Number%20Multiplication/README_EN.md) | `Math`,`String`,`Simulation` | Medium | | +| 0538 | [Convert BST to Greater Tree](/solution/0500-0599/0538.Convert%20BST%20to%20Greater%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | +| 0539 | [Minimum Time Difference](/solution/0500-0599/0539.Minimum%20Time%20Difference/README_EN.md) | `Array`,`Math`,`String`,`Sorting` | Medium | | +| 0540 | [Single Element in a Sorted Array](/solution/0500-0599/0540.Single%20Element%20in%20a%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | | +| 0541 | [Reverse String II](/solution/0500-0599/0541.Reverse%20String%20II/README_EN.md) | `Two Pointers`,`String` | Easy | | +| 0542 | [01 Matrix](/solution/0500-0599/0542.01%20Matrix/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix` | Medium | | +| 0543 | [Diameter of Binary Tree](/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | | +| 0544 | [Output Contest Matches](/solution/0500-0599/0544.Output%20Contest%20Matches/README_EN.md) | `Recursion`,`String`,`Simulation` | Medium | 🔒 | +| 0545 | [Boundary of Binary Tree](/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | +| 0546 | [Remove Boxes](/solution/0500-0599/0546.Remove%20Boxes/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Hard | | +| 0547 | [Number of Provinces](/solution/0500-0599/0547.Number%20of%20Provinces/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | | +| 0548 | [Split Array with Equal Sum](/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Hard | 🔒 | +| 0549 | [Binary Tree Longest Consecutive Sequence II](/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | +| 0550 | [Game Play Analysis IV](/solution/0500-0599/0550.Game%20Play%20Analysis%20IV/README_EN.md) | `Database` | Medium | | +| 0551 | [Student Attendance Record I](/solution/0500-0599/0551.Student%20Attendance%20Record%20I/README_EN.md) | `String` | Easy | | +| 0552 | [Student Attendance Record II](/solution/0500-0599/0552.Student%20Attendance%20Record%20II/README_EN.md) | `Dynamic Programming` | Hard | | +| 0553 | [Optimal Division](/solution/0500-0599/0553.Optimal%20Division/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | | +| 0554 | [Brick Wall](/solution/0500-0599/0554.Brick%20Wall/README_EN.md) | `Array`,`Hash Table` | Medium | | +| 0555 | [Split Concatenated Strings](/solution/0500-0599/0555.Split%20Concatenated%20Strings/README_EN.md) | `Greedy`,`Array`,`String` | Medium | 🔒 | +| 0556 | [Next Greater Element III](/solution/0500-0599/0556.Next%20Greater%20Element%20III/README_EN.md) | `Math`,`Two Pointers`,`String` | Medium | | +| 0557 | [Reverse Words in a String III](/solution/0500-0599/0557.Reverse%20Words%20in%20a%20String%20III/README_EN.md) | `Two Pointers`,`String` | Easy | | +| 0558 | [Logical OR of Two Binary Grids Represented as Quad-Trees](/solution/0500-0599/0558.Logical%20OR%20of%20Two%20Binary%20Grids%20Represented%20as%20Quad-Trees/README_EN.md) | `Tree`,`Divide and Conquer` | Medium | | +| 0559 | [Maximum Depth of N-ary Tree](/solution/0500-0599/0559.Maximum%20Depth%20of%20N-ary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search` | Easy | | +| 0560 | [Subarray Sum Equals K](/solution/0500-0599/0560.Subarray%20Sum%20Equals%20K/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | | +| 0561 | [Array Partition](/solution/0500-0599/0561.Array%20Partition/README_EN.md) | `Greedy`,`Array`,`Counting Sort`,`Sorting` | Easy | | +| 0562 | [Longest Line of Consecutive One in Matrix](/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | 🔒 | +| 0563 | [Binary Tree Tilt](/solution/0500-0599/0563.Binary%20Tree%20Tilt/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | | +| 0564 | [Find the Closest Palindrome](/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README_EN.md) | `Math`,`String` | Hard | | +| 0565 | [Array Nesting](/solution/0500-0599/0565.Array%20Nesting/README_EN.md) | `Depth-First Search`,`Array` | Medium | | +| 0566 | [Reshape the Matrix](/solution/0500-0599/0566.Reshape%20the%20Matrix/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | | +| 0567 | [Permutation in String](/solution/0500-0599/0567.Permutation%20in%20String/README_EN.md) | `Hash Table`,`Two Pointers`,`String`,`Sliding Window` | Medium | | +| 0568 | [Maximum Vacation Days](/solution/0500-0599/0568.Maximum%20Vacation%20Days/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | 🔒 | +| 0569 | [Median Employee Salary](/solution/0500-0599/0569.Median%20Employee%20Salary/README_EN.md) | `Database` | Hard | 🔒 | +| 0570 | [Managers with at Least 5 Direct Reports](/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README_EN.md) | `Database` | Medium | | +| 0571 | [Find Median Given Frequency of Numbers](/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README_EN.md) | `Database` | Hard | 🔒 | +| 0572 | [Subtree of Another Tree](/solution/0500-0599/0572.Subtree%20of%20Another%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree`,`String Matching`,`Hash Function` | Easy | | +| 0573 | [Squirrel Simulation](/solution/0500-0599/0573.Squirrel%20Simulation/README_EN.md) | `Array`,`Math` | Medium | 🔒 | +| 0574 | [Winning Candidate](/solution/0500-0599/0574.Winning%20Candidate/README_EN.md) | `Database` | Medium | 🔒 | +| 0575 | [Distribute Candies](/solution/0500-0599/0575.Distribute%20Candies/README_EN.md) | `Array`,`Hash Table` | Easy | | +| 0576 | [Out of Boundary Paths](/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README_EN.md) | `Dynamic Programming` | Medium | | +| 0577 | [Employee Bonus](/solution/0500-0599/0577.Employee%20Bonus/README_EN.md) | `Database` | Easy | | +| 0578 | [Get Highest Answer Rate Question](/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README_EN.md) | `Database` | Medium | 🔒 | +| 0579 | [Find Cumulative Salary of an Employee](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README_EN.md) | `Database` | Hard | 🔒 | +| 0580 | [Count Student Number in Departments](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README_EN.md) | `Database` | Medium | 🔒 | +| 0581 | [Shortest Unsorted Continuous Subarray](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README_EN.md) | `Stack`,`Greedy`,`Array`,`Two Pointers`,`Sorting`,`Monotonic Stack` | Medium | | +| 0582 | [Kill Process](/solution/0500-0599/0582.Kill%20Process/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table` | Medium | 🔒 | +| 0583 | [Delete Operation for Two Strings](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README_EN.md) | `String`,`Dynamic Programming` | Medium | | +| 0584 | [Find Customer Referee](/solution/0500-0599/0584.Find%20Customer%20Referee/README_EN.md) | `Database` | Easy | | +| 0585 | [Investments in 2016](/solution/0500-0599/0585.Investments%20in%202016/README_EN.md) | `Database` | Medium | | +| 0586 | [Customer Placing the Largest Number of Orders](/solution/0500-0599/0586.Customer%20Placing%20the%20Largest%20Number%20of%20Orders/README_EN.md) | `Database` | Easy | | +| 0587 | [Erect the Fence](/solution/0500-0599/0587.Erect%20the%20Fence/README_EN.md) | `Geometry`,`Array`,`Math` | Hard | | +| 0588 | [Design In-Memory File System](/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Hard | 🔒 | +| 0589 | [N-ary Tree Preorder Traversal](/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search` | Easy | | +| 0590 | [N-ary Tree Postorder Traversal](/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Depth-First Search` | Easy | | +| 0591 | [Tag Validator](/solution/0500-0599/0591.Tag%20Validator/README_EN.md) | `Stack`,`String` | Hard | | +| 0592 | [Fraction Addition and Subtraction](/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README_EN.md) | `Math`,`String`,`Simulation` | Medium | | +| 0593 | [Valid Square](/solution/0500-0599/0593.Valid%20Square/README_EN.md) | `Geometry`,`Math` | Medium | | +| 0594 | [Longest Harmonious Subsequence](/solution/0500-0599/0594.Longest%20Harmonious%20Subsequence/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting`,`Sliding Window` | Easy | | +| 0595 | [Big Countries](/solution/0500-0599/0595.Big%20Countries/README_EN.md) | `Database` | Easy | | +| 0596 | [Classes More Than 5 Students](/solution/0500-0599/0596.Classes%20More%20Than%205%20Students/README_EN.md) | `Database` | Easy | | +| 0597 | [Friend Requests I Overall Acceptance Rate](/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README_EN.md) | `Database` | Easy | 🔒 | +| 0598 | [Range Addition II](/solution/0500-0599/0598.Range%20Addition%20II/README_EN.md) | `Array`,`Math` | Easy | | +| 0599 | [Minimum Index Sum of Two Lists](/solution/0500-0599/0599.Minimum%20Index%20Sum%20of%20Two%20Lists/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | | +| 0600 | [Non-negative Integers without Consecutive Ones](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README_EN.md) | `Dynamic Programming` | Hard | | +| 0601 | [Human Traffic of Stadium](/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README_EN.md) | `Database` | Hard | | +| 0602 | [Friend Requests II Who Has the Most Friends](/solution/0600-0699/0602.Friend%20Requests%20II%20Who%20Has%20the%20Most%20Friends/README_EN.md) | `Database` | Medium | | +| 0603 | [Consecutive Available Seats](/solution/0600-0699/0603.Consecutive%20Available%20Seats/README_EN.md) | `Database` | Easy | 🔒 | +| 0604 | [Design Compressed String Iterator](/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README_EN.md) | `Design`,`Array`,`String`,`Iterator` | Easy | 🔒 | +| 0605 | [Can Place Flowers](/solution/0600-0699/0605.Can%20Place%20Flowers/README_EN.md) | `Greedy`,`Array` | Easy | | +| 0606 | [Construct String from Binary Tree](/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Binary Tree` | Medium | | +| 0607 | [Sales Person](/solution/0600-0699/0607.Sales%20Person/README_EN.md) | `Database` | Easy | | +| 0608 | [Tree Node](/solution/0600-0699/0608.Tree%20Node/README_EN.md) | `Database` | Medium | | +| 0609 | [Find Duplicate File in System](/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | | +| 0610 | [Triangle Judgement](/solution/0600-0699/0610.Triangle%20Judgement/README_EN.md) | `Database` | Easy | | +| 0611 | [Valid Triangle Number](/solution/0600-0699/0611.Valid%20Triangle%20Number/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | | +| 0612 | [Shortest Distance in a Plane](/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README_EN.md) | `Database` | Medium | 🔒 | +| 0613 | [Shortest Distance in a Line](/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README_EN.md) | `Database` | Easy | 🔒 | +| 0614 | [Second Degree Follower](/solution/0600-0699/0614.Second%20Degree%20Follower/README_EN.md) | `Database` | Medium | 🔒 | +| 0615 | [Average Salary Departments VS Company](/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README_EN.md) | `Database` | Hard | 🔒 | +| 0616 | [Add Bold Tag in String](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`String Matching` | Medium | 🔒 | +| 0617 | [Merge Two Binary Trees](/solution/0600-0699/0617.Merge%20Two%20Binary%20Trees/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | +| 0618 | [Students Report By Geography](/solution/0600-0699/0618.Students%20Report%20By%20Geography/README_EN.md) | `Database` | Hard | 🔒 | +| 0619 | [Biggest Single Number](/solution/0600-0699/0619.Biggest%20Single%20Number/README_EN.md) | `Database` | Easy | | +| 0620 | [Not Boring Movies](/solution/0600-0699/0620.Not%20Boring%20Movies/README_EN.md) | `Database` | Easy | | +| 0621 | [Task Scheduler](/solution/0600-0699/0621.Task%20Scheduler/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | | +| 0622 | [Design Circular Queue](/solution/0600-0699/0622.Design%20Circular%20Queue/README_EN.md) | `Design`,`Queue`,`Array`,`Linked List` | Medium | | +| 0623 | [Add One Row to Tree](/solution/0600-0699/0623.Add%20One%20Row%20to%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | +| 0624 | [Maximum Distance in Arrays](/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 | +| 0625 | [Minimum Factorization](/solution/0600-0699/0625.Minimum%20Factorization/README_EN.md) | `Greedy`,`Math` | Medium | 🔒 | +| 0626 | [Exchange Seats](/solution/0600-0699/0626.Exchange%20Seats/README_EN.md) | `Database` | Medium | | +| 0627 | [Swap Salary](/solution/0600-0699/0627.Swap%20Salary/README_EN.md) | `Database` | Easy | | +| 0628 | [Maximum Product of Three Numbers](/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README_EN.md) | `Array`,`Math`,`Sorting` | Easy | | +| 0629 | [K Inverse Pairs Array](/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README_EN.md) | `Dynamic Programming` | Hard | | +| 0630 | [Course Schedule III](/solution/0600-0699/0630.Course%20Schedule%20III/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | | +| 0631 | [Design Excel Sum Formula](/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README_EN.md) | `Graph`,`Design`,`Topological Sort`,`Array`,`Matrix` | Hard | 🔒 | +| 0632 | [Smallest Range Covering Elements from K Lists](/solution/0600-0699/0632.Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting`,`Sliding Window`,`Heap (Priority Queue)` | Hard | | +| 0633 | [Sum of Square Numbers](/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README_EN.md) | `Math`,`Two Pointers`,`Binary Search` | Medium | | +| 0634 | [Find the Derangement of An Array](/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README_EN.md) | `Math`,`Dynamic Programming` | Medium | 🔒 | +| 0635 | [Design Log Storage System](/solution/0600-0699/0635.Design%20Log%20Storage%20System/README_EN.md) | `Design`,`Hash Table`,`String`,`Ordered Set` | Medium | 🔒 | +| 0636 | [Exclusive Time of Functions](/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README_EN.md) | `Stack`,`Array` | Medium | | +| 0637 | [Average of Levels in Binary Tree](/solution/0600-0699/0637.Average%20of%20Levels%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | +| 0638 | [Shopping Offers](/solution/0600-0699/0638.Shopping%20Offers/README_EN.md) | `Bit Manipulation`,`Memoization`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | | +| 0639 | [Decode Ways II](/solution/0600-0699/0639.Decode%20Ways%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | | +| 0640 | [Solve the Equation](/solution/0600-0699/0640.Solve%20the%20Equation/README_EN.md) | `Math`,`String`,`Simulation` | Medium | | +| 0641 | [Design Circular Deque](/solution/0600-0699/0641.Design%20Circular%20Deque/README_EN.md) | `Design`,`Queue`,`Array`,`Linked List` | Medium | | +| 0642 | [Design Search Autocomplete System](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README_EN.md) | `Design`,`Trie`,`String`,`Data Stream`,`Sorting`,`Heap (Priority Queue)` | Hard | 🔒 | +| 0643 | [Maximum Average Subarray I](/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README_EN.md) | `Array`,`Sliding Window` | Easy | | +| 0644 | [Maximum Average Subarray II](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum` | Hard | 🔒 | +| 0645 | [Set Mismatch](/solution/0600-0699/0645.Set%20Mismatch/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Sorting` | Easy | | +| 0646 | [Maximum Length of Pair Chain](/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Medium | | +| 0647 | [Palindromic Substrings](/solution/0600-0699/0647.Palindromic%20Substrings/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Medium | | +| 0648 | [Replace Words](/solution/0600-0699/0648.Replace%20Words/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | | +| 0649 | [Dota2 Senate](/solution/0600-0699/0649.Dota2%20Senate/README_EN.md) | `Greedy`,`Queue`,`String` | Medium | | +| 0650 | [2 Keys Keyboard](/solution/0600-0699/0650.2%20Keys%20Keyboard/README_EN.md) | `Math`,`Dynamic Programming` | Medium | | +| 0651 | [4 Keys Keyboard](/solution/0600-0699/0651.4%20Keys%20Keyboard/README_EN.md) | `Math`,`Dynamic Programming` | Medium | 🔒 | +| 0652 | [Find Duplicate Subtrees](/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree` | Medium | | +| 0653 | [Two Sum IV - Input is a BST](/solution/0600-0699/0653.Two%20Sum%20IV%20-%20Input%20is%20a%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Search Tree`,`Hash Table`,`Two Pointers`,`Binary Tree` | Easy | | +| 0654 | [Maximum Binary Tree](/solution/0600-0699/0654.Maximum%20Binary%20Tree/README_EN.md) | `Stack`,`Tree`,`Array`,`Divide and Conquer`,`Binary Tree`,`Monotonic Stack` | Medium | | +| 0655 | [Print Binary Tree](/solution/0600-0699/0655.Print%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | +| 0656 | [Coin Path](/solution/0600-0699/0656.Coin%20Path/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | +| 0657 | [Robot Return to Origin](/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README_EN.md) | `String`,`Simulation` | Easy | | +| 0658 | [Find K Closest Elements](/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting`,`Sliding Window`,`Heap (Priority Queue)` | Medium | | +| 0659 | [Split Array into Consecutive Subsequences](/solution/0600-0699/0659.Split%20Array%20into%20Consecutive%20Subsequences/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Heap (Priority Queue)` | Medium | | +| 0660 | [Remove 9](/solution/0600-0699/0660.Remove%209/README_EN.md) | `Math` | Hard | 🔒 | +| 0661 | [Image Smoother](/solution/0600-0699/0661.Image%20Smoother/README_EN.md) | `Array`,`Matrix` | Easy | | +| 0662 | [Maximum Width of Binary Tree](/solution/0600-0699/0662.Maximum%20Width%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | | +| 0663 | [Equal Tree Partition](/solution/0600-0699/0663.Equal%20Tree%20Partition/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | +| 0664 | [Strange Printer](/solution/0600-0699/0664.Strange%20Printer/README_EN.md) | `String`,`Dynamic Programming` | Hard | | +| 0665 | [Non-decreasing Array](/solution/0600-0699/0665.Non-decreasing%20Array/README_EN.md) | `Array` | Medium | | +| 0666 | [Path Sum IV](/solution/0600-0699/0666.Path%20Sum%20IV/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`Binary Tree` | Medium | 🔒 | +| 0667 | [Beautiful Arrangement II](/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README_EN.md) | `Array`,`Math` | Medium | | +| 0668 | [Kth Smallest Number in Multiplication Table](/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README_EN.md) | `Math`,`Binary Search` | Hard | | +| 0669 | [Trim a Binary Search Tree](/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | | +| 0670 | [Maximum Swap](/solution/0600-0699/0670.Maximum%20Swap/README_EN.md) | `Greedy`,`Math` | Medium | | +| 0671 | [Second Minimum Node In a Binary Tree](/solution/0600-0699/0671.Second%20Minimum%20Node%20In%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | | +| 0672 | [Bulb Switcher II](/solution/0600-0699/0672.Bulb%20Switcher%20II/README_EN.md) | `Bit Manipulation`,`Depth-First Search`,`Breadth-First Search`,`Math` | Medium | | +| 0673 | [Number of Longest Increasing Subsequence](/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Dynamic Programming` | Medium | | +| 0674 | [Longest Continuous Increasing Subsequence](/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README_EN.md) | `Array` | Easy | | +| 0675 | [Cut Off Trees for Golf Event](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix`,`Heap (Priority Queue)` | Hard | | +| 0676 | [Implement Magic Dictionary](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README_EN.md) | `Depth-First Search`,`Design`,`Trie`,`Hash Table`,`String` | Medium | | +| 0677 | [Map Sum Pairs](/solution/0600-0699/0677.Map%20Sum%20Pairs/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | | +| 0678 | [Valid Parenthesis String](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README_EN.md) | `Stack`,`Greedy`,`String`,`Dynamic Programming` | Medium | | +| 0679 | [24 Game](/solution/0600-0699/0679.24%20Game/README_EN.md) | `Array`,`Math`,`Backtracking` | Hard | | +| 0680 | [Valid Palindrome II](/solution/0600-0699/0680.Valid%20Palindrome%20II/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Easy | | +| 0681 | [Next Closest Time](/solution/0600-0699/0681.Next%20Closest%20Time/README_EN.md) | `Hash Table`,`String`,`Backtracking`,`Enumeration` | Medium | 🔒 | +| 0682 | [Baseball Game](/solution/0600-0699/0682.Baseball%20Game/README_EN.md) | `Stack`,`Array`,`Simulation` | Easy | | +| 0683 | [K Empty Slots](/solution/0600-0699/0683.K%20Empty%20Slots/README_EN.md) | `Binary Indexed Tree`,`Array`,`Ordered Set`,`Sliding Window` | Hard | 🔒 | +| 0684 | [Redundant Connection](/solution/0600-0699/0684.Redundant%20Connection/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | | +| 0685 | [Redundant Connection II](/solution/0600-0699/0685.Redundant%20Connection%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Hard | | +| 0686 | [Repeated String Match](/solution/0600-0699/0686.Repeated%20String%20Match/README_EN.md) | `String`,`String Matching` | Medium | | +| 0687 | [Longest Univalue Path](/solution/0600-0699/0687.Longest%20Univalue%20Path/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | | +| 0688 | [Knight Probability in Chessboard](/solution/0600-0699/0688.Knight%20Probability%20in%20Chessboard/README_EN.md) | `Dynamic Programming` | Medium | | +| 0689 | [Maximum Sum of 3 Non-Overlapping Subarrays](/solution/0600-0699/0689.Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | +| 0690 | [Employee Importance](/solution/0600-0699/0690.Employee%20Importance/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table` | Medium | | +| 0691 | [Stickers to Spell Word](/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README_EN.md) | `Bit Manipulation`,`Array`,`String`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | | +| 0692 | [Top K Frequent Words](/solution/0600-0699/0692.Top%20K%20Frequent%20Words/README_EN.md) | `Trie`,`Hash Table`,`String`,`Bucket Sort`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | | +| 0693 | [Binary Number with Alternating Bits](/solution/0600-0699/0693.Binary%20Number%20with%20Alternating%20Bits/README_EN.md) | `Bit Manipulation` | Easy | | +| 0694 | [Number of Distinct Islands](/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Hash Table`,`Hash Function` | Medium | 🔒 | +| 0695 | [Max Area of Island](/solution/0600-0699/0695.Max%20Area%20of%20Island/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | | +| 0696 | [Count Binary Substrings](/solution/0600-0699/0696.Count%20Binary%20Substrings/README_EN.md) | `Two Pointers`,`String` | Easy | | +| 0697 | [Degree of an Array](/solution/0600-0699/0697.Degree%20of%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | | +| 0698 | [Partition to K Equal Sum Subsets](/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README_EN.md) | `Bit Manipulation`,`Memoization`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | | +| 0699 | [Falling Squares](/solution/0600-0699/0699.Falling%20Squares/README_EN.md) | `Segment Tree`,`Array`,`Ordered Set` | Hard | | +| 0700 | [Search in a Binary Search Tree](/solution/0700-0799/0700.Search%20in%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Binary Search Tree`,`Binary Tree` | Easy | | +| 0701 | [Insert into a Binary Search Tree](/solution/0700-0799/0701.Insert%20into%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Binary Search Tree`,`Binary Tree` | Medium | | +| 0702 | [Search in a Sorted Array of Unknown Size](/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README_EN.md) | `Array`,`Binary Search`,`Interactive` | Medium | 🔒 | +| 0703 | [Kth Largest Element in a Stream](/solution/0700-0799/0703.Kth%20Largest%20Element%20in%20a%20Stream/README_EN.md) | `Tree`,`Design`,`Binary Search Tree`,`Binary Tree`,`Data Stream`,`Heap (Priority Queue)` | Easy | | +| 0704 | [Binary Search](/solution/0700-0799/0704.Binary%20Search/README_EN.md) | `Array`,`Binary Search` | Easy | | +| 0705 | [Design HashSet](/solution/0700-0799/0705.Design%20HashSet/README_EN.md) | `Design`,`Array`,`Hash Table`,`Linked List`,`Hash Function` | Easy | | +| 0706 | [Design HashMap](/solution/0700-0799/0706.Design%20HashMap/README_EN.md) | `Design`,`Array`,`Hash Table`,`Linked List`,`Hash Function` | Easy | | +| 0707 | [Design Linked List](/solution/0700-0799/0707.Design%20Linked%20List/README_EN.md) | `Design`,`Linked List` | Medium | | +| 0708 | [Insert into a Sorted Circular Linked List](/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README_EN.md) | `Linked List` | Medium | 🔒 | +| 0709 | [To Lower Case](/solution/0700-0799/0709.To%20Lower%20Case/README_EN.md) | `String` | Easy | | +| 0710 | [Random Pick with Blacklist](/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README_EN.md) | `Array`,`Hash Table`,`Math`,`Binary Search`,`Sorting`,`Randomized` | Hard | | +| 0711 | [Number of Distinct Islands II](/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Hash Table`,`Hash Function` | Hard | 🔒 | +| 0712 | [Minimum ASCII Delete Sum for Two Strings](/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README_EN.md) | `String`,`Dynamic Programming` | Medium | | +| 0713 | [Subarray Product Less Than K](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README_EN.md) | `Array`,`Sliding Window` | Medium | | +| 0714 | [Best Time to Buy and Sell Stock with Transaction Fee](/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | | +| 0715 | [Range Module](/solution/0700-0799/0715.Range%20Module/README_EN.md) | `Design`,`Segment Tree`,`Ordered Set` | Hard | | +| 0716 | [Max Stack](/solution/0700-0799/0716.Max%20Stack/README_EN.md) | `Stack`,`Design`,`Linked List`,`Doubly-Linked List`,`Ordered Set` | Hard | 🔒 | +| 0717 | [1-bit and 2-bit Characters](/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README_EN.md) | `Array` | Easy | | +| 0718 | [Maximum Length of Repeated Subarray](/solution/0700-0799/0718.Maximum%20Length%20of%20Repeated%20Subarray/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Medium | | +| 0719 | [Find K-th Smallest Pair Distance](/solution/0700-0799/0719.Find%20K-th%20Smallest%20Pair%20Distance/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Hard | | +| 0720 | [Longest Word in Dictionary](/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | | +| 0721 | [Accounts Merge](/solution/0700-0799/0721.Accounts%20Merge/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | | +| 0722 | [Remove Comments](/solution/0700-0799/0722.Remove%20Comments/README_EN.md) | `Array`,`String` | Medium | | +| 0723 | [Candy Crush](/solution/0700-0799/0723.Candy%20Crush/README_EN.md) | `Array`,`Two Pointers`,`Matrix`,`Simulation` | Medium | 🔒 | +| 0724 | [Find Pivot Index](/solution/0700-0799/0724.Find%20Pivot%20Index/README_EN.md) | `Array`,`Prefix Sum` | Easy | | +| 0725 | [Split Linked List in Parts](/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README_EN.md) | `Linked List` | Medium | | +| 0726 | [Number of Atoms](/solution/0700-0799/0726.Number%20of%20Atoms/README_EN.md) | `Stack`,`Hash Table`,`String`,`Sorting` | Hard | | +| 0727 | [Minimum Window Subsequence](/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README_EN.md) | `String`,`Dynamic Programming`,`Sliding Window` | Hard | 🔒 | +| 0728 | [Self Dividing Numbers](/solution/0700-0799/0728.Self%20Dividing%20Numbers/README_EN.md) | `Math` | Easy | | +| 0729 | [My Calendar I](/solution/0700-0799/0729.My%20Calendar%20I/README_EN.md) | `Design`,`Segment Tree`,`Array`,`Binary Search`,`Ordered Set` | Medium | | +| 0730 | [Count Different Palindromic Subsequences](/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | | +| 0731 | [My Calendar II](/solution/0700-0799/0731.My%20Calendar%20II/README_EN.md) | `Design`,`Segment Tree`,`Array`,`Binary Search`,`Ordered Set`,`Prefix Sum` | Medium | | +| 0732 | [My Calendar III](/solution/0700-0799/0732.My%20Calendar%20III/README_EN.md) | `Design`,`Segment Tree`,`Binary Search`,`Ordered Set`,`Prefix Sum` | Hard | | +| 0733 | [Flood Fill](/solution/0700-0799/0733.Flood%20Fill/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Easy | | +| 0734 | [Sentence Similarity](/solution/0700-0799/0734.Sentence%20Similarity/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | 🔒 | +| 0735 | [Asteroid Collision](/solution/0700-0799/0735.Asteroid%20Collision/README_EN.md) | `Stack`,`Array`,`Simulation` | Medium | | +| 0736 | [Parse Lisp Expression](/solution/0700-0799/0736.Parse%20Lisp%20Expression/README_EN.md) | `Stack`,`Recursion`,`Hash Table`,`String` | Hard | | +| 0737 | [Sentence Similarity II](/solution/0700-0799/0737.Sentence%20Similarity%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String` | Medium | 🔒 | +| 0738 | [Monotone Increasing Digits](/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README_EN.md) | `Greedy`,`Math` | Medium | | +| 0739 | [Daily Temperatures](/solution/0700-0799/0739.Daily%20Temperatures/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | | +| 0740 | [Delete and Earn](/solution/0700-0799/0740.Delete%20and%20Earn/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Medium | | +| 0741 | [Cherry Pickup](/solution/0700-0799/0741.Cherry%20Pickup/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | | +| 0742 | [Closest Leaf in a Binary Tree](/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | +| 0743 | [Network Delay Time](/solution/0700-0799/0743.Network%20Delay%20Time/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Shortest Path`,`Heap (Priority Queue)` | Medium | | +| 0744 | [Find Smallest Letter Greater Than Target](/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README_EN.md) | `Array`,`Binary Search` | Easy | | +| 0745 | [Prefix and Suffix Search](/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README_EN.md) | `Design`,`Trie`,`Array`,`Hash Table`,`String` | Hard | | +| 0746 | [Min Cost Climbing Stairs](/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README_EN.md) | `Array`,`Dynamic Programming` | Easy | | +| 0747 | [Largest Number At Least Twice of Others](/solution/0700-0799/0747.Largest%20Number%20At%20Least%20Twice%20of%20Others/README_EN.md) | `Array`,`Sorting` | Easy | | +| 0748 | [Shortest Completing Word](/solution/0700-0799/0748.Shortest%20Completing%20Word/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | | +| 0749 | [Contain Virus](/solution/0700-0799/0749.Contain%20Virus/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`,`Simulation` | Hard | | +| 0750 | [Number Of Corner Rectangles](/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Matrix` | Medium | 🔒 | +| 0751 | [IP to CIDR](/solution/0700-0799/0751.IP%20to%20CIDR/README_EN.md) | `Bit Manipulation`,`String` | Medium | 🔒 | +| 0752 | [Open the Lock](/solution/0700-0799/0752.Open%20the%20Lock/README_EN.md) | `Breadth-First Search`,`Array`,`Hash Table`,`String` | Medium | | +| 0753 | [Cracking the Safe](/solution/0700-0799/0753.Cracking%20the%20Safe/README_EN.md) | `Depth-First Search`,`Graph`,`Eulerian Circuit` | Hard | | +| 0754 | [Reach a Number](/solution/0700-0799/0754.Reach%20a%20Number/README_EN.md) | `Math`,`Binary Search` | Medium | | +| 0755 | [Pour Water](/solution/0700-0799/0755.Pour%20Water/README_EN.md) | `Array`,`Simulation` | Medium | 🔒 | +| 0756 | [Pyramid Transition Matrix](/solution/0700-0799/0756.Pyramid%20Transition%20Matrix/README_EN.md) | `Bit Manipulation`,`Depth-First Search`,`Breadth-First Search` | Medium | | +| 0757 | [Set Intersection Size At Least Two](/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | | +| 0758 | [Bold Words in String](/solution/0700-0799/0758.Bold%20Words%20in%20String/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`String Matching` | Medium | 🔒 | +| 0759 | [Employee Free Time](/solution/0700-0799/0759.Employee%20Free%20Time/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Hard | 🔒 | +| 0760 | [Find Anagram Mappings](/solution/0700-0799/0760.Find%20Anagram%20Mappings/README_EN.md) | `Array`,`Hash Table` | Easy | 🔒 | +| 0761 | [Special Binary String](/solution/0700-0799/0761.Special%20Binary%20String/README_EN.md) | `Recursion`,`String` | Hard | | +| 0762 | [Prime Number of Set Bits in Binary Representation](/solution/0700-0799/0762.Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation/README_EN.md) | `Bit Manipulation`,`Math` | Easy | | +| 0763 | [Partition Labels](/solution/0700-0799/0763.Partition%20Labels/README_EN.md) | `Greedy`,`Hash Table`,`Two Pointers`,`String` | Medium | | +| 0764 | [Largest Plus Sign](/solution/0700-0799/0764.Largest%20Plus%20Sign/README_EN.md) | `Array`,`Dynamic Programming` | Medium | | +| 0765 | [Couples Holding Hands](/solution/0700-0799/0765.Couples%20Holding%20Hands/README_EN.md) | `Greedy`,`Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Hard | | +| 0766 | [Toeplitz Matrix](/solution/0700-0799/0766.Toeplitz%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | | +| 0767 | [Reorganize String](/solution/0700-0799/0767.Reorganize%20String/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | | +| 0768 | [Max Chunks To Make Sorted II](/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README_EN.md) | `Stack`,`Greedy`,`Array`,`Sorting`,`Monotonic Stack` | Hard | | +| 0769 | [Max Chunks To Make Sorted](/solution/0700-0799/0769.Max%20Chunks%20To%20Make%20Sorted/README_EN.md) | `Stack`,`Greedy`,`Array`,`Sorting`,`Monotonic Stack` | Medium | | +| 0770 | [Basic Calculator IV](/solution/0700-0799/0770.Basic%20Calculator%20IV/README_EN.md) | `Stack`,`Recursion`,`Hash Table`,`Math`,`String` | Hard | | +| 0771 | [Jewels and Stones](/solution/0700-0799/0771.Jewels%20and%20Stones/README_EN.md) | `Hash Table`,`String` | Easy | | +| 0772 | [Basic Calculator III](/solution/0700-0799/0772.Basic%20Calculator%20III/README_EN.md) | `Stack`,`Recursion`,`Math`,`String` | Hard | 🔒 | +| 0773 | [Sliding Puzzle](/solution/0700-0799/0773.Sliding%20Puzzle/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | | +| 0774 | [Minimize Max Distance to Gas Station](/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README_EN.md) | `Array`,`Binary Search` | Hard | 🔒 | +| 0775 | [Global and Local Inversions](/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README_EN.md) | `Array`,`Math` | Medium | | +| 0776 | [Split BST](/solution/0700-0799/0776.Split%20BST/README_EN.md) | `Tree`,`Binary Search Tree`,`Recursion`,`Binary Tree` | Medium | 🔒 | +| 0777 | [Swap Adjacent in LR String](/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README_EN.md) | `Two Pointers`,`String` | Medium | | +| 0778 | [Swim in Rising Water](/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)` | Hard | | +| 0779 | [K-th Symbol in Grammar](/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README_EN.md) | `Bit Manipulation`,`Recursion`,`Math` | Medium | | +| 0780 | [Reaching Points](/solution/0700-0799/0780.Reaching%20Points/README_EN.md) | `Math` | Hard | | +| 0781 | [Rabbits in Forest](/solution/0700-0799/0781.Rabbits%20in%20Forest/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Math` | Medium | | +| 0782 | [Transform to Chessboard](/solution/0700-0799/0782.Transform%20to%20Chessboard/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Matrix` | Hard | | +| 0783 | [Minimum Distance Between BST Nodes](/solution/0700-0799/0783.Minimum%20Distance%20Between%20BST%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Search Tree`,`Binary Tree` | Easy | | +| 0784 | [Letter Case Permutation](/solution/0700-0799/0784.Letter%20Case%20Permutation/README_EN.md) | `Bit Manipulation`,`String`,`Backtracking` | Medium | | +| 0785 | [Is Graph Bipartite](/solution/0700-0799/0785.Is%20Graph%20Bipartite/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | | +| 0786 | [K-th Smallest Prime Fraction](/solution/0700-0799/0786.K-th%20Smallest%20Prime%20Fraction/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting`,`Heap (Priority Queue)` | Medium | | +| 0787 | [Cheapest Flights Within K Stops](/solution/0700-0799/0787.Cheapest%20Flights%20Within%20K%20Stops/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Dynamic Programming`,`Shortest Path`,`Heap (Priority Queue)` | Medium | | +| 0788 | [Rotated Digits](/solution/0700-0799/0788.Rotated%20Digits/README_EN.md) | `Math`,`Dynamic Programming` | Medium | | +| 0789 | [Escape The Ghosts](/solution/0700-0799/0789.Escape%20The%20Ghosts/README_EN.md) | `Array`,`Math` | Medium | | +| 0790 | [Domino and Tromino Tiling](/solution/0700-0799/0790.Domino%20and%20Tromino%20Tiling/README_EN.md) | `Dynamic Programming` | Medium | | +| 0791 | [Custom Sort String](/solution/0700-0799/0791.Custom%20Sort%20String/README_EN.md) | `Hash Table`,`String`,`Sorting` | Medium | | +| 0792 | [Number of Matching Subsequences](/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | | +| 0793 | [Preimage Size of Factorial Zeroes Function](/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README_EN.md) | `Math`,`Binary Search` | Hard | | +| 0794 | [Valid Tic-Tac-Toe State](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README_EN.md) | `Array`,`Matrix` | Medium | | +| 0795 | [Number of Subarrays with Bounded Maximum](/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README_EN.md) | `Array`,`Two Pointers` | Medium | | +| 0796 | [Rotate String](/solution/0700-0799/0796.Rotate%20String/README_EN.md) | `String`,`String Matching` | Easy | | +| 0797 | [All Paths From Source to Target](/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Backtracking` | Medium | | +| 0798 | [Smallest Rotation with Highest Score](/solution/0700-0799/0798.Smallest%20Rotation%20with%20Highest%20Score/README_EN.md) | `Array`,`Prefix Sum` | Hard | | +| 0799 | [Champagne Tower](/solution/0700-0799/0799.Champagne%20Tower/README_EN.md) | `Dynamic Programming` | Medium | | +| 0800 | [Similar RGB Color](/solution/0800-0899/0800.Similar%20RGB%20Color/README_EN.md) | `Math`,`String`,`Enumeration` | Easy | 🔒 | +| 0801 | [Minimum Swaps To Make Sequences Increasing](/solution/0800-0899/0801.Minimum%20Swaps%20To%20Make%20Sequences%20Increasing/README_EN.md) | `Array`,`Dynamic Programming` | Hard | | +| 0802 | [Find Eventual Safe States](/solution/0800-0899/0802.Find%20Eventual%20Safe%20States/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | | +| 0803 | [Bricks Falling When Hit](/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README_EN.md) | `Union Find`,`Array`,`Matrix` | Hard | | +| 0804 | [Unique Morse Code Words](/solution/0800-0899/0804.Unique%20Morse%20Code%20Words/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | | +| 0805 | [Split Array With Same Average](/solution/0800-0899/0805.Split%20Array%20With%20Same%20Average/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Bitmask` | Hard | | +| 0806 | [Number of Lines To Write String](/solution/0800-0899/0806.Number%20of%20Lines%20To%20Write%20String/README_EN.md) | `Array`,`String` | Easy | | +| 0807 | [Max Increase to Keep City Skyline](/solution/0800-0899/0807.Max%20Increase%20to%20Keep%20City%20Skyline/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | | +| 0808 | [Soup Servings](/solution/0800-0899/0808.Soup%20Servings/README_EN.md) | `Math`,`Dynamic Programming`,`Probability and Statistics` | Medium | | +| 0809 | [Expressive Words](/solution/0800-0899/0809.Expressive%20Words/README_EN.md) | `Array`,`Two Pointers`,`String` | Medium | | +| 0810 | [Chalkboard XOR Game](/solution/0800-0899/0810.Chalkboard%20XOR%20Game/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array`,`Math`,`Game Theory` | Hard | | +| 0811 | [Subdomain Visit Count](/solution/0800-0899/0811.Subdomain%20Visit%20Count/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Medium | | +| 0812 | [Largest Triangle Area](/solution/0800-0899/0812.Largest%20Triangle%20Area/README_EN.md) | `Geometry`,`Array`,`Math` | Easy | | +| 0813 | [Largest Sum of Averages](/solution/0800-0899/0813.Largest%20Sum%20of%20Averages/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Medium | | +| 0814 | [Binary Tree Pruning](/solution/0800-0899/0814.Binary%20Tree%20Pruning/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | | +| 0815 | [Bus Routes](/solution/0800-0899/0815.Bus%20Routes/README_EN.md) | `Breadth-First Search`,`Array`,`Hash Table` | Hard | | +| 0816 | [Ambiguous Coordinates](/solution/0800-0899/0816.Ambiguous%20Coordinates/README_EN.md) | `String`,`Backtracking`,`Enumeration` | Medium | | +| 0817 | [Linked List Components](/solution/0800-0899/0817.Linked%20List%20Components/README_EN.md) | `Array`,`Hash Table`,`Linked List` | Medium | | +| 0818 | [Race Car](/solution/0800-0899/0818.Race%20Car/README_EN.md) | `Dynamic Programming` | Hard | | +| 0819 | [Most Common Word](/solution/0800-0899/0819.Most%20Common%20Word/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Easy | | +| 0820 | [Short Encoding of Words](/solution/0800-0899/0820.Short%20Encoding%20of%20Words/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | | +| 0821 | [Shortest Distance to a Character](/solution/0800-0899/0821.Shortest%20Distance%20to%20a%20Character/README_EN.md) | `Array`,`Two Pointers`,`String` | Easy | | +| 0822 | [Card Flipping Game](/solution/0800-0899/0822.Card%20Flipping%20Game/README_EN.md) | `Array`,`Hash Table` | Medium | | +| 0823 | [Binary Trees With Factors](/solution/0800-0899/0823.Binary%20Trees%20With%20Factors/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming`,`Sorting` | Medium | | +| 0824 | [Goat Latin](/solution/0800-0899/0824.Goat%20Latin/README_EN.md) | `String` | Easy | | +| 0825 | [Friends Of Appropriate Ages](/solution/0800-0899/0825.Friends%20Of%20Appropriate%20Ages/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | | +| 0826 | [Most Profit Assigning Work](/solution/0800-0899/0826.Most%20Profit%20Assigning%20Work/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | | +| 0827 | [Making A Large Island](/solution/0800-0899/0827.Making%20A%20Large%20Island/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Hard | | +| 0828 | [Count Unique Characters of All Substrings of a Given String](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming` | Hard | Weekly Contest 83 | +| 0829 | [Consecutive Numbers Sum](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README_EN.md) | `Math`,`Enumeration` | Hard | Weekly Contest 83 | +| 0830 | [Positions of Large Groups](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README_EN.md) | `String` | Easy | Weekly Contest 83 | +| 0831 | [Masking Personal Information](/solution/0800-0899/0831.Masking%20Personal%20Information/README_EN.md) | `String` | Medium | Weekly Contest 83 | +| 0832 | [Flipping an Image](/solution/0800-0899/0832.Flipping%20an%20Image/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Matrix`,`Simulation` | Easy | Weekly Contest 84 | +| 0833 | [Find And Replace in String](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README_EN.md) | `Array`,`String`,`Sorting` | Medium | Weekly Contest 84 | +| 0834 | [Sum of Distances in Tree](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Dynamic Programming` | Hard | Weekly Contest 84 | +| 0835 | [Image Overlap](/solution/0800-0899/0835.Image%20Overlap/README_EN.md) | `Array`,`Matrix` | Medium | Weekly Contest 84 | +| 0836 | [Rectangle Overlap](/solution/0800-0899/0836.Rectangle%20Overlap/README_EN.md) | `Geometry`,`Math` | Easy | Weekly Contest 85 | +| 0837 | [New 21 Game](/solution/0800-0899/0837.New%2021%20Game/README_EN.md) | `Math`,`Dynamic Programming`,`Sliding Window`,`Probability and Statistics` | Medium | Weekly Contest 85 | +| 0838 | [Push Dominoes](/solution/0800-0899/0838.Push%20Dominoes/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Medium | Weekly Contest 85 | +| 0839 | [Similar String Groups](/solution/0800-0899/0839.Similar%20String%20Groups/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String` | Hard | Weekly Contest 85 | +| 0840 | [Magic Squares In Grid](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README_EN.md) | `Array`,`Hash Table`,`Math`,`Matrix` | Medium | Weekly Contest 86 | +| 0841 | [Keys and Rooms](/solution/0800-0899/0841.Keys%20and%20Rooms/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 86 | +| 0842 | [Split Array into Fibonacci Sequence](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README_EN.md) | `String`,`Backtracking` | Medium | Weekly Contest 86 | +| 0843 | [Guess the Word](/solution/0800-0899/0843.Guess%20the%20Word/README_EN.md) | `Array`,`Math`,`String`,`Game Theory`,`Interactive` | Hard | Weekly Contest 86 | +| 0844 | [Backspace String Compare](/solution/0800-0899/0844.Backspace%20String%20Compare/README_EN.md) | `Stack`,`Two Pointers`,`String`,`Simulation` | Easy | Weekly Contest 87 | +| 0845 | [Longest Mountain in Array](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README_EN.md) | `Array`,`Two Pointers`,`Dynamic Programming`,`Enumeration` | Medium | Weekly Contest 87 | +| 0846 | [Hand of Straights](/solution/0800-0899/0846.Hand%20of%20Straights/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 87 | +| 0847 | [Shortest Path Visiting All Nodes](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Graph`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 87 | +| 0848 | [Shifting Letters](/solution/0800-0899/0848.Shifting%20Letters/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Weekly Contest 88 | +| 0849 | [Maximize Distance to Closest Person](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README_EN.md) | `Array` | Medium | Weekly Contest 88 | +| 0850 | [Rectangle Area II](/solution/0800-0899/0850.Rectangle%20Area%20II/README_EN.md) | `Segment Tree`,`Array`,`Ordered Set`,`Line Sweep` | Hard | Weekly Contest 88 | +| 0851 | [Loud and Rich](/solution/0800-0899/0851.Loud%20and%20Rich/README_EN.md) | `Depth-First Search`,`Graph`,`Topological Sort`,`Array` | Medium | Weekly Contest 88 | +| 0852 | [Peak Index in a Mountain Array](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 89 | +| 0853 | [Car Fleet](/solution/0800-0899/0853.Car%20Fleet/README_EN.md) | `Stack`,`Array`,`Sorting`,`Monotonic Stack` | Medium | Weekly Contest 89 | +| 0854 | [K-Similar Strings](/solution/0800-0899/0854.K-Similar%20Strings/README_EN.md) | `Breadth-First Search`,`String` | Hard | Weekly Contest 89 | +| 0855 | [Exam Room](/solution/0800-0899/0855.Exam%20Room/README_EN.md) | `Design`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 89 | +| 0856 | [Score of Parentheses](/solution/0800-0899/0856.Score%20of%20Parentheses/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 90 | +| 0857 | [Minimum Cost to Hire K Workers](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 90 | +| 0858 | [Mirror Reflection](/solution/0800-0899/0858.Mirror%20Reflection/README_EN.md) | `Geometry`,`Math`,`Number Theory` | Medium | Weekly Contest 90 | +| 0859 | [Buddy Strings](/solution/0800-0899/0859.Buddy%20Strings/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 90 | +| 0860 | [Lemonade Change](/solution/0800-0899/0860.Lemonade%20Change/README_EN.md) | `Greedy`,`Array` | Easy | Weekly Contest 91 | +| 0861 | [Score After Flipping Matrix](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Matrix` | Medium | Weekly Contest 91 | +| 0862 | [Shortest Subarray with Sum at Least K](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README_EN.md) | `Queue`,`Array`,`Binary Search`,`Prefix Sum`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | Weekly Contest 91 | +| 0863 | [All Nodes Distance K in Binary Tree](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 91 | +| 0864 | [Shortest Path to Get All Keys](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array`,`Matrix` | Hard | Weekly Contest 92 | +| 0865 | [Smallest Subtree with all the Deepest Nodes](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 92 | +| 0866 | [Prime Palindrome](/solution/0800-0899/0866.Prime%20Palindrome/README_EN.md) | `Math`,`Number Theory` | Medium | Weekly Contest 92 | +| 0867 | [Transpose Matrix](/solution/0800-0899/0867.Transpose%20Matrix/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Weekly Contest 92 | +| 0868 | [Binary Gap](/solution/0800-0899/0868.Binary%20Gap/README_EN.md) | `Bit Manipulation` | Easy | Weekly Contest 93 | +| 0869 | [Reordered Power of 2](/solution/0800-0899/0869.Reordered%20Power%20of%202/README_EN.md) | `Hash Table`,`Math`,`Counting`,`Enumeration`,`Sorting` | Medium | Weekly Contest 93 | +| 0870 | [Advantage Shuffle](/solution/0800-0899/0870.Advantage%20Shuffle/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 93 | +| 0871 | [Minimum Number of Refueling Stops](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Heap (Priority Queue)` | Hard | Weekly Contest 93 | +| 0872 | [Leaf-Similar Trees](/solution/0800-0899/0872.Leaf-Similar%20Trees/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | Weekly Contest 94 | +| 0873 | [Length of Longest Fibonacci Subsequence](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Medium | Weekly Contest 94 | +| 0874 | [Walking Robot Simulation](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 94 | +| 0875 | [Koko Eating Bananas](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 94 | +| 0876 | [Middle of the Linked List](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Easy | Weekly Contest 95 | +| 0877 | [Stone Game](/solution/0800-0899/0877.Stone%20Game/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | Weekly Contest 95 | +| 0878 | [Nth Magical Number](/solution/0800-0899/0878.Nth%20Magical%20Number/README_EN.md) | `Math`,`Binary Search` | Hard | Weekly Contest 95 | +| 0879 | [Profitable Schemes](/solution/0800-0899/0879.Profitable%20Schemes/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 95 | +| 0880 | [Decoded String at Index](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 96 | +| 0881 | [Boats to Save People](/solution/0800-0899/0881.Boats%20to%20Save%20People/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 96 | +| 0882 | [Reachable Nodes In Subdivided Graph](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 96 | +| 0883 | [Projection Area of 3D Shapes](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README_EN.md) | `Geometry`,`Array`,`Math`,`Matrix` | Easy | Weekly Contest 96 | +| 0884 | [Uncommon Words from Two Sentences](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 97 | +| 0885 | [Spiral Matrix III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 97 | +| 0886 | [Possible Bipartition](/solution/0800-0899/0886.Possible%20Bipartition/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Weekly Contest 97 | +| 0887 | [Super Egg Drop](/solution/0800-0899/0887.Super%20Egg%20Drop/README_EN.md) | `Math`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 97 | +| 0888 | [Fair Candy Swap](/solution/0800-0899/0888.Fair%20Candy%20Swap/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sorting` | Easy | Weekly Contest 98 | +| 0889 | [Construct Binary Tree from Preorder and Postorder Traversal](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README_EN.md) | `Tree`,`Array`,`Hash Table`,`Divide and Conquer`,`Binary Tree` | Medium | Weekly Contest 98 | +| 0890 | [Find and Replace Pattern](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 98 | +| 0891 | [Sum of Subsequence Widths](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README_EN.md) | `Array`,`Math`,`Sorting` | Hard | Weekly Contest 98 | +| 0892 | [Surface Area of 3D Shapes](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README_EN.md) | `Geometry`,`Array`,`Math`,`Matrix` | Easy | Weekly Contest 99 | +| 0893 | [Groups of Special-Equivalent Strings](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 99 | +| 0894 | [All Possible Full Binary Trees](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README_EN.md) | `Tree`,`Recursion`,`Memoization`,`Dynamic Programming`,`Binary Tree` | Medium | Weekly Contest 99 | +| 0895 | [Maximum Frequency Stack](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README_EN.md) | `Stack`,`Design`,`Hash Table`,`Ordered Set` | Hard | Weekly Contest 99 | +| 0896 | [Monotonic Array](/solution/0800-0899/0896.Monotonic%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 100 | +| 0897 | [Increasing Order Search Tree](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Easy | Weekly Contest 100 | +| 0898 | [Bitwise ORs of Subarrays](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 100 | +| 0899 | [Orderly Queue](/solution/0800-0899/0899.Orderly%20Queue/README_EN.md) | `Math`,`String`,`Sorting` | Hard | Weekly Contest 100 | +| 0900 | [RLE Iterator](/solution/0900-0999/0900.RLE%20Iterator/README_EN.md) | `Design`,`Array`,`Counting`,`Iterator` | Medium | Weekly Contest 101 | +| 0901 | [Online Stock Span](/solution/0900-0999/0901.Online%20Stock%20Span/README_EN.md) | `Stack`,`Design`,`Data Stream`,`Monotonic Stack` | Medium | Weekly Contest 101 | +| 0902 | [Numbers At Most N Given Digit Set](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README_EN.md) | `Array`,`Math`,`String`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 101 | +| 0903 | [Valid Permutations for DI Sequence](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 101 | +| 0904 | [Fruit Into Baskets](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 102 | +| 0905 | [Sort Array By Parity](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 102 | +| 0906 | [Super Palindromes](/solution/0900-0999/0906.Super%20Palindromes/README_EN.md) | `Math`,`Enumeration` | Hard | Weekly Contest 102 | +| 0907 | [Sum of Subarray Minimums](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Medium | Weekly Contest 102 | +| 0908 | [Smallest Range I](/solution/0900-0999/0908.Smallest%20Range%20I/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 103 | +| 0909 | [Snakes and Ladders](/solution/0900-0999/0909.Snakes%20and%20Ladders/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 103 | +| 0910 | [Smallest Range II](/solution/0900-0999/0910.Smallest%20Range%20II/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Medium | Weekly Contest 103 | +| 0911 | [Online Election](/solution/0900-0999/0911.Online%20Election/README_EN.md) | `Design`,`Array`,`Hash Table`,`Binary Search` | Medium | Weekly Contest 103 | +| 0912 | [Sort an Array](/solution/0900-0999/0912.Sort%20an%20Array/README_EN.md) | `Array`,`Divide and Conquer`,`Bucket Sort`,`Counting Sort`,`Radix Sort`,`Sorting`,`Heap (Priority Queue)`,`Merge Sort` | Medium | | +| 0913 | [Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README_EN.md) | `Graph`,`Topological Sort`,`Memoization`,`Math`,`Dynamic Programming`,`Game Theory` | Hard | Weekly Contest 104 | +| 0914 | [X of a Kind in a Deck of Cards](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory` | Easy | Weekly Contest 104 | +| 0915 | [Partition Array into Disjoint Intervals](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README_EN.md) | `Array` | Medium | Weekly Contest 104 | +| 0916 | [Word Subsets](/solution/0900-0999/0916.Word%20Subsets/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 104 | +| 0917 | [Reverse Only Letters](/solution/0900-0999/0917.Reverse%20Only%20Letters/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 105 | +| 0918 | [Maximum Sum Circular Subarray](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README_EN.md) | `Queue`,`Array`,`Divide and Conquer`,`Dynamic Programming`,`Monotonic Queue` | Medium | Weekly Contest 105 | +| 0919 | [Complete Binary Tree Inserter](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README_EN.md) | `Tree`,`Breadth-First Search`,`Design`,`Binary Tree` | Medium | Weekly Contest 105 | +| 0920 | [Number of Music Playlists](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 105 | +| 0921 | [Minimum Add to Make Parentheses Valid](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README_EN.md) | `Stack`,`Greedy`,`String` | Medium | Weekly Contest 106 | +| 0922 | [Sort Array By Parity II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 106 | +| 0923 | [3Sum With Multiplicity](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Counting`,`Sorting` | Medium | Weekly Contest 106 | +| 0924 | [Minimize Malware Spread](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table` | Hard | Weekly Contest 106 | +| 0925 | [Long Pressed Name](/solution/0900-0999/0925.Long%20Pressed%20Name/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 107 | +| 0926 | [Flip String to Monotone Increasing](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README_EN.md) | `String`,`Dynamic Programming` | Medium | Weekly Contest 107 | +| 0927 | [Three Equal Parts](/solution/0900-0999/0927.Three%20Equal%20Parts/README_EN.md) | `Array`,`Math` | Hard | Weekly Contest 107 | +| 0928 | [Minimize Malware Spread II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table` | Hard | Weekly Contest 107 | +| 0929 | [Unique Email Addresses](/solution/0900-0999/0929.Unique%20Email%20Addresses/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 108 | +| 0930 | [Binary Subarrays With Sum](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 108 | +| 0931 | [Minimum Falling Path Sum](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 108 | +| 0932 | [Beautiful Array](/solution/0900-0999/0932.Beautiful%20Array/README_EN.md) | `Array`,`Math`,`Divide and Conquer` | Medium | Weekly Contest 108 | +| 0933 | [Number of Recent Calls](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README_EN.md) | `Design`,`Queue`,`Data Stream` | Easy | Weekly Contest 109 | +| 0934 | [Shortest Bridge](/solution/0900-0999/0934.Shortest%20Bridge/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 109 | +| 0935 | [Knight Dialer](/solution/0900-0999/0935.Knight%20Dialer/README_EN.md) | `Dynamic Programming` | Medium | Weekly Contest 109 | +| 0936 | [Stamping The Sequence](/solution/0900-0999/0936.Stamping%20The%20Sequence/README_EN.md) | `Stack`,`Greedy`,`Queue`,`String` | Hard | Weekly Contest 109 | +| 0937 | [Reorder Data in Log Files](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README_EN.md) | `Array`,`String`,`Sorting` | Medium | Weekly Contest 110 | +| 0938 | [Range Sum of BST](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Easy | Weekly Contest 110 | +| 0939 | [Minimum Area Rectangle](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README_EN.md) | `Geometry`,`Array`,`Hash Table`,`Math`,`Sorting` | Medium | Weekly Contest 110 | +| 0940 | [Distinct Subsequences II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 110 | +| 0941 | [Valid Mountain Array](/solution/0900-0999/0941.Valid%20Mountain%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 111 | +| 0942 | [DI String Match](/solution/0900-0999/0942.DI%20String%20Match/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`String` | Easy | Weekly Contest 111 | +| 0943 | [Find the Shortest Superstring](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README_EN.md) | `Bit Manipulation`,`Array`,`String`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 111 | +| 0944 | [Delete Columns to Make Sorted](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 111 | +| 0945 | [Minimum Increment to Make Array Unique](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README_EN.md) | `Greedy`,`Array`,`Counting`,`Sorting` | Medium | Weekly Contest 112 | +| 0946 | [Validate Stack Sequences](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README_EN.md) | `Stack`,`Array`,`Simulation` | Medium | Weekly Contest 112 | +| 0947 | [Most Stones Removed with Same Row or Column](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README_EN.md) | `Depth-First Search`,`Union Find`,`Graph`,`Hash Table` | Medium | Weekly Contest 112 | +| 0948 | [Bag of Tokens](/solution/0900-0999/0948.Bag%20of%20Tokens/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 112 | +| 0949 | [Largest Time for Given Digits](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README_EN.md) | `Array`,`String`,`Enumeration` | Medium | Weekly Contest 113 | +| 0950 | [Reveal Cards In Increasing Order](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README_EN.md) | `Queue`,`Array`,`Sorting`,`Simulation` | Medium | Weekly Contest 113 | +| 0951 | [Flip Equivalent Binary Trees](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 113 | +| 0952 | [Largest Component Size by Common Factor](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README_EN.md) | `Union Find`,`Array`,`Hash Table`,`Math`,`Number Theory` | Hard | Weekly Contest 113 | +| 0953 | [Verifying an Alien Dictionary](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 114 | +| 0954 | [Array of Doubled Pairs](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 114 | +| 0955 | [Delete Columns to Make Sorted II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README_EN.md) | `Greedy`,`Array`,`String` | Medium | Weekly Contest 114 | +| 0956 | [Tallest Billboard](/solution/0900-0999/0956.Tallest%20Billboard/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 114 | +| 0957 | [Prison Cells After N Days](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Math` | Medium | Weekly Contest 115 | +| 0958 | [Check Completeness of a Binary Tree](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 115 | +| 0959 | [Regions Cut By Slashes](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 115 | +| 0960 | [Delete Columns to Make Sorted III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Hard | Weekly Contest 115 | +| 0961 | [N-Repeated Element in Size 2N Array](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 116 | +| 0962 | [Maximum Width Ramp](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 116 | +| 0963 | [Minimum Area Rectangle II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README_EN.md) | `Geometry`,`Array`,`Math` | Medium | Weekly Contest 116 | +| 0964 | [Least Operators to Express Number](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming` | Hard | Weekly Contest 116 | +| 0965 | [Univalued Binary Tree](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | Weekly Contest 117 | +| 0966 | [Vowel Spellchecker](/solution/0900-0999/0966.Vowel%20Spellchecker/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 117 | +| 0967 | [Numbers With Same Consecutive Differences](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README_EN.md) | `Breadth-First Search`,`Backtracking` | Medium | Weekly Contest 117 | +| 0968 | [Binary Tree Cameras](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Hard | Weekly Contest 117 | +| 0969 | [Pancake Sorting](/solution/0900-0999/0969.Pancake%20Sorting/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 118 | +| 0970 | [Powerful Integers](/solution/0900-0999/0970.Powerful%20Integers/README_EN.md) | `Hash Table`,`Math`,`Enumeration` | Medium | Weekly Contest 118 | +| 0971 | [Flip Binary Tree To Match Preorder Traversal](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 118 | +| 0972 | [Equal Rational Numbers](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README_EN.md) | `Math`,`String` | Hard | Weekly Contest 118 | +| 0973 | [K Closest Points to Origin](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README_EN.md) | `Geometry`,`Array`,`Math`,`Divide and Conquer`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 119 | +| 0974 | [Subarray Sums Divisible by K](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 119 | +| 0975 | [Odd Even Jump](/solution/0900-0999/0975.Odd%20Even%20Jump/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Ordered Set`,`Monotonic Stack` | Hard | Weekly Contest 119 | +| 0976 | [Largest Perimeter Triangle](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Easy | Weekly Contest 119 | +| 0977 | [Squares of a Sorted Array](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 120 | +| 0978 | [Longest Turbulent Subarray](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | Weekly Contest 120 | +| 0979 | [Distribute Coins in Binary Tree](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 120 | +| 0980 | [Unique Paths III](/solution/0900-0999/0980.Unique%20Paths%20III/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Matrix` | Hard | Weekly Contest 120 | +| 0981 | [Time Based Key-Value Store](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README_EN.md) | `Design`,`Hash Table`,`String`,`Binary Search` | Medium | Weekly Contest 121 | +| 0982 | [Triples with Bitwise AND Equal To Zero](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Hard | Weekly Contest 121 | +| 0983 | [Minimum Cost For Tickets](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 121 | +| 0984 | [String Without AAA or BBB](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 121 | +| 0985 | [Sum of Even Numbers After Queries](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 122 | +| 0986 | [Interval List Intersections](/solution/0900-0999/0986.Interval%20List%20Intersections/README_EN.md) | `Array`,`Two Pointers` | Medium | Weekly Contest 122 | +| 0987 | [Vertical Order Traversal of a Binary Tree](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree`,`Sorting` | Hard | Weekly Contest 122 | +| 0988 | [Smallest String Starting From Leaf](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Backtracking`,`Binary Tree` | Medium | Weekly Contest 122 | +| 0989 | [Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 123 | +| 0990 | [Satisfiability of Equality Equations](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README_EN.md) | `Union Find`,`Graph`,`Array`,`String` | Medium | Weekly Contest 123 | +| 0991 | [Broken Calculator](/solution/0900-0999/0991.Broken%20Calculator/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 123 | +| 0992 | [Subarrays with K Different Integers](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sliding Window` | Hard | Weekly Contest 123 | +| 0993 | [Cousins in Binary Tree](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | Weekly Contest 124 | +| 0994 | [Rotting Oranges](/solution/0900-0999/0994.Rotting%20Oranges/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 124 | +| 0995 | [Minimum Number of K Consecutive Bit Flips](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README_EN.md) | `Bit Manipulation`,`Queue`,`Array`,`Prefix Sum`,`Sliding Window` | Hard | Weekly Contest 124 | +| 0996 | [Number of Squareful Arrays](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Math`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | Weekly Contest 124 | +| 0997 | [Find the Town Judge](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README_EN.md) | `Graph`,`Array`,`Hash Table` | Easy | Weekly Contest 125 | +| 0998 | [Maximum Binary Tree II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README_EN.md) | `Tree`,`Binary Tree` | Medium | Weekly Contest 125 | +| 0999 | [Available Captures for Rook](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Weekly Contest 125 | +| 1000 | [Minimum Cost to Merge Stones](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 126 | +| 1001 | [Grid Illumination](/solution/1000-1099/1001.Grid%20Illumination/README_EN.md) | `Array`,`Hash Table` | Hard | Weekly Contest 125 | +| 1002 | [Find Common Characters](/solution/1000-1099/1002.Find%20Common%20Characters/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 126 | +| 1003 | [Check If Word Is Valid After Substitutions](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 126 | +| 1004 | [Max Consecutive Ones III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 126 | +| 1005 | [Maximize Sum Of Array After K Negations](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 127 | +| 1006 | [Clumsy Factorial](/solution/1000-1099/1006.Clumsy%20Factorial/README_EN.md) | `Stack`,`Math`,`Simulation` | Medium | Weekly Contest 127 | +| 1007 | [Minimum Domino Rotations For Equal Row](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 127 | +| 1008 | [Construct Binary Search Tree from Preorder Traversal](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README_EN.md) | `Stack`,`Tree`,`Binary Search Tree`,`Array`,`Binary Tree`,`Monotonic Stack` | Medium | Weekly Contest 127 | +| 1009 | [Complement of Base 10 Integer](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README_EN.md) | `Bit Manipulation` | Easy | Weekly Contest 128 | +| 1010 | [Pairs of Songs With Total Durations Divisible by 60](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 128 | +| 1011 | [Capacity To Ship Packages Within D Days](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 128 | +| 1012 | [Numbers With Repeated Digits](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Weekly Contest 128 | +| 1013 | [Partition Array Into Three Parts With Equal Sum](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README_EN.md) | `Greedy`,`Array` | Easy | Weekly Contest 129 | +| 1014 | [Best Sightseeing Pair](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 129 | +| 1015 | [Smallest Integer Divisible by K](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README_EN.md) | `Hash Table`,`Math` | Medium | Weekly Contest 129 | +| 1016 | [Binary String With Substrings Representing 1 To N](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README_EN.md) | `String` | Medium | Weekly Contest 129 | +| 1017 | [Convert to Base -2](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README_EN.md) | `Math` | Medium | Weekly Contest 130 | +| 1018 | [Binary Prefix Divisible By 5](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 130 | +| 1019 | [Next Greater Node In Linked List](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README_EN.md) | `Stack`,`Array`,`Linked List`,`Monotonic Stack` | Medium | Weekly Contest 130 | +| 1020 | [Number of Enclaves](/solution/1000-1099/1020.Number%20of%20Enclaves/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Weekly Contest 130 | +| 1021 | [Remove Outermost Parentheses](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 131 | +| 1022 | [Sum of Root To Leaf Binary Numbers](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | Weekly Contest 131 | +| 1023 | [Camelcase Matching](/solution/1000-1099/1023.Camelcase%20Matching/README_EN.md) | `Trie`,`Array`,`Two Pointers`,`String`,`String Matching` | Medium | Weekly Contest 131 | +| 1024 | [Video Stitching](/solution/1000-1099/1024.Video%20Stitching/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 131 | +| 1025 | [Divisor Game](/solution/1000-1099/1025.Divisor%20Game/README_EN.md) | `Brainteaser`,`Math`,`Dynamic Programming`,`Game Theory` | Easy | Weekly Contest 132 | +| 1026 | [Maximum Difference Between Node and Ancestor](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 132 | +| 1027 | [Longest Arithmetic Subsequence](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming` | Medium | Weekly Contest 132 | +| 1028 | [Recover a Tree From Preorder Traversal](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Binary Tree` | Hard | Weekly Contest 132 | +| 1029 | [Two City Scheduling](/solution/1000-1099/1029.Two%20City%20Scheduling/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 133 | +| 1030 | [Matrix Cells in Distance Order](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README_EN.md) | `Geometry`,`Array`,`Math`,`Matrix`,`Sorting` | Easy | Weekly Contest 133 | +| 1031 | [Maximum Sum of Two Non-Overlapping Subarrays](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | Weekly Contest 133 | +| 1032 | [Stream of Characters](/solution/1000-1099/1032.Stream%20of%20Characters/README_EN.md) | `Design`,`Trie`,`Array`,`String`,`Data Stream` | Hard | Weekly Contest 133 | +| 1033 | [Moving Stones Until Consecutive](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README_EN.md) | `Brainteaser`,`Math` | Medium | Weekly Contest 134 | +| 1034 | [Coloring A Border](/solution/1000-1099/1034.Coloring%20A%20Border/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 134 | +| 1035 | [Uncrossed Lines](/solution/1000-1099/1035.Uncrossed%20Lines/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 134 | +| 1036 | [Escape a Large Maze](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table` | Hard | Weekly Contest 134 | +| 1037 | [Valid Boomerang](/solution/1000-1099/1037.Valid%20Boomerang/README_EN.md) | `Geometry`,`Array`,`Math` | Easy | Weekly Contest 135 | +| 1038 | [Binary Search Tree to Greater Sum Tree](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree` | Medium | Weekly Contest 135 | +| 1039 | [Minimum Score Triangulation of Polygon](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 135 | +| 1040 | [Moving Stones Until Consecutive II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README_EN.md) | `Array`,`Math`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 135 | +| 1041 | [Robot Bounded In Circle](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README_EN.md) | `Math`,`String`,`Simulation` | Medium | Weekly Contest 136 | +| 1042 | [Flower Planting With No Adjacent](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 136 | +| 1043 | [Partition Array for Maximum Sum](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 136 | +| 1044 | [Longest Duplicate Substring](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README_EN.md) | `String`,`Binary Search`,`Suffix Array`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 136 | +| 1045 | [Customers Who Bought All Products](/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README_EN.md) | `Database` | Medium | | +| 1046 | [Last Stone Weight](/solution/1000-1099/1046.Last%20Stone%20Weight/README_EN.md) | `Array`,`Heap (Priority Queue)` | Easy | Weekly Contest 137 | +| 1047 | [Remove All Adjacent Duplicates In String](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 137 | +| 1048 | [Longest String Chain](/solution/1000-1099/1048.Longest%20String%20Chain/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`String`,`Dynamic Programming` | Medium | Weekly Contest 137 | +| 1049 | [Last Stone Weight II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 137 | +| 1050 | [Actors and Directors Who Cooperated At Least Three Times](/solution/1000-1099/1050.Actors%20and%20Directors%20Who%20Cooperated%20At%20Least%20Three%20Times/README_EN.md) | `Database` | Easy | | +| 1051 | [Height Checker](/solution/1000-1099/1051.Height%20Checker/README_EN.md) | `Array`,`Counting Sort`,`Sorting` | Easy | Weekly Contest 138 | +| 1052 | [Grumpy Bookstore Owner](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 138 | +| 1053 | [Previous Permutation With One Swap](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 138 | +| 1054 | [Distant Barcodes](/solution/1000-1099/1054.Distant%20Barcodes/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 138 | +| 1055 | [Shortest Way to Form String](/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | 🔒 | +| 1056 | [Confusing Number](/solution/1000-1099/1056.Confusing%20Number/README_EN.md) | `Math` | Easy | 🔒 | +| 1057 | [Campus Bikes](/solution/1000-1099/1057.Campus%20Bikes/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | +| 1058 | [Minimize Rounding Error to Meet Target](/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README_EN.md) | `Greedy`,`Array`,`Math`,`String`,`Sorting` | Medium | 🔒 | +| 1059 | [All Paths from Source Lead to Destination](/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README_EN.md) | `Graph`,`Topological Sort` | Medium | 🔒 | +| 1060 | [Missing Element in Sorted Array](/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 | +| 1061 | [Lexicographically Smallest Equivalent String](/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README_EN.md) | `Union Find`,`String` | Medium | | +| 1062 | [Longest Repeating Substring](/solution/1000-1099/1062.Longest%20Repeating%20Substring/README_EN.md) | `String`,`Binary Search`,`Dynamic Programming`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Medium | 🔒 | +| 1063 | [Number of Valid Subarrays](/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Hard | 🔒 | +| 1064 | [Fixed Point](/solution/1000-1099/1064.Fixed%20Point/README_EN.md) | `Array`,`Binary Search` | Easy | Biweekly Contest 1 | +| 1065 | [Index Pairs of a String](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README_EN.md) | `Trie`,`Array`,`String`,`Sorting` | Easy | Biweekly Contest 1 | +| 1066 | [Campus Bikes II](/solution/1000-1099/1066.Campus%20Bikes%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Biweekly Contest 1 | +| 1067 | [Digit Count in Range](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Biweekly Contest 1 | +| 1068 | [Product Sales Analysis I](/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README_EN.md) | `Database` | Easy | | +| 1069 | [Product Sales Analysis II](/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README_EN.md) | `Database` | Easy | 🔒 | +| 1070 | [Product Sales Analysis III](/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README_EN.md) | `Database` | Medium | | +| 1071 | [Greatest Common Divisor of Strings](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 139 | +| 1072 | [Flip Columns For Maximum Number of Equal Rows](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 139 | +| 1073 | [Adding Two Negabinary Numbers](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 139 | +| 1074 | [Number of Submatrices That Sum to Target](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README_EN.md) | `Array`,`Hash Table`,`Matrix`,`Prefix Sum` | Hard | Weekly Contest 139 | +| 1075 | [Project Employees I](/solution/1000-1099/1075.Project%20Employees%20I/README_EN.md) | `Database` | Easy | | +| 1076 | [Project Employees II](/solution/1000-1099/1076.Project%20Employees%20II/README_EN.md) | `Database` | Easy | 🔒 | +| 1077 | [Project Employees III](/solution/1000-1099/1077.Project%20Employees%20III/README_EN.md) | `Database` | Medium | 🔒 | +| 1078 | [Occurrences After Bigram](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README_EN.md) | `String` | Easy | Weekly Contest 140 | +| 1079 | [Letter Tile Possibilities](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README_EN.md) | `Hash Table`,`String`,`Backtracking`,`Counting` | Medium | Weekly Contest 140 | +| 1080 | [Insufficient Nodes in Root to Leaf Paths](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 140 | +| 1081 | [Smallest Subsequence of Distinct Characters](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Medium | Weekly Contest 140 | +| 1082 | [Sales Analysis I](/solution/1000-1099/1082.Sales%20Analysis%20I/README_EN.md) | `Database` | Easy | 🔒 | +| 1083 | [Sales Analysis II](/solution/1000-1099/1083.Sales%20Analysis%20II/README_EN.md) | `Database` | Easy | 🔒 | +| 1084 | [Sales Analysis III](/solution/1000-1099/1084.Sales%20Analysis%20III/README_EN.md) | `Database` | Easy | | +| 1085 | [Sum of Digits in the Minimum Number](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 2 | +| 1086 | [High Five](/solution/1000-1099/1086.High%20Five/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Easy | Biweekly Contest 2 | +| 1087 | [Brace Expansion](/solution/1000-1099/1087.Brace%20Expansion/README_EN.md) | `Breadth-First Search`,`String`,`Backtracking` | Medium | Biweekly Contest 2 | +| 1088 | [Confusing Number II](/solution/1000-1099/1088.Confusing%20Number%20II/README_EN.md) | `Math`,`Backtracking` | Hard | Biweekly Contest 2 | +| 1089 | [Duplicate Zeros](/solution/1000-1099/1089.Duplicate%20Zeros/README_EN.md) | `Array`,`Two Pointers` | Easy | Weekly Contest 141 | +| 1090 | [Largest Values From Labels](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Weekly Contest 141 | +| 1091 | [Shortest Path in Binary Matrix](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Weekly Contest 141 | +| 1092 | [Shortest Common Supersequence](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 141 | +| 1093 | [Statistics from a Large Sample](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README_EN.md) | `Array`,`Math`,`Probability and Statistics` | Medium | Weekly Contest 142 | +| 1094 | [Car Pooling](/solution/1000-1099/1094.Car%20Pooling/README_EN.md) | `Array`,`Prefix Sum`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Weekly Contest 142 | +| 1095 | [Find in Mountain Array](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README_EN.md) | `Array`,`Binary Search`,`Interactive` | Hard | Weekly Contest 142 | +| 1096 | [Brace Expansion II](/solution/1000-1099/1096.Brace%20Expansion%20II/README_EN.md) | `Stack`,`Breadth-First Search`,`String`,`Backtracking` | Hard | Weekly Contest 142 | +| 1097 | [Game Play Analysis V](/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README_EN.md) | `Database` | Hard | 🔒 | +| 1098 | [Unpopular Books](/solution/1000-1099/1098.Unpopular%20Books/README_EN.md) | `Database` | Medium | 🔒 | +| 1099 | [Two Sum Less Than K](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | Biweekly Contest 3 | +| 1100 | [Find K-Length Substrings With No Repeated Characters](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Biweekly Contest 3 | +| 1101 | [The Earliest Moment When Everyone Become Friends](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README_EN.md) | `Union Find`,`Array`,`Sorting` | Medium | Biweekly Contest 3 | +| 1102 | [Path With Maximum Minimum Value](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)` | Medium | Biweekly Contest 3 | +| 1103 | [Distribute Candies to People](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 143 | +| 1104 | [Path In Zigzag Labelled Binary Tree](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README_EN.md) | `Tree`,`Math`,`Binary Tree` | Medium | Weekly Contest 143 | +| 1105 | [Filling Bookcase Shelves](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 143 | +| 1106 | [Parsing A Boolean Expression](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README_EN.md) | `Stack`,`Recursion`,`String` | Hard | Weekly Contest 143 | +| 1107 | [New Users Daily Count](/solution/1100-1199/1107.New%20Users%20Daily%20Count/README_EN.md) | `Database` | Medium | 🔒 | +| 1108 | [Defanging an IP Address](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README_EN.md) | `String` | Easy | Weekly Contest 144 | +| 1109 | [Corporate Flight Bookings](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 144 | +| 1110 | [Delete Nodes And Return Forest](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 144 | +| 1111 | [Maximum Nesting Depth of Two Valid Parentheses Strings](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 144 | +| 1112 | [Highest Grade For Each Student](/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README_EN.md) | `Database` | Medium | 🔒 | +| 1113 | [Reported Posts](/solution/1100-1199/1113.Reported%20Posts/README_EN.md) | `Database` | Easy | 🔒 | +| 1114 | [Print in Order](/solution/1100-1199/1114.Print%20in%20Order/README_EN.md) | `Concurrency` | Easy | | +| 1115 | [Print FooBar Alternately](/solution/1100-1199/1115.Print%20FooBar%20Alternately/README_EN.md) | `Concurrency` | Medium | | +| 1116 | [Print Zero Even Odd](/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README_EN.md) | `Concurrency` | Medium | | +| 1117 | [Building H2O](/solution/1100-1199/1117.Building%20H2O/README_EN.md) | `Concurrency` | Medium | | +| 1118 | [Number of Days in a Month](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README_EN.md) | `Math` | Easy | Biweekly Contest 4 | +| 1119 | [Remove Vowels from a String](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README_EN.md) | `String` | Easy | Biweekly Contest 4 | +| 1120 | [Maximum Average Subtree](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Biweekly Contest 4 | +| 1121 | [Divide Array Into Increasing Sequences](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README_EN.md) | `Array`,`Counting` | Hard | Biweekly Contest 4 | +| 1122 | [Relative Sort Array](/solution/1100-1199/1122.Relative%20Sort%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting Sort`,`Sorting` | Easy | Weekly Contest 145 | +| 1123 | [Lowest Common Ancestor of Deepest Leaves](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 145 | +| 1124 | [Longest Well-Performing Interval](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README_EN.md) | `Stack`,`Array`,`Hash Table`,`Prefix Sum`,`Monotonic Stack` | Medium | Weekly Contest 145 | +| 1125 | [Smallest Sufficient Team](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 145 | +| 1126 | [Active Businesses](/solution/1100-1199/1126.Active%20Businesses/README_EN.md) | `Database` | Medium | 🔒 | +| 1127 | [User Purchase Platform](/solution/1100-1199/1127.User%20Purchase%20Platform/README_EN.md) | `Database` | Hard | 🔒 | +| 1128 | [Number of Equivalent Domino Pairs](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 146 | +| 1129 | [Shortest Path with Alternating Colors](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README_EN.md) | `Breadth-First Search`,`Graph` | Medium | Weekly Contest 146 | +| 1130 | [Minimum Cost Tree From Leaf Values](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README_EN.md) | `Stack`,`Greedy`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Medium | Weekly Contest 146 | +| 1131 | [Maximum of Absolute Value Expression](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 146 | +| 1132 | [Reported Posts II](/solution/1100-1199/1132.Reported%20Posts%20II/README_EN.md) | `Database` | Medium | 🔒 | +| 1133 | [Largest Unique Number](/solution/1100-1199/1133.Largest%20Unique%20Number/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 5 | +| 1134 | [Armstrong Number](/solution/1100-1199/1134.Armstrong%20Number/README_EN.md) | `Math` | Easy | Biweekly Contest 5 | +| 1135 | [Connecting Cities With Minimum Cost](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README_EN.md) | `Union Find`,`Graph`,`Minimum Spanning Tree`,`Heap (Priority Queue)` | Medium | Biweekly Contest 5 | +| 1136 | [Parallel Courses](/solution/1100-1199/1136.Parallel%20Courses/README_EN.md) | `Graph`,`Topological Sort` | Medium | Biweekly Contest 5 | +| 1137 | [N-th Tribonacci Number](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README_EN.md) | `Memoization`,`Math`,`Dynamic Programming` | Easy | Weekly Contest 147 | +| 1138 | [Alphabet Board Path](/solution/1100-1199/1138.Alphabet%20Board%20Path/README_EN.md) | `Hash Table`,`String` | Medium | Weekly Contest 147 | +| 1139 | [Largest 1-Bordered Square](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 147 | +| 1140 | [Stone Game II](/solution/1100-1199/1140.Stone%20Game%20II/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory`,`Prefix Sum` | Medium | Weekly Contest 147 | +| 1141 | [User Activity for the Past 30 Days I](/solution/1100-1199/1141.User%20Activity%20for%20the%20Past%2030%20Days%20I/README_EN.md) | `Database` | Easy | | +| 1142 | [User Activity for the Past 30 Days II](/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README_EN.md) | `Database` | Easy | 🔒 | +| 1143 | [Longest Common Subsequence](/solution/1100-1199/1143.Longest%20Common%20Subsequence/README_EN.md) | `String`,`Dynamic Programming` | Medium | | +| 1144 | [Decrease Elements To Make Array Zigzag](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 148 | +| 1145 | [Binary Tree Coloring Game](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 148 | +| 1146 | [Snapshot Array](/solution/1100-1199/1146.Snapshot%20Array/README_EN.md) | `Design`,`Array`,`Hash Table`,`Binary Search` | Medium | Weekly Contest 148 | +| 1147 | [Longest Chunked Palindrome Decomposition](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README_EN.md) | `Greedy`,`Two Pointers`,`String`,`Dynamic Programming`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 148 | +| 1148 | [Article Views I](/solution/1100-1199/1148.Article%20Views%20I/README_EN.md) | `Database` | Easy | | +| 1149 | [Article Views II](/solution/1100-1199/1149.Article%20Views%20II/README_EN.md) | `Database` | Medium | 🔒 | +| 1150 | [Check If a Number Is Majority Element in a Sorted Array](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README_EN.md) | `Array`,`Binary Search` | Easy | Biweekly Contest 6 | +| 1151 | [Minimum Swaps to Group All 1's Together](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README_EN.md) | `Array`,`Sliding Window` | Medium | Biweekly Contest 6 | +| 1152 | [Analyze User Website Visit Pattern](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | Biweekly Contest 6 | +| 1153 | [String Transforms Into Another String](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README_EN.md) | `Hash Table`,`String` | Hard | Biweekly Contest 6 | +| 1154 | [Day of the Year](/solution/1100-1199/1154.Day%20of%20the%20Year/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 149 | +| 1155 | [Number of Dice Rolls With Target Sum](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README_EN.md) | `Dynamic Programming` | Medium | Weekly Contest 149 | +| 1156 | [Swap For Longest Repeated Character Substring](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 149 | +| 1157 | [Online Majority Element In Subarray](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README_EN.md) | `Design`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search` | Hard | Weekly Contest 149 | +| 1158 | [Market Analysis I](/solution/1100-1199/1158.Market%20Analysis%20I/README_EN.md) | `Database` | Medium | | +| 1159 | [Market Analysis II](/solution/1100-1199/1159.Market%20Analysis%20II/README_EN.md) | `Database` | Hard | 🔒 | +| 1160 | [Find Words That Can Be Formed by Characters](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 150 | +| 1161 | [Maximum Level Sum of a Binary Tree](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 150 | +| 1162 | [As Far from Land as Possible](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 150 | +| 1163 | [Last Substring in Lexicographical Order](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README_EN.md) | `Two Pointers`,`String` | Hard | Weekly Contest 150 | +| 1164 | [Product Price at a Given Date](/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README_EN.md) | `Database` | Medium | | +| 1165 | [Single-Row Keyboard](/solution/1100-1199/1165.Single-Row%20Keyboard/README_EN.md) | `Hash Table`,`String` | Easy | Biweekly Contest 7 | +| 1166 | [Design File System](/solution/1100-1199/1166.Design%20File%20System/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | Biweekly Contest 7 | +| 1167 | [Minimum Cost to Connect Sticks](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Biweekly Contest 7 | +| 1168 | [Optimize Water Distribution in a Village](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README_EN.md) | `Union Find`,`Graph`,`Minimum Spanning Tree`,`Heap (Priority Queue)` | Hard | Biweekly Contest 7 | +| 1169 | [Invalid Transactions](/solution/1100-1199/1169.Invalid%20Transactions/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 151 | +| 1170 | [Compare Strings by Frequency of the Smallest Character](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README_EN.md) | `Array`,`Hash Table`,`String`,`Binary Search`,`Sorting` | Medium | Weekly Contest 151 | +| 1171 | [Remove Zero Sum Consecutive Nodes from Linked List](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README_EN.md) | `Hash Table`,`Linked List` | Medium | Weekly Contest 151 | +| 1172 | [Dinner Plate Stacks](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README_EN.md) | `Stack`,`Design`,`Hash Table`,`Heap (Priority Queue)` | Hard | Weekly Contest 151 | +| 1173 | [Immediate Food Delivery I](/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README_EN.md) | `Database` | Easy | 🔒 | +| 1174 | [Immediate Food Delivery II](/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README_EN.md) | `Database` | Medium | | +| 1175 | [Prime Arrangements](/solution/1100-1199/1175.Prime%20Arrangements/README_EN.md) | `Math` | Easy | Weekly Contest 152 | +| 1176 | [Diet Plan Performance](/solution/1100-1199/1176.Diet%20Plan%20Performance/README_EN.md) | `Array`,`Sliding Window` | Easy | Weekly Contest 152 | +| 1177 | [Can Make Palindrome from Substring](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String`,`Prefix Sum` | Medium | Weekly Contest 152 | +| 1178 | [Number of Valid Words for Each Puzzle](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README_EN.md) | `Bit Manipulation`,`Trie`,`Array`,`Hash Table`,`String` | Hard | Weekly Contest 152 | +| 1179 | [Reformat Department Table](/solution/1100-1199/1179.Reformat%20Department%20Table/README_EN.md) | `Database` | Easy | | +| 1180 | [Count Substrings with Only One Distinct Letter](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 8 | +| 1181 | [Before and After Puzzle](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Biweekly Contest 8 | +| 1182 | [Shortest Distance to Target Color](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming` | Medium | Biweekly Contest 8 | +| 1183 | [Maximum Number of Ones](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README_EN.md) | `Greedy`,`Heap (Priority Queue)` | Hard | Biweekly Contest 8 | +| 1184 | [Distance Between Bus Stops](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README_EN.md) | `Array` | Easy | Weekly Contest 153 | +| 1185 | [Day of the Week](/solution/1100-1199/1185.Day%20of%20the%20Week/README_EN.md) | `Math` | Easy | Weekly Contest 153 | +| 1186 | [Maximum Subarray Sum with One Deletion](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 153 | +| 1187 | [Make Array Strictly Increasing](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 153 | +| 1188 | [Design Bounded Blocking Queue](/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README_EN.md) | `Concurrency` | Medium | 🔒 | +| 1189 | [Maximum Number of Balloons](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 154 | +| 1190 | [Reverse Substrings Between Each Pair of Parentheses](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 154 | +| 1191 | [K-Concatenation Maximum Sum](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 154 | +| 1192 | [Critical Connections in a Network](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README_EN.md) | `Depth-First Search`,`Graph`,`Biconnected Component` | Hard | Weekly Contest 154 | +| 1193 | [Monthly Transactions I](/solution/1100-1199/1193.Monthly%20Transactions%20I/README_EN.md) | `Database` | Medium | | +| 1194 | [Tournament Winners](/solution/1100-1199/1194.Tournament%20Winners/README_EN.md) | `Database` | Hard | 🔒 | +| 1195 | [Fizz Buzz Multithreaded](/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README_EN.md) | `Concurrency` | Medium | | +| 1196 | [How Many Apples Can You Put into the Basket](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Biweekly Contest 9 | +| 1197 | [Minimum Knight Moves](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README_EN.md) | `Breadth-First Search` | Medium | Biweekly Contest 9 | +| 1198 | [Find Smallest Common Element in All Rows](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Counting`,`Matrix` | Medium | Biweekly Contest 9 | +| 1199 | [Minimum Time to Build Blocks](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README_EN.md) | `Greedy`,`Array`,`Math`,`Heap (Priority Queue)` | Hard | Biweekly Contest 9 | +| 1200 | [Minimum Absolute Difference](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 155 | +| 1201 | [Ugly Number III](/solution/1200-1299/1201.Ugly%20Number%20III/README_EN.md) | `Math`,`Binary Search`,`Combinatorics`,`Number Theory` | Medium | Weekly Contest 155 | +| 1202 | [Smallest String With Swaps](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 155 | +| 1203 | [Sort Items by Groups Respecting Dependencies](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Hard | Weekly Contest 155 | +| 1204 | [Last Person to Fit in the Bus](/solution/1200-1299/1204.Last%20Person%20to%20Fit%20in%20the%20Bus/README_EN.md) | `Database` | Medium | | +| 1205 | [Monthly Transactions II](/solution/1200-1299/1205.Monthly%20Transactions%20II/README_EN.md) | `Database` | Medium | 🔒 | +| 1206 | [Design Skiplist](/solution/1200-1299/1206.Design%20Skiplist/README_EN.md) | `Design`,`Linked List` | Hard | | +| 1207 | [Unique Number of Occurrences](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 156 | +| 1208 | [Get Equal Substrings Within Budget](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README_EN.md) | `String`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 156 | +| 1209 | [Remove All Adjacent Duplicates in String II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 156 | +| 1210 | [Minimum Moves to Reach Target with Rotations](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | Weekly Contest 156 | +| 1211 | [Queries Quality and Percentage](/solution/1200-1299/1211.Queries%20Quality%20and%20Percentage/README_EN.md) | `Database` | Easy | | +| 1212 | [Team Scores in Football Tournament](/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README_EN.md) | `Database` | Medium | 🔒 | +| 1213 | [Intersection of Three Sorted Arrays](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Counting` | Easy | Biweekly Contest 10 | +| 1214 | [Two Sum BSTs](/solution/1200-1299/1214.Two%20Sum%20BSTs/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Two Pointers`,`Binary Search`,`Binary Tree` | Medium | Biweekly Contest 10 | +| 1215 | [Stepping Numbers](/solution/1200-1299/1215.Stepping%20Numbers/README_EN.md) | `Breadth-First Search`,`Backtracking` | Medium | Biweekly Contest 10 | +| 1216 | [Valid Palindrome III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README_EN.md) | `String`,`Dynamic Programming` | Hard | Biweekly Contest 10 | +| 1217 | [Minimum Cost to Move Chips to The Same Position](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README_EN.md) | `Greedy`,`Array`,`Math` | Easy | Weekly Contest 157 | +| 1218 | [Longest Arithmetic Subsequence of Given Difference](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Medium | Weekly Contest 157 | +| 1219 | [Path with Maximum Gold](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README_EN.md) | `Array`,`Backtracking`,`Matrix` | Medium | Weekly Contest 157 | +| 1220 | [Count Vowels Permutation](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README_EN.md) | `Dynamic Programming` | Hard | Weekly Contest 157 | +| 1221 | [Split a String in Balanced Strings](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README_EN.md) | `Greedy`,`String`,`Counting` | Easy | Weekly Contest 158 | +| 1222 | [Queens That Can Attack the King](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 158 | +| 1223 | [Dice Roll Simulation](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 158 | +| 1224 | [Maximum Equal Frequency](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README_EN.md) | `Array`,`Hash Table` | Hard | Weekly Contest 158 | +| 1225 | [Report Contiguous Dates](/solution/1200-1299/1225.Report%20Contiguous%20Dates/README_EN.md) | `Database` | Hard | 🔒 | +| 1226 | [The Dining Philosophers](/solution/1200-1299/1226.The%20Dining%20Philosophers/README_EN.md) | `Concurrency` | Medium | | +| 1227 | [Airplane Seat Assignment Probability](/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README_EN.md) | `Brainteaser`,`Math`,`Dynamic Programming`,`Probability and Statistics` | Medium | | +| 1228 | [Missing Number In Arithmetic Progression](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 11 | +| 1229 | [Meeting Scheduler](/solution/1200-1299/1229.Meeting%20Scheduler/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | Biweekly Contest 11 | +| 1230 | [Toss Strange Coins](/solution/1200-1299/1230.Toss%20Strange%20Coins/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Probability and Statistics` | Medium | Biweekly Contest 11 | +| 1231 | [Divide Chocolate](/solution/1200-1299/1231.Divide%20Chocolate/README_EN.md) | `Array`,`Binary Search` | Hard | Biweekly Contest 11 | +| 1232 | [Check If It Is a Straight Line](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README_EN.md) | `Geometry`,`Array`,`Math` | Easy | Weekly Contest 159 | +| 1233 | [Remove Sub-Folders from the Filesystem](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README_EN.md) | `Depth-First Search`,`Trie`,`Array`,`String` | Medium | Weekly Contest 159 | +| 1234 | [Replace the Substring for Balanced String](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README_EN.md) | `String`,`Sliding Window` | Medium | Weekly Contest 159 | +| 1235 | [Maximum Profit in Job Scheduling](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 159 | +| 1236 | [Web Crawler](/solution/1200-1299/1236.Web%20Crawler/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`String`,`Interactive` | Medium | 🔒 | +| 1237 | [Find Positive Integer Solution for a Given Equation](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README_EN.md) | `Math`,`Two Pointers`,`Binary Search`,`Interactive` | Medium | Weekly Contest 160 | +| 1238 | [Circular Permutation in Binary Representation](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README_EN.md) | `Bit Manipulation`,`Math`,`Backtracking` | Medium | Weekly Contest 160 | +| 1239 | [Maximum Length of a Concatenated String with Unique Characters](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README_EN.md) | `Bit Manipulation`,`Array`,`String`,`Backtracking` | Medium | Weekly Contest 160 | +| 1240 | [Tiling a Rectangle with the Fewest Squares](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README_EN.md) | `Backtracking` | Hard | Weekly Contest 160 | +| 1241 | [Number of Comments per Post](/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README_EN.md) | `Database` | Easy | 🔒 | +| 1242 | [Web Crawler Multithreaded](/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Concurrency` | Medium | 🔒 | +| 1243 | [Array Transformation](/solution/1200-1299/1243.Array%20Transformation/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 12 | +| 1244 | [Design A Leaderboard](/solution/1200-1299/1244.Design%20A%20Leaderboard/README_EN.md) | `Design`,`Hash Table`,`Sorting` | Medium | Biweekly Contest 12 | +| 1245 | [Tree Diameter](/solution/1200-1299/1245.Tree%20Diameter/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | Biweekly Contest 12 | +| 1246 | [Palindrome Removal](/solution/1200-1299/1246.Palindrome%20Removal/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 12 | +| 1247 | [Minimum Swaps to Make Strings Equal](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README_EN.md) | `Greedy`,`Math`,`String` | Medium | Weekly Contest 161 | +| 1248 | [Count Number of Nice Subarrays](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Math`,`Sliding Window` | Medium | Weekly Contest 161 | +| 1249 | [Minimum Remove to Make Valid Parentheses](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README_EN.md) | `Stack`,`String` | Medium | Weekly Contest 161 | +| 1250 | [Check If It Is a Good Array](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README_EN.md) | `Array`,`Math`,`Number Theory` | Hard | Weekly Contest 161 | +| 1251 | [Average Selling Price](/solution/1200-1299/1251.Average%20Selling%20Price/README_EN.md) | `Database` | Easy | | +| 1252 | [Cells with Odd Values in a Matrix](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README_EN.md) | `Array`,`Math`,`Simulation` | Easy | Weekly Contest 162 | +| 1253 | [Reconstruct a 2-Row Binary Matrix](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | Weekly Contest 162 | +| 1254 | [Number of Closed Islands](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Weekly Contest 162 | +| 1255 | [Maximum Score Words Formed by Letters](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README_EN.md) | `Bit Manipulation`,`Array`,`String`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | Weekly Contest 162 | +| 1256 | [Encode Number](/solution/1200-1299/1256.Encode%20Number/README_EN.md) | `Bit Manipulation`,`Math`,`String` | Medium | Biweekly Contest 13 | +| 1257 | [Smallest Common Region](/solution/1200-1299/1257.Smallest%20Common%20Region/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Hash Table`,`String` | Medium | Biweekly Contest 13 | +| 1258 | [Synonymous Sentences](/solution/1200-1299/1258.Synonymous%20Sentences/README_EN.md) | `Union Find`,`Array`,`Hash Table`,`String`,`Backtracking` | Medium | Biweekly Contest 13 | +| 1259 | [Handshakes That Don't Cross](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Biweekly Contest 13 | +| 1260 | [Shift 2D Grid](/solution/1200-1299/1260.Shift%202D%20Grid/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Weekly Contest 163 | +| 1261 | [Find Elements in a Contaminated Binary Tree](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 163 | +| 1262 | [Greatest Sum Divisible by Three](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 163 | +| 1263 | [Minimum Moves to Move a Box to Their Target Location](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix`,`Heap (Priority Queue)` | Hard | Weekly Contest 163 | +| 1264 | [Page Recommendations](/solution/1200-1299/1264.Page%20Recommendations/README_EN.md) | `Database` | Medium | 🔒 | +| 1265 | [Print Immutable Linked List in Reverse](/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README_EN.md) | `Stack`,`Recursion`,`Linked List`,`Two Pointers` | Medium | 🔒 | +| 1266 | [Minimum Time Visiting All Points](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README_EN.md) | `Geometry`,`Array`,`Math` | Easy | Weekly Contest 164 | +| 1267 | [Count Servers that Communicate](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Counting`,`Matrix` | Medium | Weekly Contest 164 | +| 1268 | [Search Suggestions System](/solution/1200-1299/1268.Search%20Suggestions%20System/README_EN.md) | `Trie`,`Array`,`String`,`Binary Search`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 164 | +| 1269 | [Number of Ways to Stay in the Same Place After Some Steps](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README_EN.md) | `Dynamic Programming` | Hard | Weekly Contest 164 | +| 1270 | [All People Report to the Given Manager](/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README_EN.md) | `Database` | Medium | 🔒 | +| 1271 | [Hexspeak](/solution/1200-1299/1271.Hexspeak/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 14 | +| 1272 | [Remove Interval](/solution/1200-1299/1272.Remove%20Interval/README_EN.md) | `Array` | Medium | Biweekly Contest 14 | +| 1273 | [Delete Tree Nodes](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array` | Medium | Biweekly Contest 14 | +| 1274 | [Number of Ships in a Rectangle](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README_EN.md) | `Array`,`Divide and Conquer`,`Interactive` | Hard | Biweekly Contest 14 | +| 1275 | [Find Winner on a Tic Tac Toe Game](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README_EN.md) | `Array`,`Hash Table`,`Matrix`,`Simulation` | Easy | Weekly Contest 165 | +| 1276 | [Number of Burgers with No Waste of Ingredients](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README_EN.md) | `Math` | Medium | Weekly Contest 165 | +| 1277 | [Count Square Submatrices with All Ones](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 165 | +| 1278 | [Palindrome Partitioning III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 165 | +| 1279 | [Traffic Light Controlled Intersection](/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README_EN.md) | `Concurrency` | Easy | 🔒 | +| 1280 | [Students and Examinations](/solution/1200-1299/1280.Students%20and%20Examinations/README_EN.md) | `Database` | Easy | | +| 1281 | [Subtract the Product and Sum of Digits of an Integer](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README_EN.md) | `Math` | Easy | Weekly Contest 166 | +| 1282 | [Group the People Given the Group Size They Belong To](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 166 | +| 1283 | [Find the Smallest Divisor Given a Threshold](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 166 | +| 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array`,`Hash Table`,`Matrix` | Hard | Weekly Contest 166 | +| 1285 | [Find the Start and End Number of Continuous Ranges](/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README_EN.md) | `Database` | Medium | 🔒 | +| 1286 | [Iterator for Combination](/solution/1200-1299/1286.Iterator%20for%20Combination/README_EN.md) | `Design`,`String`,`Backtracking`,`Iterator` | Medium | Biweekly Contest 15 | +| 1287 | [Element Appearing More Than 25% In Sorted Array](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README_EN.md) | `Array` | Easy | Biweekly Contest 15 | +| 1288 | [Remove Covered Intervals](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 15 | +| 1289 | [Minimum Falling Path Sum II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 15 | +| 1290 | [Convert Binary Number in a Linked List to Integer](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README_EN.md) | `Linked List`,`Math` | Easy | Weekly Contest 167 | +| 1291 | [Sequential Digits](/solution/1200-1299/1291.Sequential%20Digits/README_EN.md) | `Enumeration` | Medium | Weekly Contest 167 | +| 1292 | [Maximum Side Length of a Square with Sum Less than or Equal to Threshold](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README_EN.md) | `Array`,`Binary Search`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 167 | +| 1293 | [Shortest Path in a Grid with Obstacles Elimination](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | Weekly Contest 167 | +| 1294 | [Weather Type in Each Country](/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README_EN.md) | `Database` | Easy | 🔒 | +| 1295 | [Find Numbers with Even Number of Digits](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README_EN.md) | `Array` | Easy | Weekly Contest 168 | +| 1296 | [Divide Array in Sets of K Consecutive Numbers](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 168 | +| 1297 | [Maximum Number of Occurrences of a Substring](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 168 | +| 1298 | [Maximum Candies You Can Get from Boxes](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README_EN.md) | `Breadth-First Search`,`Graph`,`Array` | Hard | Weekly Contest 168 | +| 1299 | [Replace Elements with Greatest Element on Right Side](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README_EN.md) | `Array` | Easy | Biweekly Contest 16 | +| 1300 | [Sum of Mutated Array Closest to Target](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 16 | +| 1301 | [Number of Paths with Max Score](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 16 | +| 1302 | [Deepest Leaves Sum](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Biweekly Contest 16 | +| 1303 | [Find the Team Size](/solution/1300-1399/1303.Find%20the%20Team%20Size/README_EN.md) | `Database` | Easy | 🔒 | +| 1304 | [Find N Unique Integers Sum up to Zero](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 169 | +| 1305 | [All Elements in Two Binary Search Trees](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Binary Tree`,`Sorting` | Medium | Weekly Contest 169 | +| 1306 | [Jump Game III](/solution/1300-1399/1306.Jump%20Game%20III/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array` | Medium | Weekly Contest 169 | +| 1307 | [Verbal Arithmetic Puzzle](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README_EN.md) | `Array`,`Math`,`String`,`Backtracking` | Hard | Weekly Contest 169 | +| 1308 | [Running Total for Different Genders](/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README_EN.md) | `Database` | Medium | 🔒 | +| 1309 | [Decrypt String from Alphabet to Integer Mapping](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README_EN.md) | `String` | Easy | Weekly Contest 170 | +| 1310 | [XOR Queries of a Subarray](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README_EN.md) | `Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Weekly Contest 170 | +| 1311 | [Get Watched Videos by Your Friends](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 170 | +| 1312 | [Minimum Insertion Steps to Make a String Palindrome](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 170 | +| 1313 | [Decompress Run-Length Encoded List](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README_EN.md) | `Array` | Easy | Biweekly Contest 17 | +| 1314 | [Matrix Block Sum](/solution/1300-1399/1314.Matrix%20Block%20Sum/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Biweekly Contest 17 | +| 1315 | [Sum of Nodes with Even-Valued Grandparent](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Biweekly Contest 17 | +| 1316 | [Distinct Echo Substrings](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README_EN.md) | `Trie`,`String`,`Hash Function`,`Rolling Hash` | Hard | Biweekly Contest 17 | +| 1317 | [Convert Integer to the Sum of Two No-Zero Integers](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README_EN.md) | `Math` | Easy | Weekly Contest 171 | +| 1318 | [Minimum Flips to Make a OR b Equal to c](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README_EN.md) | `Bit Manipulation` | Medium | Weekly Contest 171 | +| 1319 | [Number of Operations to Make Network Connected](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Weekly Contest 171 | +| 1320 | [Minimum Distance to Type a Word Using Two Fingers](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 171 | +| 1321 | [Restaurant Growth](/solution/1300-1399/1321.Restaurant%20Growth/README_EN.md) | `Database` | Medium | | +| 1322 | [Ads Performance](/solution/1300-1399/1322.Ads%20Performance/README_EN.md) | `Database` | Easy | 🔒 | +| 1323 | [Maximum 69 Number](/solution/1300-1399/1323.Maximum%2069%20Number/README_EN.md) | `Greedy`,`Math` | Easy | Weekly Contest 172 | +| 1324 | [Print Words Vertically](/solution/1300-1399/1324.Print%20Words%20Vertically/README_EN.md) | `Array`,`String`,`Simulation` | Medium | Weekly Contest 172 | +| 1325 | [Delete Leaves With a Given Value](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 172 | +| 1326 | [Minimum Number of Taps to Open to Water a Garden](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 172 | +| 1327 | [List the Products Ordered in a Period](/solution/1300-1399/1327.List%20the%20Products%20Ordered%20in%20a%20Period/README_EN.md) | `Database` | Easy | | +| 1328 | [Break a Palindrome](/solution/1300-1399/1328.Break%20a%20Palindrome/README_EN.md) | `Greedy`,`String` | Medium | Biweekly Contest 18 | +| 1329 | [Sort the Matrix Diagonally](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README_EN.md) | `Array`,`Matrix`,`Sorting` | Medium | Biweekly Contest 18 | +| 1330 | [Reverse Subarray To Maximize Array Value](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README_EN.md) | `Greedy`,`Array`,`Math` | Hard | Biweekly Contest 18 | +| 1331 | [Rank Transform of an Array](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 18 | +| 1332 | [Remove Palindromic Subsequences](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 173 | +| 1333 | [Filter Restaurants by Vegan-Friendly, Price and Distance](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 173 | +| 1334 | [Find the City With the Smallest Number of Neighbors at a Threshold Distance](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README_EN.md) | `Graph`,`Dynamic Programming`,`Shortest Path` | Medium | Weekly Contest 173 | +| 1335 | [Minimum Difficulty of a Job Schedule](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 173 | +| 1336 | [Number of Transactions per Visit](/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README_EN.md) | `Database` | Hard | 🔒 | +| 1337 | [The K Weakest Rows in a Matrix](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Easy | Weekly Contest 174 | +| 1338 | [Reduce Array Size to The Half](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 174 | +| 1339 | [Maximum Product of Splitted Binary Tree](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 174 | +| 1340 | [Jump Game V](/solution/1300-1399/1340.Jump%20Game%20V/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 174 | +| 1341 | [Movie Rating](/solution/1300-1399/1341.Movie%20Rating/README_EN.md) | `Database` | Medium | | +| 1342 | [Number of Steps to Reduce a Number to Zero](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README_EN.md) | `Bit Manipulation`,`Math` | Easy | Biweekly Contest 19 | +| 1343 | [Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README_EN.md) | `Array`,`Sliding Window` | Medium | Biweekly Contest 19 | +| 1344 | [Angle Between Hands of a Clock](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README_EN.md) | `Math` | Medium | Biweekly Contest 19 | +| 1345 | [Jump Game IV](/solution/1300-1399/1345.Jump%20Game%20IV/README_EN.md) | `Breadth-First Search`,`Array`,`Hash Table` | Hard | Biweekly Contest 19 | +| 1346 | [Check If N and Its Double Exist](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | Weekly Contest 175 | +| 1347 | [Minimum Number of Steps to Make Two Strings Anagram](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 175 | +| 1348 | [Tweet Counts Per Frequency](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README_EN.md) | `Design`,`Hash Table`,`Binary Search`,`Ordered Set`,`Sorting` | Medium | Weekly Contest 175 | +| 1349 | [Maximum Students Taking Exam](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`,`Matrix` | Hard | Weekly Contest 175 | +| 1350 | [Students With Invalid Departments](/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README_EN.md) | `Database` | Easy | 🔒 | +| 1351 | [Count Negative Numbers in a Sorted Matrix](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Easy | Weekly Contest 176 | +| 1352 | [Product of the Last K Numbers](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README_EN.md) | `Design`,`Queue`,`Array`,`Math`,`Data Stream` | Medium | Weekly Contest 176 | +| 1353 | [Maximum Number of Events That Can Be Attended](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 176 | +| 1354 | [Construct Target Array With Multiple Sums](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README_EN.md) | `Array`,`Heap (Priority Queue)` | Hard | Weekly Contest 176 | +| 1355 | [Activity Participants](/solution/1300-1399/1355.Activity%20Participants/README_EN.md) | `Database` | Medium | 🔒 | +| 1356 | [Sort Integers by The Number of 1 Bits](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README_EN.md) | `Bit Manipulation`,`Array`,`Counting`,`Sorting` | Easy | Biweekly Contest 20 | +| 1357 | [Apply Discount Every n Orders](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README_EN.md) | `Design`,`Array`,`Hash Table` | Medium | Biweekly Contest 20 | +| 1358 | [Number of Substrings Containing All Three Characters](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Biweekly Contest 20 | +| 1359 | [Count All Valid Pickup and Delivery Options](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | Biweekly Contest 20 | +| 1360 | [Number of Days Between Two Dates](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README_EN.md) | `Math`,`String` | Easy | Weekly Contest 177 | +| 1361 | [Validate Binary Tree Nodes](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Binary Tree` | Medium | Weekly Contest 177 | +| 1362 | [Closest Divisors](/solution/1300-1399/1362.Closest%20Divisors/README_EN.md) | `Math` | Medium | Weekly Contest 177 | +| 1363 | [Largest Multiple of Three](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 177 | +| 1364 | [Number of Trusted Contacts of a Customer](/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README_EN.md) | `Database` | Medium | 🔒 | +| 1365 | [How Many Numbers Are Smaller Than the Current Number](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Easy | Weekly Contest 178 | +| 1366 | [Rank Teams by Votes](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 178 | +| 1367 | [Linked List in Binary Tree](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Linked List`,`Binary Tree` | Medium | Weekly Contest 178 | +| 1368 | [Minimum Cost to Make at Least One Valid Path in a Grid](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 178 | +| 1369 | [Get the Second Most Recent Activity](/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README_EN.md) | `Database` | Hard | 🔒 | +| 1370 | [Increasing Decreasing String](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 21 | +| 1371 | [Find the Longest Substring Containing Vowels in Even Counts](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Prefix Sum` | Medium | Biweekly Contest 21 | +| 1372 | [Longest ZigZag Path in a Binary Tree](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Medium | Biweekly Contest 21 | +| 1373 | [Maximum Sum BST in Binary Tree](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Dynamic Programming`,`Binary Tree` | Hard | Biweekly Contest 21 | +| 1374 | [Generate a String With Characters That Have Odd Counts](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README_EN.md) | `String` | Easy | Weekly Contest 179 | +| 1375 | [Number of Times Binary String Is Prefix-Aligned](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README_EN.md) | `Array` | Medium | Weekly Contest 179 | +| 1376 | [Time Needed to Inform All Employees](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search` | Medium | Weekly Contest 179 | +| 1377 | [Frog Position After T Seconds](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph` | Hard | Weekly Contest 179 | +| 1378 | [Replace Employee ID With The Unique Identifier](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README_EN.md) | `Database` | Easy | | +| 1379 | [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | | +| 1380 | [Lucky Numbers in a Matrix](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 180 | +| 1381 | [Design a Stack With Increment Operation](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README_EN.md) | `Stack`,`Design`,`Array` | Medium | Weekly Contest 180 | +| 1382 | [Balance a Binary Search Tree](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README_EN.md) | `Greedy`,`Tree`,`Depth-First Search`,`Binary Search Tree`,`Divide and Conquer`,`Binary Tree` | Medium | Weekly Contest 180 | +| 1383 | [Maximum Performance of a Team](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 180 | +| 1384 | [Total Sales Amount by Year](/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README_EN.md) | `Database` | Hard | 🔒 | +| 1385 | [Find the Distance Value Between Two Arrays](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | Biweekly Contest 22 | +| 1386 | [Cinema Seat Allocation](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Hash Table` | Medium | Biweekly Contest 22 | +| 1387 | [Sort Integers by The Power Value](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README_EN.md) | `Memoization`,`Dynamic Programming`,`Sorting` | Medium | Biweekly Contest 22 | +| 1388 | [Pizza With 3n Slices](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Heap (Priority Queue)` | Hard | Biweekly Contest 22 | +| 1389 | [Create Target Array in the Given Order](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 181 | +| 1390 | [Four Divisors](/solution/1300-1399/1390.Four%20Divisors/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 181 | +| 1391 | [Check if There is a Valid Path in a Grid](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Weekly Contest 181 | +| 1392 | [Longest Happy Prefix](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 181 | +| 1393 | [Capital GainLoss](/solution/1300-1399/1393.Capital%20GainLoss/README_EN.md) | `Database` | Medium | | +| 1394 | [Find Lucky Integer in an Array](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 182 | +| 1395 | [Count Number of Teams](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README_EN.md) | `Binary Indexed Tree`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 182 | +| 1396 | [Design Underground System](/solution/1300-1399/1396.Design%20Underground%20System/README_EN.md) | `Design`,`Hash Table`,`String` | Medium | Weekly Contest 182 | +| 1397 | [Find All Good Strings](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README_EN.md) | `String`,`Dynamic Programming`,`String Matching` | Hard | Weekly Contest 182 | +| 1398 | [Customers Who Bought Products A and B but Not C](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README_EN.md) | `Database` | Medium | 🔒 | +| 1399 | [Count Largest Group](/solution/1300-1399/1399.Count%20Largest%20Group/README_EN.md) | `Hash Table`,`Math` | Easy | Biweekly Contest 23 | +| 1400 | [Construct K Palindrome Strings](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 23 | +| 1401 | [Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README_EN.md) | `Geometry`,`Math` | Medium | Biweekly Contest 23 | +| 1402 | [Reducing Dishes](/solution/1400-1499/1402.Reducing%20Dishes/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 23 | +| 1403 | [Minimum Subsequence in Non-Increasing Order](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 183 | +| 1404 | [Number of Steps to Reduce a Number in Binary Representation to One](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README_EN.md) | `Bit Manipulation`,`String` | Medium | Weekly Contest 183 | +| 1405 | [Longest Happy String](/solution/1400-1499/1405.Longest%20Happy%20String/README_EN.md) | `Greedy`,`String`,`Heap (Priority Queue)` | Medium | Weekly Contest 183 | +| 1406 | [Stone Game III](/solution/1400-1499/1406.Stone%20Game%20III/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Hard | Weekly Contest 183 | +| 1407 | [Top Travellers](/solution/1400-1499/1407.Top%20Travellers/README_EN.md) | `Database` | Easy | | +| 1408 | [String Matching in an Array](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README_EN.md) | `Array`,`String`,`String Matching` | Easy | Weekly Contest 184 | +| 1409 | [Queries on a Permutation With Key](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README_EN.md) | `Binary Indexed Tree`,`Array`,`Simulation` | Medium | Weekly Contest 184 | +| 1410 | [HTML Entity Parser](/solution/1400-1499/1410.HTML%20Entity%20Parser/README_EN.md) | `Hash Table`,`String` | Medium | Weekly Contest 184 | +| 1411 | [Number of Ways to Paint N × 3 Grid](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README_EN.md) | `Dynamic Programming` | Hard | Weekly Contest 184 | +| 1412 | [Find the Quiet Students in All Exams](/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README_EN.md) | `Database` | Hard | 🔒 | +| 1413 | [Minimum Value to Get Positive Step by Step Sum](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README_EN.md) | `Array`,`Prefix Sum` | Easy | Biweekly Contest 24 | +| 1414 | [Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README_EN.md) | `Greedy`,`Math` | Medium | Biweekly Contest 24 | +| 1415 | [The k-th Lexicographical String of All Happy Strings of Length n](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README_EN.md) | `String`,`Backtracking` | Medium | Biweekly Contest 24 | +| 1416 | [Restore The Array](/solution/1400-1499/1416.Restore%20The%20Array/README_EN.md) | `String`,`Dynamic Programming` | Hard | Biweekly Contest 24 | +| 1417 | [Reformat The String](/solution/1400-1499/1417.Reformat%20The%20String/README_EN.md) | `String` | Easy | Weekly Contest 185 | +| 1418 | [Display Table of Food Orders in a Restaurant](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README_EN.md) | `Array`,`Hash Table`,`String`,`Ordered Set`,`Sorting` | Medium | Weekly Contest 185 | +| 1419 | [Minimum Number of Frogs Croaking](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README_EN.md) | `String`,`Counting` | Medium | Weekly Contest 185 | +| 1420 | [Build Array Where You Can Find The Maximum Exactly K Comparisons](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README_EN.md) | `Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 185 | +| 1421 | [NPV Queries](/solution/1400-1499/1421.NPV%20Queries/README_EN.md) | `Database` | Easy | 🔒 | +| 1422 | [Maximum Score After Splitting a String](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README_EN.md) | `String`,`Prefix Sum` | Easy | Weekly Contest 186 | +| 1423 | [Maximum Points You Can Obtain from Cards](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README_EN.md) | `Array`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 186 | +| 1424 | [Diagonal Traverse II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 186 | +| 1425 | [Constrained Subsequence Sum](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | Weekly Contest 186 | +| 1426 | [Counting Elements](/solution/1400-1499/1426.Counting%20Elements/README_EN.md) | `Array`,`Hash Table` | Easy | 🔒 | +| 1427 | [Perform String Shifts](/solution/1400-1499/1427.Perform%20String%20Shifts/README_EN.md) | `Array`,`Math`,`String` | Easy | 🔒 | +| 1428 | [Leftmost Column with at Least a One](/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README_EN.md) | `Array`,`Binary Search`,`Interactive`,`Matrix` | Medium | 🔒 | +| 1429 | [First Unique Number](/solution/1400-1499/1429.First%20Unique%20Number/README_EN.md) | `Design`,`Queue`,`Array`,`Hash Table`,`Data Stream` | Medium | 🔒 | +| 1430 | [Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](/solution/1400-1499/1430.Check%20If%20a%20String%20Is%20a%20Valid%20Sequence%20from%20Root%20to%20Leaves%20Path%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | +| 1431 | [Kids With the Greatest Number of Candies](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README_EN.md) | `Array` | Easy | Biweekly Contest 25 | +| 1432 | [Max Difference You Can Get From Changing an Integer](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README_EN.md) | `Greedy`,`Math` | Medium | Biweekly Contest 25 | +| 1433 | [Check If a String Can Break Another String](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README_EN.md) | `Greedy`,`String`,`Sorting` | Medium | Biweekly Contest 25 | +| 1434 | [Number of Ways to Wear Different Hats to Each Other](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 25 | +| 1435 | [Create a Session Bar Chart](/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README_EN.md) | `Database` | Easy | 🔒 | +| 1436 | [Destination City](/solution/1400-1499/1436.Destination%20City/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 187 | +| 1437 | [Check If All 1's Are at Least Length K Places Away](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README_EN.md) | `Array` | Easy | Weekly Contest 187 | +| 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README_EN.md) | `Queue`,`Array`,`Ordered Set`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | Weekly Contest 187 | +| 1439 | [Find the Kth Smallest Sum of a Matrix With Sorted Rows](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README_EN.md) | `Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)` | Hard | Weekly Contest 187 | +| 1440 | [Evaluate Boolean Expression](/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README_EN.md) | `Database` | Medium | 🔒 | +| 1441 | [Build an Array With Stack Operations](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README_EN.md) | `Stack`,`Array`,`Simulation` | Medium | Weekly Contest 188 | +| 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Math`,`Prefix Sum` | Medium | Weekly Contest 188 | +| 1443 | [Minimum Time to Collect All Apples in a Tree](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table` | Medium | Weekly Contest 188 | +| 1444 | [Number of Ways of Cutting a Pizza](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 188 | +| 1445 | [Apples & Oranges](/solution/1400-1499/1445.Apples%20%26%20Oranges/README_EN.md) | `Database` | Medium | 🔒 | +| 1446 | [Consecutive Characters](/solution/1400-1499/1446.Consecutive%20Characters/README_EN.md) | `String` | Easy | Biweekly Contest 26 | +| 1447 | [Simplified Fractions](/solution/1400-1499/1447.Simplified%20Fractions/README_EN.md) | `Math`,`String`,`Number Theory` | Medium | Biweekly Contest 26 | +| 1448 | [Count Good Nodes in Binary Tree](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Biweekly Contest 26 | +| 1449 | [Form Largest Integer With Digits That Add up to Target](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 26 | +| 1450 | [Number of Students Doing Homework at a Given Time](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README_EN.md) | `Array` | Easy | Weekly Contest 189 | +| 1451 | [Rearrange Words in a Sentence](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README_EN.md) | `String`,`Sorting` | Medium | Weekly Contest 189 | +| 1452 | [People Whose List of Favorite Companies Is Not a Subset of Another List](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 189 | +| 1453 | [Maximum Number of Darts Inside of a Circular Dartboard](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README_EN.md) | `Geometry`,`Array`,`Math` | Hard | Weekly Contest 189 | +| 1454 | [Active Users](/solution/1400-1499/1454.Active%20Users/README_EN.md) | `Database` | Medium | 🔒 | +| 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README_EN.md) | `Two Pointers`,`String`,`String Matching` | Easy | Weekly Contest 190 | +| 1456 | [Maximum Number of Vowels in a Substring of Given Length](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README_EN.md) | `String`,`Sliding Window` | Medium | Weekly Contest 190 | +| 1457 | [Pseudo-Palindromic Paths in a Binary Tree](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 190 | +| 1458 | [Max Dot Product of Two Subsequences](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 190 | +| 1459 | [Rectangles Area](/solution/1400-1499/1459.Rectangles%20Area/README_EN.md) | `Database` | Medium | 🔒 | +| 1460 | [Make Two Arrays Equal by Reversing Subarrays](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 27 | +| 1461 | [Check If a String Contains All Binary Codes of Size K](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Hash Function`,`Rolling Hash` | Medium | Biweekly Contest 27 | +| 1462 | [Course Schedule IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | Biweekly Contest 27 | +| 1463 | [Cherry Pickup II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 27 | +| 1464 | [Maximum Product of Two Elements in an Array](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Easy | Weekly Contest 191 | +| 1465 | [Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 191 | +| 1466 | [Reorder Routes to Make All Paths Lead to the City Zero](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 191 | +| 1467 | [Probability of a Two Boxes Having The Same Number of Distinct Balls](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Backtracking`,`Combinatorics`,`Probability and Statistics` | Hard | Weekly Contest 191 | +| 1468 | [Calculate Salaries](/solution/1400-1499/1468.Calculate%20Salaries/README_EN.md) | `Database` | Medium | 🔒 | +| 1469 | [Find All The Lonely Nodes](/solution/1400-1499/1469.Find%20All%20The%20Lonely%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Easy | 🔒 | +| 1470 | [Shuffle the Array](/solution/1400-1499/1470.Shuffle%20the%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 192 | +| 1471 | [The k Strongest Values in an Array](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README_EN.md) | `Array`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 192 | +| 1472 | [Design Browser History](/solution/1400-1499/1472.Design%20Browser%20History/README_EN.md) | `Stack`,`Design`,`Array`,`Linked List`,`Data Stream`,`Doubly-Linked List` | Medium | Weekly Contest 192 | +| 1473 | [Paint House III](/solution/1400-1499/1473.Paint%20House%20III/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 192 | +| 1474 | [Delete N Nodes After M Nodes of a Linked List](/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README_EN.md) | `Linked List` | Easy | 🔒 | +| 1475 | [Final Prices With a Special Discount in a Shop](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Easy | Biweekly Contest 28 | +| 1476 | [Subrectangle Queries](/solution/1400-1499/1476.Subrectangle%20Queries/README_EN.md) | `Design`,`Array`,`Matrix` | Medium | Biweekly Contest 28 | +| 1477 | [Find Two Non-overlapping Sub-arrays Each With Target Sum](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sliding Window` | Medium | Biweekly Contest 28 | +| 1478 | [Allocate Mailboxes](/solution/1400-1499/1478.Allocate%20Mailboxes/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 28 | +| 1479 | [Sales by Day of the Week](/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README_EN.md) | `Database` | Hard | 🔒 | +| 1480 | [Running Sum of 1d Array](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README_EN.md) | `Array`,`Prefix Sum` | Easy | Weekly Contest 193 | +| 1481 | [Least Number of Unique Integers after K Removals](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Weekly Contest 193 | +| 1482 | [Minimum Number of Days to Make m Bouquets](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 193 | +| 1483 | [Kth Ancestor of a Tree Node](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 193 | +| 1484 | [Group Sold Products By The Date](/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README_EN.md) | `Database` | Easy | | +| 1485 | [Clone Binary Tree With Random Pointer](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 | +| 1486 | [XOR Operation in an Array](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README_EN.md) | `Bit Manipulation`,`Math` | Easy | Weekly Contest 194 | +| 1487 | [Making File Names Unique](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 194 | +| 1488 | [Avoid Flood in The City](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Binary Search`,`Heap (Priority Queue)` | Medium | Weekly Contest 194 | +| 1489 | [Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README_EN.md) | `Union Find`,`Graph`,`Minimum Spanning Tree`,`Sorting`,`Strongly Connected Component` | Hard | Weekly Contest 194 | +| 1490 | [Clone N-ary Tree](/solution/1400-1499/1490.Clone%20N-ary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table` | Medium | 🔒 | +| 1491 | [Average Salary Excluding the Minimum and Maximum Salary](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README_EN.md) | `Array`,`Sorting` | Easy | Biweekly Contest 29 | +| 1492 | [The kth Factor of n](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README_EN.md) | `Math`,`Number Theory` | Medium | Biweekly Contest 29 | +| 1493 | [Longest Subarray of 1's After Deleting One Element](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README_EN.md) | `Array`,`Dynamic Programming`,`Sliding Window` | Medium | Biweekly Contest 29 | +| 1494 | [Parallel Courses II](/solution/1400-1499/1494.Parallel%20Courses%20II/README_EN.md) | `Bit Manipulation`,`Graph`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 29 | +| 1495 | [Friendly Movies Streamed Last Month](/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README_EN.md) | `Database` | Easy | 🔒 | +| 1496 | [Path Crossing](/solution/1400-1499/1496.Path%20Crossing/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 195 | +| 1497 | [Check If Array Pairs Are Divisible by k](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 195 | +| 1498 | [Number of Subsequences That Satisfy the Given Sum Condition](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Weekly Contest 195 | +| 1499 | [Max Value of Equation](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README_EN.md) | `Queue`,`Array`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | Weekly Contest 195 | +| 1500 | [Design a File Sharing System](/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README_EN.md) | `Design`,`Hash Table`,`Data Stream`,`Heap (Priority Queue)` | Medium | 🔒 | +| 1501 | [Countries You Can Safely Invest In](/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README_EN.md) | `Database` | Medium | 🔒 | +| 1502 | [Can Make Arithmetic Progression From Sequence](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 196 | +| 1503 | [Last Moment Before All Ants Fall Out of a Plank](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README_EN.md) | `Brainteaser`,`Array`,`Simulation` | Medium | Weekly Contest 196 | +| 1504 | [Count Submatrices With All Ones](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Matrix`,`Monotonic Stack` | Medium | Weekly Contest 196 | +| 1505 | [Minimum Possible Integer After at Most K Adjacent Swaps On Digits](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README_EN.md) | `Greedy`,`Binary Indexed Tree`,`Segment Tree`,`String` | Hard | Weekly Contest 196 | +| 1506 | [Find Root of N-Ary Tree](/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Hash Table` | Medium | 🔒 | +| 1507 | [Reformat Date](/solution/1500-1599/1507.Reformat%20Date/README_EN.md) | `String` | Easy | Biweekly Contest 30 | +| 1508 | [Range Sum of Sorted Subarray Sums](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 30 | +| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 30 | +| 1510 | [Stone Game IV](/solution/1500-1599/1510.Stone%20Game%20IV/README_EN.md) | `Math`,`Dynamic Programming`,`Game Theory` | Hard | Biweekly Contest 30 | +| 1511 | [Customer Order Frequency](/solution/1500-1599/1511.Customer%20Order%20Frequency/README_EN.md) | `Database` | Easy | 🔒 | +| 1512 | [Number of Good Pairs](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting` | Easy | Weekly Contest 197 | +| 1513 | [Number of Substrings With Only 1s](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README_EN.md) | `Math`,`String` | Medium | Weekly Contest 197 | +| 1514 | [Path with Maximum Probability](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Weekly Contest 197 | +| 1515 | [Best Position for a Service Centre](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README_EN.md) | `Geometry`,`Math`,`Randomized` | Hard | Weekly Contest 197 | +| 1516 | [Move Sub-Tree of N-Ary Tree](/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README_EN.md) | `Tree`,`Depth-First Search` | Hard | 🔒 | +| 1517 | [Find Users With Valid E-Mails](/solution/1500-1599/1517.Find%20Users%20With%20Valid%20E-Mails/README_EN.md) | `Database` | Easy | | +| 1518 | [Water Bottles](/solution/1500-1599/1518.Water%20Bottles/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 198 | +| 1519 | [Number of Nodes in the Sub-Tree With the Same Label](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Counting` | Medium | Weekly Contest 198 | +| 1520 | [Maximum Number of Non-Overlapping Substrings](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README_EN.md) | `Greedy`,`String` | Hard | Weekly Contest 198 | +| 1521 | [Find a Value of a Mysterious Function Closest to Target](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README_EN.md) | `Bit Manipulation`,`Segment Tree`,`Array`,`Binary Search` | Hard | Weekly Contest 198 | +| 1522 | [Diameter of N-Ary Tree](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README_EN.md) | `Tree`,`Depth-First Search` | Medium | 🔒 | +| 1523 | [Count Odd Numbers in an Interval Range](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README_EN.md) | `Math` | Easy | Biweekly Contest 31 | +| 1524 | [Number of Sub-arrays With Odd Sum](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 31 | +| 1525 | [Number of Good Ways to Split a String](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 31 | +| 1526 | [Minimum Number of Increments on Subarrays to Form a Target Array](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README_EN.md) | `Stack`,`Greedy`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Hard | Biweekly Contest 31 | +| 1527 | [Patients With a Condition](/solution/1500-1599/1527.Patients%20With%20a%20Condition/README_EN.md) | `Database` | Easy | | +| 1528 | [Shuffle String](/solution/1500-1599/1528.Shuffle%20String/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 199 | +| 1529 | [Minimum Suffix Flips](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 199 | +| 1530 | [Number of Good Leaf Nodes Pairs](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 199 | +| 1531 | [String Compression II](/solution/1500-1599/1531.String%20Compression%20II/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 199 | +| 1532 | [The Most Recent Three Orders](/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README_EN.md) | `Database` | Medium | 🔒 | +| 1533 | [Find the Index of the Large Integer](/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README_EN.md) | `Array`,`Binary Search`,`Interactive` | Medium | 🔒 | +| 1534 | [Count Good Triplets](/solution/1500-1599/1534.Count%20Good%20Triplets/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 200 | +| 1535 | [Find the Winner of an Array Game](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 200 | +| 1536 | [Minimum Swaps to Arrange a Binary Grid](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | Weekly Contest 200 | +| 1537 | [Get the Maximum Score](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Dynamic Programming` | Hard | Weekly Contest 200 | +| 1538 | [Guess the Majority in a Hidden Array](/solution/1500-1599/1538.Guess%20the%20Majority%20in%20a%20Hidden%20Array/README_EN.md) | `Array`,`Math`,`Interactive` | Medium | 🔒 | +| 1539 | [Kth Missing Positive Number](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README_EN.md) | `Array`,`Binary Search` | Easy | Biweekly Contest 32 | +| 1540 | [Can Convert String in K Moves](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README_EN.md) | `Hash Table`,`String` | Medium | Biweekly Contest 32 | +| 1541 | [Minimum Insertions to Balance a Parentheses String](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README_EN.md) | `Stack`,`Greedy`,`String` | Medium | Biweekly Contest 32 | +| 1542 | [Find Longest Awesome Substring](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String` | Hard | Biweekly Contest 32 | +| 1543 | [Fix Product Name Format](/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README_EN.md) | `Database` | Easy | 🔒 | +| 1544 | [Make The String Great](/solution/1500-1599/1544.Make%20The%20String%20Great/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 201 | +| 1545 | [Find Kth Bit in Nth Binary String](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README_EN.md) | `Recursion`,`String`,`Simulation` | Medium | Weekly Contest 201 | +| 1546 | [Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 201 | +| 1547 | [Minimum Cost to Cut a Stick](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 201 | +| 1548 | [The Most Similar Path in a Graph](/solution/1500-1599/1548.The%20Most%20Similar%20Path%20in%20a%20Graph/README_EN.md) | `Graph`,`Dynamic Programming` | Hard | 🔒 | +| 1549 | [The Most Recent Orders for Each Product](/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README_EN.md) | `Database` | Medium | 🔒 | +| 1550 | [Three Consecutive Odds](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README_EN.md) | `Array` | Easy | Weekly Contest 202 | +| 1551 | [Minimum Operations to Make Array Equal](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README_EN.md) | `Math` | Medium | Weekly Contest 202 | +| 1552 | [Magnetic Force Between Two Balls](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Medium | Weekly Contest 202 | +| 1553 | [Minimum Number of Days to Eat N Oranges](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README_EN.md) | `Memoization`,`Dynamic Programming` | Hard | Weekly Contest 202 | +| 1554 | [Strings Differ by One Character](/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README_EN.md) | `Hash Table`,`String`,`Hash Function`,`Rolling Hash` | Medium | 🔒 | +| 1555 | [Bank Account Summary](/solution/1500-1599/1555.Bank%20Account%20Summary/README_EN.md) | `Database` | Medium | 🔒 | +| 1556 | [Thousand Separator](/solution/1500-1599/1556.Thousand%20Separator/README_EN.md) | `String` | Easy | Biweekly Contest 33 | +| 1557 | [Minimum Number of Vertices to Reach All Nodes](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README_EN.md) | `Graph` | Medium | Biweekly Contest 33 | +| 1558 | [Minimum Numbers of Function Calls to Make Target Array](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array` | Medium | Biweekly Contest 33 | +| 1559 | [Detect Cycles in 2D Grid](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Biweekly Contest 33 | +| 1560 | [Most Visited Sector in a Circular Track](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 203 | +| 1561 | [Maximum Number of Coins You Can Get](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README_EN.md) | `Greedy`,`Array`,`Math`,`Game Theory`,`Sorting` | Medium | Weekly Contest 203 | +| 1562 | [Find Latest Group of Size M](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README_EN.md) | `Array`,`Binary Search`,`Simulation` | Medium | Weekly Contest 203 | +| 1563 | [Stone Game V](/solution/1500-1599/1563.Stone%20Game%20V/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Hard | Weekly Contest 203 | +| 1564 | [Put Boxes Into the Warehouse I](/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | +| 1565 | [Unique Orders and Customers Per Month](/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README_EN.md) | `Database` | Easy | 🔒 | +| 1566 | [Detect Pattern of Length M Repeated K or More Times](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 204 | +| 1567 | [Maximum Length of Subarray With Positive Product](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 204 | +| 1568 | [Minimum Number of Days to Disconnect Island](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`,`Strongly Connected Component` | Hard | Weekly Contest 204 | +| 1569 | [Number of Ways to Reorder Array to Get Same BST](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README_EN.md) | `Tree`,`Union Find`,`Binary Search Tree`,`Memoization`,`Array`,`Math`,`Divide and Conquer`,`Dynamic Programming`,`Binary Tree`,`Combinatorics` | Hard | Weekly Contest 204 | +| 1570 | [Dot Product of Two Sparse Vectors](/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README_EN.md) | `Design`,`Array`,`Hash Table`,`Two Pointers` | Medium | 🔒 | +| 1571 | [Warehouse Manager](/solution/1500-1599/1571.Warehouse%20Manager/README_EN.md) | `Database` | Easy | 🔒 | +| 1572 | [Matrix Diagonal Sum](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README_EN.md) | `Array`,`Matrix` | Easy | Biweekly Contest 34 | +| 1573 | [Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README_EN.md) | `Math`,`String` | Medium | Biweekly Contest 34 | +| 1574 | [Shortest Subarray to be Removed to Make Array Sorted](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README_EN.md) | `Stack`,`Array`,`Two Pointers`,`Binary Search`,`Monotonic Stack` | Medium | Biweekly Contest 34 | +| 1575 | [Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 34 | +| 1576 | [Replace All 's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md) | `String` | Easy | Weekly Contest 205 | +| 1577 | [Number of Ways Where Square of Number Is Equal to Product of Two Numbers](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README_EN.md) | `Array`,`Hash Table`,`Math`,`Two Pointers` | Medium | Weekly Contest 205 | +| 1578 | [Minimum Time to Make Rope Colorful](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README_EN.md) | `Greedy`,`Array`,`String`,`Dynamic Programming` | Medium | Weekly Contest 205 | +| 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README_EN.md) | `Union Find`,`Graph` | Hard | Weekly Contest 205 | +| 1580 | [Put Boxes Into the Warehouse II](/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | +| 1581 | [Customer Who Visited but Did Not Make Any Transactions](/solution/1500-1599/1581.Customer%20Who%20Visited%20but%20Did%20Not%20Make%20Any%20Transactions/README_EN.md) | `Database` | Easy | | +| 1582 | [Special Positions in a Binary Matrix](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 206 | +| 1583 | [Count Unhappy Friends](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 206 | +| 1584 | [Min Cost to Connect All Points](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README_EN.md) | `Union Find`,`Graph`,`Array`,`Minimum Spanning Tree` | Medium | Weekly Contest 206 | +| 1585 | [Check If String Is Transformable With Substring Sort Operations](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README_EN.md) | `Greedy`,`String`,`Sorting` | Hard | Weekly Contest 206 | +| 1586 | [Binary Search Tree Iterator II](/solution/1500-1599/1586.Binary%20Search%20Tree%20Iterator%20II/README_EN.md) | `Stack`,`Tree`,`Design`,`Binary Search Tree`,`Binary Tree`,`Iterator` | Medium | 🔒 | +| 1587 | [Bank Account Summary II](/solution/1500-1599/1587.Bank%20Account%20Summary%20II/README_EN.md) | `Database` | Easy | | +| 1588 | [Sum of All Odd Length Subarrays](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README_EN.md) | `Array`,`Math`,`Prefix Sum` | Easy | Biweekly Contest 35 | +| 1589 | [Maximum Sum Obtained of Any Permutation](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 35 | +| 1590 | [Make Sum Divisible by P](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Biweekly Contest 35 | +| 1591 | [Strange Printer II](/solution/1500-1599/1591.Strange%20Printer%20II/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Matrix` | Hard | Biweekly Contest 35 | +| 1592 | [Rearrange Spaces Between Words](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README_EN.md) | `String` | Easy | Weekly Contest 207 | +| 1593 | [Split a String Into the Max Number of Unique Substrings](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README_EN.md) | `Hash Table`,`String`,`Backtracking` | Medium | Weekly Contest 207 | +| 1594 | [Maximum Non Negative Product in a Matrix](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 207 | +| 1595 | [Minimum Cost to Connect Two Groups of Points](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`,`Matrix` | Hard | Weekly Contest 207 | +| 1596 | [The Most Frequently Ordered Products for Each Customer](/solution/1500-1599/1596.The%20Most%20Frequently%20Ordered%20Products%20for%20Each%20Customer/README_EN.md) | `Database` | Medium | 🔒 | +| 1597 | [Build Binary Expression Tree From Infix Expression](/solution/1500-1599/1597.Build%20Binary%20Expression%20Tree%20From%20Infix%20Expression/README_EN.md) | `Stack`,`Tree`,`String`,`Binary Tree` | Hard | 🔒 | +| 1598 | [Crawler Log Folder](/solution/1500-1599/1598.Crawler%20Log%20Folder/README_EN.md) | `Stack`,`Array`,`String` | Easy | Weekly Contest 208 | +| 1599 | [Maximum Profit of Operating a Centennial Wheel](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 208 | +| 1600 | [Throne Inheritance](/solution/1600-1699/1600.Throne%20Inheritance/README_EN.md) | `Tree`,`Depth-First Search`,`Design`,`Hash Table` | Medium | Weekly Contest 208 | +| 1601 | [Maximum Number of Achievable Transfer Requests](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Hard | Weekly Contest 208 | +| 1602 | [Find Nearest Right Node in Binary Tree](/solution/1600-1699/1602.Find%20Nearest%20Right%20Node%20in%20Binary%20Tree/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | +| 1603 | [Design Parking System](/solution/1600-1699/1603.Design%20Parking%20System/README_EN.md) | `Design`,`Counting`,`Simulation` | Easy | Biweekly Contest 36 | +| 1604 | [Alert Using Same Key-Card Three or More Times in a One Hour Period](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Biweekly Contest 36 | +| 1605 | [Find Valid Matrix Given Row and Column Sums](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | Biweekly Contest 36 | +| 1606 | [Find Servers That Handled Most Number of Requests](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README_EN.md) | `Greedy`,`Array`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Biweekly Contest 36 | +| 1607 | [Sellers With No Sales](/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README_EN.md) | `Database` | Easy | 🔒 | +| 1608 | [Special Array With X Elements Greater Than or Equal X](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Easy | Weekly Contest 209 | +| 1609 | [Even Odd Tree](/solution/1600-1699/1609.Even%20Odd%20Tree/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 209 | +| 1610 | [Maximum Number of Visible Points](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README_EN.md) | `Geometry`,`Array`,`Math`,`Sorting`,`Sliding Window` | Hard | Weekly Contest 209 | +| 1611 | [Minimum One Bit Operations to Make Integers Zero](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README_EN.md) | `Bit Manipulation`,`Memoization`,`Dynamic Programming` | Hard | Weekly Contest 209 | +| 1612 | [Check If Two Expression Trees are Equivalent](/solution/1600-1699/1612.Check%20If%20Two%20Expression%20Trees%20are%20Equivalent/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree`,`Counting` | Medium | 🔒 | +| 1613 | [Find the Missing IDs](/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README_EN.md) | `Database` | Medium | 🔒 | +| 1614 | [Maximum Nesting Depth of the Parentheses](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README_EN.md) | `Stack`,`String` | Easy | Weekly Contest 210 | +| 1615 | [Maximal Network Rank](/solution/1600-1699/1615.Maximal%20Network%20Rank/README_EN.md) | `Graph` | Medium | Weekly Contest 210 | +| 1616 | [Split Two Strings to Make Palindrome](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README_EN.md) | `Two Pointers`,`String` | Medium | Weekly Contest 210 | +| 1617 | [Count Subtrees With Max Distance Between Cities](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README_EN.md) | `Bit Manipulation`,`Tree`,`Dynamic Programming`,`Bitmask`,`Enumeration` | Hard | Weekly Contest 210 | +| 1618 | [Maximum Font to Fit a Sentence in a Screen](/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README_EN.md) | `Array`,`String`,`Binary Search`,`Interactive` | Medium | 🔒 | +| 1619 | [Mean of Array After Removing Some Elements](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README_EN.md) | `Array`,`Sorting` | Easy | Biweekly Contest 37 | +| 1620 | [Coordinate With Maximum Network Quality](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README_EN.md) | `Array`,`Enumeration` | Medium | Biweekly Contest 37 | +| 1621 | [Number of Sets of K Non-Overlapping Line Segments](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | Biweekly Contest 37 | +| 1622 | [Fancy Sequence](/solution/1600-1699/1622.Fancy%20Sequence/README_EN.md) | `Design`,`Segment Tree`,`Math` | Hard | Biweekly Contest 37 | +| 1623 | [All Valid Triplets That Can Represent a Country](/solution/1600-1699/1623.All%20Valid%20Triplets%20That%20Can%20Represent%20a%20Country/README_EN.md) | `Database` | Easy | 🔒 | +| 1624 | [Largest Substring Between Two Equal Characters](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 211 | +| 1625 | [Lexicographically Smallest String After Applying Operations](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`String`,`Enumeration` | Medium | Weekly Contest 211 | +| 1626 | [Best Team With No Conflicts](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 211 | +| 1627 | [Graph Connectivity With Threshold](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README_EN.md) | `Union Find`,`Array`,`Math`,`Number Theory` | Hard | Weekly Contest 211 | +| 1628 | [Design an Expression Tree With Evaluate Function](/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README_EN.md) | `Stack`,`Tree`,`Design`,`Array`,`Math`,`Binary Tree` | Medium | 🔒 | +| 1629 | [Slowest Key](/solution/1600-1699/1629.Slowest%20Key/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 212 | +| 1630 | [Arithmetic Subarrays](/solution/1600-1699/1630.Arithmetic%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 212 | +| 1631 | [Path With Minimum Effort](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix`,`Heap (Priority Queue)` | Medium | Weekly Contest 212 | +| 1632 | [Rank Transform of a Matrix](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README_EN.md) | `Union Find`,`Graph`,`Topological Sort`,`Array`,`Matrix`,`Sorting` | Hard | Weekly Contest 212 | +| 1633 | [Percentage of Users Attended a Contest](/solution/1600-1699/1633.Percentage%20of%20Users%20Attended%20a%20Contest/README_EN.md) | `Database` | Easy | | +| 1634 | [Add Two Polynomials Represented as Linked Lists](/solution/1600-1699/1634.Add%20Two%20Polynomials%20Represented%20as%20Linked%20Lists/README_EN.md) | `Linked List`,`Math`,`Two Pointers` | Medium | 🔒 | +| 1635 | [Hopper Company Queries I](/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README_EN.md) | `Database` | Hard | 🔒 | +| 1636 | [Sort Array by Increasing Frequency](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 38 | +| 1637 | [Widest Vertical Area Between Two Points Containing No Points](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README_EN.md) | `Array`,`Sorting` | Easy | Biweekly Contest 38 | +| 1638 | [Count Substrings That Differ by One Character](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming`,`Enumeration` | Medium | Biweekly Contest 38 | +| 1639 | [Number of Ways to Form a Target String Given a Dictionary](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Hard | Biweekly Contest 38 | +| 1640 | [Check Array Formation Through Concatenation](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 213 | +| 1641 | [Count Sorted Vowel Strings](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | Weekly Contest 213 | +| 1642 | [Furthest Building You Can Reach](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 213 | +| 1643 | [Kth Smallest Instructions](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 213 | +| 1644 | [Lowest Common Ancestor of a Binary Tree II](/solution/1600-1699/1644.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | +| 1645 | [Hopper Company Queries II](/solution/1600-1699/1645.Hopper%20Company%20Queries%20II/README_EN.md) | `Database` | Hard | 🔒 | +| 1646 | [Get Maximum in Generated Array](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 214 | +| 1647 | [Minimum Deletions to Make Character Frequencies Unique](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 214 | +| 1648 | [Sell Diminishing-Valued Colored Balls](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 214 | +| 1649 | [Create Sorted Array through Instructions](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | Weekly Contest 214 | +| 1650 | [Lowest Common Ancestor of a Binary Tree III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README_EN.md) | `Tree`,`Hash Table`,`Two Pointers`,`Binary Tree` | Medium | 🔒 | +| 1651 | [Hopper Company Queries III](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README_EN.md) | `Database` | Hard | 🔒 | +| 1652 | [Defuse the Bomb](/solution/1600-1699/1652.Defuse%20the%20Bomb/README_EN.md) | `Array`,`Sliding Window` | Easy | Biweekly Contest 39 | +| 1653 | [Minimum Deletions to Make String Balanced](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README_EN.md) | `Stack`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 39 | +| 1654 | [Minimum Jumps to Reach Home](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming` | Medium | Biweekly Contest 39 | +| 1655 | [Distribute Repeating Integers](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | Biweekly Contest 39 | +| 1656 | [Design an Ordered Stream](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README_EN.md) | `Design`,`Array`,`Hash Table`,`Data Stream` | Easy | Weekly Contest 215 | +| 1657 | [Determine if Two Strings Are Close](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README_EN.md) | `Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 215 | +| 1658 | [Minimum Operations to Reduce X to Zero](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 215 | +| 1659 | [Maximize Grid Happiness](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README_EN.md) | `Bit Manipulation`,`Memoization`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 215 | +| 1660 | [Correct a Binary Tree](/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 | +| 1661 | [Average Time of Process per Machine](/solution/1600-1699/1661.Average%20Time%20of%20Process%20per%20Machine/README_EN.md) | `Database` | Easy | | +| 1662 | [Check If Two String Arrays are Equivalent](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 216 | +| 1663 | [Smallest String With A Given Numeric Value](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 216 | +| 1664 | [Ways to Make a Fair Array](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 216 | +| 1665 | [Minimum Initial Energy to Finish Tasks](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Weekly Contest 216 | +| 1666 | [Change the Root of a Binary Tree](/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | +| 1667 | [Fix Names in a Table](/solution/1600-1699/1667.Fix%20Names%20in%20a%20Table/README_EN.md) | `Database` | Easy | | +| 1668 | [Maximum Repeating Substring](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README_EN.md) | `String`,`Dynamic Programming`,`String Matching` | Easy | Biweekly Contest 40 | +| 1669 | [Merge In Between Linked Lists](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README_EN.md) | `Linked List` | Medium | Biweekly Contest 40 | +| 1670 | [Design Front Middle Back Queue](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README_EN.md) | `Design`,`Queue`,`Array`,`Linked List`,`Data Stream` | Medium | Biweekly Contest 40 | +| 1671 | [Minimum Number of Removals to Make Mountain Array](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Dynamic Programming` | Hard | Biweekly Contest 40 | +| 1672 | [Richest Customer Wealth](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 217 | +| 1673 | [Find the Most Competitive Subsequence](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README_EN.md) | `Stack`,`Greedy`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 217 | +| 1674 | [Minimum Moves to Make Array Complementary](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 217 | +| 1675 | [Minimize Deviation in Array](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README_EN.md) | `Greedy`,`Array`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Weekly Contest 217 | +| 1676 | [Lowest Common Ancestor of a Binary Tree IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 | +| 1677 | [Product's Worth Over Invoices](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README_EN.md) | `Database` | Easy | 🔒 | +| 1678 | [Goal Parser Interpretation](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README_EN.md) | `String` | Easy | Weekly Contest 218 | +| 1679 | [Max Number of K-Sum Pairs](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 218 | +| 1680 | [Concatenation of Consecutive Binary Numbers](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README_EN.md) | `Bit Manipulation`,`Math`,`Simulation` | Medium | Weekly Contest 218 | +| 1681 | [Minimum Incompatibility](/solution/1600-1699/1681.Minimum%20Incompatibility/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 218 | +| 1682 | [Longest Palindromic Subsequence II](/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README_EN.md) | `String`,`Dynamic Programming` | Medium | 🔒 | +| 1683 | [Invalid Tweets](/solution/1600-1699/1683.Invalid%20Tweets/README_EN.md) | `Database` | Easy | | +| 1684 | [Count the Number of Consistent Strings](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String` | Easy | Biweekly Contest 41 | +| 1685 | [Sum of Absolute Differences in a Sorted Array](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README_EN.md) | `Array`,`Math`,`Prefix Sum` | Medium | Biweekly Contest 41 | +| 1686 | [Stone Game VI](/solution/1600-1699/1686.Stone%20Game%20VI/README_EN.md) | `Greedy`,`Array`,`Math`,`Game Theory`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 41 | +| 1687 | [Delivering Boxes from Storage to Ports](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README_EN.md) | `Segment Tree`,`Queue`,`Array`,`Dynamic Programming`,`Prefix Sum`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | Biweekly Contest 41 | +| 1688 | [Count of Matches in Tournament](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 219 | +| 1689 | [Partitioning Into Minimum Number Of Deci-Binary Numbers](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 219 | +| 1690 | [Stone Game VII](/solution/1600-1699/1690.Stone%20Game%20VII/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | Weekly Contest 219 | +| 1691 | [Maximum Height by Stacking Cuboids](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 219 | +| 1692 | [Count Ways to Distribute Candies](/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README_EN.md) | `Dynamic Programming` | Hard | 🔒 | +| 1693 | [Daily Leads and Partners](/solution/1600-1699/1693.Daily%20Leads%20and%20Partners/README_EN.md) | `Database` | Easy | | +| 1694 | [Reformat Phone Number](/solution/1600-1699/1694.Reformat%20Phone%20Number/README_EN.md) | `String` | Easy | Weekly Contest 220 | +| 1695 | [Maximum Erasure Value](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 220 | +| 1696 | [Jump Game VI](/solution/1600-1699/1696.Jump%20Game%20VI/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | Weekly Contest 220 | +| 1697 | [Checking Existence of Edge Length Limited Paths](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README_EN.md) | `Union Find`,`Graph`,`Array`,`Two Pointers`,`Sorting` | Hard | Weekly Contest 220 | +| 1698 | [Number of Distinct Substrings in a String](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README_EN.md) | `Trie`,`String`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Medium | 🔒 | +| 1699 | [Number of Calls Between Two Persons](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README_EN.md) | `Database` | Medium | 🔒 | +| 1700 | [Number of Students Unable to Eat Lunch](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README_EN.md) | `Stack`,`Queue`,`Array`,`Simulation` | Easy | Biweekly Contest 42 | +| 1701 | [Average Waiting Time](/solution/1700-1799/1701.Average%20Waiting%20Time/README_EN.md) | `Array`,`Simulation` | Medium | Biweekly Contest 42 | +| 1702 | [Maximum Binary String After Change](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README_EN.md) | `Greedy`,`String` | Medium | Biweekly Contest 42 | +| 1703 | [Minimum Adjacent Swaps for K Consecutive Ones](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sliding Window` | Hard | Biweekly Contest 42 | +| 1704 | [Determine if String Halves Are Alike](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README_EN.md) | `String`,`Counting` | Easy | Weekly Contest 221 | +| 1705 | [Maximum Number of Eaten Apples](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 221 | +| 1706 | [Where Will the Ball Fall](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 221 | +| 1707 | [Maximum XOR With an Element From Array](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README_EN.md) | `Bit Manipulation`,`Trie`,`Array` | Hard | Weekly Contest 221 | +| 1708 | [Largest Subarray Length K](/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README_EN.md) | `Greedy`,`Array` | Easy | 🔒 | +| 1709 | [Biggest Window Between Visits](/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README_EN.md) | `Database` | Medium | 🔒 | +| 1710 | [Maximum Units on a Truck](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 222 | +| 1711 | [Count Good Meals](/solution/1700-1799/1711.Count%20Good%20Meals/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 222 | +| 1712 | [Ways to Split Array Into Three Subarrays](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Prefix Sum` | Medium | Weekly Contest 222 | +| 1713 | [Minimum Operations to Make a Subsequence](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Binary Search` | Hard | Weekly Contest 222 | +| 1714 | [Sum Of Special Evenly-Spaced Elements In Array](/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | +| 1715 | [Count Apples and Oranges](/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README_EN.md) | `Database` | Medium | 🔒 | +| 1716 | [Calculate Money in Leetcode Bank](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README_EN.md) | `Math` | Easy | Biweekly Contest 43 | +| 1717 | [Maximum Score From Removing Substrings](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README_EN.md) | `Stack`,`Greedy`,`String` | Medium | Biweekly Contest 43 | +| 1718 | [Construct the Lexicographically Largest Valid Sequence](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README_EN.md) | `Array`,`Backtracking` | Medium | Biweekly Contest 43 | +| 1719 | [Number Of Ways To Reconstruct A Tree](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README_EN.md) | `Tree`,`Graph` | Hard | Biweekly Contest 43 | +| 1720 | [Decode XORed Array](/solution/1700-1799/1720.Decode%20XORed%20Array/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 223 | +| 1721 | [Swapping Nodes in a Linked List](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | Weekly Contest 223 | +| 1722 | [Minimize Hamming Distance After Swap Operations](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README_EN.md) | `Depth-First Search`,`Union Find`,`Array` | Medium | Weekly Contest 223 | +| 1723 | [Find Minimum Time to Finish All Jobs](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Hard | Weekly Contest 223 | +| 1724 | [Checking Existence of Edge Length Limited Paths II](/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README_EN.md) | `Union Find`,`Graph`,`Minimum Spanning Tree` | Hard | 🔒 | +| 1725 | [Number Of Rectangles That Can Form The Largest Square](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README_EN.md) | `Array` | Easy | Weekly Contest 224 | +| 1726 | [Tuple with Same Product](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 224 | +| 1727 | [Largest Submatrix With Rearrangements](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README_EN.md) | `Greedy`,`Array`,`Matrix`,`Sorting` | Medium | Weekly Contest 224 | +| 1728 | [Cat and Mouse II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README_EN.md) | `Graph`,`Topological Sort`,`Memoization`,`Array`,`Math`,`Dynamic Programming`,`Game Theory`,`Matrix` | Hard | Weekly Contest 224 | +| 1729 | [Find Followers Count](/solution/1700-1799/1729.Find%20Followers%20Count/README_EN.md) | `Database` | Easy | | +| 1730 | [Shortest Path to Get Food](/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 | +| 1731 | [The Number of Employees Which Report to Each Employee](/solution/1700-1799/1731.The%20Number%20of%20Employees%20Which%20Report%20to%20Each%20Employee/README_EN.md) | `Database` | Easy | | +| 1732 | [Find the Highest Altitude](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README_EN.md) | `Array`,`Prefix Sum` | Easy | Biweekly Contest 44 | +| 1733 | [Minimum Number of People to Teach](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Medium | Biweekly Contest 44 | +| 1734 | [Decode XORed Permutation](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Biweekly Contest 44 | +| 1735 | [Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Combinatorics`,`Number Theory` | Hard | Biweekly Contest 44 | +| 1736 | [Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README_EN.md) | `Greedy`,`String` | Easy | Weekly Contest 225 | +| 1737 | [Change Minimum Characters to Satisfy One of Three Conditions](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README_EN.md) | `Hash Table`,`String`,`Counting`,`Prefix Sum` | Medium | Weekly Contest 225 | +| 1738 | [Find Kth Largest XOR Coordinate Value](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README_EN.md) | `Bit Manipulation`,`Array`,`Divide and Conquer`,`Matrix`,`Prefix Sum`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 225 | +| 1739 | [Building Boxes](/solution/1700-1799/1739.Building%20Boxes/README_EN.md) | `Greedy`,`Math`,`Binary Search` | Hard | Weekly Contest 225 | +| 1740 | [Find Distance in a Binary Tree](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | 🔒 | +| 1741 | [Find Total Time Spent by Each Employee](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README_EN.md) | `Database` | Easy | | +| 1742 | [Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README_EN.md) | `Hash Table`,`Math`,`Counting` | Easy | Weekly Contest 226 | +| 1743 | [Restore the Array From Adjacent Pairs](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 226 | +| 1744 | [Can You Eat Your Favorite Candy on Your Favorite Day](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 226 | +| 1745 | [Palindrome Partitioning IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 226 | +| 1746 | [Maximum Subarray Sum After One Operation](/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | +| 1747 | [Leetflex Banned Accounts](/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README_EN.md) | `Database` | Medium | 🔒 | +| 1748 | [Sum of Unique Elements](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 45 | +| 1749 | [Maximum Absolute Sum of Any Subarray](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 45 | +| 1750 | [Minimum Length of String After Deleting Similar Ends](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README_EN.md) | `Two Pointers`,`String` | Medium | Biweekly Contest 45 | +| 1751 | [Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 45 | +| 1752 | [Check if Array Is Sorted and Rotated](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README_EN.md) | `Array` | Easy | Weekly Contest 227 | +| 1753 | [Maximum Score From Removing Stones](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README_EN.md) | `Greedy`,`Math`,`Heap (Priority Queue)` | Medium | Weekly Contest 227 | +| 1754 | [Largest Merge Of Two Strings](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 227 | +| 1755 | [Closest Subsequence Sum](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 227 | +| 1756 | [Design Most Recently Used Queue](/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README_EN.md) | `Stack`,`Design`,`Binary Indexed Tree`,`Array`,`Hash Table`,`Ordered Set` | Medium | 🔒 | +| 1757 | [Recyclable and Low Fat Products](/solution/1700-1799/1757.Recyclable%20and%20Low%20Fat%20Products/README_EN.md) | `Database` | Easy | | +| 1758 | [Minimum Changes To Make Alternating Binary String](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README_EN.md) | `String` | Easy | Weekly Contest 228 | +| 1759 | [Count Number of Homogenous Substrings](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README_EN.md) | `Math`,`String` | Medium | Weekly Contest 228 | +| 1760 | [Minimum Limit of Balls in a Bag](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 228 | +| 1761 | [Minimum Degree of a Connected Trio in a Graph](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README_EN.md) | `Graph` | Hard | Weekly Contest 228 | +| 1762 | [Buildings With an Ocean View](/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | 🔒 | +| 1763 | [Longest Nice Substring](/solution/1700-1799/1763.Longest%20Nice%20Substring/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Divide and Conquer`,`Sliding Window` | Easy | Biweekly Contest 46 | +| 1764 | [Form Array by Concatenating Subarrays of Another Array](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`String Matching` | Medium | Biweekly Contest 46 | +| 1765 | [Map of Highest Peak](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Biweekly Contest 46 | +| 1766 | [Tree of Coprimes](/solution/1700-1799/1766.Tree%20of%20Coprimes/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Math`,`Number Theory` | Hard | Biweekly Contest 46 | +| 1767 | [Find the Subtasks That Did Not Execute](/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README_EN.md) | `Database` | Hard | 🔒 | +| 1768 | [Merge Strings Alternately](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 229 | +| 1769 | [Minimum Number of Operations to Move All Balls to Each Box](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README_EN.md) | `Array`,`String` | Medium | Weekly Contest 229 | +| 1770 | [Maximum Score from Performing Multiplication Operations](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 229 | +| 1771 | [Maximize Palindrome Length From Subsequences](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 229 | +| 1772 | [Sort Features by Popularity](/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | 🔒 | +| 1773 | [Count Items Matching a Rule](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 230 | +| 1774 | [Closest Dessert Cost](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README_EN.md) | `Array`,`Dynamic Programming`,`Backtracking` | Medium | Weekly Contest 230 | +| 1775 | [Equal Sum Arrays With Minimum Number of Operations](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 230 | +| 1776 | [Car Fleet II](/solution/1700-1799/1776.Car%20Fleet%20II/README_EN.md) | `Stack`,`Array`,`Math`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Weekly Contest 230 | +| 1777 | [Product's Price for Each Store](/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README_EN.md) | `Database` | Easy | 🔒 | +| 1778 | [Shortest Path in a Hidden Grid](/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Interactive` | Medium | 🔒 | +| 1779 | [Find Nearest Point That Has the Same X or Y Coordinate](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README_EN.md) | `Array` | Easy | Biweekly Contest 47 | +| 1780 | [Check if Number is a Sum of Powers of Three](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README_EN.md) | `Math` | Medium | Biweekly Contest 47 | +| 1781 | [Sum of Beauty of All Substrings](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 47 | +| 1782 | [Count Pairs Of Nodes](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README_EN.md) | `Graph`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Hard | Biweekly Contest 47 | +| 1783 | [Grand Slam Titles](/solution/1700-1799/1783.Grand%20Slam%20Titles/README_EN.md) | `Database` | Medium | 🔒 | +| 1784 | [Check if Binary String Has at Most One Segment of Ones](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README_EN.md) | `String` | Easy | Weekly Contest 231 | +| 1785 | [Minimum Elements to Add to Form a Given Sum](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 231 | +| 1786 | [Number of Restricted Paths From First to Last Node](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README_EN.md) | `Graph`,`Topological Sort`,`Dynamic Programming`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Weekly Contest 231 | +| 1787 | [Make the XOR of All Segments Equal to Zero](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 231 | +| 1788 | [Maximize the Beauty of the Garden](/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README_EN.md) | `Greedy`,`Array`,`Prefix Sum` | Hard | 🔒 | +| 1789 | [Primary Department for Each Employee](/solution/1700-1799/1789.Primary%20Department%20for%20Each%20Employee/README_EN.md) | `Database` | Easy | | +| 1790 | [Check if One String Swap Can Make Strings Equal](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 232 | +| 1791 | [Find Center of Star Graph](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README_EN.md) | `Graph` | Easy | Weekly Contest 232 | +| 1792 | [Maximum Average Pass Ratio](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 232 | +| 1793 | [Maximum Score of a Good Subarray](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README_EN.md) | `Stack`,`Array`,`Two Pointers`,`Binary Search`,`Monotonic Stack` | Hard | Weekly Contest 232 | +| 1794 | [Count Pairs of Equal Substrings With Minimum Difference](/solution/1700-1799/1794.Count%20Pairs%20of%20Equal%20Substrings%20With%20Minimum%20Difference/README_EN.md) | `Greedy`,`Hash Table`,`String` | Medium | 🔒 | +| 1795 | [Rearrange Products Table](/solution/1700-1799/1795.Rearrange%20Products%20Table/README_EN.md) | `Database` | Easy | | +| 1796 | [Second Largest Digit in a String](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README_EN.md) | `Hash Table`,`String` | Easy | Biweekly Contest 48 | +| 1797 | [Design Authentication Manager](/solution/1700-1799/1797.Design%20Authentication%20Manager/README_EN.md) | `Design`,`Hash Table` | Medium | Biweekly Contest 48 | +| 1798 | [Maximum Number of Consecutive Values You Can Make](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 48 | +| 1799 | [Maximize Score After N Operations](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Backtracking`,`Bitmask`,`Number Theory` | Hard | Biweekly Contest 48 | +| 1800 | [Maximum Ascending Subarray Sum](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README_EN.md) | `Array` | Easy | Weekly Contest 233 | +| 1801 | [Number of Orders in the Backlog](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Medium | Weekly Contest 233 | +| 1802 | [Maximum Value at a Given Index in a Bounded Array](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README_EN.md) | `Greedy`,`Binary Search` | Medium | Weekly Contest 233 | +| 1803 | [Count Pairs With XOR in a Range](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README_EN.md) | `Bit Manipulation`,`Trie`,`Array` | Hard | Weekly Contest 233 | +| 1804 | [Implement Trie II (Prefix Tree)](/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README_EN.md) | `Design`,`Trie`,`Hash Table`,`String` | Medium | 🔒 | +| 1805 | [Number of Different Integers in a String](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 234 | +| 1806 | [Minimum Number of Operations to Reinitialize a Permutation](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README_EN.md) | `Array`,`Math`,`Simulation` | Medium | Weekly Contest 234 | +| 1807 | [Evaluate the Bracket Pairs of a String](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README_EN.md) | `Array`,`Hash Table`,`String` | Medium | Weekly Contest 234 | +| 1808 | [Maximize Number of Nice Divisors](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README_EN.md) | `Recursion`,`Math` | Hard | Weekly Contest 234 | +| 1809 | [Ad-Free Sessions](/solution/1800-1899/1809.Ad-Free%20Sessions/README_EN.md) | `Database` | Easy | 🔒 | +| 1810 | [Minimum Path Cost in a Hidden Grid](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Interactive`,`Heap (Priority Queue)` | Medium | 🔒 | +| 1811 | [Find Interview Candidates](/solution/1800-1899/1811.Find%20Interview%20Candidates/README_EN.md) | `Database` | Medium | 🔒 | +| 1812 | [Determine Color of a Chessboard Square](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 49 | +| 1813 | [Sentence Similarity III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README_EN.md) | `Array`,`Two Pointers`,`String` | Medium | Biweekly Contest 49 | +| 1814 | [Count Nice Pairs in an Array](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting` | Medium | Biweekly Contest 49 | +| 1815 | [Maximum Number of Groups Getting Fresh Donuts](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README_EN.md) | `Bit Manipulation`,`Memoization`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 49 | +| 1816 | [Truncate Sentence](/solution/1800-1899/1816.Truncate%20Sentence/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 235 | +| 1817 | [Finding the Users Active Minutes](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 235 | +| 1818 | [Minimum Absolute Sum Difference](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README_EN.md) | `Array`,`Binary Search`,`Ordered Set`,`Sorting` | Medium | Weekly Contest 235 | +| 1819 | [Number of Different Subsequences GCDs](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README_EN.md) | `Array`,`Math`,`Counting`,`Number Theory` | Hard | Weekly Contest 235 | +| 1820 | [Maximum Number of Accepted Invitations](/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README_EN.md) | `Array`,`Backtracking`,`Matrix` | Medium | 🔒 | +| 1821 | [Find Customers With Positive Revenue this Year](/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README_EN.md) | `Database` | Easy | 🔒 | +| 1822 | [Sign of the Product of an Array](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 236 | +| 1823 | [Find the Winner of the Circular Game](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README_EN.md) | `Recursion`,`Queue`,`Array`,`Math`,`Simulation` | Medium | Weekly Contest 236 | +| 1824 | [Minimum Sideway Jumps](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 236 | +| 1825 | [Finding MK Average](/solution/1800-1899/1825.Finding%20MK%20Average/README_EN.md) | `Design`,`Queue`,`Data Stream`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Weekly Contest 236 | +| 1826 | [Faulty Sensor](/solution/1800-1899/1826.Faulty%20Sensor/README_EN.md) | `Array`,`Two Pointers` | Easy | 🔒 | +| 1827 | [Minimum Operations to Make the Array Increasing](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README_EN.md) | `Greedy`,`Array` | Easy | Biweekly Contest 50 | +| 1828 | [Queries on Number of Points Inside a Circle](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README_EN.md) | `Geometry`,`Array`,`Math` | Medium | Biweekly Contest 50 | +| 1829 | [Maximum XOR for Each Query](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README_EN.md) | `Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Biweekly Contest 50 | +| 1830 | [Minimum Number of Operations to Make String Sorted](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README_EN.md) | `Math`,`String`,`Combinatorics` | Hard | Biweekly Contest 50 | +| 1831 | [Maximum Transaction Each Day](/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README_EN.md) | `Database` | Medium | 🔒 | +| 1832 | [Check if the Sentence Is Pangram](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 237 | +| 1833 | [Maximum Ice Cream Bars](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 237 | +| 1834 | [Single-Threaded CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 237 | +| 1835 | [Find XOR Sum of All Pairs Bitwise AND](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Hard | Weekly Contest 237 | +| 1836 | [Remove Duplicates From an Unsorted Linked List](/solution/1800-1899/1836.Remove%20Duplicates%20From%20an%20Unsorted%20Linked%20List/README_EN.md) | `Hash Table`,`Linked List` | Medium | 🔒 | +| 1837 | [Sum of Digits in Base K](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README_EN.md) | `Math` | Easy | Weekly Contest 238 | +| 1838 | [Frequency of the Most Frequent Element](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting`,`Sliding Window` | Medium | Weekly Contest 238 | +| 1839 | [Longest Substring Of All Vowels in Order](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README_EN.md) | `String`,`Sliding Window` | Medium | Weekly Contest 238 | +| 1840 | [Maximum Building Height](/solution/1800-1899/1840.Maximum%20Building%20Height/README_EN.md) | `Array`,`Math`,`Sorting` | Hard | Weekly Contest 238 | +| 1841 | [League Statistics](/solution/1800-1899/1841.League%20Statistics/README_EN.md) | `Database` | Medium | 🔒 | +| 1842 | [Next Palindrome Using Same Digits](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README_EN.md) | `Two Pointers`,`String` | Hard | 🔒 | +| 1843 | [Suspicious Bank Accounts](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README_EN.md) | `Database` | Medium | 🔒 | +| 1844 | [Replace All Digits with Characters](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README_EN.md) | `String` | Easy | Biweekly Contest 51 | +| 1845 | [Seat Reservation Manager](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README_EN.md) | `Design`,`Heap (Priority Queue)` | Medium | Biweekly Contest 51 | +| 1846 | [Maximum Element After Decreasing and Rearranging](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 51 | +| 1847 | [Closest Room](/solution/1800-1899/1847.Closest%20Room/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Hard | Biweekly Contest 51 | +| 1848 | [Minimum Distance to the Target Element](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README_EN.md) | `Array` | Easy | Weekly Contest 239 | +| 1849 | [Splitting a String Into Descending Consecutive Values](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README_EN.md) | `String`,`Backtracking` | Medium | Weekly Contest 239 | +| 1850 | [Minimum Adjacent Swaps to Reach the Kth Smallest Number](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 239 | +| 1851 | [Minimum Interval to Include Each Query](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README_EN.md) | `Array`,`Binary Search`,`Sorting`,`Line Sweep`,`Heap (Priority Queue)` | Hard | Weekly Contest 239 | +| 1852 | [Distinct Numbers in Each Subarray](/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | 🔒 | +| 1853 | [Convert Date Format](/solution/1800-1899/1853.Convert%20Date%20Format/README_EN.md) | `Database` | Easy | 🔒 | +| 1854 | [Maximum Population Year](/solution/1800-1899/1854.Maximum%20Population%20Year/README_EN.md) | `Array`,`Counting`,`Prefix Sum` | Easy | Weekly Contest 240 | +| 1855 | [Maximum Distance Between a Pair of Values](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README_EN.md) | `Array`,`Two Pointers`,`Binary Search` | Medium | Weekly Contest 240 | +| 1856 | [Maximum Subarray Min-Product](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README_EN.md) | `Stack`,`Array`,`Prefix Sum`,`Monotonic Stack` | Medium | Weekly Contest 240 | +| 1857 | [Largest Color Value in a Directed Graph](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README_EN.md) | `Graph`,`Topological Sort`,`Memoization`,`Hash Table`,`Dynamic Programming`,`Counting` | Hard | Weekly Contest 240 | +| 1858 | [Longest Word With All Prefixes](/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README_EN.md) | `Depth-First Search`,`Trie` | Medium | 🔒 | +| 1859 | [Sorting the Sentence](/solution/1800-1899/1859.Sorting%20the%20Sentence/README_EN.md) | `String`,`Sorting` | Easy | Biweekly Contest 52 | +| 1860 | [Incremental Memory Leak](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README_EN.md) | `Math`,`Simulation` | Medium | Biweekly Contest 52 | +| 1861 | [Rotating the Box](/solution/1800-1899/1861.Rotating%20the%20Box/README_EN.md) | `Array`,`Two Pointers`,`Matrix` | Medium | Biweekly Contest 52 | +| 1862 | [Sum of Floored Pairs](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README_EN.md) | `Array`,`Math`,`Binary Search`,`Prefix Sum` | Hard | Biweekly Contest 52 | +| 1863 | [Sum of All Subset XOR Totals](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Backtracking`,`Combinatorics`,`Enumeration` | Easy | Weekly Contest 241 | +| 1864 | [Minimum Number of Swaps to Make the Binary String Alternating](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 241 | +| 1865 | [Finding Pairs With a Certain Sum](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README_EN.md) | `Design`,`Array`,`Hash Table` | Medium | Weekly Contest 241 | +| 1866 | [Number of Ways to Rearrange Sticks With K Sticks Visible](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 241 | +| 1867 | [Orders With Maximum Quantity Above Average](/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README_EN.md) | `Database` | Medium | 🔒 | +| 1868 | [Product of Two Run-Length Encoded Arrays](/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README_EN.md) | `Array`,`Two Pointers` | Medium | 🔒 | +| 1869 | [Longer Contiguous Segments of Ones than Zeros](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README_EN.md) | `String` | Easy | Weekly Contest 242 | +| 1870 | [Minimum Speed to Arrive on Time](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 242 | +| 1871 | [Jump Game VII](/solution/1800-1899/1871.Jump%20Game%20VII/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 242 | +| 1872 | [Stone Game VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Game Theory`,`Prefix Sum` | Hard | Weekly Contest 242 | +| 1873 | [Calculate Special Bonus](/solution/1800-1899/1873.Calculate%20Special%20Bonus/README_EN.md) | `Database` | Easy | | +| 1874 | [Minimize Product Sum of Two Arrays](/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | +| 1875 | [Group Employees of the Same Salary](/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README_EN.md) | `Database` | Medium | 🔒 | +| 1876 | [Substrings of Size Three with Distinct Characters](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README_EN.md) | `Hash Table`,`String`,`Counting`,`Sliding Window` | Easy | Biweekly Contest 53 | +| 1877 | [Minimize Maximum Pair Sum in Array](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Biweekly Contest 53 | +| 1878 | [Get Biggest Three Rhombus Sums in a Grid](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README_EN.md) | `Array`,`Math`,`Matrix`,`Prefix Sum`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 53 | +| 1879 | [Minimum XOR Sum of Two Arrays](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 53 | +| 1880 | [Check if Word Equals Summation of Two Words](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README_EN.md) | `String` | Easy | Weekly Contest 243 | +| 1881 | [Maximum Value after Insertion](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 243 | +| 1882 | [Process Tasks Using Servers](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README_EN.md) | `Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 243 | +| 1883 | [Minimum Skips to Arrive at Meeting On Time](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 243 | +| 1884 | [Egg Drop With 2 Eggs and N Floors](/solution/1800-1899/1884.Egg%20Drop%20With%202%20Eggs%20and%20N%20Floors/README_EN.md) | `Math`,`Dynamic Programming` | Medium | | +| 1885 | [Count Pairs in Two Arrays](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | 🔒 | +| 1886 | [Determine Whether Matrix Can Be Obtained By Rotation](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 244 | +| 1887 | [Reduction Operations to Make the Array Elements Equal](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 244 | +| 1888 | [Minimum Number of Flips to Make the Binary String Alternating](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md) | `Greedy`,`String`,`Dynamic Programming`,`Sliding Window` | Medium | Weekly Contest 244 | +| 1889 | [Minimum Space Wasted From Packaging](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Hard | Weekly Contest 244 | +| 1890 | [The Latest Login in 2020](/solution/1800-1899/1890.The%20Latest%20Login%20in%202020/README_EN.md) | `Database` | Easy | | +| 1891 | [Cutting Ribbons](/solution/1800-1899/1891.Cutting%20Ribbons/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 | +| 1892 | [Page Recommendations II](/solution/1800-1899/1892.Page%20Recommendations%20II/README_EN.md) | `Database` | Hard | 🔒 | +| 1893 | [Check if All the Integers in a Range Are Covered](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Easy | Biweekly Contest 54 | +| 1894 | [Find the Student that Will Replace the Chalk](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Simulation` | Medium | Biweekly Contest 54 | +| 1895 | [Largest Magic Square](/solution/1800-1899/1895.Largest%20Magic%20Square/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Biweekly Contest 54 | +| 1896 | [Minimum Cost to Change the Final Value of Expression](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README_EN.md) | `Stack`,`Math`,`String`,`Dynamic Programming` | Hard | Biweekly Contest 54 | +| 1897 | [Redistribute Characters to Make All Strings Equal](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 245 | +| 1898 | [Maximum Number of Removable Characters](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README_EN.md) | `Array`,`Two Pointers`,`String`,`Binary Search` | Medium | Weekly Contest 245 | +| 1899 | [Merge Triplets to Form Target Triplet](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 245 | +| 1900 | [The Earliest and Latest Rounds Where Players Compete](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README_EN.md) | `Memoization`,`Dynamic Programming` | Hard | Weekly Contest 245 | +| 1901 | [Find a Peak Element II](/solution/1900-1999/1901.Find%20a%20Peak%20Element%20II/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | | +| 1902 | [Depth of BST Given Insertion Order](/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README_EN.md) | `Tree`,`Binary Search Tree`,`Binary Tree`,`Ordered Set` | Medium | 🔒 | +| 1903 | [Largest Odd Number in String](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README_EN.md) | `Greedy`,`Math`,`String` | Easy | Weekly Contest 246 | +| 1904 | [The Number of Full Rounds You Have Played](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README_EN.md) | `Math`,`String` | Medium | Weekly Contest 246 | +| 1905 | [Count Sub Islands](/solution/1900-1999/1905.Count%20Sub%20Islands/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Weekly Contest 246 | +| 1906 | [Minimum Absolute Difference Queries](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 246 | +| 1907 | [Count Salary Categories](/solution/1900-1999/1907.Count%20Salary%20Categories/README_EN.md) | `Database` | Medium | | +| 1908 | [Game of Nim](/solution/1900-1999/1908.Game%20of%20Nim/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array`,`Math`,`Dynamic Programming`,`Game Theory` | Medium | 🔒 | +| 1909 | [Remove One Element to Make the Array Strictly Increasing](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README_EN.md) | `Array` | Easy | Biweekly Contest 55 | +| 1910 | [Remove All Occurrences of a Substring](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README_EN.md) | `String` | Medium | Biweekly Contest 55 | +| 1911 | [Maximum Alternating Subsequence Sum](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 55 | +| 1912 | [Design Movie Rental System](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README_EN.md) | `Design`,`Array`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Biweekly Contest 55 | +| 1913 | [Maximum Product Difference Between Two Pairs](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 247 | +| 1914 | [Cyclically Rotating a Grid](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 247 | +| 1915 | [Number of Wonderful Substrings](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Prefix Sum` | Medium | Weekly Contest 247 | +| 1916 | [Count Ways to Build Rooms in an Ant Colony](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README_EN.md) | `Tree`,`Graph`,`Topological Sort`,`Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 247 | +| 1917 | [Leetcodify Friends Recommendations](/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README_EN.md) | `Database` | Hard | 🔒 | +| 1918 | [Kth Smallest Subarray Sum](/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README_EN.md) | `Array`,`Binary Search`,`Sliding Window` | Medium | 🔒 | +| 1919 | [Leetcodify Similar Friends](/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README_EN.md) | `Database` | Hard | 🔒 | +| 1920 | [Build Array from Permutation](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 248 | +| 1921 | [Eliminate Maximum Number of Monsters](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 248 | +| 1922 | [Count Good Numbers](/solution/1900-1999/1922.Count%20Good%20Numbers/README_EN.md) | `Recursion`,`Math` | Medium | Weekly Contest 248 | +| 1923 | [Longest Common Subpath](/solution/1900-1999/1923.Longest%20Common%20Subpath/README_EN.md) | `Array`,`Binary Search`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 248 | +| 1924 | [Erect the Fence II](/solution/1900-1999/1924.Erect%20the%20Fence%20II/README_EN.md) | `Geometry`,`Array`,`Math` | Hard | 🔒 | +| 1925 | [Count Square Sum Triples](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README_EN.md) | `Math`,`Enumeration` | Easy | Biweekly Contest 56 | +| 1926 | [Nearest Exit from Entrance in Maze](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Medium | Biweekly Contest 56 | +| 1927 | [Sum Game](/solution/1900-1999/1927.Sum%20Game/README_EN.md) | `Greedy`,`Math`,`String`,`Game Theory` | Medium | Biweekly Contest 56 | +| 1928 | [Minimum Cost to Reach Destination in Time](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README_EN.md) | `Graph`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 56 | +| 1929 | [Concatenation of Array](/solution/1900-1999/1929.Concatenation%20of%20Array/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 249 | +| 1930 | [Unique Length-3 Palindromic Subsequences](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Prefix Sum` | Medium | Weekly Contest 249 | +| 1931 | [Painting a Grid With Three Different Colors](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README_EN.md) | `Dynamic Programming` | Hard | Weekly Contest 249 | +| 1932 | [Merge BSTs to Create Single BST](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Binary Search`,`Binary Tree` | Hard | Weekly Contest 249 | +| 1933 | [Check if String Is Decomposable Into Value-Equal Substrings](/solution/1900-1999/1933.Check%20if%20String%20Is%20Decomposable%20Into%20Value-Equal%20Substrings/README_EN.md) | `String` | Easy | 🔒 | +| 1934 | [Confirmation Rate](/solution/1900-1999/1934.Confirmation%20Rate/README_EN.md) | `Database` | Medium | | +| 1935 | [Maximum Number of Words You Can Type](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 250 | +| 1936 | [Add Minimum Number of Rungs](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 250 | +| 1937 | [Maximum Number of Points with Cost](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 250 | +| 1938 | [Maximum Genetic Difference Query](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README_EN.md) | `Bit Manipulation`,`Trie`,`Array` | Hard | Weekly Contest 250 | +| 1939 | [Users That Actively Request Confirmation Messages](/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README_EN.md) | `Database` | Easy | 🔒 | +| 1940 | [Longest Common Subsequence Between Sorted Arrays](/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | 🔒 | +| 1941 | [Check if All Characters Have Equal Number of Occurrences](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 57 | +| 1942 | [The Number of the Smallest Unoccupied Chair](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README_EN.md) | `Array`,`Hash Table`,`Heap (Priority Queue)` | Medium | Biweekly Contest 57 | +| 1943 | [Describe the Painting](/solution/1900-1999/1943.Describe%20the%20Painting/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 57 | +| 1944 | [Number of Visible People in a Queue](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Hard | Biweekly Contest 57 | +| 1945 | [Sum of Digits of String After Convert](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 251 | +| 1946 | [Largest Number After Mutating Substring](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README_EN.md) | `Greedy`,`Array`,`String` | Medium | Weekly Contest 251 | +| 1947 | [Maximum Compatibility Score Sum](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 251 | +| 1948 | [Delete Duplicate Folders in System](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Hash Function` | Hard | Weekly Contest 251 | +| 1949 | [Strong Friendship](/solution/1900-1999/1949.Strong%20Friendship/README_EN.md) | `Database` | Medium | 🔒 | +| 1950 | [Maximum of Minimum Values in All Subarrays](/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | 🔒 | +| 1951 | [All the Pairs With the Maximum Number of Common Followers](/solution/1900-1999/1951.All%20the%20Pairs%20With%20the%20Maximum%20Number%20of%20Common%20Followers/README_EN.md) | `Database` | Medium | 🔒 | +| 1952 | [Three Divisors](/solution/1900-1999/1952.Three%20Divisors/README_EN.md) | `Math`,`Enumeration`,`Number Theory` | Easy | Weekly Contest 252 | +| 1953 | [Maximum Number of Weeks for Which You Can Work](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 252 | +| 1954 | [Minimum Garden Perimeter to Collect Enough Apples](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README_EN.md) | `Math`,`Binary Search` | Medium | Weekly Contest 252 | +| 1955 | [Count Number of Special Subsequences](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 252 | +| 1956 | [Minimum Time For K Virus Variants to Spread](/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README_EN.md) | `Geometry`,`Array`,`Math`,`Binary Search`,`Enumeration` | Hard | 🔒 | +| 1957 | [Delete Characters to Make Fancy String](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README_EN.md) | `String` | Easy | Biweekly Contest 58 | +| 1958 | [Check if Move is Legal](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README_EN.md) | `Array`,`Enumeration`,`Matrix` | Medium | Biweekly Contest 58 | +| 1959 | [Minimum Total Space Wasted With K Resizing Operations](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 58 | +| 1960 | [Maximum Product of the Length of Two Palindromic Substrings](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README_EN.md) | `String`,`Hash Function`,`Rolling Hash` | Hard | Biweekly Contest 58 | +| 1961 | [Check If String Is a Prefix of Array](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README_EN.md) | `Array`,`Two Pointers`,`String` | Easy | Weekly Contest 253 | +| 1962 | [Remove Stones to Minimize the Total](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 253 | +| 1963 | [Minimum Number of Swaps to Make the String Balanced](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README_EN.md) | `Stack`,`Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 253 | +| 1964 | [Find the Longest Valid Obstacle Course at Each Position](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README_EN.md) | `Binary Indexed Tree`,`Array`,`Binary Search` | Hard | Weekly Contest 253 | +| 1965 | [Employees With Missing Information](/solution/1900-1999/1965.Employees%20With%20Missing%20Information/README_EN.md) | `Database` | Easy | | +| 1966 | [Binary Searchable Numbers in an Unsorted Array](/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 | +| 1967 | [Number of Strings That Appear as Substrings in Word](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README_EN.md) | `String` | Easy | Weekly Contest 254 | +| 1968 | [Array With Elements Not Equal to Average of Neighbors](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 254 | +| 1969 | [Minimum Non-Zero Product of the Array Elements](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README_EN.md) | `Greedy`,`Recursion`,`Math` | Medium | Weekly Contest 254 | +| 1970 | [Last Day Where You Can Still Cross](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix` | Hard | Weekly Contest 254 | +| 1971 | [Find if Path Exists in Graph](/solution/1900-1999/1971.Find%20if%20Path%20Exists%20in%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Easy | | +| 1972 | [First and Last Call On the Same Day](/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README_EN.md) | `Database` | Hard | 🔒 | +| 1973 | [Count Nodes Equal to Sum of Descendants](/solution/1900-1999/1973.Count%20Nodes%20Equal%20to%20Sum%20of%20Descendants/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | +| 1974 | [Minimum Time to Type Word Using Special Typewriter](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README_EN.md) | `Greedy`,`String` | Easy | Biweekly Contest 59 | +| 1975 | [Maximum Matrix Sum](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README_EN.md) | `Greedy`,`Array`,`Matrix` | Medium | Biweekly Contest 59 | +| 1976 | [Number of Ways to Arrive at Destination](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README_EN.md) | `Graph`,`Topological Sort`,`Dynamic Programming`,`Shortest Path` | Medium | Biweekly Contest 59 | +| 1977 | [Number of Ways to Separate Numbers](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README_EN.md) | `String`,`Dynamic Programming`,`Suffix Array` | Hard | Biweekly Contest 59 | +| 1978 | [Employees Whose Manager Left the Company](/solution/1900-1999/1978.Employees%20Whose%20Manager%20Left%20the%20Company/README_EN.md) | `Database` | Easy | | +| 1979 | [Find Greatest Common Divisor of Array](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README_EN.md) | `Array`,`Math`,`Number Theory` | Easy | Weekly Contest 255 | +| 1980 | [Find Unique Binary String](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README_EN.md) | `Array`,`Hash Table`,`String`,`Backtracking` | Medium | Weekly Contest 255 | +| 1981 | [Minimize the Difference Between Target and Chosen Elements](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 255 | +| 1982 | [Find Array Given Subset Sums](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README_EN.md) | `Array`,`Divide and Conquer` | Hard | Weekly Contest 255 | +| 1983 | [Widest Pair of Indices With Equal Range Sum](/solution/1900-1999/1983.Widest%20Pair%20of%20Indices%20With%20Equal%20Range%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | 🔒 | +| 1984 | [Minimum Difference Between Highest and Lowest of K Scores](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README_EN.md) | `Array`,`Sorting`,`Sliding Window` | Easy | Weekly Contest 256 | +| 1985 | [Find the Kth Largest Integer in the Array](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README_EN.md) | `Array`,`String`,`Divide and Conquer`,`Quickselect`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 256 | +| 1986 | [Minimum Number of Work Sessions to Finish the Tasks](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 256 | +| 1987 | [Number of Unique Good Subsequences](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 256 | +| 1988 | [Find Cutoff Score for Each School](/solution/1900-1999/1988.Find%20Cutoff%20Score%20for%20Each%20School/README_EN.md) | `Database` | Medium | 🔒 | +| 1989 | [Maximum Number of People That Can Be Caught in Tag](/solution/1900-1999/1989.Maximum%20Number%20of%20People%20That%20Can%20Be%20Caught%20in%20Tag/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 | +| 1990 | [Count the Number of Experiments](/solution/1900-1999/1990.Count%20the%20Number%20of%20Experiments/README_EN.md) | `Database` | Medium | 🔒 | +| 1991 | [Find the Middle Index in Array](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README_EN.md) | `Array`,`Prefix Sum` | Easy | Biweekly Contest 60 | +| 1992 | [Find All Groups of Farmland](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix` | Medium | Biweekly Contest 60 | +| 1993 | [Operations on Tree](/solution/1900-1999/1993.Operations%20on%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Design`,`Array`,`Hash Table` | Medium | Biweekly Contest 60 | +| 1994 | [The Number of Good Subsets](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Bitmask` | Hard | Biweekly Contest 60 | +| 1995 | [Count Special Quadruplets](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Easy | Weekly Contest 257 | +| 1996 | [The Number of Weak Characters in the Game](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README_EN.md) | `Stack`,`Greedy`,`Array`,`Sorting`,`Monotonic Stack` | Medium | Weekly Contest 257 | +| 1997 | [First Day Where You Have Been in All the Rooms](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 257 | +| 1998 | [GCD Sort of an Array](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README_EN.md) | `Union Find`,`Array`,`Math`,`Number Theory`,`Sorting` | Hard | Weekly Contest 257 | +| 1999 | [Smallest Greater Multiple Made of Two Digits](/solution/1900-1999/1999.Smallest%20Greater%20Multiple%20Made%20of%20Two%20Digits/README_EN.md) | `Math`,`Enumeration` | Medium | 🔒 | +| 2000 | [Reverse Prefix of Word](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README_EN.md) | `Two Pointers`,`String` | Easy | Weekly Contest 258 | +| 2001 | [Number of Pairs of Interchangeable Rectangles](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory` | Medium | Weekly Contest 258 | +| 2002 | [Maximum Product of the Length of Two Palindromic Subsequences](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README_EN.md) | `Bit Manipulation`,`String`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 258 | +| 2003 | [Smallest Missing Genetic Value in Each Subtree](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README_EN.md) | `Tree`,`Depth-First Search`,`Union Find`,`Dynamic Programming` | Hard | Weekly Contest 258 | +| 2004 | [The Number of Seniors and Juniors to Join the Company](/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README_EN.md) | `Database` | Hard | 🔒 | +| 2005 | [Subtree Removal Game with Fibonacci Tree](/solution/2000-2099/2005.Subtree%20Removal%20Game%20with%20Fibonacci%20Tree/README_EN.md) | `Tree`,`Math`,`Dynamic Programming`,`Binary Tree`,`Game Theory` | Hard | 🔒 | +| 2006 | [Count Number of Pairs With Absolute Difference K](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 61 | +| 2007 | [Find Original Array From Doubled Array](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting` | Medium | Biweekly Contest 61 | +| 2008 | [Maximum Earnings From Taxi](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | Biweekly Contest 61 | +| 2009 | [Minimum Number of Operations to Make Array Continuous](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sliding Window` | Hard | Biweekly Contest 61 | +| 2010 | [The Number of Seniors and Juniors to Join the Company II](/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README_EN.md) | `Database` | Hard | 🔒 | +| 2011 | [Final Value of Variable After Performing Operations](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README_EN.md) | `Array`,`String`,`Simulation` | Easy | Weekly Contest 259 | +| 2012 | [Sum of Beauty in the Array](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README_EN.md) | `Array` | Medium | Weekly Contest 259 | +| 2013 | [Detect Squares](/solution/2000-2099/2013.Detect%20Squares/README_EN.md) | `Design`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 259 | +| 2014 | [Longest Subsequence Repeated k Times](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README_EN.md) | `Greedy`,`String`,`Backtracking`,`Counting`,`Enumeration` | Hard | Weekly Contest 259 | +| 2015 | [Average Height of Buildings in Each Segment](/solution/2000-2099/2015.Average%20Height%20of%20Buildings%20in%20Each%20Segment/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | 🔒 | +| 2016 | [Maximum Difference Between Increasing Elements](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README_EN.md) | `Array` | Easy | Weekly Contest 260 | +| 2017 | [Grid Game](/solution/2000-2099/2017.Grid%20Game/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 260 | +| 2018 | [Check if Word Can Be Placed In Crossword](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README_EN.md) | `Array`,`Enumeration`,`Matrix` | Medium | Weekly Contest 260 | +| 2019 | [The Score of Students Solving Math Expression](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README_EN.md) | `Stack`,`Memoization`,`Array`,`Math`,`String`,`Dynamic Programming` | Hard | Weekly Contest 260 | +| 2020 | [Number of Accounts That Did Not Stream](/solution/2000-2099/2020.Number%20of%20Accounts%20That%20Did%20Not%20Stream/README_EN.md) | `Database` | Medium | 🔒 | +| 2021 | [Brightest Position on Street](/solution/2000-2099/2021.Brightest%20Position%20on%20Street/README_EN.md) | `Array`,`Ordered Set`,`Prefix Sum` | Medium | 🔒 | +| 2022 | [Convert 1D Array Into 2D Array](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README_EN.md) | `Array`,`Matrix`,`Simulation` | Easy | Biweekly Contest 62 | +| 2023 | [Number of Pairs of Strings With Concatenation Equal to Target](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 62 | +| 2024 | [Maximize the Confusion of an Exam](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README_EN.md) | `String`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Medium | Biweekly Contest 62 | +| 2025 | [Maximum Number of Ways to Partition an Array](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Enumeration`,`Prefix Sum` | Hard | Biweekly Contest 62 | +| 2026 | [Low-Quality Problems](/solution/2000-2099/2026.Low-Quality%20Problems/README_EN.md) | `Database` | Easy | 🔒 | +| 2027 | [Minimum Moves to Convert String](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README_EN.md) | `Greedy`,`String` | Easy | Weekly Contest 261 | +| 2028 | [Find Missing Observations](/solution/2000-2099/2028.Find%20Missing%20Observations/README_EN.md) | `Array`,`Math`,`Simulation` | Medium | Weekly Contest 261 | +| 2029 | [Stone Game IX](/solution/2000-2099/2029.Stone%20Game%20IX/README_EN.md) | `Greedy`,`Array`,`Math`,`Counting`,`Game Theory` | Medium | Weekly Contest 261 | +| 2030 | [Smallest K-Length Subsequence With Occurrences of a Letter](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README_EN.md) | `Stack`,`Greedy`,`String`,`Monotonic Stack` | Hard | Weekly Contest 261 | +| 2031 | [Count Subarrays With More Ones Than Zeros](/solution/2000-2099/2031.Count%20Subarrays%20With%20More%20Ones%20Than%20Zeros/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Medium | 🔒 | +| 2032 | [Two Out of Three](/solution/2000-2099/2032.Two%20Out%20of%20Three/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Easy | Weekly Contest 262 | +| 2033 | [Minimum Operations to Make a Uni-Value Grid](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README_EN.md) | `Array`,`Math`,`Matrix`,`Sorting` | Medium | Weekly Contest 262 | +| 2034 | [Stock Price Fluctuation](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README_EN.md) | `Design`,`Hash Table`,`Data Stream`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 262 | +| 2035 | [Partition Array Into Two Arrays to Minimize Sum Difference](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README_EN.md) | `Bit Manipulation`,`Array`,`Two Pointers`,`Binary Search`,`Dynamic Programming`,`Bitmask`,`Ordered Set` | Hard | Weekly Contest 262 | +| 2036 | [Maximum Alternating Subarray Sum](/solution/2000-2099/2036.Maximum%20Alternating%20Subarray%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | +| 2037 | [Minimum Number of Moves to Seat Everyone](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Biweekly Contest 63 | +| 2038 | [Remove Colored Pieces if Both Neighbors are the Same Color](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README_EN.md) | `Greedy`,`Math`,`String`,`Game Theory` | Medium | Biweekly Contest 63 | +| 2039 | [The Time When the Network Becomes Idle](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README_EN.md) | `Breadth-First Search`,`Graph`,`Array` | Medium | Biweekly Contest 63 | +| 2040 | [Kth Smallest Product of Two Sorted Arrays](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README_EN.md) | `Array`,`Binary Search` | Hard | Biweekly Contest 63 | +| 2041 | [Accepted Candidates From the Interviews](/solution/2000-2099/2041.Accepted%20Candidates%20From%20the%20Interviews/README_EN.md) | `Database` | Medium | 🔒 | +| 2042 | [Check if Numbers Are Ascending in a Sentence](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README_EN.md) | `String` | Easy | Weekly Contest 263 | +| 2043 | [Simple Bank System](/solution/2000-2099/2043.Simple%20Bank%20System/README_EN.md) | `Design`,`Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 263 | +| 2044 | [Count Number of Maximum Bitwise-OR Subsets](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Medium | Weekly Contest 263 | +| 2045 | [Second Minimum Time to Reach Destination](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README_EN.md) | `Breadth-First Search`,`Graph`,`Shortest Path` | Hard | Weekly Contest 263 | +| 2046 | [Sort Linked List Already Sorted Using Absolute Values](/solution/2000-2099/2046.Sort%20Linked%20List%20Already%20Sorted%20Using%20Absolute%20Values/README_EN.md) | `Linked List`,`Two Pointers`,`Sorting` | Medium | 🔒 | +| 2047 | [Number of Valid Words in a Sentence](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README_EN.md) | `String` | Easy | Weekly Contest 264 | +| 2048 | [Next Greater Numerically Balanced Number](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README_EN.md) | `Math`,`Backtracking`,`Enumeration` | Medium | Weekly Contest 264 | +| 2049 | [Count Nodes With the Highest Score](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Binary Tree` | Medium | Weekly Contest 264 | +| 2050 | [Parallel Courses III](/solution/2000-2099/2050.Parallel%20Courses%20III/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 264 | +| 2051 | [The Category of Each Member in the Store](/solution/2000-2099/2051.The%20Category%20of%20Each%20Member%20in%20the%20Store/README_EN.md) | `Database` | Medium | 🔒 | +| 2052 | [Minimum Cost to Separate Sentence Into Rows](/solution/2000-2099/2052.Minimum%20Cost%20to%20Separate%20Sentence%20Into%20Rows/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | +| 2053 | [Kth Distinct String in an Array](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 64 | +| 2054 | [Two Best Non-Overlapping Events](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 64 | +| 2055 | [Plates Between Candles](/solution/2000-2099/2055.Plates%20Between%20Candles/README_EN.md) | `Array`,`String`,`Binary Search`,`Prefix Sum` | Medium | Biweekly Contest 64 | +| 2056 | [Number of Valid Move Combinations On Chessboard](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README_EN.md) | `Array`,`String`,`Backtracking`,`Simulation` | Hard | Biweekly Contest 64 | +| 2057 | [Smallest Index With Equal Value](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README_EN.md) | `Array` | Easy | Weekly Contest 265 | +| 2058 | [Find the Minimum and Maximum Number of Nodes Between Critical Points](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README_EN.md) | `Linked List` | Medium | Weekly Contest 265 | +| 2059 | [Minimum Operations to Convert Number](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README_EN.md) | `Breadth-First Search`,`Array` | Medium | Weekly Contest 265 | +| 2060 | [Check if an Original String Exists Given Two Encoded Strings](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 265 | +| 2061 | [Number of Spaces Cleaning Robot Cleaned](/solution/2000-2099/2061.Number%20of%20Spaces%20Cleaning%20Robot%20Cleaned/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | 🔒 | +| 2062 | [Count Vowel Substrings of a String](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 266 | +| 2063 | [Vowels of All Substrings](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README_EN.md) | `Math`,`String`,`Dynamic Programming`,`Combinatorics` | Medium | Weekly Contest 266 | +| 2064 | [Minimized Maximum of Products Distributed to Any Store](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 266 | +| 2065 | [Maximum Path Quality of a Graph](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README_EN.md) | `Graph`,`Array`,`Backtracking` | Hard | Weekly Contest 266 | +| 2066 | [Account Balance](/solution/2000-2099/2066.Account%20Balance/README_EN.md) | `Database` | Medium | 🔒 | +| 2067 | [Number of Equal Count Substrings](/solution/2000-2099/2067.Number%20of%20Equal%20Count%20Substrings/README_EN.md) | `String`,`Counting`,`Prefix Sum` | Medium | 🔒 | +| 2068 | [Check Whether Two Strings are Almost Equivalent](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 65 | +| 2069 | [Walking Robot Simulation II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README_EN.md) | `Design`,`Simulation` | Medium | Biweekly Contest 65 | +| 2070 | [Most Beautiful Item for Each Query](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 65 | +| 2071 | [Maximum Number of Tasks You Can Assign](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README_EN.md) | `Greedy`,`Queue`,`Array`,`Binary Search`,`Sorting`,`Monotonic Queue` | Hard | Biweekly Contest 65 | +| 2072 | [The Winner University](/solution/2000-2099/2072.The%20Winner%20University/README_EN.md) | `Database` | Easy | 🔒 | +| 2073 | [Time Needed to Buy Tickets](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README_EN.md) | `Queue`,`Array`,`Simulation` | Easy | Weekly Contest 267 | +| 2074 | [Reverse Nodes in Even Length Groups](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README_EN.md) | `Linked List` | Medium | Weekly Contest 267 | +| 2075 | [Decode the Slanted Ciphertext](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README_EN.md) | `String`,`Simulation` | Medium | Weekly Contest 267 | +| 2076 | [Process Restricted Friend Requests](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README_EN.md) | `Union Find`,`Graph` | Hard | Weekly Contest 267 | +| 2077 | [Paths in Maze That Lead to Same Room](/solution/2000-2099/2077.Paths%20in%20Maze%20That%20Lead%20to%20Same%20Room/README_EN.md) | `Graph` | Medium | 🔒 | +| 2078 | [Two Furthest Houses With Different Colors](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README_EN.md) | `Greedy`,`Array` | Easy | Weekly Contest 268 | +| 2079 | [Watering Plants](/solution/2000-2099/2079.Watering%20Plants/README_EN.md) | `Array`,`Simulation` | Medium | Weekly Contest 268 | +| 2080 | [Range Frequency Queries](/solution/2000-2099/2080.Range%20Frequency%20Queries/README_EN.md) | `Design`,`Segment Tree`,`Array`,`Hash Table`,`Binary Search` | Medium | Weekly Contest 268 | +| 2081 | [Sum of k-Mirror Numbers](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README_EN.md) | `Math`,`Enumeration` | Hard | Weekly Contest 268 | +| 2082 | [The Number of Rich Customers](/solution/2000-2099/2082.The%20Number%20of%20Rich%20Customers/README_EN.md) | `Database` | Easy | 🔒 | +| 2083 | [Substrings That Begin and End With the Same Letter](/solution/2000-2099/2083.Substrings%20That%20Begin%20and%20End%20With%20the%20Same%20Letter/README_EN.md) | `Hash Table`,`Math`,`String`,`Counting`,`Prefix Sum` | Medium | 🔒 | +| 2084 | [Drop Type 1 Orders for Customers With Type 0 Orders](/solution/2000-2099/2084.Drop%20Type%201%20Orders%20for%20Customers%20With%20Type%200%20Orders/README_EN.md) | `Database` | Medium | 🔒 | +| 2085 | [Count Common Words With One Occurrence](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 66 | +| 2086 | [Minimum Number of Food Buckets to Feed the Hamsters](/solution/2000-2099/2086.Minimum%20Number%20of%20Food%20Buckets%20to%20Feed%20the%20Hamsters/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 66 | +| 2087 | [Minimum Cost Homecoming of a Robot in a Grid](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README_EN.md) | `Greedy`,`Array` | Medium | Biweekly Contest 66 | +| 2088 | [Count Fertile Pyramids in a Land](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Biweekly Contest 66 | +| 2089 | [Find Target Indices After Sorting Array](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README_EN.md) | `Array`,`Binary Search`,`Sorting` | Easy | Weekly Contest 269 | +| 2090 | [K Radius Subarray Averages](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 269 | +| 2091 | [Removing Minimum and Maximum From Array](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 269 | +| 2092 | [Find All People With Secret](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Sorting` | Hard | Weekly Contest 269 | +| 2093 | [Minimum Cost to Reach City With Discounts](/solution/2000-2099/2093.Minimum%20Cost%20to%20Reach%20City%20With%20Discounts/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 | +| 2094 | [Finding 3-Digit Even Numbers](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README_EN.md) | `Array`,`Hash Table`,`Enumeration`,`Sorting` | Easy | Weekly Contest 270 | +| 2095 | [Delete the Middle Node of a Linked List](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | Weekly Contest 270 | +| 2096 | [Step-By-Step Directions From a Binary Tree Node to Another](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README_EN.md) | `Tree`,`Depth-First Search`,`String`,`Binary Tree` | Medium | Weekly Contest 270 | +| 2097 | [Valid Arrangement of Pairs](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README_EN.md) | `Depth-First Search`,`Graph`,`Eulerian Circuit` | Hard | Weekly Contest 270 | +| 2098 | [Subsequence of Size K With the Largest Even Sum](/solution/2000-2099/2098.Subsequence%20of%20Size%20K%20With%20the%20Largest%20Even%20Sum/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | +| 2099 | [Find Subsequence of Length K With the Largest Sum](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Easy | Biweekly Contest 67 | +| 2100 | [Find Good Days to Rob the Bank](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 67 | +| 2101 | [Detonate the Maximum Bombs](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Geometry`,`Array`,`Math` | Medium | Biweekly Contest 67 | +| 2102 | [Sequentially Ordinal Rank Tracker](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README_EN.md) | `Design`,`Data Stream`,`Ordered Set`,`Heap (Priority Queue)` | Hard | Biweekly Contest 67 | +| 2103 | [Rings and Rods](/solution/2100-2199/2103.Rings%20and%20Rods/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 271 | +| 2104 | [Sum of Subarray Ranges](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 271 | +| 2105 | [Watering Plants II](/solution/2100-2199/2105.Watering%20Plants%20II/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Medium | Weekly Contest 271 | +| 2106 | [Maximum Fruits Harvested After at Most K Steps](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Hard | Weekly Contest 271 | +| 2107 | [Number of Unique Flavors After Sharing K Candies](/solution/2100-2199/2107.Number%20of%20Unique%20Flavors%20After%20Sharing%20K%20Candies/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | 🔒 | +| 2108 | [Find First Palindromic String in the Array](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README_EN.md) | `Array`,`Two Pointers`,`String` | Easy | Weekly Contest 272 | +| 2109 | [Adding Spaces to a String](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README_EN.md) | `Array`,`Two Pointers`,`String`,`Simulation` | Medium | Weekly Contest 272 | +| 2110 | [Number of Smooth Descent Periods of a Stock](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | Weekly Contest 272 | +| 2111 | [Minimum Operations to Make the Array K-Increasing](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README_EN.md) | `Array`,`Binary Search` | Hard | Weekly Contest 272 | +| 2112 | [The Airport With the Most Traffic](/solution/2100-2199/2112.The%20Airport%20With%20the%20Most%20Traffic/README_EN.md) | `Database` | Medium | 🔒 | +| 2113 | [Elements in Array After Removing and Replacing Elements](/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README_EN.md) | `Array` | Medium | 🔒 | +| 2114 | [Maximum Number of Words Found in Sentences](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 68 | +| 2115 | [Find All Possible Recipes from Given Supplies](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Hash Table`,`String` | Medium | Biweekly Contest 68 | +| 2116 | [Check if a Parentheses String Can Be Valid](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README_EN.md) | `Stack`,`Greedy`,`String` | Medium | Biweekly Contest 68 | +| 2117 | [Abbreviating the Product of a Range](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README_EN.md) | `Math` | Hard | Biweekly Contest 68 | +| 2118 | [Build the Equation](/solution/2100-2199/2118.Build%20the%20Equation/README_EN.md) | `Database` | Hard | 🔒 | +| 2119 | [A Number After a Double Reversal](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README_EN.md) | `Math` | Easy | Weekly Contest 273 | +| 2120 | [Execution of All Suffix Instructions Staying in a Grid](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README_EN.md) | `String`,`Simulation` | Medium | Weekly Contest 273 | +| 2121 | [Intervals Between Identical Elements](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 273 | +| 2122 | [Recover the Original Array](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README_EN.md) | `Array`,`Hash Table`,`Enumeration`,`Sorting` | Hard | Weekly Contest 273 | +| 2123 | [Minimum Operations to Remove Adjacent Ones in Matrix](/solution/2100-2199/2123.Minimum%20Operations%20to%20Remove%20Adjacent%20Ones%20in%20Matrix/README_EN.md) | `Graph`,`Array`,`Matrix` | Hard | 🔒 | +| 2124 | [Check if All A's Appears Before All B's](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README_EN.md) | `String` | Easy | Weekly Contest 274 | +| 2125 | [Number of Laser Beams in a Bank](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README_EN.md) | `Array`,`Math`,`String`,`Matrix` | Medium | Weekly Contest 274 | +| 2126 | [Destroying Asteroids](/solution/2100-2199/2126.Destroying%20Asteroids/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 274 | +| 2127 | [Maximum Employees to Be Invited to a Meeting](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README_EN.md) | `Depth-First Search`,`Graph`,`Topological Sort` | Hard | Weekly Contest 274 | +| 2128 | [Remove All Ones With Row and Column Flips](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Matrix` | Medium | 🔒 | +| 2129 | [Capitalize the Title](/solution/2100-2199/2129.Capitalize%20the%20Title/README_EN.md) | `String` | Easy | Biweekly Contest 69 | +| 2130 | [Maximum Twin Sum of a Linked List](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README_EN.md) | `Stack`,`Linked List`,`Two Pointers` | Medium | Biweekly Contest 69 | +| 2131 | [Longest Palindrome by Concatenating Two Letter Words](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 69 | +| 2132 | [Stamping the Grid](/solution/2100-2199/2132.Stamping%20the%20Grid/README_EN.md) | `Greedy`,`Array`,`Matrix`,`Prefix Sum` | Hard | Biweekly Contest 69 | +| 2133 | [Check if Every Row and Column Contains All Numbers](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Easy | Weekly Contest 275 | +| 2134 | [Minimum Swaps to Group All 1's Together II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 275 | +| 2135 | [Count Words Obtained After Adding a Letter](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 275 | +| 2136 | [Earliest Possible Day of Full Bloom](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Weekly Contest 275 | +| 2137 | [Pour Water Between Buckets to Make Water Levels Equal](/solution/2100-2199/2137.Pour%20Water%20Between%20Buckets%20to%20Make%20Water%20Levels%20Equal/README_EN.md) | `Array`,`Binary Search` | Medium | 🔒 | +| 2138 | [Divide a String Into Groups of Size k](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 276 | +| 2139 | [Minimum Moves to Reach Target Score](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 276 | +| 2140 | [Solving Questions With Brainpower](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 276 | +| 2141 | [Maximum Running Time of N Computers](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Sorting` | Hard | Weekly Contest 276 | +| 2142 | [The Number of Passengers in Each Bus I](/solution/2100-2199/2142.The%20Number%20of%20Passengers%20in%20Each%20Bus%20I/README_EN.md) | `Database` | Medium | 🔒 | +| 2143 | [Choose Numbers From Two Arrays in Range](/solution/2100-2199/2143.Choose%20Numbers%20From%20Two%20Arrays%20in%20Range/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | +| 2144 | [Minimum Cost of Buying Candies With Discount](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Biweekly Contest 70 | +| 2145 | [Count the Hidden Sequences](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 70 | +| 2146 | [K Highest Ranked Items Within a Price Range](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 70 | +| 2147 | [Number of Ways to Divide a Long Corridor](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README_EN.md) | `Math`,`String`,`Dynamic Programming` | Hard | Biweekly Contest 70 | +| 2148 | [Count Elements With Strictly Smaller and Greater Elements](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 277 | +| 2149 | [Rearrange Array Elements by Sign](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Medium | Weekly Contest 277 | +| 2150 | [Find All Lonely Numbers in the Array](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 277 | +| 2151 | [Maximum Good People Based on Statements](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Hard | Weekly Contest 277 | +| 2152 | [Minimum Number of Lines to Cover Points](/solution/2100-2199/2152.Minimum%20Number%20of%20Lines%20to%20Cover%20Points/README_EN.md) | `Bit Manipulation`,`Geometry`,`Array`,`Hash Table`,`Math`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | 🔒 | +| 2153 | [The Number of Passengers in Each Bus II](/solution/2100-2199/2153.The%20Number%20of%20Passengers%20in%20Each%20Bus%20II/README_EN.md) | `Database` | Hard | 🔒 | +| 2154 | [Keep Multiplying Found Values by Two](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation` | Easy | Weekly Contest 278 | +| 2155 | [All Divisions With the Highest Score of a Binary Array](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README_EN.md) | `Array` | Medium | Weekly Contest 278 | +| 2156 | [Find Substring With Given Hash Value](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README_EN.md) | `String`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 278 | +| 2157 | [Groups of Strings](/solution/2100-2199/2157.Groups%20of%20Strings/README_EN.md) | `Bit Manipulation`,`Union Find`,`String` | Hard | Weekly Contest 278 | +| 2158 | [Amount of New Area Painted Each Day](/solution/2100-2199/2158.Amount%20of%20New%20Area%20Painted%20Each%20Day/README_EN.md) | `Segment Tree`,`Array`,`Ordered Set` | Hard | 🔒 | +| 2159 | [Order Two Columns Independently](/solution/2100-2199/2159.Order%20Two%20Columns%20Independently/README_EN.md) | `Database` | Medium | 🔒 | +| 2160 | [Minimum Sum of Four Digit Number After Splitting Digits](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README_EN.md) | `Greedy`,`Math`,`Sorting` | Easy | Biweekly Contest 71 | +| 2161 | [Partition Array According to Given Pivot](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Medium | Biweekly Contest 71 | +| 2162 | [Minimum Cost to Set Cooking Time](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README_EN.md) | `Math`,`Enumeration` | Medium | Biweekly Contest 71 | +| 2163 | [Minimum Difference in Sums After Removal of Elements](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README_EN.md) | `Array`,`Dynamic Programming`,`Heap (Priority Queue)` | Hard | Biweekly Contest 71 | +| 2164 | [Sort Even and Odd Indices Independently](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 279 | +| 2165 | [Smallest Value of the Rearranged Number](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README_EN.md) | `Math`,`Sorting` | Medium | Weekly Contest 279 | +| 2166 | [Design Bitset](/solution/2100-2199/2166.Design%20Bitset/README_EN.md) | `Design`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 279 | +| 2167 | [Minimum Time to Remove All Cars Containing Illegal Goods](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 279 | +| 2168 | [Unique Substrings With Equal Digit Frequency](/solution/2100-2199/2168.Unique%20Substrings%20With%20Equal%20Digit%20Frequency/README_EN.md) | `Hash Table`,`String`,`Counting`,`Hash Function`,`Rolling Hash` | Medium | 🔒 | +| 2169 | [Count Operations to Obtain Zero](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 280 | +| 2170 | [Minimum Operations to Make the Array Alternating](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 280 | +| 2171 | [Removing Minimum Number of Magic Beans](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README_EN.md) | `Greedy`,`Array`,`Enumeration`,`Prefix Sum`,`Sorting` | Medium | Weekly Contest 280 | +| 2172 | [Maximum AND Sum of Array](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 280 | +| 2173 | [Longest Winning Streak](/solution/2100-2199/2173.Longest%20Winning%20Streak/README_EN.md) | `Database` | Hard | 🔒 | +| 2174 | [Remove All Ones With Row and Column Flips II](/solution/2100-2199/2174.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips%20II/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array`,`Matrix` | Medium | 🔒 | +| 2175 | [The Change in Global Rankings](/solution/2100-2199/2175.The%20Change%20in%20Global%20Rankings/README_EN.md) | `Database` | Medium | 🔒 | +| 2176 | [Count Equal and Divisible Pairs in an Array](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README_EN.md) | `Array` | Easy | Biweekly Contest 72 | +| 2177 | [Find Three Consecutive Integers That Sum to a Given Number](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README_EN.md) | `Math`,`Simulation` | Medium | Biweekly Contest 72 | +| 2178 | [Maximum Split of Positive Even Integers](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README_EN.md) | `Greedy`,`Math`,`Backtracking` | Medium | Biweekly Contest 72 | +| 2179 | [Count Good Triplets in an Array](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | Biweekly Contest 72 | +| 2180 | [Count Integers With Even Digit Sum](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 281 | +| 2181 | [Merge Nodes in Between Zeros](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README_EN.md) | `Linked List`,`Simulation` | Medium | Weekly Contest 281 | +| 2182 | [Construct String With Repeat Limit](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Heap (Priority Queue)` | Medium | Weekly Contest 281 | +| 2183 | [Count Array Pairs Divisible by K](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README_EN.md) | `Array`,`Math`,`Number Theory` | Hard | Weekly Contest 281 | +| 2184 | [Number of Ways to Build Sturdy Brick Wall](/solution/2100-2199/2184.Number%20of%20Ways%20to%20Build%20Sturdy%20Brick%20Wall/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Medium | 🔒 | +| 2185 | [Counting Words With a Given Prefix](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README_EN.md) | `Array`,`String`,`String Matching` | Easy | Weekly Contest 282 | +| 2186 | [Minimum Number of Steps to Make Two Strings Anagram II](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 282 | +| 2187 | [Minimum Time to Complete Trips](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 282 | +| 2188 | [Minimum Time to Finish the Race](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 282 | +| 2189 | [Number of Ways to Build House of Cards](/solution/2100-2199/2189.Number%20of%20Ways%20to%20Build%20House%20of%20Cards/README_EN.md) | `Math`,`Dynamic Programming` | Medium | 🔒 | +| 2190 | [Most Frequent Number Following Key In an Array](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 73 | +| 2191 | [Sort the Jumbled Numbers](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 73 | +| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort` | Medium | Biweekly Contest 73 | +| 2193 | [Minimum Number of Moves to Make Palindrome](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README_EN.md) | `Greedy`,`Binary Indexed Tree`,`Two Pointers`,`String` | Hard | Biweekly Contest 73 | +| 2194 | [Cells in a Range on an Excel Sheet](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README_EN.md) | `String` | Easy | Weekly Contest 283 | +| 2195 | [Append K Integers With Minimal Sum](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Medium | Weekly Contest 283 | +| 2196 | [Create Binary Tree From Descriptions](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README_EN.md) | `Tree`,`Array`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 283 | +| 2197 | [Replace Non-Coprime Numbers in Array](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README_EN.md) | `Stack`,`Array`,`Math`,`Number Theory` | Hard | Weekly Contest 283 | +| 2198 | [Number of Single Divisor Triplets](/solution/2100-2199/2198.Number%20of%20Single%20Divisor%20Triplets/README_EN.md) | `Math` | Medium | 🔒 | +| 2199 | [Finding the Topic of Each Post](/solution/2100-2199/2199.Finding%20the%20Topic%20of%20Each%20Post/README_EN.md) | `Database` | Hard | 🔒 | +| 2200 | [Find All K-Distant Indices in an Array](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README_EN.md) | `Array`,`Two Pointers` | Easy | Weekly Contest 284 | +| 2201 | [Count Artifacts That Can Be Extracted](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 284 | +| 2202 | [Maximize the Topmost Element After K Moves](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 284 | +| 2203 | [Minimum Weighted Subgraph With the Required Paths](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README_EN.md) | `Graph`,`Shortest Path` | Hard | Weekly Contest 284 | +| 2204 | [Distance to a Cycle in Undirected Graph](/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Hard | 🔒 | +| 2205 | [The Number of Users That Are Eligible for Discount](/solution/2200-2299/2205.The%20Number%20of%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) | `Database` | Easy | 🔒 | +| 2206 | [Divide Array Into Equal Pairs](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 74 | +| 2207 | [Maximize Number of Subsequences in a String](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README_EN.md) | `Greedy`,`String`,`Prefix Sum` | Medium | Biweekly Contest 74 | +| 2208 | [Minimum Operations to Halve Array Sum](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Biweekly Contest 74 | +| 2209 | [Minimum White Tiles After Covering With Carpets](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum` | Hard | Biweekly Contest 74 | +| 2210 | [Count Hills and Valleys in an Array](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README_EN.md) | `Array` | Easy | Weekly Contest 285 | +| 2211 | [Count Collisions on a Road](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README_EN.md) | `Stack`,`String`,`Simulation` | Medium | Weekly Contest 285 | +| 2212 | [Maximum Points in an Archery Competition](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration` | Medium | Weekly Contest 285 | +| 2213 | [Longest Substring of One Repeating Character](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README_EN.md) | `Segment Tree`,`Array`,`String`,`Ordered Set` | Hard | Weekly Contest 285 | +| 2214 | [Minimum Health to Beat Game](/solution/2200-2299/2214.Minimum%20Health%20to%20Beat%20Game/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 | +| 2215 | [Find the Difference of Two Arrays](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 286 | +| 2216 | [Minimum Deletions to Make Array Beautiful](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README_EN.md) | `Stack`,`Greedy`,`Array` | Medium | Weekly Contest 286 | +| 2217 | [Find Palindrome With Fixed Length](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 286 | +| 2218 | [Maximum Value of K Coins From Piles](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 286 | +| 2219 | [Maximum Sum Score of Array](/solution/2200-2299/2219.Maximum%20Sum%20Score%20of%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | 🔒 | +| 2220 | [Minimum Bit Flips to Convert Number](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README_EN.md) | `Bit Manipulation` | Easy | Biweekly Contest 75 | +| 2221 | [Find Triangular Sum of an Array](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README_EN.md) | `Array`,`Math`,`Combinatorics`,`Simulation` | Medium | Biweekly Contest 75 | +| 2222 | [Number of Ways to Select Buildings](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README_EN.md) | `String`,`Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 75 | +| 2223 | [Sum of Scores of Built Strings](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README_EN.md) | `String`,`Binary Search`,`String Matching`,`Suffix Array`,`Hash Function`,`Rolling Hash` | Hard | Biweekly Contest 75 | +| 2224 | [Minimum Number of Operations to Convert Time](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README_EN.md) | `Greedy`,`String` | Easy | Weekly Contest 287 | +| 2225 | [Find Players With Zero or One Losses](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Weekly Contest 287 | +| 2226 | [Maximum Candies Allocated to K Children](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 287 | +| 2227 | [Encrypt and Decrypt Strings](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README_EN.md) | `Design`,`Trie`,`Array`,`Hash Table`,`String` | Hard | Weekly Contest 287 | +| 2228 | [Users With Two Purchases Within Seven Days](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README_EN.md) | `Database` | Medium | 🔒 | +| 2229 | [Check if an Array Is Consecutive](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | 🔒 | +| 2230 | [The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) | `Database` | Easy | 🔒 | +| 2231 | [Largest Number After Digit Swaps by Parity](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README_EN.md) | `Sorting`,`Heap (Priority Queue)` | Easy | Weekly Contest 288 | +| 2232 | [Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md) | `String`,`Enumeration` | Medium | Weekly Contest 288 | +| 2233 | [Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 288 | +| 2234 | [Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Hard | Weekly Contest 288 | +| 2235 | [Add Two Integers](/solution/2200-2299/2235.Add%20Two%20Integers/README_EN.md) | `Math` | Easy | | +| 2236 | [Root Equals Sum of Children](/solution/2200-2299/2236.Root%20Equals%20Sum%20of%20Children/README_EN.md) | `Tree`,`Binary Tree` | Easy | | +| 2237 | [Count Positions on Street With Required Brightness](/solution/2200-2299/2237.Count%20Positions%20on%20Street%20With%20Required%20Brightness/README_EN.md) | `Array`,`Prefix Sum` | Medium | 🔒 | +| 2238 | [Number of Times a Driver Was a Passenger](/solution/2200-2299/2238.Number%20of%20Times%20a%20Driver%20Was%20a%20Passenger/README_EN.md) | `Database` | Medium | 🔒 | +| 2239 | [Find Closest Number to Zero](/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README_EN.md) | `Array` | Easy | Biweekly Contest 76 | +| 2240 | [Number of Ways to Buy Pens and Pencils](/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README_EN.md) | `Math`,`Enumeration` | Medium | Biweekly Contest 76 | +| 2241 | [Design an ATM Machine](/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README_EN.md) | `Greedy`,`Design`,`Array` | Medium | Biweekly Contest 76 | +| 2242 | [Maximum Score of a Node Sequence](/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README_EN.md) | `Graph`,`Array`,`Enumeration`,`Sorting` | Hard | Biweekly Contest 76 | +| 2243 | [Calculate Digit Sum of a String](/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 289 | +| 2244 | [Minimum Rounds to Complete All Tasks](/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 289 | +| 2245 | [Maximum Trailing Zeros in a Cornered Path](/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 289 | +| 2246 | [Longest Path With Different Adjacent Characters](/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Topological Sort`,`Array`,`String` | Hard | Weekly Contest 289 | +| 2247 | [Maximum Cost of Trip With K Highways](/solution/2200-2299/2247.Maximum%20Cost%20of%20Trip%20With%20K%20Highways/README_EN.md) | `Bit Manipulation`,`Graph`,`Dynamic Programming`,`Bitmask` | Hard | 🔒 | +| 2248 | [Intersection of Multiple Arrays](/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Easy | Weekly Contest 290 | +| 2249 | [Count Lattice Points Inside a Circle](/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README_EN.md) | `Geometry`,`Array`,`Hash Table`,`Math`,`Enumeration` | Medium | Weekly Contest 290 | +| 2250 | [Count Number of Rectangles Containing Each Point](/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README_EN.md) | `Binary Indexed Tree`,`Array`,`Binary Search`,`Sorting` | Medium | Weekly Contest 290 | +| 2251 | [Number of Flowers in Full Bloom](/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Ordered Set`,`Prefix Sum`,`Sorting` | Hard | Weekly Contest 290 | +| 2252 | [Dynamic Pivoting of a Table](/solution/2200-2299/2252.Dynamic%20Pivoting%20of%20a%20Table/README_EN.md) | `Database` | Hard | 🔒 | +| 2253 | [Dynamic Unpivoting of a Table](/solution/2200-2299/2253.Dynamic%20Unpivoting%20of%20a%20Table/README_EN.md) | `Database` | Hard | 🔒 | +| 2254 | [Design Video Sharing Platform](/solution/2200-2299/2254.Design%20Video%20Sharing%20Platform/README_EN.md) | `Stack`,`Design`,`Hash Table`,`Ordered Set` | Hard | 🔒 | +| 2255 | [Count Prefixes of a Given String](/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 77 | +| 2256 | [Minimum Average Difference](/solution/2200-2299/2256.Minimum%20Average%20Difference/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 77 | +| 2257 | [Count Unguarded Cells in the Grid](/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Biweekly Contest 77 | +| 2258 | [Escape the Spreading Fire](/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README_EN.md) | `Breadth-First Search`,`Array`,`Binary Search`,`Matrix` | Hard | Biweekly Contest 77 | +| 2259 | [Remove Digit From Number to Maximize Result](/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README_EN.md) | `Greedy`,`String`,`Enumeration` | Easy | Weekly Contest 291 | +| 2260 | [Minimum Consecutive Cards to Pick Up](/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 291 | +| 2261 | [K Divisible Elements Subarrays](/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README_EN.md) | `Trie`,`Array`,`Hash Table`,`Enumeration`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 291 | +| 2262 | [Total Appeal of A String](/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming` | Hard | Weekly Contest 291 | +| 2263 | [Make Array Non-decreasing or Non-increasing](/solution/2200-2299/2263.Make%20Array%20Non-decreasing%20or%20Non-increasing/README_EN.md) | `Greedy`,`Dynamic Programming` | Hard | 🔒 | +| 2264 | [Largest 3-Same-Digit Number in String](/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README_EN.md) | `String` | Easy | Weekly Contest 292 | +| 2265 | [Count Nodes Equal to Average of Subtree](/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Medium | Weekly Contest 292 | +| 2266 | [Count Number of Texts](/solution/2200-2299/2266.Count%20Number%20of%20Texts/README_EN.md) | `Hash Table`,`Math`,`String`,`Dynamic Programming` | Medium | Weekly Contest 292 | +| 2267 | [Check if There Is a Valid Parentheses String Path](/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 292 | +| 2268 | [Minimum Number of Keypresses](/solution/2200-2299/2268.Minimum%20Number%20of%20Keypresses/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | 🔒 | +| 2269 | [Find the K-Beauty of a Number](/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README_EN.md) | `Math`,`String`,`Sliding Window` | Easy | Biweekly Contest 78 | +| 2270 | [Number of Ways to Split Array](/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 78 | +| 2271 | [Maximum White Tiles Covered by a Carpet](/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 78 | +| 2272 | [Substring With Largest Variance](/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 78 | +| 2273 | [Find Resultant Array After Removing Anagrams](/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Easy | Weekly Contest 293 | +| 2274 | [Maximum Consecutive Floors Without Special Floors](/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 293 | +| 2275 | [Largest Combination With Bitwise AND Greater Than Zero](/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 293 | +| 2276 | [Count Integers in Intervals](/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README_EN.md) | `Design`,`Segment Tree`,`Ordered Set` | Hard | Weekly Contest 293 | +| 2277 | [Closest Node to Path in Tree](/solution/2200-2299/2277.Closest%20Node%20to%20Path%20in%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array` | Hard | 🔒 | +| 2278 | [Percentage of Letter in String](/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README_EN.md) | `String` | Easy | Weekly Contest 294 | +| 2279 | [Maximum Bags With Full Capacity of Rocks](/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 294 | +| 2280 | [Minimum Lines to Represent a Line Chart](/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README_EN.md) | `Geometry`,`Array`,`Math`,`Number Theory`,`Sorting` | Medium | Weekly Contest 294 | +| 2281 | [Sum of Total Strength of Wizards](/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README_EN.md) | `Stack`,`Array`,`Prefix Sum`,`Monotonic Stack` | Hard | Weekly Contest 294 | +| 2282 | [Number of People That Can Be Seen in a Grid](/solution/2200-2299/2282.Number%20of%20People%20That%20Can%20Be%20Seen%20in%20a%20Grid/README_EN.md) | `Stack`,`Array`,`Matrix`,`Monotonic Stack` | Medium | 🔒 | +| 2283 | [Check if Number Has Equal Digit Count and Digit Value](/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 79 | +| 2284 | [Sender With Largest Word Count](/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting` | Medium | Biweekly Contest 79 | +| 2285 | [Maximum Total Importance of Roads](/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README_EN.md) | `Greedy`,`Graph`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 79 | +| 2286 | [Booking Concert Tickets in Groups](/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README_EN.md) | `Design`,`Binary Indexed Tree`,`Segment Tree`,`Binary Search` | Hard | Biweekly Contest 79 | +| 2287 | [Rearrange Characters to Make Target String](/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Weekly Contest 295 | +| 2288 | [Apply Discount to Prices](/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README_EN.md) | `String` | Medium | Weekly Contest 295 | +| 2289 | [Steps to Make Array Non-decreasing](/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README_EN.md) | `Stack`,`Array`,`Linked List`,`Monotonic Stack` | Medium | Weekly Contest 295 | +| 2290 | [Minimum Obstacle Removal to Reach Corner](/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 295 | +| 2291 | [Maximum Profit From Trading Stocks](/solution/2200-2299/2291.Maximum%20Profit%20From%20Trading%20Stocks/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | +| 2292 | [Products With Three or More Orders in Two Consecutive Years](/solution/2200-2299/2292.Products%20With%20Three%20or%20More%20Orders%20in%20Two%20Consecutive%20Years/README_EN.md) | `Database` | Medium | 🔒 | +| 2293 | [Min Max Game](/solution/2200-2299/2293.Min%20Max%20Game/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 296 | +| 2294 | [Partition Array Such That Maximum Difference Is K](/solution/2200-2299/2294.Partition%20Array%20Such%20That%20Maximum%20Difference%20Is%20K/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 296 | +| 2295 | [Replace Elements in an Array](/solution/2200-2299/2295.Replace%20Elements%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 296 | +| 2296 | [Design a Text Editor](/solution/2200-2299/2296.Design%20a%20Text%20Editor/README_EN.md) | `Stack`,`Design`,`Linked List`,`String`,`Doubly-Linked List`,`Simulation` | Hard | Weekly Contest 296 | +| 2297 | [Jump Game VIII](/solution/2200-2299/2297.Jump%20Game%20VIII/README_EN.md) | `Stack`,`Graph`,`Array`,`Dynamic Programming`,`Shortest Path`,`Monotonic Stack` | Medium | 🔒 | +| 2298 | [Tasks Count in the Weekend](/solution/2200-2299/2298.Tasks%20Count%20in%20the%20Weekend/README_EN.md) | `Database` | Medium | 🔒 | +| 2299 | [Strong Password Checker II](/solution/2200-2299/2299.Strong%20Password%20Checker%20II/README_EN.md) | `String` | Easy | Biweekly Contest 80 | +| 2300 | [Successful Pairs of Spells and Potions](/solution/2300-2399/2300.Successful%20Pairs%20of%20Spells%20and%20Potions/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 80 | +| 2301 | [Match Substring After Replacement](/solution/2300-2399/2301.Match%20Substring%20After%20Replacement/README_EN.md) | `Array`,`Hash Table`,`String`,`String Matching` | Hard | Biweekly Contest 80 | +| 2302 | [Count Subarrays With Score Less Than K](/solution/2300-2399/2302.Count%20Subarrays%20With%20Score%20Less%20Than%20K/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Hard | Biweekly Contest 80 | +| 2303 | [Calculate Amount Paid in Taxes](/solution/2300-2399/2303.Calculate%20Amount%20Paid%20in%20Taxes/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 297 | +| 2304 | [Minimum Path Cost in a Grid](/solution/2300-2399/2304.Minimum%20Path%20Cost%20in%20a%20Grid/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 297 | +| 2305 | [Fair Distribution of Cookies](/solution/2300-2399/2305.Fair%20Distribution%20of%20Cookies/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Bitmask` | Medium | Weekly Contest 297 | +| 2306 | [Naming a Company](/solution/2300-2399/2306.Naming%20a%20Company/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String`,`Enumeration` | Hard | Weekly Contest 297 | +| 2307 | [Check for Contradictions in Equations](/solution/2300-2399/2307.Check%20for%20Contradictions%20in%20Equations/README_EN.md) | `Depth-First Search`,`Union Find`,`Graph`,`Array` | Hard | 🔒 | +| 2308 | [Arrange Table by Gender](/solution/2300-2399/2308.Arrange%20Table%20by%20Gender/README_EN.md) | `Database` | Medium | 🔒 | +| 2309 | [Greatest English Letter in Upper and Lower Case](/solution/2300-2399/2309.Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case/README_EN.md) | `Hash Table`,`String`,`Enumeration` | Easy | Weekly Contest 298 | +| 2310 | [Sum of Numbers With Units Digit K](/solution/2300-2399/2310.Sum%20of%20Numbers%20With%20Units%20Digit%20K/README_EN.md) | `Greedy`,`Math`,`Dynamic Programming`,`Enumeration` | Medium | Weekly Contest 298 | +| 2311 | [Longest Binary Subsequence Less Than or Equal to K](/solution/2300-2399/2311.Longest%20Binary%20Subsequence%20Less%20Than%20or%20Equal%20to%20K/README_EN.md) | `Greedy`,`Memoization`,`String`,`Dynamic Programming` | Medium | Weekly Contest 298 | +| 2312 | [Selling Pieces of Wood](/solution/2300-2399/2312.Selling%20Pieces%20of%20Wood/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 298 | +| 2313 | [Minimum Flips in Binary Tree to Get Result](/solution/2300-2399/2313.Minimum%20Flips%20in%20Binary%20Tree%20to%20Get%20Result/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Binary Tree` | Hard | 🔒 | +| 2314 | [The First Day of the Maximum Recorded Degree in Each City](/solution/2300-2399/2314.The%20First%20Day%20of%20the%20Maximum%20Recorded%20Degree%20in%20Each%20City/README_EN.md) | `Database` | Medium | 🔒 | +| 2315 | [Count Asterisks](/solution/2300-2399/2315.Count%20Asterisks/README_EN.md) | `String` | Easy | Biweekly Contest 81 | +| 2316 | [Count Unreachable Pairs of Nodes in an Undirected Graph](/solution/2300-2399/2316.Count%20Unreachable%20Pairs%20of%20Nodes%20in%20an%20Undirected%20Graph/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Biweekly Contest 81 | +| 2317 | [Maximum XOR After Operations](/solution/2300-2399/2317.Maximum%20XOR%20After%20Operations/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Medium | Biweekly Contest 81 | +| 2318 | [Number of Distinct Roll Sequences](/solution/2300-2399/2318.Number%20of%20Distinct%20Roll%20Sequences/README_EN.md) | `Memoization`,`Dynamic Programming` | Hard | Biweekly Contest 81 | +| 2319 | [Check if Matrix Is X-Matrix](/solution/2300-2399/2319.Check%20if%20Matrix%20Is%20X-Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 299 | +| 2320 | [Count Number of Ways to Place Houses](/solution/2300-2399/2320.Count%20Number%20of%20Ways%20to%20Place%20Houses/README_EN.md) | `Dynamic Programming` | Medium | Weekly Contest 299 | +| 2321 | [Maximum Score Of Spliced Array](/solution/2300-2399/2321.Maximum%20Score%20Of%20Spliced%20Array/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 299 | +| 2322 | [Minimum Score After Removals on a Tree](/solution/2300-2399/2322.Minimum%20Score%20After%20Removals%20on%20a%20Tree/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Array` | Hard | Weekly Contest 299 | +| 2323 | [Find Minimum Time to Finish All Jobs II](/solution/2300-2399/2323.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs%20II/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | +| 2324 | [Product Sales Analysis IV](/solution/2300-2399/2324.Product%20Sales%20Analysis%20IV/README_EN.md) | `Database` | Medium | 🔒 | +| 2325 | [Decode the Message](/solution/2300-2399/2325.Decode%20the%20Message/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 300 | +| 2326 | [Spiral Matrix IV](/solution/2300-2399/2326.Spiral%20Matrix%20IV/README_EN.md) | `Array`,`Linked List`,`Matrix`,`Simulation` | Medium | Weekly Contest 300 | +| 2327 | [Number of People Aware of a Secret](/solution/2300-2399/2327.Number%20of%20People%20Aware%20of%20a%20Secret/README_EN.md) | `Queue`,`Dynamic Programming`,`Simulation` | Medium | Weekly Contest 300 | +| 2328 | [Number of Increasing Paths in a Grid](/solution/2300-2399/2328.Number%20of%20Increasing%20Paths%20in%20a%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Topological Sort`,`Memoization`,`Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 300 | +| 2329 | [Product Sales Analysis V](/solution/2300-2399/2329.Product%20Sales%20Analysis%20V/README_EN.md) | `Database` | Easy | 🔒 | +| 2330 | [Valid Palindrome IV](/solution/2300-2399/2330.Valid%20Palindrome%20IV/README_EN.md) | `Two Pointers`,`String` | Medium | 🔒 | +| 2331 | [Evaluate Boolean Binary Tree](/solution/2300-2399/2331.Evaluate%20Boolean%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | Biweekly Contest 82 | +| 2332 | [The Latest Time to Catch a Bus](/solution/2300-2399/2332.The%20Latest%20Time%20to%20Catch%20a%20Bus/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 82 | +| 2333 | [Minimum Sum of Squared Difference](/solution/2300-2399/2333.Minimum%20Sum%20of%20Squared%20Difference/README_EN.md) | `Array`,`Math`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 82 | +| 2334 | [Subarray With Elements Greater Than Varying Threshold](/solution/2300-2399/2334.Subarray%20With%20Elements%20Greater%20Than%20Varying%20Threshold/README_EN.md) | `Stack`,`Union Find`,`Array`,`Monotonic Stack` | Hard | Biweekly Contest 82 | +| 2335 | [Minimum Amount of Time to Fill Cups](/solution/2300-2399/2335.Minimum%20Amount%20of%20Time%20to%20Fill%20Cups/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Easy | Weekly Contest 301 | +| 2336 | [Smallest Number in Infinite Set](/solution/2300-2399/2336.Smallest%20Number%20in%20Infinite%20Set/README_EN.md) | `Design`,`Hash Table`,`Heap (Priority Queue)` | Medium | Weekly Contest 301 | +| 2337 | [Move Pieces to Obtain a String](/solution/2300-2399/2337.Move%20Pieces%20to%20Obtain%20a%20String/README_EN.md) | `Two Pointers`,`String` | Medium | Weekly Contest 301 | +| 2338 | [Count the Number of Ideal Arrays](/solution/2300-2399/2338.Count%20the%20Number%20of%20Ideal%20Arrays/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics`,`Number Theory` | Hard | Weekly Contest 301 | +| 2339 | [All the Matches of the League](/solution/2300-2399/2339.All%20the%20Matches%20of%20the%20League/README_EN.md) | `Database` | Easy | 🔒 | +| 2340 | [Minimum Adjacent Swaps to Make a Valid Array](/solution/2300-2399/2340.Minimum%20Adjacent%20Swaps%20to%20Make%20a%20Valid%20Array/README_EN.md) | `Greedy`,`Array` | Medium | 🔒 | +| 2341 | [Maximum Number of Pairs in Array](/solution/2300-2399/2341.Maximum%20Number%20of%20Pairs%20in%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 302 | +| 2342 | [Max Sum of a Pair With Equal Sum of Digits](/solution/2300-2399/2342.Max%20Sum%20of%20a%20Pair%20With%20Equal%20Sum%20of%20Digits/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 302 | +| 2343 | [Query Kth Smallest Trimmed Number](/solution/2300-2399/2343.Query%20Kth%20Smallest%20Trimmed%20Number/README_EN.md) | `Array`,`String`,`Divide and Conquer`,`Quickselect`,`Radix Sort`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 302 | +| 2344 | [Minimum Deletions to Make Array Divisible](/solution/2300-2399/2344.Minimum%20Deletions%20to%20Make%20Array%20Divisible/README_EN.md) | `Array`,`Math`,`Number Theory`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 302 | +| 2345 | [Finding the Number of Visible Mountains](/solution/2300-2399/2345.Finding%20the%20Number%20of%20Visible%20Mountains/README_EN.md) | `Stack`,`Array`,`Sorting`,`Monotonic Stack` | Medium | 🔒 | +| 2346 | [Compute the Rank as a Percentage](/solution/2300-2399/2346.Compute%20the%20Rank%20as%20a%20Percentage/README_EN.md) | `Database` | Medium | 🔒 | +| 2347 | [Best Poker Hand](/solution/2300-2399/2347.Best%20Poker%20Hand/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Biweekly Contest 83 | +| 2348 | [Number of Zero-Filled Subarrays](/solution/2300-2399/2348.Number%20of%20Zero-Filled%20Subarrays/README_EN.md) | `Array`,`Math` | Medium | Biweekly Contest 83 | +| 2349 | [Design a Number Container System](/solution/2300-2399/2349.Design%20a%20Number%20Container%20System/README_EN.md) | `Design`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Biweekly Contest 83 | +| 2350 | [Shortest Impossible Sequence of Rolls](/solution/2300-2399/2350.Shortest%20Impossible%20Sequence%20of%20Rolls/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Hard | Biweekly Contest 83 | +| 2351 | [First Letter to Appear Twice](/solution/2300-2399/2351.First%20Letter%20to%20Appear%20Twice/README_EN.md) | `Bit Manipulation`,`Hash Table`,`String`,`Counting` | Easy | Weekly Contest 303 | +| 2352 | [Equal Row and Column Pairs](/solution/2300-2399/2352.Equal%20Row%20and%20Column%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Matrix`,`Simulation` | Medium | Weekly Contest 303 | +| 2353 | [Design a Food Rating System](/solution/2300-2399/2353.Design%20a%20Food%20Rating%20System/README_EN.md) | `Design`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 303 | +| 2354 | [Number of Excellent Pairs](/solution/2300-2399/2354.Number%20of%20Excellent%20Pairs/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Binary Search` | Hard | Weekly Contest 303 | +| 2355 | [Maximum Number of Books You Can Take](/solution/2300-2399/2355.Maximum%20Number%20of%20Books%20You%20Can%20Take/README_EN.md) | `Stack`,`Array`,`Dynamic Programming`,`Monotonic Stack` | Hard | 🔒 | +| 2356 | [Number of Unique Subjects Taught by Each Teacher](/solution/2300-2399/2356.Number%20of%20Unique%20Subjects%20Taught%20by%20Each%20Teacher/README_EN.md) | `Database` | Easy | | +| 2357 | [Make Array Zero by Subtracting Equal Amounts](/solution/2300-2399/2357.Make%20Array%20Zero%20by%20Subtracting%20Equal%20Amounts/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 304 | +| 2358 | [Maximum Number of Groups Entering a Competition](/solution/2300-2399/2358.Maximum%20Number%20of%20Groups%20Entering%20a%20Competition/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search` | Medium | Weekly Contest 304 | +| 2359 | [Find Closest Node to Given Two Nodes](/solution/2300-2399/2359.Find%20Closest%20Node%20to%20Given%20Two%20Nodes/README_EN.md) | `Depth-First Search`,`Graph` | Medium | Weekly Contest 304 | +| 2360 | [Longest Cycle in a Graph](/solution/2300-2399/2360.Longest%20Cycle%20in%20a%20Graph/README_EN.md) | `Depth-First Search`,`Graph`,`Topological Sort` | Hard | Weekly Contest 304 | +| 2361 | [Minimum Costs Using the Train Line](/solution/2300-2399/2361.Minimum%20Costs%20Using%20the%20Train%20Line/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | +| 2362 | [Generate the Invoice](/solution/2300-2399/2362.Generate%20the%20Invoice/README_EN.md) | `Database` | Hard | 🔒 | +| 2363 | [Merge Similar Items](/solution/2300-2399/2363.Merge%20Similar%20Items/README_EN.md) | `Array`,`Hash Table`,`Ordered Set`,`Sorting` | Easy | Biweekly Contest 84 | +| 2364 | [Count Number of Bad Pairs](/solution/2300-2399/2364.Count%20Number%20of%20Bad%20Pairs/README_EN.md) | `Array`,`Hash Table` | Medium | Biweekly Contest 84 | +| 2365 | [Task Scheduler II](/solution/2300-2399/2365.Task%20Scheduler%20II/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Biweekly Contest 84 | +| 2366 | [Minimum Replacements to Sort the Array](/solution/2300-2399/2366.Minimum%20Replacements%20to%20Sort%20the%20Array/README_EN.md) | `Greedy`,`Array`,`Math` | Hard | Biweekly Contest 84 | +| 2367 | [Number of Arithmetic Triplets](/solution/2300-2399/2367.Number%20of%20Arithmetic%20Triplets/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Enumeration` | Easy | Weekly Contest 305 | +| 2368 | [Reachable Nodes With Restrictions](/solution/2300-2399/2368.Reachable%20Nodes%20With%20Restrictions/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph`,`Array`,`Hash Table` | Medium | Weekly Contest 305 | +| 2369 | [Check if There is a Valid Partition For The Array](/solution/2300-2399/2369.Check%20if%20There%20is%20a%20Valid%20Partition%20For%20The%20Array/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 305 | +| 2370 | [Longest Ideal Subsequence](/solution/2300-2399/2370.Longest%20Ideal%20Subsequence/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming` | Medium | Weekly Contest 305 | +| 2371 | [Minimize Maximum Value in a Grid](/solution/2300-2399/2371.Minimize%20Maximum%20Value%20in%20a%20Grid/README_EN.md) | `Union Find`,`Graph`,`Topological Sort`,`Array`,`Matrix`,`Sorting` | Hard | 🔒 | +| 2372 | [Calculate the Influence of Each Salesperson](/solution/2300-2399/2372.Calculate%20the%20Influence%20of%20Each%20Salesperson/README_EN.md) | `Database` | Medium | 🔒 | +| 2373 | [Largest Local Values in a Matrix](/solution/2300-2399/2373.Largest%20Local%20Values%20in%20a%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 306 | +| 2374 | [Node With Highest Edge Score](/solution/2300-2399/2374.Node%20With%20Highest%20Edge%20Score/README_EN.md) | `Graph`,`Hash Table` | Medium | Weekly Contest 306 | +| 2375 | [Construct Smallest Number From DI String](/solution/2300-2399/2375.Construct%20Smallest%20Number%20From%20DI%20String/README_EN.md) | `Stack`,`Greedy`,`String`,`Backtracking` | Medium | Weekly Contest 306 | +| 2376 | [Count Special Integers](/solution/2300-2399/2376.Count%20Special%20Integers/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Weekly Contest 306 | +| 2377 | [Sort the Olympic Table](/solution/2300-2399/2377.Sort%20the%20Olympic%20Table/README_EN.md) | `Database` | Easy | 🔒 | +| 2378 | [Choose Edges to Maximize Score in a Tree](/solution/2300-2399/2378.Choose%20Edges%20to%20Maximize%20Score%20in%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming` | Medium | 🔒 | +| 2379 | [Minimum Recolors to Get K Consecutive Black Blocks](/solution/2300-2399/2379.Minimum%20Recolors%20to%20Get%20K%20Consecutive%20Black%20Blocks/README_EN.md) | `String`,`Sliding Window` | Easy | Biweekly Contest 85 | +| 2380 | [Time Needed to Rearrange a Binary String](/solution/2300-2399/2380.Time%20Needed%20to%20Rearrange%20a%20Binary%20String/README_EN.md) | `String`,`Dynamic Programming`,`Simulation` | Medium | Biweekly Contest 85 | +| 2381 | [Shifting Letters II](/solution/2300-2399/2381.Shifting%20Letters%20II/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Biweekly Contest 85 | +| 2382 | [Maximum Segment Sum After Removals](/solution/2300-2399/2382.Maximum%20Segment%20Sum%20After%20Removals/README_EN.md) | `Union Find`,`Array`,`Ordered Set`,`Prefix Sum` | Hard | Biweekly Contest 85 | +| 2383 | [Minimum Hours of Training to Win a Competition](/solution/2300-2399/2383.Minimum%20Hours%20of%20Training%20to%20Win%20a%20Competition/README_EN.md) | `Greedy`,`Array` | Easy | Weekly Contest 307 | +| 2384 | [Largest Palindromic Number](/solution/2300-2399/2384.Largest%20Palindromic%20Number/README_EN.md) | `Greedy`,`Hash Table`,`String` | Medium | Weekly Contest 307 | +| 2385 | [Amount of Time for Binary Tree to Be Infected](/solution/2300-2399/2385.Amount%20of%20Time%20for%20Binary%20Tree%20to%20Be%20Infected/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Weekly Contest 307 | +| 2386 | [Find the K-Sum of an Array](/solution/2300-2399/2386.Find%20the%20K-Sum%20of%20an%20Array/README_EN.md) | `Array`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 307 | +| 2387 | [Median of a Row Wise Sorted Matrix](/solution/2300-2399/2387.Median%20of%20a%20Row%20Wise%20Sorted%20Matrix/README_EN.md) | `Array`,`Binary Search`,`Matrix` | Medium | 🔒 | +| 2388 | [Change Null Values in a Table to the Previous Value](/solution/2300-2399/2388.Change%20Null%20Values%20in%20a%20Table%20to%20the%20Previous%20Value/README_EN.md) | `Database` | Medium | 🔒 | +| 2389 | [Longest Subsequence With Limited Sum](/solution/2300-2399/2389.Longest%20Subsequence%20With%20Limited%20Sum/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Easy | Weekly Contest 308 | +| 2390 | [Removing Stars From a String](/solution/2300-2399/2390.Removing%20Stars%20From%20a%20String/README_EN.md) | `Stack`,`String`,`Simulation` | Medium | Weekly Contest 308 | +| 2391 | [Minimum Amount of Time to Collect Garbage](/solution/2300-2399/2391.Minimum%20Amount%20of%20Time%20to%20Collect%20Garbage/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Weekly Contest 308 | +| 2392 | [Build a Matrix With Conditions](/solution/2300-2399/2392.Build%20a%20Matrix%20With%20Conditions/README_EN.md) | `Graph`,`Topological Sort`,`Array`,`Matrix` | Hard | Weekly Contest 308 | +| 2393 | [Count Strictly Increasing Subarrays](/solution/2300-2399/2393.Count%20Strictly%20Increasing%20Subarrays/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | 🔒 | +| 2394 | [Employees With Deductions](/solution/2300-2399/2394.Employees%20With%20Deductions/README_EN.md) | `Database` | Medium | 🔒 | +| 2395 | [Find Subarrays With Equal Sum](/solution/2300-2399/2395.Find%20Subarrays%20With%20Equal%20Sum/README_EN.md) | `Array`,`Hash Table` | Easy | Biweekly Contest 86 | +| 2396 | [Strictly Palindromic Number](/solution/2300-2399/2396.Strictly%20Palindromic%20Number/README_EN.md) | `Brainteaser`,`Math`,`Two Pointers` | Medium | Biweekly Contest 86 | +| 2397 | [Maximum Rows Covered by Columns](/solution/2300-2399/2397.Maximum%20Rows%20Covered%20by%20Columns/README_EN.md) | `Bit Manipulation`,`Array`,`Backtracking`,`Enumeration`,`Matrix` | Medium | Biweekly Contest 86 | +| 2398 | [Maximum Number of Robots Within Budget](/solution/2300-2399/2398.Maximum%20Number%20of%20Robots%20Within%20Budget/README_EN.md) | `Queue`,`Array`,`Binary Search`,`Prefix Sum`,`Sliding Window`,`Heap (Priority Queue)` | Hard | Biweekly Contest 86 | +| 2399 | [Check Distances Between Same Letters](/solution/2300-2399/2399.Check%20Distances%20Between%20Same%20Letters/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Weekly Contest 309 | +| 2400 | [Number of Ways to Reach a Position After Exactly k Steps](/solution/2400-2499/2400.Number%20of%20Ways%20to%20Reach%20a%20Position%20After%20Exactly%20k%20Steps/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | Weekly Contest 309 | +| 2401 | [Longest Nice Subarray](/solution/2400-2499/2401.Longest%20Nice%20Subarray/README_EN.md) | `Bit Manipulation`,`Array`,`Sliding Window` | Medium | Weekly Contest 309 | +| 2402 | [Meeting Rooms III](/solution/2400-2499/2402.Meeting%20Rooms%20III/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Hard | Weekly Contest 309 | +| 2403 | [Minimum Time to Kill All Monsters](/solution/2400-2499/2403.Minimum%20Time%20to%20Kill%20All%20Monsters/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | 🔒 | +| 2404 | [Most Frequent Even Element](/solution/2400-2499/2404.Most%20Frequent%20Even%20Element/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 310 | +| 2405 | [Optimal Partition of String](/solution/2400-2499/2405.Optimal%20Partition%20of%20String/README_EN.md) | `Greedy`,`Hash Table`,`String` | Medium | Weekly Contest 310 | +| 2406 | [Divide Intervals Into Minimum Number of Groups](/solution/2400-2499/2406.Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Prefix Sum`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 310 | +| 2407 | [Longest Increasing Subsequence II](/solution/2400-2499/2407.Longest%20Increasing%20Subsequence%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Queue`,`Array`,`Divide and Conquer`,`Dynamic Programming`,`Monotonic Queue` | Hard | Weekly Contest 310 | +| 2408 | [Design SQL](/solution/2400-2499/2408.Design%20SQL/README_EN.md) | `Design`,`Array`,`Hash Table`,`String` | Medium | 🔒 | +| 2409 | [Count Days Spent Together](/solution/2400-2499/2409.Count%20Days%20Spent%20Together/README_EN.md) | `Math`,`String` | Easy | Biweekly Contest 87 | +| 2410 | [Maximum Matching of Players With Trainers](/solution/2400-2499/2410.Maximum%20Matching%20of%20Players%20With%20Trainers/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Biweekly Contest 87 | +| 2411 | [Smallest Subarrays With Maximum Bitwise OR](/solution/2400-2499/2411.Smallest%20Subarrays%20With%20Maximum%20Bitwise%20OR/README_EN.md) | `Bit Manipulation`,`Array`,`Binary Search`,`Sliding Window` | Medium | Biweekly Contest 87 | +| 2412 | [Minimum Money Required Before Transactions](/solution/2400-2499/2412.Minimum%20Money%20Required%20Before%20Transactions/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Biweekly Contest 87 | +| 2413 | [Smallest Even Multiple](/solution/2400-2499/2413.Smallest%20Even%20Multiple/README_EN.md) | `Math`,`Number Theory` | Easy | Weekly Contest 311 | +| 2414 | [Length of the Longest Alphabetical Continuous Substring](/solution/2400-2499/2414.Length%20of%20the%20Longest%20Alphabetical%20Continuous%20Substring/README_EN.md) | `String` | Medium | Weekly Contest 311 | +| 2415 | [Reverse Odd Levels of Binary Tree](/solution/2400-2499/2415.Reverse%20Odd%20Levels%20of%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 311 | +| 2416 | [Sum of Prefix Scores of Strings](/solution/2400-2499/2416.Sum%20of%20Prefix%20Scores%20of%20Strings/README_EN.md) | `Trie`,`Array`,`String`,`Counting` | Hard | Weekly Contest 311 | +| 2417 | [Closest Fair Integer](/solution/2400-2499/2417.Closest%20Fair%20Integer/README_EN.md) | `Math`,`Enumeration` | Medium | 🔒 | +| 2418 | [Sort the People](/solution/2400-2499/2418.Sort%20the%20People/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Easy | Weekly Contest 312 | +| 2419 | [Longest Subarray With Maximum Bitwise AND](/solution/2400-2499/2419.Longest%20Subarray%20With%20Maximum%20Bitwise%20AND/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array` | Medium | Weekly Contest 312 | +| 2420 | [Find All Good Indices](/solution/2400-2499/2420.Find%20All%20Good%20Indices/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Medium | Weekly Contest 312 | +| 2421 | [Number of Good Paths](/solution/2400-2499/2421.Number%20of%20Good%20Paths/README_EN.md) | `Tree`,`Union Find`,`Graph`,`Array`,`Hash Table`,`Sorting` | Hard | Weekly Contest 312 | +| 2422 | [Merge Operations to Turn Array Into a Palindrome](/solution/2400-2499/2422.Merge%20Operations%20to%20Turn%20Array%20Into%20a%20Palindrome/README_EN.md) | `Greedy`,`Array`,`Two Pointers` | Medium | 🔒 | +| 2423 | [Remove Letter To Equalize Frequency](/solution/2400-2499/2423.Remove%20Letter%20To%20Equalize%20Frequency/README_EN.md) | `Hash Table`,`String`,`Counting` | Easy | Biweekly Contest 88 | +| 2424 | [Longest Uploaded Prefix](/solution/2400-2499/2424.Longest%20Uploaded%20Prefix/README_EN.md) | `Union Find`,`Design`,`Binary Indexed Tree`,`Segment Tree`,`Binary Search`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Biweekly Contest 88 | +| 2425 | [Bitwise XOR of All Pairings](/solution/2400-2499/2425.Bitwise%20XOR%20of%20All%20Pairings/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array` | Medium | Biweekly Contest 88 | +| 2426 | [Number of Pairs Satisfying Inequality](/solution/2400-2499/2426.Number%20of%20Pairs%20Satisfying%20Inequality/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | Biweekly Contest 88 | +| 2427 | [Number of Common Factors](/solution/2400-2499/2427.Number%20of%20Common%20Factors/README_EN.md) | `Math`,`Enumeration`,`Number Theory` | Easy | Weekly Contest 313 | +| 2428 | [Maximum Sum of an Hourglass](/solution/2400-2499/2428.Maximum%20Sum%20of%20an%20Hourglass/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 313 | +| 2429 | [Minimize XOR](/solution/2400-2499/2429.Minimize%20XOR/README_EN.md) | `Greedy`,`Bit Manipulation` | Medium | Weekly Contest 313 | +| 2430 | [Maximum Deletions on a String](/solution/2400-2499/2430.Maximum%20Deletions%20on%20a%20String/README_EN.md) | `String`,`Dynamic Programming`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 313 | +| 2431 | [Maximize Total Tastiness of Purchased Fruits](/solution/2400-2499/2431.Maximize%20Total%20Tastiness%20of%20Purchased%20Fruits/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | +| 2432 | [The Employee That Worked on the Longest Task](/solution/2400-2499/2432.The%20Employee%20That%20Worked%20on%20the%20Longest%20Task/README_EN.md) | `Array` | Easy | Weekly Contest 314 | +| 2433 | [Find The Original Array of Prefix Xor](/solution/2400-2499/2433.Find%20The%20Original%20Array%20of%20Prefix%20Xor/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Weekly Contest 314 | +| 2434 | [Using a Robot to Print the Lexicographically Smallest String](/solution/2400-2499/2434.Using%20a%20Robot%20to%20Print%20the%20Lexicographically%20Smallest%20String/README_EN.md) | `Stack`,`Greedy`,`Hash Table`,`String` | Medium | Weekly Contest 314 | +| 2435 | [Paths in Matrix Whose Sum Is Divisible by K](/solution/2400-2499/2435.Paths%20in%20Matrix%20Whose%20Sum%20Is%20Divisible%20by%20K/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 314 | +| 2436 | [Minimum Split Into Subarrays With GCD Greater Than One](/solution/2400-2499/2436.Minimum%20Split%20Into%20Subarrays%20With%20GCD%20Greater%20Than%20One/README_EN.md) | `Greedy`,`Array`,`Math`,`Dynamic Programming`,`Number Theory` | Medium | 🔒 | +| 2437 | [Number of Valid Clock Times](/solution/2400-2499/2437.Number%20of%20Valid%20Clock%20Times/README_EN.md) | `String`,`Enumeration` | Easy | Biweekly Contest 89 | +| 2438 | [Range Product Queries of Powers](/solution/2400-2499/2438.Range%20Product%20Queries%20of%20Powers/README_EN.md) | `Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Biweekly Contest 89 | +| 2439 | [Minimize Maximum of Array](/solution/2400-2499/2439.Minimize%20Maximum%20of%20Array/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 89 | +| 2440 | [Create Components With Same Value](/solution/2400-2499/2440.Create%20Components%20With%20Same%20Value/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Math`,`Enumeration` | Hard | Biweekly Contest 89 | +| 2441 | [Largest Positive Integer That Exists With Its Negative](/solution/2400-2499/2441.Largest%20Positive%20Integer%20That%20Exists%20With%20Its%20Negative/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Easy | Weekly Contest 315 | +| 2442 | [Count Number of Distinct Integers After Reverse Operations](/solution/2400-2499/2442.Count%20Number%20of%20Distinct%20Integers%20After%20Reverse%20Operations/README_EN.md) | `Array`,`Hash Table`,`Math` | Medium | Weekly Contest 315 | +| 2443 | [Sum of Number and Its Reverse](/solution/2400-2499/2443.Sum%20of%20Number%20and%20Its%20Reverse/README_EN.md) | `Math`,`Enumeration` | Medium | Weekly Contest 315 | +| 2444 | [Count Subarrays With Fixed Bounds](/solution/2400-2499/2444.Count%20Subarrays%20With%20Fixed%20Bounds/README_EN.md) | `Queue`,`Array`,`Sliding Window`,`Monotonic Queue` | Hard | Weekly Contest 315 | +| 2445 | [Number of Nodes With Value One](/solution/2400-2499/2445.Number%20of%20Nodes%20With%20Value%20One/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | +| 2446 | [Determine if Two Events Have Conflict](/solution/2400-2499/2446.Determine%20if%20Two%20Events%20Have%20Conflict/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 316 | +| 2447 | [Number of Subarrays With GCD Equal to K](/solution/2400-2499/2447.Number%20of%20Subarrays%20With%20GCD%20Equal%20to%20K/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 316 | +| 2448 | [Minimum Cost to Make Array Equal](/solution/2400-2499/2448.Minimum%20Cost%20to%20Make%20Array%20Equal/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Hard | Weekly Contest 316 | +| 2449 | [Minimum Number of Operations to Make Arrays Similar](/solution/2400-2499/2449.Minimum%20Number%20of%20Operations%20to%20Make%20Arrays%20Similar/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | Weekly Contest 316 | +| 2450 | [Number of Distinct Binary Strings After Applying Operations](/solution/2400-2499/2450.Number%20of%20Distinct%20Binary%20Strings%20After%20Applying%20Operations/README_EN.md) | `Math`,`String` | Medium | 🔒 | +| 2451 | [Odd String Difference](/solution/2400-2499/2451.Odd%20String%20Difference/README_EN.md) | `Array`,`Hash Table`,`String` | Easy | Biweekly Contest 90 | +| 2452 | [Words Within Two Edits of Dictionary](/solution/2400-2499/2452.Words%20Within%20Two%20Edits%20of%20Dictionary/README_EN.md) | `Array`,`String` | Medium | Biweekly Contest 90 | +| 2453 | [Destroy Sequential Targets](/solution/2400-2499/2453.Destroy%20Sequential%20Targets/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Biweekly Contest 90 | +| 2454 | [Next Greater Element IV](/solution/2400-2499/2454.Next%20Greater%20Element%20IV/README_EN.md) | `Stack`,`Array`,`Binary Search`,`Sorting`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Biweekly Contest 90 | +| 2455 | [Average Value of Even Numbers That Are Divisible by Three](/solution/2400-2499/2455.Average%20Value%20of%20Even%20Numbers%20That%20Are%20Divisible%20by%20Three/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 317 | +| 2456 | [Most Popular Video Creator](/solution/2400-2499/2456.Most%20Popular%20Video%20Creator/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 317 | +| 2457 | [Minimum Addition to Make Integer Beautiful](/solution/2400-2499/2457.Minimum%20Addition%20to%20Make%20Integer%20Beautiful/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 317 | +| 2458 | [Height of Binary Tree After Subtree Removal Queries](/solution/2400-2499/2458.Height%20of%20Binary%20Tree%20After%20Subtree%20Removal%20Queries/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Array`,`Binary Tree` | Hard | Weekly Contest 317 | +| 2459 | [Sort Array by Moving Items to Empty Space](/solution/2400-2499/2459.Sort%20Array%20by%20Moving%20Items%20to%20Empty%20Space/README_EN.md) | `Greedy`,`Array`,`Sorting` | Hard | 🔒 | +| 2460 | [Apply Operations to an Array](/solution/2400-2499/2460.Apply%20Operations%20to%20an%20Array/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Easy | Weekly Contest 318 | +| 2461 | [Maximum Sum of Distinct Subarrays With Length K](/solution/2400-2499/2461.Maximum%20Sum%20of%20Distinct%20Subarrays%20With%20Length%20K/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 318 | +| 2462 | [Total Cost to Hire K Workers](/solution/2400-2499/2462.Total%20Cost%20to%20Hire%20K%20Workers/README_EN.md) | `Array`,`Two Pointers`,`Simulation`,`Heap (Priority Queue)` | Medium | Weekly Contest 318 | +| 2463 | [Minimum Total Distance Traveled](/solution/2400-2499/2463.Minimum%20Total%20Distance%20Traveled/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Weekly Contest 318 | +| 2464 | [Minimum Subarrays in a Valid Split](/solution/2400-2499/2464.Minimum%20Subarrays%20in%20a%20Valid%20Split/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Number Theory` | Medium | 🔒 | +| 2465 | [Number of Distinct Averages](/solution/2400-2499/2465.Number%20of%20Distinct%20Averages/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Easy | Biweekly Contest 91 | +| 2466 | [Count Ways To Build Good Strings](/solution/2400-2499/2466.Count%20Ways%20To%20Build%20Good%20Strings/README_EN.md) | `Dynamic Programming` | Medium | Biweekly Contest 91 | +| 2467 | [Most Profitable Path in a Tree](/solution/2400-2499/2467.Most%20Profitable%20Path%20in%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph`,`Array` | Medium | Biweekly Contest 91 | +| 2468 | [Split Message Based on Limit](/solution/2400-2499/2468.Split%20Message%20Based%20on%20Limit/README_EN.md) | `String`,`Binary Search` | Hard | Biweekly Contest 91 | +| 2469 | [Convert the Temperature](/solution/2400-2499/2469.Convert%20the%20Temperature/README_EN.md) | `Math` | Easy | Weekly Contest 319 | +| 2470 | [Number of Subarrays With LCM Equal to K](/solution/2400-2499/2470.Number%20of%20Subarrays%20With%20LCM%20Equal%20to%20K/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 319 | +| 2471 | [Minimum Number of Operations to Sort a Binary Tree by Level](/solution/2400-2499/2471.Minimum%20Number%20of%20Operations%20to%20Sort%20a%20Binary%20Tree%20by%20Level/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree` | Medium | Weekly Contest 319 | +| 2472 | [Maximum Number of Non-overlapping Palindrome Substrings](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 319 | +| 2473 | [Minimum Cost to Buy Apples](/solution/2400-2499/2473.Minimum%20Cost%20to%20Buy%20Apples/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 | +| 2474 | [Customers With Strictly Increasing Purchases](/solution/2400-2499/2474.Customers%20With%20Strictly%20Increasing%20Purchases/README_EN.md) | `Database` | Hard | 🔒 | +| 2475 | [Number of Unequal Triplets in Array](/solution/2400-2499/2475.Number%20of%20Unequal%20Triplets%20in%20Array/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Weekly Contest 320 | +| 2476 | [Closest Nodes Queries in a Binary Search Tree](/solution/2400-2499/2476.Closest%20Nodes%20Queries%20in%20a%20Binary%20Search%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Search Tree`,`Array`,`Binary Search`,`Binary Tree` | Medium | Weekly Contest 320 | +| 2477 | [Minimum Fuel Cost to Report to the Capital](/solution/2400-2499/2477.Minimum%20Fuel%20Cost%20to%20Report%20to%20the%20Capital/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 320 | +| 2478 | [Number of Beautiful Partitions](/solution/2400-2499/2478.Number%20of%20Beautiful%20Partitions/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 320 | +| 2479 | [Maximum XOR of Two Non-Overlapping Subtrees](/solution/2400-2499/2479.Maximum%20XOR%20of%20Two%20Non-Overlapping%20Subtrees/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Trie` | Hard | 🔒 | +| 2480 | [Form a Chemical Bond](/solution/2400-2499/2480.Form%20a%20Chemical%20Bond/README_EN.md) | `Database` | Easy | 🔒 | +| 2481 | [Minimum Cuts to Divide a Circle](/solution/2400-2499/2481.Minimum%20Cuts%20to%20Divide%20a%20Circle/README_EN.md) | `Geometry`,`Math` | Easy | Biweekly Contest 92 | +| 2482 | [Difference Between Ones and Zeros in Row and Column](/solution/2400-2499/2482.Difference%20Between%20Ones%20and%20Zeros%20in%20Row%20and%20Column/README_EN.md) | `Array`,`Matrix`,`Simulation` | Medium | Biweekly Contest 92 | +| 2483 | [Minimum Penalty for a Shop](/solution/2400-2499/2483.Minimum%20Penalty%20for%20a%20Shop/README_EN.md) | `String`,`Prefix Sum` | Medium | Biweekly Contest 92 | +| 2484 | [Count Palindromic Subsequences](/solution/2400-2499/2484.Count%20Palindromic%20Subsequences/README_EN.md) | `String`,`Dynamic Programming` | Hard | Biweekly Contest 92 | +| 2485 | [Find the Pivot Integer](/solution/2400-2499/2485.Find%20the%20Pivot%20Integer/README_EN.md) | `Math`,`Prefix Sum` | Easy | Weekly Contest 321 | +| 2486 | [Append Characters to String to Make Subsequence](/solution/2400-2499/2486.Append%20Characters%20to%20String%20to%20Make%20Subsequence/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 321 | +| 2487 | [Remove Nodes From Linked List](/solution/2400-2499/2487.Remove%20Nodes%20From%20Linked%20List/README_EN.md) | `Stack`,`Recursion`,`Linked List`,`Monotonic Stack` | Medium | Weekly Contest 321 | +| 2488 | [Count Subarrays With Median K](/solution/2400-2499/2488.Count%20Subarrays%20With%20Median%20K/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Hard | Weekly Contest 321 | +| 2489 | [Number of Substrings With Fixed Ratio](/solution/2400-2499/2489.Number%20of%20Substrings%20With%20Fixed%20Ratio/README_EN.md) | `Hash Table`,`Math`,`String`,`Prefix Sum` | Medium | 🔒 | +| 2490 | [Circular Sentence](/solution/2400-2499/2490.Circular%20Sentence/README_EN.md) | `String` | Easy | Weekly Contest 322 | +| 2491 | [Divide Players Into Teams of Equal Skill](/solution/2400-2499/2491.Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Sorting` | Medium | Weekly Contest 322 | +| 2492 | [Minimum Score of a Path Between Two Cities](/solution/2400-2499/2492.Minimum%20Score%20of%20a%20Path%20Between%20Two%20Cities/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Graph` | Medium | Weekly Contest 322 | +| 2493 | [Divide Nodes Into the Maximum Number of Groups](/solution/2400-2499/2493.Divide%20Nodes%20Into%20the%20Maximum%20Number%20of%20Groups/README_EN.md) | `Breadth-First Search`,`Union Find`,`Graph` | Hard | Weekly Contest 322 | +| 2494 | [Merge Overlapping Events in the Same Hall](/solution/2400-2499/2494.Merge%20Overlapping%20Events%20in%20the%20Same%20Hall/README_EN.md) | `Database` | Hard | 🔒 | +| 2495 | [Number of Subarrays Having Even Product](/solution/2400-2499/2495.Number%20of%20Subarrays%20Having%20Even%20Product/README_EN.md) | `Array`,`Math`,`Dynamic Programming` | Medium | 🔒 | +| 2496 | [Maximum Value of a String in an Array](/solution/2400-2499/2496.Maximum%20Value%20of%20a%20String%20in%20an%20Array/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 93 | +| 2497 | [Maximum Star Sum of a Graph](/solution/2400-2499/2497.Maximum%20Star%20Sum%20of%20a%20Graph/README_EN.md) | `Greedy`,`Graph`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 93 | +| 2498 | [Frog Jump II](/solution/2400-2499/2498.Frog%20Jump%20II/README_EN.md) | `Greedy`,`Array`,`Binary Search` | Medium | Biweekly Contest 93 | +| 2499 | [Minimum Total Cost to Make Arrays Unequal](/solution/2400-2499/2499.Minimum%20Total%20Cost%20to%20Make%20Arrays%20Unequal/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Hard | Biweekly Contest 93 | +| 2500 | [Delete Greatest Value in Each Row](/solution/2500-2599/2500.Delete%20Greatest%20Value%20in%20Each%20Row/README_EN.md) | `Array`,`Matrix`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 323 | +| 2501 | [Longest Square Streak in an Array](/solution/2500-2599/2501.Longest%20Square%20Streak%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 323 | +| 2502 | [Design Memory Allocator](/solution/2500-2599/2502.Design%20Memory%20Allocator/README_EN.md) | `Design`,`Array`,`Hash Table`,`Simulation` | Medium | Weekly Contest 323 | +| 2503 | [Maximum Number of Points From Grid Queries](/solution/2500-2599/2503.Maximum%20Number%20of%20Points%20From%20Grid%20Queries/README_EN.md) | `Breadth-First Search`,`Union Find`,`Array`,`Two Pointers`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 323 | +| 2504 | [Concatenate the Name and the Profession](/solution/2500-2599/2504.Concatenate%20the%20Name%20and%20the%20Profession/README_EN.md) | `Database` | Easy | 🔒 | +| 2505 | [Bitwise OR of All Subsequence Sums](/solution/2500-2599/2505.Bitwise%20OR%20of%20All%20Subsequence%20Sums/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array`,`Math` | Medium | 🔒 | +| 2506 | [Count Pairs Of Similar Strings](/solution/2500-2599/2506.Count%20Pairs%20Of%20Similar%20Strings/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String` | Easy | Weekly Contest 324 | +| 2507 | [Smallest Value After Replacing With Sum of Prime Factors](/solution/2500-2599/2507.Smallest%20Value%20After%20Replacing%20With%20Sum%20of%20Prime%20Factors/README_EN.md) | `Math`,`Number Theory`,`Simulation` | Medium | Weekly Contest 324 | +| 2508 | [Add Edges to Make Degrees of All Nodes Even](/solution/2500-2599/2508.Add%20Edges%20to%20Make%20Degrees%20of%20All%20Nodes%20Even/README_EN.md) | `Graph`,`Hash Table` | Hard | Weekly Contest 324 | +| 2509 | [Cycle Length Queries in a Tree](/solution/2500-2599/2509.Cycle%20Length%20Queries%20in%20a%20Tree/README_EN.md) | `Tree`,`Array`,`Binary Tree` | Hard | Weekly Contest 324 | +| 2510 | [Check if There is a Path With Equal Number of 0's And 1's](/solution/2500-2599/2510.Check%20if%20There%20is%20a%20Path%20With%20Equal%20Number%20of%200%27s%20And%201%27s/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | 🔒 | +| 2511 | [Maximum Enemy Forts That Can Be Captured](/solution/2500-2599/2511.Maximum%20Enemy%20Forts%20That%20Can%20Be%20Captured/README_EN.md) | `Array`,`Two Pointers` | Easy | Biweekly Contest 94 | +| 2512 | [Reward Top K Students](/solution/2500-2599/2512.Reward%20Top%20K%20Students/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 94 | +| 2513 | [Minimize the Maximum of Two Arrays](/solution/2500-2599/2513.Minimize%20the%20Maximum%20of%20Two%20Arrays/README_EN.md) | `Math`,`Binary Search`,`Number Theory` | Medium | Biweekly Contest 94 | +| 2514 | [Count Anagrams](/solution/2500-2599/2514.Count%20Anagrams/README_EN.md) | `Hash Table`,`Math`,`String`,`Combinatorics`,`Counting` | Hard | Biweekly Contest 94 | +| 2515 | [Shortest Distance to Target String in a Circular Array](/solution/2500-2599/2515.Shortest%20Distance%20to%20Target%20String%20in%20a%20Circular%20Array/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 325 | +| 2516 | [Take K of Each Character From Left and Right](/solution/2500-2599/2516.Take%20K%20of%20Each%20Character%20From%20Left%20and%20Right/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | Weekly Contest 325 | +| 2517 | [Maximum Tastiness of Candy Basket](/solution/2500-2599/2517.Maximum%20Tastiness%20of%20Candy%20Basket/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Sorting` | Medium | Weekly Contest 325 | +| 2518 | [Number of Great Partitions](/solution/2500-2599/2518.Number%20of%20Great%20Partitions/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 325 | +| 2519 | [Count the Number of K-Big Indices](/solution/2500-2599/2519.Count%20the%20Number%20of%20K-Big%20Indices/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Hard | 🔒 | +| 2520 | [Count the Digits That Divide a Number](/solution/2500-2599/2520.Count%20the%20Digits%20That%20Divide%20a%20Number/README_EN.md) | `Math` | Easy | Weekly Contest 326 | +| 2521 | [Distinct Prime Factors of Product of Array](/solution/2500-2599/2521.Distinct%20Prime%20Factors%20of%20Product%20of%20Array/README_EN.md) | `Array`,`Hash Table`,`Math`,`Number Theory` | Medium | Weekly Contest 326 | +| 2522 | [Partition String Into Substrings With Values at Most K](/solution/2500-2599/2522.Partition%20String%20Into%20Substrings%20With%20Values%20at%20Most%20K/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Weekly Contest 326 | +| 2523 | [Closest Prime Numbers in Range](/solution/2500-2599/2523.Closest%20Prime%20Numbers%20in%20Range/README_EN.md) | `Math`,`Number Theory` | Medium | Weekly Contest 326 | +| 2524 | [Maximum Frequency Score of a Subarray](/solution/2500-2599/2524.Maximum%20Frequency%20Score%20of%20a%20Subarray/README_EN.md) | `Array`,`Hash Table`,`Math`,`Sliding Window` | Hard | 🔒 | +| 2525 | [Categorize Box According to Criteria](/solution/2500-2599/2525.Categorize%20Box%20According%20to%20Criteria/README_EN.md) | `Math` | Easy | Biweekly Contest 95 | +| 2526 | [Find Consecutive Integers from a Data Stream](/solution/2500-2599/2526.Find%20Consecutive%20Integers%20from%20a%20Data%20Stream/README_EN.md) | `Design`,`Queue`,`Hash Table`,`Counting`,`Data Stream` | Medium | Biweekly Contest 95 | +| 2527 | [Find Xor-Beauty of Array](/solution/2500-2599/2527.Find%20Xor-Beauty%20of%20Array/README_EN.md) | `Bit Manipulation`,`Array`,`Math` | Medium | Biweekly Contest 95 | +| 2528 | [Maximize the Minimum Powered City](/solution/2500-2599/2528.Maximize%20the%20Minimum%20Powered%20City/README_EN.md) | `Greedy`,`Queue`,`Array`,`Binary Search`,`Prefix Sum`,`Sliding Window` | Hard | Biweekly Contest 95 | +| 2529 | [Maximum Count of Positive Integer and Negative Integer](/solution/2500-2599/2529.Maximum%20Count%20of%20Positive%20Integer%20and%20Negative%20Integer/README_EN.md) | `Array`,`Binary Search`,`Counting` | Easy | Weekly Contest 327 | +| 2530 | [Maximal Score After Applying K Operations](/solution/2500-2599/2530.Maximal%20Score%20After%20Applying%20K%20Operations/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | Weekly Contest 327 | +| 2531 | [Make Number of Distinct Characters Equal](/solution/2500-2599/2531.Make%20Number%20of%20Distinct%20Characters%20Equal/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 327 | +| 2532 | [Time to Cross a Bridge](/solution/2500-2599/2532.Time%20to%20Cross%20a%20Bridge/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Hard | Weekly Contest 327 | +| 2533 | [Number of Good Binary Strings](/solution/2500-2599/2533.Number%20of%20Good%20Binary%20Strings/README_EN.md) | `Dynamic Programming` | Medium | 🔒 | +| 2534 | [Time Taken to Cross the Door](/solution/2500-2599/2534.Time%20Taken%20to%20Cross%20the%20Door/README_EN.md) | `Queue`,`Array`,`Simulation` | Hard | 🔒 | +| 2535 | [Difference Between Element Sum and Digit Sum of an Array](/solution/2500-2599/2535.Difference%20Between%20Element%20Sum%20and%20Digit%20Sum%20of%20an%20Array/README_EN.md) | `Array`,`Math` | Easy | Weekly Contest 328 | +| 2536 | [Increment Submatrices by One](/solution/2500-2599/2536.Increment%20Submatrices%20by%20One/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 328 | +| 2537 | [Count the Number of Good Subarrays](/solution/2500-2599/2537.Count%20the%20Number%20of%20Good%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 328 | +| 2538 | [Difference Between Maximum and Minimum Price Sum](/solution/2500-2599/2538.Difference%20Between%20Maximum%20and%20Minimum%20Price%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 328 | +| 2539 | [Count the Number of Good Subsequences](/solution/2500-2599/2539.Count%20the%20Number%20of%20Good%20Subsequences/README_EN.md) | `Hash Table`,`Math`,`String`,`Combinatorics`,`Counting` | Medium | 🔒 | +| 2540 | [Minimum Common Value](/solution/2500-2599/2540.Minimum%20Common%20Value/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search` | Easy | Biweekly Contest 96 | +| 2541 | [Minimum Operations to Make Array Equal II](/solution/2500-2599/2541.Minimum%20Operations%20to%20Make%20Array%20Equal%20II/README_EN.md) | `Greedy`,`Array`,`Math` | Medium | Biweekly Contest 96 | +| 2542 | [Maximum Subsequence Score](/solution/2500-2599/2542.Maximum%20Subsequence%20Score/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 96 | +| 2543 | [Check if Point Is Reachable](/solution/2500-2599/2543.Check%20if%20Point%20Is%20Reachable/README_EN.md) | `Math`,`Number Theory` | Hard | Biweekly Contest 96 | +| 2544 | [Alternating Digit Sum](/solution/2500-2599/2544.Alternating%20Digit%20Sum/README_EN.md) | `Math` | Easy | Weekly Contest 329 | +| 2545 | [Sort the Students by Their Kth Score](/solution/2500-2599/2545.Sort%20the%20Students%20by%20Their%20Kth%20Score/README_EN.md) | `Array`,`Matrix`,`Sorting` | Medium | Weekly Contest 329 | +| 2546 | [Apply Bitwise Operations to Make Strings Equal](/solution/2500-2599/2546.Apply%20Bitwise%20Operations%20to%20Make%20Strings%20Equal/README_EN.md) | `Bit Manipulation`,`String` | Medium | Weekly Contest 329 | +| 2547 | [Minimum Cost to Split an Array](/solution/2500-2599/2547.Minimum%20Cost%20to%20Split%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming`,`Counting` | Hard | Weekly Contest 329 | +| 2548 | [Maximum Price to Fill a Bag](/solution/2500-2599/2548.Maximum%20Price%20to%20Fill%20a%20Bag/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | 🔒 | +| 2549 | [Count Distinct Numbers on Board](/solution/2500-2599/2549.Count%20Distinct%20Numbers%20on%20Board/README_EN.md) | `Array`,`Hash Table`,`Math`,`Simulation` | Easy | Weekly Contest 330 | +| 2550 | [Count Collisions of Monkeys on a Polygon](/solution/2500-2599/2550.Count%20Collisions%20of%20Monkeys%20on%20a%20Polygon/README_EN.md) | `Recursion`,`Math` | Medium | Weekly Contest 330 | +| 2551 | [Put Marbles in Bags](/solution/2500-2599/2551.Put%20Marbles%20in%20Bags/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 330 | +| 2552 | [Count Increasing Quadruplets](/solution/2500-2599/2552.Count%20Increasing%20Quadruplets/README_EN.md) | `Binary Indexed Tree`,`Array`,`Dynamic Programming`,`Enumeration`,`Prefix Sum` | Hard | Weekly Contest 330 | +| 2553 | [Separate the Digits in an Array](/solution/2500-2599/2553.Separate%20the%20Digits%20in%20an%20Array/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 97 | +| 2554 | [Maximum Number of Integers to Choose From a Range I](/solution/2500-2599/2554.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20I/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 97 | +| 2555 | [Maximize Win From Two Segments](/solution/2500-2599/2555.Maximize%20Win%20From%20Two%20Segments/README_EN.md) | `Array`,`Binary Search`,`Sliding Window` | Medium | Biweekly Contest 97 | +| 2556 | [Disconnect Path in a Binary Matrix by at Most One Flip](/solution/2500-2599/2556.Disconnect%20Path%20in%20a%20Binary%20Matrix%20by%20at%20Most%20One%20Flip/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix` | Medium | Biweekly Contest 97 | +| 2557 | [Maximum Number of Integers to Choose From a Range II](/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Sorting` | Medium | 🔒 | +| 2558 | [Take Gifts From the Richest Pile](/solution/2500-2599/2558.Take%20Gifts%20From%20the%20Richest%20Pile/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 331 | +| 2559 | [Count Vowel Strings in Ranges](/solution/2500-2599/2559.Count%20Vowel%20Strings%20in%20Ranges/README_EN.md) | `Array`,`String`,`Prefix Sum` | Medium | Weekly Contest 331 | +| 2560 | [House Robber IV](/solution/2500-2599/2560.House%20Robber%20IV/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 331 | +| 2561 | [Rearranging Fruits](/solution/2500-2599/2561.Rearranging%20Fruits/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Hard | Weekly Contest 331 | +| 2562 | [Find the Array Concatenation Value](/solution/2500-2599/2562.Find%20the%20Array%20Concatenation%20Value/README_EN.md) | `Array`,`Two Pointers`,`Simulation` | Easy | Weekly Contest 332 | +| 2563 | [Count the Number of Fair Pairs](/solution/2500-2599/2563.Count%20the%20Number%20of%20Fair%20Pairs/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Weekly Contest 332 | +| 2564 | [Substring XOR Queries](/solution/2500-2599/2564.Substring%20XOR%20Queries/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 332 | +| 2565 | [Subsequence With the Minimum Score](/solution/2500-2599/2565.Subsequence%20With%20the%20Minimum%20Score/README_EN.md) | `Two Pointers`,`String`,`Binary Search` | Hard | Weekly Contest 332 | +| 2566 | [Maximum Difference by Remapping a Digit](/solution/2500-2599/2566.Maximum%20Difference%20by%20Remapping%20a%20Digit/README_EN.md) | `Greedy`,`Math` | Easy | Biweekly Contest 98 | +| 2567 | [Minimum Score by Changing Two Elements](/solution/2500-2599/2567.Minimum%20Score%20by%20Changing%20Two%20Elements/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 98 | +| 2568 | [Minimum Impossible OR](/solution/2500-2599/2568.Minimum%20Impossible%20OR/README_EN.md) | `Bit Manipulation`,`Brainteaser`,`Array` | Medium | Biweekly Contest 98 | +| 2569 | [Handling Sum Queries After Update](/solution/2500-2599/2569.Handling%20Sum%20Queries%20After%20Update/README_EN.md) | `Segment Tree`,`Array` | Hard | Biweekly Contest 98 | +| 2570 | [Merge Two 2D Arrays by Summing Values](/solution/2500-2599/2570.Merge%20Two%202D%20Arrays%20by%20Summing%20Values/README_EN.md) | `Array`,`Hash Table`,`Two Pointers` | Easy | Weekly Contest 333 | +| 2571 | [Minimum Operations to Reduce an Integer to 0](/solution/2500-2599/2571.Minimum%20Operations%20to%20Reduce%20an%20Integer%20to%200/README_EN.md) | `Greedy`,`Bit Manipulation`,`Dynamic Programming` | Medium | Weekly Contest 333 | +| 2572 | [Count the Number of Square-Free Subsets](/solution/2500-2599/2572.Count%20the%20Number%20of%20Square-Free%20Subsets/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Dynamic Programming`,`Bitmask` | Medium | Weekly Contest 333 | +| 2573 | [Find the String with LCP](/solution/2500-2599/2573.Find%20the%20String%20with%20LCP/README_EN.md) | `Greedy`,`Union Find`,`Array`,`String`,`Dynamic Programming`,`Matrix` | Hard | Weekly Contest 333 | +| 2574 | [Left and Right Sum Differences](/solution/2500-2599/2574.Left%20and%20Right%20Sum%20Differences/README_EN.md) | `Array`,`Prefix Sum` | Easy | Weekly Contest 334 | +| 2575 | [Find the Divisibility Array of a String](/solution/2500-2599/2575.Find%20the%20Divisibility%20Array%20of%20a%20String/README_EN.md) | `Array`,`Math`,`String` | Medium | Weekly Contest 334 | +| 2576 | [Find the Maximum Number of Marked Indices](/solution/2500-2599/2576.Find%20the%20Maximum%20Number%20of%20Marked%20Indices/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Binary Search`,`Sorting` | Medium | Weekly Contest 334 | +| 2577 | [Minimum Time to Visit a Cell In a Grid](/solution/2500-2599/2577.Minimum%20Time%20to%20Visit%20a%20Cell%20In%20a%20Grid/README_EN.md) | `Breadth-First Search`,`Graph`,`Array`,`Matrix`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 334 | +| 2578 | [Split With Minimum Sum](/solution/2500-2599/2578.Split%20With%20Minimum%20Sum/README_EN.md) | `Greedy`,`Math`,`Sorting` | Easy | Biweekly Contest 99 | +| 2579 | [Count Total Number of Colored Cells](/solution/2500-2599/2579.Count%20Total%20Number%20of%20Colored%20Cells/README_EN.md) | `Math` | Medium | Biweekly Contest 99 | +| 2580 | [Count Ways to Group Overlapping Ranges](/solution/2500-2599/2580.Count%20Ways%20to%20Group%20Overlapping%20Ranges/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 99 | +| 2581 | [Count Number of Possible Root Nodes](/solution/2500-2599/2581.Count%20Number%20of%20Possible%20Root%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Hash Table`,`Dynamic Programming` | Hard | Biweekly Contest 99 | +| 2582 | [Pass the Pillow](/solution/2500-2599/2582.Pass%20the%20Pillow/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 335 | +| 2583 | [Kth Largest Sum in a Binary Tree](/solution/2500-2599/2583.Kth%20Largest%20Sum%20in%20a%20Binary%20Tree/README_EN.md) | `Tree`,`Breadth-First Search`,`Binary Tree`,`Sorting` | Medium | Weekly Contest 335 | +| 2584 | [Split the Array to Make Coprime Products](/solution/2500-2599/2584.Split%20the%20Array%20to%20Make%20Coprime%20Products/README_EN.md) | `Array`,`Hash Table`,`Math`,`Number Theory` | Hard | Weekly Contest 335 | +| 2585 | [Number of Ways to Earn Points](/solution/2500-2599/2585.Number%20of%20Ways%20to%20Earn%20Points/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 335 | +| 2586 | [Count the Number of Vowel Strings in Range](/solution/2500-2599/2586.Count%20the%20Number%20of%20Vowel%20Strings%20in%20Range/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 336 | +| 2587 | [Rearrange Array to Maximize Prefix Score](/solution/2500-2599/2587.Rearrange%20Array%20to%20Maximize%20Prefix%20Score/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sorting` | Medium | Weekly Contest 336 | +| 2588 | [Count the Number of Beautiful Subarrays](/solution/2500-2599/2588.Count%20the%20Number%20of%20Beautiful%20Subarrays/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 336 | +| 2589 | [Minimum Time to Complete All Tasks](/solution/2500-2599/2589.Minimum%20Time%20to%20Complete%20All%20Tasks/README_EN.md) | `Stack`,`Greedy`,`Array`,`Binary Search`,`Sorting` | Hard | Weekly Contest 336 | +| 2590 | [Design a Todo List](/solution/2500-2599/2590.Design%20a%20Todo%20List/README_EN.md) | `Design`,`Array`,`Hash Table`,`String`,`Sorting` | Medium | 🔒 | +| 2591 | [Distribute Money to Maximum Children](/solution/2500-2599/2591.Distribute%20Money%20to%20Maximum%20Children/README_EN.md) | `Greedy`,`Math` | Easy | Biweekly Contest 100 | +| 2592 | [Maximize Greatness of an Array](/solution/2500-2599/2592.Maximize%20Greatness%20of%20an%20Array/README_EN.md) | `Greedy`,`Array`,`Two Pointers`,`Sorting` | Medium | Biweekly Contest 100 | +| 2593 | [Find Score of an Array After Marking All Elements](/solution/2500-2599/2593.Find%20Score%20of%20an%20Array%20After%20Marking%20All%20Elements/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 100 | +| 2594 | [Minimum Time to Repair Cars](/solution/2500-2599/2594.Minimum%20Time%20to%20Repair%20Cars/README_EN.md) | `Array`,`Binary Search` | Medium | Biweekly Contest 100 | +| 2595 | [Number of Even and Odd Bits](/solution/2500-2599/2595.Number%20of%20Even%20and%20Odd%20Bits/README_EN.md) | `Bit Manipulation` | Easy | Weekly Contest 337 | +| 2596 | [Check Knight Tour Configuration](/solution/2500-2599/2596.Check%20Knight%20Tour%20Configuration/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Array`,`Matrix`,`Simulation` | Medium | Weekly Contest 337 | +| 2597 | [The Number of Beautiful Subsets](/solution/2500-2599/2597.The%20Number%20of%20Beautiful%20Subsets/README_EN.md) | `Array`,`Dynamic Programming`,`Backtracking`,`Sorting` | Medium | Weekly Contest 337 | +| 2598 | [Smallest Missing Non-negative Integer After Operations](/solution/2500-2599/2598.Smallest%20Missing%20Non-negative%20Integer%20After%20Operations/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Math` | Medium | Weekly Contest 337 | +| 2599 | [Make the Prefix Sum Non-negative](/solution/2500-2599/2599.Make%20the%20Prefix%20Sum%20Non-negative/README_EN.md) | `Greedy`,`Array`,`Heap (Priority Queue)` | Medium | 🔒 | +| 2600 | [K Items With the Maximum Sum](/solution/2600-2699/2600.K%20Items%20With%20the%20Maximum%20Sum/README_EN.md) | `Greedy`,`Math` | Easy | Weekly Contest 338 | +| 2601 | [Prime Subtraction Operation](/solution/2600-2699/2601.Prime%20Subtraction%20Operation/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search`,`Number Theory` | Medium | Weekly Contest 338 | +| 2602 | [Minimum Operations to Make All Array Elements Equal](/solution/2600-2699/2602.Minimum%20Operations%20to%20Make%20All%20Array%20Elements%20Equal/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Medium | Weekly Contest 338 | +| 2603 | [Collect Coins in a Tree](/solution/2600-2699/2603.Collect%20Coins%20in%20a%20Tree/README_EN.md) | `Tree`,`Graph`,`Topological Sort`,`Array` | Hard | Weekly Contest 338 | +| 2604 | [Minimum Time to Eat All Grains](/solution/2600-2699/2604.Minimum%20Time%20to%20Eat%20All%20Grains/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Hard | 🔒 | +| 2605 | [Form Smallest Number From Two Digit Arrays](/solution/2600-2699/2605.Form%20Smallest%20Number%20From%20Two%20Digit%20Arrays/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Easy | Biweekly Contest 101 | +| 2606 | [Find the Substring With Maximum Cost](/solution/2600-2699/2606.Find%20the%20Substring%20With%20Maximum%20Cost/README_EN.md) | `Array`,`Hash Table`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 101 | +| 2607 | [Make K-Subarray Sums Equal](/solution/2600-2699/2607.Make%20K-Subarray%20Sums%20Equal/README_EN.md) | `Array`,`Math`,`Number Theory`,`Sorting` | Medium | Biweekly Contest 101 | +| 2608 | [Shortest Cycle in a Graph](/solution/2600-2699/2608.Shortest%20Cycle%20in%20a%20Graph/README_EN.md) | `Breadth-First Search`,`Graph` | Hard | Biweekly Contest 101 | +| 2609 | [Find the Longest Balanced Substring of a Binary String](/solution/2600-2699/2609.Find%20the%20Longest%20Balanced%20Substring%20of%20a%20Binary%20String/README_EN.md) | `String` | Easy | Weekly Contest 339 | +| 2610 | [Convert an Array Into a 2D Array With Conditions](/solution/2600-2699/2610.Convert%20an%20Array%20Into%20a%202D%20Array%20With%20Conditions/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 339 | +| 2611 | [Mice and Cheese](/solution/2600-2699/2611.Mice%20and%20Cheese/README_EN.md) | `Greedy`,`Array`,`Sorting`,`Heap (Priority Queue)` | Medium | Weekly Contest 339 | +| 2612 | [Minimum Reverse Operations](/solution/2600-2699/2612.Minimum%20Reverse%20Operations/README_EN.md) | `Breadth-First Search`,`Array`,`Ordered Set` | Hard | Weekly Contest 339 | +| 2613 | [Beautiful Pairs](/solution/2600-2699/2613.Beautiful%20Pairs/README_EN.md) | `Geometry`,`Array`,`Math`,`Divide and Conquer`,`Ordered Set`,`Sorting` | Hard | 🔒 | +| 2614 | [Prime In Diagonal](/solution/2600-2699/2614.Prime%20In%20Diagonal/README_EN.md) | `Array`,`Math`,`Matrix`,`Number Theory` | Easy | Weekly Contest 340 | +| 2615 | [Sum of Distances](/solution/2600-2699/2615.Sum%20of%20Distances/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 340 | +| 2616 | [Minimize the Maximum Difference of Pairs](/solution/2600-2699/2616.Minimize%20the%20Maximum%20Difference%20of%20Pairs/README_EN.md) | `Greedy`,`Array`,`Binary Search` | Medium | Weekly Contest 340 | +| 2617 | [Minimum Number of Visited Cells in a Grid](/solution/2600-2699/2617.Minimum%20Number%20of%20Visited%20Cells%20in%20a%20Grid/README_EN.md) | `Stack`,`Breadth-First Search`,`Union Find`,`Array`,`Dynamic Programming`,`Matrix`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Weekly Contest 340 | +| 2618 | [Check if Object Instance of Class](/solution/2600-2699/2618.Check%20if%20Object%20Instance%20of%20Class/README_EN.md) | | Medium | | +| 2619 | [Array Prototype Last](/solution/2600-2699/2619.Array%20Prototype%20Last/README_EN.md) | | Easy | | +| 2620 | [Counter](/solution/2600-2699/2620.Counter/README_EN.md) | | Easy | | +| 2621 | [Sleep](/solution/2600-2699/2621.Sleep/README_EN.md) | | Easy | | +| 2622 | [Cache With Time Limit](/solution/2600-2699/2622.Cache%20With%20Time%20Limit/README_EN.md) | | Medium | | +| 2623 | [Memoize](/solution/2600-2699/2623.Memoize/README_EN.md) | | Medium | | +| 2624 | [Snail Traversal](/solution/2600-2699/2624.Snail%20Traversal/README_EN.md) | | Medium | | +| 2625 | [Flatten Deeply Nested Array](/solution/2600-2699/2625.Flatten%20Deeply%20Nested%20Array/README_EN.md) | | Medium | | +| 2626 | [Array Reduce Transformation](/solution/2600-2699/2626.Array%20Reduce%20Transformation/README_EN.md) | | Easy | | +| 2627 | [Debounce](/solution/2600-2699/2627.Debounce/README_EN.md) | | Medium | | +| 2628 | [JSON Deep Equal](/solution/2600-2699/2628.JSON%20Deep%20Equal/README_EN.md) | | Medium | 🔒 | +| 2629 | [Function Composition](/solution/2600-2699/2629.Function%20Composition/README_EN.md) | | Easy | | +| 2630 | [Memoize II](/solution/2600-2699/2630.Memoize%20II/README_EN.md) | | Hard | | +| 2631 | [Group By](/solution/2600-2699/2631.Group%20By/README_EN.md) | | Medium | | +| 2632 | [Curry](/solution/2600-2699/2632.Curry/README_EN.md) | | Medium | 🔒 | +| 2633 | [Convert Object to JSON String](/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README_EN.md) | | Medium | 🔒 | +| 2634 | [Filter Elements from Array](/solution/2600-2699/2634.Filter%20Elements%20from%20Array/README_EN.md) | | Easy | | +| 2635 | [Apply Transform Over Each Element in Array](/solution/2600-2699/2635.Apply%20Transform%20Over%20Each%20Element%20in%20Array/README_EN.md) | | Easy | | +| 2636 | [Promise Pool](/solution/2600-2699/2636.Promise%20Pool/README_EN.md) | | Medium | 🔒 | +| 2637 | [Promise Time Limit](/solution/2600-2699/2637.Promise%20Time%20Limit/README_EN.md) | | Medium | | +| 2638 | [Count the Number of K-Free Subsets](/solution/2600-2699/2638.Count%20the%20Number%20of%20K-Free%20Subsets/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Medium | 🔒 | +| 2639 | [Find the Width of Columns of a Grid](/solution/2600-2699/2639.Find%20the%20Width%20of%20Columns%20of%20a%20Grid/README_EN.md) | `Array`,`Matrix` | Easy | Biweekly Contest 102 | +| 2640 | [Find the Score of All Prefixes of an Array](/solution/2600-2699/2640.Find%20the%20Score%20of%20All%20Prefixes%20of%20an%20Array/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 102 | +| 2641 | [Cousins in Binary Tree II](/solution/2600-2699/2641.Cousins%20in%20Binary%20Tree%20II/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Hash Table`,`Binary Tree` | Medium | Biweekly Contest 102 | +| 2642 | [Design Graph With Shortest Path Calculator](/solution/2600-2699/2642.Design%20Graph%20With%20Shortest%20Path%20Calculator/README_EN.md) | `Graph`,`Design`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Biweekly Contest 102 | +| 2643 | [Row With Maximum Ones](/solution/2600-2699/2643.Row%20With%20Maximum%20Ones/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 341 | +| 2644 | [Find the Maximum Divisibility Score](/solution/2600-2699/2644.Find%20the%20Maximum%20Divisibility%20Score/README_EN.md) | `Array` | Easy | Weekly Contest 341 | +| 2645 | [Minimum Additions to Make Valid String](/solution/2600-2699/2645.Minimum%20Additions%20to%20Make%20Valid%20String/README_EN.md) | `Stack`,`Greedy`,`String`,`Dynamic Programming` | Medium | Weekly Contest 341 | +| 2646 | [Minimize the Total Price of the Trips](/solution/2600-2699/2646.Minimize%20the%20Total%20Price%20of%20the%20Trips/README_EN.md) | `Tree`,`Depth-First Search`,`Graph`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 341 | +| 2647 | [Color the Triangle Red](/solution/2600-2699/2647.Color%20the%20Triangle%20Red/README_EN.md) | `Array`,`Math` | Hard | 🔒 | +| 2648 | [Generate Fibonacci Sequence](/solution/2600-2699/2648.Generate%20Fibonacci%20Sequence/README_EN.md) | | Easy | | +| 2649 | [Nested Array Generator](/solution/2600-2699/2649.Nested%20Array%20Generator/README_EN.md) | | Medium | | +| 2650 | [Design Cancellable Function](/solution/2600-2699/2650.Design%20Cancellable%20Function/README_EN.md) | | Hard | | +| 2651 | [Calculate Delayed Arrival Time](/solution/2600-2699/2651.Calculate%20Delayed%20Arrival%20Time/README_EN.md) | `Math` | Easy | Weekly Contest 342 | +| 2652 | [Sum Multiples](/solution/2600-2699/2652.Sum%20Multiples/README_EN.md) | `Math` | Easy | Weekly Contest 342 | +| 2653 | [Sliding Subarray Beauty](/solution/2600-2699/2653.Sliding%20Subarray%20Beauty/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 342 | +| 2654 | [Minimum Number of Operations to Make All Array Elements Equal to 1](/solution/2600-2699/2654.Minimum%20Number%20of%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%201/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 342 | +| 2655 | [Find Maximal Uncovered Ranges](/solution/2600-2699/2655.Find%20Maximal%20Uncovered%20Ranges/README_EN.md) | `Array`,`Sorting` | Medium | 🔒 | +| 2656 | [Maximum Sum With Exactly K Elements](/solution/2600-2699/2656.Maximum%20Sum%20With%20Exactly%20K%20Elements/README_EN.md) | `Greedy`,`Array` | Easy | Biweekly Contest 103 | +| 2657 | [Find the Prefix Common Array of Two Arrays](/solution/2600-2699/2657.Find%20the%20Prefix%20Common%20Array%20of%20Two%20Arrays/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Medium | Biweekly Contest 103 | +| 2658 | [Maximum Number of Fish in a Grid](/solution/2600-2699/2658.Maximum%20Number%20of%20Fish%20in%20a%20Grid/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Matrix` | Medium | Biweekly Contest 103 | +| 2659 | [Make Array Empty](/solution/2600-2699/2659.Make%20Array%20Empty/README_EN.md) | `Greedy`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Ordered Set`,`Sorting` | Hard | Biweekly Contest 103 | +| 2660 | [Determine the Winner of a Bowling Game](/solution/2600-2699/2660.Determine%20the%20Winner%20of%20a%20Bowling%20Game/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 343 | +| 2661 | [First Completely Painted Row or Column](/solution/2600-2699/2661.First%20Completely%20Painted%20Row%20or%20Column/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 343 | +| 2662 | [Minimum Cost of a Path With Special Roads](/solution/2600-2699/2662.Minimum%20Cost%20of%20a%20Path%20With%20Special%20Roads/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Weekly Contest 343 | +| 2663 | [Lexicographically Smallest Beautiful String](/solution/2600-2699/2663.Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) | `Greedy`,`String` | Hard | Weekly Contest 343 | +| 2664 | [The Knight’s Tour](/solution/2600-2699/2664.The%20Knight%E2%80%99s%20Tour/README_EN.md) | `Array`,`Backtracking`,`Matrix` | Medium | 🔒 | +| 2665 | [Counter II](/solution/2600-2699/2665.Counter%20II/README_EN.md) | | Easy | | +| 2666 | [Allow One Function Call](/solution/2600-2699/2666.Allow%20One%20Function%20Call/README_EN.md) | | Easy | | +| 2667 | [Create Hello World Function](/solution/2600-2699/2667.Create%20Hello%20World%20Function/README_EN.md) | | Easy | | +| 2668 | [Find Latest Salaries](/solution/2600-2699/2668.Find%20Latest%20Salaries/README_EN.md) | `Database` | Easy | 🔒 | +| 2669 | [Count Artist Occurrences On Spotify Ranking List](/solution/2600-2699/2669.Count%20Artist%20Occurrences%20On%20Spotify%20Ranking%20List/README_EN.md) | `Database` | Easy | 🔒 | +| 2670 | [Find the Distinct Difference Array](/solution/2600-2699/2670.Find%20the%20Distinct%20Difference%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 344 | +| 2671 | [Frequency Tracker](/solution/2600-2699/2671.Frequency%20Tracker/README_EN.md) | `Design`,`Hash Table` | Medium | Weekly Contest 344 | +| 2672 | [Number of Adjacent Elements With the Same Color](/solution/2600-2699/2672.Number%20of%20Adjacent%20Elements%20With%20the%20Same%20Color/README_EN.md) | `Array` | Medium | Weekly Contest 344 | +| 2673 | [Make Costs of Paths Equal in a Binary Tree](/solution/2600-2699/2673.Make%20Costs%20of%20Paths%20Equal%20in%20a%20Binary%20Tree/README_EN.md) | `Greedy`,`Tree`,`Array`,`Dynamic Programming`,`Binary Tree` | Medium | Weekly Contest 344 | +| 2674 | [Split a Circular Linked List](/solution/2600-2699/2674.Split%20a%20Circular%20Linked%20List/README_EN.md) | `Linked List`,`Two Pointers` | Medium | 🔒 | +| 2675 | [Array of Objects to Matrix](/solution/2600-2699/2675.Array%20of%20Objects%20to%20Matrix/README_EN.md) | | Hard | 🔒 | +| 2676 | [Throttle](/solution/2600-2699/2676.Throttle/README_EN.md) | | Medium | 🔒 | +| 2677 | [Chunk Array](/solution/2600-2699/2677.Chunk%20Array/README_EN.md) | | Easy | | +| 2678 | [Number of Senior Citizens](/solution/2600-2699/2678.Number%20of%20Senior%20Citizens/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 104 | +| 2679 | [Sum in a Matrix](/solution/2600-2699/2679.Sum%20in%20a%20Matrix/README_EN.md) | `Array`,`Matrix`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 104 | +| 2680 | [Maximum OR](/solution/2600-2699/2680.Maximum%20OR/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Prefix Sum` | Medium | Biweekly Contest 104 | +| 2681 | [Power of Heroes](/solution/2600-2699/2681.Power%20of%20Heroes/README_EN.md) | `Array`,`Math`,`Dynamic Programming`,`Prefix Sum`,`Sorting` | Hard | Biweekly Contest 104 | +| 2682 | [Find the Losers of the Circular Game](/solution/2600-2699/2682.Find%20the%20Losers%20of%20the%20Circular%20Game/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Easy | Weekly Contest 345 | +| 2683 | [Neighboring Bitwise XOR](/solution/2600-2699/2683.Neighboring%20Bitwise%20XOR/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Weekly Contest 345 | +| 2684 | [Maximum Number of Moves in a Grid](/solution/2600-2699/2684.Maximum%20Number%20of%20Moves%20in%20a%20Grid/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 345 | +| 2685 | [Count the Number of Complete Components](/solution/2600-2699/2685.Count%20the%20Number%20of%20Complete%20Components/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph` | Medium | Weekly Contest 345 | +| 2686 | [Immediate Food Delivery III](/solution/2600-2699/2686.Immediate%20Food%20Delivery%20III/README_EN.md) | `Database` | Medium | 🔒 | +| 2687 | [Bikes Last Time Used](/solution/2600-2699/2687.Bikes%20Last%20Time%20Used/README_EN.md) | `Database` | Easy | 🔒 | +| 2688 | [Find Active Users](/solution/2600-2699/2688.Find%20Active%20Users/README_EN.md) | `Database` | Medium | 🔒 | +| 2689 | [Extract Kth Character From The Rope Tree](/solution/2600-2699/2689.Extract%20Kth%20Character%20From%20The%20Rope%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Binary Tree` | Easy | 🔒 | +| 2690 | [Infinite Method Object](/solution/2600-2699/2690.Infinite%20Method%20Object/README_EN.md) | | Easy | 🔒 | +| 2691 | [Immutability Helper](/solution/2600-2699/2691.Immutability%20Helper/README_EN.md) | | Hard | 🔒 | +| 2692 | [Make Object Immutable](/solution/2600-2699/2692.Make%20Object%20Immutable/README_EN.md) | | Medium | 🔒 | +| 2693 | [Call Function with Custom Context](/solution/2600-2699/2693.Call%20Function%20with%20Custom%20Context/README_EN.md) | | Medium | | +| 2694 | [Event Emitter](/solution/2600-2699/2694.Event%20Emitter/README_EN.md) | | Medium | | +| 2695 | [Array Wrapper](/solution/2600-2699/2695.Array%20Wrapper/README_EN.md) | | Easy | | +| 2696 | [Minimum String Length After Removing Substrings](/solution/2600-2699/2696.Minimum%20String%20Length%20After%20Removing%20Substrings/README_EN.md) | `Stack`,`String`,`Simulation` | Easy | Weekly Contest 346 | +| 2697 | [Lexicographically Smallest Palindrome](/solution/2600-2699/2697.Lexicographically%20Smallest%20Palindrome/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Easy | Weekly Contest 346 | +| 2698 | [Find the Punishment Number of an Integer](/solution/2600-2699/2698.Find%20the%20Punishment%20Number%20of%20an%20Integer/README_EN.md) | `Math`,`Backtracking` | Medium | Weekly Contest 346 | +| 2699 | [Modify Graph Edge Weights](/solution/2600-2699/2699.Modify%20Graph%20Edge%20Weights/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 346 | +| 2700 | [Differences Between Two Objects](/solution/2700-2799/2700.Differences%20Between%20Two%20Objects/README_EN.md) | | Medium | 🔒 | +| 2701 | [Consecutive Transactions with Increasing Amounts](/solution/2700-2799/2701.Consecutive%20Transactions%20with%20Increasing%20Amounts/README_EN.md) | `Database` | Hard | 🔒 | +| 2702 | [Minimum Operations to Make Numbers Non-positive](/solution/2700-2799/2702.Minimum%20Operations%20to%20Make%20Numbers%20Non-positive/README_EN.md) | `Array`,`Binary Search` | Hard | 🔒 | +| 2703 | [Return Length of Arguments Passed](/solution/2700-2799/2703.Return%20Length%20of%20Arguments%20Passed/README_EN.md) | | Easy | | +| 2704 | [To Be Or Not To Be](/solution/2700-2799/2704.To%20Be%20Or%20Not%20To%20Be/README_EN.md) | | Easy | | +| 2705 | [Compact Object](/solution/2700-2799/2705.Compact%20Object/README_EN.md) | | Medium | | +| 2706 | [Buy Two Chocolates](/solution/2700-2799/2706.Buy%20Two%20Chocolates/README_EN.md) | `Array`,`Sorting` | Easy | Biweekly Contest 105 | +| 2707 | [Extra Characters in a String](/solution/2700-2799/2707.Extra%20Characters%20in%20a%20String/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 105 | +| 2708 | [Maximum Strength of a Group](/solution/2700-2799/2708.Maximum%20Strength%20of%20a%20Group/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Dynamic Programming`,`Backtracking`,`Enumeration`,`Sorting` | Medium | Biweekly Contest 105 | +| 2709 | [Greatest Common Divisor Traversal](/solution/2700-2799/2709.Greatest%20Common%20Divisor%20Traversal/README_EN.md) | `Union Find`,`Array`,`Math`,`Number Theory` | Hard | Biweekly Contest 105 | +| 2710 | [Remove Trailing Zeros From a String](/solution/2700-2799/2710.Remove%20Trailing%20Zeros%20From%20a%20String/README_EN.md) | `String` | Easy | Weekly Contest 347 | +| 2711 | [Difference of Number of Distinct Values on Diagonals](/solution/2700-2799/2711.Difference%20of%20Number%20of%20Distinct%20Values%20on%20Diagonals/README_EN.md) | `Array`,`Hash Table`,`Matrix` | Medium | Weekly Contest 347 | +| 2712 | [Minimum Cost to Make All Characters Equal](/solution/2700-2799/2712.Minimum%20Cost%20to%20Make%20All%20Characters%20Equal/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Weekly Contest 347 | +| 2713 | [Maximum Strictly Increasing Cells in a Matrix](/solution/2700-2799/2713.Maximum%20Strictly%20Increasing%20Cells%20in%20a%20Matrix/README_EN.md) | `Memoization`,`Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Matrix`,`Ordered Set`,`Sorting` | Hard | Weekly Contest 347 | +| 2714 | [Find Shortest Path with K Hops](/solution/2700-2799/2714.Find%20Shortest%20Path%20with%20K%20Hops/README_EN.md) | `Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | 🔒 | +| 2715 | [Timeout Cancellation](/solution/2700-2799/2715.Timeout%20Cancellation/README_EN.md) | | Easy | | +| 2716 | [Minimize String Length](/solution/2700-2799/2716.Minimize%20String%20Length/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 348 | +| 2717 | [Semi-Ordered Permutation](/solution/2700-2799/2717.Semi-Ordered%20Permutation/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 348 | +| 2718 | [Sum of Matrix After Queries](/solution/2700-2799/2718.Sum%20of%20Matrix%20After%20Queries/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 348 | +| 2719 | [Count of Integers](/solution/2700-2799/2719.Count%20of%20Integers/README_EN.md) | `Math`,`String`,`Dynamic Programming` | Hard | Weekly Contest 348 | +| 2720 | [Popularity Percentage](/solution/2700-2799/2720.Popularity%20Percentage/README_EN.md) | `Database` | Hard | 🔒 | +| 2721 | [Execute Asynchronous Functions in Parallel](/solution/2700-2799/2721.Execute%20Asynchronous%20Functions%20in%20Parallel/README_EN.md) | | Medium | | +| 2722 | [Join Two Arrays by ID](/solution/2700-2799/2722.Join%20Two%20Arrays%20by%20ID/README_EN.md) | | Medium | | +| 2723 | [Add Two Promises](/solution/2700-2799/2723.Add%20Two%20Promises/README_EN.md) | | Easy | | +| 2724 | [Sort By](/solution/2700-2799/2724.Sort%20By/README_EN.md) | | Easy | | +| 2725 | [Interval Cancellation](/solution/2700-2799/2725.Interval%20Cancellation/README_EN.md) | | Easy | | +| 2726 | [Calculator with Method Chaining](/solution/2700-2799/2726.Calculator%20with%20Method%20Chaining/README_EN.md) | | Easy | | +| 2727 | [Is Object Empty](/solution/2700-2799/2727.Is%20Object%20Empty/README_EN.md) | | Easy | | +| 2728 | [Count Houses in a Circular Street](/solution/2700-2799/2728.Count%20Houses%20in%20a%20Circular%20Street/README_EN.md) | `Array`,`Interactive` | Easy | 🔒 | +| 2729 | [Check if The Number is Fascinating](/solution/2700-2799/2729.Check%20if%20The%20Number%20is%20Fascinating/README_EN.md) | `Hash Table`,`Math` | Easy | Biweekly Contest 106 | +| 2730 | [Find the Longest Semi-Repetitive Substring](/solution/2700-2799/2730.Find%20the%20Longest%20Semi-Repetitive%20Substring/README_EN.md) | `String`,`Sliding Window` | Medium | Biweekly Contest 106 | +| 2731 | [Movement of Robots](/solution/2700-2799/2731.Movement%20of%20Robots/README_EN.md) | `Brainteaser`,`Array`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 106 | +| 2732 | [Find a Good Subset of the Matrix](/solution/2700-2799/2732.Find%20a%20Good%20Subset%20of%20the%20Matrix/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table`,`Matrix` | Hard | Biweekly Contest 106 | +| 2733 | [Neither Minimum nor Maximum](/solution/2700-2799/2733.Neither%20Minimum%20nor%20Maximum/README_EN.md) | `Array`,`Sorting` | Easy | Weekly Contest 349 | +| 2734 | [Lexicographically Smallest String After Substring Operation](/solution/2700-2799/2734.Lexicographically%20Smallest%20String%20After%20Substring%20Operation/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 349 | +| 2735 | [Collecting Chocolates](/solution/2700-2799/2735.Collecting%20Chocolates/README_EN.md) | `Array`,`Enumeration` | Medium | Weekly Contest 349 | +| 2736 | [Maximum Sum Queries](/solution/2700-2799/2736.Maximum%20Sum%20Queries/README_EN.md) | `Stack`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Sorting`,`Monotonic Stack` | Hard | Weekly Contest 349 | +| 2737 | [Find the Closest Marked Node](/solution/2700-2799/2737.Find%20the%20Closest%20Marked%20Node/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | 🔒 | +| 2738 | [Count Occurrences in Text](/solution/2700-2799/2738.Count%20Occurrences%20in%20Text/README_EN.md) | `Database` | Medium | 🔒 | +| 2739 | [Total Distance Traveled](/solution/2700-2799/2739.Total%20Distance%20Traveled/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 350 | +| 2740 | [Find the Value of the Partition](/solution/2700-2799/2740.Find%20the%20Value%20of%20the%20Partition/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 350 | +| 2741 | [Special Permutations](/solution/2700-2799/2741.Special%20Permutations/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Medium | Weekly Contest 350 | +| 2742 | [Painting the Walls](/solution/2700-2799/2742.Painting%20the%20Walls/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Weekly Contest 350 | +| 2743 | [Count Substrings Without Repeating Character](/solution/2700-2799/2743.Count%20Substrings%20Without%20Repeating%20Character/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Medium | 🔒 | +| 2744 | [Find Maximum Number of String Pairs](/solution/2700-2799/2744.Find%20Maximum%20Number%20of%20String%20Pairs/README_EN.md) | `Array`,`Hash Table`,`String`,`Simulation` | Easy | Biweekly Contest 107 | +| 2745 | [Construct the Longest New String](/solution/2700-2799/2745.Construct%20the%20Longest%20New%20String/README_EN.md) | `Greedy`,`Brainteaser`,`Math`,`Dynamic Programming` | Medium | Biweekly Contest 107 | +| 2746 | [Decremental String Concatenation](/solution/2700-2799/2746.Decremental%20String%20Concatenation/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 107 | +| 2747 | [Count Zero Request Servers](/solution/2700-2799/2747.Count%20Zero%20Request%20Servers/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Sliding Window` | Medium | Biweekly Contest 107 | +| 2748 | [Number of Beautiful Pairs](/solution/2700-2799/2748.Number%20of%20Beautiful%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Number Theory` | Easy | Weekly Contest 351 | +| 2749 | [Minimum Operations to Make the Integer Zero](/solution/2700-2799/2749.Minimum%20Operations%20to%20Make%20the%20Integer%20Zero/README_EN.md) | `Bit Manipulation`,`Brainteaser` | Medium | Weekly Contest 351 | +| 2750 | [Ways to Split Array Into Good Subarrays](/solution/2700-2799/2750.Ways%20to%20Split%20Array%20Into%20Good%20Subarrays/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 351 | +| 2751 | [Robot Collisions](/solution/2700-2799/2751.Robot%20Collisions/README_EN.md) | `Stack`,`Array`,`Sorting`,`Simulation` | Hard | Weekly Contest 351 | +| 2752 | [Customers with Maximum Number of Transactions on Consecutive Days](/solution/2700-2799/2752.Customers%20with%20Maximum%20Number%20of%20Transactions%20on%20Consecutive%20Days/README_EN.md) | `Database` | Hard | 🔒 | +| 2753 | [Count Houses in a Circular Street II](/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README_EN.md) | | Hard | 🔒 | +| 2754 | [Bind Function to Context](/solution/2700-2799/2754.Bind%20Function%20to%20Context/README_EN.md) | | Medium | 🔒 | +| 2755 | [Deep Merge of Two Objects](/solution/2700-2799/2755.Deep%20Merge%20of%20Two%20Objects/README_EN.md) | | Medium | 🔒 | +| 2756 | [Query Batching](/solution/2700-2799/2756.Query%20Batching/README_EN.md) | | Hard | 🔒 | +| 2757 | [Generate Circular Array Values](/solution/2700-2799/2757.Generate%20Circular%20Array%20Values/README_EN.md) | | Medium | 🔒 | +| 2758 | [Next Day](/solution/2700-2799/2758.Next%20Day/README_EN.md) | | Easy | 🔒 | +| 2759 | [Convert JSON String to Object](/solution/2700-2799/2759.Convert%20JSON%20String%20to%20Object/README_EN.md) | | Hard | 🔒 | +| 2760 | [Longest Even Odd Subarray With Threshold](/solution/2700-2799/2760.Longest%20Even%20Odd%20Subarray%20With%20Threshold/README_EN.md) | `Array`,`Sliding Window` | Easy | Weekly Contest 352 | +| 2761 | [Prime Pairs With Target Sum](/solution/2700-2799/2761.Prime%20Pairs%20With%20Target%20Sum/README_EN.md) | `Array`,`Math`,`Enumeration`,`Number Theory` | Medium | Weekly Contest 352 | +| 2762 | [Continuous Subarrays](/solution/2700-2799/2762.Continuous%20Subarrays/README_EN.md) | `Queue`,`Array`,`Ordered Set`,`Sliding Window`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | Weekly Contest 352 | +| 2763 | [Sum of Imbalance Numbers of All Subarrays](/solution/2700-2799/2763.Sum%20of%20Imbalance%20Numbers%20of%20All%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Ordered Set` | Hard | Weekly Contest 352 | +| 2764 | [Is Array a Preorder of Some ‌Binary Tree](/solution/2700-2799/2764.Is%20Array%20a%20Preorder%20of%20Some%20%E2%80%8CBinary%20Tree/README_EN.md) | `Stack`,`Tree`,`Depth-First Search`,`Binary Tree` | Medium | 🔒 | +| 2765 | [Longest Alternating Subarray](/solution/2700-2799/2765.Longest%20Alternating%20Subarray/README_EN.md) | `Array`,`Enumeration` | Easy | Biweekly Contest 108 | +| 2766 | [Relocate Marbles](/solution/2700-2799/2766.Relocate%20Marbles/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation` | Medium | Biweekly Contest 108 | +| 2767 | [Partition String Into Minimum Beautiful Substrings](/solution/2700-2799/2767.Partition%20String%20Into%20Minimum%20Beautiful%20Substrings/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming`,`Backtracking` | Medium | Biweekly Contest 108 | +| 2768 | [Number of Black Blocks](/solution/2700-2799/2768.Number%20of%20Black%20Blocks/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Medium | Biweekly Contest 108 | +| 2769 | [Find the Maximum Achievable Number](/solution/2700-2799/2769.Find%20the%20Maximum%20Achievable%20Number/README_EN.md) | `Math` | Easy | Weekly Contest 353 | +| 2770 | [Maximum Number of Jumps to Reach the Last Index](/solution/2700-2799/2770.Maximum%20Number%20of%20Jumps%20to%20Reach%20the%20Last%20Index/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 353 | +| 2771 | [Longest Non-decreasing Subarray From Two Arrays](/solution/2700-2799/2771.Longest%20Non-decreasing%20Subarray%20From%20Two%20Arrays/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 353 | +| 2772 | [Apply Operations to Make All Array Elements Equal to Zero](/solution/2700-2799/2772.Apply%20Operations%20to%20Make%20All%20Array%20Elements%20Equal%20to%20Zero/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 353 | +| 2773 | [Height of Special Binary Tree](/solution/2700-2799/2773.Height%20of%20Special%20Binary%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | +| 2774 | [Array Upper Bound](/solution/2700-2799/2774.Array%20Upper%20Bound/README_EN.md) | | Easy | 🔒 | +| 2775 | [Undefined to Null](/solution/2700-2799/2775.Undefined%20to%20Null/README_EN.md) | | Medium | 🔒 | +| 2776 | [Convert Callback Based Function to Promise Based Function](/solution/2700-2799/2776.Convert%20Callback%20Based%20Function%20to%20Promise%20Based%20Function/README_EN.md) | | Medium | 🔒 | +| 2777 | [Date Range Generator](/solution/2700-2799/2777.Date%20Range%20Generator/README_EN.md) | | Medium | 🔒 | +| 2778 | [Sum of Squares of Special Elements](/solution/2700-2799/2778.Sum%20of%20Squares%20of%20Special%20Elements/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 354 | +| 2779 | [Maximum Beauty of an Array After Applying Operation](/solution/2700-2799/2779.Maximum%20Beauty%20of%20an%20Array%20After%20Applying%20Operation/README_EN.md) | `Array`,`Binary Search`,`Sorting`,`Sliding Window` | Medium | Weekly Contest 354 | +| 2780 | [Minimum Index of a Valid Split](/solution/2700-2799/2780.Minimum%20Index%20of%20a%20Valid%20Split/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | Weekly Contest 354 | +| 2781 | [Length of the Longest Valid Substring](/solution/2700-2799/2781.Length%20of%20the%20Longest%20Valid%20Substring/README_EN.md) | `Array`,`Hash Table`,`String`,`Sliding Window` | Hard | Weekly Contest 354 | +| 2782 | [Number of Unique Categories](/solution/2700-2799/2782.Number%20of%20Unique%20Categories/README_EN.md) | `Union Find`,`Counting`,`Interactive` | Medium | 🔒 | +| 2783 | [Flight Occupancy and Waitlist Analysis](/solution/2700-2799/2783.Flight%20Occupancy%20and%20Waitlist%20Analysis/README_EN.md) | `Database` | Medium | 🔒 | +| 2784 | [Check if Array is Good](/solution/2700-2799/2784.Check%20if%20Array%20is%20Good/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 109 | +| 2785 | [Sort Vowels in a String](/solution/2700-2799/2785.Sort%20Vowels%20in%20a%20String/README_EN.md) | `String`,`Sorting` | Medium | Biweekly Contest 109 | +| 2786 | [Visit Array Positions to Maximize Score](/solution/2700-2799/2786.Visit%20Array%20Positions%20to%20Maximize%20Score/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 109 | +| 2787 | [Ways to Express an Integer as Sum of Powers](/solution/2700-2799/2787.Ways%20to%20Express%20an%20Integer%20as%20Sum%20of%20Powers/README_EN.md) | `Dynamic Programming` | Medium | Biweekly Contest 109 | +| 2788 | [Split Strings by Separator](/solution/2700-2799/2788.Split%20Strings%20by%20Separator/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 355 | +| 2789 | [Largest Element in an Array after Merge Operations](/solution/2700-2799/2789.Largest%20Element%20in%20an%20Array%20after%20Merge%20Operations/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 355 | +| 2790 | [Maximum Number of Groups With Increasing Length](/solution/2700-2799/2790.Maximum%20Number%20of%20Groups%20With%20Increasing%20Length/README_EN.md) | `Greedy`,`Array`,`Math`,`Binary Search`,`Sorting` | Hard | Weekly Contest 355 | +| 2791 | [Count Paths That Can Form a Palindrome in a Tree](/solution/2700-2799/2791.Count%20Paths%20That%20Can%20Form%20a%20Palindrome%20in%20a%20Tree/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 355 | +| 2792 | [Count Nodes That Are Great Enough](/solution/2700-2799/2792.Count%20Nodes%20That%20Are%20Great%20Enough/README_EN.md) | `Tree`,`Depth-First Search`,`Divide and Conquer`,`Binary Tree` | Hard | 🔒 | +| 2793 | [Status of Flight Tickets](/solution/2700-2799/2793.Status%20of%20Flight%20Tickets/README_EN.md) | | Hard | 🔒 | +| 2794 | [Create Object from Two Arrays](/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README_EN.md) | | Easy | 🔒 | +| 2795 | [Parallel Execution of Promises for Individual Results Retrieval](/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README_EN.md) | | Medium | 🔒 | +| 2796 | [Repeat String](/solution/2700-2799/2796.Repeat%20String/README_EN.md) | | Easy | 🔒 | +| 2797 | [Partial Function with Placeholders](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README_EN.md) | | Easy | 🔒 | +| 2798 | [Number of Employees Who Met the Target](/solution/2700-2799/2798.Number%20of%20Employees%20Who%20Met%20the%20Target/README_EN.md) | `Array` | Easy | Weekly Contest 356 | +| 2799 | [Count Complete Subarrays in an Array](/solution/2700-2799/2799.Count%20Complete%20Subarrays%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Weekly Contest 356 | +| 2800 | [Shortest String That Contains Three Strings](/solution/2800-2899/2800.Shortest%20String%20That%20Contains%20Three%20Strings/README_EN.md) | `Greedy`,`String`,`Enumeration` | Medium | Weekly Contest 356 | +| 2801 | [Count Stepping Numbers in Range](/solution/2800-2899/2801.Count%20Stepping%20Numbers%20in%20Range/README_EN.md) | `String`,`Dynamic Programming` | Hard | Weekly Contest 356 | +| 2802 | [Find The K-th Lucky Number](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README_EN.md) | `Bit Manipulation`,`Math`,`String` | Medium | 🔒 | +| 2803 | [Factorial Generator](/solution/2800-2899/2803.Factorial%20Generator/README_EN.md) | | Easy | 🔒 | +| 2804 | [Array Prototype ForEach](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README_EN.md) | | Easy | 🔒 | +| 2805 | [Custom Interval](/solution/2800-2899/2805.Custom%20Interval/README_EN.md) | | Medium | 🔒 | +| 2806 | [Account Balance After Rounded Purchase](/solution/2800-2899/2806.Account%20Balance%20After%20Rounded%20Purchase/README_EN.md) | `Math` | Easy | Biweekly Contest 110 | +| 2807 | [Insert Greatest Common Divisors in Linked List](/solution/2800-2899/2807.Insert%20Greatest%20Common%20Divisors%20in%20Linked%20List/README_EN.md) | `Linked List`,`Math`,`Number Theory` | Medium | Biweekly Contest 110 | +| 2808 | [Minimum Seconds to Equalize a Circular Array](/solution/2800-2899/2808.Minimum%20Seconds%20to%20Equalize%20a%20Circular%20Array/README_EN.md) | `Array`,`Hash Table` | Medium | Biweekly Contest 110 | +| 2809 | [Minimum Time to Make Array Sum At Most x](/solution/2800-2899/2809.Minimum%20Time%20to%20Make%20Array%20Sum%20At%20Most%20x/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 110 | +| 2810 | [Faulty Keyboard](/solution/2800-2899/2810.Faulty%20Keyboard/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 357 | +| 2811 | [Check if it is Possible to Split Array](/solution/2800-2899/2811.Check%20if%20it%20is%20Possible%20to%20Split%20Array/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | Weekly Contest 357 | +| 2812 | [Find the Safest Path in a Grid](/solution/2800-2899/2812.Find%20the%20Safest%20Path%20in%20a%20Grid/README_EN.md) | `Breadth-First Search`,`Union Find`,`Array`,`Binary Search`,`Matrix` | Medium | Weekly Contest 357 | +| 2813 | [Maximum Elegance of a K-Length Subsequence](/solution/2800-2899/2813.Maximum%20Elegance%20of%20a%20K-Length%20Subsequence/README_EN.md) | `Stack`,`Greedy`,`Array`,`Hash Table`,`Sorting`,`Heap (Priority Queue)` | Hard | Weekly Contest 357 | +| 2814 | [Minimum Time Takes to Reach Destination Without Drowning](/solution/2800-2899/2814.Minimum%20Time%20Takes%20to%20Reach%20Destination%20Without%20Drowning/README_EN.md) | `Breadth-First Search`,`Array`,`Matrix` | Hard | 🔒 | +| 2815 | [Max Pair Sum in an Array](/solution/2800-2899/2815.Max%20Pair%20Sum%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 358 | +| 2816 | [Double a Number Represented as a Linked List](/solution/2800-2899/2816.Double%20a%20Number%20Represented%20as%20a%20Linked%20List/README_EN.md) | `Stack`,`Linked List`,`Math` | Medium | Weekly Contest 358 | +| 2817 | [Minimum Absolute Difference Between Elements With Constraint](/solution/2800-2899/2817.Minimum%20Absolute%20Difference%20Between%20Elements%20With%20Constraint/README_EN.md) | `Array`,`Binary Search`,`Ordered Set` | Medium | Weekly Contest 358 | +| 2818 | [Apply Operations to Maximize Score](/solution/2800-2899/2818.Apply%20Operations%20to%20Maximize%20Score/README_EN.md) | `Stack`,`Greedy`,`Array`,`Math`,`Number Theory`,`Monotonic Stack` | Hard | Weekly Contest 358 | +| 2819 | [Minimum Relative Loss After Buying Chocolates](/solution/2800-2899/2819.Minimum%20Relative%20Loss%20After%20Buying%20Chocolates/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting` | Hard | 🔒 | +| 2820 | [Election Results](/solution/2800-2899/2820.Election%20Results/README_EN.md) | | Medium | 🔒 | +| 2821 | [Delay the Resolution of Each Promise](/solution/2800-2899/2821.Delay%20the%20Resolution%20of%20Each%20Promise/README_EN.md) | | Medium | 🔒 | +| 2822 | [Inversion of Object](/solution/2800-2899/2822.Inversion%20of%20Object/README_EN.md) | | Easy | 🔒 | +| 2823 | [Deep Object Filter](/solution/2800-2899/2823.Deep%20Object%20Filter/README_EN.md) | | Medium | 🔒 | +| 2824 | [Count Pairs Whose Sum is Less than Target](/solution/2800-2899/2824.Count%20Pairs%20Whose%20Sum%20is%20Less%20than%20Target/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Sorting` | Easy | Biweekly Contest 111 | +| 2825 | [Make String a Subsequence Using Cyclic Increments](/solution/2800-2899/2825.Make%20String%20a%20Subsequence%20Using%20Cyclic%20Increments/README_EN.md) | `Two Pointers`,`String` | Medium | Biweekly Contest 111 | +| 2826 | [Sorting Three Groups](/solution/2800-2899/2826.Sorting%20Three%20Groups/README_EN.md) | `Array`,`Binary Search`,`Dynamic Programming` | Medium | Biweekly Contest 111 | +| 2827 | [Number of Beautiful Integers in the Range](/solution/2800-2899/2827.Number%20of%20Beautiful%20Integers%20in%20the%20Range/README_EN.md) | `Math`,`Dynamic Programming` | Hard | Biweekly Contest 111 | +| 2828 | [Check if a String Is an Acronym of Words](/solution/2800-2899/2828.Check%20if%20a%20String%20Is%20an%20Acronym%20of%20Words/README_EN.md) | `Array`,`String` | Easy | Weekly Contest 359 | +| 2829 | [Determine the Minimum Sum of a k-avoiding Array](/solution/2800-2899/2829.Determine%20the%20Minimum%20Sum%20of%20a%20k-avoiding%20Array/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 359 | +| 2830 | [Maximize the Profit as the Salesman](/solution/2800-2899/2830.Maximize%20the%20Profit%20as%20the%20Salesman/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Dynamic Programming`,`Sorting` | Medium | Weekly Contest 359 | +| 2831 | [Find the Longest Equal Subarray](/solution/2800-2899/2831.Find%20the%20Longest%20Equal%20Subarray/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sliding Window` | Medium | Weekly Contest 359 | +| 2832 | [Maximal Range That Each Element Is Maximum in It](/solution/2800-2899/2832.Maximal%20Range%20That%20Each%20Element%20Is%20Maximum%20in%20It/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | 🔒 | +| 2833 | [Furthest Point From Origin](/solution/2800-2899/2833.Furthest%20Point%20From%20Origin/README_EN.md) | `String`,`Counting` | Easy | Weekly Contest 360 | +| 2834 | [Find the Minimum Possible Sum of a Beautiful Array](/solution/2800-2899/2834.Find%20the%20Minimum%20Possible%20Sum%20of%20a%20Beautiful%20Array/README_EN.md) | `Greedy`,`Math` | Medium | Weekly Contest 360 | +| 2835 | [Minimum Operations to Form Subsequence With Target Sum](/solution/2800-2899/2835.Minimum%20Operations%20to%20Form%20Subsequence%20With%20Target%20Sum/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array` | Hard | Weekly Contest 360 | +| 2836 | [Maximize Value of Function in a Ball Passing Game](/solution/2800-2899/2836.Maximize%20Value%20of%20Function%20in%20a%20Ball%20Passing%20Game/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 360 | +| 2837 | [Total Traveled Distance](/solution/2800-2899/2837.Total%20Traveled%20Distance/README_EN.md) | `Database` | Easy | 🔒 | +| 2838 | [Maximum Coins Heroes Can Collect](/solution/2800-2899/2838.Maximum%20Coins%20Heroes%20Can%20Collect/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Prefix Sum`,`Sorting` | Medium | 🔒 | +| 2839 | [Check if Strings Can be Made Equal With Operations I](/solution/2800-2899/2839.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20I/README_EN.md) | `String` | Easy | Biweekly Contest 112 | +| 2840 | [Check if Strings Can be Made Equal With Operations II](/solution/2800-2899/2840.Check%20if%20Strings%20Can%20be%20Made%20Equal%20With%20Operations%20II/README_EN.md) | `Hash Table`,`String`,`Sorting` | Medium | Biweekly Contest 112 | +| 2841 | [Maximum Sum of Almost Unique Subarray](/solution/2800-2899/2841.Maximum%20Sum%20of%20Almost%20Unique%20Subarray/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Biweekly Contest 112 | +| 2842 | [Count K-Subsequences of a String With Maximum Beauty](/solution/2800-2899/2842.Count%20K-Subsequences%20of%20a%20String%20With%20Maximum%20Beauty/README_EN.md) | `Greedy`,`Hash Table`,`Math`,`String`,`Combinatorics` | Hard | Biweekly Contest 112 | +| 2843 | [Count Symmetric Integers](/solution/2800-2899/2843.Count%20Symmetric%20Integers/README_EN.md) | `Math`,`Enumeration` | Easy | Weekly Contest 361 | +| 2844 | [Minimum Operations to Make a Special Number](/solution/2800-2899/2844.Minimum%20Operations%20to%20Make%20a%20Special%20Number/README_EN.md) | `Greedy`,`Math`,`String`,`Enumeration` | Medium | Weekly Contest 361 | +| 2845 | [Count of Interesting Subarrays](/solution/2800-2899/2845.Count%20of%20Interesting%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Weekly Contest 361 | +| 2846 | [Minimum Edge Weight Equilibrium Queries in a Tree](/solution/2800-2899/2846.Minimum%20Edge%20Weight%20Equilibrium%20Queries%20in%20a%20Tree/README_EN.md) | `Tree`,`Graph`,`Array`,`Strongly Connected Component` | Hard | Weekly Contest 361 | +| 2847 | [Smallest Number With Given Digit Product](/solution/2800-2899/2847.Smallest%20Number%20With%20Given%20Digit%20Product/README_EN.md) | `Greedy`,`Math` | Medium | 🔒 | +| 2848 | [Points That Intersect With Cars](/solution/2800-2899/2848.Points%20That%20Intersect%20With%20Cars/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Easy | Weekly Contest 362 | +| 2849 | [Determine if a Cell Is Reachable at a Given Time](/solution/2800-2899/2849.Determine%20if%20a%20Cell%20Is%20Reachable%20at%20a%20Given%20Time/README_EN.md) | `Math` | Medium | Weekly Contest 362 | +| 2850 | [Minimum Moves to Spread Stones Over Grid](/solution/2800-2899/2850.Minimum%20Moves%20to%20Spread%20Stones%20Over%20Grid/README_EN.md) | `Breadth-First Search`,`Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 362 | +| 2851 | [String Transformation](/solution/2800-2899/2851.String%20Transformation/README_EN.md) | `Math`,`String`,`Dynamic Programming`,`String Matching` | Hard | Weekly Contest 362 | +| 2852 | [Sum of Remoteness of All Cells](/solution/2800-2899/2852.Sum%20of%20Remoteness%20of%20All%20Cells/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Union Find`,`Array`,`Hash Table`,`Matrix` | Medium | 🔒 | +| 2853 | [Highest Salaries Difference](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README_EN.md) | `Database` | Easy | 🔒 | +| 2854 | [Rolling Average Steps](/solution/2800-2899/2854.Rolling%20Average%20Steps/README_EN.md) | `Database` | Medium | 🔒 | +| 2855 | [Minimum Right Shifts to Sort the Array](/solution/2800-2899/2855.Minimum%20Right%20Shifts%20to%20Sort%20the%20Array/README_EN.md) | `Array` | Easy | Biweekly Contest 113 | +| 2856 | [Minimum Array Length After Pair Removals](/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Counting` | Medium | Biweekly Contest 113 | +| 2857 | [Count Pairs of Points With Distance k](/solution/2800-2899/2857.Count%20Pairs%20of%20Points%20With%20Distance%20k/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Medium | Biweekly Contest 113 | +| 2858 | [Minimum Edge Reversals So Every Node Is Reachable](/solution/2800-2899/2858.Minimum%20Edge%20Reversals%20So%20Every%20Node%20Is%20Reachable/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Dynamic Programming` | Hard | Biweekly Contest 113 | +| 2859 | [Sum of Values at Indices With K Set Bits](/solution/2800-2899/2859.Sum%20of%20Values%20at%20Indices%20With%20K%20Set%20Bits/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 363 | +| 2860 | [Happy Students](/solution/2800-2899/2860.Happy%20Students/README_EN.md) | `Array`,`Enumeration`,`Sorting` | Medium | Weekly Contest 363 | +| 2861 | [Maximum Number of Alloys](/solution/2800-2899/2861.Maximum%20Number%20of%20Alloys/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 363 | +| 2862 | [Maximum Element-Sum of a Complete Subset of Indices](/solution/2800-2899/2862.Maximum%20Element-Sum%20of%20a%20Complete%20Subset%20of%20Indices/README_EN.md) | `Array`,`Math`,`Number Theory` | Hard | Weekly Contest 363 | +| 2863 | [Maximum Length of Semi-Decreasing Subarrays](/solution/2800-2899/2863.Maximum%20Length%20of%20Semi-Decreasing%20Subarrays/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Medium | 🔒 | +| 2864 | [Maximum Odd Binary Number](/solution/2800-2899/2864.Maximum%20Odd%20Binary%20Number/README_EN.md) | `Greedy`,`Math`,`String` | Easy | Weekly Contest 364 | +| 2865 | [Beautiful Towers I](/solution/2800-2899/2865.Beautiful%20Towers%20I/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 364 | +| 2866 | [Beautiful Towers II](/solution/2800-2899/2866.Beautiful%20Towers%20II/README_EN.md) | `Stack`,`Array`,`Monotonic Stack` | Medium | Weekly Contest 364 | +| 2867 | [Count Valid Paths in a Tree](/solution/2800-2899/2867.Count%20Valid%20Paths%20in%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Math`,`Dynamic Programming`,`Number Theory` | Hard | Weekly Contest 364 | +| 2868 | [The Wording Game](/solution/2800-2899/2868.The%20Wording%20Game/README_EN.md) | `Array`,`Math`,`Two Pointers`,`String`,`Game Theory` | Hard | 🔒 | +| 2869 | [Minimum Operations to Collect Elements](/solution/2800-2899/2869.Minimum%20Operations%20to%20Collect%20Elements/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Easy | Biweekly Contest 114 | +| 2870 | [Minimum Number of Operations to Make Array Empty](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`Counting` | Medium | Biweekly Contest 114 | +| 2871 | [Split Array Into Maximum Number of Subarrays](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array` | Medium | Biweekly Contest 114 | +| 2872 | [Maximum Number of K-Divisible Components](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README_EN.md) | `Tree`,`Depth-First Search` | Hard | Biweekly Contest 114 | +| 2873 | [Maximum Value of an Ordered Triplet I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README_EN.md) | `Array` | Easy | Weekly Contest 365 | +| 2874 | [Maximum Value of an Ordered Triplet II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README_EN.md) | `Array` | Medium | Weekly Contest 365 | +| 2875 | [Minimum Size Subarray in Infinite Array](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum`,`Sliding Window` | Medium | Weekly Contest 365 | +| 2876 | [Count Visited Nodes in a Directed Graph](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README_EN.md) | `Graph`,`Memoization`,`Dynamic Programming` | Hard | Weekly Contest 365 | +| 2877 | [Create a DataFrame from List](/solution/2800-2899/2877.Create%20a%20DataFrame%20from%20List/README_EN.md) | | Easy | | +| 2878 | [Get the Size of a DataFrame](/solution/2800-2899/2878.Get%20the%20Size%20of%20a%20DataFrame/README_EN.md) | | Easy | | +| 2879 | [Display the First Three Rows](/solution/2800-2899/2879.Display%20the%20First%20Three%20Rows/README_EN.md) | | Easy | | +| 2880 | [Select Data](/solution/2800-2899/2880.Select%20Data/README_EN.md) | | Easy | | +| 2881 | [Create a New Column](/solution/2800-2899/2881.Create%20a%20New%20Column/README_EN.md) | | Easy | | +| 2882 | [Drop Duplicate Rows](/solution/2800-2899/2882.Drop%20Duplicate%20Rows/README_EN.md) | | Easy | | +| 2883 | [Drop Missing Data](/solution/2800-2899/2883.Drop%20Missing%20Data/README_EN.md) | | Easy | | +| 2884 | [Modify Columns](/solution/2800-2899/2884.Modify%20Columns/README_EN.md) | | Easy | | +| 2885 | [Rename Columns](/solution/2800-2899/2885.Rename%20Columns/README_EN.md) | | Easy | | +| 2886 | [Change Data Type](/solution/2800-2899/2886.Change%20Data%20Type/README_EN.md) | | Easy | | +| 2887 | [Fill Missing Data](/solution/2800-2899/2887.Fill%20Missing%20Data/README_EN.md) | | Easy | | +| 2888 | [Reshape Data Concatenate](/solution/2800-2899/2888.Reshape%20Data%20Concatenate/README_EN.md) | | Easy | | +| 2889 | [Reshape Data Pivot](/solution/2800-2899/2889.Reshape%20Data%20Pivot/README_EN.md) | | Easy | | +| 2890 | [Reshape Data Melt](/solution/2800-2899/2890.Reshape%20Data%20Melt/README_EN.md) | | Easy | | +| 2891 | [Method Chaining](/solution/2800-2899/2891.Method%20Chaining/README_EN.md) | | Easy | | +| 2892 | [Minimizing Array After Replacing Pairs With Their Product](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README_EN.md) | `Greedy`,`Array`,`Dynamic Programming` | Medium | 🔒 | +| 2893 | [Calculate Orders Within Each Interval](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README_EN.md) | `Database` | Medium | 🔒 | +| 2894 | [Divisible and Non-divisible Sums Difference](/solution/2800-2899/2894.Divisible%20and%20Non-divisible%20Sums%20Difference/README_EN.md) | `Math` | Easy | Weekly Contest 366 | +| 2895 | [Minimum Processing Time](/solution/2800-2899/2895.Minimum%20Processing%20Time/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 366 | +| 2896 | [Apply Operations to Make Two Strings Equal](/solution/2800-2899/2896.Apply%20Operations%20to%20Make%20Two%20Strings%20Equal/README_EN.md) | `String`,`Dynamic Programming` | Medium | Weekly Contest 366 | +| 2897 | [Apply Operations on Array to Maximize Sum of Squares](/solution/2800-2899/2897.Apply%20Operations%20on%20Array%20to%20Maximize%20Sum%20of%20Squares/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array`,`Hash Table` | Hard | Weekly Contest 366 | +| 2898 | [Maximum Linear Stock Score](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README_EN.md) | `Array`,`Hash Table` | Medium | 🔒 | +| 2899 | [Last Visited Integers](/solution/2800-2899/2899.Last%20Visited%20Integers/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 115 | +| 2900 | [Longest Unequal Adjacent Groups Subsequence I](/solution/2900-2999/2900.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20I/README_EN.md) | `Greedy`,`Array`,`String`,`Dynamic Programming` | Easy | Biweekly Contest 115 | +| 2901 | [Longest Unequal Adjacent Groups Subsequence II](/solution/2900-2999/2901.Longest%20Unequal%20Adjacent%20Groups%20Subsequence%20II/README_EN.md) | `Array`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 115 | +| 2902 | [Count of Sub-Multisets With Bounded Sum](/solution/2900-2999/2902.Count%20of%20Sub-Multisets%20With%20Bounded%20Sum/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming`,`Sliding Window` | Hard | Biweekly Contest 115 | +| 2903 | [Find Indices With Index and Value Difference I](/solution/2900-2999/2903.Find%20Indices%20With%20Index%20and%20Value%20Difference%20I/README_EN.md) | `Array`,`Two Pointers` | Easy | Weekly Contest 367 | +| 2904 | [Shortest and Lexicographically Smallest Beautiful String](/solution/2900-2999/2904.Shortest%20and%20Lexicographically%20Smallest%20Beautiful%20String/README_EN.md) | `String`,`Sliding Window` | Medium | Weekly Contest 367 | +| 2905 | [Find Indices With Index and Value Difference II](/solution/2900-2999/2905.Find%20Indices%20With%20Index%20and%20Value%20Difference%20II/README_EN.md) | `Array`,`Two Pointers` | Medium | Weekly Contest 367 | +| 2906 | [Construct Product Matrix](/solution/2900-2999/2906.Construct%20Product%20Matrix/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 367 | +| 2907 | [Maximum Profitable Triplets With Increasing Prices I](/solution/2900-2999/2907.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20I/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array` | Medium | 🔒 | +| 2908 | [Minimum Sum of Mountain Triplets I](/solution/2900-2999/2908.Minimum%20Sum%20of%20Mountain%20Triplets%20I/README_EN.md) | `Array` | Easy | Weekly Contest 368 | +| 2909 | [Minimum Sum of Mountain Triplets II](/solution/2900-2999/2909.Minimum%20Sum%20of%20Mountain%20Triplets%20II/README_EN.md) | `Array` | Medium | Weekly Contest 368 | +| 2910 | [Minimum Number of Groups to Create a Valid Assignment](/solution/2900-2999/2910.Minimum%20Number%20of%20Groups%20to%20Create%20a%20Valid%20Assignment/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Medium | Weekly Contest 368 | +| 2911 | [Minimum Changes to Make K Semi-palindromes](/solution/2900-2999/2911.Minimum%20Changes%20to%20Make%20K%20Semi-palindromes/README_EN.md) | `Two Pointers`,`String`,`Dynamic Programming` | Hard | Weekly Contest 368 | +| 2912 | [Number of Ways to Reach Destination in the Grid](/solution/2900-2999/2912.Number%20of%20Ways%20to%20Reach%20Destination%20in%20the%20Grid/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Hard | 🔒 | +| 2913 | [Subarrays Distinct Element Sum of Squares I](/solution/2900-2999/2913.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20I/README_EN.md) | `Array`,`Hash Table` | Easy | Biweekly Contest 116 | +| 2914 | [Minimum Number of Changes to Make Binary String Beautiful](/solution/2900-2999/2914.Minimum%20Number%20of%20Changes%20to%20Make%20Binary%20String%20Beautiful/README_EN.md) | `String` | Medium | Biweekly Contest 116 | +| 2915 | [Length of the Longest Subsequence That Sums to Target](/solution/2900-2999/2915.Length%20of%20the%20Longest%20Subsequence%20That%20Sums%20to%20Target/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Biweekly Contest 116 | +| 2916 | [Subarrays Distinct Element Sum of Squares II](/solution/2900-2999/2916.Subarrays%20Distinct%20Element%20Sum%20of%20Squares%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Dynamic Programming` | Hard | Biweekly Contest 116 | +| 2917 | [Find the K-or of an Array](/solution/2900-2999/2917.Find%20the%20K-or%20of%20an%20Array/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 369 | +| 2918 | [Minimum Equal Sum of Two Arrays After Replacing Zeros](/solution/2900-2999/2918.Minimum%20Equal%20Sum%20of%20Two%20Arrays%20After%20Replacing%20Zeros/README_EN.md) | `Greedy`,`Array` | Medium | Weekly Contest 369 | +| 2919 | [Minimum Increment Operations to Make Array Beautiful](/solution/2900-2999/2919.Minimum%20Increment%20Operations%20to%20Make%20Array%20Beautiful/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 369 | +| 2920 | [Maximum Points After Collecting Coins From All Nodes](/solution/2900-2999/2920.Maximum%20Points%20After%20Collecting%20Coins%20From%20All%20Nodes/README_EN.md) | `Bit Manipulation`,`Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 369 | +| 2921 | [Maximum Profitable Triplets With Increasing Prices II](/solution/2900-2999/2921.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array` | Hard | 🔒 | +| 2922 | [Market Analysis III](/solution/2900-2999/2922.Market%20Analysis%20III/README_EN.md) | `Database` | Medium | 🔒 | +| 2923 | [Find Champion I](/solution/2900-2999/2923.Find%20Champion%20I/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 370 | +| 2924 | [Find Champion II](/solution/2900-2999/2924.Find%20Champion%20II/README_EN.md) | `Graph` | Medium | Weekly Contest 370 | +| 2925 | [Maximum Score After Applying Operations on a Tree](/solution/2900-2999/2925.Maximum%20Score%20After%20Applying%20Operations%20on%20a%20Tree/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming` | Medium | Weekly Contest 370 | +| 2926 | [Maximum Balanced Subsequence Sum](/solution/2900-2999/2926.Maximum%20Balanced%20Subsequence%20Sum/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 370 | +| 2927 | [Distribute Candies Among Children III](/solution/2900-2999/2927.Distribute%20Candies%20Among%20Children%20III/README_EN.md) | `Math`,`Combinatorics` | Hard | 🔒 | +| 2928 | [Distribute Candies Among Children I](/solution/2900-2999/2928.Distribute%20Candies%20Among%20Children%20I/README_EN.md) | `Math`,`Combinatorics`,`Enumeration` | Easy | Biweekly Contest 117 | +| 2929 | [Distribute Candies Among Children II](/solution/2900-2999/2929.Distribute%20Candies%20Among%20Children%20II/README_EN.md) | `Math`,`Combinatorics`,`Enumeration` | Medium | Biweekly Contest 117 | +| 2930 | [Number of Strings Which Can Be Rearranged to Contain Substring](/solution/2900-2999/2930.Number%20of%20Strings%20Which%20Can%20Be%20Rearranged%20to%20Contain%20Substring/README_EN.md) | `Math`,`Dynamic Programming`,`Combinatorics` | Medium | Biweekly Contest 117 | +| 2931 | [Maximum Spending After Buying Items](/solution/2900-2999/2931.Maximum%20Spending%20After%20Buying%20Items/README_EN.md) | `Greedy`,`Array`,`Matrix`,`Sorting`,`Heap (Priority Queue)` | Hard | Biweekly Contest 117 | +| 2932 | [Maximum Strong Pair XOR I](/solution/2900-2999/2932.Maximum%20Strong%20Pair%20XOR%20I/README_EN.md) | `Bit Manipulation`,`Trie`,`Array`,`Hash Table`,`Sliding Window` | Easy | Weekly Contest 371 | +| 2933 | [High-Access Employees](/solution/2900-2999/2933.High-Access%20Employees/README_EN.md) | `Array`,`Hash Table`,`String`,`Sorting` | Medium | Weekly Contest 371 | +| 2934 | [Minimum Operations to Maximize Last Elements in Arrays](/solution/2900-2999/2934.Minimum%20Operations%20to%20Maximize%20Last%20Elements%20in%20Arrays/README_EN.md) | `Array`,`Enumeration` | Medium | Weekly Contest 371 | +| 2935 | [Maximum Strong Pair XOR II](/solution/2900-2999/2935.Maximum%20Strong%20Pair%20XOR%20II/README_EN.md) | `Bit Manipulation`,`Trie`,`Array`,`Hash Table`,`Sliding Window` | Hard | Weekly Contest 371 | +| 2936 | [Number of Equal Numbers Blocks](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README_EN.md) | `Array`,`Binary Search`,`Interactive` | Medium | 🔒 | +| 2937 | [Make Three Strings Equal](/solution/2900-2999/2937.Make%20Three%20Strings%20Equal/README_EN.md) | `String` | Easy | Weekly Contest 372 | +| 2938 | [Separate Black and White Balls](/solution/2900-2999/2938.Separate%20Black%20and%20White%20Balls/README_EN.md) | `Greedy`,`Two Pointers`,`String` | Medium | Weekly Contest 372 | +| 2939 | [Maximum Xor Product](/solution/2900-2999/2939.Maximum%20Xor%20Product/README_EN.md) | `Greedy`,`Bit Manipulation`,`Math` | Medium | Weekly Contest 372 | +| 2940 | [Find Building Where Alice and Bob Can Meet](/solution/2900-2999/2940.Find%20Building%20Where%20Alice%20and%20Bob%20Can%20Meet/README_EN.md) | `Stack`,`Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Monotonic Stack`,`Heap (Priority Queue)` | Hard | Weekly Contest 372 | +| 2941 | [Maximum GCD-Sum of a Subarray](/solution/2900-2999/2941.Maximum%20GCD-Sum%20of%20a%20Subarray/README_EN.md) | `Array`,`Math`,`Binary Search`,`Number Theory` | Hard | 🔒 | +| 2942 | [Find Words Containing Character](/solution/2900-2999/2942.Find%20Words%20Containing%20Character/README_EN.md) | `Array`,`String` | Easy | Biweekly Contest 118 | +| 2943 | [Maximize Area of Square Hole in Grid](/solution/2900-2999/2943.Maximize%20Area%20of%20Square%20Hole%20in%20Grid/README_EN.md) | `Array`,`Sorting` | Medium | Biweekly Contest 118 | +| 2944 | [Minimum Number of Coins for Fruits](/solution/2900-2999/2944.Minimum%20Number%20of%20Coins%20for%20Fruits/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Monotonic Queue`,`Heap (Priority Queue)` | Medium | Biweekly Contest 118 | +| 2945 | [Find Maximum Non-decreasing Array Length](/solution/2900-2999/2945.Find%20Maximum%20Non-decreasing%20Array%20Length/README_EN.md) | `Stack`,`Queue`,`Array`,`Binary Search`,`Dynamic Programming`,`Monotonic Queue`,`Monotonic Stack` | Hard | Biweekly Contest 118 | +| 2946 | [Matrix Similarity After Cyclic Shifts](/solution/2900-2999/2946.Matrix%20Similarity%20After%20Cyclic%20Shifts/README_EN.md) | `Array`,`Math`,`Matrix`,`Simulation` | Easy | Weekly Contest 373 | +| 2947 | [Count Beautiful Substrings I](/solution/2900-2999/2947.Count%20Beautiful%20Substrings%20I/README_EN.md) | `Hash Table`,`Math`,`String`,`Enumeration`,`Number Theory`,`Prefix Sum` | Medium | Weekly Contest 373 | +| 2948 | [Make Lexicographically Smallest Array by Swapping Elements](/solution/2900-2999/2948.Make%20Lexicographically%20Smallest%20Array%20by%20Swapping%20Elements/README_EN.md) | `Union Find`,`Array`,`Sorting` | Medium | Weekly Contest 373 | +| 2949 | [Count Beautiful Substrings II](/solution/2900-2999/2949.Count%20Beautiful%20Substrings%20II/README_EN.md) | `Hash Table`,`Math`,`String`,`Number Theory`,`Prefix Sum` | Hard | Weekly Contest 373 | +| 2950 | [Number of Divisible Substrings](/solution/2900-2999/2950.Number%20of%20Divisible%20Substrings/README_EN.md) | `Hash Table`,`String`,`Counting`,`Prefix Sum` | Medium | 🔒 | +| 2951 | [Find the Peaks](/solution/2900-2999/2951.Find%20the%20Peaks/README_EN.md) | `Array`,`Enumeration` | Easy | Weekly Contest 374 | +| 2952 | [Minimum Number of Coins to be Added](/solution/2900-2999/2952.Minimum%20Number%20of%20Coins%20to%20be%20Added/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 374 | +| 2953 | [Count Complete Substrings](/solution/2900-2999/2953.Count%20Complete%20Substrings/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Hard | Weekly Contest 374 | +| 2954 | [Count the Number of Infection Sequences](/solution/2900-2999/2954.Count%20the%20Number%20of%20Infection%20Sequences/README_EN.md) | `Array`,`Math`,`Combinatorics` | Hard | Weekly Contest 374 | +| 2955 | [Number of Same-End Substrings](/solution/2900-2999/2955.Number%20of%20Same-End%20Substrings/README_EN.md) | `Array`,`Hash Table`,`String`,`Counting`,`Prefix Sum` | Medium | 🔒 | +| 2956 | [Find Common Elements Between Two Arrays](/solution/2900-2999/2956.Find%20Common%20Elements%20Between%20Two%20Arrays/README_EN.md) | `Array`,`Hash Table` | Easy | Biweekly Contest 119 | +| 2957 | [Remove Adjacent Almost-Equal Characters](/solution/2900-2999/2957.Remove%20Adjacent%20Almost-Equal%20Characters/README_EN.md) | `Greedy`,`String`,`Dynamic Programming` | Medium | Biweekly Contest 119 | +| 2958 | [Length of Longest Subarray With at Most K Frequency](/solution/2900-2999/2958.Length%20of%20Longest%20Subarray%20With%20at%20Most%20K%20Frequency/README_EN.md) | `Array`,`Hash Table`,`Sliding Window` | Medium | Biweekly Contest 119 | +| 2959 | [Number of Possible Sets of Closing Branches](/solution/2900-2999/2959.Number%20of%20Possible%20Sets%20of%20Closing%20Branches/README_EN.md) | `Bit Manipulation`,`Graph`,`Enumeration`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Biweekly Contest 119 | +| 2960 | [Count Tested Devices After Test Operations](/solution/2900-2999/2960.Count%20Tested%20Devices%20After%20Test%20Operations/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 375 | +| 2961 | [Double Modular Exponentiation](/solution/2900-2999/2961.Double%20Modular%20Exponentiation/README_EN.md) | `Array`,`Math`,`Simulation` | Medium | Weekly Contest 375 | +| 2962 | [Count Subarrays Where Max Element Appears at Least K Times](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 375 | +| 2963 | [Count the Number of Good Partitions](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README_EN.md) | `Array`,`Hash Table`,`Math`,`Combinatorics` | Hard | Weekly Contest 375 | +| 2964 | [Number of Divisible Triplet Sums](/solution/2900-2999/2964.Number%20of%20Divisible%20Triplet%20Sums/README_EN.md) | `Array`,`Hash Table` | Medium | 🔒 | +| 2965 | [Find Missing and Repeated Values](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README_EN.md) | `Array`,`Hash Table`,`Math`,`Matrix` | Easy | Weekly Contest 376 | +| 2966 | [Divide Array Into Arrays With Max Difference](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 376 | +| 2967 | [Minimum Cost to Make Array Equalindromic](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README_EN.md) | `Greedy`,`Array`,`Math`,`Sorting` | Medium | Weekly Contest 376 | +| 2968 | [Apply Operations to Maximize Frequency Score](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum`,`Sorting`,`Sliding Window` | Hard | Weekly Contest 376 | +| 2969 | [Minimum Number of Coins for Fruits II](/solution/2900-2999/2969.Minimum%20Number%20of%20Coins%20for%20Fruits%20II/README_EN.md) | `Queue`,`Array`,`Dynamic Programming`,`Monotonic Queue`,`Heap (Priority Queue)` | Hard | 🔒 | +| 2970 | [Count the Number of Incremovable Subarrays I](/solution/2900-2999/2970.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README_EN.md) | `Array`,`Two Pointers`,`Binary Search`,`Enumeration` | Easy | Biweekly Contest 120 | +| 2971 | [Find Polygon With the Largest Perimeter](/solution/2900-2999/2971.Find%20Polygon%20With%20the%20Largest%20Perimeter/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sorting` | Medium | Biweekly Contest 120 | +| 2972 | [Count the Number of Incremovable Subarrays II](/solution/2900-2999/2972.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README_EN.md) | `Array`,`Two Pointers`,`Binary Search` | Hard | Biweekly Contest 120 | +| 2973 | [Find Number of Coins to Place in Tree Nodes](/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README_EN.md) | `Tree`,`Depth-First Search`,`Dynamic Programming`,`Sorting`,`Heap (Priority Queue)` | Hard | Biweekly Contest 120 | +| 2974 | [Minimum Number Game](/solution/2900-2999/2974.Minimum%20Number%20Game/README_EN.md) | `Array`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Easy | Weekly Contest 377 | +| 2975 | [Maximum Square Area by Removing Fences From a Field](/solution/2900-2999/2975.Maximum%20Square%20Area%20by%20Removing%20Fences%20From%20a%20Field/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Medium | Weekly Contest 377 | +| 2976 | [Minimum Cost to Convert String I](/solution/2900-2999/2976.Minimum%20Cost%20to%20Convert%20String%20I/README_EN.md) | `Graph`,`Array`,`String`,`Shortest Path` | Medium | Weekly Contest 377 | +| 2977 | [Minimum Cost to Convert String II](/solution/2900-2999/2977.Minimum%20Cost%20to%20Convert%20String%20II/README_EN.md) | `Graph`,`Trie`,`Array`,`String`,`Dynamic Programming`,`Shortest Path` | Hard | Weekly Contest 377 | +| 2978 | [Symmetric Coordinates](/solution/2900-2999/2978.Symmetric%20Coordinates/README_EN.md) | `Database` | Medium | 🔒 | +| 2979 | [Most Expensive Item That Can Not Be Bought](/solution/2900-2999/2979.Most%20Expensive%20Item%20That%20Can%20Not%20Be%20Bought/README_EN.md) | `Math`,`Dynamic Programming`,`Number Theory` | Medium | 🔒 | +| 2980 | [Check if Bitwise OR Has Trailing Zeros](/solution/2900-2999/2980.Check%20if%20Bitwise%20OR%20Has%20Trailing%20Zeros/README_EN.md) | `Bit Manipulation`,`Array` | Easy | Weekly Contest 378 | +| 2981 | [Find Longest Special Substring That Occurs Thrice I](/solution/2900-2999/2981.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20I/README_EN.md) | `Hash Table`,`String`,`Binary Search`,`Counting`,`Sliding Window` | Medium | Weekly Contest 378 | +| 2982 | [Find Longest Special Substring That Occurs Thrice II](/solution/2900-2999/2982.Find%20Longest%20Special%20Substring%20That%20Occurs%20Thrice%20II/README_EN.md) | `Hash Table`,`String`,`Binary Search`,`Counting`,`Sliding Window` | Medium | Weekly Contest 378 | +| 2983 | [Palindrome Rearrangement Queries](/solution/2900-2999/2983.Palindrome%20Rearrangement%20Queries/README_EN.md) | `Hash Table`,`String`,`Prefix Sum` | Hard | Weekly Contest 378 | +| 2984 | [Find Peak Calling Hours for Each City](/solution/2900-2999/2984.Find%20Peak%20Calling%20Hours%20for%20Each%20City/README_EN.md) | `Database` | Medium | 🔒 | +| 2985 | [Calculate Compressed Mean](/solution/2900-2999/2985.Calculate%20Compressed%20Mean/README_EN.md) | `Database` | Easy | 🔒 | +| 2986 | [Find Third Transaction](/solution/2900-2999/2986.Find%20Third%20Transaction/README_EN.md) | `Database` | Medium | 🔒 | +| 2987 | [Find Expensive Cities](/solution/2900-2999/2987.Find%20Expensive%20Cities/README_EN.md) | `Database` | Easy | 🔒 | +| 2988 | [Manager of the Largest Department](/solution/2900-2999/2988.Manager%20of%20the%20Largest%20Department/README_EN.md) | `Database` | Medium | 🔒 | +| 2989 | [Class Performance](/solution/2900-2999/2989.Class%20Performance/README_EN.md) | `Database` | Medium | 🔒 | +| 2990 | [Loan Types](/solution/2900-2999/2990.Loan%20Types/README_EN.md) | `Database` | Easy | 🔒 | +| 2991 | [Top Three Wineries](/solution/2900-2999/2991.Top%20Three%20Wineries/README_EN.md) | `Database` | Hard | 🔒 | +| 2992 | [Number of Self-Divisible Permutations](/solution/2900-2999/2992.Number%20of%20Self-Divisible%20Permutations/README_EN.md) | `Bit Manipulation`,`Recursion`,`Array`,`Dynamic Programming`,`Bitmask` | Medium | 🔒 | +| 2993 | [Friday Purchases I](/solution/2900-2999/2993.Friday%20Purchases%20I/README_EN.md) | `Database` | Medium | 🔒 | +| 2994 | [Friday Purchases II](/solution/2900-2999/2994.Friday%20Purchases%20II/README_EN.md) | `Database` | Hard | 🔒 | +| 2995 | [Viewers Turned Streamers](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README_EN.md) | `Database` | Hard | 🔒 | +| 2996 | [Smallest Missing Integer Greater Than Sequential Prefix Sum](/solution/2900-2999/2996.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README_EN.md) | `Array`,`Hash Table`,`Sorting` | Easy | Biweekly Contest 121 | +| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K](/solution/2900-2999/2997.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README_EN.md) | `Bit Manipulation`,`Array` | Medium | Biweekly Contest 121 | +| 2998 | [Minimum Number of Operations to Make X and Y Equal](/solution/2900-2999/2998.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README_EN.md) | `Breadth-First Search`,`Memoization`,`Dynamic Programming` | Medium | Biweekly Contest 121 | +| 2999 | [Count the Number of Powerful Integers](/solution/2900-2999/2999.Count%20the%20Number%20of%20Powerful%20Integers/README_EN.md) | `Math`,`String`,`Dynamic Programming` | Hard | Biweekly Contest 121 | +| 3000 | [Maximum Area of Longest Diagonal Rectangle](/solution/3000-3099/3000.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README_EN.md) | `Array` | Easy | Weekly Contest 379 | +| 3001 | [Minimum Moves to Capture The Queen](/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/README_EN.md) | `Array`,`Enumeration` | Medium | Weekly Contest 379 | +| 3002 | [Maximum Size of a Set After Removals](/solution/3000-3099/3002.Maximum%20Size%20of%20a%20Set%20After%20Removals/README_EN.md) | `Greedy`,`Array`,`Hash Table` | Medium | Weekly Contest 379 | +| 3003 | [Maximize the Number of Partitions After Operations](/solution/3000-3099/3003.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README_EN.md) | `Bit Manipulation`,`String`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 379 | +| 3004 | [Maximum Subtree of the Same Color](/solution/3000-3099/3004.Maximum%20Subtree%20of%20the%20Same%20Color/README_EN.md) | `Tree`,`Depth-First Search`,`Array`,`Dynamic Programming` | Medium | 🔒 | +| 3005 | [Count Elements With Maximum Frequency](/solution/3000-3099/3005.Count%20Elements%20With%20Maximum%20Frequency/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 380 | +| 3006 | [Find Beautiful Indices in the Given Array I](/solution/3000-3099/3006.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I/README_EN.md) | `Two Pointers`,`String`,`Binary Search`,`String Matching`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 380 | +| 3007 | [Maximum Number That Sum of the Prices Is Less Than or Equal to K](/solution/3000-3099/3007.Maximum%20Number%20That%20Sum%20of%20the%20Prices%20Is%20Less%20Than%20or%20Equal%20to%20K/README_EN.md) | `Bit Manipulation`,`Binary Search`,`Dynamic Programming` | Medium | Weekly Contest 380 | +| 3008 | [Find Beautiful Indices in the Given Array II](/solution/3000-3099/3008.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20II/README_EN.md) | `Two Pointers`,`String`,`Binary Search`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 380 | +| 3009 | [Maximum Number of Intersections on the Chart](/solution/3000-3099/3009.Maximum%20Number%20of%20Intersections%20on%20the%20Chart/README_EN.md) | `Binary Indexed Tree`,`Geometry`,`Array`,`Math` | Hard | 🔒 | +| 3010 | [Divide an Array Into Subarrays With Minimum Cost I](/solution/3000-3099/3010.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20I/README_EN.md) | `Array`,`Enumeration`,`Sorting` | Easy | Biweekly Contest 122 | +| 3011 | [Find if Array Can Be Sorted](/solution/3000-3099/3011.Find%20if%20Array%20Can%20Be%20Sorted/README_EN.md) | `Bit Manipulation`,`Array`,`Sorting` | Medium | Biweekly Contest 122 | +| 3012 | [Minimize Length of Array Using Operations](/solution/3000-3099/3012.Minimize%20Length%20of%20Array%20Using%20Operations/README_EN.md) | `Greedy`,`Array`,`Math`,`Number Theory` | Medium | Biweekly Contest 122 | +| 3013 | [Divide an Array Into Subarrays With Minimum Cost II](/solution/3000-3099/3013.Divide%20an%20Array%20Into%20Subarrays%20With%20Minimum%20Cost%20II/README_EN.md) | `Array`,`Hash Table`,`Sliding Window`,`Heap (Priority Queue)` | Hard | Biweekly Contest 122 | +| 3014 | [Minimum Number of Pushes to Type Word I](/solution/3000-3099/3014.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20I/README_EN.md) | `Greedy`,`Math`,`String` | Easy | Weekly Contest 381 | +| 3015 | [Count the Number of Houses at a Certain Distance I](/solution/3000-3099/3015.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20I/README_EN.md) | `Breadth-First Search`,`Graph`,`Prefix Sum` | Medium | Weekly Contest 381 | +| 3016 | [Minimum Number of Pushes to Type Word II](/solution/3000-3099/3016.Minimum%20Number%20of%20Pushes%20to%20Type%20Word%20II/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 381 | +| 3017 | [Count the Number of Houses at a Certain Distance II](/solution/3000-3099/3017.Count%20the%20Number%20of%20Houses%20at%20a%20Certain%20Distance%20II/README_EN.md) | `Graph`,`Prefix Sum` | Hard | Weekly Contest 381 | +| 3018 | [Maximum Number of Removal Queries That Can Be Processed I](/solution/3000-3099/3018.Maximum%20Number%20of%20Removal%20Queries%20That%20Can%20Be%20Processed%20I/README_EN.md) | `Array`,`Dynamic Programming` | Hard | 🔒 | +| 3019 | [Number of Changing Keys](/solution/3000-3099/3019.Number%20of%20Changing%20Keys/README_EN.md) | `String` | Easy | Weekly Contest 382 | +| 3020 | [Find the Maximum Number of Elements in Subset](/solution/3000-3099/3020.Find%20the%20Maximum%20Number%20of%20Elements%20in%20Subset/README_EN.md) | `Array`,`Hash Table`,`Enumeration` | Medium | Weekly Contest 382 | +| 3021 | [Alice and Bob Playing Flower Game](/solution/3000-3099/3021.Alice%20and%20Bob%20Playing%20Flower%20Game/README_EN.md) | `Math` | Medium | Weekly Contest 382 | +| 3022 | [Minimize OR of Remaining Elements Using Operations](/solution/3000-3099/3022.Minimize%20OR%20of%20Remaining%20Elements%20Using%20Operations/README_EN.md) | `Greedy`,`Bit Manipulation`,`Array` | Hard | Weekly Contest 382 | +| 3023 | [Find Pattern in Infinite Stream I](/solution/3000-3099/3023.Find%20Pattern%20in%20Infinite%20Stream%20I/README_EN.md) | `Array`,`String Matching`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Medium | 🔒 | +| 3024 | [Type of Triangle](/solution/3000-3099/3024.Type%20of%20Triangle/README_EN.md) | `Array`,`Math`,`Sorting` | Easy | Biweekly Contest 123 | +| 3025 | [Find the Number of Ways to Place People I](/solution/3000-3099/3025.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20I/README_EN.md) | `Geometry`,`Array`,`Math`,`Enumeration`,`Sorting` | Medium | Biweekly Contest 123 | +| 3026 | [Maximum Good Subarray Sum](/solution/3000-3099/3026.Maximum%20Good%20Subarray%20Sum/README_EN.md) | `Array`,`Hash Table`,`Prefix Sum` | Medium | Biweekly Contest 123 | +| 3027 | [Find the Number of Ways to Place People II](/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/README_EN.md) | `Geometry`,`Array`,`Math`,`Enumeration`,`Sorting` | Hard | Biweekly Contest 123 | +| 3028 | [Ant on the Boundary](/solution/3000-3099/3028.Ant%20on%20the%20Boundary/README_EN.md) | `Array`,`Prefix Sum`,`Simulation` | Easy | Weekly Contest 383 | +| 3029 | [Minimum Time to Revert Word to Initial State I](/solution/3000-3099/3029.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20I/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 383 | +| 3030 | [Find the Grid of Region Average](/solution/3000-3099/3030.Find%20the%20Grid%20of%20Region%20Average/README_EN.md) | `Array`,`Matrix` | Medium | Weekly Contest 383 | +| 3031 | [Minimum Time to Revert Word to Initial State II](/solution/3000-3099/3031.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20II/README_EN.md) | `String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 383 | +| 3032 | [Count Numbers With Unique Digits II](/solution/3000-3099/3032.Count%20Numbers%20With%20Unique%20Digits%20II/README_EN.md) | `Hash Table`,`Math`,`Dynamic Programming` | Easy | 🔒 | +| 3033 | [Modify the Matrix](/solution/3000-3099/3033.Modify%20the%20Matrix/README_EN.md) | `Array`,`Matrix` | Easy | Weekly Contest 384 | +| 3034 | [Number of Subarrays That Match a Pattern I](/solution/3000-3099/3034.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20I/README_EN.md) | `Array`,`String Matching`,`Hash Function`,`Rolling Hash` | Medium | Weekly Contest 384 | +| 3035 | [Maximum Palindromes After Operations](/solution/3000-3099/3035.Maximum%20Palindromes%20After%20Operations/README_EN.md) | `Greedy`,`Array`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 384 | +| 3036 | [Number of Subarrays That Match a Pattern II](/solution/3000-3099/3036.Number%20of%20Subarrays%20That%20Match%20a%20Pattern%20II/README_EN.md) | `Array`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 384 | +| 3037 | [Find Pattern in Infinite Stream II](/solution/3000-3099/3037.Find%20Pattern%20in%20Infinite%20Stream%20II/README_EN.md) | `Array`,`String Matching`,`Sliding Window`,`Hash Function`,`Rolling Hash` | Hard | 🔒 | +| 3038 | [Maximum Number of Operations With the Same Score I](/solution/3000-3099/3038.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20I/README_EN.md) | `Array`,`Simulation` | Easy | Biweekly Contest 124 | +| 3039 | [Apply Operations to Make String Empty](/solution/3000-3099/3039.Apply%20Operations%20to%20Make%20String%20Empty/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Sorting` | Medium | Biweekly Contest 124 | +| 3040 | [Maximum Number of Operations With the Same Score II](/solution/3000-3099/3040.Maximum%20Number%20of%20Operations%20With%20the%20Same%20Score%20II/README_EN.md) | `Memoization`,`Array`,`Dynamic Programming` | Medium | Biweekly Contest 124 | +| 3041 | [Maximize Consecutive Elements in an Array After Modification](/solution/3000-3099/3041.Maximize%20Consecutive%20Elements%20in%20an%20Array%20After%20Modification/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 124 | +| 3042 | [Count Prefix and Suffix Pairs I](/solution/3000-3099/3042.Count%20Prefix%20and%20Suffix%20Pairs%20I/README_EN.md) | `Trie`,`Array`,`String`,`String Matching`,`Hash Function`,`Rolling Hash` | Easy | Weekly Contest 385 | +| 3043 | [Find the Length of the Longest Common Prefix](/solution/3000-3099/3043.Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 385 | +| 3044 | [Most Frequent Prime](/solution/3000-3099/3044.Most%20Frequent%20Prime/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting`,`Enumeration`,`Matrix`,`Number Theory` | Medium | Weekly Contest 385 | +| 3045 | [Count Prefix and Suffix Pairs II](/solution/3000-3099/3045.Count%20Prefix%20and%20Suffix%20Pairs%20II/README_EN.md) | `Trie`,`Array`,`String`,`String Matching`,`Hash Function`,`Rolling Hash` | Hard | Weekly Contest 385 | +| 3046 | [Split the Array](/solution/3000-3099/3046.Split%20the%20Array/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 386 | +| 3047 | [Find the Largest Area of Square Inside Two Rectangles](/solution/3000-3099/3047.Find%20the%20Largest%20Area%20of%20Square%20Inside%20Two%20Rectangles/README_EN.md) | `Geometry`,`Array`,`Math` | Medium | Weekly Contest 386 | +| 3048 | [Earliest Second to Mark Indices I](/solution/3000-3099/3048.Earliest%20Second%20to%20Mark%20Indices%20I/README_EN.md) | `Array`,`Binary Search` | Medium | Weekly Contest 386 | +| 3049 | [Earliest Second to Mark Indices II](/solution/3000-3099/3049.Earliest%20Second%20to%20Mark%20Indices%20II/README_EN.md) | `Greedy`,`Array`,`Binary Search`,`Heap (Priority Queue)` | Hard | Weekly Contest 386 | +| 3050 | [Pizza Toppings Cost Analysis](/solution/3000-3099/3050.Pizza%20Toppings%20Cost%20Analysis/README_EN.md) | `Database` | Medium | 🔒 | +| 3051 | [Find Candidates for Data Scientist Position](/solution/3000-3099/3051.Find%20Candidates%20for%20Data%20Scientist%20Position/README_EN.md) | `Database` | Easy | 🔒 | +| 3052 | [Maximize Items](/solution/3000-3099/3052.Maximize%20Items/README_EN.md) | `Database` | Hard | 🔒 | +| 3053 | [Classifying Triangles by Lengths](/solution/3000-3099/3053.Classifying%20Triangles%20by%20Lengths/README_EN.md) | `Database` | Easy | 🔒 | +| 3054 | [Binary Tree Nodes](/solution/3000-3099/3054.Binary%20Tree%20Nodes/README_EN.md) | `Database` | Medium | 🔒 | +| 3055 | [Top Percentile Fraud](/solution/3000-3099/3055.Top%20Percentile%20Fraud/README_EN.md) | `Database` | Medium | 🔒 | +| 3056 | [Snaps Analysis](/solution/3000-3099/3056.Snaps%20Analysis/README_EN.md) | `Database` | Medium | 🔒 | +| 3057 | [Employees Project Allocation](/solution/3000-3099/3057.Employees%20Project%20Allocation/README_EN.md) | `Database` | Hard | 🔒 | +| 3058 | [Friends With No Mutual Friends](/solution/3000-3099/3058.Friends%20With%20No%20Mutual%20Friends/README_EN.md) | `Database` | Medium | 🔒 | +| 3059 | [Find All Unique Email Domains](/solution/3000-3099/3059.Find%20All%20Unique%20Email%20Domains/README_EN.md) | `Database` | Easy | 🔒 | +| 3060 | [User Activities within Time Bounds](/solution/3000-3099/3060.User%20Activities%20within%20Time%20Bounds/README_EN.md) | `Database` | Hard | 🔒 | +| 3061 | [Calculate Trapping Rain Water](/solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README_EN.md) | `Database` | Hard | 🔒 | +| 3062 | [Winner of the Linked List Game](/solution/3000-3099/3062.Winner%20of%20the%20Linked%20List%20Game/README_EN.md) | `Linked List` | Easy | 🔒 | +| 3063 | [Linked List Frequency](/solution/3000-3099/3063.Linked%20List%20Frequency/README_EN.md) | `Hash Table`,`Linked List`,`Counting` | Easy | 🔒 | +| 3064 | [Guess the Number Using Bitwise Questions I](/solution/3000-3099/3064.Guess%20the%20Number%20Using%20Bitwise%20Questions%20I/README_EN.md) | `Bit Manipulation`,`Interactive` | Medium | 🔒 | +| 3065 | [Minimum Operations to Exceed Threshold Value I](/solution/3000-3099/3065.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20I/README_EN.md) | `Array` | Easy | Biweekly Contest 125 | +| 3066 | [Minimum Operations to Exceed Threshold Value II](/solution/3000-3099/3066.Minimum%20Operations%20to%20Exceed%20Threshold%20Value%20II/README_EN.md) | `Array`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 125 | +| 3067 | [Count Pairs of Connectable Servers in a Weighted Tree Network](/solution/3000-3099/3067.Count%20Pairs%20of%20Connectable%20Servers%20in%20a%20Weighted%20Tree%20Network/README_EN.md) | `Tree`,`Depth-First Search`,`Array` | Medium | Biweekly Contest 125 | +| 3068 | [Find the Maximum Sum of Node Values](/solution/3000-3099/3068.Find%20the%20Maximum%20Sum%20of%20Node%20Values/README_EN.md) | `Greedy`,`Bit Manipulation`,`Tree`,`Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 125 | +| 3069 | [Distribute Elements Into Two Arrays I](/solution/3000-3099/3069.Distribute%20Elements%20Into%20Two%20Arrays%20I/README_EN.md) | `Array`,`Simulation` | Easy | Weekly Contest 387 | +| 3070 | [Count Submatrices with Top-Left Element and Sum Less Than k](/solution/3000-3099/3070.Count%20Submatrices%20with%20Top-Left%20Element%20and%20Sum%20Less%20Than%20k/README_EN.md) | `Array`,`Matrix`,`Prefix Sum` | Medium | Weekly Contest 387 | +| 3071 | [Minimum Operations to Write the Letter Y on a Grid](/solution/3000-3099/3071.Minimum%20Operations%20to%20Write%20the%20Letter%20Y%20on%20a%20Grid/README_EN.md) | `Array`,`Hash Table`,`Counting`,`Matrix` | Medium | Weekly Contest 387 | +| 3072 | [Distribute Elements Into Two Arrays II](/solution/3000-3099/3072.Distribute%20Elements%20Into%20Two%20Arrays%20II/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Simulation` | Hard | Weekly Contest 387 | +| 3073 | [Maximum Increasing Triplet Value](/solution/3000-3099/3073.Maximum%20Increasing%20Triplet%20Value/README_EN.md) | `Array`,`Ordered Set` | Medium | 🔒 | +| 3074 | [Apple Redistribution into Boxes](/solution/3000-3099/3074.Apple%20Redistribution%20into%20Boxes/README_EN.md) | `Greedy`,`Array`,`Sorting` | Easy | Weekly Contest 388 | +| 3075 | [Maximize Happiness of Selected Children](/solution/3000-3099/3075.Maximize%20Happiness%20of%20Selected%20Children/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 388 | +| 3076 | [Shortest Uncommon Substring in an Array](/solution/3000-3099/3076.Shortest%20Uncommon%20Substring%20in%20an%20Array/README_EN.md) | `Trie`,`Array`,`Hash Table`,`String` | Medium | Weekly Contest 388 | +| 3077 | [Maximum Strength of K Disjoint Subarrays](/solution/3000-3099/3077.Maximum%20Strength%20of%20K%20Disjoint%20Subarrays/README_EN.md) | `Array`,`Dynamic Programming`,`Prefix Sum` | Hard | Weekly Contest 388 | +| 3078 | [Match Alphanumerical Pattern in Matrix I](/solution/3000-3099/3078.Match%20Alphanumerical%20Pattern%20in%20Matrix%20I/README_EN.md) | `Array`,`Hash Table`,`String`,`Matrix` | Medium | 🔒 | +| 3079 | [Find the Sum of Encrypted Integers](/solution/3000-3099/3079.Find%20the%20Sum%20of%20Encrypted%20Integers/README_EN.md) | `Array`,`Math` | Easy | Biweekly Contest 126 | +| 3080 | [Mark Elements on Array by Performing Queries](/solution/3000-3099/3080.Mark%20Elements%20on%20Array%20by%20Performing%20Queries/README_EN.md) | `Array`,`Hash Table`,`Sorting`,`Simulation`,`Heap (Priority Queue)` | Medium | Biweekly Contest 126 | +| 3081 | [Replace Question Marks in String to Minimize Its Value](/solution/3000-3099/3081.Replace%20Question%20Marks%20in%20String%20to%20Minimize%20Its%20Value/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting`,`Heap (Priority Queue)` | Medium | Biweekly Contest 126 | +| 3082 | [Find the Sum of the Power of All Subsequences](/solution/3000-3099/3082.Find%20the%20Sum%20of%20the%20Power%20of%20All%20Subsequences/README_EN.md) | `Array`,`Dynamic Programming` | Hard | Biweekly Contest 126 | +| 3083 | [Existence of a Substring in a String and Its Reverse](/solution/3000-3099/3083.Existence%20of%20a%20Substring%20in%20a%20String%20and%20Its%20Reverse/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 389 | +| 3084 | [Count Substrings Starting and Ending with Given Character](/solution/3000-3099/3084.Count%20Substrings%20Starting%20and%20Ending%20with%20Given%20Character/README_EN.md) | `Math`,`String`,`Counting` | Medium | Weekly Contest 389 | +| 3085 | [Minimum Deletions to Make String K-Special](/solution/3000-3099/3085.Minimum%20Deletions%20to%20Make%20String%20K-Special/README_EN.md) | `Greedy`,`Hash Table`,`String`,`Counting`,`Sorting` | Medium | Weekly Contest 389 | +| 3086 | [Minimum Moves to Pick K Ones](/solution/3000-3099/3086.Minimum%20Moves%20to%20Pick%20K%20Ones/README_EN.md) | `Greedy`,`Array`,`Prefix Sum`,`Sliding Window` | Hard | Weekly Contest 389 | +| 3087 | [Find Trending Hashtags](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README_EN.md) | `Database` | Medium | 🔒 | +| 3088 | [Make String Anti-palindrome](/solution/3000-3099/3088.Make%20String%20Anti-palindrome/README_EN.md) | `Greedy`,`String`,`Sorting` | Hard | 🔒 | +| 3089 | [Find Bursty Behavior](/solution/3000-3099/3089.Find%20Bursty%20Behavior/README_EN.md) | `Database` | Medium | 🔒 | +| 3090 | [Maximum Length Substring With Two Occurrences](/solution/3000-3099/3090.Maximum%20Length%20Substring%20With%20Two%20Occurrences/README_EN.md) | `Hash Table`,`String`,`Sliding Window` | Easy | Weekly Contest 390 | +| 3091 | [Apply Operations to Make Sum of Array Greater Than or Equal to k](/solution/3000-3099/3091.Apply%20Operations%20to%20Make%20Sum%20of%20Array%20Greater%20Than%20or%20Equal%20to%20k/README_EN.md) | `Greedy`,`Math`,`Enumeration` | Medium | Weekly Contest 390 | +| 3092 | [Most Frequent IDs](/solution/3000-3099/3092.Most%20Frequent%20IDs/README_EN.md) | `Array`,`Hash Table`,`Ordered Set`,`Heap (Priority Queue)` | Medium | Weekly Contest 390 | +| 3093 | [Longest Common Suffix Queries](/solution/3000-3099/3093.Longest%20Common%20Suffix%20Queries/README_EN.md) | `Trie`,`Array`,`String` | Hard | Weekly Contest 390 | +| 3094 | [Guess the Number Using Bitwise Questions II](/solution/3000-3099/3094.Guess%20the%20Number%20Using%20Bitwise%20Questions%20II/README_EN.md) | `Bit Manipulation`,`Interactive` | Medium | 🔒 | +| 3095 | [Shortest Subarray With OR at Least K I](/solution/3000-3099/3095.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20I/README_EN.md) | `Bit Manipulation`,`Array`,`Sliding Window` | Easy | Biweekly Contest 127 | +| 3096 | [Minimum Levels to Gain More Points](/solution/3000-3099/3096.Minimum%20Levels%20to%20Gain%20More%20Points/README_EN.md) | `Array`,`Prefix Sum` | Medium | Biweekly Contest 127 | +| 3097 | [Shortest Subarray With OR at Least K II](/solution/3000-3099/3097.Shortest%20Subarray%20With%20OR%20at%20Least%20K%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Sliding Window` | Medium | Biweekly Contest 127 | +| 3098 | [Find the Sum of Subsequence Powers](/solution/3000-3099/3098.Find%20the%20Sum%20of%20Subsequence%20Powers/README_EN.md) | `Array`,`Dynamic Programming`,`Sorting` | Hard | Biweekly Contest 127 | +| 3099 | [Harshad Number](/solution/3000-3099/3099.Harshad%20Number/README_EN.md) | `Math` | Easy | Weekly Contest 391 | +| 3100 | [Water Bottles II](/solution/3100-3199/3100.Water%20Bottles%20II/README_EN.md) | `Math`,`Simulation` | Medium | Weekly Contest 391 | +| 3101 | [Count Alternating Subarrays](/solution/3100-3199/3101.Count%20Alternating%20Subarrays/README_EN.md) | `Array`,`Math` | Medium | Weekly Contest 391 | +| 3102 | [Minimize Manhattan Distances](/solution/3100-3199/3102.Minimize%20Manhattan%20Distances/README_EN.md) | `Geometry`,`Array`,`Math`,`Ordered Set`,`Sorting` | Hard | Weekly Contest 391 | +| 3103 | [Find Trending Hashtags II](/solution/3100-3199/3103.Find%20Trending%20Hashtags%20II/README_EN.md) | `Database` | Hard | 🔒 | +| 3104 | [Find Longest Self-Contained Substring](/solution/3100-3199/3104.Find%20Longest%20Self-Contained%20Substring/README_EN.md) | `Hash Table`,`String`,`Binary Search`,`Prefix Sum` | Hard | 🔒 | +| 3105 | [Longest Strictly Increasing or Strictly Decreasing Subarray](/solution/3100-3199/3105.Longest%20Strictly%20Increasing%20or%20Strictly%20Decreasing%20Subarray/README_EN.md) | `Array` | Easy | Weekly Contest 392 | +| 3106 | [Lexicographically Smallest String After Operations With Constraint](/solution/3100-3199/3106.Lexicographically%20Smallest%20String%20After%20Operations%20With%20Constraint/README_EN.md) | `Greedy`,`String` | Medium | Weekly Contest 392 | +| 3107 | [Minimum Operations to Make Median of Array Equal to K](/solution/3100-3199/3107.Minimum%20Operations%20to%20Make%20Median%20of%20Array%20Equal%20to%20K/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Weekly Contest 392 | +| 3108 | [Minimum Cost Walk in Weighted Graph](/solution/3100-3199/3108.Minimum%20Cost%20Walk%20in%20Weighted%20Graph/README_EN.md) | `Bit Manipulation`,`Union Find`,`Graph`,`Array` | Hard | Weekly Contest 392 | +| 3109 | [Find the Index of Permutation](/solution/3100-3199/3109.Find%20the%20Index%20of%20Permutation/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search`,`Divide and Conquer`,`Ordered Set`,`Merge Sort` | Medium | 🔒 | +| 3110 | [Score of a String](/solution/3100-3199/3110.Score%20of%20a%20String/README_EN.md) | `String` | Easy | Biweekly Contest 128 | +| 3111 | [Minimum Rectangles to Cover Points](/solution/3100-3199/3111.Minimum%20Rectangles%20to%20Cover%20Points/README_EN.md) | `Greedy`,`Array`,`Sorting` | Medium | Biweekly Contest 128 | +| 3112 | [Minimum Time to Visit Disappearing Nodes](/solution/3100-3199/3112.Minimum%20Time%20to%20Visit%20Disappearing%20Nodes/README_EN.md) | `Graph`,`Array`,`Shortest Path`,`Heap (Priority Queue)` | Medium | Biweekly Contest 128 | +| 3113 | [Find the Number of Subarrays Where Boundary Elements Are Maximum](/solution/3100-3199/3113.Find%20the%20Number%20of%20Subarrays%20Where%20Boundary%20Elements%20Are%20Maximum/README_EN.md) | `Stack`,`Array`,`Binary Search`,`Monotonic Stack` | Hard | Biweekly Contest 128 | +| 3114 | [Latest Time You Can Obtain After Replacing Characters](/solution/3100-3199/3114.Latest%20Time%20You%20Can%20Obtain%20After%20Replacing%20Characters/README_EN.md) | `String`,`Enumeration` | Easy | Weekly Contest 393 | +| 3115 | [Maximum Prime Difference](/solution/3100-3199/3115.Maximum%20Prime%20Difference/README_EN.md) | `Array`,`Math`,`Number Theory` | Medium | Weekly Contest 393 | +| 3116 | [Kth Smallest Amount With Single Denomination Combination](/solution/3100-3199/3116.Kth%20Smallest%20Amount%20With%20Single%20Denomination%20Combination/README_EN.md) | `Bit Manipulation`,`Array`,`Math`,`Binary Search`,`Combinatorics`,`Number Theory` | Hard | Weekly Contest 393 | +| 3117 | [Minimum Sum of Values by Dividing Array](/solution/3100-3199/3117.Minimum%20Sum%20of%20Values%20by%20Dividing%20Array/README_EN.md) | `Bit Manipulation`,`Segment Tree`,`Queue`,`Array`,`Binary Search`,`Dynamic Programming` | Hard | Weekly Contest 393 | +| 3118 | [Friday Purchase III](/solution/3100-3199/3118.Friday%20Purchase%20III/README_EN.md) | `Database` | Medium | 🔒 | +| 3119 | [Maximum Number of Potholes That Can Be Fixed](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README_EN.md) | `Greedy`,`String`,`Sorting` | Medium | 🔒 | +| 3120 | [Count the Number of Special Characters I](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 394 | +| 3121 | [Count the Number of Special Characters II](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README_EN.md) | `Hash Table`,`String` | Medium | Weekly Contest 394 | +| 3122 | [Minimum Number of Operations to Satisfy Conditions](/solution/3100-3199/3122.Minimum%20Number%20of%20Operations%20to%20Satisfy%20Conditions/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 394 | +| 3123 | [Find Edges in Shortest Paths](/solution/3100-3199/3123.Find%20Edges%20in%20Shortest%20Paths/README_EN.md) | `Depth-First Search`,`Breadth-First Search`,`Graph`,`Shortest Path`,`Heap (Priority Queue)` | Hard | Weekly Contest 394 | +| 3124 | [Find Longest Calls](/solution/3100-3199/3124.Find%20Longest%20Calls/README_EN.md) | `Database` | Medium | 🔒 | +| 3125 | [Maximum Number That Makes Result of Bitwise AND Zero](/solution/3100-3199/3125.Maximum%20Number%20That%20Makes%20Result%20of%20Bitwise%20AND%20Zero/README_EN.md) | `Greedy`,`String`,`Sorting` | Medium | 🔒 | +| 3126 | [Server Utilization Time](/solution/3100-3199/3126.Server%20Utilization%20Time/README_EN.md) | `Database` | Medium | 🔒 | +| 3127 | [Make a Square with the Same Color](/solution/3100-3199/3127.Make%20a%20Square%20with%20the%20Same%20Color/README_EN.md) | `Array`,`Enumeration`,`Matrix` | Easy | Biweekly Contest 129 | +| 3128 | [Right Triangles](/solution/3100-3199/3128.Right%20Triangles/README_EN.md) | `Array`,`Hash Table`,`Math`,`Combinatorics`,`Counting` | Medium | Biweekly Contest 129 | +| 3129 | [Find All Possible Stable Binary Arrays I](/solution/3100-3199/3129.Find%20All%20Possible%20Stable%20Binary%20Arrays%20I/README_EN.md) | `Dynamic Programming`,`Prefix Sum` | Medium | Biweekly Contest 129 | +| 3130 | [Find All Possible Stable Binary Arrays II](/solution/3100-3199/3130.Find%20All%20Possible%20Stable%20Binary%20Arrays%20II/README_EN.md) | `Dynamic Programming`,`Prefix Sum` | Hard | Biweekly Contest 129 | +| 3131 | [Find the Integer Added to Array I](/solution/3100-3199/3131.Find%20the%20Integer%20Added%20to%20Array%20I/README_EN.md) | `Array` | Easy | Weekly Contest 395 | +| 3132 | [Find the Integer Added to Array II](/solution/3100-3199/3132.Find%20the%20Integer%20Added%20to%20Array%20II/README_EN.md) | `Array`,`Two Pointers`,`Enumeration`,`Sorting` | Medium | Weekly Contest 395 | +| 3133 | [Minimum Array End](/solution/3100-3199/3133.Minimum%20Array%20End/README_EN.md) | `Bit Manipulation` | Medium | Weekly Contest 395 | +| 3134 | [Find the Median of the Uniqueness Array](/solution/3100-3199/3134.Find%20the%20Median%20of%20the%20Uniqueness%20Array/README_EN.md) | `Array`,`Hash Table`,`Binary Search`,`Sliding Window` | Hard | Weekly Contest 395 | +| 3135 | [Equalize Strings by Adding or Removing Characters at Ends](/solution/3100-3199/3135.Equalize%20Strings%20by%20Adding%20or%20Removing%20Characters%20at%20Ends/README_EN.md) | `String`,`Binary Search`,`Dynamic Programming`,`Sliding Window`,`Hash Function` | Medium | 🔒 | +| 3136 | [Valid Word](/solution/3100-3199/3136.Valid%20Word/README_EN.md) | `String` | Easy | Weekly Contest 396 | +| 3137 | [Minimum Number of Operations to Make Word K-Periodic](/solution/3100-3199/3137.Minimum%20Number%20of%20Operations%20to%20Make%20Word%20K-Periodic/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 396 | +| 3138 | [Minimum Length of Anagram Concatenation](/solution/3100-3199/3138.Minimum%20Length%20of%20Anagram%20Concatenation/README_EN.md) | `Hash Table`,`String`,`Counting` | Medium | Weekly Contest 396 | +| 3139 | [Minimum Cost to Equalize Array](/solution/3100-3199/3139.Minimum%20Cost%20to%20Equalize%20Array/README_EN.md) | `Greedy`,`Array`,`Enumeration` | Hard | Weekly Contest 396 | +| 3140 | [Consecutive Available Seats II](/solution/3100-3199/3140.Consecutive%20Available%20Seats%20II/README_EN.md) | `Database` | Medium | 🔒 | +| 3141 | [Maximum Hamming Distances](/solution/3100-3199/3141.Maximum%20Hamming%20Distances/README_EN.md) | `Bit Manipulation`,`Breadth-First Search`,`Array` | Hard | 🔒 | +| 3142 | [Check if Grid Satisfies Conditions](/solution/3100-3199/3142.Check%20if%20Grid%20Satisfies%20Conditions/README_EN.md) | `Array`,`Matrix` | Easy | Biweekly Contest 130 | +| 3143 | [Maximum Points Inside the Square](/solution/3100-3199/3143.Maximum%20Points%20Inside%20the%20Square/README_EN.md) | `Array`,`Hash Table`,`String`,`Binary Search`,`Sorting` | Medium | Biweekly Contest 130 | +| 3144 | [Minimum Substring Partition of Equal Character Frequency](/solution/3100-3199/3144.Minimum%20Substring%20Partition%20of%20Equal%20Character%20Frequency/README_EN.md) | `Hash Table`,`String`,`Dynamic Programming`,`Counting` | Medium | Biweekly Contest 130 | +| 3145 | [Find Products of Elements of Big Array](/solution/3100-3199/3145.Find%20Products%20of%20Elements%20of%20Big%20Array/README_EN.md) | `Bit Manipulation`,`Array`,`Binary Search` | Hard | Biweekly Contest 130 | +| 3146 | [Permutation Difference between Two Strings](/solution/3100-3199/3146.Permutation%20Difference%20between%20Two%20Strings/README_EN.md) | `Hash Table`,`String` | Easy | Weekly Contest 397 | +| 3147 | [Taking Maximum Energy From the Mystic Dungeon](/solution/3100-3199/3147.Taking%20Maximum%20Energy%20From%20the%20Mystic%20Dungeon/README_EN.md) | `Array`,`Prefix Sum` | Medium | Weekly Contest 397 | +| 3148 | [Maximum Difference Score in a Grid](/solution/3100-3199/3148.Maximum%20Difference%20Score%20in%20a%20Grid/README_EN.md) | `Array`,`Dynamic Programming`,`Matrix` | Medium | Weekly Contest 397 | +| 3149 | [Find the Minimum Cost Array Permutation](/solution/3100-3199/3149.Find%20the%20Minimum%20Cost%20Array%20Permutation/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask` | Hard | Weekly Contest 397 | +| 3150 | [Invalid Tweets II](/solution/3100-3199/3150.Invalid%20Tweets%20II/README_EN.md) | `Database` | Easy | 🔒 | +| 3151 | [Special Array I](/solution/3100-3199/3151.Special%20Array%20I/README_EN.md) | `Array` | Easy | Weekly Contest 398 | +| 3152 | [Special Array II](/solution/3100-3199/3152.Special%20Array%20II/README_EN.md) | `Array`,`Binary Search`,`Prefix Sum` | Medium | Weekly Contest 398 | +| 3153 | [Sum of Digit Differences of All Pairs](/solution/3100-3199/3153.Sum%20of%20Digit%20Differences%20of%20All%20Pairs/README_EN.md) | `Array`,`Hash Table`,`Math`,`Counting` | Medium | Weekly Contest 398 | +| 3154 | [Find Number of Ways to Reach the K-th Stair](/solution/3100-3199/3154.Find%20Number%20of%20Ways%20to%20Reach%20the%20K-th%20Stair/README_EN.md) | `Bit Manipulation`,`Memoization`,`Math`,`Dynamic Programming`,`Combinatorics` | Hard | Weekly Contest 398 | +| 3155 | [Maximum Number of Upgradable Servers](/solution/3100-3199/3155.Maximum%20Number%20of%20Upgradable%20Servers/README_EN.md) | `Array`,`Math`,`Binary Search` | Medium | 🔒 | +| 3156 | [Employee Task Duration and Concurrent Tasks](/solution/3100-3199/3156.Employee%20Task%20Duration%20and%20Concurrent%20Tasks/README_EN.md) | `Database` | Hard | 🔒 | +| 3157 | [Find the Level of Tree with Minimum Sum](/solution/3100-3199/3157.Find%20the%20Level%20of%20Tree%20with%20Minimum%20Sum/README_EN.md) | `Tree`,`Depth-First Search`,`Breadth-First Search`,`Binary Tree` | Medium | 🔒 | +| 3158 | [Find the XOR of Numbers Which Appear Twice](/solution/3100-3199/3158.Find%20the%20XOR%20of%20Numbers%20Which%20Appear%20Twice/README_EN.md) | `Bit Manipulation`,`Array`,`Hash Table` | Easy | Biweekly Contest 131 | +| 3159 | [Find Occurrences of an Element in an Array](/solution/3100-3199/3159.Find%20Occurrences%20of%20an%20Element%20in%20an%20Array/README_EN.md) | `Array`,`Hash Table` | Medium | Biweekly Contest 131 | +| 3160 | [Find the Number of Distinct Colors Among the Balls](/solution/3100-3199/3160.Find%20the%20Number%20of%20Distinct%20Colors%20Among%20the%20Balls/README_EN.md) | `Array`,`Hash Table`,`Simulation` | Medium | Biweekly Contest 131 | +| 3161 | [Block Placement Queries](/solution/3100-3199/3161.Block%20Placement%20Queries/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array`,`Binary Search` | Hard | Biweekly Contest 131 | +| 3162 | [Find the Number of Good Pairs I](/solution/3100-3199/3162.Find%20the%20Number%20of%20Good%20Pairs%20I/README_EN.md) | `Array`,`Hash Table` | Easy | Weekly Contest 399 | +| 3163 | [String Compression III](/solution/3100-3199/3163.String%20Compression%20III/README_EN.md) | `String` | Medium | Weekly Contest 399 | +| 3164 | [Find the Number of Good Pairs II](/solution/3100-3199/3164.Find%20the%20Number%20of%20Good%20Pairs%20II/README_EN.md) | `Array`,`Hash Table` | Medium | Weekly Contest 399 | +| 3165 | [Maximum Sum of Subsequence With Non-adjacent Elements](/solution/3100-3199/3165.Maximum%20Sum%20of%20Subsequence%20With%20Non-adjacent%20Elements/README_EN.md) | `Segment Tree`,`Array`,`Divide and Conquer`,`Dynamic Programming` | Hard | Weekly Contest 399 | +| 3166 | [Calculate Parking Fees and Duration](/solution/3100-3199/3166.Calculate%20Parking%20Fees%20and%20Duration/README_EN.md) | `Database` | Medium | 🔒 | +| 3167 | [Better Compression of String](/solution/3100-3199/3167.Better%20Compression%20of%20String/README_EN.md) | `Hash Table`,`String`,`Counting`,`Sorting` | Medium | 🔒 | +| 3168 | [Minimum Number of Chairs in a Waiting Room](/solution/3100-3199/3168.Minimum%20Number%20of%20Chairs%20in%20a%20Waiting%20Room/README_EN.md) | `String`,`Simulation` | Easy | Weekly Contest 400 | +| 3169 | [Count Days Without Meetings](/solution/3100-3199/3169.Count%20Days%20Without%20Meetings/README_EN.md) | `Array`,`Sorting` | Medium | Weekly Contest 400 | +| 3170 | [Lexicographically Minimum String After Removing Stars](/solution/3100-3199/3170.Lexicographically%20Minimum%20String%20After%20Removing%20Stars/README_EN.md) | `Stack`,`Greedy`,`Hash Table`,`String`,`Heap (Priority Queue)` | Medium | Weekly Contest 400 | +| 3171 | [Find Subarray With Bitwise OR Closest to K](/solution/3100-3199/3171.Find%20Subarray%20With%20Bitwise%20OR%20Closest%20to%20K/README_EN.md) | `Bit Manipulation`,`Segment Tree`,`Array`,`Binary Search` | Hard | Weekly Contest 400 | +| 3172 | [Second Day Verification](/solution/3100-3199/3172.Second%20Day%20Verification/README_EN.md) | `Database` | Easy | 🔒 | +| 3173 | [Bitwise OR of Adjacent Elements](/solution/3100-3199/3173.Bitwise%20OR%20of%20Adjacent%20Elements/README_EN.md) | `Bit Manipulation`,`Array` | Easy | 🔒 | +| 3174 | [Clear Digits](/solution/3100-3199/3174.Clear%20Digits/README_EN.md) | `Hash Table`,`String`,`Simulation` | Easy | Biweekly Contest 132 | +| 3175 | [Find The First Player to win K Games in a Row](/solution/3100-3199/3175.Find%20The%20First%20Player%20to%20win%20K%20Games%20in%20a%20Row/README_EN.md) | `Array`,`Simulation` | Medium | Biweekly Contest 132 | +| 3176 | [Find the Maximum Length of a Good Subsequence I](/solution/3100-3199/3176.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20I/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Medium | Biweekly Contest 132 | +| 3177 | [Find the Maximum Length of a Good Subsequence II](/solution/3100-3199/3177.Find%20the%20Maximum%20Length%20of%20a%20Good%20Subsequence%20II/README_EN.md) | `Array`,`Hash Table`,`Dynamic Programming` | Hard | Biweekly Contest 132 | +| 3178 | [Find the Child Who Has the Ball After K Seconds](/solution/3100-3199/3178.Find%20the%20Child%20Who%20Has%20the%20Ball%20After%20K%20Seconds/README_EN.md) | `Math`,`Simulation` | Easy | Weekly Contest 401 | +| 3179 | [Find the N-th Value After K Seconds](/solution/3100-3199/3179.Find%20the%20N-th%20Value%20After%20K%20Seconds/README_EN.md) | `Array`,`Math`,`Combinatorics`,`Prefix Sum`,`Simulation` | Medium | Weekly Contest 401 | +| 3180 | [Maximum Total Reward Using Operations I](/solution/3100-3199/3180.Maximum%20Total%20Reward%20Using%20Operations%20I/README_EN.md) | `Array`,`Dynamic Programming` | Medium | Weekly Contest 401 | +| 3181 | [Maximum Total Reward Using Operations II](/solution/3100-3199/3181.Maximum%20Total%20Reward%20Using%20Operations%20II/README_EN.md) | `Bit Manipulation`,`Array`,`Dynamic Programming` | Hard | Weekly Contest 401 | +| 3182 | [Find Top Scoring Students](/solution/3100-3199/3182.Find%20Top%20Scoring%20Students/README_EN.md) | `Database` | Medium | 🔒 | +| 3183 | [The Number of Ways to Make the Sum](/solution/3100-3199/3183.The%20Number%20of%20Ways%20to%20Make%20the%20Sum/README_EN.md) | `Array`,`Dynamic Programming` | Medium | 🔒 | +| 3184 | [Count Pairs That Form a Complete Day I](/solution/3100-3199/3184.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20I/README_EN.md) | `Array`,`Hash Table`,`Counting` | Easy | Weekly Contest 402 | +| 3185 | [Count Pairs That Form a Complete Day II](/solution/3100-3199/3185.Count%20Pairs%20That%20Form%20a%20Complete%20Day%20II/README_EN.md) | `Array`,`Hash Table`,`Counting` | Medium | Weekly Contest 402 | +| 3186 | [Maximum Total Damage With Spell Casting](/solution/3100-3199/3186.Maximum%20Total%20Damage%20With%20Spell%20Casting/README_EN.md) | `Array`,`Hash Table`,`Two Pointers`,`Binary Search`,`Dynamic Programming`,`Counting`,`Sorting` | Medium | Weekly Contest 402 | +| 3187 | [Peaks in Array](/solution/3100-3199/3187.Peaks%20in%20Array/README_EN.md) | `Binary Indexed Tree`,`Segment Tree`,`Array` | Hard | Weekly Contest 402 | +| 3188 | [Find Top Scoring Students II](/solution/3100-3199/3188.Find%20Top%20Scoring%20Students%20II/README_EN.md) | | Hard | 🔒 | +| 3189 | [Minimum Moves to Get a Peaceful Board](/solution/3100-3199/3189.Minimum%20Moves%20to%20Get%20a%20Peaceful%20Board/README_EN.md) | | Medium | 🔒 | + +## Copyright + +The copyright of this project belongs to [Doocs](https://github.com/doocs) community. For commercial reprints, please contact [@yanglbme](mailto:contact@yanglibin.info) for authorization. For non-commercial reprints, please indicate the source. + +## Contact Us + +We welcome everyone to add @yanglbme's personal WeChat (WeChat ID: YLB0109), with the note "leetcode". In the future, we will create algorithm and technology related discussion groups, where we can learn and share experiences together, and make progress together. + +| | +| --------------------------------------------------------------------------------------------------------------------------------- | + +## License + +This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. diff --git a/solution/main.py b/solution/main.py index 76acc68182814..0306fe83523ac 100644 --- a/solution/main.py +++ b/solution/main.py @@ -1,3 +1,5 @@ +import platform +import subprocess import time from datetime import timezone, timedelta, datetime @@ -49,7 +51,7 @@ def get_all_questions(self, retry: int = 3) -> List: ) return resp.json()["stat_status_pairs"] except Exception as e: - print('get_all_questions', e) + print("get_all_questions", e) time.sleep(2) return self.get_all_questions(retry - 1) if retry > 0 else [] @@ -126,8 +128,8 @@ def get_question_detail_en(self, question_title_slug: str, retry: int = 3) -> di res = resp.json() return res["data"]["question"] or {} except Exception as e: - print('get_question_detail_en', e) - if 'is not defined' in str(e): + print("get_question_detail_en", e) + if "is not defined" in str(e): return {} time.sleep(2) return {} @@ -198,7 +200,7 @@ def get_question_detail(self, question_title_slug: str, retry: int = 3) -> dict: res = resp.json() return res["data"]["question"] or {} except Exception as e: - print('get_question_detail', e) + print("get_question_detail", e) time.sleep(2) return {} @@ -373,6 +375,55 @@ def get_contests(fetch_new=True) -> List: ######################################################################################## +def format_rust_files_linux(): + # The find command to locate and format all .rs files in Linux + find_command = 'find . -name "*.rs" -exec rustfmt {} \\;' + + # Execute the command + process = subprocess.Popen( + find_command, + shell=True, + stdout=subprocess.PIPE, + stderr=subprocess.PIPE, + text=True, + ) + + # Get the output and errors + stdout, stderr = process.communicate() + + if process.returncode == 0: + print("Rust files formatted successfully on Linux!") + print(stdout) + else: + print("Error formatting Rust files on Linux:") + print(stderr) + + +def format_rust_files_windows(): + # PowerShell command to format all .rs files recursively in Windows + ps_command = ( + "Get-ChildItem -Recurse -Filter *.rs | ForEach-Object { rustfmt $_.FullName }" + ) + + # Execute the PowerShell command + process = subprocess.Popen( + ["powershell", "-Command", ps_command], + stdout=subprocess.PIPE, + stderr=subprocess.PIPE, + text=True, + ) + + # Get the output and errors + stdout, stderr = process.communicate() + + if process.returncode == 0: + print("Rust files formatted successfully on Windows!") + print(stdout) + else: + print("Error formatting Rust files on Windows:") + print(stderr) + + def run(): # 加载 cookies cookie_cn, cookie_en = load_cookies() @@ -393,8 +444,8 @@ def run(): slug = q["stat"]["question__title_slug"] qid = q["stat"]["frontend_question_id"] except: - slug = q['titleSlug'] - qid = int(q['frontendQuestionId']) + slug = q["titleSlug"] + qid = int(q["frontendQuestionId"]) if slug in question_details: continue detail = spider.get_question_detail( @@ -452,6 +503,13 @@ def run(): # 格式化 os.system('cd .. && npx prettier --write "**/*.{md,js,ts,php,sql}"') + # 格式化 rust 代码 + # 判断当前是 windows 还是 linux + if platform.system() == "Linux": + format_rust_files_linux() + elif platform.system() == "Windows": + format_rust_files_windows() + if __name__ == "__main__": run()