Skip to content

Practice Concatenation of Array

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#1929
LeetCode Problem

Concatenation of Array

Problem Statement

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.

Source: Concatenation of Array on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [1,2,1]
Output
[1,2,1,1,2,1]

# Example 2

Input
nums = [1,3,2,1]
Output
[1,3,2,1,1,3,2,1]

Constraints

n == nums.length
1 <= n <= 1000
1 <= nums[i] <= 1000

Related LeetCode Problems

Practice more problems similar to Concatenation of Array.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.