<pre class="shiki github-dark shaku"><code>function moveZeros(list: Array&lt;any&gt;): void { if (list.length === 0) { // no-op } else { const len = list.length; for (let i=0; i &lt; len; i++) { if (list[i] !== 0) { // no-op } else { let j = i+1; while (list[j] == 0 &amp;&amp; j &lt; len-1) { j += 1; } if (j &lt; len) { const tmp = list[j]; list[j] = list[i]; list[i] = tmp; } } } }}const list = [1,0,0,2,3]moveZeros(list);console.log(list) // [1,2,3,0,0]</code></pre>

Worst Case O(n²) | Best Case O(n)

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…