doocs · acbin · Jan 9, 2024 · Jan 9, 2024
diff --git a/...ater Than Sequential Prefix Sum/README.md → ...ater Than Sequential Prefix Sum/README.md b/...ater Than Sequential Prefix Sum/README.md → ...ater 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/...r Than Sequential Prefix Sum/README_EN.md → ...r Than Sequential Prefix Sum/README_EN.md b/...r Than Sequential Prefix Sum/README_EN.md → ...r 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/...r Than Sequential Prefix Sum/Solution.cpp → ...r Than Sequential Prefix Sum/Solution.cpp b/...r Than Sequential Prefix Sum/Solution.cpp → ...r Than Sequential Prefix Sum/Solution.cpp
diff --git a/...er Than Sequential Prefix Sum/Solution.go → ...er Than Sequential Prefix Sum/Solution.go b/...er Than Sequential Prefix Sum/Solution.go → ...er Than Sequential Prefix Sum/Solution.go
diff --git a/... Than Sequential Prefix Sum/Solution.java → ... Than Sequential Prefix Sum/Solution.java b/... Than Sequential Prefix Sum/Solution.java → ... Than Sequential Prefix Sum/Solution.java
diff --git a/...er Than Sequential Prefix Sum/Solution.py → ...er Than Sequential Prefix Sum/Solution.py b/...er Than Sequential Prefix Sum/Solution.py → ...er Than Sequential Prefix Sum/Solution.py
diff --git a/...er Than Sequential Prefix Sum/Solution.ts → ...er Than Sequential Prefix Sum/Solution.ts b/...er Than Sequential Prefix Sum/Solution.ts → ...er Than Sequential Prefix Sum/Solution.ts
diff --git a/...ns to Make Array XOR Equal to K/README.md → ...ns to Make Array XOR Equal to K/README.md b/...ns to Make Array XOR Equal to K/README.md → ...ns 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/...to Make Array XOR Equal to K/README_EN.md → ...to Make Array XOR Equal to K/README_EN.md b/...to Make Array XOR Equal to K/README_EN.md → ...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/...to Make Array XOR Equal to K/Solution.cpp → ...to Make Array XOR Equal to K/Solution.cpp b/...to Make Array XOR Equal to K/Solution.cpp → ...to Make Array XOR Equal to K/Solution.cpp
diff --git a/... to Make Array XOR Equal to K/Solution.go → ... to Make Array XOR Equal to K/Solution.go b/... to Make Array XOR Equal to K/Solution.go → ... to Make Array XOR Equal to K/Solution.go
diff --git a/...o Make Array XOR Equal to K/Solution.java → ...o Make Array XOR Equal to K/Solution.java b/...o Make Array XOR Equal to K/Solution.java → ...o Make Array XOR Equal to K/Solution.java
diff --git a/... to Make Array XOR Equal to K/Solution.py → ... to Make Array XOR Equal to K/Solution.py b/... to Make Array XOR Equal to K/Solution.py → ... to Make Array XOR Equal to K/Solution.py
diff --git a/... to Make Array XOR Equal to K/Solution.ts → ... to Make Array XOR Equal to K/Solution.ts b/... to Make Array XOR Equal to K/Solution.ts → ... to Make Array XOR Equal to K/Solution.ts
diff --git a/...perations to Make X and Y Equal/README.md → ...perations to Make X and Y Equal/README.md b/...perations to Make X and Y Equal/README.md → ...perations 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/...ations to Make X and Y Equal/README_EN.md → ...ations to Make X and Y Equal/README_EN.md b/...ations to Make X and Y Equal/README_EN.md → ...ations 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/...ations to Make X and Y Equal/Solution.cpp → ...ations to Make X and Y Equal/Solution.cpp b/...ations to Make X and Y Equal/Solution.cpp → ...ations to Make X and Y Equal/Solution.cpp
diff --git a/...rations to Make X and Y Equal/Solution.go → ...rations to Make X and Y Equal/Solution.go b/...rations to Make X and Y Equal/Solution.go → ...rations to Make X and Y Equal/Solution.go
diff --git a/...tions to Make X and Y Equal/Solution.java → ...tions to Make X and Y Equal/Solution.java b/...tions to Make X and Y Equal/Solution.java → ...tions to Make X and Y Equal/Solution.java
diff --git a/...rations to Make X and Y Equal/Solution.py → ...rations to Make X and Y Equal/Solution.py b/...rations to Make X and Y Equal/Solution.py → ...rations to Make X and Y Equal/Solution.py
diff --git a/...rations to Make X and Y Equal/Solution.ts → ...rations to Make X and Y Equal/Solution.ts b/...rations to Make X and Y Equal/Solution.ts → ...rations to Make X and Y Equal/Solution.ts
diff --git a/...the Number of Powerful Integers/README.md → ...the Number of Powerful Integers/README.md b/...the Number of Powerful Integers/README.md → ...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/... Number of Powerful Integers/README_EN.md → ... Number of Powerful Integers/README_EN.md b/... Number of Powerful Integers/README_EN.md → ... 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/... Number of Powerful Integers/Solution.cpp → ... Number of Powerful Integers/Solution.cpp b/... Number of Powerful Integers/Solution.cpp → ... Number of Powerful Integers/Solution.cpp
diff --git a/...e Number of Powerful Integers/Solution.go → ...e Number of Powerful Integers/Solution.go b/...e Number of Powerful Integers/Solution.go → ...e Number of Powerful Integers/Solution.go
diff --git a/...Number of Powerful Integers/Solution.java → ...Number of Powerful Integers/Solution.java b/...Number of Powerful Integers/Solution.java → ...Number of Powerful Integers/Solution.java
diff --git a/...e Number of Powerful Integers/Solution.py → ...e Number of Powerful Integers/Solution.py b/...e Number of Powerful Integers/Solution.py → ...e Number of Powerful Integers/Solution.py
diff --git a/...e Number of Powerful Integers/Solution.ts → ...e Number of Powerful Integers/Solution.ts b/...e Number of Powerful Integers/Solution.ts → ...e Number of Powerful Integers/Solution.ts
diff --git a/...a of Longest Diagonal Rectangle/README.md → ...a of Longest Diagonal Rectangle/README.md b/...a of Longest Diagonal Rectangle/README.md → ...a 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/...f Longest Diagonal Rectangle/README_EN.md → ...f Longest Diagonal Rectangle/README_EN.md b/...f Longest Diagonal Rectangle/README_EN.md → ...f 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/...f Longest Diagonal Rectangle/Solution.cpp → ...f Longest Diagonal Rectangle/Solution.cpp b/...f Longest Diagonal Rectangle/Solution.cpp → ...f Longest Diagonal Rectangle/Solution.cpp
diff --git a/...of Longest Diagonal Rectangle/Solution.go → ...of Longest Diagonal Rectangle/Solution.go b/...of Longest Diagonal Rectangle/Solution.go → ...of Longest Diagonal Rectangle/Solution.go
diff --git a/... Longest Diagonal Rectangle/Solution.java → ... Longest Diagonal Rectangle/Solution.java b/... Longest Diagonal Rectangle/Solution.java → ... Longest Diagonal Rectangle/Solution.java
diff --git a/...of Longest Diagonal Rectangle/Solution.py → ...of Longest Diagonal Rectangle/Solution.py b/...of Longest Diagonal Rectangle/Solution.py → ...of Longest Diagonal Rectangle/Solution.py
diff --git a/...of Longest Diagonal Rectangle/Solution.ts → ...of Longest Diagonal Rectangle/Solution.ts b/...of Longest Diagonal Rectangle/Solution.ts → ...of Longest Diagonal Rectangle/Solution.ts
diff --git a/...imum Moves to Capture The Queen/README.md → ...imum Moves to Capture The Queen/README.md b/...imum Moves to Capture The Queen/README.md → ...imum 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 @@
 <p>&nbsp;</p>
 
 <p><strong class="example">示例 1：</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/images//ex1.png" style="width: 600px; height: 600px; padding: 10px; background: #fff; border-radius: .5rem;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/images/ex1.png" style="width: 600px; height: 600px; padding: 10px; background: #fff; border-radius: .5rem;" />
 <pre>
 <strong>输入：</strong>a = 1, b = 1, c = 8, d = 8, e = 2, f = 3
 <strong>输出：</strong>2
