feat: update lc problems (doocs#3528)

Author: yanglbme

solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README_EN.md

@@ -28,7 +28,7 @@ tags:
 
 <p>Given the sorted rotated array <code>nums</code> of <strong>unique</strong> elements, return <em>the minimum element of this array</em>.</p>
 
-<p>You must write an algorithm that runs in&nbsp;<code>O(log n) time.</code></p>
+<p>You must write an algorithm that runs in&nbsp;<code>O(log n) time</code>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0300-0399/0345.Reverse Vowels of a String/README.md

@@ -23,20 +23,27 @@ tags:
 
 <p>&nbsp;</p>
 
-<p><strong>示例 1：</strong></p>
+<p><strong class="example">示例 1：</strong></p>
 
-<pre>
-<strong>输入：</strong>s = "hello"
-<strong>输出：</strong>"holle"
-</pre>
+<div class="example-block">
+<p><strong>输入：</strong><span class="example-io">s = "IceCreAm"</span></p>
 
-<p><strong>示例 2：</strong></p>
+<p><span class="example-io"><b>输出：</b>"AceCreIm"</span></p>
 
-<pre>
-<strong>输入：</strong>s = "leetcode"
-<strong>输出：</strong>"leotcede"</pre>
+<p><strong>解释：</strong></p>
+
+<p><code>s</code>&nbsp;中的元音是&nbsp;<code>['I', 'e', 'e', 'A']</code>。反转这些元音，<code>s</code> 变为&nbsp;<code>"AceCreIm"</code>.</p>
+</div>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>s = "leetcode"</span></p>
+
+<p><strong>输出：</strong><span class="example-io">"leotcede"</span></p>
 
 <p>&nbsp;</p>
+</div>
 
 <p><strong>提示：</strong></p>
 

solution/0300-0399/0345.Reverse Vowels of a String/README_EN.md

@@ -23,12 +23,25 @@ tags:
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
-<pre><strong>Input:</strong> s = "hello"
-<strong>Output:</strong> "holle"
-</pre><p><strong class="example">Example 2:</strong></p>
-<pre><strong>Input:</strong> s = "leetcode"
-<strong>Output:</strong> "leotcede"
-</pre>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">s = &quot;IceCreAm&quot;</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">&quot;AceCreIm&quot;</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The vowels in <code>s</code> are <code>[&#39;I&#39;, &#39;e&#39;, &#39;e&#39;, &#39;A&#39;]</code>. On reversing the vowels, s becomes <code>&quot;AceCreIm&quot;</code>.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">s = &quot;leetcode&quot;</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">&quot;leotcede&quot;</span></p>
+</div>
+
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>
 

solution/0400-0499/0461.Hamming Distance/README_EN.md

@@ -47,6 +47,9 @@ The above arrows point to positions where the corresponding bits are different.
 	<li><code>0 &lt;=&nbsp;x, y &lt;= 2<sup>31</sup> - 1</code></li>
 </ul>
 
+<p>&nbsp;</p>
+<p><strong>Note:</strong> This question is the same as <a href="https://leetcode.com/problems/minimum-bit-flips-to-convert-number/description/" target="_blank"> 2220: Minimum Bit Flips to Convert Number.</a></p>
+
 <!-- description:end -->
 
 ## Solutions

solution/1100-1199/1189.Maximum Number of Balloons/README.md

@@ -20,31 +20,34 @@ tags:
 
 <!-- description:start -->
 
-<p>给你一个字符串&nbsp;<code>text</code>，你需要使用 <code>text</code> 中的字母来拼凑尽可能多的单词&nbsp;<strong>&quot;balloon&quot;（气球）</strong>。</p>
+<p>给你一个字符串&nbsp;<code>text</code>，你需要使用 <code>text</code> 中的字母来拼凑尽可能多的单词&nbsp;<strong>"balloon"（气球）</strong>。</p>
 
-<p>字符串&nbsp;<code>text</code> 中的每个字母最多只能被使用一次。请你返回最多可以拼凑出多少个单词&nbsp;<strong>&quot;balloon&quot;</strong>。</p>
+<p>字符串&nbsp;<code>text</code> 中的每个字母最多只能被使用一次。请你返回最多可以拼凑出多少个单词&nbsp;<strong>"balloon"</strong>。</p>
 
 <p>&nbsp;</p>
 
-<p><strong>示例 1：</strong></p>
+<p><strong class="example">示例 1：</strong></p>
 
-<p><strong><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/images/1536_ex1_upd.jpeg" style="height: 35px; width: 154px;"></strong></p>
+<p><strong><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/images/1536_ex1_upd.jpeg" style="height: 35px; width: 154px;" /></strong></p>
 
-<pre><strong>输入：</strong>text = &quot;nlaebolko&quot;
+<pre>
+<strong>输入：</strong>text = "nlaebolko"
 <strong>输出：</strong>1
 </pre>
 
-<p><strong>示例 2：</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
-<p><strong><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/images/1536_ex2_upd.jpeg" style="height: 35px; width: 233px;"></strong></p>
+<p><strong><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/images/1536_ex2_upd.jpeg" style="height: 35px; width: 233px;" /></strong></p>
 
-<pre><strong>输入：</strong>text = &quot;loonbalxballpoon&quot;
+<pre>
+<strong>输入：</strong>text = "loonbalxballpoon"
 <strong>输出：</strong>2
 </pre>
 
-<p><strong>示例 3：</strong></p>
+<p><strong class="example">示例 3：</strong></p>
 
-<pre><strong>输入：</strong>text = &quot;leetcode&quot;
+<pre>
+<strong>输入：</strong>text = "leetcode"
 <strong>输出：</strong>0
 </pre>
 
@@ -53,10 +56,14 @@ tags:
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>1 &lt;= text.length &lt;= 10^4</code></li>
+	<li><code>1 &lt;= text.length &lt;= 10<sup>4</sup></code></li>
 	<li><code>text</code>&nbsp;全部由小写英文字母组成</li>
 </ul>
 
+<p>&nbsp;</p>
+
+<p><strong>注意：</strong>本题与&nbsp;<a href="https://leetcode.cn/problems/rearrange-characters-to-make-target-string/">2287. 重排字符形成目标字符串</a>&nbsp;相同。</p>
+
 <!-- description:end -->
 
 ## 解法

solution/1100-1199/1189.Maximum Number of Balloons/README_EN.md

@@ -58,6 +58,9 @@ tags:
 	<li><code>text</code> consists of lower case English letters only.</li>
 </ul>
 
+<p>&nbsp;</p>
+<p><strong>Note:</strong> This question is the same as <a href="https://leetcode.com/problems/rearrange-characters-to-make-target-string/description/" target="_blank"> 2287: Rearrange Characters to Make Target String.</a></p>
+
 <!-- description:end -->
 
 ## Solutions

solution/1200-1299/1251.Average Selling Price/README.md

@@ -48,7 +48,7 @@ tags:
 
 <p>&nbsp;</p>
 
-<p>编写解决方案以查找每种产品的平均售价。<code>average_price</code> 应该 <strong>四舍五入到小数点后两位</strong>。</p>
+<p>编写解决方案以查找每种产品的平均售价。<code>average_price</code> 应该 <strong>四舍五入到小数点后两位</strong>。如果产品没有任何售出，则假设其平均售价为 0。</p>
 
 <p>返回结果表 <strong>无顺序要求</strong> 。</p>
 

solution/1200-1299/1251.Average Selling Price/README_EN.md

@@ -50,7 +50,7 @@ Each row of this table indicates the date, units, and product_id of each product
 
 <p>&nbsp;</p>
 
-<p>Write a solution to find the average selling price for each product. <code>average_price</code> should be <strong>rounded to 2 decimal places</strong>.</p>
+<p>Write a solution to find the average selling price for each product. <code>average_price</code> should be <strong>rounded to 2 decimal places</strong>. If a product does not have any sold units, its average selling price is assumed to be 0.</p>
 
 <p>Return the result table in <strong>any order</strong>.</p>
 

solution/1600-1699/1683.Invalid Tweets/README_EN.md

@@ -43,21 +43,21 @@ This table contains all the tweets in a social media app.
 <pre>
 <strong>Input:</strong> 
 Tweets table:
-+----------+----------------------------------+
-| tweet_id | content                          |
-+----------+----------------------------------+
-| 1        | Vote for Biden                   |
-| 2        | Let us make America great again! |
-+----------+----------------------------------+
++----------+-----------------------------------+
+| tweet_id | content                           |
++----------+-----------------------------------+
+| 1        | Let us Code                       |
+| 2        | More than fifteen chars are here! |
++----------+-----------------------------------+
 <strong>Output:</strong> 
 +----------+
 | tweet_id |
 +----------+
 | 2        |
 +----------+
 <strong>Explanation:</strong> 
-Tweet 1 has length = 14. It is a valid tweet.
-Tweet 2 has length = 32. It is an invalid tweet.
+Tweet 1 has length = 11. It is a valid tweet.
+Tweet 2 has length = 33. It is an invalid tweet.
 </pre>
 
 <!-- description:end -->

solution/1700-1799/1743.Restore the Array From Adjacent Pairs/README.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1700-1799/1743.Re
 rating: 1579
 source: 第 226 场周赛 Q2
 tags:
+    - 深度优先搜索
     - 数组
     - 哈希表
 ---

solution/1700-1799/1743.Restore the Array From Adjacent Pairs/README_EN.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1700-1799/1743.Re
 rating: 1579
 source: Weekly Contest 226 Q2
 tags:
+    - Depth-First Search
     - Array
     - Hash Table
 ---

solution/1800-1899/1833.Maximum Ice Cream Bars/README.md

@@ -7,6 +7,7 @@ source: 第 237 场周赛 Q2
 tags:
     - 贪心
     - 数组
+    - 计数排序
     - 排序
 ---
 

solution/1800-1899/1833.Maximum Ice Cream Bars/README_EN.md

@@ -7,6 +7,7 @@ source: Weekly Contest 237 Q2
 tags:
     - Greedy
     - Array
+    - Counting Sort
     - Sorting
 ---
 

solution/2200-2299/2220.Minimum Bit Flips to Convert Number/README_EN.md

@@ -57,6 +57,9 @@ It can be shown we cannot convert 3 to 4 in less than 3 steps. Hence, we return
 	<li><code>0 &lt;= start, goal &lt;= 10<sup>9</sup></code></li>
 </ul>
 
+<p>&nbsp;</p>
+<p><strong>Note:</strong> This question is the same as <a href="https://leetcode.com/problems/hamming-distance/description/" target="_blank">461: Hamming Distance.</a></p>
+
 <!-- description:end -->
 
 ## Solutions

solution/2200-2299/2287.Rearrange Characters to Make Target String/README.md

@@ -28,7 +28,8 @@ tags:
 
 <p><strong>示例 1：</strong></p>
 
-<pre><strong>输入：</strong>s = "ilovecodingonleetcode", target = "code"
+<pre>
+<strong>输入：</strong>s = "ilovecodingonleetcode", target = "code"
 <strong>输出：</strong>2
 <strong>解释：</strong>
 对于 "code" 的第 1 个副本，选取下标为 4 、5 、6 和 7 的字符。
@@ -39,7 +40,8 @@ tags:
 
 <p><strong>示例 2：</strong></p>
 
-<pre><strong>输入：</strong>s = "abcba", target = "abc"
+<pre>
+<strong>输入：</strong>s = "abcba", target = "abc"
 <strong>输出：</strong>1
 <strong>解释：</strong>
 选取下标为 0 、1 和 2 的字符，可以形成 "abc" 的 1 个副本。 
@@ -49,7 +51,8 @@ tags:
 
 <p><strong>示例 3：</strong></p>
 
-<pre><strong>输入：</strong>s = "abbaccaddaeea", target = "aaaaa"
+<pre>
+<strong>输入：</strong>s = "abbaccaddaeea", target = "aaaaa"
 <strong>输出：</strong>1
 <strong>解释：</strong>
 选取下标为 0 、3 、6 、9 和 12 的字符，可以形成 "aaaaa" 的 1 个副本。
@@ -66,6 +69,10 @@ tags:
 	<li><code>s</code> 和 <code>target</code> 由小写英文字母组成</li>
 </ul>
 
+<p>&nbsp;</p>
+
+<p><strong>注意：</strong>本题与&nbsp;<a href="https://leetcode.cn/problems/maximum-number-of-balloons/">1189. “气球” 的最大数量</a> 相同。</p>
+
 <!-- description:end -->
 
 ## 解法

solution/2200-2299/2287.Rearrange Characters to Make Target String/README_EN.md

@@ -67,6 +67,9 @@ We can make at most one copy of "aaaaa", so we return 1.
 	<li><code>s</code> and <code>target</code> consist of lowercase English letters.</li>
 </ul>
 
+<p>&nbsp;</p>
+<p><strong>Note:</strong> This question is the same as <a href="https://leetcode.com/problems/maximum-number-of-balloons/description/" target="_blank"> 1189: Maximum Number of Balloons.</a></p>
+
 <!-- description:end -->
 
 ## Solutions

solution/2400-2499/2403.Minimum Time to Kill All Monsters/README_EN.md

@@ -43,7 +43,7 @@ tags:
 - Day 2: Gain 2 mana points to get a total of 2 mana points.
 - Day 3: Gain 2 mana points to get a total of 4 mana points. Spend all mana points to kill the 3<sup>rd</sup> monster.
 - Day 4: Gain 3 mana points to get a total of 3 mana points. Spend all mana points to kill the 1<sup>st</sup> monster.
-It can be proven that 4 is the minimum number of days needed.
+It can be proven that 4 is the minimum number of days needed. 
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
@@ -56,7 +56,7 @@ It can be proven that 4 is the minimum number of days needed.
 - Day 2: Gain 2 mana points to get a total of 2 mana points. Spend all mana points to kill the 2<sup>nd</sup> monster.
 - Day 3: Gain 3 mana points to get a total of 3 mana points.
 - Day 4: Gain 3 mana points to get a total of 6 mana points. Spend all mana points to kill the 3<sup>rd</sup> monster.
-It can be proven that 4 is the minimum number of days needed.
+It can be proven that 4 is the minimum number of days needed. 
 </pre>
 
 <p><strong class="example">Example 3:</strong></p>

solution/2600-2699/2631.Group By/README_EN.md

@@ -18,11 +18,11 @@ tags:
 
 <p>Write code that enhances all arrays such that you can call the&nbsp;<code>array.groupBy(fn)</code>&nbsp;method on any array and it will return a <strong>grouped</strong>&nbsp;version of the array.</p>
 
-<p>A&nbsp;<strong>grouped</strong>&nbsp;array is an object where each&nbsp;key&nbsp;is&nbsp;the output of&nbsp;<code>fn(arr[i])</code>&nbsp;and each&nbsp;value is an array containing all items in the original array with that key.</p>
+<p>A <strong>grouped</strong> array is an object where each&nbsp;key&nbsp;is&nbsp;the output of <code>fn(arr[i])</code> and each value is an array containing all items in the original array which generate that key.</p>
 
 <p>The provided callback&nbsp;<code>fn</code>&nbsp;will accept an item in the array and return a string key.</p>
 
-<p>The order of each value list should be the order the items&nbsp;appear in the array. Any order of keys is acceptable.</p>
+<p>The order of each value list should be the order the items appear in the array. Any order of keys is acceptable.</p>
 
 <p>Please solve it without lodash&#39;s&nbsp;<code>_.groupBy</code> function.</p>
 

solution/2700-2799/2724.Sort By/README_EN.md

@@ -16,7 +16,7 @@ tags:
 
 <!-- description:start -->
 
-<p>Given an array <code>arr</code> and a function <code>fn</code>, return a sorted array <code>sortedArr</code>. You can assume&nbsp;<code>fn</code>&nbsp;only returns numbers and those numbers determine the sort order of&nbsp;<code>sortedArr</code>. <code>sortedArray</code> must be sorted in <strong>ascending order</strong> by <code>fn</code> output.</p>
+<p>Given an array <code>arr</code> and a function <code>fn</code>, return a sorted array <code>sortedArr</code>. You can assume&nbsp;<code>fn</code>&nbsp;only returns numbers and those numbers determine the sort order of&nbsp;<code>sortedArr</code>. <code>sortedArr</code> must be sorted in <strong>ascending order</strong> by <code>fn</code> output.</p>
 
 <p>You may assume that <code>fn</code> will never duplicate numbers for a given array.</p>
 

solution/3000-3099/3038.Maximum Number of Operations With the Same Score I/README_EN.md

@@ -51,7 +51,7 @@ tags:
 <div class="example-block">
 <p><strong>Input:</strong> <span class="example-io">nums = [1,5,3,3,4,1,3,2,2,3]</span></p>
 
-<p><strong>Output:</strong> <span class="example-io">1</span></p>
+<p><strong>Output:</strong> <span class="example-io">2</span></p>
 
 <p><strong>Explanation:</strong></p>
 

solution/3100-3199/3103.Find Trending Hashtags II/README.md

@@ -29,7 +29,7 @@ tags:
 +-------------+---------+
 tweet_id 是这张表的主键 (值互不相同的列)。
 这张表的每一行都包含 user_id, tweet_id, tweet_date 和 tweet。
-</pre>
+题目保证所有 tweet_date 都是 2024 年 2 月的合法日期。</pre>
 
 <p>编写一个解决方案来找到&nbsp;<code>2024</code>&nbsp;年 <strong>二月&nbsp;</strong>的 <strong>前</strong>&nbsp;<code>3</code>&nbsp;热门话题 <strong>标签</strong>。一条推文可能含有 <strong>多个标签</strong>。</p>
 

solution/3100-3199/3103.Find Trending Hashtags II/README_EN.md

@@ -29,6 +29,8 @@ tags:
 +-------------+---------+
 tweet_id is the primary key (column with unique values) for this table.
 Each row of this table contains user_id, tweet_id, tweet_date and tweet.
+It is guaranteed that all tweet_date are valid dates in February 2024.
+
 </pre>
 
 <p>Write a solution to find the <strong>top</strong> <code>3</code> trending <strong>hashtags</strong> in <strong>February</strong> <code>2024</code>. Every tweet may contain <strong>several</strong> <strong>hashtags</strong>.</p>