LC0001.cpp

/*
Problem Statement: https://leetcode.com/problems/two-sum/
Time: O(n)
Space: O(n)
Author: Mohammed Shoaib, github.com/Mohammed-Shoaib
*/

class Solution {
public:
	vector<int> twoSum(vector<int>& nums, int target) {
		unordered_map<int, int> mp;
		for (int i = 0; i < nums.size(); i++) {
			if (mp.count(target - nums[i]))
				return {mp[target - nums[i]], i};
			mp[nums[i]] = i;
		}
		return {};
	}
};