diff --git a/solution/1200-1299/1209.Remove All Adjacent Duplicates in String II/README.md b/solution/1200-1299/1209.Remove All Adjacent Duplicates in String II/README.md index 3014e57384fa9..11b58aa3a5db5 100644 --- a/solution/1200-1299/1209.Remove All Adjacent Duplicates in String II/README.md +++ b/solution/1200-1299/1209.Remove All Adjacent Duplicates in String II/README.md @@ -39,7 +39,7 @@ tags: 
输入：s = "deeedbbcccbdaa", k = 3
 输出："aa"
-解释：
+解释： 
 先删除 "eee" 和 "ccc"，得到 "ddbbbdaa"
 再删除 "bbb"，得到 "dddaa"
 最后删除 "ddd"，得到 "aa"
diff --git a/solution/1200-1299/1209.Remove All Adjacent Duplicates in String II/README_EN.md b/solution/1200-1299/1209.Remove All Adjacent Duplicates in String II/README_EN.md index 4340db28cc1ea..3cae90f63f95c 100644 --- a/solution/1200-1299/1209.Remove All Adjacent Duplicates in String II/README_EN.md +++ b/solution/1200-1299/1209.Remove All Adjacent Duplicates in String II/README_EN.md @@ -38,7 +38,7 @@ tags: 
 Input: s = "deeedbbcccbdaa", k = 3
 Output: "aa"
-Explanation:
+Explanation: 
 First delete "eee" and "ccc", get "ddbbbdaa"
 Then delete "bbb", get "dddaa"
 Finally delete "ddd", get "aa"
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 a8debc2e7e59c..e5de3f95cabc2 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 @@ -7,7 +7,6 @@ source: 第 178 场周赛 Q3 tags: - 树 - 深度优先搜索 - - 广度优先搜索 - 链表 - 二叉树 --- 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 b413ba1d14178..c9b47a08649e2 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 @@ -7,7 +7,6 @@ source: Weekly Contest 178 Q3 tags: - Tree - Depth-First Search - - Breadth-First Search - Linked List - Binary Tree --- diff --git a/solution/2100-2199/2181.Merge Nodes in Between Zeros/README_EN.md b/solution/2100-2199/2181.Merge Nodes in Between Zeros/README_EN.md index 5e8376c8445ec..e6f638d971434 100644 --- a/solution/2100-2199/2181.Merge Nodes in Between Zeros/README_EN.md +++ b/solution/2100-2199/2181.Merge Nodes in Between Zeros/README_EN.md @@ -31,7 +31,7 @@ tags: 
 Input: head = [0,3,1,0,4,5,2,0]
 Output: [4,11]
-Explanation:
+Explanation: 
 The above figure represents the given linked list. The modified list contains
 - The sum of the nodes marked in green: 3 + 1 = 4.
 - The sum of the nodes marked in red: 4 + 5 + 2 = 11.
@@ -42,7 +42,7 @@ The above figure represents the given linked list. The modified list contains
 
 Input: head = [0,1,0,3,0,2,2,0]
 Output: [1,3,4]
-Explanation:
+Explanation: 
 The above figure represents the given linked list. The modified list contains
 - The sum of the nodes marked in green: 1 = 1.
 - The sum of the nodes marked in red: 3 = 3.
diff --git a/solution/2300-2399/2398.Maximum Number of Robots Within Budget/README_EN.md b/solution/2300-2399/2398.Maximum Number of Robots Within Budget/README_EN.md
index 4f5caba26b5b0..f0136a948c251 100644
--- a/solution/2300-2399/2398.Maximum Number of Robots Within Budget/README_EN.md	
+++ b/solution/2300-2399/2398.Maximum Number of Robots Within Budget/README_EN.md	
@@ -35,7 +35,7 @@ tags:
 
 Input: chargeTimes = [3,6,1,3,4], runningCosts = [2,1,3,4,5], budget = 25
 Output: 3
-Explanation:
+Explanation: 
 It is possible to run all individual and consecutive pairs of robots within budget.
 To obtain answer 3, consider the first 3 robots. The total cost will be max(3,6,1) + 3 * sum(2,1,3) = 6 + 3 * 6 = 24 which is less than 25.
 It can be shown that it is not possible to run more than 3 consecutive robots within budget, so we return 3.
