diff --git a/leetcode/88.py b/leetcode/88.py
new file mode 100644
index 0000000..4246a38
--- /dev/null
+++ b/leetcode/88.py
@@ -0,0 +1,37 @@
+# You are given two integer arrays nums1 and nums2,
+# sorted in non-decreasing order,
+# and two integers m and n,
+# representing the number of elements in nums1 and nums2 respectively.
+
+# Merge nums1 and nums2 into a single array sorted in non-decreasing order.
+
+
+# The final sorted array should not be returned by the function,
+# but instead be stored inside the array nums1.
+# To accommodate this, nums1 has a length of m + n,
+# where the first m elements denote the elements that should be merged,
+# and the last n elements are set to 0 and should be ignored. nums2 has a length of n.
+
+# Constraints:
+
+# nums1.length == m + n
+# nums2.length == n
+# 0 <= m, n <= 200
+# 1 <= m + n <= 200
+# -10^9 <= nums1[i], nums2[j] <= 10^9
+
+from typing import List
+
+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.
+        """
+        if n == 0:
+            pass
+        else:
+            for i in range(n):
+                nums1[m+i] = nums2[i]
+            nums1.sort()    
+            
+