diff --git a/solution/2800-2899/2873.Maximum Value of an Ordered Triplet I/README.md b/solution/2800-2899/2873.Maximum Value of an Ordered Triplet I/README.md
new file mode 100644
index 0000000000000..c11b140efb601
--- /dev/null
+++ b/solution/2800-2899/2873.Maximum Value of an Ordered Triplet I/README.md
@@ -0,0 +1,92 @@
+# [2873. 有序三元组中的最大值 I](https://leetcode.cn/problems/maximum-value-of-an-ordered-triplet-i)
+
+[English Version](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README_EN.md)
+
+## 题目描述
+
+
+
+给你一个下标从 0 开始的整数数组 nums 。
+
+请你从所有满足 i < j < k 的下标三元组 (i, j, k) 中，找出并返回下标三元组的最大值。如果所有满足条件的三元组的值都是负数，则返回 0 。
+
+下标三元组 (i, j, k) 的值等于 (nums[i] - nums[j]) * nums[k] 。
+
+
+
+示例 1：
+
+
+输入：nums = [12,6,1,2,7]
+输出：77
+解释：下标三元组 (0, 2, 4) 的值是 (nums[0] - nums[2]) * nums[4] = 77 。
+可以证明不存在值大于 77 的有序下标三元组。
+
+
+示例 2：
+
+
+输入：nums = [1,10,3,4,19]
+输出：133
+解释：下标三元组 (1, 2, 4) 的值是 (nums[1] - nums[2]) * nums[4] = 133 。
+可以证明不存在值大于 133 的有序下标三元组。
+
+
+示例 3：
+
+
+输入：nums = [1,2,3]
+输出：0
+解释：唯一的下标三元组 (0, 1, 2) 的值是一个负数，(nums[0] - nums[1]) * nums[2] = -3 。因此，答案是 0 。
+
+
+
+
+提示：
+
+
+ 3 <= nums.length <= 1001 <= nums[i] <= 106
+
+## 解法
+
+
+
+
+
+### **Python3**
+
+
+
+```python
+
+```
+
+### **Java**
+
+
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2800-2899/2873.Maximum Value of an Ordered Triplet I/README_EN.md b/solution/2800-2899/2873.Maximum Value of an Ordered Triplet I/README_EN.md
new file mode 100644
index 0000000000000..20a21591ad0b8
--- /dev/null
+++ b/solution/2800-2899/2873.Maximum Value of an Ordered Triplet I/README_EN.md
@@ -0,0 +1,82 @@
+# [2873. Maximum Value of an Ordered Triplet I](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i)
+
+[中文文档](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README.md)
+
+## Description
+
+You are given a 0-indexed integer array nums.
+
+Return the maximum value over all triplets of indices (i, j, k) such that i < j < k. If all such triplets have a negative value, return 0.
+
+The value of a triplet of indices (i, j, k) is equal to (nums[i] - nums[j]) * nums[k].
+
+
+Example 1:
+
+
+Input: nums = [12,6,1,2,7]
+Output: 77
+Explanation: The value of the triplet (0, 2, 4) is (nums[0] - nums[2]) * nums[4] = 77.
+It can be shown that there are no ordered triplets of indices with a value greater than 77.
+
+
+Example 2:
+
+
+Input: nums = [1,10,3,4,19]
+Output: 133
+Explanation: The value of the triplet (1, 2, 4) is (nums[1] - nums[2]) * nums[4] = 133.
+It can be shown that there are no ordered triplets of indices with a value greater than 133.
+
+
+Example 3:
+
+
+Input: nums = [1,2,3]
+Output: 0
+Explanation: The only ordered triplet of indices (0, 1, 2) has a negative value of (nums[0] - nums[1]) * nums[2] = -3. Hence, the answer would be 0.
+
+
+
+Constraints:
+
+
+ 3 <= nums.length <= 1001 <= nums[i] <= 106
+
+## Solutions
+
+
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2800-2899/2874.Maximum Value of an Ordered Triplet II/README.md b/solution/2800-2899/2874.Maximum Value of an Ordered Triplet II/README.md
new file mode 100644
index 0000000000000..1eb14620c1f1c
--- /dev/null
+++ b/solution/2800-2899/2874.Maximum Value of an Ordered Triplet II/README.md
@@ -0,0 +1,92 @@
+# [2874. 有序三元组中的最大值 II](https://leetcode.cn/problems/maximum-value-of-an-ordered-triplet-ii)
+
+[English Version](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README_EN.md)
+
+## 题目描述
+
+
+
+给你一个下标从 0 开始的整数数组 nums 。
+
+请你从所有满足 i < j < k 的下标三元组 (i, j, k) 中，找出并返回下标三元组的最大值。如果所有满足条件的三元组的值都是负数，则返回 0 。
+
+下标三元组 (i, j, k) 的值等于 (nums[i] - nums[j]) * nums[k] 。
+
+
+
+示例 1：
+
+
+输入：nums = [12,6,1,2,7]
+输出：77
+解释：下标三元组 (0, 2, 4) 的值是 (nums[0] - nums[2]) * nums[4] = 77 。
+可以证明不存在值大于 77 的有序下标三元组。
+
+
+示例 2：
+
+
+输入：nums = [1,10,3,4,19]
+输出：133
+解释：下标三元组 (1, 2, 4) 的值是 (nums[1] - nums[2]) * nums[4] = 133 。
+可以证明不存在值大于 133 的有序下标三元组。
+
+
+示例 3：
+
+
+输入：nums = [1,2,3]
+输出：0
+解释：唯一的下标三元组 (0, 1, 2) 的值是一个负数，(nums[0] - nums[1]) * nums[2] = -3 。因此，答案是 0 。
+
+
+
+
+提示：
+
+
+ 3 <= nums.length <= 1051 <= nums[i] <= 106
+
+## 解法
+
+
+
+
+
+### **Python3**
+
+
+
+```python
+
+```
+
+### **Java**
+
+
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2800-2899/2874.Maximum Value of an Ordered Triplet II/README_EN.md b/solution/2800-2899/2874.Maximum Value of an Ordered Triplet II/README_EN.md
new file mode 100644
index 0000000000000..4562ad5ba8966
--- /dev/null
+++ b/solution/2800-2899/2874.Maximum Value of an Ordered Triplet II/README_EN.md
@@ -0,0 +1,82 @@
+# [2874. Maximum Value of an Ordered Triplet II](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-ii)
+
+[中文文档](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README.md)
+
+## Description
+
+You are given a 0-indexed integer array nums.
+
+Return the maximum value over all triplets of indices (i, j, k) such that i < j < k. If all such triplets have a negative value, return 0.
+
+The value of a triplet of indices (i, j, k) is equal to (nums[i] - nums[j]) * nums[k].
+
+
+Example 1:
+
+
+Input: nums = [12,6,1,2,7]
+Output: 77
+Explanation: The value of the triplet (0, 2, 4) is (nums[0] - nums[2]) * nums[4] = 77.
+It can be shown that there are no ordered triplets of indices with a value greater than 77.
+
+
+Example 2:
+
+
+Input: nums = [1,10,3,4,19]
+Output: 133
+Explanation: The value of the triplet (1, 2, 4) is (nums[1] - nums[2]) * nums[4] = 133.
+It can be shown that there are no ordered triplets of indices with a value greater than 133.
+
+
+Example 3:
+
+
+Input: nums = [1,2,3]
+Output: 0
+Explanation: The only ordered triplet of indices (0, 1, 2) has a negative value of (nums[0] - nums[1]) * nums[2] = -3. Hence, the answer would be 0.
+
+
+
+Constraints:
+
+
+ 3 <= nums.length <= 1051 <= nums[i] <= 106
+
+## Solutions
+
+
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2800-2899/2875.Minimum Size Subarray in Infinite Array/README.md b/solution/2800-2899/2875.Minimum Size Subarray in Infinite Array/README.md
new file mode 100644
index 0000000000000..24e8546c66108
--- /dev/null
+++ b/solution/2800-2899/2875.Minimum Size Subarray in Infinite Array/README.md
@@ -0,0 +1,95 @@
+# [2875. 无限数组的最短子数组](https://leetcode.cn/problems/minimum-size-subarray-in-infinite-array)
+
+[English Version](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README_EN.md)
+
+## 题目描述
+
+
+
+给你一个下标从 0 开始的数组 nums 和一个整数 target 。
+
+下标从 0 开始的数组 infinite_nums 是通过无限地将 nums 的元素追加到自己之后生成的。
+
+请你从 infinite_nums 中找出满足 元素和 等于 target 的 最短 子数组，并返回该子数组的长度。如果不存在满足条件的子数组，返回 -1 。
+
+
+
+示例 1：
+
+
+输入：nums = [1,2,3], target = 5
+输出：2
+解释：在这个例子中 infinite_nums = [1,2,3,1,2,3,1,2,...] 。
+区间 [1,2] 内的子数组的元素和等于 target = 5 ，且长度 length = 2 。
+可以证明，当元素和等于目标值 target = 5 时，2 是子数组的最短长度。
+
+示例 2：
+
+
+输入：nums = [1,1,1,2,3], target = 4
+输出：2
+解释：在这个例子中 infinite_nums = [1,1,1,2,3,1,1,1,2,3,1,1,...].
+区间 [4,5] 内的子数组的元素和等于 target = 4 ，且长度 length = 2 。
+可以证明，当元素和等于目标值 target = 4 时，2 是子数组的最短长度。
+
+
+示例 3：
+
+
+输入：nums = [2,4,6,8], target = 3
+输出：-1
+解释：在这个例子中 infinite_nums = [2,4,6,8,2,4,6,8,...] 。
+可以证明，不存在元素和等于目标值 target = 3 的子数组。
+
+
+
+
+提示：
+
+
+ 1 <= nums.length <= 1051 <= nums[i] <= 1051 <= target <= 109
+
+## 解法
+
+
+
+
+
+### **Python3**
+
+
+
+```python
+
+```
+
+### **Java**
+
+
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2800-2899/2875.Minimum Size Subarray in Infinite Array/README_EN.md b/solution/2800-2899/2875.Minimum Size Subarray in Infinite Array/README_EN.md
new file mode 100644
index 0000000000000..6461327822400
--- /dev/null
+++ b/solution/2800-2899/2875.Minimum Size Subarray in Infinite Array/README_EN.md
@@ -0,0 +1,86 @@
+# [2875. Minimum Size Subarray in Infinite Array](https://leetcode.com/problems/minimum-size-subarray-in-infinite-array)
+
+[中文文档](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README.md)
+
+## Description
+
+You are given a 0-indexed array nums and an integer target.
+
+A 0-indexed array infinite_nums is generated by infinitely appending the elements of nums to itself.
+
+Return the length of the shortest subarray of the array infinite_nums with a sum equal to target. If there is no such subarray return -1.
+
+
+Example 1:
+
+
+Input: nums = [1,2,3], target = 5
+Output: 2
+Explanation: In this example infinite_nums = [1,2,3,1,2,3,1,2,...].
+The subarray in the range [1,2], has the sum equal to target = 5 and length = 2.
+It can be proven that 2 is the shortest length of a subarray with sum equal to target = 5.
+
+
+Example 2:
+
+
+Input: nums = [1,1,1,2,3], target = 4
+Output: 2
+Explanation: In this example infinite_nums = [1,1,1,2,3,1,1,1,2,3,1,1,...].
+The subarray in the range [4,5], has the sum equal to target = 4 and length = 2.
+It can be proven that 2 is the shortest length of a subarray with sum equal to target = 4.
+
+
+Example 3:
+
+
+Input: nums = [2,4,6,8], target = 3
+Output: -1
+Explanation: In this example infinite_nums = [2,4,6,8,2,4,6,8,...].
+It can be proven that there is no subarray with sum equal to target = 3.
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 1051 <= nums[i] <= 1051 <= target <= 109
+
+## Solutions
+
+
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/README.md b/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/README.md
new file mode 100644
index 0000000000000..3af7b84a53f2e
--- /dev/null
+++ b/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/README.md
@@ -0,0 +1,94 @@
+# [2876. 有向图访问计数](https://leetcode.cn/problems/count-visited-nodes-in-a-directed-graph)
+
+[English Version](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README_EN.md)
+
+## 题目描述
+
+
+
+现有一个有向图，其中包含 n 个节点，节点编号从 0 到 n - 1 。此外，该图还包含了 n 条有向边。
+
+给你一个下标从 0 开始的数组 edges ，其中 edges[i] 表示存在一条从节点 i 到节点 edges[i] 的边。
+
+想象在图上发生以下过程：
+
+
+ - 你从节点
x 开始，通过边访问其他节点，直到你在 此过程 中再次访问到之前已经访问过的节点。
+
+
+返回数组 answer 作为答案，其中 answer[i] 表示如果从节点 i 开始执行该过程，你可以访问到的不同节点数。
+
+
+
+示例 1：
+
+
+输入：edges = [1,2,0,0]
+输出：[3,3,3,4]
+解释：从每个节点开始执行该过程，记录如下：
+- 从节点 0 开始，访问节点 0 -> 1 -> 2 -> 0 。访问的不同节点数是 3 。
+- 从节点 1 开始，访问节点 1 -> 2 -> 0 -> 1 。访问的不同节点数是 3 。
+- 从节点 2 开始，访问节点 2 -> 0 -> 1 -> 2 。访问的不同节点数是 3 。
+- 从节点 3 开始，访问节点 3 -> 0 -> 1 -> 2 -> 0 。访问的不同节点数是 4 。
+
+
+示例 2：
+
+
+输入：edges = [1,2,3,4,0]
+输出：[5,5,5,5,5]
+解释：无论从哪个节点开始，在这个过程中，都可以访问到图中的每一个节点。
+
+
+
+
+提示：
+
+
+ n == edges.length2 <= n <= 1050 <= edges[i] <= n - 1edges[i] != i
+
+## 解法
+
+
+
+
+
+### **Python3**
+
+
+
+```python
+
+```
+
+### **Java**
+
+
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/README_EN.md b/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/README_EN.md
new file mode 100644
index 0000000000000..a63b1eab76d01
--- /dev/null
+++ b/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/README_EN.md
@@ -0,0 +1,84 @@
+# [2876. Count Visited Nodes in a Directed Graph](https://leetcode.com/problems/count-visited-nodes-in-a-directed-graph)
+
+[中文文档](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README.md)
+
+## Description
+
+There is a directed graph consisting of n nodes numbered from 0 to n - 1 and n directed edges.
+
+You are given a 0-indexed array edges where edges[i] indicates that there is an edge from node i to node edges[i].
+
+Consider the following process on the graph:
+
+
+ - You start from a node
x and keep visiting other nodes through edges until you reach a node that you have already visited before on this same process.
+
+
+Return an array answer where answer[i] is the number of different nodes that you will visit if you perform the process starting from node i.
+
+
+Example 1:
+
+
+Input: edges = [1,2,0,0]
+Output: [3,3,3,4]
+Explanation: We perform the process starting from each node in the following way:
+- Starting from node 0, we visit the nodes 0 -> 1 -> 2 -> 0. The number of different nodes we visit is 3.
+- Starting from node 1, we visit the nodes 1 -> 2 -> 0 -> 1. The number of different nodes we visit is 3.
+- Starting from node 2, we visit the nodes 2 -> 0 -> 1 -> 2. The number of different nodes we visit is 3.
+- Starting from node 3, we visit the nodes 3 -> 0 -> 1 -> 2 -> 0. The number of different nodes we visit is 4.
+
+
+Example 2:
+
+
+Input: edges = [1,2,3,4,0]
+Output: [5,5,5,5,5]
+Explanation: Starting from any node we can visit every node in the graph in the process.
+
+
+
+Constraints:
+
+
+ n == edges.length2 <= n <= 1050 <= edges[i] <= n - 1edges[i] != i
+
+## Solutions
+
+
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+
diff --git a/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/images/graaph2drawio.png b/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/images/graaph2drawio.png
new file mode 100644
index 0000000000000..b684f32bfc372
Binary files /dev/null and b/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/images/graaph2drawio.png differ
diff --git a/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/images/graaphdrawio-1.png b/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/images/graaphdrawio-1.png
new file mode 100644
index 0000000000000..3a66fd7d4f8cb
Binary files /dev/null and b/solution/2800-2899/2876.Count Visited Nodes in a Directed Graph/images/graaphdrawio-1.png differ
diff --git a/solution/CONTEST_README.md b/solution/CONTEST_README.md
index e208b759bee2a..28f2e07820fbc 100644
--- a/solution/CONTEST_README.md
+++ b/solution/CONTEST_README.md
@@ -22,6 +22,13 @@
## 往期竞赛
+#### 第 365 场周赛(2023-10-01 10:30, 90 分钟) 参赛人数 2909
+
+- [2873. 有序三元组中的最大值 I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README.md)
+- [2874. 有序三元组中的最大值 II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README.md)
+- [2875. 无限数组的最短子数组](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README.md)
+- [2876. 有向图访问计数](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README.md)
+
#### 第 114 场双周赛(2023-09-30 22:30, 90 分钟) 参赛人数 2406
- [2869. 收集元素的最少操作次数](/solution/2800-2899/2869.Minimum%20Operations%20to%20Collect%20Elements/README.md)
diff --git a/solution/CONTEST_README_EN.md b/solution/CONTEST_README_EN.md
index 402e1c5a0b276..792ec1703868c 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 365
+
+- [2873. Maximum Value of an Ordered Triplet I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README_EN.md)
+- [2874. Maximum Value of an Ordered Triplet II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README_EN.md)
+- [2875. Minimum Size Subarray in Infinite Array](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README_EN.md)
+- [2876. Count Visited Nodes in a Directed Graph](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README_EN.md)
+
#### Biweekly Contest 114
- [2869. Minimum Operations to Collect Elements](/solution/2800-2899/2869.Minimum%20Operations%20to%20Collect%20Elements/README_EN.md)
diff --git a/solution/README.md b/solution/README.md
index b4c6c94613db6..ae74e7cfd0dc4 100644
--- a/solution/README.md
+++ b/solution/README.md
@@ -2883,6 +2883,10 @@
| 2870 | [使数组为空的最少操作次数](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README.md) | | 中等 | 第 114 场双周赛 |
| 2871 | [将数组分割成最多数目的子数组](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README.md) | | 中等 | 第 114 场双周赛 |
| 2872 | [可以被 K 整除连通块的最大数目](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README.md) | | 困难 | 第 114 场双周赛 |
+| 2873 | [有序三元组中的最大值 I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README.md) | | 简单 | 第 365 场周赛 |
+| 2874 | [有序三元组中的最大值 II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README.md) | | 中等 | 第 365 场周赛 |
+| 2875 | [无限数组的最短子数组](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README.md) | | 中等 | 第 365 场周赛 |
+| 2876 | [有向图访问计数](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README.md) | | 困难 | 第 365 场周赛 |
## 版权
diff --git a/solution/README_EN.md b/solution/README_EN.md
index 063d6d0b80e28..08b777f0e5010 100644
--- a/solution/README_EN.md
+++ b/solution/README_EN.md
@@ -2881,6 +2881,10 @@ Press Control + F(or Command + F on
| 2870 | [Minimum Number of Operations to Make Array Empty](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README_EN.md) | | Medium | Biweekly Contest 114 |
| 2871 | [Split Array Into Maximum Number of Subarrays](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README_EN.md) | | Medium | Biweekly Contest 114 |
| 2872 | [Maximum Number of K-Divisible Components](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README_EN.md) | | Hard | Biweekly Contest 114 |
+| 2873 | [Maximum Value of an Ordered Triplet I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README_EN.md) | | Easy | Weekly Contest 365 |
+| 2874 | [Maximum Value of an Ordered Triplet II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README_EN.md) | | Medium | Weekly Contest 365 |
+| 2875 | [Minimum Size Subarray in Infinite Array](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README_EN.md) | | Medium | Weekly Contest 365 |
+| 2876 | [Count Visited Nodes in a Directed Graph](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README_EN.md) | | Hard | Weekly Contest 365 |
## Copyright
diff --git a/solution/summary.md b/solution/summary.md
index db413d03a6e9c..54ba4afbca9de 100644
--- a/solution/summary.md
+++ b/solution/summary.md
@@ -2928,3 +2928,7 @@
- [2870.使数组为空的最少操作次数](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README.md)
- [2871.将数组分割成最多数目的子数组](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README.md)
- [2872.可以被 K 整除连通块的最大数目](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README.md)
+ - [2873.有序三元组中的最大值 I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README.md)
+ - [2874.有序三元组中的最大值 II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README.md)
+ - [2875.无限数组的最短子数组](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README.md)
+ - [2876.有向图访问计数](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README.md)
diff --git a/solution/summary_en.md b/solution/summary_en.md
index f93c810958946..bc64d788689a8 100644
--- a/solution/summary_en.md
+++ b/solution/summary_en.md
@@ -2928,3 +2928,7 @@
- [2870.Minimum Number of Operations to Make Array Empty](/solution/2800-2899/2870.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Empty/README_EN.md)
- [2871.Split Array Into Maximum Number of Subarrays](/solution/2800-2899/2871.Split%20Array%20Into%20Maximum%20Number%20of%20Subarrays/README_EN.md)
- [2872.Maximum Number of K-Divisible Components](/solution/2800-2899/2872.Maximum%20Number%20of%20K-Divisible%20Components/README_EN.md)
+ - [2873.Maximum Value of an Ordered Triplet I](/solution/2800-2899/2873.Maximum%20Value%20of%20an%20Ordered%20Triplet%20I/README_EN.md)
+ - [2874.Maximum Value of an Ordered Triplet II](/solution/2800-2899/2874.Maximum%20Value%20of%20an%20Ordered%20Triplet%20II/README_EN.md)
+ - [2875.Minimum Size Subarray in Infinite Array](/solution/2800-2899/2875.Minimum%20Size%20Subarray%20in%20Infinite%20Array/README_EN.md)
+ - [2876.Count Visited Nodes in a Directed Graph](/solution/2800-2899/2876.Count%20Visited%20Nodes%20in%20a%20Directed%20Graph/README_EN.md)