/* number of words in string : 4 string s : abb, bab, bba, ac Output => 2 abb, ac */ #include #include #include #include using namespace std; void NonAnagram(unordered_map>& store) { //variable to count length of substring intiailized to 0; int count=0; //unordered_map where key is string and value is vector of strings and it is iterator for traversing through the unordered_map for (auto it = store.begin();it != store.end(); it++) { int size =it->second.size(); if (size>1) { cout<second[0]<<" "; count++; } else { cout<first<<" "; count++; } } cout<>& store) { unordered_map >::iterator it; for (it = store.begin();it != store.end(); it++) { cout<first<<" "; int size =it->second.size(); for(int i=0;isecond[i]<<" "; } cout<&vec) { //unordered_map where key is string and value is vector of strings. unordered_map>m; for (long unsigned i = 0; i < vec.size(); i++) { //store string in temp string temp=vec[i]; //sort string sort(temp.begin(),temp.end()); //if string cannot be found(it reaches end) add string to map. if (m.find(temp)== m.end()) { vectorv; v.push_back(vec[i]); m[temp] = v; } //if string is already present then append to vector else { vectorv=m[temp]; v.push_back(vec[i]); m[temp] =v; } } NonAnagram(m); } // Driver code int main() { // initialize vector of strings vector arr; int num,i; std::cin>>num; string s; for(i=0;i>s; arr.push_back(s); } map(arr); return 0; }

[Challenge] Substring Anagram