1929. Concatenation of Array | LeetCode Solution | JavaScript | Easy

LeetCode Problem - Link

Problem

Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed).

Specifically, ans is the concatenation of two nums arrays.

Return the array ans.

Example 1:

Input: nums = [1,2,1]
Output: [1,2,1,1,2,1]
Explanation: The array ans is formed as follows:
- ans = [nums[0],nums[1],nums[2],nums[0],nums[1],nums[2]]
- ans = [1,2,1,1,2,1]

Sequential Approach

Nothing fancy here, super easy question to solve, whatever input array you get, basically run 2 for loops. One is the array, the other runs twice

/**
 * @param {number[]} nums
 * @return {number[]}
 */
var getConcatenation = function(nums) {
    var newArr = []
    for(i=0;i<2;i++){
        for(var j=0;j<nums.length;j++){
            newArr.push(nums[j])
        }
    }
    return newArr
};