In the **Leetcode Two Sum problem solution in C++ programming **Given an array of integer nums and an integer target, return indices of the two numbers such that they add up to the 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.

## Leetcode Two Sum problem solution in C++ programming

```
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int>Map ;
vector<int>ret ;
for(int i = 0; i < nums.size(); i++)
{
if(Map.find(target - nums[i]) != Map.end()){
ret.push_back(Map[target - nums[i]]) ;
ret.push_back(i) ;
return ret ;
}
Map[nums[i]] = i ;
}
return ret ;
}
};
```

**Also read,**

- Leetcode Two Sum Problem Solution in C
- Leetcode Two Sum Problem Solution in Java
- Leetcode Two Sum Problem Solution in Python
- Leetcode two Sum Problem Solution in C#