fix for invalid md tag, update problem content and statuses

Notes/Questions/0590__n-ary-tree-postorder-traversal/readme.md

@@ -13,7 +13,7 @@
 </pre>
 
 <p><strong>Example 2:</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2019/11/08/sample_4_964.png" style="width: 296px; height: 241px;" />
+<img alt="" src="sample_4_964.png" style="width: 296px; height: 241px;" />
 <pre>
 <strong>Input:</strong> root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
 <strong>Output:</strong> [2,6,14,11,7,3,12,8,4,13,9,10,5,1]

Notes/Questions/0833__find-and-replace-in-string/readme.md

@@ -10,7 +10,7 @@
 	<li>Otherwise if it does occur, <strong>replace</strong> that substring with <code>targets[i]</code>.</li>
 </ol>
 
-<p>For example, if <code>s = &quot;<u>ab</u>cd&quot;</code>, <code>indices[i] = 0</code>, <code>sources[i] = &quot;ab&quot;</code>, and <code>targets[i] = &quot;eee&quot;</code>, then the result of this replacement will be <code>&quot;<u>eee</u>cd&quot;</code>.</p>
+<p>For example, if <code>s = &quot;<ins>ab</ins>cd&quot;</code>, <code>indices[i] = 0</code>, <code>sources[i] = &quot;ab&quot;</code>, and <code>targets[i] = &quot;eee&quot;</code>, then the result of this replacement will be <code>&quot;<ins>eee</ins>cd&quot;</code>.</p>
 
 <p>All replacement operations must occur <strong>simultaneously</strong>, meaning the replacement operations should not affect the indexing of each other. The testcases will be generated such that the replacements will <strong>not overlap</strong>.</p>
 

Notes/Questions/1627__graph-connectivity-with-threshold/readme.md

@@ -21,10 +21,10 @@
 <strong>Explanation:</strong> The divisors for each number:
 1:   1
 2:   1, 2
-3:   1, <u>3</u>
-4:   1, 2, <u>4</u>
-5:   1, <u>5</u>
-6:   1, 2, <u>3</u>, <u>6</u>
+3:   1, <ins>3</ins>
+4:   1, 2, <ins>4</ins>
+5:   1, <ins>5</ins>
+6:   1, 2, <ins>3</ins>, <ins>6</ins>
 Using the underlined divisors above the threshold, only cities 3 and 6 share a common divisor, so they are the
 only ones directly connected. The result of each query:
 [1,4]   1 is not connected to 4

Notes/Questions/1819__number-of-different-subsequences-gcds/readme.md

@@ -11,7 +11,7 @@
 <p>A <strong>subsequence</strong> of an array is a sequence that can be formed by removing some elements (possibly none) of the array.</p>
 
 <ul>
-	<li>For example, <code>[2,5,10]</code> is a subsequence of <code>[1,2,1,<strong><u>2</u></strong>,4,1,<u><strong>5</strong></u>,<u><strong>10</strong></u>]</code>.</li>
+	<li>For example, <code>[2,5,10]</code> is a subsequence of <code>[1,2,1,<strong><ins>2</ins></strong>,4,1,<ins><strong>5</strong></ins>,<ins><strong>10</strong></ins>]</code>.</li>
 </ul>
 
 <p>Return <em>the <strong>number</strong> of <strong>different</strong> GCDs among all <strong>non-empty</strong> subsequences of</em> <code>nums</code>.</p>

Notes/Questions/2014__longest-subsequence-repeated-k-times/readme.md

@@ -7,7 +7,7 @@
 <p>A subsequence <code>seq</code> is <strong>repeated</strong> <code>k</code> times in the string <code>s</code> if <code>seq * k</code> is a subsequence of <code>s</code>, where <code>seq * k</code> represents a string constructed by concatenating <code>seq</code> <code>k</code> times.</p>
 
 <ul>
