Sort Array By Parity
As a Systems Engineer at Tata Consultancy Services, I deliver exceptional software products for mobile and web platforms, using agile methodologies and robust quality maintenance. I am experienced in performance testing, automation testing, API testing, and manual testing, with various tools and technologies such as Jmeter, Azure LoadTest, Selenium, Java, OOPS, Maven, TestNG, and Postman.
I have successfully developed and executed detailed test plans, test cases, and scripts for Android and web applications, ensuring high-quality standards and user satisfaction. I have also demonstrated my proficiency in manual REST API testing with Postman, as well as in end-to-end performance and automation testing using Jmeter and selenium with Java, TestNG and Maven. Additionally, I have utilized Azure DevOps for bug tracking and issue management.
Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers.
Return any array that satisfies this condition.
LeetCode Problem - 905
class Solution {
public int[] sortArrayByParity(int[] nums) {
// Initialize a new array to store the sorted numbers.
int[] newArr = new int[nums.length];
// Counter to keep track of the position to insert numbers into the new array.
int count = 0;
// First loop to insert even numbers into the new array.
for(int i=0; i<nums.length; i++){
if(nums[i]%2==0){
newArr[count] = nums[i]; // Insert even number at current position.
count++; // Move to the next position.
}
}
// Second loop to insert odd numbers into the new array.
for(int i=0; i<nums.length; i++){
if(nums[i]%2!=0){
newArr[count] = nums[i]; // Insert odd number at current position.
count++; // Move to the next position.
}
}
// Return the sorted array.
return newArr;
}
}
