diff --git a/solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/README.md b/solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/README.md similarity index 92% rename from solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/README.md rename to solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/README.md index c626bbeccbab7..384e7acf0ee4b 100644 --- a/solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/README.md +++ b/solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/README.md @@ -1,6 +1,6 @@ -# [10031. 大于等于顺序前缀和的最小缺失整数](https://leetcode.cn/problems/smallest-missing-integer-greater-than-sequential-prefix-sum) +# [2996. 大于等于顺序前缀和的最小缺失整数](https://leetcode.cn/problems/smallest-missing-integer-greater-than-sequential-prefix-sum) -[English Version](/solution/10000-10099/10031.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README_EN.md) +[English Version](/solution/2900-2999/2996.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README_EN.md) ## 题目描述 diff --git a/solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/README_EN.md b/solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/README_EN.md similarity index 92% rename from solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/README_EN.md rename to solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/README_EN.md index 9667644b4f00a..f06cd41a40f6b 100644 --- a/solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/README_EN.md +++ b/solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/README_EN.md @@ -1,6 +1,6 @@ -# [10031. Smallest Missing Integer Greater Than Sequential Prefix Sum](https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum) +# [2996. Smallest Missing Integer Greater Than Sequential Prefix Sum](https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum) -[中文文档](/solution/10000-10099/10031.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README.md) +[中文文档](/solution/2900-2999/2996.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README.md) ## Description diff --git a/solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.cpp b/solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.cpp similarity index 100% rename from solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.cpp rename to solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.cpp diff --git a/solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.go b/solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.go similarity index 100% rename from solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.go rename to solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.go diff --git a/solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.java b/solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.java similarity index 100% rename from solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.java rename to solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.java diff --git a/solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.py b/solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.py similarity index 100% rename from solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.py rename to solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.py diff --git a/solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.ts b/solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.ts similarity index 100% rename from solution/10000-10099/10031.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.ts rename to solution/2900-2999/2996.Smallest Missing Integer Greater Than Sequential Prefix Sum/Solution.ts diff --git a/solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/README.md b/solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/README.md similarity index 93% rename from solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/README.md rename to solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/README.md index 9630bdd603fe3..16eee48b1c799 100644 --- a/solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/README.md +++ b/solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/README.md @@ -1,6 +1,6 @@ -# [10032. 使数组异或和等于 K 的最少操作次数](https://leetcode.cn/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k) +# [2997. 使数组异或和等于 K 的最少操作次数](https://leetcode.cn/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k) -[English Version](/solution/10000-10099/10032.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README_EN.md) +[English Version](/solution/2900-2999/2997.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README_EN.md) ## 题目描述 diff --git a/solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/README_EN.md b/solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/README_EN.md similarity index 92% rename from solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/README_EN.md rename to solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/README_EN.md index 1d44e8a3661ef..b6cd68926d95d 100644 --- a/solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/README_EN.md +++ b/solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/README_EN.md @@ -1,6 +1,6 @@ -# [10032. Minimum Number of Operations to Make Array XOR Equal to K](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k) +# [2997. Minimum Number of Operations to Make Array XOR Equal to K](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k) -[中文文档](/solution/10000-10099/10032.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README.md) +[中文文档](/solution/2900-2999/2997.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README.md) ## Description diff --git a/solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/Solution.cpp b/solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/Solution.cpp similarity index 100% rename from solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/Solution.cpp rename to solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/Solution.cpp diff --git a/solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/Solution.go b/solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/Solution.go similarity index 100% rename from solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/Solution.go rename to solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/Solution.go diff --git a/solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/Solution.java b/solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/Solution.java similarity index 100% rename from solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/Solution.java rename to solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/Solution.java diff --git a/solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/Solution.py b/solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/Solution.py similarity index 100% rename from solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/Solution.py rename to solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/Solution.py diff --git a/solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/Solution.ts b/solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/Solution.ts similarity index 100% rename from solution/10000-10099/10032.Minimum Number of Operations to Make Array XOR Equal to K/Solution.ts rename to solution/2900-2999/2997.Minimum Number of Operations to Make Array XOR Equal to K/Solution.ts diff --git a/solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/README.md b/solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/README.md similarity index 94% rename from solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/README.md rename to solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/README.md index ed84d0115a5e6..b5e6052d49b48 100644 --- a/solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/README.md +++ b/solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/README.md @@ -1,6 +1,6 @@ -# [10033. 使 X 和 Y 相等的最少操作次数](https://leetcode.cn/problems/minimum-number-of-operations-to-make-x-and-y-equal) +# [2998. 使 X 和 Y 相等的最少操作次数](https://leetcode.cn/problems/minimum-number-of-operations-to-make-x-and-y-equal) -[English Version](/solution/10000-10099/10033.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README_EN.md) +[English Version](/solution/2900-2999/2998.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README_EN.md) ## 题目描述 diff --git a/solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/README_EN.md b/solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/README_EN.md similarity index 94% rename from solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/README_EN.md rename to solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/README_EN.md index e88607cad372f..982f265653788 100644 --- a/solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/README_EN.md +++ b/solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/README_EN.md @@ -1,6 +1,6 @@ -# [10033. Minimum Number of Operations to Make X and Y Equal](https://leetcode.com/problems/minimum-number-of-operations-to-make-x-and-y-equal) +# [2998. Minimum Number of Operations to Make X and Y Equal](https://leetcode.com/problems/minimum-number-of-operations-to-make-x-and-y-equal) -[中文文档](/solution/10000-10099/10033.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README.md) +[中文文档](/solution/2900-2999/2998.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README.md) ## Description diff --git a/solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/Solution.cpp b/solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/Solution.cpp similarity index 100% rename from solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/Solution.cpp rename to solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/Solution.cpp diff --git a/solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/Solution.go b/solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/Solution.go similarity index 100% rename from solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/Solution.go rename to solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/Solution.go diff --git a/solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/Solution.java b/solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/Solution.java similarity index 100% rename from solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/Solution.java rename to solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/Solution.java diff --git a/solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/Solution.py b/solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/Solution.py similarity index 100% rename from solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/Solution.py rename to solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/Solution.py diff --git a/solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/Solution.ts b/solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/Solution.ts similarity index 100% rename from solution/10000-10099/10033.Minimum Number of Operations to Make X and Y Equal/Solution.ts rename to solution/2900-2999/2998.Minimum Number of Operations to Make X and Y Equal/Solution.ts diff --git a/solution/10000-10099/10034.Count the Number of Powerful Integers/README.md b/solution/2900-2999/2999.Count the Number of Powerful Integers/README.md similarity index 97% rename from solution/10000-10099/10034.Count the Number of Powerful Integers/README.md rename to solution/2900-2999/2999.Count the Number of Powerful Integers/README.md index 9961b58c40a81..cd55b8f1d0e54 100644 --- a/solution/10000-10099/10034.Count the Number of Powerful Integers/README.md +++ b/solution/2900-2999/2999.Count the Number of Powerful Integers/README.md @@ -1,6 +1,6 @@ -# [10034. 统计强大整数的数目](https://leetcode.cn/problems/count-the-number-of-powerful-integers) +# [2999. 统计强大整数的数目](https://leetcode.cn/problems/count-the-number-of-powerful-integers) -[English Version](/solution/10000-10099/10034.Count%20the%20Number%20of%20Powerful%20Integers/README_EN.md) +[English Version](/solution/2900-2999/2999.Count%20the%20Number%20of%20Powerful%20Integers/README_EN.md) ## 题目描述 diff --git a/solution/10000-10099/10034.Count the Number of Powerful Integers/README_EN.md b/solution/2900-2999/2999.Count the Number of Powerful Integers/README_EN.md similarity index 97% rename from solution/10000-10099/10034.Count the Number of Powerful Integers/README_EN.md rename to solution/2900-2999/2999.Count the Number of Powerful Integers/README_EN.md index 6e8f5d755925b..9353b47368787 100644 --- a/solution/10000-10099/10034.Count the Number of Powerful Integers/README_EN.md +++ b/solution/2900-2999/2999.Count the Number of Powerful Integers/README_EN.md @@ -1,6 +1,6 @@ -# [10034. Count the Number of Powerful Integers](https://leetcode.com/problems/count-the-number-of-powerful-integers) +# [2999. Count the Number of Powerful Integers](https://leetcode.com/problems/count-the-number-of-powerful-integers) -[中文文档](/solution/10000-10099/10034.Count%20the%20Number%20of%20Powerful%20Integers/README.md) +[中文文档](/solution/2900-2999/2999.Count%20the%20Number%20of%20Powerful%20Integers/README.md) ## Description diff --git a/solution/10000-10099/10034.Count the Number of Powerful Integers/Solution.cpp b/solution/2900-2999/2999.Count the Number of Powerful Integers/Solution.cpp similarity index 100% rename from solution/10000-10099/10034.Count the Number of Powerful Integers/Solution.cpp rename to solution/2900-2999/2999.Count the Number of Powerful Integers/Solution.cpp diff --git a/solution/10000-10099/10034.Count the Number of Powerful Integers/Solution.go b/solution/2900-2999/2999.Count the Number of Powerful Integers/Solution.go similarity index 100% rename from solution/10000-10099/10034.Count the Number of Powerful Integers/Solution.go rename to solution/2900-2999/2999.Count the Number of Powerful Integers/Solution.go diff --git a/solution/10000-10099/10034.Count the Number of Powerful Integers/Solution.java b/solution/2900-2999/2999.Count the Number of Powerful Integers/Solution.java similarity index 100% rename from solution/10000-10099/10034.Count the Number of Powerful Integers/Solution.java rename to solution/2900-2999/2999.Count the Number of Powerful Integers/Solution.java diff --git a/solution/10000-10099/10034.Count the Number of Powerful Integers/Solution.py b/solution/2900-2999/2999.Count the Number of Powerful Integers/Solution.py similarity index 100% rename from solution/10000-10099/10034.Count the Number of Powerful Integers/Solution.py rename to solution/2900-2999/2999.Count the Number of Powerful Integers/Solution.py diff --git a/solution/10000-10099/10034.Count the Number of Powerful Integers/Solution.ts b/solution/2900-2999/2999.Count the Number of Powerful Integers/Solution.ts similarity index 100% rename from solution/10000-10099/10034.Count the Number of Powerful Integers/Solution.ts rename to solution/2900-2999/2999.Count the Number of Powerful Integers/Solution.ts diff --git a/solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/README.md b/solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/README.md similarity index 94% rename from solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/README.md rename to solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/README.md index d0469bce81885..35cb3a5094cd7 100644 --- a/solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/README.md +++ b/solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/README.md @@ -1,6 +1,6 @@ -# [10035. 对角线最长的矩形的面积](https://leetcode.cn/problems/maximum-area-of-longest-diagonal-rectangle) +# [3000. 对角线最长的矩形的面积](https://leetcode.cn/problems/maximum-area-of-longest-diagonal-rectangle) -[English Version](/solution/10000-10099/10035.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README_EN.md) +[English Version](/solution/3000-3099/3000.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README_EN.md) ## 题目描述 diff --git a/solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/README_EN.md b/solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/README_EN.md similarity index 93% rename from solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/README_EN.md rename to solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/README_EN.md index 106c7aa8f4d36..3ea2785096127 100644 --- a/solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/README_EN.md +++ b/solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/README_EN.md @@ -1,6 +1,6 @@ -# [10035. Maximum Area of Longest Diagonal Rectangle](https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle) +# [3000. Maximum Area of Longest Diagonal Rectangle](https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle) -[中文文档](/solution/10000-10099/10035.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README.md) +[中文文档](/solution/3000-3099/3000.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README.md) ## Description diff --git a/solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/Solution.cpp b/solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/Solution.cpp similarity index 100% rename from solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/Solution.cpp rename to solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/Solution.cpp diff --git a/solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/Solution.go b/solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/Solution.go similarity index 100% rename from solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/Solution.go rename to solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/Solution.go diff --git a/solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/Solution.java b/solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/Solution.java similarity index 100% rename from solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/Solution.java rename to solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/Solution.java diff --git a/solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/Solution.py b/solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/Solution.py similarity index 100% rename from solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/Solution.py rename to solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/Solution.py diff --git a/solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/Solution.ts b/solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/Solution.ts similarity index 100% rename from solution/10000-10099/10035.Maximum Area of Longest Diagonal Rectangle/Solution.ts rename to solution/3000-3099/3000.Maximum Area of Longest Diagonal Rectangle/Solution.ts diff --git a/solution/10000-10099/10036.Minimum Moves to Capture The Queen/README.md b/solution/3000-3099/3001.Minimum Moves to Capture The Queen/README.md similarity index 91% rename from solution/10000-10099/10036.Minimum Moves to Capture The Queen/README.md rename to solution/3000-3099/3001.Minimum Moves to Capture The Queen/README.md index 301f55c4fb0a6..b5982186b1475 100644 --- a/solution/10000-10099/10036.Minimum Moves to Capture The Queen/README.md +++ b/solution/3000-3099/3001.Minimum Moves to Capture The Queen/README.md @@ -1,6 +1,6 @@ -# [10036. 捕获黑皇后需要的最少移动次数](https://leetcode.cn/problems/minimum-moves-to-capture-the-queen) +# [3001. 捕获黑皇后需要的最少移动次数](https://leetcode.cn/problems/minimum-moves-to-capture-the-queen) -[English Version](/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/README_EN.md) +[English Version](/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/README_EN.md) ## 题目描述 @@ -30,7 +30,7 @@

 

