<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) { let nonZeroIndex = 0; for (let i = 0; i &lt; list.length; i++) { if (list[i] !== 0) { list[nonZeroIndex++] = list[i] } } for ( ;nonZeroIndex &lt; list.length; ) { list[nonZeroIndex++] = 0; }}</code></pre>

O(n), 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…