From 8a0e89b778ad25182ef242389524d39930749144 Mon Sep 17 00:00:00 2001
From: YogeshPardeshi <31638743+YogeshPardeshi@users.noreply.github.com>
Date: Sat, 23 May 2026 11:38:04 -0400
Subject: [PATCH 1/3] Create Problem1.java

Problem1
---
 Problem1.java | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 Problem1.java

diff --git a/Problem1.java b/Problem1.java
new file mode 100644
index 00000000..dd765165
--- /dev/null
+++ b/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;
+    }
+}

From 3e0013ea250c7cc26f9a2d221526805c92234d5a Mon Sep 17 00:00:00 2001
From: YogeshPardeshi <31638743+YogeshPardeshi@users.noreply.github.com>
Date: Sat, 23 May 2026 11:39:25 -0400
Subject: [PATCH 2/3] Create Problem2.java

Problem2
---
 Problem2.java | 23 +++++++++++++++++++++++
 1 file changed, 23 insertions(+)
 create mode 100644 Problem2.java

diff --git a/Problem2.java b/Problem2.java
new file mode 100644
index 00000000..524ca5ce
--- /dev/null
+++ b/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--;
+        }
+    }
+}

From ce633094323f9f4a95e59f8441446f174b9d0eb0 Mon Sep 17 00:00:00 2001
From: YogeshPardeshi <31638743+YogeshPardeshi@users.noreply.github.com>
Date: Sat, 23 May 2026 11:40:12 -0400
Subject: [PATCH 3/3] Create Problem3.java

Problem3
---
 Problem3.java | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 Problem3.java

diff --git a/Problem3.java b/Problem3.java
new file mode 100644
index 00000000..d44e8d42
--- /dev/null
+++ b/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;
+    }
+}