Move Zeroes — Go Coding Problem
Difficulty: easy | Category: two-pointers
Problem Description
Given an integer array `nums`, move all `0`s 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. After moving, print the modified array. Hint: Use two pointers — one for the write position (for non-zeros) and one to scan.
Examples
Example 1
Input: nums = [0, 1, 0, 3, 12]
Output: [1, 3, 12, 0, 0]
Example 2
Input: nums = [0]
Output: [0]
Example 3
Input: nums = [1]
Output: [1]