diff --git a/Problem_1.py b/Problem_1.py
new file mode 100644
index 00000000..3c5e167f
--- /dev/null
+++ b/Problem_1.py
@@ -0,0 +1,22 @@
+# https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/submissions/
+
+class Solution:
+    def findDisappearedNumbers(self, nums):
+        result = []
+        n = len(nums)
+        for i in range(n):
+            curr = abs(nums[i])
+            if nums[curr - 1] > 0:
+                nums[curr - 1] *= -1
+        for i in range(n):
+            curr = nums[i]
+            if curr > 0:
+                result.append(i + 1)
+            else:
+                nums[i] *= -1
+        return result
+
+
+nums = [4,3,2,7,8,2,3,1]
+sl = Solution()
+print(sl.findDisappearedNumbers(nums))
\ No newline at end of file
diff --git a/Problem_2.py b/Problem_2.py
new file mode 100644
index 00000000..4bfb36f1
--- /dev/null
+++ b/Problem_2.py
@@ -0,0 +1,25 @@
+def find_min_max(arr):
+    n = len(arr)
+    mini,maxi = 0,0
+    i = 0
+    if n % 2 == 0:
+        mini,maxi = arr[0],arr[0]
+    else:
+        if arr[i+1] > arr[i]:
+            maxi = arr[i+1]
+            mini = arr[i]
+    i = 2
+    
+    while i < n-1:
+
+        if arr[i+1] > arr[i]:
+            maxi = max(maxi,arr[i+1])
+            mini = min(mini,arr[i])
+        else:
+            maxi = max(maxi,arr[i])
+            mini = min(mini,arr[i+1])
+        i += 2
+    return (mini,maxi)
+
+nums = [3, 5, 4, 1, 9,-2]
+print(find_min_max(nums))
\ No newline at end of file
diff --git a/Problem_3.py b/Problem_3.py
new file mode 100644
index 00000000..e69de29b