diff --git a/solution/2400-2499/2472.Maximum Number of Non-overlapping Palindrome Substrings/README.md b/solution/2400-2499/2472.Maximum Number of Non-overlapping Palindrome Substrings/README.md
index 3aa114fa416c9..c59e8d549480c 100644
--- a/solution/2400-2499/2472.Maximum Number of Non-overlapping Palindrome Substrings/README.md	
+++ b/solution/2400-2499/2472.Maximum Number of Non-overlapping Palindrome Substrings/README.md	
@@ -5,6 +5,8 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/2400-2499/2472.Ma
 rating: 2013
 source: 第 319 场周赛 Q4
 tags:
+    - 贪心
+    - 双指针
     - 字符串
     - 动态规划
 ---
diff --git a/solution/2400-2499/2472.Maximum Number of Non-overlapping Palindrome Substrings/README_EN.md b/solution/2400-2499/2472.Maximum Number of Non-overlapping Palindrome Substrings/README_EN.md
index 8820941796c8f..8c7fd2e1d716f 100644
--- a/solution/2400-2499/2472.Maximum Number of Non-overlapping Palindrome Substrings/README_EN.md	
+++ b/solution/2400-2499/2472.Maximum Number of Non-overlapping Palindrome Substrings/README_EN.md	
@@ -5,6 +5,8 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/2400-2499/2472.Ma
 rating: 2013
 source: Weekly Contest 319 Q4
 tags:
+    - Greedy
+    - Two Pointers
     - String
     - Dynamic Programming
 ---
diff --git a/solution/2500-2599/2532.Time to Cross a Bridge/README_EN.md b/solution/2500-2599/2532.Time to Cross a Bridge/README_EN.md
index c4f900c00b2a1..8758a7927cbd1 100644
--- a/solution/2500-2599/2532.Time to Cross a Bridge/README_EN.md	
+++ b/solution/2500-2599/2532.Time to Cross a Bridge/README_EN.md	
@@ -43,6 +43,7 @@ tags:
 
    
 	
  • Only one worker can use the bridge at a time.
    • 
 	
  • When the bridge is unused prioritize the least efficient worker on the right side to cross. If there are no workers on the right side, prioritize the least efficient worker on the left side to cross.
    • 
+	
  • If enough workers have already been dispatched from the left side to pick up all the remaining boxes, no more workers will be sent from the left side.
    • 
 

 
 
Return the elapsed minutes at which the last box reaches the left side of the bridge.

diff --git a/solution/3000-3099/3038.Maximum Number of Operations With the Same Score I/README_EN.md b/solution/3000-3099/3038.Maximum Number of Operations With the Same Score I/README_EN.md
index 2cd6426fb8d25..00f27408134da 100644
--- a/solution/3000-3099/3038.Maximum Number of Operations With the Same Score I/README_EN.md	
+++ b/solution/3000-3099/3038.Maximum Number of Operations With the Same Score I/README_EN.md	
@@ -19,38 +19,56 @@ tags:
 
 
 
-
Given an array of integers called nums, you can perform the following operation while nums contains at least 2 elements:

+
You are given an array of integers nums. Consider the following operation:

 
 
    
-	
  • Choose the first two elements of nums and delete them.
    • 
+	
  • Delete the first two elements nums and define the score of the operation as the sum of these two elements.
    • 
 

 
-
The score of the operation is the sum of the deleted elements.

+
You can perform this operation until nums contains fewer than two elements. Additionally, the same score must be achieved in all operations.

 
-
Your task is to find the maximum number of operations that can be performed, such that all operations have the same score.

-
-
Return the maximum number of operations possible that satisfy the condition mentioned above.

+
Return the maximum number of operations you can perform.

 
 
 

 
Example 1:

 
-
-Input: nums = [3,2,1,4,5]
-Output: 2
-Explanation: We perform the following operations:
-- Delete the first two elements, with score 3 + 2 = 5, nums = [1,4,5].
-- Delete the first two elements, with score 1 + 4 = 5, nums = [5].
-We are unable to perform any more operations as nums contain only 1 element.

