April Day 4 done

283/main.c

+#include <stdio.h>
+
+void moveZeroes(int*, int);
+void moveZeroes(int* nums, int numsSize){
+    int numZeroes = 0;
+    for (int i = 0; i < numsSize; i++) {
+        if (nums[i] == 0) {
+            numZeroes++;
+        } else {
+            nums[i - numZeroes] = nums[i];
+        }
+    }
+
+    for (int i = 0; i < numZeroes; i++) {
+	    nums[numsSize - 1 - i] = 0;
+    }
+}
+
+int main() {
+    int nums[5] = {0, 1, 0, 3, 12};
+    int expectedResult[5] = {1, 3, 12, 0, 0};
+    printf("Expected: ");
+    for (int i = 0; i < 5; i++) {
+        printf("%d ", expectedResult[i]);
+    }
+    printf("\n");
+
+    moveZeroes(nums, 5);
+
+    printf("Got: ");
+    for (int i = 0; i < 5; i++) {
+        printf("%d ", nums[i]);
+    }
+    printf("\n");
+}

283/problem.txt

+Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.
+
+Example:
+
+Input: [0,1,0,3,12]
+Output: [1,3,12,0,0]
+
+Note:
+
+    You must do this in-place without making a copy of the array.
+    Minimize the total number of operations.
+

283/run.sh

+#!/bin/bash
+
+gcc -o main main.c
+./main
+rm main

README.md

  - python3 (preferably >3.8)
  - rustc
  - gcc
- - SQlite
 
 Then you can see all the problems go through an example case with: