feat: add weekly contest 418

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:
     - 数组
     - 二分查找

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

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3288.Length%20of%20the%20Longest%20Increasing%20Path/README_EN.md
+rating: 2449
+source: Biweekly Contest 139 Q4
 tags:
     - Array
     - Binary Search

solution/3200-3299/3289.The Two Sneaky Numbers of Digitville/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3289.The%20Two%20Sneaky%20Numbers%20of%20Digitville/README.md
+rating: 1163
+source: 第 415 场周赛 Q1
 tags:
     - 数组
     - 哈希表

solution/3200-3299/3289.The Two Sneaky Numbers of Digitville/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3289.The%20Two%20Sneaky%20Numbers%20of%20Digitville/README_EN.md
+rating: 1163
+source: Weekly Contest 415 Q1
 tags:
     - Array
     - Hash Table

solution/3200-3299/3290.Maximum Multiplication Score/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3290.Maximum%20Multiplication%20Score/README.md
+rating: 1692
+source: 第 415 场周赛 Q2
 tags:
     - 数组
     - 动态规划

solution/3200-3299/3290.Maximum Multiplication Score/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3290.Maximum%20Multiplication%20Score/README_EN.md
+rating: 1692
+source: Weekly Contest 415 Q2
 tags:
     - Array
     - Dynamic Programming

solution/3200-3299/3291.Minimum Number of Valid Strings to Form Target I/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3291.Minimum%20Number%20of%20Valid%20Strings%20to%20Form%20Target%20I/README.md
+rating: 2081
+source: 第 415 场周赛 Q3
 tags:
     - 字典树
     - 线段树

solution/3200-3299/3291.Minimum Number of Valid Strings to Form Target I/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3291.Minimum%20Number%20of%20Valid%20Strings%20to%20Form%20Target%20I/README_EN.md
+rating: 2081
+source: Weekly Contest 415 Q3
 tags:
     - Trie
     - Segment Tree

solution/3200-3299/3292.Minimum Number of Valid Strings to Form Target II/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3292.Minimum%20Number%20of%20Valid%20Strings%20to%20Form%20Target%20II/README.md
+rating: 2661
+source: 第 415 场周赛 Q4
 tags:
     - 线段树
     - 数组

solution/3200-3299/3292.Minimum Number of Valid Strings to Form Target II/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3292.Minimum%20Number%20of%20Valid%20Strings%20to%20Form%20Target%20II/README_EN.md
+rating: 2661
+source: Weekly Contest 415 Q4
 tags:
     - Segment Tree
     - Array

solution/3200-3299/3295.Report Spam Message/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3295.Report%20Spam%20Message/README.md
+rating: 1198
+source: 第 416 场周赛 Q1
 tags:
     - 数组
     - 哈希表

solution/3200-3299/3295.Report Spam Message/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3295.Report%20Spam%20Message/README_EN.md
+rating: 1198
+source: Weekly Contest 416 Q1
 tags:
     - Array
     - Hash Table

solution/3200-3299/3296.Minimum Number of Seconds to Make Mountain Height Zero/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3296.Minimum%20Number%20of%20Seconds%20to%20Make%20Mountain%20Height%20Zero/README.md
+rating: 1694
+source: 第 416 场周赛 Q2
 tags:
     - 数组
     - 数学

solution/3200-3299/3296.Minimum Number of Seconds to Make Mountain Height Zero/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3296.Minimum%20Number%20of%20Seconds%20to%20Make%20Mountain%20Height%20Zero/README_EN.md
+rating: 1694
+source: Weekly Contest 416 Q2
 tags:
     - Array
     - Math

solution/3200-3299/3297.Count Substrings That Can Be Rearranged to Contain a String I/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3297.Count%20Substrings%20That%20Can%20Be%20Rearranged%20to%20Contain%20a%20String%20I/README.md
+rating: 1847
+source: 第 416 场周赛 Q3
 tags:
     - 哈希表
     - 字符串

solution/3200-3299/3297.Count Substrings That Can Be Rearranged to Contain a String I/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3297.Count%20Substrings%20That%20Can%20Be%20Rearranged%20to%20Contain%20a%20String%20I/README_EN.md
+rating: 1847
+source: Weekly Contest 416 Q3
 tags:
     - Hash Table
     - String

solution/3200-3299/3298.Count Substrings That Can Be Rearranged to Contain a String II/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3298.Count%20Substrings%20That%20Can%20Be%20Rearranged%20to%20Contain%20a%20String%20II/README.md
+rating: 1909
+source: 第 416 场周赛 Q4
 tags:
     - 哈希表
     - 字符串

solution/3200-3299/3298.Count Substrings That Can Be Rearranged to Contain a String II/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3298.Count%20Substrings%20That%20Can%20Be%20Rearranged%20to%20Contain%20a%20String%20II/README_EN.md
+rating: 1909
+source: Weekly Contest 416 Q4
 tags:
     - Hash Table
     - String

solution/3300-3399/3309.Maximum Possible Number by Binary Concatenation/README.md

@@ -0,0 +1,96 @@
+---
+comments: true
+difficulty: 中等
+edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3309.Maximum%20Possible%20Number%20by%20Binary%20Concatenation/README.md
+---
+
+<!-- problem:start -->
+
+# [3309. 连接二进制表示可形成的最大数值](https://leetcode.cn/problems/maximum-possible-number-by-binary-concatenation)
+
+[English Version](/solution/3300-3399/3309.Maximum%20Possible%20Number%20by%20Binary%20Concatenation/README_EN.md)
+
+## 题目描述
+
+<!-- description:start -->
+
+<p>给你一个长度为 <code>3</code> 的整数数组 <code>nums</code>。</p>
+
+<p>现以某种顺序<strong> 连接 </strong>数组 <code>nums</code> 中所有元素的 <strong>二进制表示</strong> ，请你返回可以由这种方法形成的 <strong>最大 </strong>数值。</p>
+
+<p><strong>注意</strong> 任何数字的二进制表示<em> </em><strong>不含</strong><em> </em>前导零。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1:</strong></p>
+
+<div class="example-block">
+<p><strong>输入:</strong> <span class="example-io">nums = [1,2,3]</span></p>
+
+<p><strong>输出:</strong> 30</p>
+
+<p><strong>解释:</strong></p>
+
+<p>按照顺序 <code>[3, 1, 2]</code> 连接数字的二进制表示，得到结果 <code>"11110"</code>，这是 30 的二进制表示。</p>
+</div>
+
+<p><strong class="example">示例 2:</strong></p>
+
+<div class="example-block">
+<p><strong>输入:</strong> <span class="example-io">nums = [2,8,16]</span></p>
+
+<p><strong>输出:</strong> 1296</p>
+
+<p><strong>解释:</strong></p>
+
+<p>按照顺序 <code>[2, 8, 16]</code> 连接数字的二进制表述，得到结果 <code>"10100010000"</code>，这是 1296 的二进制表示。</p>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示:</strong></p>
+
+<ul>
+	<li><code>nums.length == 3</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 127</code></li>
+</ul>
+
+<!-- description:end -->
+
+## 解法
+
+<!-- solution:start -->
+
+### 方法一
+
+<!-- tabs:start -->
+
+#### Python3
+
+```python
+
+```
+
+#### Java
+
+```java
+
+```
+
+#### C++
+
+```cpp
+
+```
+
+#### Go
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
+<!-- problem:end -->