@@ -39,7 +39,7 @@
 </pre>
 
 <p><strong class="example">示例 2：</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/images//ex2.png" style="width: 600px; height: 600px;padding: 10px; background: #fff; border-radius: .5rem;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/images/ex2.png" style="width: 600px; height: 600px;padding: 10px; background: #fff; border-radius: .5rem;" />
 <pre>
 <strong>输入：</strong>a = 5, b = 3, c = 3, d = 4, e = 5, f = 2
 <strong>输出：</strong>1

diff --git a/...m Moves to Capture The Queen/README_EN.md → ...m Moves to Capture The Queen/README_EN.md b/...m Moves to Capture The Queen/README_EN.md → ...m 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 @@
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/images//ex1.png" style="width: 600px; height: 600px; padding: 10px; background: #fff; border-radius: .5rem;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/images/ex1.png" style="width: 600px; height: 600px; padding: 10px; background: #fff; border-radius: .5rem;" />
 <pre>
 <strong>Input:</strong> a = 1, b = 1, c = 8, d = 8, e = 2, f = 3
 <strong>Output:</strong> 2
@@ -36,7 +36,7 @@ It is impossible to capture the black queen in less than two moves since it is n
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/10000-10099/10036.Minimum%20Moves%20to%20Capture%20The%20Queen/images//ex2.png" style="width: 600px; height: 600px;padding: 10px; background: #fff; border-radius: .5rem;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3001.Minimum%20Moves%20to%20Capture%20The%20Queen/images/ex2.png" style="width: 600px; height: 600px;padding: 10px; background: #fff; border-radius: .5rem;" />
 <pre>
 <strong>Input:</strong> a = 5, b = 3, c = 3, d = 4, e = 5, f = 2
 <strong>Output:</strong> 1

