deploy: 5d79d9f

Author: yanglbme

en/lc/1547/index.html

@@ -80288,7 +80288,7 @@ <h1 id="3349-adjacent-increasing-subarrays-detection-i"><a href="https://leetcod
 <h2 id="description">Description</h2>
 <!-- description:start -->
 
-<p>Given an array <code>nums</code> of <code>n</code> integers and an integer <code>k</code>, determine whether there exist <strong>two</strong> <strong>adjacent</strong> subarrays of length <code>k</code> such that both subarrays are <strong>strictly</strong> <strong>increasing</strong>. Specifically, check if there are <strong>two</strong> subarrays starting at indices <code>a</code> and <code>b</code> (<code>a &lt; b</code>), where:</p>
+<p>Given an array <code>nums</code> of <code>n</code> integers and an integer <code>k</code>, determine whether there exist <strong>two</strong> <strong>adjacent</strong> <span data-keyword="subarray-nonempty">subarrays</span> of length <code>k</code> such that both subarrays are <strong>strictly</strong> <strong>increasing</strong>. Specifically, check if there are <strong>two</strong> subarrays starting at indices <code>a</code> and <code>b</code> (<code>a &lt; b</code>), where:</p>
 
 <ul>
     <li>Both subarrays <code>nums[a..a + k - 1]</code> and <code>nums[b..b + k - 1]</code> are <strong>strictly increasing</strong>.</li>
@@ -80297,8 +80297,6 @@ <h2 id="description">Description</h2>
 
 <p>Return <code>true</code> if it is <em>possible</em> to find <strong>two </strong>such subarrays, and <code>false</code> otherwise.</p>
 
-<p>A <strong>subarray</strong> is a contiguous <b>non-empty</b> sequence of elements within an array.</p>
-
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
@@ -80329,7 +80327,7 @@ <h2 id="description">Description</h2>
 
 <ul>
     <li><code>2 &lt;= nums.length &lt;= 100</code></li>
-    <li><code>1 &lt;= 2 * k &lt;= nums.length</code></li>
+    <li><code>1 &lt; 2 * k &lt;= nums.length</code></li>
     <li><code>-1000 &lt;= nums[i] &lt;= 1000</code></li>
 </ul>
 

en/lc/3346/index.html

@@ -80288,7 +80288,7 @@ <h1 id="3350-adjacent-increasing-subarrays-detection-ii"><a href="https://leetco
 <h2 id="description">Description</h2>
 <!-- description:start -->
 
-<p>Given an array <code>nums</code> of <code>n</code> integers, your task is to find the <strong>maximum</strong> value of <code>k</code> for which there exist <strong>two</strong> adjacent subarrays of length <code>k</code> each, such that both subarrays are <strong>strictly</strong> <strong>increasing</strong>. Specifically, check if there are <strong>two</strong> subarrays of length <code>k</code> starting at indices <code>a</code> and <code>b</code> (<code>a &lt; b</code>), where:</p>
+<p>Given an array <code>nums</code> of <code>n</code> integers, your task is to find the <strong>maximum</strong> value of <code>k</code> for which there exist <strong>two</strong> adjacent <span data-keyword="subarray-nonempty">subarrays</span> of length <code>k</code> each, such that both subarrays are <strong>strictly</strong> <strong>increasing</strong>. Specifically, check if there are <strong>two</strong> subarrays of length <code>k</code> starting at indices <code>a</code> and <code>b</code> (<code>a &lt; b</code>), where:</p>
 
 <ul>
     <li>Both subarrays <code>nums[a..a + k - 1]</code> and <code>nums[b..b + k - 1]</code> are <strong>strictly increasing</strong>.</li>

en/lc/3347/index.html

@@ -80288,9 +80288,7 @@ <h1 id="3351-sum-of-good-subsequences"><a href="https://leetcode.com/problems/su
 <h2 id="description">Description</h2>
 <!-- description:start -->
 
-<p>You are given an integer array <code>nums</code>. A <strong>good subsequence</strong> is defined as a subsequence of <code>nums</code> where the absolute difference between any <strong>two</strong> consecutive elements in the subsequence is <strong>exactly</strong> 1.</p>
-
-<p>A <strong>subsequence</strong> is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.</p>
+<p>You are given an integer array <code>nums</code>. A <strong>good </strong><span data-keyword="subsequence-array">subsequence</span> is defined as a subsequence of <code>nums</code> where the absolute difference between any <strong>two</strong> consecutive elements in the subsequence is <strong>exactly</strong> 1.</p>
 
 <p>Return the <strong>sum</strong> of all <em>possible</em> <strong>good subsequences</strong> of <code>nums</code>.</p>
 

en/lc/3349/index.html

@@ -80295,7 +80295,7 @@ <h2 id="description">Description</h2>
 <p>An integer <code>x</code> is called <strong>k-reducible</strong> if performing the following operation <strong>at most</strong> <code>k</code> times reduces it to 1:</p>
 
 <ul>
-    <li>Replace <code>x</code> with the <strong>count</strong> of set bits in its binary representation.</li>
+    <li>Replace <code>x</code> with the <strong>count</strong> of <span data-keyword="set-bit">set bits</span> in its binary representation.</li>
 </ul>
 
 <p>For example, the binary representation of 6 is <code>&quot;110&quot;</code>. Applying the operation once reduces it to 2 (since <code>&quot;110&quot;</code> has two set bits). Applying the operation again to 2 (binary <code>&quot;10&quot;</code>) reduces it to 1 (since <code>&quot;10&quot;</code> has one set bit).</p>
@@ -80304,8 +80304,6 @@ <h2 id="description">Description</h2>
 
 <p>Since the answer may be too large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
 
-<p>A set bit refers to a bit in the binary representation of a number that has a value of <code>1</code>.</p>
-
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>