Array Zero Shifting Without Extra Space | Dataford Interview Questions

Shift all zeros in the array to right of the array without using another array in O(n) complexity.

Implement move_zeros(nums) for a list of integers. Modify the list in place, preserve the relative order of all nonzero values, and return the modified list. The solution must use O(n) time and O(1) extra space.

Constraints

0 <= len(nums) <= 10000
-10^9 <= nums[i] <= 10^9
The input list must be modified in place
The relative order of nonzero values must remain unchanged

Function Signature

def move_zeros(nums):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

Problem

Shift all zeros in the array to right of the array without using another array in O(n) complexity.

Constraints

0 <= len(nums) <= 10000
-10^9 <= nums[i] <= 10^9
The input list must be modified in place
The relative order of nonzero values must remain unchanged

Function Signature

def move_zeros(nums):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.