Move Zeroes to End

In array manipulation problems, a common task is to move all zeroes to the end of an array while keeping the relative order of non-zero elements. This is especially important for optimizing in-place operations in coding interviews. Problem Statement Given an integer array nums, move all 0s to the end of it while maintaining the relative order of the non-zero elements. You must do this in-place without making a copy of the array. Examples: Input: [0,1,0,3,12] → Output: [1,3,12,0,0] Input: [0] → Output: [0] Constraints: 1 <= nums.length <= 10^4 -2^31 <= nums[i] <= 2^31 - 1 Approach Use a pointer lastNonZeroFoundAt to track the position where the next non-zero element should go. Traverse the array. For each non-zero element, place it at the lastNonZeroFoundAt index and increment the pointer. After placing all non-zero elements, fill the remaining positions with 0s. This approach ensures relative order is preserved and the array is modified in-place. Time Complexity: O(n) – sin