2some👄

Author: sachuverma

Striver Sheet/Day-4/Two Sum.cpp

@@ -0,0 +1,47 @@
+/*
+Two Sum
+=======
+
+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]
+
+Constraints:
+2 <= nums.length <= 103
+-109 <= nums[i] <= 109
+-109 <= target <= 109
+Only one valid answer exists.
+*/
+
+class Solution
+{
+public:
+  vector<int> twoSum(vector<int> &nums, int target)
+  {
+    unordered_map<int, int> prev;
+    for (int i = 0; i < nums.size(); ++i)
+    {
+      int tar = target - nums[i];
+      if (prev.find(tar) != prev.end())
+        return {prev[tar], i};
+      else
+        prev[nums[i]] = i;
+    }
+    return {-1, -1};
+  }
+};

Striver Sheet/README.md

@@ -31,7 +31,12 @@
 
 ###
 
-- []() - [Cpp Soultion](./Day-/.cpp)
+- [Two Sum](https://leetcode.com/problems/two-sum/) - [Cpp Soultion](./Day-4/Two%20Sum.cpp)
+- []() - [Cpp Soultion](./Day-4/.cpp)
+- []() - [Cpp Soultion](./Day-4/.cpp)
+- []() - [Cpp Soultion](./Day-4/.cpp)
+- []() - [Cpp Soultion](./Day-4/.cpp)
+- []() - [Cpp Soultion](./Day-4/.cpp)
 
 ###