feat: add solutions to lc problems: No.3162,3164,3166

solution/0400-0499/0409.Longest Palindrome/README_EN.md

@@ -18,9 +18,9 @@ tags:
 
 <!-- description:start -->
 
-<p>Given a string <code>s</code> which consists of lowercase or uppercase letters, return <em>the length of the <strong>longest palindrome</strong></em>&nbsp;that can be built with those letters.</p>
+<p>Given a string <code>s</code> which consists of lowercase or uppercase letters, return the length of the <strong>longest <span data-keyword="palindrome-string">palindrome</span></strong>&nbsp;that can be built with those letters.</p>
 
-<p>Letters are <strong>case sensitive</strong>, for example,&nbsp;<code>&quot;Aa&quot;</code> is not considered a palindrome here.</p>
+<p>Letters are <strong>case sensitive</strong>, for example, <code>&quot;Aa&quot;</code> is not considered a palindrome.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0400-0499/0430.Flatten a Multilevel Doubly Linked List/README_EN.md

@@ -64,7 +64,7 @@ After flattening the multilevel linked list it becomes:
 <p>&nbsp;</p>
 <p><strong>How the multilevel linked list is represented in test cases:</strong></p>
 
-<p>We use the multilevel linked list from <strong class="example">Example 1</strong> above:</p>
+<p>We use the multilevel linked list from <strong>Example 1</strong> above:</p>
 
 <pre>
  1---2---3---4---5---6--NULL

solution/2800-2899/2856.Minimum Array Length After Pair Removals/README_EN.md

@@ -23,56 +23,65 @@ tags:
 
 <!-- description:start -->
 
-<p>You are given a <strong>0-indexed</strong> <strong>sorted</strong> array of integers <code>nums</code>.</p>
+<p>Given an integer array <code>num</code> sorted in non-decreasing order.</p>
 
 <p>You can perform the following operation any number of times:</p>
 
 <ul>
-	<li>Choose <strong>two</strong> indices, <code>i</code> and <code>j</code>, where <code>i &lt; j</code>, such that <code>nums[i] &lt; nums[j]</code>.</li>
+	<li>Choose <strong>two</strong> indices, <code>i</code> and <code>j</code>, where <code>nums[i] &lt; nums[j]</code>.</li>
 	<li>Then, remove the elements at indices <code>i</code> and <code>j</code> from <code>nums</code>. The remaining elements retain their original order, and the array is re-indexed.</li>
 </ul>
 
-<p>Return <em>an integer that denotes the <strong>minimum</strong> length of </em><code>nums</code><em> after performing the operation any number of times (<strong>including zero</strong>).</em></p>
-
-<p>Note that <code>nums</code> is sorted in <strong>non-decreasing</strong> order.</p>
+<p>Return the <strong>minimum</strong> length of <code>nums</code> after applying the operation zero or more times.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre>
-<strong>Input:</strong> nums = [1,3,4,9]
-<strong>Output:</strong> 0
-<strong>Explanation:</strong> Initially, nums = [1, 3, 4, 9].
-In the first operation, we can choose index 0 and 1 because nums[0] &lt; nums[1] &lt;=&gt; 1 &lt; 3.
-Remove indices 0 and 1, and nums becomes [4, 9].
-For the next operation, we can choose index 0 and 1 because nums[0] &lt; nums[1] &lt;=&gt; 4 &lt; 9.
-Remove indices 0 and 1, and nums becomes an empty array [].
-Hence, the minimum length achievable is 0.</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,2,3,4]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">0</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/images/tcase1.gif" style="width: 160px; height: 70px;" /></p>
+</div>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre>
-<strong>Input:</strong> nums = [2,3,6,9]
-<strong>Output:</strong> 0
-<strong>Explanation:</strong> Initially, nums = [2, 3, 6, 9]. 
-In the first operation, we can choose index 0 and 2 because nums[0] &lt; nums[2] &lt;=&gt; 2 &lt; 6. 
-Remove indices 0 and 2, and nums becomes [3, 9]. 
-For the next operation, we can choose index 0 and 1 because nums[0] &lt; nums[1] &lt;=&gt; 3 &lt; 9. 
-Remove indices 0 and 1, and nums becomes an empty array []. 
-Hence, the minimum length achievable is 0.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,1,2,2,3,3]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">0</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/images/tcase2.gif" style="width: 240px; height: 70px;" /></p>
+</div>
 
 <p><strong class="example">Example 3:</strong></p>
 