示例 1：

- + 
 输入：a = 1, b = 1, c = 8, d = 8, e = 2, f = 3
 输出：2
@@ -39,7 +39,7 @@

示例 2：

- + 
 输入：a = 5, b = 3, c = 3, d = 4, e = 5, f = 2
 输出：1
diff --git a/solution/10000-10099/10036.Minimum Moves to Capture The Queen/README_EN.md b/solution/3000-3099/3001.Minimum Moves to Capture The Queen/README_EN.md
similarity index 91%
rename from solution/10000-10099/10036.Minimum Moves to Capture The Queen/README_EN.md
rename to solution/3000-3099/3001.Minimum Moves to Capture The Queen/README_EN.md
index 077d2c6fb6f86..e8594e84ef7a9 100644
--- a/solution/10000-10099/10036.Minimum Moves to Capture The Queen/README_EN.md	
+++ b/solution/3000-3099/3001.Minimum Moves to Capture The Queen/README_EN.md	
@@ -1,6 +1,6 @@
-# [10036. Minimum Moves to Capture The Queen](https://leetcode.com/problems/minimum-moves-to-capture-the-queen)
+# [3001. Minimum Moves to Capture The Queen](https://leetcode.com/problems/minimum-moves-to-capture-the-queen)
 
-[中文文档](/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/README.md)
+[中文文档](/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/README.md)
 
 ## Description
 
