Given an integer array, nums, rearrange the elements such that all $0's$ are moved to the end of the array, while the relative order of all non-zero elements is preserved.

Note: The operation must be performed in-place, without creating a copy of the array.

Constraints:

• $1 \leq$ nums.length $\leq 10^4$

• $-2^{31} \leq$ nums[i] $\leq 2^{31} - 1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.