/* # Test your skill Emily recently started learning about cryptography and found that anagrams are very useful. Two strings are anagram of eachother if they have the same character set. for example, string "python" and "pothyn" are anagrams, while string "python" and "pothyf" are not. Emily decides on an encryption scheme involving 2 large strings where encryption is dependent on the minimum number of character deletions required to make the two strings anagrams. she needs your help in finding out this number. Given two strings (they can be of the same or different length), help her in finding out the minimum number of characters deletions required to make the two strings anagrams. any characters can be deleted from any of the strings. INPUT FORMAT: - Two lines, each containing a string https://www.sololearn.com/post/145264/?ref=app Input : enter two strings on separate lines or submit for defaults. */ #include #include #include using namespace std; int main() { string s1("python"); cin >> s1; string s2("onthpe"); cin >> s2; // to find what elements to remove // add each character from s1 to // map, increment the count of char // as encountered. map letters; for(auto c : s1) letters[c]++; // add each element of s2 to map // and decrement the count for(auto c : s2) letters[c]--; // list of chars to remove from s1 stringstream rems1; // list of chars to remove from s2 stringstream rems2; for(auto&&[ch, cnt] : letters) { if (cnt > 0) rems1<

[Challenge] Make_Strings_Anagram.cpp