Here is the interview question prompt, presented for reference.

Write a method that moves all zeros in an array to its end. You should maintain the order of all other elements. Here's an example:

zerosToEnd([1, 0, 2, 0, 4, 0])
// [1, 2, 4, 0, 0, 0]

Here's another one:

zerosToEnd([1, 0, 2, 0, 4, 0])
// [1, 2, 4, 0, 0, 0]

Fill in the following function signature:

function zerosToEnd(nums) {
  return;
};

Can you do this without instantiating a new array?

Constraints

• Length of the array <= 100000
• The array will always contain integer values between -1000000000 and 1000000000
• Expected time complexity : O(n)
• Expected space complexity : O(1)

You can see the full challenge with visuals at this link.