Problem: Sort Array By Parity II

Medium

30 min

Understand how to rearrange an array containing equal halves of even and odd numbers so that even values are positioned at even indexes and odd values at odd indexes. Explore the cyclic sort pattern to implement a valid solution and practice coding in a hands-on environment.

Statement

You are given an integer, array nums, where exactly half of the elements are even, and the other half are odd.

Rearrange nums such that:

All even numbers are placed at even indexes $[0, 2, 4, ...]$ .
All odd numbers are placed at odd indexes $[1, 3, 5, ...]$ .

You may return any valid arrangement that satisfies these conditions.

Constraints:

$2 \leq$ nums.length $\leq 10^3$
nums.length is even.
Half of the integers in nums are even.
$0\leq$ nums[i] $\leq1000$

Problem: Sort Array By Parity II

Medium

30 min

Statement

You are given an integer, array nums, where exactly half of the elements are even, and the other half are odd.

Rearrange nums such that:

All even numbers are placed at even indexes $[0, 2, 4, ...]$ .
All odd numbers are placed at odd indexes $[1, 3, 5, ...]$ .

You may return any valid arrangement that satisfies these conditions.

Constraints:

$2 \leq$ nums.length $\leq 10^3$
nums.length is even.
Half of the integers in nums are even.
$0\leq$ nums[i] $\leq1000$

Problem: Sort Array By Parity II

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Sort Array By Parity II

Statement

Examples

Understand the problem

Figure it out!

Try it yourself