+

+
Input: nums = [3,2,1,4,5]

+
+
Output: 2

+
+
Explanation:

+
+
    
+	
  • We can perform the first operation with the score 3 + 2 = 5. After this operation, nums = [1,4,5].
    • 
+	
  • We can perform the second operation as its score is 4 + 1 = 5, the same as the previous operation. After this operation, nums = [5].
    • 
+	
  • As there are fewer than two elements, we can't perform more operations.
    • 
+

+

 
 
Example 2:

 
-
-Input: nums = [3,2,6,1,4]
-Output: 1
-Explanation: We perform the following operations:
-- Delete the first two elements, with score 3 + 2 = 5, nums = [6,1,4].
-We are unable to perform any more operations as the score of the next operation isn't the same as the previous one.
-

+

+
Input: nums = [1,5,3,3,4,1,3,2,2,3]

+
+
Output: 1

+
+
Explanation:

+
+
    
+	
  • We can perform the first operation with the score 1 + 5 = 6. After this operation, nums = [3,3,4,1,3,2,2,3].
    • 
+	
  • We can perform the second operation as its score is 3 + 3 = 6, the same as the previous operation. After this operation, nums = [4,1,3,2,2,3].
    • 
+	
  • We cannot perform the next operation as its score is 4 + 1 = 5, which is different from the previous scores.
    • 
+

+

+
+
Example 3:

+
+

+
Input: nums = [5,3]

+
+
Output: 1

+

 
 
 

 
Constraints:

diff --git a/solution/3200-3299/3279.Maximum Total Area Occupied by Pistons/README.md b/solution/3200-3299/3279.Maximum Total Area Occupied by Pistons/README.md
index d223123ac0ee3..b195887967e3c 100644
--- a/solution/3200-3299/3279.Maximum Total Area Occupied by Pistons/README.md	
+++ b/solution/3200-3299/3279.Maximum Total Area Occupied by Pistons/README.md	
@@ -2,6 +2,13 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3279.Maximum%20Total%20Area%20Occupied%20by%20Pistons/README.md
+tags:
+    - 数组
+    - 哈希表
+    - 字符串
+    - 计数
+    - 前缀和
+    - 模拟
 ---
 
 
diff --git a/solution/3200-3299/3279.Maximum Total Area Occupied by Pistons/README_EN.md b/solution/3200-3299/3279.Maximum Total Area Occupied by Pistons/README_EN.md
index a94bb3a585a77..a27aea1f3bc61 100644
--- a/solution/3200-3299/3279.Maximum Total Area Occupied by Pistons/README_EN.md	
+++ b/solution/3200-3299/3279.Maximum Total Area Occupied by Pistons/README_EN.md	
@@ -2,6 +2,13 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3279.Maximum%20Total%20Area%20Occupied%20by%20Pistons/README_EN.md
+tags:
+    - Array
+    - Hash Table
+    - String
+    - Counting
+    - Prefix Sum
+    - Simulation
 ---
 
 
diff --git a/solution/3200-3299/3280.Convert Date to Binary/README.md b/solution/3200-3299/3280.Convert Date to Binary/README.md
index d7e7bbd814d2a..8d79033508131 100644
--- a/solution/3200-3299/3280.Convert Date to Binary/README.md	
+++ b/solution/3200-3299/3280.Convert Date to Binary/README.md	
@@ -2,6 +2,9 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3280.Convert%20Date%20to%20Binary/README.md
+tags:
+    - 数学
+    - 字符串
 ---
 
 
diff --git a/solution/3200-3299/3280.Convert Date to Binary/README_EN.md b/solution/3200-3299/3280.Convert Date to Binary/README_EN.md
index f81ba5dda6519..023800a6887e1 100644
--- a/solution/3200-3299/3280.Convert Date to Binary/README_EN.md	
+++ b/solution/3200-3299/3280.Convert Date to Binary/README_EN.md	
@@ -2,6 +2,9 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3280.Convert%20Date%20to%20Binary/README_EN.md
+tags:
+    - Math
+    - String
 ---
 
 