diff --git a/...m Moves to Capture The Queen/Solution.cpp → ...m Moves to Capture The Queen/Solution.cpp b/...m Moves to Capture The Queen/Solution.cpp → ...m Moves to Capture The Queen/Solution.cpp
diff --git a/...um Moves to Capture The Queen/Solution.go → ...um Moves to Capture The Queen/Solution.go b/...um Moves to Capture The Queen/Solution.go → ...um Moves to Capture The Queen/Solution.go
diff --git a/... Moves to Capture The Queen/Solution.java → ... Moves to Capture The Queen/Solution.java b/... Moves to Capture The Queen/Solution.java → ... Moves to Capture The Queen/Solution.java
diff --git a/...um Moves to Capture The Queen/Solution.py → ...um Moves to Capture The Queen/Solution.py b/...um Moves to Capture The Queen/Solution.py → ...um Moves to Capture The Queen/Solution.py
diff --git a/...um Moves to Capture The Queen/Solution.ts → ...um Moves to Capture The Queen/Solution.ts b/...um Moves to Capture The Queen/Solution.ts → ...um Moves to Capture The Queen/Solution.ts
diff --git a/...Moves to Capture The Queen/images/ex1.png → ...Moves to Capture The Queen/images/ex1.png b/...Moves to Capture The Queen/images/ex1.png → ...Moves to Capture The Queen/images/ex1.png
diff --git a/...Moves to Capture The Queen/images/ex2.png → ...Moves to Capture The Queen/images/ex2.png b/...Moves to Capture The Queen/images/ex2.png → ...Moves to Capture The Queen/images/ex2.png
diff --git a/...um Size of a Set After Removals/README.md → ...um Size of a Set After Removals/README.md b/...um Size of a Set After Removals/README.md → ...um 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/...Size of a Set After Removals/README_EN.md → ...Size of a Set After Removals/README_EN.md b/...Size of a Set After Removals/README_EN.md → ...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/...Size of a Set After Removals/Solution.cpp → ...Size of a Set After Removals/Solution.cpp b/...Size of a Set After Removals/Solution.cpp → ...Size of a Set After Removals/Solution.cpp
diff --git a/... Size of a Set After Removals/Solution.go → ... Size of a Set After Removals/Solution.go b/... Size of a Set After Removals/Solution.go → ... Size of a Set After Removals/Solution.go
diff --git a/...ize of a Set After Removals/Solution.java → ...ize of a Set After Removals/Solution.java b/...ize of a Set After Removals/Solution.java → ...ize of a Set After Removals/Solution.java
diff --git a/... Size of a Set After Removals/Solution.py → ... Size of a Set After Removals/Solution.py b/... Size of a Set After Removals/Solution.py → ... Size of a Set After Removals/Solution.py
diff --git a/... Size of a Set After Removals/Solution.ts → ... Size of a Set After Removals/Solution.ts b/... Size of a Set After Removals/Solution.ts → ... Size of a Set After Removals/Solution.ts
diff --git a/... of Partitions After Operations/README.md → ... of Partitions After Operations/README.md b/... of Partitions After Operations/README.md → ... 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/... Partitions After Operations/README_EN.md → ... Partitions After Operations/README_EN.md b/... Partitions After Operations/README_EN.md → ... 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
@@ -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
@@ -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
@@ -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)                                                                                | `数据库` | 困难 | 🔒   |
 
 ## 版权