### LeetCode - Shuffle the Array Solution - The Coding Shala

Home >> LeetCode >> Shuffle the Array

Example 1:

In this post, we will learn how to solve LeetCode's Shuffle the Array problem and will implement its solution in Java.

## Shuffle the Array

Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn].

Example 1:

Input: nums = [2,5,1,3,4,7], n = 3

Output: [2,3,5,4,1,7]

Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7].

Example 2:

Input: nums = [1,2,3,4,4,3,2,1], n = 4

Output: [1,4,2,3,3,2,4,1]

Practice this problem on LeetCode: Click Here.

## Shuffle the Array Java Solution

**Approach 1:**

Using a new Array.

Space complexity: O(n).

Java Program:

class Solution { public int[] shuffle(int[] nums, int n) { int[] ans = new int[2*n]; int j=0; for(int i=0; i<2*n; i=i+2){ ans[i] = nums[j]; ans[i+1] = nums[n+j]; j++; } return ans; } }

**Other Posts You May Like**- LeetCode - Number of good pairs
- LeetCode - Kids with Greatest Number of Candies
- LeetCode - Running Sum of 1d Array
- LeetCode - Contains Duplicate
- LeetCode - Climbing Stairs

try to give solution in O(1) space complexity

ReplyDelete