@@ -27,7 +27,7 @@
 
 
 

 
Example 1:

-
+
 
 Input: a = 1, b = 1, c = 8, d = 8, e = 2, f = 3
 Output: 2
@@ -36,7 +36,7 @@ It is impossible to capture the black queen in less than two moves since it is n
 

 
 
Example 2:

-
+
 
 Input: a = 5, b = 3, c = 3, d = 4, e = 5, f = 2
 Output: 1
diff --git a/solution/10000-10099/10036.Minimum Moves to Capture The Queen/Solution.cpp b/solution/3000-3099/3001.Minimum Moves to Capture The Queen/Solution.cpp
similarity index 100%
rename from solution/10000-10099/10036.Minimum Moves to Capture The Queen/Solution.cpp
rename to solution/3000-3099/3001.Minimum Moves to Capture The Queen/Solution.cpp
diff --git a/solution/10000-10099/10036.Minimum Moves to Capture The Queen/Solution.go b/solution/3000-3099/3001.Minimum Moves to Capture The Queen/Solution.go
similarity index 100%
rename from solution/10000-10099/10036.Minimum Moves to Capture The Queen/Solution.go
rename to solution/3000-3099/3001.Minimum Moves to Capture The Queen/Solution.go
diff --git a/solution/10000-10099/10036.Minimum Moves to Capture The Queen/Solution.java b/solution/3000-3099/3001.Minimum Moves to Capture The Queen/Solution.java
similarity index 100%
rename from solution/10000-10099/10036.Minimum Moves to Capture The Queen/Solution.java
rename to solution/3000-3099/3001.Minimum Moves to Capture The Queen/Solution.java
diff --git a/solution/10000-10099/10036.Minimum Moves to Capture The Queen/Solution.py b/solution/3000-3099/3001.Minimum Moves to Capture The Queen/Solution.py
similarity index 100%
rename from solution/10000-10099/10036.Minimum Moves to Capture The Queen/Solution.py
rename to solution/3000-3099/3001.Minimum Moves to Capture The Queen/Solution.py
diff --git a/solution/10000-10099/10036.Minimum Moves to Capture The Queen/Solution.ts b/solution/3000-3099/3001.Minimum Moves to Capture The Queen/Solution.ts
similarity index 100%
rename from solution/10000-10099/10036.Minimum Moves to Capture The Queen/Solution.ts
rename to solution/3000-3099/3001.Minimum Moves to Capture The Queen/Solution.ts
diff --git a/solution/10000-10099/10036.Minimum Moves to Capture The Queen/images/ex1.png b/solution/3000-3099/3001.Minimum Moves to Capture The Queen/images/ex1.png
similarity index 100%
rename from solution/10000-10099/10036.Minimum Moves to Capture The Queen/images/ex1.png
rename to solution/3000-3099/3001.Minimum Moves to Capture The Queen/images/ex1.png
diff --git a/solution/10000-10099/10036.Minimum Moves to Capture The Queen/images/ex2.png b/solution/3000-3099/3001.Minimum Moves to Capture The Queen/images/ex2.png
similarity index 100%
rename from solution/10000-10099/10036.Minimum Moves to Capture The Queen/images/ex2.png
rename to solution/3000-3099/3001.Minimum Moves to Capture The Queen/images/ex2.png
diff --git a/solution/10000-10099/10037.Maximum Size of a Set After Removals/README.md b/solution/3000-3099/3002.Maximum Size of a Set After Removals/README.md
similarity index 95%
rename from solution/10000-10099/10037.Maximum Size of a Set After Removals/README.md
rename to solution/3000-3099/3002.Maximum Size of a Set After Removals/README.md
index aef1004095b81..eecd022be2a5a 100644
--- a/solution/10000-10099/10037.Maximum Size of a Set After Removals/README.md	
+++ b/solution/3000-3099/3002.Maximum Size of a Set After Removals/README.md	
@@ -1,6 +1,6 @@
-# [10037. 移除后集合的最多元素数](https://leetcode.cn/problems/maximum-size-of-a-set-after-removals)
+# [3002. 移除后集合的最多元素数](https://leetcode.cn/problems/maximum-size-of-a-set-after-removals)
 
