/* Input : vector sentence_1 Input : vector sentence_2 Input : vector> simillar_words sentence_1 has all the words present in first input sentence sentence_2 has all the words present in second input sentence Our job is to find whether both the sentences are simillar or Not. For this purpose, we have to compare word by word for both the senetences. simillar_words has pair of strings which can be considered as simillar words For example 1: vector sentence_1 = {"athelete","nice","proud"}; vector sentence_2 = {"player","good","proud"}; vector> simillar_words = {{"athelete","sportplayer"},{"sportplayer","player"},{"nice","good"}}; here, both sentence has first word athelete and player. this is simillar word as simillar_words says athelete = sportplayer = player nice and good is also simillar as simillar_words has nice=good both senetence has proud and it is same word so we can say that both sentences are same. We need to return true in this case. For example 2: vector sentence_1 = {"athelete","nice","proud"}; vector sentence_2 = {"player","good","proud"}; vector> simillar_words = {{"athelete","sportplayer"},{"nice","good"}}; Here, result is false as athelete is not equal to player even taking references from simillar_words For example 3: vector sentence_1 = {"athelete","proud","nice"}; vector sentence_2 = {"player","good","proud"}; vector> simillar_words = {{"athelete","sportplayer"},{"sportplayer","player"},{"nice","good"}}; This is false even though it is same as example 1. Reason of being false is that sequence of word in both senetences is also important. */ #include #include #include using namespace std; bool isSimilar(vector sentence_1, vector sentence_2, vector> similarity_matrix) { if (sentence_1.size()!=sentence_2.size()) return false; int intTotalWords = sentence_1.size(); vector> v; //loop through each pair for(auto pair : similarity_matrix) { string str_1 = pair[0]; string str_2 = pair[1]; bool isFound = false; for(auto& pair : v) { for(auto& val : pair) { if(val==str_1 || val==str_2) { isFound = true; pair.insert(str_1); pair.insert(str_2); break; } } } if(isFound==false) { unordered_set uset; uset.insert(str_1); uset.insert(str_2); v.push_back(move(uset)); } } /* //for printing for(auto pair : v) { for(auto val : pair) cout << val << " "; cout << endl; } */ for(int i=0;i sentence_1 = {"athelete","nice","proud"}; vector sentence_2 = {"player","good","proud"}; vector> simillar_words = {{"athelete","sportplayer"},{"sportplayer","player"},{"nice","good"}}; cout << boolalpha << isSimilar(sentence_1,sentence_2,simillar_words); return 0; }

Challenge_Simmilar_words