From 405bf9403fc7bf0e5c41072d8d6f7993b073eae6 Mon Sep 17 00:00:00 2001
From: SUJAY GIJRE <sujaygijre@gmail.com>
Date: Wed, 7 Jan 2026 23:06:13 -0500
Subject: [PATCH 1/2] Create container-with-most-water

---
 container-with-most-water | 20 ++++++++++++++++++++
 1 file changed, 20 insertions(+)
 create mode 100644 container-with-most-water

diff --git a/container-with-most-water b/container-with-most-water
new file mode 100644
index 00000000..eaaadd42
--- /dev/null
+++ b/container-with-most-water
@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int maxArea(vector<int>& height) {
+        int left=0;
+        int right=height.size()-1;
+        int maxi = 0;
+        int currArea = 0;
+        while (left < right) {
+            currArea = min(height[left], height[right])*(right-left);
+            maxi = max(currArea, maxi);
+
+            if (height[left] < height[right]) {
+                left++;
+            } else {
+                right--;
+            }
+        }
+        return maxi;
+    }
+};

From 93f374c72f6b047854ddd9dbb4186dcae5fb9fa4 Mon Sep 17 00:00:00 2001
From: SUJAY GIJRE <sujaygijre@gmail.com>
Date: Wed, 7 Jan 2026 23:33:12 -0500
Subject: [PATCH 2/2] Create 3sum

---
 3sum | 35 +++++++++++++++++++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 3sum

diff --git a/3sum b/3sum
new file mode 100644
index 00000000..22f4567e
--- /dev/null
+++ b/3sum
@@ -0,0 +1,35 @@
+class Solution {
+public:
+    vector<vector<int>> threeSum(vector<int>& nums) {
+        vector<vector<int>> answer;
+
+        int left=0;
+        int right=nums.size()-1;
+        sort(nums.begin(), nums.end());
+
+        for (int i=0;i<nums.size()-2;i++) {
+            if (i>0 && nums[i] == nums[i-1])
+                continue;
+            left = i+1;
+            right = nums.size()-1;
+            while (left < right) {
+                int sum = nums[i]+nums[left]+nums[right];
+                if (sum == 0) {
+                    answer.push_back({nums[i], nums[left], nums[right]});
+                    left++;
+                    right--;
+                    while (left<right && nums[left] == nums[left-1])
+                        left++;
+                    while (left<right && nums[right] == nums[right+1])
+                        right--;
+                } else if (sum < 0) {
+                    left++;
+                } else {
+                    right--;
+                }
+            }
+        }
+
+        return answer;
+    }
+};