Two pointers 2

Problem1.java

@@ -0,0 +1,26 @@
+class Problem1 {
+    public int removeDuplicates(int[] nums) {
+
+        int k = 2;
+        int slow = 0, fast = 0;
+
+        int count = 0;
+
+        while(fast < nums.length){
+            if(fast != 0 && nums[fast] == nums[fast - 1]){
+                count++;
+            }else{
+                count = 1;
+            }
+
+            if(count <= k){
+                nums[slow] = nums[fast];
+                slow++;
+            }
+
+            fast++;
+        }
+
+        return slow;
+    }
+}

Problem2.java

@@ -0,0 +1,23 @@
+class Problem2 {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int p1 = m-1, p2 = n-1;
+        int idx = m+n-1;
+
+        while(p1 >= 0 && p2 >=0){
+            if(nums2[p2] > nums1[p1]){
+                nums1[idx] = nums2[p2];
+                p2--;
+            }else{
+                nums1[idx] = nums1[p1];
+                p1--;
+            }
+            idx--;
+        }
+
+        while(p2 >= 0){
+            nums1[idx] = nums2[p2];
+            p2--;
+            idx--;
+        }
+    }
+}

Problem3.java

@@ -0,0 +1,16 @@
+class Problem3 {
+    public boolean searchMatrix(int[][] matrix, int target) {
+        int m = matrix.length;
+        int n = matrix[0].length;
+
+        int r = m - 1, c = 0;
+
+        while(r >= 0 && c < n){
+            if(matrix[r][c] == target) return true;
+            else if(matrix[r][c] > target) r--;
+            else c++;
+        }
+
+        return false;
+    }
+}