Merged sorted arrays and Remove duplicates HW

MergeSortedArrays.java

@@ -0,0 +1,30 @@
+import java.util.Arrays;
+public class MergeSortedArrays {
+    public void merge(int[] nums1, int m, int[] nums2, int n){
+        int i = m - 1;
+        int j = n - 1;
+        int k = m + n - 1;
+        while(i >= 0 && j >= 0){
+            if(nums1[i] >= nums2[j]){
+                nums1[k] = nums1[i];
+                k--;
+                i--;
+            }else{
+                nums1[k] = nums2[j];
+                k--;
+                j--;
+            }
+        }
+    }
+    public static void main(String[] args){
+        MergeSortedArrays solution = new MergeSortedArrays();
+
+        int [] nums1 = {1,2,3,0,0,0}; int m = 3;
+        int [] nums2 = {2,5,6}; int n = 3;
+        solution.merge(nums1, m, nums2, n);
+        System.out.println(Arrays.toString(nums1));
+    }
+}
+
+//Time complexity : O(m+n)
+//Space complexity : O(1)

RemoveDuplicates.java

@@ -0,0 +1,19 @@
+public class RemoveDuplicates {
+    public static int removeDuplicates(int[] nums) {
+        int i = 0;
+        for(int n: nums){
+            if(i<2 || n!=nums[i-2]){
+                nums[i++]=n;
+            }
+        }
+        return i;
+    }
+    public static void main(String[] args){
+        int[] nums={1,1,1,2,2,3,3,4};
+        System.out.println(removeDuplicates(nums));
+    }
+}
+
+
+//Time complexity : O(n)
+//Space complexity : O(1)

SearchMatrix.java

@@ -0,0 +1,23 @@
+public class SearchMatrix {
+    public boolean searchMatrix(int[][] matrix, int target) {
+        int m = matrix.length;
+        int n = matrix[0].length;
+        int i = 0;
+        int j = n - 1;
+        while(i < m && j >= 0 ){
+            if(matrix[i][j] == target) return true;
+            else if(matrix[i][j] > target){
+                j--;
+            } else{
+                i++;
+            }
+        }
+        return false;
+    }
+}
+
+//TC :Time Complexity:
+//O(m log n)
+
+//Space Complexity:
+//O(1)

out/production/Two-Pointers-2/README.md

@@ -0,0 +1,10 @@
+# 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/)
+