From 12499427211fe5004d1ad62723881fa32d2b4557 Mon Sep 17 00:00:00 2001
From: Ashutosh kumar verma <ashutoshverma117@gmail.com>
Date: Sat, 17 Oct 2020 22:53:25 +0530
Subject: [PATCH] Create Two sum.cpp

---
 Two sum.cpp | 41 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 Two sum.cpp

diff --git a/Two sum.cpp b/Two sum.cpp
new file mode 100644
index 0000000..19fa559
--- /dev/null
+++ b/Two sum.cpp	
@@ -0,0 +1,41 @@
+Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
+
+You may assume that each input would have exactly one solution, and you may not use the same element twice.
+
+You can return the answer in any order.
+
+ 
+
+Example 1:
+
+Input: nums = [2,7,11,15], target = 9
+Output: [0,1]
+Output: Because nums[0] + nums[1] == 9, we return [0, 1].
+Example 2:
+
+Input: nums = [3,2,4], target = 6
+Output: [1,2]
+Example 3:
+
+Input: nums = [3,3], target = 6
+Output: [0,1]
+
+
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+        int i,j;vector<int>s;
+        for(i=0;i<nums.size();i++)
+        {
+            for(j=i+1;j<nums.size();j++)
+            {
+                if(nums[i]+nums[j]==target)
+                { s.push_back(i);
+                s.push_back(j);}
+                    
+            }
+        }
+        
+        return s;
+    }
+};