Problem

In a Meta mobile client, you may need to compact an integer buffer before rendering a Facebook feed module. Given an integer array nums, move all 0 values to the end of the array in place while keeping the relative order of all non-zero values unchanged.

Return the modified array.

Formal Specification

• Input: nums, a list of integers
• Output: The same list after all zeroes have been moved to the end
• Requirement: Do not create another array for the final result; modify the input array in place

Examples

Example 1

• Input: nums = [0, 1, 0, 3, 12]
• Output: [1, 3, 12, 0, 0]
• Explanation: The non-zero values 1, 3, 12 stay in the same order, and both zeroes are shifted to the end.

Example 2

• Input: nums = [0, 0, 1]
• Output: [1, 0, 0]
• Explanation: Only one non-zero element exists, so it moves to the front and the remaining positions become zero.

Constraints

• 1 <= len(nums) <= 10^5
• -2^31 <= nums[i] <= 2^31 - 1
• The solution should run in linear time
• Extra space should be constant, excluding the input array