feat: add weekly contest 418 (doocs#3603)

Author: yanglbme

solution/1400-1499/1419.Minimum Number of Frogs Croaking/README_EN.md

@@ -30,16 +30,16 @@ tags:
 
 <pre>
 <strong>Input:</strong> croakOfFrogs = &quot;croakcroak&quot;
-<strong>Output:</strong> 1
+<strong>Output:</strong> 1 
 <strong>Explanation:</strong> One frog yelling &quot;croak<strong>&quot;</strong> twice.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> croakOfFrogs = &quot;crcoakroak&quot;
-<strong>Output:</strong> 2
-<strong>Explanation:</strong> The minimum number of frogs is two.
+<strong>Output:</strong> 2 
+<strong>Explanation:</strong> The minimum number of frogs is two. 
 The first frog could yell &quot;<strong>cr</strong>c<strong>oak</strong>roak&quot;.
 The second frog could yell later &quot;cr<strong>c</strong>oak<strong>roak</strong>&quot;.
 </pre>

solution/1800-1899/1876.Substrings of Size Three with Distinct Characters/README_EN.md

@@ -35,7 +35,7 @@ tags:
 <pre>
 <strong>Input:</strong> s = &quot;xyzzaz&quot;
 <strong>Output:</strong> 1
-<strong>Explanation:</strong> There are 4 substrings of size 3: &quot;xyz&quot;, &quot;yzz&quot;, &quot;zza&quot;, and &quot;zaz&quot;.
+<strong>Explanation:</strong> There are 4 substrings of size 3: &quot;xyz&quot;, &quot;yzz&quot;, &quot;zza&quot;, and &quot;zaz&quot;. 
 The only good substring of length 3 is &quot;xyz&quot;.
 </pre>
 

solution/2400-2499/2491.Divide Players Into Teams of Equal Skill/README_EN.md

@@ -33,7 +33,7 @@ tags:
 <pre>
 <strong>Input:</strong> skill = [3,2,5,1,3,4]
 <strong>Output:</strong> 22
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 Divide the players into the following teams: (1, 5), (2, 4), (3, 3), where each team has a total skill of 6.
 The sum of the chemistry of all the teams is: 1 * 5 + 2 * 4 + 3 * 3 = 5 + 8 + 9 = 22.
 </pre>
@@ -43,7 +43,7 @@ The sum of the chemistry of all the teams is: 1 * 5 + 2 * 4 + 3 * 3 = 5 + 8 + 9
 <pre>
 <strong>Input:</strong> skill = [3,4]
 <strong>Output:</strong> 12
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 The two players form a team with a total skill of 7.
 The chemistry of the team is 3 * 4 = 12.
 </pre>
@@ -53,7 +53,7 @@ The chemistry of the team is 3 * 4 = 12.
 <pre>
 <strong>Input:</strong> skill = [1,1,2,3]
 <strong>Output:</strong> -1
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 There is no way to divide the players into teams such that the total skill of each team is equal.
 </pre>
 

solution/3200-3299/3285.Find Indices of Stable Mountains/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3285.Find%20Indices%20of%20Stable%20Mountains/README.md
+rating: 1166
+source: 第 139 场双周赛 Q1
 tags:
     - 数组
 ---

solution/3200-3299/3285.Find Indices of Stable Mountains/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3285.Find%20Indices%20of%20Stable%20Mountains/README_EN.md
+rating: 1166
+source: Biweekly Contest 139 Q1
 tags:
     - Array
 ---

solution/3200-3299/3286.Find a Safe Walk Through a Grid/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3286.Find%20a%20Safe%20Walk%20Through%20a%20Grid/README.md
+rating: 1607
+source: 第 139 场双周赛 Q2
 tags:
     - 广度优先搜索
     - 图

solution/3200-3299/3286.Find a Safe Walk Through a Grid/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3286.Find%20a%20Safe%20Walk%20Through%20a%20Grid/README_EN.md
+rating: 1607
+source: Biweekly Contest 139 Q2
 tags:
     - Breadth-First Search
     - Graph

solution/3200-3299/3287.Find the Maximum Sequence Value of Array/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3287.Find%20the%20Maximum%20Sequence%20Value%20of%20Array/README.md
+rating: 2545
+source: 第 139 场双周赛 Q3
 tags:
     - 位运算
     - 数组

solution/3200-3299/3287.Find the Maximum Sequence Value of Array/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3287.Find%20the%20Maximum%20Sequence%20Value%20of%20Array/README_EN.md
+rating: 2545
+source: Biweekly Contest 139 Q3
 tags:
     - Bit Manipulation
     - Array

solution/3200-3299/3288.Length of the Longest Increasing Path/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3288.Length%20of%20the%20Longest%20Increasing%20Path/README.md
+rating: 2449
+source: 第 139 场双周赛 Q4
 tags:
     - 数组
     - 二分查找