Search⌘ K
AI Features

Solution: Concatenation of Array

Understand how to solve the array concatenation problem by tracking each element's index and placing it twice in a result array. Learn to create a linear time and space solution that efficiently duplicates the input array without extra passes or utilities.

Statement

Given an integer array nums of length n, construct an array ans of length 2n2n such that ans[i] == nums[i] and ans[i + n] == nums[i] for 00 \leq i << n (0-indexed).

In other words, ans is formed by appending nums to itself.

Return the array ans.

Constraints:

  • n ==== nums.length ...