Practice Microsoft Coding Question | Real Coding Interviews | Hack2hire

NewThe Learning module is now liveSee what's new

Question Bank Learning

Pricing Blog Forum

Quick Summary

Rearrange an integer array so all even numbers appear before odd numbers.
Return the minimum number of swaps required to achieve this partition.
The relative order within each parity group does not matter.

What This Tests

Array partitioning and logical reasoning
Greedy mathematical insight for optimization
Parity checks and boundary condition handling
Complexity analysis under large input constraints

Common Patterns

Two Pointers

Greedy

Sliding Window

Accepted

1.6k/2.2k

Acceptance Rate76.5%

Test Cases

Input

nums =

Output

Expected