<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) { // your code here for(let index = 0 ; index &lt; list.length; index++){ for(let subindex = list.length-1 ; subindex &gt;= index; subindex--){ if(list[subindex-1] == 0 &amp;&amp; list[subindex] !== 0){ let temp = list[subindex-1] list[subindex-1] = list[subindex] list[subindex] = temp } } } return list}</code></pre>

time complexity = O(n2) 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…