**Physical Address**

304 North Cardinal St.

Dorchester Center, MA 02124

Given an integer array `nums`

, move all the even integers at the beginning of the array followed by all the odd integers.

Return * any array that satisfies this condition*.

**Example 1:**

```
Input: nums = [3,1,2,4]
Output: [2,4,3,1]
Explanation: The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.
```

**Example 2:**

```
Input: nums = [0]
Output: [0]
```

**Constraints:**

`1 <= nums.length <= 5000`

`0 <= nums[i] <= 5000`

```
vector<int> sortArrayByParity(vector<int> &A) {
for (int i = 0, j = 0; j < A.size(); j++)
if (A[j] % 2 == 0) swap(A[i++], A[j]);
return A;
}
```

```
public int[] sortArrayByParity(int[] A) {
for (int i = 0, j = 0; j < A.length; j++)
if (A[j] % 2 == 0) {
int tmp = A[i];
A[i++] = A[j];
A[j] = tmp;;
}
return A;
}
```

```
class Solution:
def sortArrayByParity(self, A):
beg, end = 0, len(A) - 1
while beg <= end:
if A[beg] % 2 == 0:
beg += 1
else:
A[beg], A[end] = A[end], A[beg]
end -= 1
return A
```

In our experience, we suggest you solve this Sort Array By Parity LeetCode Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Sort Array By Parity LeetCode Solution

I hope this Sort Array By Parity LeetCode Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

**More Coding Solutions >>**