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

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

diff --git a/Problem1.java b/Problem1.java
new file mode 100644
index 00000000..d1da3d3f
--- /dev/null
+++ b/Problem1.java
@@ -0,0 +1,24 @@
+class Problem1 {
+    public void sortColors(int[] nums) {
+        int low = 0, high = nums.length-1, mid = 0;
+
+        while(mid <= high){
+            if(nums[mid] == 2){
+                swap(nums, mid, high);
+                high--;
+            }else if(nums[mid] == 0){
+                swap(nums, mid, low);
+                low++;
+                mid++;
+            }else{
+                mid++;
+            }
+        }
+    }
+
+    private void swap(int[] nums, int x, int y){
+        int temp = nums[x];
+        nums[x] = nums[y];
+        nums[y] = temp;
+    }
+}

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

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

diff --git a/Problem2.java b/Problem2.java
new file mode 100644
index 00000000..f8a1236e
--- /dev/null
+++ b/Problem2.java
@@ -0,0 +1,40 @@
+class Problem2 {
+    public List<List<Integer>> threeSum(int[] nums) {
+        Arrays.sort(nums);
+        int n = nums.length;
+        int target = 0;
+        List<List<Integer>> result = new ArrayList<>();
+        for(int i=0; i<n; i++){
+
+            if(i != 0 && nums[i] == nums[i-1]) continue;
+
+            int innerTarget = target - nums[i];
+
+            for(int j=i+1; j<n; j++){
+
+                if(j != i+1 && nums[j] == nums[j-1]) continue;
+
+                int t = innerTarget - nums[j];
+                int idx = binarySearch(nums, j+1, nums.length-1, t);
+                if(idx != -1){
+                    List<Integer> triplet = Arrays.asList(nums[i], nums[j], nums[idx]);
+                    result.add(triplet);
+                }
+            }
+        }
+
+        return result;
+    }
+
+    private int binarySearch(int[] nums, int low, int high, int target){
+
+        while(low <= high){
+            int mid = low + (high - low)/2;
+            if(nums[mid] == target) return mid;
+            else if(nums[mid] > target) high = mid - 1;
+            else low = mid + 1;
+        }
+
+        return -1;
+    }
+}

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

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

diff --git a/Problem3.java b/Problem3.java
new file mode 100644
index 00000000..ad14b8e4
--- /dev/null
+++ b/Problem3.java
@@ -0,0 +1,25 @@
+class Problem3 {
+    public int maxArea(int[] height) {
+        int n = height.length;
+
+        int low = 0, high = n-1;
+        int area = 0;
+
+        while(low < high){
+            int h = 0;
+            int w = high - low;
+
+            if(height[low] < height[high]){
+                h = height[low];
+                low++;
+            }else{
+                h = height[high];
+                high--;
+            }   
+
+            area = Math.max(area, h*w);
+        }
+
+        return area;
+    }
+}