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.
Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]
Input: nums = [0]
Output: [0]
Runner expects a single line stdin with a JSON array
(e.g. [0,1,0,3,12]) and prints the final array.
No submissions yet.
Discuss two-pointer vs brute-force approaches and why stability matters.
