From 757248c9e4773304be21654eac0311c36cff9602 Mon Sep 17 00:00:00 2001
From: Priya Kumari <77202746+priyakumari02@users.noreply.github.com>
Date: Tue, 19 Oct 2021 16:44:30 +0530
Subject: [PATCH 1/5] Added twoSum cpp solution

---
 twoSum cpp soln/twoSum.cpp | 44 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 twoSum cpp soln/twoSum.cpp

diff --git a/twoSum cpp soln/twoSum.cpp b/twoSum cpp soln/twoSum.cpp
new file mode 100644
index 0000000..c691d71
--- /dev/null
+++ b/twoSum cpp soln/twoSum.cpp	
@@ -0,0 +1,44 @@
+// Question Link :- https://leetcode.com/problems/two-sum/
+
+// Below is Solution
+
+//1st Approach
+// Time Complexity :- O(n^2)
+
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+       vector<int> v;
+        for(int i=0;i<nums.size()-1;i++){
+            for(int j=i+1;j<nums.size();j++){
+                if(nums[i]+nums[j]==target){
+                    v.push_back(i);
+                    v.push_back(j);
+                }
+            }
+        }
+        return v;
+    }
+};
+
+//OR
+
+//2nd Approach
+//HashMaps
+//Time Complexity-O(n) 
+
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+     unordered_map<int,int> m;
+        for(int i=0;i<nums.size();i++){
+            int x=nums[i];
+            int y=target-x;
+            if(m.find(y)!=m.end()){
+                return {i,m[y]};
+            }
+            m[nums[i]]=i;
+        }
+       return {-1,-1}; 
+    }
+};

From aee3717f48926d0e2c80e1b4222a0f85b4356487 Mon Sep 17 00:00:00 2001
From: Priya Kumari <77202746+priyakumari02@users.noreply.github.com>
Date: Sun, 24 Oct 2021 20:29:41 +0530
Subject: [PATCH 2/5] two Sum cpp solution

---
 Two Sum/twoSum.cpp | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 Two Sum/twoSum.cpp

diff --git a/Two Sum/twoSum.cpp b/Two Sum/twoSum.cpp
new file mode 100644
index 0000000..4601d53
--- /dev/null
+++ b/Two Sum/twoSum.cpp	
@@ -0,0 +1,19 @@
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+       vector<int> v;
+        for(int i=0;i<nums.size()-1;i++){
+            for(int j=i+1;j<nums.size();j++){
+                if(nums[i]+nums[j]==target){
+                    v.push_back(i);
+                    v.push_back(j);
+                }
+            }
+        }
+        return v;
+    }
+};
+
+//OR
+
+//HashMaps
\ No newline at end of file

From e19d3829d24fbf38fed0044f64e1cdb15ff952cd Mon Sep 17 00:00:00 2001
From: Priya Kumari <77202746+priyakumari02@users.noreply.github.com>
Date: Sun, 24 Oct 2021 20:30:31 +0530
Subject: [PATCH 3/5] Delete twoSum cpp soln directory

---
 twoSum cpp soln/twoSum.cpp | 44 --------------------------------------
 1 file changed, 44 deletions(-)
 delete mode 100644 twoSum cpp soln/twoSum.cpp

diff --git a/twoSum cpp soln/twoSum.cpp b/twoSum cpp soln/twoSum.cpp
deleted file mode 100644
index c691d71..0000000
--- a/twoSum cpp soln/twoSum.cpp	
+++ /dev/null
@@ -1,44 +0,0 @@
-// Question Link :- https://leetcode.com/problems/two-sum/
-
-// Below is Solution
-
-//1st Approach
-// Time Complexity :- O(n^2)
-
-class Solution {
-public:
-    vector<int> twoSum(vector<int>& nums, int target) {
-       vector<int> v;
-        for(int i=0;i<nums.size()-1;i++){
-            for(int j=i+1;j<nums.size();j++){
-                if(nums[i]+nums[j]==target){
-                    v.push_back(i);
-                    v.push_back(j);
-                }
-            }
-        }
-        return v;
-    }
-};
-
-//OR
-
-//2nd Approach
-//HashMaps
-//Time Complexity-O(n) 
-
-class Solution {
-public:
-    vector<int> twoSum(vector<int>& nums, int target) {
-     unordered_map<int,int> m;
-        for(int i=0;i<nums.size();i++){
-            int x=nums[i];
-            int y=target-x;
-            if(m.find(y)!=m.end()){
-                return {i,m[y]};
-            }
-            m[nums[i]]=i;
-        }
-       return {-1,-1}; 
-    }
-};

From 46f8b3f604fdb06fb84ff05ef7c40678af12a389 Mon Sep 17 00:00:00 2001
From: Priya Kumari <77202746+priyakumari02@users.noreply.github.com>
Date: Thu, 28 Oct 2021 21:15:16 +0530
Subject: [PATCH 4/5] Delete twoSum.cpp

---
 Two Sum/twoSum.cpp | 19 -------------------
 1 file changed, 19 deletions(-)
 delete mode 100644 Two Sum/twoSum.cpp

diff --git a/Two Sum/twoSum.cpp b/Two Sum/twoSum.cpp
deleted file mode 100644
index 4601d53..0000000
--- a/Two Sum/twoSum.cpp	
+++ /dev/null
@@ -1,19 +0,0 @@
-class Solution {
-public:
-    vector<int> twoSum(vector<int>& nums, int target) {
-       vector<int> v;
-        for(int i=0;i<nums.size()-1;i++){
-            for(int j=i+1;j<nums.size();j++){
-                if(nums[i]+nums[j]==target){
-                    v.push_back(i);
-                    v.push_back(j);
-                }
-            }
-        }
-        return v;
-    }
-};
-
-//OR
-
-//HashMaps
\ No newline at end of file

From e4f868d0e0d52ebe1e52d5931d88e183ffe26034 Mon Sep 17 00:00:00 2001
From: Priya Kumari <77202746+priyakumari02@users.noreply.github.com>
Date: Thu, 28 Oct 2021 21:18:04 +0530
Subject: [PATCH 5/5] CppSolutionTwoSum.cpp

added Two Sum cpp Solution
---
 Two Sum/twoSum.cpp | 44 ++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 Two Sum/twoSum.cpp

diff --git a/Two Sum/twoSum.cpp b/Two Sum/twoSum.cpp
new file mode 100644
index 0000000..c691d71
--- /dev/null
+++ b/Two Sum/twoSum.cpp	
@@ -0,0 +1,44 @@
+// Question Link :- https://leetcode.com/problems/two-sum/
+
+// Below is Solution
+
+//1st Approach
+// Time Complexity :- O(n^2)
+
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+       vector<int> v;
+        for(int i=0;i<nums.size()-1;i++){
+            for(int j=i+1;j<nums.size();j++){
+                if(nums[i]+nums[j]==target){
+                    v.push_back(i);
+                    v.push_back(j);
+                }
+            }
+        }
+        return v;
+    }
+};
+
+//OR
+
+//2nd Approach
+//HashMaps
+//Time Complexity-O(n) 
+
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+     unordered_map<int,int> m;
+        for(int i=0;i<nums.size();i++){
+            int x=nums[i];
+            int y=target-x;
+            if(m.find(y)!=m.end()){
+                return {i,m[y]};
+            }
+            m[nums[i]]=i;
+        }
+       return {-1,-1}; 
+    }
+};