diff --git a/Submissions/ShagunRatan/238productOfArray/Screenshot (110).png b/Submissions/ShagunRatan/238productOfArray/Screenshot (110).png
new file mode 100644
index 0000000..938924c
Binary files /dev/null and b/Submissions/ShagunRatan/238productOfArray/Screenshot (110).png differ
diff --git a/Submissions/ShagunRatan/238productOfArray/solution.c b/Submissions/ShagunRatan/238productOfArray/solution.c
new file mode 100644
index 0000000..e92e633
--- /dev/null
+++ b/Submissions/ShagunRatan/238productOfArray/solution.c
@@ -0,0 +1,24 @@
+#include <stdlib.h>
+
+int* productExceptSelf(int* nums, int numsSize, int* returnSize) {
+    int* result = (int*)malloc(sizeof(int) * numsSize);
+    int* right = (int*)malloc(sizeof(int) * numsSize);
+
+    result[0] = 1;
+    for (int i = 1; i < numsSize; i++) {
+        result[i] = result[i - 1] * nums[i - 1];
+    }
+
+    right[numsSize - 1] = 1;
+    for (int i = numsSize - 2; i >= 0; i--) {
+        right[i] = right[i + 1] * nums[i + 1];
+    }
+
+    for (int i = 0; i < numsSize; i++) {
+        result[i] *= right[i];
+    }
+
+    *returnSize = numsSize;
+    free(right);
+    return result;
+}
diff --git a/Submissions/ShagunRatan/509Fibonacci/Screenshot (109).png b/Submissions/ShagunRatan/509Fibonacci/Screenshot (109).png
new file mode 100644
index 0000000..3a9fb66
Binary files /dev/null and b/Submissions/ShagunRatan/509Fibonacci/Screenshot (109).png differ
diff --git a/Submissions/ShagunRatan/509Fibonacci/solution.c b/Submissions/ShagunRatan/509Fibonacci/solution.c
new file mode 100644
index 0000000..91f9de2
--- /dev/null
+++ b/Submissions/ShagunRatan/509Fibonacci/solution.c
@@ -0,0 +1,12 @@
+int fib(int n) {
+    if (n == 0) return 0;
+    if (n == 1) return 1;
+
+    int a = 0, b = 1, c;
+    for (int i = 2; i <= n; i++) {
+        c = a + b;
+        a = b;
+        b = c;
+    }
+    return b;
+}