-[English Version](/solution/10000-10099/10037.Maximum%20Size%20of%20a%20Set%20After%20Removals/README_EN.md)
+[English Version](/solution/3000-3099/3002.Maximum%20Size%20of%20a%20Set%20After%20Removals/README_EN.md)
 
 ## 题目描述
 
diff --git a/solution/10000-10099/10037.Maximum Size of a Set After Removals/README_EN.md b/solution/3000-3099/3002.Maximum Size of a Set After Removals/README_EN.md
similarity index 95%
rename from solution/10000-10099/10037.Maximum Size of a Set After Removals/README_EN.md
rename to solution/3000-3099/3002.Maximum Size of a Set After Removals/README_EN.md
index 4397126d35a7a..80e4fa15636e3 100644
--- a/solution/10000-10099/10037.Maximum Size of a Set After Removals/README_EN.md	
+++ b/solution/3000-3099/3002.Maximum Size of a Set After Removals/README_EN.md	
@@ -1,6 +1,6 @@
-# [10037. Maximum Size of a Set After Removals](https://leetcode.com/problems/maximum-size-of-a-set-after-removals)
+# [3002. Maximum Size of a Set After Removals](https://leetcode.com/problems/maximum-size-of-a-set-after-removals)
 
-[中文文档](/solution/10000-10099/10037.Maximum%20Size%20of%20a%20Set%20After%20Removals/README.md)
+[中文文档](/solution/3000-3099/3002.Maximum%20Size%20of%20a%20Set%20After%20Removals/README.md)
 
 ## Description
 
