diff --git a/Merge Sorted Array.py b/Merge Sorted Array.py
new file mode 100644
index 00000000..24027577
--- /dev/null
+++ b/Merge Sorted Array.py	
@@ -0,0 +1,24 @@
+class Solution:
+    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
+        """
+        Do not return anything, modify nums1 in-place instead.
+        """
+        p1=m-1
+        p2=n-1
+        c=m+n-1
+
+        while p1>=0 and p2>=0:
+            if nums2[p2]>nums1[p1]:
+                nums1[c]=nums2[p2]
+                c=c-1
+                p2=p2-1
+            else:
+                nums1[c]=nums1[p1]
+                c=c-1
+                p1=p1-1
+        while p2>=0:
+            nums1[c]=nums2[p2]
+            c=c-1
+            p2=p2-1
+            
+        
\ No newline at end of file
diff --git a/RemoveDuplicates from sorted array II.py b/RemoveDuplicates from sorted array II.py
new file mode 100644
index 00000000..d4ea32e2
--- /dev/null
+++ b/RemoveDuplicates from sorted array II.py	
@@ -0,0 +1,16 @@
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> int:
+
+        slow=1
+        count=1
+        n=len(nums)
+
+        for i in range(1,n):
+            if nums[i]==nums[i-1]:
+                count=count+1
+            else:
+                count=1
+            if count<=2:
+                nums[slow]=nums[i]
+                slow=slow+1
+        return slow        
\ No newline at end of file
diff --git a/search2d matrix II.py b/search2d matrix II.py
new file mode 100644
index 00000000..d057189b
--- /dev/null
+++ b/search2d matrix II.py	
@@ -0,0 +1,14 @@
+class Solution:
+    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
+
+        m=0
+        n=len(matrix[0])-1
+
+        while m<len(matrix) and n>=0:
+            if matrix[m][n]==target:
+                return True
+            elif target<matrix[m][n]:
+                n=n-1
+            else:
+                m=m+1
+        return False
\ No newline at end of file