feat: update lc problems (#3452)

doocs · Aug 28, 2024 · 4014d70 · 4014d70
1 parent f42ff99
commit 4014d70
Show file tree

Hide file tree

Showing 75 changed files with 573 additions and 13 deletions.
diff --git a/solution/1400-1499/1409.Queries on a Permutation With Key/README.md b/solution/1400-1499/1409.Queries on a Permutation With Key/README.md
@@ -35,13 +35,13 @@ tags:
 
 <pre>
 <strong>输入：</strong>queries = [3,1,2,1], m = 5
-<strong>输出：</strong>[2,1,2,1]
+<strong>输出：</strong>[2,1,2,1] 
 <strong>解释：处理</strong> queries 的过程如下：
 对于 i=0: queries[i]=3, P=[1,2,3,4,5], 3 在 P 中的位置是 <strong>2</strong>，然后我们把 3 移动到 P 的开头，得到 P=[3,1,2,4,5] 。
-对于 i=1: queries[i]=1, P=[3,1,2,4,5], 1 在 P 中的位置是 <strong>1</strong>，然后我们把 1 移动到 P 的开头，得到 P=[1,3,2,4,5] 。
+对于 i=1: queries[i]=1, P=[3,1,2,4,5], 1 在 P 中的位置是 <strong>1</strong>，然后我们把 1 移动到 P 的开头，得到 P=[1,3,2,4,5] 。 
 对于 i=2: queries[i]=2, P=[1,3,2,4,5], 2 在 P 中的位置是 <strong>2</strong>，然后我们把 2 移动到 P 的开头，得到 P=[2,1,3,4,5] 。
-对于 i=3: queries[i]=1, P=[2,1,3,4,5], 1 在 P 中的位置是 <strong>1</strong>，然后我们把 1 移动到 P 的开头，得到 P=[1,2,3,4,5] 。
-因此，包含结果的数组为 [2,1,2,1] 。
+对于 i=3: queries[i]=1, P=[2,1,3,4,5], 1 在 P 中的位置是 <strong>1</strong>，然后我们把 1 移动到 P 的开头，得到 P=[1,2,3,4,5] 。 
+因此，包含结果的数组为 [2,1,2,1] 。  
 </pre>
 
 <p><strong>示例 2：</strong></p>

diff --git a/solution/1400-1499/1409.Queries on a Permutation With Key/README_EN.md b/solution/1400-1499/1409.Queries on a Permutation With Key/README_EN.md
@@ -34,13 +34,13 @@ tags:
 
 <pre>
 <strong>Input:</strong> queries = [3,1,2,1], m = 5
-<strong>Output:</strong> [2,1,2,1]
-<strong>Explanation:</strong> The queries are processed as follow:
-For i=0: queries[i]=3, P=[1,2,3,4,5], position of 3 in P is <strong>2</strong>, then we move 3 to the beginning of P resulting in P=[3,1,2,4,5].
-For i=1: queries[i]=1, P=[3,1,2,4,5], position of 1 in P is <strong>1</strong>, then we move 1 to the beginning of P resulting in P=[1,3,2,4,5].
-For i=2: queries[i]=2, P=[1,3,2,4,5], position of 2 in P is <strong>2</strong>, then we move 2 to the beginning of P resulting in P=[2,1,3,4,5].
-For i=3: queries[i]=1, P=[2,1,3,4,5], position of 1 in P is <strong>1</strong>, then we move 1 to the beginning of P resulting in P=[1,2,3,4,5].
-Therefore, the array containing the result is [2,1,2,1].
+<strong>Output:</strong> [2,1,2,1] 
+<strong>Explanation:</strong> The queries are processed as follow: 
+For i=0: queries[i]=3, P=[1,2,3,4,5], position of 3 in P is <strong>2</strong>, then we move 3 to the beginning of P resulting in P=[3,1,2,4,5]. 
+For i=1: queries[i]=1, P=[3,1,2,4,5], position of 1 in P is <strong>1</strong>, then we move 1 to the beginning of P resulting in P=[1,3,2,4,5]. 
+For i=2: queries[i]=2, P=[1,3,2,4,5], position of 2 in P is <strong>2</strong>, then we move 2 to the beginning of P resulting in P=[2,1,3,4,5]. 
+For i=3: queries[i]=1, P=[2,1,3,4,5], position of 1 in P is <strong>1</strong>, then we move 1 to the beginning of P resulting in P=[1,2,3,4,5]. 
+Therefore, the array containing the result is [2,1,2,1].  
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>

diff --git a/solution/3100-3199/3156.Employee Task Duration and Concurrent Tasks/README.md b/solution/3100-3199/3156.Employee Task Duration and Concurrent Tasks/README.md
@@ -109,7 +109,13 @@ tags:
 
 <!-- solution:start -->
 
-### 方法一
+### 方法一：合并 + 连接
+
+我们首先将 `employee_id` 的 `start_time` 和 `end_time` 合并到一个新的表 `T` 中，然后使用 `LEAD` 函数计算出每个员工的下一个任务的开始时间，接着我们将 `T` 表和 `Tasks` 表连接起来，计算出每个员工的并发任务数，最后按照 `employee_id` 分组，计算出每个员工的总任务时间和最大并发任务数。
+
+相似题目：
+
+-   [3268. Find Overlapping Shifts II 🔒](https://github.com/doocs/leetcode/blob/main/solution/3200-3299/3268.Find%20Overlapping%20Shifts%20II/README.md)
 
 <!-- tabs:start -->
 

diff --git a/solution/3100-3199/3156.Employee Task Duration and Concurrent Tasks/README_EN.md b/solution/3100-3199/3156.Employee Task Duration and Concurrent Tasks/README_EN.md
@@ -108,7 +108,13 @@ Each row in this table contains the task identifier, the employee identifier, an
 
 <!-- solution:start -->
 
-### Solution 1
+### Solution 1: Merge + Join
+
+First, we merge the `start_time` and `end_time` for each `employee_id` into a new table `T`. Then, using the `LEAD` function, we calculate the start time of the next task for each employee. Next, we join table `T` with the `Tasks` table to compute the concurrent task count for each employee. Finally, we group by `employee_id` to calculate the total task duration and the maximum concurrent tasks for each employee.
+
+Similar Problem:
+
+-   [3268. Find Overlapping Shifts II 🔒](https://github.com/doocs/leetcode/blob/main/solution/3200-3299/3268.Find%20Overlapping%20Shifts%20II/README_EN.md)
 
 <!-- tabs:start -->
 

diff --git a/solution/3200-3299/3222.Find the Winning Player in Coin Game/README.md b/solution/3200-3299/3222.Find the Winning Player in Coin Game/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3222.Find%20the%20Winning%20Player%20in%20Coin%20Game/README.md
+rating: 1269
+source: 第 135 场双周赛 Q1
 tags:
     - 数学
     - 博弈

diff --git a/solution/3200-3299/3222.Find the Winning Player in Coin Game/README_EN.md b/solution/3200-3299/3222.Find the Winning Player in Coin Game/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3222.Find%20the%20Winning%20Player%20in%20Coin%20Game/README_EN.md
+rating: 1269
+source: Biweekly Contest 135 Q1
 tags:
     - Math
     - Game Theory

diff --git a/solution/3200-3299/3223.Minimum Length of String After Operations/README.md b/solution/3200-3299/3223.Minimum Length of String After Operations/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3223.Minimum%20Length%20of%20String%20After%20Operations/README.md
+rating: 1445
+source: 第 135 场双周赛 Q2
 tags:
     - 哈希表
     - 字符串

diff --git a/solution/3200-3299/3223.Minimum Length of String After Operations/README_EN.md b/solution/3200-3299/3223.Minimum Length of String After Operations/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3223.Minimum%20Length%20of%20String%20After%20Operations/README_EN.md
+rating: 1445
+source: Biweekly Contest 135 Q2
 tags:
     - Hash Table
     - String

diff --git a/solution/3200-3299/3224.Minimum Array Changes to Make Differences Equal/README.md b/solution/3200-3299/3224.Minimum Array Changes to Make Differences Equal/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3224.Minimum%20Array%20Changes%20to%20Make%20Differences%20Equal/README.md
+rating: 1996
+source: 第 135 场双周赛 Q3
 tags:
     - 数组
     - 哈希表

diff --git a/...ion/3200-3299/3224.Minimum Array Changes to Make Differences Equal/README_EN.md b/...ion/3200-3299/3224.Minimum Array Changes to Make Differences Equal/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3224.Minimum%20Array%20Changes%20to%20Make%20Differences%20Equal/README_EN.md
+rating: 1996
+source: Biweekly Contest 135 Q3
 tags:
     - Array
     - Hash Table

diff --git a/solution/3200-3299/3225.Maximum Score From Grid Operations/README.md b/solution/3200-3299/3225.Maximum Score From Grid Operations/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3225.Maximum%20Score%20From%20Grid%20Operations/README.md
+rating: 3027
+source: 第 135 场双周赛 Q4
 tags:
     - 数组
     - 动态规划

diff --git a/solution/3200-3299/3225.Maximum Score From Grid Operations/README_EN.md b/solution/3200-3299/3225.Maximum Score From Grid Operations/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3225.Maximum%20Score%20From%20Grid%20Operations/README_EN.md
+rating: 3027
+source: Biweekly Contest 135 Q4
 tags:
     - Array
     - Dynamic Programming

diff --git a/solution/3200-3299/3226.Number of Bit Changes to Make Two Integers Equal/README.md b/solution/3200-3299/3226.Number of Bit Changes to Make Two Integers Equal/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3226.Number%20of%20Bit%20Changes%20to%20Make%20Two%20Integers%20Equal/README.md
+rating: 1247
+source: 第 407 场周赛 Q1
 tags:
     - 位运算
 ---

diff --git a/...on/3200-3299/3226.Number of Bit Changes to Make Two Integers Equal/README_EN.md b/...on/3200-3299/3226.Number of Bit Changes to Make Two Integers Equal/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3226.Number%20of%20Bit%20Changes%20to%20Make%20Two%20Integers%20Equal/README_EN.md
+rating: 1247
+source: Weekly Contest 407 Q1
 tags:
     - Bit Manipulation
 ---

diff --git a/solution/3200-3299/3227.Vowels Game in a String/README.md b/solution/3200-3299/3227.Vowels Game in a String/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3227.Vowels%20Game%20in%20a%20String/README.md
+rating: 1451
+source: 第 407 场周赛 Q2
 tags:
     - 脑筋急转弯
     - 数学

diff --git a/solution/3200-3299/3227.Vowels Game in a String/README_EN.md b/solution/3200-3299/3227.Vowels Game in a String/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3227.Vowels%20Game%20in%20a%20String/README_EN.md
+rating: 1451
+source: Weekly Contest 407 Q2
 tags:
     - Brainteaser
     - Math

diff --git a/...n/3200-3299/3228.Maximum Number of Operations to Move Ones to the End/README.md b/...n/3200-3299/3228.Maximum Number of Operations to Move Ones to the End/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3228.Maximum%20Number%20of%20Operations%20to%20Move%20Ones%20to%20the%20End/README.md
+rating: 1593
+source: 第 407 场周赛 Q3
 tags:
     - 贪心
     - 字符串

diff --git a/...200-3299/3228.Maximum Number of Operations to Move Ones to the End/README_EN.md b/...200-3299/3228.Maximum Number of Operations to Move Ones to the End/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3228.Maximum%20Number%20of%20Operations%20to%20Move%20Ones%20to%20the%20End/README_EN.md
+rating: 1593
+source: Weekly Contest 407 Q3
 tags:
     - Greedy
     - String

diff --git a/solution/3200-3299/3229.Minimum Operations to Make Array Equal to Target/README.md b/solution/3200-3299/3229.Minimum Operations to Make Array Equal to Target/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3229.Minimum%20Operations%20to%20Make%20Array%20Equal%20to%20Target/README.md
+rating: 2066
+source: 第 407 场周赛 Q4
 tags:
     - 栈
     - 贪心

diff --git a/...on/3200-3299/3229.Minimum Operations to Make Array Equal to Target/README_EN.md b/...on/3200-3299/3229.Minimum Operations to Make Array Equal to Target/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3229.Minimum%20Operations%20to%20Make%20Array%20Equal%20to%20Target/README_EN.md
+rating: 2066
+source: Weekly Contest 407 Q4
 tags:
     - Stack
     - Greedy

diff --git a/solution/3200-3299/3232.Find if Digit Game Can Be Won/README.md b/solution/3200-3299/3232.Find if Digit Game Can Be Won/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3232.Find%20if%20Digit%20Game%20Can%20Be%20Won/README.md
+rating: 1163
+source: 第 408 场周赛 Q1
 tags:
     - 数组
     - 数学

diff --git a/solution/3200-3299/3232.Find if Digit Game Can Be Won/README_EN.md b/solution/3200-3299/3232.Find if Digit Game Can Be Won/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3232.Find%20if%20Digit%20Game%20Can%20Be%20Won/README_EN.md
+rating: 1163
+source: Weekly Contest 408 Q1
 tags:
     - Array
     - Math

diff --git a/solution/3200-3299/3233.Find the Count of Numbers Which Are Not Special/README.md b/solution/3200-3299/3233.Find the Count of Numbers Which Are Not Special/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3233.Find%20the%20Count%20of%20Numbers%20Which%20Are%20Not%20Special/README.md
+rating: 1509
+source: 第 408 场周赛 Q2
 tags:
     - 数组
     - 数学

diff --git a/...ion/3200-3299/3233.Find the Count of Numbers Which Are Not Special/README_EN.md b/...ion/3200-3299/3233.Find the Count of Numbers Which Are Not Special/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3233.Find%20the%20Count%20of%20Numbers%20Which%20Are%20Not%20Special/README_EN.md
+rating: 1509
+source: Weekly Contest 408 Q2
 tags:
     - Array
     - Math

diff --git a/...tion/3200-3299/3234.Count the Number of Substrings With Dominant Ones/README.md b/...tion/3200-3299/3234.Count the Number of Substrings With Dominant Ones/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3234.Count%20the%20Number%20of%20Substrings%20With%20Dominant%20Ones/README.md
+rating: 2556
+source: 第 408 场周赛 Q3
 tags:
     - 字符串
     - 枚举

diff --git a/...n/3200-3299/3234.Count the Number of Substrings With Dominant Ones/README_EN.md b/...n/3200-3299/3234.Count the Number of Substrings With Dominant Ones/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3234.Count%20the%20Number%20of%20Substrings%20With%20Dominant%20Ones/README_EN.md
+rating: 2556
+source: Weekly Contest 408 Q3
 tags:
     - String
     - Enumeration

diff --git a/solution/3200-3299/3235.Check if the Rectangle Corner Is Reachable/README.md b/solution/3200-3299/3235.Check if the Rectangle Corner Is Reachable/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3235.Check%20if%20the%20Rectangle%20Corner%20Is%20Reachable/README.md
+rating: 3773
+source: 第 408 场周赛 Q4
 tags:
     - 深度优先搜索
     - 广度优先搜索

diff --git a/solution/3200-3299/3235.Check if the Rectangle Corner Is Reachable/README_EN.md b/solution/3200-3299/3235.Check if the Rectangle Corner Is Reachable/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3235.Check%20if%20the%20Rectangle%20Corner%20Is%20Reachable/README_EN.md
+rating: 3773
+source: Weekly Contest 408 Q4
 tags:
     - Depth-First Search
     - Breadth-First Search

diff --git a/solution/3200-3299/3238.Find the Number of Winning Players/README.md b/solution/3200-3299/3238.Find the Number of Winning Players/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3238.Find%20the%20Number%20of%20Winning%20Players/README.md
+rating: 1285
+source: 第 136 场双周赛 Q1
 tags:
     - 数组
     - 哈希表

diff --git a/solution/3200-3299/3238.Find the Number of Winning Players/README_EN.md b/solution/3200-3299/3238.Find the Number of Winning Players/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3238.Find%20the%20Number%20of%20Winning%20Players/README_EN.md
+rating: 1285
+source: Biweekly Contest 136 Q1
 tags:
     - Array
     - Hash Table

diff --git a/...0-3299/3239.Minimum Number of Flips to Make Binary Grid Palindromic I/README.md b/...0-3299/3239.Minimum Number of Flips to Make Binary Grid Palindromic I/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3239.Minimum%20Number%20of%20Flips%20to%20Make%20Binary%20Grid%20Palindromic%20I/README.md
+rating: 1387
+source: 第 136 场双周赛 Q2
 tags:
     - 数组
     - 双指针

diff --git a/...299/3239.Minimum Number of Flips to Make Binary Grid Palindromic I/README_EN.md b/...299/3239.Minimum Number of Flips to Make Binary Grid Palindromic I/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3239.Minimum%20Number%20of%20Flips%20to%20Make%20Binary%20Grid%20Palindromic%20I/README_EN.md
+rating: 1387
+source: Biweekly Contest 136 Q2
 tags:
     - Array
     - Two Pointers

diff --git a/...-3299/3240.Minimum Number of Flips to Make Binary Grid Palindromic II/README.md b/...-3299/3240.Minimum Number of Flips to Make Binary Grid Palindromic II/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3240.Minimum%20Number%20of%20Flips%20to%20Make%20Binary%20Grid%20Palindromic%20II/README.md
+rating: 2080
+source: 第 136 场双周赛 Q3
 tags:
     - 数组
     - 双指针

diff --git a/...99/3240.Minimum Number of Flips to Make Binary Grid Palindromic II/README_EN.md b/...99/3240.Minimum Number of Flips to Make Binary Grid Palindromic II/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3240.Minimum%20Number%20of%20Flips%20to%20Make%20Binary%20Grid%20Palindromic%20II/README_EN.md
+rating: 2080
+source: Biweekly Contest 136 Q3
 tags:
     - Array
     - Two Pointers

diff --git a/solution/3200-3299/3241.Time Taken to Mark All Nodes/README.md b/solution/3200-3299/3241.Time Taken to Mark All Nodes/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3241.Time%20Taken%20to%20Mark%20All%20Nodes/README.md
+rating: 2521
+source: 第 136 场双周赛 Q4
 tags:
     - 树
     - 深度优先搜索

diff --git a/solution/3200-3299/3241.Time Taken to Mark All Nodes/README_EN.md b/solution/3200-3299/3241.Time Taken to Mark All Nodes/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3241.Time%20Taken%20to%20Mark%20All%20Nodes/README_EN.md
+rating: 2521
+source: Biweekly Contest 136 Q4
 tags:
     - Tree
     - Depth-First Search

diff --git a/solution/3200-3299/3242.Design Neighbor Sum Service/README.md b/solution/3200-3299/3242.Design Neighbor Sum Service/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3242.Design%20Neighbor%20Sum%20Service/README.md
+rating: 1334
+source: 第 409 场周赛 Q1
 tags:
     - 设计
     - 数组

diff --git a/solution/3200-3299/3242.Design Neighbor Sum Service/README_EN.md b/solution/3200-3299/3242.Design Neighbor Sum Service/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3242.Design%20Neighbor%20Sum%20Service/README_EN.md
+rating: 1334
+source: Weekly Contest 409 Q1
 tags:
     - Design
     - Array

diff --git a/solution/3200-3299/3243.Shortest Distance After Road Addition Queries I/README.md b/solution/3200-3299/3243.Shortest Distance After Road Addition Queries I/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3243.Shortest%20Distance%20After%20Road%20Addition%20Queries%20I/README.md
+rating: 1567
+source: 第 409 场周赛 Q2
 tags:
     - 广度优先搜索
     - 图

diff --git a/...ion/3200-3299/3243.Shortest Distance After Road Addition Queries I/README_EN.md b/...ion/3200-3299/3243.Shortest Distance After Road Addition Queries I/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3243.Shortest%20Distance%20After%20Road%20Addition%20Queries%20I/README_EN.md
+rating: 1567
+source: Weekly Contest 409 Q2
 tags:
     - Breadth-First Search
     - Graph