diff --git a/solution/10000-10099/10037.Maximum Size of a Set After Removals/Solution.cpp b/solution/3000-3099/3002.Maximum Size of a Set After Removals/Solution.cpp
similarity index 100%
rename from solution/10000-10099/10037.Maximum Size of a Set After Removals/Solution.cpp
rename to solution/3000-3099/3002.Maximum Size of a Set After Removals/Solution.cpp
diff --git a/solution/10000-10099/10037.Maximum Size of a Set After Removals/Solution.go b/solution/3000-3099/3002.Maximum Size of a Set After Removals/Solution.go
similarity index 100%
rename from solution/10000-10099/10037.Maximum Size of a Set After Removals/Solution.go
rename to solution/3000-3099/3002.Maximum Size of a Set After Removals/Solution.go
diff --git a/solution/10000-10099/10037.Maximum Size of a Set After Removals/Solution.java b/solution/3000-3099/3002.Maximum Size of a Set After Removals/Solution.java
similarity index 100%
rename from solution/10000-10099/10037.Maximum Size of a Set After Removals/Solution.java
rename to solution/3000-3099/3002.Maximum Size of a Set After Removals/Solution.java
diff --git a/solution/10000-10099/10037.Maximum Size of a Set After Removals/Solution.py b/solution/3000-3099/3002.Maximum Size of a Set After Removals/Solution.py
similarity index 100%
rename from solution/10000-10099/10037.Maximum Size of a Set After Removals/Solution.py
rename to solution/3000-3099/3002.Maximum Size of a Set After Removals/Solution.py
diff --git a/solution/10000-10099/10037.Maximum Size of a Set After Removals/Solution.ts b/solution/3000-3099/3002.Maximum Size of a Set After Removals/Solution.ts
similarity index 100%
rename from solution/10000-10099/10037.Maximum Size of a Set After Removals/Solution.ts
rename to solution/3000-3099/3002.Maximum Size of a Set After Removals/Solution.ts
diff --git a/solution/10000-10099/10038.Maximize the Number of Partitions After Operations/README.md b/solution/3000-3099/3003.Maximize the Number of Partitions After Operations/README.md
similarity index 94%
rename from solution/10000-10099/10038.Maximize the Number of Partitions After Operations/README.md
rename to solution/3000-3099/3003.Maximize the Number of Partitions After Operations/README.md
index 1f7e21e2497c4..ced61d76f3f95 100644
--- a/solution/10000-10099/10038.Maximize the Number of Partitions After Operations/README.md	
+++ b/solution/3000-3099/3003.Maximize the Number of Partitions After Operations/README.md	
@@ -1,6 +1,6 @@
-# [10038. 执行操作后的最大分割数量](https://leetcode.cn/problems/maximize-the-number-of-partitions-after-operations)
+# [3003. 执行操作后的最大分割数量](https://leetcode.cn/problems/maximize-the-number-of-partitions-after-operations)
 
-[English Version](/solution/10000-10099/10038.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README_EN.md)
+[English Version](/solution/3000-3099/3003.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README_EN.md)
 
 ## 题目描述
 
