diff --git a/Top Interview 150-leetcode/easy/88. Merge Sorted Array/27. Remove Element/src/Solution.java b/Top Interview 150-leetcode/easy/88. Merge Sorted Array/27. Remove Element/src/Solution.java
new file mode 100644
index 0000000..0c3d648
--- /dev/null
+++ b/Top Interview 150-leetcode/easy/88. Merge Sorted Array/27. Remove Element/src/Solution.java	
@@ -0,0 +1,2 @@
+package PACKAGE_NAME;public class Solution {
+}
diff --git a/Top Interview 150-leetcode/easy/88. Merge Sorted Array/88. Merge Sorted Array.java b/Top Interview 150-leetcode/easy/88. Merge Sorted Array/88. Merge Sorted Array.java
new file mode 100644
index 0000000..2a22869
--- /dev/null
+++ b/Top Interview 150-leetcode/easy/88. Merge Sorted Array/88. Merge Sorted Array.java	
@@ -0,0 +1,23 @@
+import java.util.Arrays;
+
+class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int counter=0;
+        while (counter<n){
+            nums1[m]=nums2[counter];
+            m++;
+            counter++;
+        }
+        for (int i = 0; i <nums1.length ; i++) {
+            for (int j = i+1; j <nums1.length ; j++) {
+                int tempValue=0;
+                if (nums1[i]>nums1[j]){
+                    tempValue=nums1[i];
+                    nums1[i]=nums1[j];
+                    nums1[j]=tempValue;
+                }
+
+            }
+        }
+    }
+}
\ No newline at end of file