<pre class="shiki github-dark shaku"><code>// This is a JavaScript coding problem from BFE.dev /** * @param {Array&lt;any&gt;} list * @returns {void} */function moveZeros(list) { const listWithoutZeros= list.filter(v=&gt;v!==0) const noOfZeros=list.length - listWithoutZeros.length; list.length=0; list.push(...listWithoutZeros,...Array(noOfZeros).fill(0))}</code></pre>

Time Complexity: O(N) & Space Complexity: O(1)

Given an array of integers, move zeros to the end while keeping the order of the rest. You should make the in-place change. const list = [1,0,0,2,3]mo…