feat: update lc problems (doocs#3452)

Author: yanglbme

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>

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>

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 -->
 

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 -->
 

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:
     - 数学
     - 博弈

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

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:
     - 哈希表
     - 字符串

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

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:
     - 数组
     - 哈希表

solution/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