diff --git a/solution/3200-3299/3281.Maximize Score of Numbers in Ranges/README.md b/solution/3200-3299/3281.Maximize Score of Numbers in Ranges/README.md
index a34dcdc75e1cd..54d0771938b09 100644
--- a/solution/3200-3299/3281.Maximize Score of Numbers in Ranges/README.md	
+++ b/solution/3200-3299/3281.Maximize Score of Numbers in Ranges/README.md	
@@ -2,6 +2,11 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3281.Maximize%20Score%20of%20Numbers%20in%20Ranges/README.md
+tags:
+    - 贪心
+    - 数组
+    - 二分查找
+    - 排序
 ---
 
 
diff --git a/solution/3200-3299/3281.Maximize Score of Numbers in Ranges/README_EN.md b/solution/3200-3299/3281.Maximize Score of Numbers in Ranges/README_EN.md
index c9b5ac5211a55..dbc17529c4c75 100644
--- a/solution/3200-3299/3281.Maximize Score of Numbers in Ranges/README_EN.md	
+++ b/solution/3200-3299/3281.Maximize Score of Numbers in Ranges/README_EN.md	
@@ -2,6 +2,11 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3281.Maximize%20Score%20of%20Numbers%20in%20Ranges/README_EN.md
+tags:
+    - Greedy
+    - Array
+    - Binary Search
+    - Sorting
 ---
 
 
diff --git a/solution/3200-3299/3282.Reach End of Array With Max Score/README.md b/solution/3200-3299/3282.Reach End of Array With Max Score/README.md
index a4518287c010d..191997c856634 100644
--- a/solution/3200-3299/3282.Reach End of Array With Max Score/README.md	
+++ b/solution/3200-3299/3282.Reach End of Array With Max Score/README.md	
@@ -2,6 +2,9 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3282.Reach%20End%20of%20Array%20With%20Max%20Score/README.md
+tags:
+    - 贪心
+    - 数组
 ---
 
 
diff --git a/solution/3200-3299/3282.Reach End of Array With Max Score/README_EN.md b/solution/3200-3299/3282.Reach End of Array With Max Score/README_EN.md
index 857bff7c1b216..7e04f8d85f6d3 100644
--- a/solution/3200-3299/3282.Reach End of Array With Max Score/README_EN.md	
+++ b/solution/3200-3299/3282.Reach End of Array With Max Score/README_EN.md	
@@ -2,6 +2,9 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3282.Reach%20End%20of%20Array%20With%20Max%20Score/README_EN.md
+tags:
+    - Greedy
+    - Array
 ---
 
 
diff --git a/solution/3200-3299/3283.Maximum Number of Moves to Kill All Pawns/README.md b/solution/3200-3299/3283.Maximum Number of Moves to Kill All Pawns/README.md
index f513534d4195c..99bb146e6f428 100644
--- a/solution/3200-3299/3283.Maximum Number of Moves to Kill All Pawns/README.md	
+++ b/solution/3200-3299/3283.Maximum Number of Moves to Kill All Pawns/README.md	
@@ -2,6 +2,13 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3283.Maximum%20Number%20of%20Moves%20to%20Kill%20All%20Pawns/README.md
+tags:
+    - 位运算
+    - 广度优先搜索
+    - 数组
+    - 数学
+    - 状态压缩
+    - 博弈
 ---
 
 
diff --git a/solution/3200-3299/3283.Maximum Number of Moves to Kill All Pawns/README_EN.md b/solution/3200-3299/3283.Maximum Number of Moves to Kill All Pawns/README_EN.md
index b938aca191502..158bb0859eac8 100644
--- a/solution/3200-3299/3283.Maximum Number of Moves to Kill All Pawns/README_EN.md	
+++ b/solution/3200-3299/3283.Maximum Number of Moves to Kill All Pawns/README_EN.md	
@@ -2,6 +2,13 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3283.Maximum%20Number%20of%20Moves%20to%20Kill%20All%20Pawns/README_EN.md
+tags:
+    - Bit Manipulation
+    - Breadth-First Search
+    - Array
+    - Math
+    - Bitmask
+    - Game Theory
 ---
 
 
