From 3cf20d2e9ea031984ffa41cc574db29d20dc87fd Mon Sep 17 00:00:00 2001
From: Nitin Sahu <nitinsaahu00000@gmail.com>
Date: Tue, 6 Aug 2024 17:14:15 +0530
Subject: [PATCH] 3 sum

Optimal solution in java
---
 3Sum - Leetcode 15/3 sum leet code java | 37 +++++++++++++++++++++++++
 1 file changed, 37 insertions(+)
 create mode 100644 3Sum - Leetcode 15/3 sum leet code java

diff --git a/3Sum - Leetcode 15/3 sum leet code java b/3Sum - Leetcode 15/3 sum leet code java
new file mode 100644
index 0000000..2ad6e9d
--- /dev/null
+++ b/3Sum - Leetcode 15/3 sum leet code java	
@@ -0,0 +1,37 @@
+class Solution {
+    public List<List<Integer>> threeSum(int[] nums) {
+        List<List<Integer>> result=new ArrayList<>();
+        Arrays.sort(nums);
+
+        for(int i=0;i<nums.length-2;i++){
+            if(i>0 && nums[i]==nums[i-1]){
+                continue;
+            }
+
+            int left=i+1;
+            int right=nums.length-1;
+
+            while(left<right){
+                int sum = nums[i]+nums[left]+nums[right];
+                if(sum==0){
+                    result.add(Arrays.asList(nums[i],nums[left],nums[right]));
+
+                    while(left<right && nums[left]==nums[left+1]){
+                        left++;
+                    }
+                    while(left<right && nums[right]==nums[right-1]){
+                        right--;
+                    }
+                    left++;
+                    right--;
+
+                }else if(sum<0){
+                    left++;
+                }else{
+                    right--;
+                }
+            }
+        }
+        return result;
+    }
+}