Search⌘ K
AI Features

Solution: Sort Array By Parity II

Understand how to apply a modified cyclic sort combined with two pointers to rearrange an array where even numbers occupy even indexes and odd numbers occupy odd indexes. This lesson helps you implement an in-place, optimal solution by swapping misplaced elements efficiently.

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,...][0, 2, 4, ...].

  • All odd numbers are placed at odd indexes [1,3,5,...][1, 3, 5, ...].

You may return any valid arrangement that satisfies these conditions.

Constraints: ...