-	<li>For example, <code>&quot;bba&quot;</code> is repeated <code>2</code> times in the string <code>&quot;bababcba&quot;</code>, because the string <code>&quot;bbabba&quot;</code>, constructed by concatenating <code>&quot;bba&quot;</code> <code>2</code> times, is a subsequence of the string <code>&quot;<strong><u>b</u></strong>a<strong><u>bab</u></strong>c<strong><u>ba</u></strong>&quot;</code>.</li>
+	<li>For example, <code>&quot;bba&quot;</code> is repeated <code>2</code> times in the string <code>&quot;bababcba&quot;</code>, because the string <code>&quot;bbabba&quot;</code>, constructed by concatenating <code>&quot;bba&quot;</code> <code>2</code> times, is a subsequence of the string <code>&quot;<strong><ins>b</ins></strong>a<strong><ins>bab</ins></strong>c<strong><ins>ba</ins></strong>&quot;</code>.</li>
 </ul>
 
 <p>Return <em>the <strong>longest subsequence repeated</strong> </em><code>k</code><em> times in string </em><code>s</code><em>. If multiple such subsequences are found, return the <strong>lexicographically largest</strong> one. If there is no such subsequence, return an <strong>empty</strong> string</em>.</p>

Notes/Questions/2019__the-score-of-students-solving-math-expression/readme.md

@@ -23,8 +23,8 @@
 <pre>
 <strong>Input:</strong> s = &quot;7+3*1*2&quot;, answers = [20,13,42]
 <strong>Output:</strong> 7
-<strong>Explanation:</strong> As illustrated above, the correct answer of the expression is 13, therefore one student is rewarded 5 points: [20,<u><strong>13</strong></u>,42]
-A student might have applied the operators in this wrong order: ((7+3)*1)*2 = 20. Therefore one student is rewarded 2 points: [<u><strong>20</strong></u>,13,42]
+<strong>Explanation:</strong> As illustrated above, the correct answer of the expression is 13, therefore one student is rewarded 5 points: [20,<ins><strong>13</strong></ins>,42]
+A student might have applied the operators in this wrong order: ((7+3)*1)*2 = 20. Therefore one student is rewarded 2 points: [<ins><strong>20</strong></ins>,13,42]
 The points for the students are: [2,5,0]. The sum of the points is 2+5+0=7.
 </pre>
 
@@ -33,8 +33,8 @@ The points for the students are: [2,5,0]. The sum of the points is 2+5+0=7.
 <pre>
 <strong>Input:</strong> s = &quot;3+5*2&quot;, answers = [13,0,10,13,13,16,16]
 <strong>Output:</strong> 19
