solves concatenation of array

Author: anishLearnsToCode

README.md

@@ -463,7 +463,7 @@
 | 1913 | [Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs)                                |                                                     [![Java](assets/java.png)](src/MaximumProductDifferenceBetweenTwoPairs.java)                                                     |                                                                                                                                   |
 | 1920 | [Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation)                                                                |                                                            [![Java](assets/java.png)](src/BuildArrayFromPermutation.java)                                                            |                                                                                                                                   |
 | 1925 | [Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples)                                                                        |                                                             [![Java](assets/java.png)](src/CountSquareSumTriplets.java)                                                              |                                                                                                                                   |
-| 1929 | [Concatenation of Array](https://leetcode.com/problems/concatenation-of-array)                                                                            |                                                                                                                                                                                      |                                                                                                                                   |
+| 1929 | [Concatenation of Array](https://leetcode.com/problems/concatenation-of-array)                                                                            |                                                              [![Java](assets/java.png)](src/ConcatenationOfArray.java)                                                               |                                                                                                                                   |
 | 1933 | 🔒 [Check If String Is Decomposable Into Value EqualSubstrings](https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substring) |                                                                                                                                                                                      |                                                                                                                                   |
 | 1935 | [Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type)                                                |                                                                                                                                                                                      |                                                                                                                                   |
 | 1941 | [Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences)        |                                                                                                                                                                                      |                                                                                                                                   |

src/ConcatenationOfArray.java

@@ -0,0 +1,12 @@
+// https://leetcode.com/problems/concatenation-of-array
+// T: O(N)
+// S: O(N)
+
+public class ConcatenationOfArray {
+    public int[] getConcatenation(int[] nums) {
+        final int[] result = new int[nums.length * 2];
+        for (int i = 0 ; i < nums.length ; i++) result[i] = nums[i];
+        for (int i = nums.length ; i < result.length ; i++) result[i] = nums[i - nums.length];
+        return result;
+    }
+}