/* author : ~swim~ date : 18-may-2018 description : Given two strings as input, write a program to find which numbers from the first string are present in the second string. Print the result as a string containing the matched numbers in ascending order. For example: Input: "12, 13, 15, 19, 212, 556, 2146" "13, 44, 432, 12, 788, 246, 2146, 46" Output: "12, 13, 2146" Hint: Hashtables may be a good use in terms of an efficient solution. Bonus Task: Try to solve the problem without using a Hashtable or any other data structure. Input: input two ',' seperated strings of numbers in two separate line and press submit e.g line1 = "14,12,11,45,82,12" line2 = "23,12,45,14" Or press submit to use pre configured data */ #include #include #include #include #include using namespace std; using SV = vector; int main() { string in1; string in2; getline(cin,in1); getline(cin,in2); if(in1.empty() && in2.empty()) { //in1 = string{"12,13,20,13,15,12"}; in1={"1,11,2"}; in2 = in1;//string{"13,13,20,1,15"}; } // split deliminator separated string auto Split=[](auto&& ins, char delim) { stringstream ss(ins); string tmp; SV sv; while(getline(ss,tmp,delim)) sv.emplace_back(tmp); return sv; }; // Split the input to vector SV sv1=Split(in1,','); SV sv2=Split(in2,','); auto Sort=[](auto lhs, auto rhs) { return stoi(lhs) < stoi(rhs); }; // sort and filter out unique element sort(sv1.begin(),sv1.end(),Sort); sort(sv2.begin(),sv2.end(),Sort); auto ps1=unique(sv1.begin(),sv1.end()); auto ps2=unique(sv2.begin(),sv2.end()); sv1.erase(ps1,sv1.end());> sv2.erase(ps2,sv2.end()); // search if elements from one vector // exits in another if(sv1.size() < sv2.size()) swap(sv1,sv2); vector result; for(string_view s:sv1) { auto it=find(sv2.begin(),sv2.end(),s); if(it != sv2.end()) result.emplace_back(s); } // display the result for(string_view s: result) cout << s << " "; return 0; }

Neighbor_numbers.cpp