From bb8cf5786cf2ae1ee1a6a9fb404bd189012b11c6 Mon Sep 17 00:00:00 2001
From: acbin <44314231+acbin@users.noreply.github.com>
Date: Sun, 17 Dec 2023 04:40:23 +0000
Subject: [PATCH] feat: add weekly contest 376
---
.../README.md | 85 +++++++++++++++
.../README_EN.md | 73 +++++++++++++
.../README.md | 92 ++++++++++++++++
.../README_EN.md | 82 ++++++++++++++
.../README.md | 103 ++++++++++++++++++
.../README_EN.md | 93 ++++++++++++++++
.../README.md | 96 ++++++++++++++++
.../README_EN.md | 86 +++++++++++++++
solution/CONTEST_README.md | 7 ++
solution/CONTEST_README_EN.md | 7 ++
solution/README.md | 4 +
solution/README_EN.md | 4 +
solution/summary.md | 4 +
solution/summary_en.md | 4 +
14 files changed, 740 insertions(+)
create mode 100644 solution/2900-2999/2965.Find Missing and Repeated Values/README.md
create mode 100644 solution/2900-2999/2965.Find Missing and Repeated Values/README_EN.md
create mode 100644 solution/2900-2999/2966.Divide Array Into Arrays With Max Difference/README.md
create mode 100644 solution/2900-2999/2966.Divide Array Into Arrays With Max Difference/README_EN.md
create mode 100644 solution/2900-2999/2967.Minimum Cost to Make Array Equalindromic/README.md
create mode 100644 solution/2900-2999/2967.Minimum Cost to Make Array Equalindromic/README_EN.md
create mode 100644 solution/2900-2999/2968.Apply Operations to Maximize Frequency Score/README.md
create mode 100644 solution/2900-2999/2968.Apply Operations to Maximize Frequency Score/README_EN.md
diff --git a/solution/2900-2999/2965.Find Missing and Repeated Values/README.md b/solution/2900-2999/2965.Find Missing and Repeated Values/README.md
new file mode 100644
index 0000000000000..a7ccb011dbbec
--- /dev/null
+++ b/solution/2900-2999/2965.Find Missing and Repeated Values/README.md
@@ -0,0 +1,85 @@
+# [2965. 找出缺失和重复的数字](https://leetcode.cn/problems/find-missing-and-repeated-values)
+
+[English Version](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README_EN.md)
+
+## 题目描述
+
+
+
+给你一个下标从 0 开始的二维整数矩阵 grid，大小为 n * n ，其中的值在 [1, n2] 范围内。除了 a 出现 两次，b 缺失 之外，每个整数都 恰好出现一次 。
+
+任务是找出重复的数字a 和缺失的数字 b 。
+
+返回一个下标从 0 开始、长度为 2 的整数数组 ans ，其中 ans[0] 等于 a ，ans[1] 等于 b 。
+
+
+
+示例 1：
+
+
+输入：grid = [[1,3],[2,2]]
+输出：[2,4]
+解释：数字 2 重复，数字 4 缺失，所以答案是 [2,4] 。
+
+
+示例 2：
+
+
+输入：grid = [[9,1,7],[8,9,2],[3,4,6]]
+输出：[9,5]
+解释：数字 9 重复，数字 5 缺失，所以答案是 [9,5] 。
+
+
+
+
+提示：
+
+
+ 2 <= n == grid.length == grid[i].length <= 501 <= grid[i][j] <= n * n- 对于所有满足
1 <= x <= n * n 的 x ，恰好存在一个 x 与矩阵中的任何成员都不相等。
+ - 对于所有满足
1 <= x <= n * n 的 x ，恰好存在一个 x 与矩阵中的两个成员相等。
+ - 除上述的两个之外，对于所有满足
1 <= x <= n * n 的 x ，都恰好存在一对 i, j 满足 0 <= i, j <= n - 1 且 grid[i][j] == x 。
+
+
+## 解法
+
+
+
+
+
+### **Python3**
+
+
+
+```python
+
+```
+
+### **Java**
+
+
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2900-2999/2965.Find Missing and Repeated Values/README_EN.md b/solution/2900-2999/2965.Find Missing and Repeated Values/README_EN.md
new file mode 100644
index 0000000000000..add969d22e787
--- /dev/null
+++ b/solution/2900-2999/2965.Find Missing and Repeated Values/README_EN.md
@@ -0,0 +1,73 @@
+# [2965. Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values)
+
+[中文文档](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README.md)
+
+## Description
+
+You are given a 0-indexed 2D integer matrix grid of size n * n with values in the range [1, n2]. Each integer appears exactly once except a which appears twice and b which is missing. The task is to find the repeating and missing numbers a and b.
+
+Return a 0-indexed integer array ans of size 2 where ans[0] equals to a and ans[1] equals to b.
+
+
+Example 1:
+
+
+Input: grid = [[1,3],[2,2]]
+Output: [2,4]
+Explanation: Number 2 is repeated and number 4 is missing so the answer is [2,4].
+
+
+Example 2:
+
+
+Input: grid = [[9,1,7],[8,9,2],[3,4,6]]
+Output: [9,5]
+Explanation: Number 9 is repeated and number 5 is missing so the answer is [9,5].
+
+
+
+Constraints:
+
+
+ 2 <= n == grid.length == grid[i].length <= 501 <= grid[i][j] <= n * n- For all
x that 1 <= x <= n * n there is exactly one x that is not equal to any of the grid members.
+ - For all
x that 1 <= x <= n * n there is exactly one x that is equal to exactly two of the grid members.
+ - For all
x that 1 <= x <= n * n except two of them there is exatly one pair of i, j that 0 <= i, j <= n - 1 and grid[i][j] == x.
+
+
+## Solutions
+
+
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2900-2999/2966.Divide Array Into Arrays With Max Difference/README.md b/solution/2900-2999/2966.Divide Array Into Arrays With Max Difference/README.md
new file mode 100644
index 0000000000000..1c8248e8dcf22
--- /dev/null
+++ b/solution/2900-2999/2966.Divide Array Into Arrays With Max Difference/README.md
@@ -0,0 +1,92 @@
+# [2966. 划分数组并满足最大差限制](https://leetcode.cn/problems/divide-array-into-arrays-with-max-difference)
+
+[English Version](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README_EN.md)
+
+## 题目描述
+
+
+
+给你一个长度为 n 的整数数组 nums，以及一个正整数 k 。
+
+将这个数组划分为一个或多个长度为 3 的子数组，并满足以下条件：
+
+
+ nums 中的 每个 元素都必须 恰好 存在于某个子数组中。- 子数组中 任意 两个元素的差必须小于或等于
k 。
+
+
+返回一个 二维数组 ，包含所有的子数组。如果不可能满足条件，就返回一个空数组。如果有多个答案，返回 任意一个 即可。
+
+
+
+示例 1：
+
+
+输入：nums = [1,3,4,8,7,9,3,5,1], k = 2
+输出：[[1,1,3],[3,4,5],[7,8,9]]
+解释：可以将数组划分为以下子数组：[1,1,3]，[3,4,5] 和 [7,8,9] 。
+每个子数组中任意两个元素的差都小于或等于 2 。
+注意，元素的顺序并不重要。
+
+
+示例 2：
+
+
+输入：nums = [1,3,3,2,7,3], k = 3
+输出：[]
+解释：无法划分数组满足所有条件。
+
+
+
+
+提示：
+
+
+ n == nums.length1 <= n <= 105n 是 3 的倍数1 <= nums[i] <= 1051 <= k <= 105
+
+## 解法
+
+
+
+
+
+### **Python3**
+
+
+
+```python
+
+```
+
+### **Java**
+
+
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2900-2999/2966.Divide Array Into Arrays With Max Difference/README_EN.md b/solution/2900-2999/2966.Divide Array Into Arrays With Max Difference/README_EN.md
new file mode 100644
index 0000000000000..8c6739fb26aaf
--- /dev/null
+++ b/solution/2900-2999/2966.Divide Array Into Arrays With Max Difference/README_EN.md
@@ -0,0 +1,82 @@
+# [2966. Divide Array Into Arrays With Max Difference](https://leetcode.com/problems/divide-array-into-arrays-with-max-difference)
+
+[中文文档](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README.md)
+
+## Description
+
+You are given an integer array nums of size n and a positive integer k.
+
+Divide the array into one or more arrays of size 3 satisfying the following conditions:
+
+
+ - Each element of
nums should be in exactly one array.
+ - The difference between any two elements in one array is less than or equal to
k.
+
+
+Return a 2D array containing all the arrays. If it is impossible to satisfy the conditions, return an empty array. And if there are multiple answers, return any of them.
+
+
+Example 1:
+
+
+Input: nums = [1,3,4,8,7,9,3,5,1], k = 2
+Output: [[1,1,3],[3,4,5],[7,8,9]]
+Explanation: We can divide the array into the following arrays: [1,1,3], [3,4,5] and [7,8,9].
+The difference between any two elements in each array is less than or equal to 2.
+Note that the order of elements is not important.
+
+
+Example 2:
+
+
+Input: nums = [1,3,3,2,7,3], k = 3
+Output: []
+Explanation: It is not possible to divide the array satisfying all the conditions.
+
+
+
+Constraints:
+
+
+ n == nums.length1 <= n <= 105n is a multiple of 3.1 <= nums[i] <= 1051 <= k <= 105
+
+## Solutions
+
+
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2900-2999/2967.Minimum Cost to Make Array Equalindromic/README.md b/solution/2900-2999/2967.Minimum Cost to Make Array Equalindromic/README.md
new file mode 100644
index 0000000000000..d72a88ca8090e
--- /dev/null
+++ b/solution/2900-2999/2967.Minimum Cost to Make Array Equalindromic/README.md
@@ -0,0 +1,103 @@
+# [2967. 使数组成为等数数组的最小代价](https://leetcode.cn/problems/minimum-cost-to-make-array-equalindromic)
+
+[English Version](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README_EN.md)
+
+## 题目描述
+
+
+
+给你一个长度为 n 下标从 0 开始的整数数组 nums 。
+
+你可以对 nums 执行特殊操作 任意次 （也可以 0 次）。每一次特殊操作中，你需要 按顺序 执行以下步骤：
+
+
+ - 从范围
[0, n - 1] 里选择一个下标 i 和一个 正 整数 x 。
+ - 将
|nums[i] - x| 添加到总代价里。
+ - 将
nums[i] 变为 x 。
+
+
+如果一个正整数正着读和反着读都相同，那么我们称这个数是 回文数 。比方说，121 ，2552 和 65756 都是回文数，但是 24 ，46 ，235 都不是回文数。
+
+如果一个数组中的所有元素都等于一个整数 y ，且 y 是一个小于 109 的 回文数 ，那么我们称这个数组是一个 等数数组 。
+
+请你返回一个整数，表示执行任意次特殊操作后使 nums 成为 等数数组 的 最小 总代价。
+
+
+
+示例 1：
+
+
+输入：nums = [1,2,3,4,5]
+输出：6
+解释：我们可以将数组中所有元素变为回文数 3 得到等数数组，数组变成 [3,3,3,3,3] 需要执行 4 次特殊操作，代价为 |1 - 3| + |2 - 3| + |4 - 3| + |5 - 3| = 6 。
+将所有元素变为其他回文数的总代价都大于 6 。
+
+
+示例 2：
+
+
+输入：nums = [10,12,13,14,15]
+输出：11
+解释：我们可以将数组中所有元素变为回文数 11 得到等数数组，数组变成 [11,11,11,11,11] 需要执行 5 次特殊操作，代价为 |10 - 11| + |12 - 11| + |13 - 11| + |14 - 11| + |15 - 11| = 11 。
+将所有元素变为其他回文数的总代价都大于 11 。
+
+
+示例 3 ：
+
+
+输入：nums = [22,33,22,33,22]
+输出：22
+解释：我们可以将数组中所有元素变为回文数 22 得到等数数组，数组变为 [22,22,22,22,22] 需要执行 2 次特殊操作，代价为 |33 - 22| + |33 - 22| = 22 。
+将所有元素变为其他回文数的总代价都大于 22 。
+
+
+
+
+提示：
+
+
+ 1 <= n <= 1051 <= nums[i] <= 109
+
+## 解法
+
+
+
+
+
+### **Python3**
+
+
+
+```python
+
+```
+
+### **Java**
+
+
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2900-2999/2967.Minimum Cost to Make Array Equalindromic/README_EN.md b/solution/2900-2999/2967.Minimum Cost to Make Array Equalindromic/README_EN.md
new file mode 100644
index 0000000000000..2e9b90c469847
--- /dev/null
+++ b/solution/2900-2999/2967.Minimum Cost to Make Array Equalindromic/README_EN.md
@@ -0,0 +1,93 @@
+# [2967. Minimum Cost to Make Array Equalindromic](https://leetcode.com/problems/minimum-cost-to-make-array-equalindromic)
+
+[中文文档](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README.md)
+
+## Description
+
+You are given a 0-indexed integer array nums having length n.
+
+You are allowed to perform a special move any number of times (including zero) on nums. In one special move you perform the following steps in order:
+
+
+ - Choose an index
i in the range [0, n - 1], and a positive integer x.
+ - Add
|nums[i] - x| to the total cost.
+ - Change the value of
nums[i] to x.
+
+
+A palindromic number is a positive integer that remains the same when its digits are reversed. For example, 121, 2552 and 65756 are palindromic numbers whereas 24, 46, 235 are not palindromic numbers.
+
+An array is considered equalindromic if all the elements in the array are equal to an integer y, where y is a palindromic number less than 109.
+
+Return an integer denoting the minimum possible total cost to make nums equalindromic by performing any number of special moves.
+
+
+Example 1:
+
+
+Input: nums = [1,2,3,4,5]
+Output: 6
+Explanation: We can make the array equalindromic by changing all elements to 3 which is a palindromic number. The cost of changing the array to [3,3,3,3,3] using 4 special moves is given by |1 - 3| + |2 - 3| + |4 - 3| + |5 - 3| = 6.
+It can be shown that changing all elements to any palindromic number other than 3 cannot be achieved at a lower cost.
+
+
+Example 2:
+
+
+Input: nums = [10,12,13,14,15]
+Output: 11
+Explanation: We can make the array equalindromic by changing all elements to 11 which is a palindromic number. The cost of changing the array to [11,11,11,11,11] using 5 special moves is given by |10 - 11| + |12 - 11| + |13 - 11| + |14 - 11| + |15 - 11| = 11.
+It can be shown that changing all elements to any palindromic number other than 11 cannot be achieved at a lower cost.
+
+
+Example 3:
+
+
+Input: nums = [22,33,22,33,22]
+Output: 22
+Explanation: We can make the array equalindromic by changing all elements to 22 which is a palindromic number. The cost of changing the array to [22,22,22,22,22] using 2 special moves is given by |33 - 22| + |33 - 22| = 22.
+It can be shown that changing all elements to any palindromic number other than 22 cannot be achieved at a lower cost.
+
+
+
+Constraints:
+
+
+ 1 <= n <= 1051 <= nums[i] <= 109
+
+## Solutions
+
+
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2900-2999/2968.Apply Operations to Maximize Frequency Score/README.md b/solution/2900-2999/2968.Apply Operations to Maximize Frequency Score/README.md
new file mode 100644
index 0000000000000..ccb8f0392b6cb
--- /dev/null
+++ b/solution/2900-2999/2968.Apply Operations to Maximize Frequency Score/README.md
@@ -0,0 +1,96 @@
+# [2968. 执行操作使频率分数最大](https://leetcode.cn/problems/apply-operations-to-maximize-frequency-score)
+
+[English Version](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README_EN.md)
+
+## 题目描述
+
+
+
+给你一个下标从 0 开始的整数数组 nums 和一个整数 k 。
+
+你可以对数组执行 至多 k 次操作：
+
+
+ - 从数组中选择一个下标
i ，将 nums[i] 增加 或者 减少 1 。
+
+
+最终数组的频率分数定义为数组中众数的 频率 。
+
+请你返回你可以得到的 最大 频率分数。
+
+众数指的是数组中出现次数最多的数。一个元素的频率指的是数组中这个元素的出现次数。
+
+
+
+示例 1：
+
+
+输入：nums = [1,2,6,4], k = 3
+输出：3
+解释：我们可以对数组执行以下操作：
+- 选择 i = 0 ，将 nums[0] 增加 1 。得到数组 [2,2,6,4] 。
+- 选择 i = 3 ，将 nums[3] 减少 1 ，得到数组 [2,2,6,3] 。
+- 选择 i = 3 ，将 nums[3] 减少 1 ，得到数组 [2,2,6,2] 。
+元素 2 是最终数组中的众数，出现了 3 次，所以频率分数为 3 。
+3 是所有可行方案里的最大频率分数。
+
+
+示例 2：
+
+
+输入：nums = [1,4,4,2,4], k = 0
+输出：3
+解释：我们无法执行任何操作，所以得到的频率分数是原数组中众数的频率 3 。
+
+
+
+
+提示：
+
+
+ 1 <= nums.length <= 1051 <= nums[i] <= 1090 <= k <= 1014
+
+## 解法
+
+
+
+
+
+### **Python3**
+
+
+
+```python
+
+```
+
+### **Java**
+
+
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2900-2999/2968.Apply Operations to Maximize Frequency Score/README_EN.md b/solution/2900-2999/2968.Apply Operations to Maximize Frequency Score/README_EN.md
new file mode 100644
index 0000000000000..5af4970451bd1
--- /dev/null
+++ b/solution/2900-2999/2968.Apply Operations to Maximize Frequency Score/README_EN.md
@@ -0,0 +1,86 @@
+# [2968. Apply Operations to Maximize Frequency Score](https://leetcode.com/problems/apply-operations-to-maximize-frequency-score)
+
+[中文文档](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README.md)
+
+## Description
+
+You are given a 0-indexed integer array nums and an integer k.
+
+You can perform the following operation on the array at most k times:
+
+
+ - Choose any index
i from the array and increase or decrease nums[i] by 1.
+
+
+The score of the final array is the frequency of the most frequent element in the array.
+
+Return the maximum score you can achieve.
+
+The frequency of an element is the number of occurences of that element in the array.
+
+
+Example 1:
+
+
+Input: nums = [1,2,6,4], k = 3
+Output: 3
+Explanation: We can do the following operations on the array:
+- Choose i = 0, and increase the value of nums[0] by 1. The resulting array is [2,2,6,4].
+- Choose i = 3, and decrease the value of nums[3] by 1. The resulting array is [2,2,6,3].
+- Choose i = 3, and decrease the value of nums[3] by 1. The resulting array is [2,2,6,2].
+The element 2 is the most frequent in the final array so our score is 3.
+It can be shown that we cannot achieve a better score.
+
+
+Example 2:
+
+
+Input: nums = [1,4,4,2,4], k = 0
+Output: 3
+Explanation: We cannot apply any operations so our score will be the frequency of the most frequent element in the original array, which is 3.
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 1051 <= nums[i] <= 1090 <= k <= 1014
+
+## Solutions
+
+
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/CONTEST_README.md b/solution/CONTEST_README.md
index bfb3c200c07ea..efc40bbb12da5 100644
--- a/solution/CONTEST_README.md
+++ b/solution/CONTEST_README.md
@@ -22,6 +22,13 @@
## 往期竞赛
+#### 第 376 场周赛(2023-12-17 10:30, 90 分钟) 参赛人数 3409
+
+- [2965. 找出缺失和重复的数字](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README.md)
+- [2966. 划分数组并满足最大差限制](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README.md)
+- [2967. 使数组成为等数数组的最小代价](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README.md)
+- [2968. 执行操作使频率分数最大](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README.md)
+
#### 第 375 场周赛(2023-12-10 10:30, 90 分钟) 参赛人数 3518
- [2960. 统计已测试设备](/solution/2900-2999/2960.Count%20Tested%20Devices%20After%20Test%20Operations/README.md)
diff --git a/solution/CONTEST_README_EN.md b/solution/CONTEST_README_EN.md
index 4340ca2b4d553..86b32036bc22d 100644
--- a/solution/CONTEST_README_EN.md
+++ b/solution/CONTEST_README_EN.md
@@ -25,6 +25,13 @@ Get your rating changes right after the completion of LeetCode contests, https:/
## Past Contests
+#### Weekly Contest 376
+
+- [2965. Find Missing and Repeated Values](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README_EN.md)
+- [2966. Divide Array Into Arrays With Max Difference](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README_EN.md)
+- [2967. Minimum Cost to Make Array Equalindromic](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README_EN.md)
+- [2968. Apply Operations to Maximize Frequency Score](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README_EN.md)
+
#### Weekly Contest 375
- [2960. Count Tested Devices After Test Operations](/solution/2900-2999/2960.Count%20Tested%20Devices%20After%20Test%20Operations/README_EN.md)
diff --git a/solution/README.md b/solution/README.md
index a6035ff538924..9027686fd1c66 100644
--- a/solution/README.md
+++ b/solution/README.md
@@ -2975,6 +2975,10 @@
| 2962 | [统计最大元素出现至少 K 次的子数组](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README.md) | `数组`,`滑动窗口` | 中等 | 第 375 场周赛 |
| 2963 | [统计好分割方案的数目](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README.md) | `数组`,`哈希表`,`数学`,`组合数学` | 困难 | 第 375 场周赛 |
| 2964 | [Number of Divisible Triplet Sums](/solution/2900-2999/2964.Number%20of%20Divisible%20Triplet%20Sums/README.md) | | 中等 | 🔒 |
+| 2965 | [找出缺失和重复的数字](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README.md) | | 简单 | 第 376 场周赛 |
+| 2966 | [划分数组并满足最大差限制](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README.md) | | 中等 | 第 376 场周赛 |
+| 2967 | [使数组成为等数数组的最小代价](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README.md) | | 中等 | 第 376 场周赛 |
+| 2968 | [执行操作使频率分数最大](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README.md) | | 困难 | 第 376 场周赛 |
## 版权
diff --git a/solution/README_EN.md b/solution/README_EN.md
index d03d1761e03ff..a02b5ce25f38a 100644
--- a/solution/README_EN.md
+++ b/solution/README_EN.md
@@ -2973,6 +2973,10 @@ Press Control + F(or Command + F on
| 2962 | [Count Subarrays Where Max Element Appears at Least K Times](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README_EN.md) | `Array`,`Sliding Window` | Medium | Weekly Contest 375 |
| 2963 | [Count the Number of Good Partitions](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README_EN.md) | `Array`,`Hash Table`,`Math`,`Combinatorics` | Hard | Weekly Contest 375 |
| 2964 | [Number of Divisible Triplet Sums](/solution/2900-2999/2964.Number%20of%20Divisible%20Triplet%20Sums/README_EN.md) | | Medium | 🔒 |
+| 2965 | [Find Missing and Repeated Values](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README_EN.md) | | Easy | Weekly Contest 376 |
+| 2966 | [Divide Array Into Arrays With Max Difference](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README_EN.md) | | Medium | Weekly Contest 376 |
+| 2967 | [Minimum Cost to Make Array Equalindromic](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README_EN.md) | | Medium | Weekly Contest 376 |
+| 2968 | [Apply Operations to Maximize Frequency Score](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README_EN.md) | | Hard | Weekly Contest 376 |
## Copyright
diff --git a/solution/summary.md b/solution/summary.md
index ccb77c3e8a1df..c0c71264c584e 100644
--- a/solution/summary.md
+++ b/solution/summary.md
@@ -3022,3 +3022,7 @@
- [2962.统计最大元素出现至少 K 次的子数组](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README.md)
- [2963.统计好分割方案的数目](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README.md)
- [2964.Number of Divisible Triplet Sums](/solution/2900-2999/2964.Number%20of%20Divisible%20Triplet%20Sums/README.md)
+ - [2965.找出缺失和重复的数字](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README.md)
+ - [2966.划分数组并满足最大差限制](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README.md)
+ - [2967.使数组成为等数数组的最小代价](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README.md)
+ - [2968.执行操作使频率分数最大](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README.md)
diff --git a/solution/summary_en.md b/solution/summary_en.md
index 3750c3e3d2966..8ca362264e6c1 100644
--- a/solution/summary_en.md
+++ b/solution/summary_en.md
@@ -3022,3 +3022,7 @@
- [2962.Count Subarrays Where Max Element Appears at Least K Times](/solution/2900-2999/2962.Count%20Subarrays%20Where%20Max%20Element%20Appears%20at%20Least%20K%20Times/README_EN.md)
- [2963.Count the Number of Good Partitions](/solution/2900-2999/2963.Count%20the%20Number%20of%20Good%20Partitions/README_EN.md)
- [2964.Number of Divisible Triplet Sums](/solution/2900-2999/2964.Number%20of%20Divisible%20Triplet%20Sums/README_EN.md)
+ - [2965.Find Missing and Repeated Values](/solution/2900-2999/2965.Find%20Missing%20and%20Repeated%20Values/README_EN.md)
+ - [2966.Divide Array Into Arrays With Max Difference](/solution/2900-2999/2966.Divide%20Array%20Into%20Arrays%20With%20Max%20Difference/README_EN.md)
+ - [2967.Minimum Cost to Make Array Equalindromic](/solution/2900-2999/2967.Minimum%20Cost%20to%20Make%20Array%20Equalindromic/README_EN.md)
+ - [2968.Apply Operations to Maximize Frequency Score](/solution/2900-2999/2968.Apply%20Operations%20to%20Maximize%20Frequency%20Score/README_EN.md)