Practice Move Zeroes
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Move Zeroes on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [0,1,0,3,12]
Output
[1,3,12,0,0]
# Example 2
Input
nums = [0]
Output
[0]
Constraints
1 <= nums.length <= 10^4
-2^31 <= nums[i] <= 2^31 - 1
Related LeetCode Problems
Practice more problems similar to Move Zeroes.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.