Cloudera Interview Question
Software Engineer / DevelopersCountry: United States
Interview Type: Phone Interview
//find a pair of numbers in v, s.t. their sum equals s
vector<int> findPair(vector<int> v, int s)
{
vector<int> retV(2,-1);
unordered_map<int, int> h;
for(int i=0; i<v.size(); ++i)
h[v[i]] = i;
for(int i=0; i<v.size(); ++i)
if(h.find(s-v[i]) != h.end() && h[s-v[i]] != i)
{
retV[0] = s-v[i];
retV[1] = v[i];
return retV;
}
return retV;
}
- lasthope November 20, 2013