diff --git a/solution/README.md b/solution/README.md
index 3f564367fb142..e0fac4e46dd01 100644
--- a/solution/README.md
+++ b/solution/README.md
@@ -1377,7 +1377,7 @@
 |  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 场周赛  |
+|  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 场双周赛  |
@@ -2482,7 +2482,7 @@
 |  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 场周赛  |
+|  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 场周赛  |
@@ -3289,11 +3289,11 @@
 |  3276  |  [选择矩阵中单元格的最大得分](/solution/3200-3299/3276.Select%20Cells%20in%20Grid%20With%20Maximum%20Score/README.md)  |  `位运算`,`数组`,`动态规划`,`状态压缩`,`矩阵`  |  困难  |  第 413 场周赛  |
 |  3277  |  [查询子数组最大异或值](/solution/3200-3299/3277.Maximum%20XOR%20Score%20Subarray%20Queries/README.md)  |  `数组`,`动态规划`  |  困难  |  第 413 场周赛  |
 |  3278  |  [寻找数据科学家职位的候选人 II](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README.md)  |  `数据库`  |  中等  |  🔒  |
-|  3279  |  [Maximum Total Area Occupied by Pistons](/solution/3200-3299/3279.Maximum%20Total%20Area%20Occupied%20by%20Pistons/README.md)  |    |  困难  |  🔒  |
-|  3280  |  [将日期转换为二进制表示](/solution/3200-3299/3280.Convert%20Date%20to%20Binary/README.md)  |    |  简单  |  第 414 场周赛  |
-|  3281  |  [范围内整数的最大得分](/solution/3200-3299/3281.Maximize%20Score%20of%20Numbers%20in%20Ranges/README.md)  |    |  中等  |  第 414 场周赛  |
-|  3282  |  [到达数组末尾的最大得分](/solution/3200-3299/3282.Reach%20End%20of%20Array%20With%20Max%20Score/README.md)  |    |  中等  |  第 414 场周赛  |
-|  3283  |  [吃掉所有兵需要的最多移动次数](/solution/3200-3299/3283.Maximum%20Number%20of%20Moves%20to%20Kill%20All%20Pawns/README.md)  |    |  困难  |  第 414 场周赛  |
+|  3279  |  [Maximum Total Area Occupied by Pistons](/solution/3200-3299/3279.Maximum%20Total%20Area%20Occupied%20by%20Pistons/README.md)  |  `数组`,`哈希表`,`字符串`,`计数`,`前缀和`,`模拟`  |  困难  |  🔒  |
+|  3280  |  [将日期转换为二进制表示](/solution/3200-3299/3280.Convert%20Date%20to%20Binary/README.md)  |  `数学`,`字符串`  |  简单  |  第 414 场周赛  |
+|  3281  |  [范围内整数的最大得分](/solution/3200-3299/3281.Maximize%20Score%20of%20Numbers%20in%20Ranges/README.md)  |  `贪心`,`数组`,`二分查找`,`排序`  |  中等  |  第 414 场周赛  |
+|  3282  |  [到达数组末尾的最大得分](/solution/3200-3299/3282.Reach%20End%20of%20Array%20With%20Max%20Score/README.md)  |  `贪心`,`数组`  |  中等  |  第 414 场周赛  |
+|  3283  |  [吃掉所有兵需要的最多移动次数](/solution/3200-3299/3283.Maximum%20Number%20of%20Moves%20to%20Kill%20All%20Pawns/README.md)  |  `位运算`,`广度优先搜索`,`数组`,`数学`,`状态压缩`,`博弈`  |  困难  |  第 414 场周赛  |
 
 ## 版权
 