diff --git a/solution/10000-10099/10038.Maximize the Number of Partitions After Operations/README_EN.md b/solution/3000-3099/3003.Maximize the Number of Partitions After Operations/README_EN.md
similarity index 94%
rename from solution/10000-10099/10038.Maximize the Number of Partitions After Operations/README_EN.md
rename to solution/3000-3099/3003.Maximize the Number of Partitions After Operations/README_EN.md
index 4c356c31570e7..b59365eedb191 100644
--- a/solution/10000-10099/10038.Maximize the Number of Partitions After Operations/README_EN.md	
+++ b/solution/3000-3099/3003.Maximize the Number of Partitions After Operations/README_EN.md	
@@ -1,6 +1,6 @@
-# [10038. Maximize the Number of Partitions After Operations](https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations)
+# [3003. Maximize the Number of Partitions After Operations](https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations)
 
-[中文文档](/solution/10000-10099/10038.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README.md)
+[中文文档](/solution/3000-3099/3003.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README.md)
 
 ## Description
 
diff --git a/solution/CONTEST_README.md b/solution/CONTEST_README.md
index 2c5ee4d9f3b29..beab00aef3723 100644
--- a/solution/CONTEST_README.md
+++ b/solution/CONTEST_README.md
@@ -24,17 +24,17 @@
 
 #### 第 379 场周赛(2024-01-07 10:30, 90 分钟) 参赛人数 3117
 
