From eb52223e9cb5db23706ed11028c51d3520b3696e Mon Sep 17 00:00:00 2001
From: Nivedita kumari <44724151+niveditaprity@users.noreply.github.com>
Date: Sun, 30 Jul 2023 19:28:55 +0530
Subject: [PATCH] Create 3sumTwoPointer.cpp

---
 Top_Interview_150/3sumTwoPointer.cpp | 34 ++++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 Top_Interview_150/3sumTwoPointer.cpp

diff --git a/Top_Interview_150/3sumTwoPointer.cpp b/Top_Interview_150/3sumTwoPointer.cpp
new file mode 100644
index 0000000..d9808a8
--- /dev/null
+++ b/Top_Interview_150/3sumTwoPointer.cpp
@@ -0,0 +1,34 @@
+class Solution {
+public:
+    vector<vector<int>> threeSum(vector<int>& nums) {
+    vector<vector<int>>res;
+        sort(nums.begin(),nums.end());
+        
+        for(int i=0; i<nums.size(); ++i){
+            int tar = -nums[i];
+            int start = i+1;
+            int end = nums.size()-1;
+            while(start<end){
+                int sum = nums[start]+nums[end];
+                
+                if(sum>tar) end--;
+                else if(sum<tar) start++;
+                else {
+                    vector<int>temp;
+                    temp.push_back(nums[i]);
+                    temp.push_back(nums[start]);
+                    temp.push_back(nums[end]);
+                    res.push_back(temp);
+                    start++;
+                    end--;
+                    
+                    while(start<end && nums[start]==nums[start-1]) start++;
+                    while(start<end && nums[end]==nums[end+1]) end--;
+                }
+            }
+            while(i+1<nums.size() && nums[i]==nums[i+1]) i++;
+        }
+        return res;
+        
+    }
+};