Accepted Java O(n) Solution
Here\'s the simple intiutive approach \n\n1. Create Array of 2*length\n2. Use i % n index for setting values. Means if Value goes over N it would start again.\n
### Here\'s the simple intiutive approach \n\n1. Create Array of 2*length\n2. Use i % n index for setting values. Means if Value goes over N it would start again.\n\nEx: 3%5 = 3, 4%5 = 4, 5%5 = 0, 6%5 = 1....\n\n```\npublic int[] getConcatenation(int[] nums) {\n\tint n = nums.length;\n\tint[] result = new int[2*n];\n\tfor(int i = 0; i < result.length; i++){\n\t\tresult[i] = nums[i%n];\n\t}\n\treturn result;\n}\n```
['Java']