Search⌘ K
AI Features

Solution: Sort Array By Parity II

Explore how to rearrange an integer array where half the elements are even and half are odd so that even numbers occupy even indexes and odd numbers occupy odd indexes. Learn a modified cyclic sort technique combined with two pointers to swap misplacements in place, resulting in a solution with linear time and constant space complexity.

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: ...