MAGICPIN Hiring On-Campus OA (2022) | Sort Array by Parity

Problem Statement Given an integer array nums, rearrange the elements so that all even integers appear before all odd integers. You may return any valid arrangement that satisfies this condition. Example Input nums = [3,1,2,4] Output [2,4,3,1] Explanation Even numbers: 2, 4 Odd numbers: 3, 1 Any arrangement where all even numbers come before all odd numbers is accepted. Constraints 1 <= nums.length <= 5000 0 <= nums[i] <= 5000