diff --git a/solution/README_EN.md b/solution/README_EN.md
index 70190739b7b31..8a87a205c08db 100644
--- a/solution/README_EN.md
+++ b/solution/README_EN.md
@@ -1375,7 +1375,7 @@ Press Control + F(or Command + F on
 |  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  |
+|  1367  |  [Linked List in Binary Tree](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README_EN.md)  |  `Tree`,`Depth-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  |
@@ -2480,7 +2480,7 @@ Press Control + F(or Command + F on
 |  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  |
+|  2472  |  [Maximum Number of Non-overlapping Palindrome Substrings](/solution/2400-2499/2472.Maximum%20Number%20of%20Non-overlapping%20Palindrome%20Substrings/README_EN.md)  |  `Greedy`,`Two Pointers`,`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  |
@@ -3287,11 +3287,11 @@ Press Control + F(or Command + F on
 |  3276  |  [Select Cells in Grid With Maximum Score](/solution/3200-3299/3276.Select%20Cells%20in%20Grid%20With%20Maximum%20Score/README_EN.md)  |  `Bit Manipulation`,`Array`,`Dynamic Programming`,`Bitmask`,`Matrix`  |  Hard  |  Weekly Contest 413  |
 |  3277  |  [Maximum XOR Score Subarray Queries](/solution/3200-3299/3277.Maximum%20XOR%20Score%20Subarray%20Queries/README_EN.md)  |  `Array`,`Dynamic Programming`  |  Hard  |  Weekly Contest 413  |
 |  3278  |  [Find Candidates for Data Scientist Position II](/solution/3200-3299/3278.Find%20Candidates%20for%20Data%20Scientist%20Position%20II/README_EN.md)  |  `Database`  |  Medium  |  🔒  |
-|  3279  |  [Maximum Total Area Occupied by Pistons](/solution/3200-3299/3279.Maximum%20Total%20Area%20Occupied%20by%20Pistons/README_EN.md)  |    |  Hard  |  🔒  |
-|  3280  |  [Convert Date to Binary](/solution/3200-3299/3280.Convert%20Date%20to%20Binary/README_EN.md)  |    |  Easy  |  Weekly Contest 414  |
-|  3281  |  [Maximize Score of Numbers in Ranges](/solution/3200-3299/3281.Maximize%20Score%20of%20Numbers%20in%20Ranges/README_EN.md)  |    |  Medium  |  Weekly Contest 414  |
-|  3282  |  [Reach End of Array With Max Score](/solution/3200-3299/3282.Reach%20End%20of%20Array%20With%20Max%20Score/README_EN.md)  |    |  Medium  |  Weekly Contest 414  |
-|  3283  |  [Maximum Number of Moves to Kill All Pawns](/solution/3200-3299/3283.Maximum%20Number%20of%20Moves%20to%20Kill%20All%20Pawns/README_EN.md)  |    |  Hard  |  Weekly Contest 414  |
+|  3279  |  [Maximum Total Area Occupied by Pistons](/solution/3200-3299/3279.Maximum%20Total%20Area%20Occupied%20by%20Pistons/README_EN.md)  |  `Array`,`Hash Table`,`String`,`Counting`,`Prefix Sum`,`Simulation`  |  Hard  |  🔒  |
+|  3280  |  [Convert Date to Binary](/solution/3200-3299/3280.Convert%20Date%20to%20Binary/README_EN.md)  |  `Math`,`String`  |  Easy  |  Weekly Contest 414  |
+|  3281  |  [Maximize Score of Numbers in Ranges](/solution/3200-3299/3281.Maximize%20Score%20of%20Numbers%20in%20Ranges/README_EN.md)  |  `Greedy`,`Array`,`Binary Search`,`Sorting`  |  Medium  |  Weekly Contest 414  |
+|  3282  |  [Reach End of Array With Max Score](/solution/3200-3299/3282.Reach%20End%20of%20Array%20With%20Max%20Score/README_EN.md)  |  `Greedy`,`Array`  |  Medium  |  Weekly Contest 414  |
+|  3283  |  [Maximum Number of Moves to Kill All Pawns](/solution/3200-3299/3283.Maximum%20Number%20of%20Moves%20to%20Kill%20All%20Pawns/README_EN.md)  |  `Bit Manipulation`,`Breadth-First Search`,`Array`,`Math`,`Bitmask`,`Game Theory`  |  Hard  |  Weekly Contest 414  |
 
 ## Copyright