Add a new question

rradfar · rradfar · commit 9e3d8832827e · 2022-10-06T13:03:09.000-07:00
diff --git a/README.md b/README.md
@@ -2181,3 +2181,44 @@ const isPalindrome = s => {
 ---
 
 **[⬆ Back to Top](#javascript-coding-challenges-for-beginners)**
+
+## 60. Move Zeroes
+
+Given an integer array `nums`, move all `0`'s in the array to the end of it while maintaining the relative order of the non-zero elements. Achieve this without copying the array or creating a new array.
+
+```js
+const moveZeroes = nums => {
+  // Your solution
+};
+
+console.log(moveZeroes([0, 1, 0, 3, 12])); // [1, 3, 12, 0, 0]
+console.log(moveZeroes([0, 0, 1])); // [1, 0, 0]
+console.log(moveZeroes([0])); // [0]
+```
+
+<details><summary>Solution</summary>
+
+```js
+const moveZeroes = nums => {
+  const length = nums.length;
+  let index = 0;
+
+  for (let i = 0; i < length; i++) {
+    if (nums[i] !== 0) {
+      nums[index] = nums[i];
+      if (index !== i) {
+        nums[i] = 0;
+      }
+      index++;
+    }
+  }
+
+  return nums;
+};
+```
+
+</details>
+
+---
+
+**[⬆ Back to Top](#javascript-coding-challenges-for-beginners)**
