feat: add biweekly contest 124 (doocs#2348)

Author: yanglbme

.github/workflows/deploy.yml

@@ -54,18 +54,18 @@ jobs:
           github_token: ${{ secrets.GITHUB_TOKEN }}
           publish_dir: ./site
 
-      - name: Sync to gitee.com
-        uses: wearerequired/git-mirror-action@master
-        env:
-            SSH_PRIVATE_KEY: ${{ secrets.RSA_PRIVATE_KEY }}
-        with:
-            source-repo: [email protected]:doocs/leetcode.git
-            destination-repo: [email protected]:Doocs/leetcode.git
+      # - name: Sync to gitee.com
+      #   uses: wearerequired/git-mirror-action@master
+      #   env:
+      #       SSH_PRIVATE_KEY: ${{ secrets.RSA_PRIVATE_KEY }}
+      #   with:
+      #       source-repo: [email protected]:doocs/leetcode.git
+      #       destination-repo: [email protected]:Doocs/leetcode.git
 
-      - name: Build Gitee Pages
-        uses: yanglbme/gitee-pages-action@main
-        with:
-            gitee-username: yanglbme
-            gitee-password: ${{ secrets.GITEE_PASSWORD }}
-            gitee-repo: doocs/leetcode
-            branch: gh-pages
+      # - name: Build Gitee Pages
+      #   uses: yanglbme/gitee-pages-action@main
+      #   with:
+      #       gitee-username: yanglbme
+      #       gitee-password: ${{ secrets.GITEE_PASSWORD }}
+      #       gitee-repo: doocs/leetcode
+      #       branch: gh-pages

solution/0300-0399/0333.Largest BST Subtree/README.md

@@ -1,4 +1,4 @@
-# [333. 最大 BST 子树](https://leetcode.cn/problems/largest-bst-subtree)
+# [333. 最大二叉搜索子树](https://leetcode.cn/problems/largest-bst-subtree)
 
 [English Version](/solution/0300-0399/0333.Largest%20BST%20Subtree/README_EN.md)
 

solution/0300-0399/0373.Find K Pairs with Smallest Sums/README_EN.md

@@ -27,14 +27,6 @@
 <strong>Explanation:</strong> The first 2 pairs are returned from the sequence: [1,1],[1,1],[1,2],[2,1],[1,2],[2,2],[1,3],[1,3],[2,3]
 </pre>
 
-<p><strong class="example">Example 3:</strong></p>
-
-<pre>
-<strong>Input:</strong> nums1 = [1,2], nums2 = [3], k = 3
-<strong>Output:</strong> [[1,3],[2,3]]
-<strong>Explanation:</strong> All possible pairs are returned from the sequence: [1,3],[2,3]
-</pre>
-
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>
 

solution/0600-0699/0629.K Inverse Pairs Array/README_EN.md

@@ -6,7 +6,7 @@
 
 <p>For an integer array <code>nums</code>, an <strong>inverse pair</strong> is a pair of integers <code>[i, j]</code> where <code>0 &lt;= i &lt; j &lt; nums.length</code> and <code>nums[i] &gt; nums[j]</code>.</p>
 
-<p>Given two integers n and k, return the number of different arrays consist of numbers from <code>1</code> to <code>n</code> such that there are exactly <code>k</code> <strong>inverse pairs</strong>. Since the answer can be huge, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
+<p>Given two integers n and k, return the number of different arrays consisting of numbers from <code>1</code> to <code>n</code> such that there are exactly <code>k</code> <strong>inverse pairs</strong>. Since the answer can be huge, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0900-0999/0935.Knight Dialer/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>The chess knight has a <strong>unique movement</strong>,&nbsp;it may move two squares vertically and one square horizontally, or two squares horizontally and one square vertically (with both forming the shape of an <strong>L</strong>). The possible movements of chess knight are shown in this diagaram:</p>
+<p>The chess knight has a <strong>unique movement</strong>,&nbsp;it may move two squares vertically and one square horizontally, or two squares horizontally and one square vertically (with both forming the shape of an <strong>L</strong>). The possible movements of chess knight are shown in this diagram:</p>
 
 <p>A chess knight can move as indicated in the chess diagram below:</p>
 <img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0900-0999/0935.Knight%20Dialer/images/chess.jpg" style="width: 402px; height: 402px;" />

solution/1000-1099/1071.Greatest Common Divisor of Strings/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>For two strings <code>s</code> and <code>t</code>, we say &quot;<code>t</code> divides <code>s</code>&quot; if and only if <code>s = t + ... + t</code> (i.e., <code>t</code> is concatenated with itself one or more times).</p>
+<p>For two strings <code>s</code> and <code>t</code>, we say &quot;<code>t</code> divides <code>s</code>&quot; if and only if <code>s = t + t + t + ... + t + t</code> (i.e., <code>t</code> is concatenated with itself one or more times).</p>
 
 <p>Given two strings <code>str1</code> and <code>str2</code>, return <em>the largest string </em><code>x</code><em> such that </em><code>x</code><em> divides both </em><code>str1</code><em> and </em><code>str2</code>.</p>
 

solution/1000-1099/1074.Number of Submatrices That Sum to Target/README_EN.md

@@ -40,7 +40,7 @@
 <ul>
 	<li><code>1 &lt;= matrix.length &lt;= 100</code></li>
 	<li><code>1 &lt;= matrix[0].length &lt;= 100</code></li>
-	<li><code>-1000 &lt;= matrix[i] &lt;= 1000</code></li>
+	<li><code>-1000 &lt;= matrix[i][j] &lt;= 1000</code></li>
 	<li><code>-10^8 &lt;= target &lt;= 10^8</code></li>
 </ul>
 

solution/1100-1199/1159.Market Analysis II/README_EN.md

@@ -53,11 +53,11 @@ item_id is the primary key (column with unique values) of this table.
 
 <p>&nbsp;</p>
 
-<p>Write a solution&nbsp;to find for each user, the join date and the number of orders they made as a buyer in <code>2019</code>.</p>
+<p>Write a solution to find for each user whether the brand of the second item (by date) they sold is their favorite brand. If a user sold less than two items, report the answer for that user as no. It is guaranteed that no seller sells more than one item in a day.</p>
 
 <p>Return the result table in <strong>any order</strong>.</p>
 
-<p>The&nbsp;result format is in the following example.</p>
+<p>The result format is in the following example.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/1400-1499/1403.Minimum Subsequence in Non-Increasing Order/README_EN.md

@@ -24,7 +24,7 @@
 <pre>
 <strong>Input:</strong> nums = [4,4,7,6,7]
 <strong>Output:</strong> [7,7,6] 
-<strong>Explanation:</strong> The subsequence [7,7] has the sum of its elements equal to 14 which is not strictly greater than the sum of elements not included (14 = 4 + 4 + 6). Therefore, the subsequence [7,6,7] is the minimal satisfying the conditions. Note the subsequence has to be returned in non-decreasing order.  
+<strong>Explanation:</strong> The subsequence [7,7] has the sum of its elements equal to 14 which is not strictly greater than the sum of elements not included (14 = 4 + 4 + 6). Therefore, the subsequence [7,6,7] is the minimal satisfying the conditions. Note the subsequence has to be returned in non-increasing order.  
 </pre>
 
 <p>&nbsp;</p>

solution/2100-2199/2149.Rearrange Array Elements by Sign/README_EN.md

@@ -48,6 +48,9 @@ So nums is rearranged to [1,-1].
 	<li><code>nums</code> consists of <strong>equal</strong> number of positive and negative integers.</li>
 </ul>
 
+<p>&nbsp;</p>
+It is not required to do the modifications in-place.
+
 ## Solutions
 
 ### Solution 1