Arrays · Coding problem
Move Zeroes
A free coding problem from the In-Place Manipulation skill. Read it here, then solve it in the app in Java or Python.
- Easy
- Coding problem
- Free
- Java and Python
The problem
Shift every 0 in nums to the back of the array, keeping the other numbers in the order they started in. Return the rearranged array.
Example
Input: nums = [4, 0, 0, -2, 7, 0, 1]
Output: [4, -2, 7, 1, 0, 0, 0]
Use one pass and O(1) extra space, so no second array.
Constraints
1 <= nums.length <= 2 * 10^5-10^9 <= nums[i] <= 10^9
How it's graded
- Run checks your code against the examples. Submit also runs a hidden suite in four groups - basic cases, edge cases, random inputs and performance tests at the size limit - and shows which groups pass, never the hidden inputs.
- Stuck? Hints come in four steps, from a nudge to a code skeleton, each costing part of the points.
- Once you pass, you see the approaches from brute force to optimal, and where your solution lands among them.
More problems in In-Place Manipulation
Solve it Move Zeroes free
No card needed. Lessons, practice questions and easy problems are free forever.
Free plan, no card · 7-day Pro trial · Cancel anytime