Done with two-pointers-2

Problem1.java

@@ -0,0 +1,24 @@
+class Solution {
+    public int removeDuplicates(int[] nums) {
+        int slow=0;
+        int fast=0;
+        int count=0;
+
+        while(fast<nums.length){
+            int curr=nums[fast];
+            while(fast<nums.length && nums[fast]==curr){
+                fast++;
+                count++;
+            }
+            int jumps=Math.min(count,2);
+
+            while(jumps!=0){
+                nums[slow]=curr;
+                slow++;
+                jumps--;
+            }
+            count=0;
+        }
+        return slow;
+    }
+}

Problem2.java

@@ -0,0 +1,30 @@
+class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+
+        int p1=m-1;
+        int p2=n-1;
+        int idx=m+n-1;
+        while(p1>=0 && p2>=0){
+            //if value at pointer1 is greater than value in 2nd array of pointer 2
+            //then we put that value at 1st array at last idx
+            if(nums1[p1]>=nums2[p2]){
+                nums1[idx]=nums1[p1];
+                p1--;
+            }
+            else{
+            //if value at pointer2 is greater than value in 1st array of pointer 1
+            //then we put that value at 1st array at last idx
+                nums1[idx]=nums2[p2];
+                p2--;
+            }
+            //move the idx pointer inwards
+            idx--;
+        }
+        //if p2 is not out of bonds, just copy the elements from p2 to idx pointer
+        while(p2>=0){
+            nums1[idx]=nums2[p2];
+            p2--;
+            idx--;
+        }
+    }
+}

Problem3.java

@@ -0,0 +1,21 @@
+class Solution {
+    public boolean searchMatrix(int[][] matrix, int target) {
+        int m=matrix.length;
+        int n= matrix[0].length;
+        //traversing through top-right corner
+        int i=0; int j=n-1;
+        while(i<m && j>=0){
+
+            if(matrix[i][j]==target) return true;
+            //traverse to left columns
+            else if(matrix[i][j]>target){
+                j--;
+            }
+            else{
+            //traverse down rows
+                i++;
+            }
+        }
+        return false;
+    }
+}