-- [10035. 对角线最长的矩形的面积](/solution/10000-10099/10035.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README.md)
-- [10036. 捕获黑皇后需要的最少移动次数](/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/README.md)
-- [10037. 移除后集合的最多元素数](/solution/10000-10099/10037.Maximum%20Size%20of%20a%20Set%20After%20Removals/README.md)
-- [10038. 执行操作后的最大分割数量](/solution/10000-10099/10038.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README.md)
+- [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
 
-- [10031. 大于等于顺序前缀和的最小缺失整数](/solution/10000-10099/10031.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README.md)
-- [10032. 使数组异或和等于 K 的最少操作次数](/solution/10000-10099/10032.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README.md)
-- [10033. 使 X 和 Y 相等的最少操作次数](/solution/10000-10099/10033.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README.md)
-- [10034. 统计强大整数的数目](/solution/10000-10099/10034.Count%20the%20Number%20of%20Powerful%20Integers/README.md)
+- [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
 
diff --git a/solution/CONTEST_README_EN.md b/solution/CONTEST_README_EN.md
index d5474e0d4503f..5d06c28673fe0 100644
--- a/solution/CONTEST_README_EN.md
+++ b/solution/CONTEST_README_EN.md
@@ -27,17 +27,17 @@ Get your rating changes right after the completion of LeetCode contests, https:/
 
 #### Weekly Contest 379
 
-- [10035. Maximum Area of Longest Diagonal Rectangle](/solution/10000-10099/10035.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README_EN.md)
-- [10036. Minimum Moves to Capture The Queen](/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/README_EN.md)
-- [10037. Maximum Size of a Set After Removals](/solution/10000-10099/10037.Maximum%20Size%20of%20a%20Set%20After%20Removals/README_EN.md)
-- [10038. Maximize the Number of Partitions After Operations](/solution/10000-10099/10038.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README_EN.md)
+- [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
 
-- [10031. Smallest Missing Integer Greater Than Sequential Prefix Sum](/solution/10000-10099/10031.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README_EN.md)
-- [10032. Minimum Number of Operations to Make Array XOR Equal to K](/solution/10000-10099/10032.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README_EN.md)
-- [10033. Minimum Number of Operations to Make X and Y Equal](/solution/10000-10099/10033.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README_EN.md)
-- [10034. Count the Number of Powerful Integers](/solution/10000-10099/10034.Count%20the%20Number%20of%20Powerful%20Integers/README_EN.md)
+- [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
 
diff --git a/solution/DATABASE_README.md b/solution/DATABASE_README.md
index 758fc1025f431..57fca238cf34f 100644
--- a/solution/DATABASE_README.md
+++ b/solution/DATABASE_README.md
@@ -256,9 +256,9 @@
 | 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)                                                                                  | `数据库` | 困难 | 🔒   |
-| 2993 | [Friday Purchases I](/solution/2900-2999/2993.Friday%20Purchases%20I/README.md)                                                                              |          | 中等 | 🔒   |
-| 2994 | [Friday Purchases II](/solution/2900-2999/2994.Friday%20Purchases%20II/README.md)                                                                            |          | 困难 | 🔒   |
-| 2995 | [观众变主播](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README.md)                                                                                |          | 困难 | 🔒   |
+| 2993 | [Friday Purchases I](/solution/2900-2999/2993.Friday%20Purchases%20I/README.md)                                                                              | `数据库` | 中等 | 🔒   |
+| 2994 | [Friday Purchases II](/solution/2900-2999/2994.Friday%20Purchases%20II/README.md)                                                                            | `数据库` | 困难 | 🔒   |
+| 2995 | [观众变主播](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README.md)                                                                                | `数据库` | 困难 | 🔒   |
 
 ## 版权
 
diff --git a/solution/DATABASE_README_EN.md b/solution/DATABASE_README_EN.md
index 2b9eb4a3a05ec..337a819af1dc7 100644
--- a/solution/DATABASE_README_EN.md
+++ b/solution/DATABASE_README_EN.md
@@ -254,9 +254,9 @@ Press Control + F(or Command + F on
 | 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       | 🔒     |
-| 2993 | [Friday Purchases I](/solution/2900-2999/2993.Friday%20Purchases%20I/README_EN.md)                                                                                                           |            | Medium     | 🔒     |
-| 2994 | [Friday Purchases II](/solution/2900-2999/2994.Friday%20Purchases%20II/README_EN.md)                                                                                                         |            | Hard       | 🔒     |
-| 2995 | [Viewers Turned Streamers](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README_EN.md)                                                                                               |            | Hard       | 🔒     |
+| 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       | 🔒     |
 
 ## Copyright
 
diff --git a/solution/README.md b/solution/README.md
index c8d48881372f0..88d9664a75480 100644
--- a/solution/README.md
+++ b/solution/README.md
@@ -1014,14 +1014,6 @@
 |  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 场周赛  |
-|  10031  |  [大于等于顺序前缀和的最小缺失整数](/solution/10000-10099/10031.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README.md)  |    |  简单  |  第 121 场双周赛  |
-|  10032  |  [使数组异或和等于 K 的最少操作次数](/solution/10000-10099/10032.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README.md)  |    |  中等  |  第 121 场双周赛  |
-|  10033  |  [使 X 和 Y 相等的最少操作次数](/solution/10000-10099/10033.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README.md)  |    |  中等  |  第 121 场双周赛  |
-|  10034  |  [统计强大整数的数目](/solution/10000-10099/10034.Count%20the%20Number%20of%20Powerful%20Integers/README.md)  |    |  困难  |  第 121 场双周赛  |
-|  10035  |  [对角线最长的矩形的面积](/solution/10000-10099/10035.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README.md)  |    |  简单  |  第 379 场周赛  |
-|  10036  |  [捕获黑皇后需要的最少移动次数](/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/README.md)  |    |  中等  |  第 379 场周赛  |
-|  10037  |  [移除后集合的最多元素数](/solution/10000-10099/10037.Maximum%20Size%20of%20a%20Set%20After%20Removals/README.md)  |    |  中等  |  第 379 场周赛  |
-|  10038  |  [执行操作后的最大分割数量](/solution/10000-10099/10038.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README.md)  |    |  困难  |  第 379 场周赛  |
 |  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 场周赛  |
@@ -3010,10 +3002,18 @@
 |  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  |  [Friday Purchases I](/solution/2900-2999/2993.Friday%20Purchases%20I/README.md)  |    |  中等  |  🔒  |
-|  2994  |  [Friday Purchases II](/solution/2900-2999/2994.Friday%20Purchases%20II/README.md)  |    |  困难  |  🔒  |
-|  2995  |  [观众变主播](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README.md)  |    |  困难  |  🔒  |
+|  2992  |  [自整除排列的数量](/solution/2900-2999/2992.Number%20of%20Self-Divisible%20Permutations/README.md)  |  `位运算`,`递归`,`数组`,`动态规划`,`状态压缩`  |  中等  |  🔒  |
+|  2993  |  [Friday Purchases I](/solution/2900-2999/2993.Friday%20Purchases%20I/README.md)  |  `数据库`  |  中等  |  🔒  |
+|  2994  |  [Friday Purchases 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 场周赛  |
 
 ## 版权
 
diff --git a/solution/README_EN.md b/solution/README_EN.md
index 1b50bfa70d655..bd50c753cb29b 100644
--- a/solution/README_EN.md
+++ b/solution/README_EN.md
@@ -1012,14 +1012,6 @@ Press Control + F(or Command + F on
 |  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  |
-|  10031  |  [Smallest Missing Integer Greater Than Sequential Prefix Sum](/solution/10000-10099/10031.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README_EN.md)  |    |  Easy  |  Biweekly Contest 121  |
-|  10032  |  [Minimum Number of Operations to Make Array XOR Equal to K](/solution/10000-10099/10032.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README_EN.md)  |    |  Medium  |  Biweekly Contest 121  |
-|  10033  |  [Minimum Number of Operations to Make X and Y Equal](/solution/10000-10099/10033.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README_EN.md)  |    |  Medium  |  Biweekly Contest 121  |
-|  10034  |  [Count the Number of Powerful Integers](/solution/10000-10099/10034.Count%20the%20Number%20of%20Powerful%20Integers/README_EN.md)  |    |  Hard  |  Biweekly Contest 121  |
-|  10035  |  [Maximum Area of Longest Diagonal Rectangle](/solution/10000-10099/10035.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README_EN.md)  |    |  Easy  |  Weekly Contest 379  |
-|  10036  |  [Minimum Moves to Capture The Queen](/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/README_EN.md)  |    |  Medium  |  Weekly Contest 379  |
-|  10037  |  [Maximum Size of a Set After Removals](/solution/10000-10099/10037.Maximum%20Size%20of%20a%20Set%20After%20Removals/README_EN.md)  |    |  Medium  |  Weekly Contest 379  |
-|  10038  |  [Maximize the Number of Partitions After Operations](/solution/10000-10099/10038.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README_EN.md)  |    |  Hard  |  Weekly Contest 379  |
 |  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  |
@@ -3008,10 +3000,18 @@ Press Control + F(or Command + F on
 |  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)  |    |  Medium  |  🔒  |
-|  2993  |  [Friday Purchases I](/solution/2900-2999/2993.Friday%20Purchases%20I/README_EN.md)  |    |  Medium  |  🔒  |
-|  2994  |  [Friday Purchases II](/solution/2900-2999/2994.Friday%20Purchases%20II/README_EN.md)  |    |  Hard  |  🔒  |
-|  2995  |  [Viewers Turned Streamers](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README_EN.md)  |    |  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  |
 
 ## Copyright
 
diff --git a/solution/summary.md b/solution/summary.md
index 42bc814454b43..18c98338f5e40 100644
--- a/solution/summary.md
+++ b/solution/summary.md
@@ -1120,16 +1120,6 @@
   - [1098.小众书籍](/solution/1000-1099/1098.Unpopular%20Books/README.md)
   - [1099.小于 K 的两数之和](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md)
 
-- 10000-10099
-  - [10031检查替换后的词是否有效](/solution/10000-10099/10031.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README.md)
-  - [10032检查替换后的词是否有效](/solution/10000-10099/10032.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README.md)
-  - [10033检查替换后的词是否有效](/solution/10000-10099/10033.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README.md)
-  - [10034检查替换后的词是否有效](/solution/10000-10099/10034.Count%20the%20Number%20of%20Powerful%20Integers/README.md)
-  - [10035检查替换后的词是否有效](/solution/10000-10099/10035.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README.md)
-  - [10036检查替换后的词是否有效](/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/README.md)
-  - [10037检查替换后的词是否有效](/solution/10000-10099/10037.Maximum%20Size%20of%20a%20Set%20After%20Removals/README.md)
-  - [10038检查替换后的词是否有效](/solution/10000-10099/10038.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README.md)
-
 - 1100-1199
   - [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)
@@ -3063,3 +3053,13 @@
   - [2993.Friday Purchases I](/solution/2900-2999/2993.Friday%20Purchases%20I/README.md)
   - [2994.Friday Purchases 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)
+  - [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)
+
+- 3000-3099
+  - [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)
diff --git a/solution/summary_en.md b/solution/summary_en.md
index 543e358aa639e..cc50f8567b08c 100644
--- a/solution/summary_en.md
+++ b/solution/summary_en.md
@@ -1120,16 +1120,6 @@
   - [1098.Unpopular Books](/solution/1000-1099/1098.Unpopular%20Books/README_EN.md)
   - [1099.Two Sum Less Than K](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README_EN.md)
 
-- 10000-10099
-  - [10031.Smallest Missing Integer Greater Than Sequential Prefix Sum](/solution/10000-10099/10031.Smallest%20Missing%20Integer%20Greater%20Than%20Sequential%20Prefix%20Sum/README_EN.md)
-  - [10032.Minimum Number of Operations to Make Array XOR Equal to K](/solution/10000-10099/10032.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20XOR%20Equal%20to%20K/README_EN.md)
-  - [10033.Minimum Number of Operations to Make X and Y Equal](/solution/10000-10099/10033.Minimum%20Number%20of%20Operations%20to%20Make%20X%20and%20Y%20Equal/README_EN.md)
-  - [10034.Count the Number of Powerful Integers](/solution/10000-10099/10034.Count%20the%20Number%20of%20Powerful%20Integers/README_EN.md)
-  - [10035.Maximum Area of Longest Diagonal Rectangle](/solution/10000-10099/10035.Maximum%20Area%20of%20Longest%20Diagonal%20Rectangle/README_EN.md)
-  - [10036.Minimum Moves to Capture The Queen](/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/README_EN.md)
-  - [10037.Maximum Size of a Set After Removals](/solution/10000-10099/10037.Maximum%20Size%20of%20a%20Set%20After%20Removals/README_EN.md)
-  - [10038.Maximize the Number of Partitions After Operations](/solution/10000-10099/10038.Maximize%20the%20Number%20of%20Partitions%20After%20Operations/README_EN.md)
-
 - 1100-1199
   - [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)
@@ -3063,3 +3053,13 @@
   - [2993.Friday Purchases I](/solution/2900-2999/2993.Friday%20Purchases%20I/README_EN.md)
   - [2994.Friday Purchases II](/solution/2900-2999/2994.Friday%20Purchases%20II/README_EN.md)
   - [2995.Viewers Turned Streamers](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README_EN.md)
+  - [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)
+
+- 3000-3099
+  - [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)