Move Zeroes
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 0's to the end of it while maintaining the relative order of the non-zero elements.
Note that you must do this in-place without making a copy of the array.
LeetCode Problem - 283: Link | Click Here
class Solution {
public void moveZeroes(int[] nums) {
// Initialize a variable to keep track of the index where non-zero elements should be placed
int nonZeroIndex = 0;
// Iterate through the array
for (int i = 0; i < nums.length; i++) {
// If the current element is non-zero, update the element at nonZeroIndex
if (nums[i] != 0) {
nums[nonZeroIndex++] = nums[i];
}
}
// Fill the remaining elements in the array with zeros
while (nonZeroIndex < nums.length) {
nums[nonZeroIndex++] = 0;
}
}
}
