update readme

Author: hogan-tech

.github/test.txt

@@ -1 +1,2 @@
-3228-maximum-number-of-operations-to-move-ones-to-the-end python medium
+1470-shuffle-the-array python easy
+1929-concatenation-of-array python easy

1580-shuffle-the-array/1580-shuffle-the-array.py

@@ -1,3 +1,5 @@
+# time complexity: O(n)
+# space complexity: O(1)
 from typing import List
 
 
@@ -13,3 +15,9 @@ def shuffle(self, nums: List[int], n: int) -> List[int]:
 nums = [2, 5, 1, 3, 4, 7]
 n = 3
 print(Solution().shuffle(nums, n))
+nums = [1, 2, 3, 4, 4, 3, 2, 1]
+n = 4
+print(Solution().shuffle(nums, n))
+nums = [1, 1, 2, 2]
+n = 2
+print(Solution().shuffle(nums, n))

1580-shuffle-the-array/README.md

@@ -397,6 +397,7 @@
 | 1921 | [Eliminate Maximum Number of Monsters](https://leetcode.com/problems/eliminate-maximum-number-of-monsters/)                                                                                  | [Python](./Python/1921-eliminate-maximum-number-of-monsters.py)                                          | [Medium](./Readme/1921-eliminate-maximum-number-of-monsters.md)                                          |
 | 1922 | [Count Good Numbers](https://leetcode.com/problems/count-good-numbers)                                                                                                                       | [Python](./Python/1922-count-good-numbers.py)                                                            | [Medium](./Readme/1922-count-good-numbers.md)                                                            |
 | 1926 | [Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)                                                                                      | [Python](./Python/1926-nearest-exit-from-entrance-in-maze.py)                                            | [Medium](./Readme/1926-nearest-exit-from-entrance-in-maze.md)                                            |
+| 1929 | [Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/)                                                                                                              | [Python](./Python/1929-concatenation-of-array.py)                                                        | [Easy](./Readme/1929-concatenation-of-array.md)                                                          |
 | 1930 | [Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/)                                                                          | [Python](./Python/1930-unique-length-3-palindromic-subsequences.py)                                      | [Medium](./Readme/1930-unique-length-3-palindromic-subsequences.md)                                      |
 | 1931 | [Painting a Grid With Three Different Colors](https://leetcode.com/problems/painting-a-grid-with-three-different-colors)                                                                     | [Python](./Python/1931-painting-a-grid-with-three-different-colors.py)                                   | [Hard](./Readme/1931-painting-a-grid-with-three-different-colors.md)                                     |
 | 1934 | [Confirmation Rate](https://leetcode.com/problems/confirmation-rate/)                                                                                                                        | [SQL](./SQL/1934-confirmation-rate.sql)                                                                  | [Medium](./Readme/1934-confirmation-rate.md)                                                             |

Python/1470-shuffle-the-array.py

@@ -115,16 +115,3 @@ It helps others discover the repo and keeps the project growing.
 ---
 
 Feedback / Questions → open an Issue or reach out on [LinkedIn](https://www.linkedin.com/in/hogan-l/)  
-
-<!---LeetCode Topics Start-->
-# LeetCode Topics
-## Array
-|  |
-| ------- |
-| [1580-shuffle-the-array](https://github.com/hogan-tech/leetcode-solution/tree/master/1580-shuffle-the-array) |
-| [2058-concatenation-of-array](https://github.com/hogan-tech/leetcode-solution/tree/master/2058-concatenation-of-array) |
-## Simulation
-|  |
-| ------- |
-| [2058-concatenation-of-array](https://github.com/hogan-tech/leetcode-solution/tree/master/2058-concatenation-of-array) |
-<!---LeetCode Topics End-->

2058-concatenation-of-array/2058-concatenation-of-array.py renamed to Python/1929-concatenation-of-array.py

@@ -1,32 +1,35 @@
-<h2><a href="https://leetcode.com/problems/shuffle-the-array/">1470. Shuffle the Array</a></h2><h3>Easy</h3><hr><div><p>Given the array <code>nums</code> consisting of <code>2n</code> elements in the form <code>[x<sub>1</sub>,x<sub>2</sub>,...,x<sub>n</sub>,y<sub>1</sub>,y<sub>2</sub>,...,y<sub>n</sub>]</code>.</p>
-
-<p><em>Return the array in the form</em> <code>[x<sub>1</sub>,y<sub>1</sub>,x<sub>2</sub>,y<sub>2</sub>,...,x<sub>n</sub>,y<sub>n</sub>]</code>.</p>
-
-<p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
-
-<pre><strong>Input:</strong> nums = [2,5,1,3,4,7], n = 3
-<strong>Output:</strong> [2,3,5,4,1,7] 
-<strong>Explanation:</strong> Since x<sub>1</sub>=2, x<sub>2</sub>=5, x<sub>3</sub>=1, y<sub>1</sub>=3, y<sub>2</sub>=4, y<sub>3</sub>=7 then the answer is [2,3,5,4,1,7].
-</pre>
-
-<p><strong class="example">Example 2:</strong></p>
-
-<pre><strong>Input:</strong> nums = [1,2,3,4,4,3,2,1], n = 4
-<strong>Output:</strong> [1,4,2,3,3,2,4,1]
-</pre>
-
-<p><strong class="example">Example 3:</strong></p>
-
-<pre><strong>Input:</strong> nums = [1,1,2,2], n = 2
-<strong>Output:</strong> [1,2,1,2]
-</pre>
-
-<p>&nbsp;</p>
-<p><strong>Constraints:</strong></p>
-
-<ul>
-	<li><code>1 &lt;= n &lt;= 500</code></li>
-	<li><code>nums.length == 2n</code></li>
-	<li><code>1 &lt;= nums[i] &lt;= 10^3</code></li>
-</ul></div>
+<h2><a href="https://leetcode.com/problems/shuffle-the-array">1580. Shuffle the Array</a></h2><h3>Easy</h3><hr><p>Given the array <code>nums</code> consisting of <code>2n</code> elements in the form <code>[x<sub>1</sub>,x<sub>2</sub>,...,x<sub>n</sub>,y<sub>1</sub>,y<sub>2</sub>,...,y<sub>n</sub>]</code>.</p>
+
+<p><em>Return the array in the form</em> <code>[x<sub>1</sub>,y<sub>1</sub>,x<sub>2</sub>,y<sub>2</sub>,...,x<sub>n</sub>,y<sub>n</sub>]</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [2,5,1,3,4,7], n = 3
+<strong>Output:</strong> [2,3,5,4,1,7] 
+<strong>Explanation:</strong> Since x<sub>1</sub>=2, x<sub>2</sub>=5, x<sub>3</sub>=1, y<sub>1</sub>=3, y<sub>2</sub>=4, y<sub>3</sub>=7 then the answer is [2,3,5,4,1,7].
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3,4,4,3,2,1], n = 4
+<strong>Output:</strong> [1,4,2,3,3,2,4,1]
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,2,2], n = 2
+<strong>Output:</strong> [1,2,1,2]
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 500</code></li>
+	<li><code>nums.length == 2n</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10^3</code></li>
+</ul>