feat: update lc problems

Author: yanglbme

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given a string <code>s</code>, find the length of the <strong>longest <span data-keyword="substring-nonempty">substring</span></strong> without repeating characters.</p>
+<p>Given a string <code>s</code>, find the length of the <strong>longest</strong> <span data-keyword="substring-nonempty"><strong>substring</strong></span> without repeating characters.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md

@@ -4,9 +4,7 @@
 
 ## Description
 
-<p>Given a string <code>s</code>, return <em>the longest palindromic substring</em> in <code>s</code>.</p>
-
-<p>A string is called a palindrome string if the reverse of that string is the same as the original string.</p>
+<p>Given a string <code>s</code>, return <em>the longest</em> <span data-keyword="palindromic-string"><em>palindromic</em></span> <span data-keyword="substring-nonempty"><em>substring</em></span> in <code>s</code>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0000-0099/0009.Palindrome Number/README_EN.md

@@ -4,13 +4,7 @@
 
 ## Description
 
-<p>Given an integer <code>x</code>, return <code>true</code> if <code>x</code> is palindrome integer.</p>
-
-<p>An integer is a <strong>palindrome</strong> when it reads the same backward as forward.</p>
-
-<ul>
-	<li>For example, <code>121</code> is a palindrome while <code>123</code> is not.</li>
-</ul>
+<p>Given an integer <code>x</code>, return <code>true</code><em> if </em><code>x</code><em> is a </em><span data-keyword="palindrome-integer"><em><strong>palindrome</strong></em></span><em>, and </em><code>false</code><em> otherwise</em>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0000-0099/0032.Longest Valid Parentheses/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given a string containing just the characters <code>&#39;(&#39;</code> and <code>&#39;)&#39;</code>, find the length of the longest valid (well-formed) parentheses substring.</p>
+<p>Given a string containing just the characters <code>&#39;(&#39;</code> and <code>&#39;)&#39;</code>, return <em>the length of the longest valid (well-formed) parentheses </em><span data-keyword="substring-nonempty"><em>substring</em></span>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0000-0099/0039.Combination Sum/README_EN.md

@@ -6,7 +6,7 @@
 
 <p>Given an array of <strong>distinct</strong> integers <code>candidates</code> and a target integer <code>target</code>, return <em>a list of all <strong>unique combinations</strong> of </em><code>candidates</code><em> where the chosen numbers sum to </em><code>target</code><em>.</em> You may return the combinations in <strong>any order</strong>.</p>
 
-<p>The <strong>same</strong> number may be chosen from <code>candidates</code> an <strong>unlimited number of times</strong>. Two combinations are unique if the frequency of at least one of the chosen numbers is different.</p>
+<p>The <strong>same</strong> number may be chosen from <code>candidates</code> an <strong>unlimited number of times</strong>. Two combinations are unique if the <span data-keyword="frequency-array">frequency</span> of at least one of the chosen numbers is different.</p>
 
 <p>The test cases are generated such that the number of unique combinations that sum up to <code>target</code> is less than <code>150</code> combinations for the given input.</p>
 

solution/0000-0099/0053.Maximum Subarray/README_EN.md

@@ -4,9 +4,7 @@
 
 ## Description
 
-<p>Given an integer array <code>nums</code>, find the contiguous subarray (containing at least one number) which has the largest sum and return <em>its sum</em>.</p>
-
-<p>A <strong>subarray</strong> is a <strong>contiguous</strong> part of an array.</p>
+<p>Given an integer array <code>nums</code>, find the <span data-keyword="subarray-nonempty">subarray</span> which has the largest sum and return <em>its sum</em>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0000-0099/0058.Length of Last Word/README_EN.md

@@ -6,7 +6,7 @@
 
 <p>Given a string <code>s</code> consisting of words and spaces, return <em>the length of the <strong>last</strong> word in the string.</em></p>
 
-<p>A <strong>word</strong> is a maximal substring consisting of non-space characters only.</p>
+<p>A <strong>word</strong> is a maximal <span data-keyword="substring-nonempty">substring</span> consisting of non-space characters only.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0000-0099/0076.Minimum Window Substring/README_EN.md

@@ -4,12 +4,10 @@
 
 ## Description
 
-<p>Given two strings <code>s</code> and <code>t</code> of lengths <code>m</code> and <code>n</code> respectively, return <em>the <strong>minimum window substring</strong> of </em><code>s</code><em> such that every character in </em><code>t</code><em> (<strong>including duplicates</strong>) is included in the window. If there is no such substring</em><em>, return the empty string </em><code>&quot;&quot;</code><em>.</em></p>
+<p>Given two strings <code>s</code> and <code>t</code> of lengths <code>m</code> and <code>n</code> respectively, return <em>the <strong>minimum window</strong></em> <span data-keyword="substring-nonempty"><strong><em>substring</em></strong></span><em> of </em><code>s</code><em> such that every character in </em><code>t</code><em> (<strong>including duplicates</strong>) is included in the window</em>. If there is no such substring, return <em>the empty string </em><code>&quot;&quot;</code>.</p>
 
 <p>The testcases will be generated such that the answer is <strong>unique</strong>.</p>
 
-<p>A <strong>substring</strong> is a contiguous sequence of characters within the string.</p>
-
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 

solution/0000-0099/0078.Subsets/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given an integer array <code>nums</code> of <strong>unique</strong> elements, return <em>all possible subsets (the power set)</em>.</p>
+<p>Given an integer array <code>nums</code> of <strong>unique</strong> elements, return <em>all possible</em> <span data-keyword="subset"><em>subsets</em></span> <em>(the power set)</em>.</p>
 
 <p>The solution set <strong>must not</strong> contain duplicate subsets. Return the solution in <strong>any order</strong>.</p>
 

solution/0000-0099/0090.Subsets II/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>Given an integer array <code>nums</code> that may contain duplicates, return <em>all possible subsets (the power set)</em>.</p>
+<p>Given an integer array <code>nums</code> that may contain duplicates, return <em>all possible</em> <span data-keyword="subset"><em>subsets</em></span><em> (the power set)</em>.</p>
 
 <p>The solution set <strong>must not</strong> contain duplicate subsets. Return the solution in <strong>any order</strong>.</p>