3467. Transform Array by Parity

LeetCodeArraySortingCountingOpen on judge ↗

You are given an integer array nums. Transform nums by performing the following operations in the exact order specified: - Replace each even number with 0. - Replace each odd numbers with 1. - Sort the modified array in non-decreasing order. Return the resulting array after performing these operations. Example 1: Input: nums = [4,3,2,1] Output: [0,0,1,1] Explanation: - Replace the even

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI