Move Zeroes

Author: NEHA-AMIN

Arrays & Strings/Move Zeroes/Explanation.md

@@ -0,0 +1,64 @@
+# 👉 Brute Force Approach (Using extra space)
+def moveZerosBruteForce(n: int, a: [int]) -> [int]:
+    temp = []
+    for i in range(n):
+        if a[i] != 0:
+            temp.append(a[i])
+    nz = len(temp)
+    for i in range(nz):
+        a[i] = temp[i]
+    for i in range(nz, n):
+        a[i] = 0
+    return a
+
+
+# 👉 Optimal Approach (In-place, using two pointers)
+def moveZerosOptimal(n: int, a: [int]) -> [int]:
+    j = -1
+    for i in range(n):
+        if a[i] == 0:
+            j = i
+            break
+    if j == -1:
+        return a
+    for i in range(j + 1, n):
+        if a[i] != 0:
+            a[i], a[j] = a[j], a[i]
+            j += 1
+    return a
+
+
+# ✅ Test Cases
+if __name__ == "__main__":
+    print("Test Case 1:")
+    arr1 = [1, 0, 2, 3, 2, 0, 0, 4, 5, 1]
+    n1 = len(arr1)
+    print("Original Array:", arr1)
+
+    result_brute = moveZerosBruteForce(n1, arr1.copy())
+    print("Brute Force Result:", result_brute)
+
+    result_optimal = moveZerosOptimal(n1, arr1.copy())
+    print("Optimal Result    :", result_optimal)
+
+    print("\nTest Case 2:")
+    arr2 = [0, 0, 0, 0, 1]
+    n2 = len(arr2)
+    print("Original Array:", arr2)
+
+    result_brute = moveZerosBruteForce(n2, arr2.copy())
+    print("Brute Force Result:", result_brute)
+
+    result_optimal = moveZerosOptimal(n2, arr2.copy())
+    print("Optimal Result    :", result_optimal)
+
+    print("\nTest Case 3:")
+    arr3 = [1, 2, 3, 4, 5]
+    n3 = len(arr3)
+    print("Original Array:", arr3)
+
+    result_brute = moveZerosBruteForce(n3, arr3.copy())
+    print("Brute Force Result:", result_brute)
+
+    result_optimal = moveZerosOptimal(n3, arr3.copy())
+    print("Optimal Result    :", result_optimal)