-<strong>Explanation:</strong> The correct answer of the expression is 13, therefore three students are rewarded 5 points each: [<strong><u>13</u></strong>,0,10,<strong><u>13</u></strong>,<strong><u>13</u></strong>,16,16]
-A student might have applied the operators in this wrong order: ((3+5)*2 = 16. Therefore two students are rewarded 2 points: [13,0,10,13,13,<strong><u>16</u></strong>,<strong><u>16</u></strong>]
+<strong>Explanation:</strong> The correct answer of the expression is 13, therefore three students are rewarded 5 points each: [<strong><ins>13</ins></strong>,0,10,<strong><ins>13</ins></strong>,<strong><ins>13</ins></strong>,16,16]
+A student might have applied the operators in this wrong order: ((3+5)*2 = 16. Therefore two students are rewarded 2 points: [13,0,10,13,13,<strong><ins>16</ins></strong>,<strong><ins>16</ins></strong>]
 The points for the students are: [5,0,0,5,5,2,2]. The sum of the points is 5+0+0+5+5+2+2=19.
 </pre>
 

Notes/Questions/2030__smallest-k-length-subsequence-with-occurrences-of-a-letter/readme.md

@@ -15,10 +15,10 @@
 <strong>Input:</strong> s = &quot;leet&quot;, k = 3, letter = &quot;e&quot;, repetition = 1
 <strong>Output:</strong> &quot;eet&quot;
 <strong>Explanation:</strong> There are four subsequences of length 3 that have the letter &#39;e&#39; appear at least 1 time:
-- &quot;lee&quot; (from &quot;<strong><u>lee</u></strong>t&quot;)
-- &quot;let&quot; (from &quot;<strong><u>le</u></strong>e<u><strong>t</strong></u>&quot;)
-- &quot;let&quot; (from &quot;<u><strong>l</strong></u>e<u><strong>et</strong></u>&quot;)
-- &quot;eet&quot; (from &quot;l<u><strong>eet</strong></u>&quot;)
+- &quot;lee&quot; (from &quot;<strong><ins>lee</ins></strong>t&quot;)
+- &quot;let&quot; (from &quot;<strong><ins>le</ins></strong>e<ins><strong>t</strong></ins>&quot;)
+- &quot;let&quot; (from &quot;<ins><strong>l</strong></ins>e<ins><strong>et</strong></ins>&quot;)
+- &quot;eet&quot; (from &quot;l<ins><strong>eet</strong></ins>&quot;)
 The lexicographically smallest subsequence among them is &quot;eet&quot;.
 </pre>
 

Notes/Questions/2042__check-if-numbers-are-ascending-in-a-sentence/readme.md

@@ -25,15 +25,15 @@ They are strictly increasing from left to right: 1 < 3 < 4 < 6 < 12.
 <pre>
 <strong>Input:</strong> s = &quot;hello world 5 x 5&quot;
 <strong>Output:</strong> false
-<strong>Explanation:</strong> The numbers in s are: <u><strong>5</strong></u>, <strong><u>5</u></strong>. They are not strictly increasing.
+<strong>Explanation:</strong> The numbers in s are: <ins><strong>5</strong></ins>, <strong><ins>5</ins></strong>. They are not strictly increasing.
 </pre>
 
 <p><strong>Example 3:</strong></p>
 <img alt="example-3" src="example3.png" style="width: 794px; height: 48px;" />
 <pre>
 <strong>Input:</strong> s = &quot;sunset is at 7 51 pm overnight lows will be in the low 50 and 60 s&quot;
 <strong>Output:</strong> false
-<strong>Explanation:</strong> The numbers in s are: 7, <u><strong>51</strong></u>, <u><strong>50</strong></u>, 60. They are not strictly increasing.
+<strong>Explanation:</strong> The numbers in s are: 7, <ins><strong>51</strong></ins>, <ins><strong>50</strong></ins>, 60. They are not strictly increasing.
 </pre>
 
 <p>&nbsp;</p>

Notes/Questions/2055__plates-between-candles/readme.md

@@ -5,7 +5,7 @@
 <p>You are also given a <strong>0-indexed</strong> 2D integer array <code>queries</code> where <code>queries[i] = [left<sub>i</sub>, right<sub>i</sub>]</code> denotes the <strong>substring</strong> <code>s[left<sub>i</sub>...right<sub>i</sub>]</code> (<strong>inclusive</strong>). For each query, you need to find the <strong>number</strong> of plates <strong>between candles</strong> that are <strong>in the substring</strong>. A plate is considered <strong>between candles</strong> if there is at least one candle to its left <strong>and</strong> at least one candle to its right <strong>in the substring</strong>.</p>
 
 <ul>
-	<li>For example, <code>s = &quot;||**||**|*&quot;</code>, and a query <code>[3, 8]</code> denotes the substring <code>&quot;*||<strong><u>**</u></strong>|&quot;</code>. The number of plates between candles in this substring is <code>2</code>, as each of the two plates has at least one candle <strong>in the substring</strong> to its left <strong>and</strong> right.</li>
+	<li>For example, <code>s = &quot;||**||**|*&quot;</code>, and a query <code>[3, 8]</code> denotes the substring <code>&quot;*||<strong><ins>**</ins></strong>|&quot;</code>. The number of plates between candles in this substring is <code>2</code>, as each of the two plates has at least one candle <strong>in the substring</strong> to its left <strong>and</strong> right.</li>
 </ul>
 
 <p>Return <em>an integer array</em> <code>answer</code> <em>where</em> <code>answer[i]</code> <em>is the answer to the</em> <code>i<sup>th</sup></code> <em>query</em>.</p>

Notes/Questions/2058__find-the-minimum-and-maximum-number-of-nodes-between-critical-points/readme.md

@@ -25,9 +25,9 @@
 <strong>Input:</strong> head = [5,3,1,2,5,1,2]
 <strong>Output:</strong> [1,3]
 <strong>Explanation:</strong> There are three critical points:
-- [5,3,<strong><u>1</u></strong>,2,5,1,2]: The third node is a local minima because 1 is less than 3 and 2.
-- [5,3,1,2,<u><strong>5</strong></u>,1,2]: The fifth node is a local maxima because 5 is greater than 2 and 1.
-- [5,3,1,2,5,<u><strong>1</strong></u>,2]: The sixth node is a local minima because 1 is less than 5 and 2.
+- [5,3,<strong><ins>1</ins></strong>,2,5,1,2]: The third node is a local minima because 1 is less than 3 and 2.
+- [5,3,1,2,<ins><strong>5</strong></ins>,1,2]: The fifth node is a local maxima because 5 is greater than 2 and 1.
+- [5,3,1,2,5,<ins><strong>1</strong></ins>,2]: The sixth node is a local minima because 1 is less than 5 and 2.
 The minimum distance is between the fifth and the sixth node. minDistance = 6 - 5 = 1.
 The maximum distance is between the third and the sixth node. maxDistance = 6 - 3 = 3.
 </pre>
@@ -38,8 +38,8 @@ The maximum distance is between the third and the sixth node. maxDistance = 6 -
 <strong>Input:</strong> head = [1,3,2,2,3,2,2,2,7]
 <strong>Output:</strong> [3,3]
 <strong>Explanation:</strong> There are two critical points:
-- [1,<u><strong>3</strong></u>,2,2,3,2,2,2,7]: The second node is a local maxima because 3 is greater than 1 and 2.
-- [1,3,2,2,<u><strong>3</strong></u>,2,2,2,7]: The fifth node is a local maxima because 3 is greater than 2 and 2.
+- [1,<ins><strong>3</strong></ins>,2,2,3,2,2,2,7]: The second node is a local maxima because 3 is greater than 1 and 2.
+- [1,3,2,2,<ins><strong>3</strong></ins>,2,2,2,7]: The fifth node is a local maxima because 3 is greater than 2 and 2.
 Both the minimum and maximum distances are between the second and the fifth node.
 Thus, minDistance and maxDistance is 5 - 2 = 3.
 Note that the last node is not considered a local maxima because it does not have a next node.

Notes/Questions/2078__two-furthest-houses-with-different-colors/readme.md

@@ -10,7 +10,7 @@
 <p><strong>Example 1:</strong></p>
 <img alt="" src="eg1.png" style="width: 610px; height: 84px;" />
 <pre>
-<strong>Input:</strong> colors = [<u><strong>1</strong></u>,1,1,<strong><u>6</u></strong>,1,1,1]
+<strong>Input:</strong> colors = [<ins><strong>1</strong></ins>,1,1,<strong><ins>6</ins></strong>,1,1,1]
 <strong>Output:</strong> 3
 <strong>Explanation:</strong> In the above image, color 1 is blue, and color 6 is red.
 The furthest two houses with different colors are house 0 and house 3.
@@ -21,7 +21,7 @@ Note that houses 3 and 6 can also produce the optimal answer.
 <p><strong>Example 2:</strong></p>
 <img alt="" src="eg2.png" style="width: 426px; height: 84px;" />
 <pre>
-<strong>Input:</strong> colors = [<u><strong>1</strong></u>,8,3,8,<u><strong>3</strong></u>]
+<strong>Input:</strong> colors = [<ins><strong>1</strong></ins>,8,3,8,<ins><strong>3</strong></ins>]
 <strong>Output:</strong> 4
 <strong>Explanation:</strong> In the above image, color 1 is blue, color 8 is yellow, and color 3 is green.
 The furthest two houses with different colors are house 0 and house 4.
@@ -31,7 +31,7 @@ House 0 has color 1, and house 4 has color 3. The distance between them is abs(0
 <p><strong>Example 3:</strong></p>
 
 <pre>
-<strong>Input:</strong> colors = [<u><strong>0</strong></u>,<strong><u>1</u></strong>]
+<strong>Input:</strong> colors = [<ins><strong>0</strong></ins>,<strong><ins>1</ins></strong>]
 <strong>Output:</strong> 1
 <strong>Explanation:</strong> The furthest two houses with different colors are house 0 and house 1.
 House 0 has color 0, and house 1 has color 1. The distance between them is abs(0 - 1) = 1.

Notes/Questions/2087__minimum-cost-homecoming-of-a-robot-in-a-grid/readme.md

@@ -19,10 +19,10 @@
 <strong>Output:</strong> 18
 <strong>Explanation:</strong> One optimal path is that:
 Starting from (1, 0)
--&gt; It goes down to (<u><strong>2</strong></u>, 0). This move costs rowCosts[2] = 3.
--&gt; It goes right to (2, <u><strong>1</strong></u>). This move costs colCosts[1] = 2.
--&gt; It goes right to (2, <u><strong>2</strong></u>). This move costs colCosts[2] = 6.
--&gt; It goes right to (2, <u><strong>3</strong></u>). This move costs colCosts[3] = 7.
+-&gt; It goes down to (<ins><strong>2</strong></ins>, 0). This move costs rowCosts[2] = 3.
+-&gt; It goes right to (2, <ins><strong>1</strong></ins>). This move costs colCosts[1] = 2.
+-&gt; It goes right to (2, <ins><strong>2</strong></ins>). This move costs colCosts[2] = 6.
+-&gt; It goes right to (2, <ins><strong>3</strong></ins>). This move costs colCosts[3] = 7.
 The total cost is 3 + 2 + 6 + 7 = 18</pre>
 
 <p><strong>Example 2:</strong></p>

Notes/Questions/2090__k-radius-subarray-averages/readme.md

@@ -14,7 +14,7 @@
 
 <p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
-<img alt="" src="https://assets.leetcode.com/uploads/2021/11/07/eg1.png" style="width: 343px; height: 119px;" />
+<img alt="" src="eg1.png" style="width: 343px; height: 119px;" />
 <pre>
 <strong>Input:</strong> nums = [7,4,3,9,1,8,5,2,6], k = 3
 <strong>Output:</strong> [-1,-1,-1,5,4,4,-1,-1,-1]

Notes/Questions/2120__execution-of-all-suffix-instructions-staying-in-a-grid/readme.md

@@ -20,11 +20,11 @@
 <strong>Input:</strong> n = 3, startPos = [0,1], s = &quot;RRDDLU&quot;
 <strong>Output:</strong> [1,5,4,3,1,0]
 <strong>Explanation:</strong> Starting from startPos and beginning execution from the i<sup>th</sup> instruction:
-- 0<sup>th</sup>: &quot;<u><strong>R</strong></u>RDDLU&quot;. Only one instruction &quot;R&quot; can be executed before it moves off the grid.
-- 1<sup>st</sup>:  &quot;<u><strong>RDDLU</strong></u>&quot;. All five instructions can be executed while it stays in the grid and ends at (1, 1).
-- 2<sup>nd</sup>:   &quot;<u><strong>DDLU</strong></u>&quot;. All four instructions can be executed while it stays in the grid and ends at (1, 0).
-- 3<sup>rd</sup>:    &quot;<u><strong>DLU</strong></u>&quot;. All three instructions can be executed while it stays in the grid and ends at (0, 0).
-- 4<sup>th</sup>:     &quot;<u><strong>L</strong></u>U&quot;. Only one instruction &quot;L&quot; can be executed before it moves off the grid.
+- 0<sup>th</sup>: &quot;<ins><strong>R</strong></ins>RDDLU&quot;. Only one instruction &quot;R&quot; can be executed before it moves off the grid.
+- 1<sup>st</sup>:  &quot;<ins><strong>RDDLU</strong></ins>&quot;. All five instructions can be executed while it stays in the grid and ends at (1, 1).
+- 2<sup>nd</sup>:   &quot;<ins><strong>DDLU</strong></ins>&quot;. All four instructions can be executed while it stays in the grid and ends at (1, 0).
+- 3<sup>rd</sup>:    &quot;<ins><strong>DLU</strong></ins>&quot;. All three instructions can be executed while it stays in the grid and ends at (0, 0).
+- 4<sup>th</sup>:     &quot;<ins><strong>L</strong></ins>U&quot;. Only one instruction &quot;L&quot; can be executed before it moves off the grid.
 - 5<sup>th</sup>:      &quot;U&quot;. If moving up, it would move off the grid.
 </pre>
 
@@ -34,8 +34,8 @@
 <strong>Input:</strong> n = 2, startPos = [1,1], s = &quot;LURD&quot;
 <strong>Output:</strong> [4,1,0,0]
 <strong>Explanation:</strong>
-- 0<sup>th</sup>: &quot;<u><strong>LURD</strong></u>&quot;.
-- 1<sup>st</sup>:  &quot;<u><strong>U</strong></u>RD&quot;.
+- 0<sup>th</sup>: &quot;<ins><strong>LURD</strong></ins>&quot;.
+- 1<sup>st</sup>:  &quot;<ins><strong>U</strong></ins>RD&quot;.
 - 2<sup>nd</sup>:   &quot;RD&quot;.
 - 3<sup>rd</sup>:    &quot;D&quot;.
 </pre>