diff --git a/Submission/Shivam Tripathi/missing number/Missing Number.png b/Submission/Shivam Tripathi/missing number/Missing Number.png
new file mode 100644
index 0000000..f0422c2
Binary files /dev/null and b/Submission/Shivam Tripathi/missing number/Missing Number.png differ
diff --git a/Submission/Shivam Tripathi/missing number/solution.c b/Submission/Shivam Tripathi/missing number/solution.c
new file mode 100644
index 0000000..2933b81
--- /dev/null
+++ b/Submission/Shivam Tripathi/missing number/solution.c	
@@ -0,0 +1,11 @@
+int missingNumber(int* nums, int numsSize){
+    int expectedSum = numsSize * (numsSize + 1) / 2;
+    int actualSum = 0;
+
+    for (int i = 0; i < numsSize; i++) {
+        actualSum += nums[i];
+    }
+
+    return expectedSum - actualSum;
+    
+}
\ No newline at end of file
diff --git a/Submission/Shivam Tripathi/reverse-integer/Reverse Integer .png b/Submission/Shivam Tripathi/reverse-integer/Reverse Integer .png
new file mode 100644
index 0000000..126b4cc
Binary files /dev/null and b/Submission/Shivam Tripathi/reverse-integer/Reverse Integer .png differ
diff --git a/Submission/Shivam Tripathi/reverse-integer/solution.c b/Submission/Shivam Tripathi/reverse-integer/solution.c
new file mode 100644
index 0000000..d254deb
--- /dev/null
+++ b/Submission/Shivam Tripathi/reverse-integer/solution.c	
@@ -0,0 +1,17 @@
+int reverse(int x) {
+    int reversed = 0;
+    
+    while (x != 0) {
+        int pop = x % 10;
+        x /= 10;
+
+        // Overflow check
+        if (reversed > INT_MAX / 10 || (reversed == INT_MAX / 10 && pop > 7))
+            return 0;
+        if (reversed < INT_MIN / 10 || (reversed == INT_MIN / 10 && pop < -8))
+            return 0;
+        
+        reversed = reversed * 10 + pop;
+    }
+    return reversed;
+}