codemistic · the-macson · Oct 22, 2022
diff --git a/LeetCode Solutions/1_Two_sum.cpp b/LeetCode Solutions/1_Two_sum.cpp
@@ -0,0 +1,16 @@
+class Solution{
+  public:
+    vector<int> twoSum(vector<int>& nums, int target){
+        unordered_map<int,int>mp;  //<value,index>
+        vector<int>res;
+        for(int i=0;i<nums.size();i++){
+            if(mp.count(nums[i])){   //if number is found in map
+                res.push_back(mp[nums[i]]);
+                res.push_back(i);
+                break;
+            }
+            mp[target-nums[i]]=i;
+        }
+        return res;
+    }
+};