213. Two Sum

# @Time complexity: O(n)

class Solution {

public:

vector twoSum(vector& nums, int target) {

unordered_map mp;

for(auto i=0;i

if(mp.find(target-nums[i])!=mp.end()){

return {mp[target-nums[i]],i};

}

else{

mp[nums[i]]=i;

}

}

return {};

}

};