-<pre>
-<strong>Input:</strong> nums = [1,1,2]
-<strong>Output:</strong> 1
-<strong>Explanation:</strong> Initially, nums = [1, 1, 2].
-In an operation, we can choose index 0 and 2 because nums[0] &lt; nums[2] &lt;=&gt; 1 &lt; 2. 
-Remove indices 0 and 2, and nums becomes [1]. 
-It is no longer possible to perform an operation on the array. 
-Hence, the minimum achievable length is 1. 
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1000000000,1000000000]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">2</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>Since both numbers are equal, they cannot be removed.</p>
+</div>
+
+<p><strong class="example">Example 4:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [2,3,4,4,4]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">1</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2800-2899/2856.Minimum%20Array%20Length%20After%20Pair%20Removals/images/tcase3.gif" style="width: 210px; height: 70px;" /></p>
+</div>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>

solution/2900-2999/2956.Find Common Elements Between Two Arrays/README_EN.md

@@ -19,35 +19,53 @@ tags:
 
 <!-- description:start -->
 
-<p>You are given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code> of sizes <code>n</code> and <code>m</code>, respectively.</p>
-
-<p>Consider calculating the following values:</p>
+<p>You are given two integer arrays <code>nums1</code> and <code>nums2</code> of sizes <code>n</code> and <code>m</code>, respectively. Calculate the following values:</p>
 
 <ul>
-	<li>The number of indices <code>i</code> such that <code>0 &lt;= i &lt; n</code> and <code>nums1[i]</code> occurs <strong>at least</strong> once in <code>nums2</code>.</li>
-	<li>The number of indices <code>i</code> such that <code>0 &lt;= i &lt; m</code> and <code>nums2[i]</code> occurs <strong>at least</strong> once in <code>nums1</code>.</li>
+	<li><code>answer1</code> : the number of indices <code>i</code> such that <code>nums1[i]</code> exists in <code>nums2</code>.</li>
+	<li><code>answer2</code> : the number of indices <code>i</code> such that <code>nums2[i]</code> exists in <code>nums1</code>.</li>
 </ul>
 
-<p>Return <em>an integer array </em><code>answer</code><em> of size </em><code>2</code><em> containing the two values <strong>in the above order</strong></em>.</p>
+<p>Return <code>[answer1,answer2]</code>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre>
-<strong>Input:</strong> nums1 = [4,3,2,3,1], nums2 = [2,2,5,2,3,6]
-<strong>Output:</strong> [3,4]
-<strong>Explanation:</strong> We calculate the values as follows:
-- The elements at indices 1, 2, and 3 in nums1 occur at least once in nums2. So the first value is 3.
-- The elements at indices 0, 1, 3, and 4 in nums2 occur at least once in nums1. So the second value is 4.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums1 = [2,3,2], nums2 = [1,2]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[2,1]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2900-2999/2956.Find%20Common%20Elements%20Between%20Two%20Arrays/images/3488_find_common_elements_between_two_arrays-t1.gif" style="width: 225px; height: 150px;" /></p>
+</div>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre>
-<strong>Input:</strong> nums1 = [3,4,2,3], nums2 = [1,5]
-<strong>Output:</strong> [0,0]
-<strong>Explanation:</strong> There are no common elements between the two arrays, so the two values will be 0.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums1 = [4,3,2,3,1], nums2 = [2,2,5,2,3,6]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[3,4]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The elements at indices 1, 2, and 3 in <code>nums1</code> exist in <code>nums2</code> as well. So <code>answer1</code> is 3.</p>
+
+<p>The elements at indices 0, 1, 3, and 4 in <code>nums2</code> exist in <code>nums1</code>. So <code>answer2</code> is 4.</p>
+</div>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums1 = [3,4,2,3], nums2 = [1,5]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[0,0]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>No numbers are common between <code>nums1</code> and <code>nums2</code>, so answer is [0,0].</p>
+</div>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>