From 9c4969c91dc210a15e13454ba3740130ac01eb05 Mon Sep 17 00:00:00 2001
From: kartiktom <57401662+kartiktom@users.noreply.github.com>
Date: Tue, 27 Oct 2020 15:54:10 +0530
Subject: [PATCH] Create leetcode 3sum.cpp

---
 Array/leetcode 3sum/leetcode 3sum.cpp | 32 +++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 Array/leetcode 3sum/leetcode 3sum.cpp

diff --git a/Array/leetcode 3sum/leetcode 3sum.cpp b/Array/leetcode 3sum/leetcode 3sum.cpp
new file mode 100644
index 0000000..35a3720
--- /dev/null
+++ b/Array/leetcode 3sum/leetcode 3sum.cpp	
@@ -0,0 +1,32 @@
+ vector<vector<int>> threeSum(vector<int>& nums) 
+    {
+        vector<vector<int>> res;
+      int n=nums.size();
+        sort(nums.begin(),nums.end());
+        for(int i=0;i<n;i++)
+        {
+            int target=-nums[i];
+            int f=i+1,b=n-1;
+            while(f<b)
+            {
+               int sum=nums[f]+nums[b];
+                if(target<sum)
+                    b--;
+                else if(target>sum)
+                    f++;
+                else
+                {
+                    vector<int> arr(3,0);
+                 arr[0]=nums[f],arr[1]=nums[b],arr[2]=nums[i];
+                    res.push_back({nums[f],nums[i],nums[b]});
+                 while(f<b&&nums[f]==arr[0])
+                     f++;
+                 while(f<b&&nums[b]==arr[1])
+                     b--;
+                }
+            }
+            while(i+1<n&&nums[i+1]==nums[i])
+                i++;
+        }
+        return res;
+    }