diff --git a/MergeSorted.java b/MergeSorted.java
new file mode 100644
index 00000000..5c42c085
--- /dev/null
+++ b/MergeSorted.java
@@ -0,0 +1,20 @@
+public class MergeSorted {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int left = m-1;
+        int right = m+n-1;
+        int i = n-1;
+        while (i>=0 && left>=0) {
+            if (nums1[left] < nums2[i]) {
+                nums1[right] = nums2[i];
+                right--; i--;
+            } else {
+                nums1[right] = nums1[left];
+                right--; left--;
+            } 
+        }
+        while (i>=0) {
+            nums1[right] = nums2[i];
+            right--; i--;
+        }
+    }
+}
diff --git a/README.md b/README.md
deleted file mode 100644
index e1a6f9d6..00000000
--- a/README.md
+++ /dev/null
@@ -1,10 +0,0 @@
-# Two-Pointers-2
-
-## Problem1 (https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)
-
-
-## Problem2 (https://leetcode.com/problems/merge-sorted-array/)
-
-
-## Problem3 (https://leetcode.com/problems/search-a-2d-matrix-ii/)
-
diff --git a/RemoveDup.java b/RemoveDup.java
new file mode 100644
index 00000000..e8c08f00
--- /dev/null
+++ b/RemoveDup.java
@@ -0,0 +1,17 @@
+
+public class RemoveDup {
+    public int removeDup(int[] nums) {
+        int slow =1;
+        int count =1;
+        for (int fast=1; fast<nums.length; fast++){
+            if (nums[fast] == nums[fast-1]){
+                count++;
+            }else{ count=1;}
+            if (count <=2){
+                nums[slow] = nums[fast];
+                slow++;
+            }
+        }
+        return slow;
+    }
+}
\ No newline at end of file
diff --git a/Sample.java b/Sample.java
deleted file mode 100644
index 960e272d..00000000
--- a/Sample.java
+++ /dev/null
@@ -1,7 +0,0 @@
-
-// Time Complexity :
-// Space Complexity :
-// Did this code successfully run on Leetcode :
-// Three line explanation of solution in plain english
-
-// Your code here along with comments explaining your approach
diff --git a/Search2D.java b/Search2D.java
new file mode 100644
index 00000000..65802b78
--- /dev/null
+++ b/Search2D.java
@@ -0,0 +1,19 @@
+public class Search2D {
+    public boolean searchMatrix(int[][] m, int target) {
+        int rows = matrix.length;
+        int cols = matrix[0].length;
+        int row = 0;
+        int col = cols-1;
+        while ((row>=0 && row<rows) && (col>=0 && col<cols)) {
+            if (target == matrix[row][col]) {
+                return true;
+            } else if (matrix[row][col] < target) {
+                row++;
+            } else {
+                col--;
+            }
+        }
+        return false;
+    }
+}
+