Easy Solution for Beginners using Brute Force Approach
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int[] getConcatenation(int[] nums) {\n        int p[]=new int[nums.length];\n        for(int i=0;i<nums.length;i++)\n        {\n            p[i]=nums[i];\n        }\n        int n=nums.length+p.length;\n         List<Integer> m=new ArrayList<>();\n         for(int i=0;i<nums.length;i++)\n         {\n             m.add(nums[i]);\n            \n         }\n         for(int j=0;j<p.length;j++)\n         {\n             m.add(p[j]);\n         }\n          int[] arr = m.stream().mapToInt(i -> i).toArray();\n        return arr;\n    }\n}\n```
['Java']