// by Bell /* Challenge by All about python # 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 */ #include #include // sort using namespace std; int letters(string text, int *word, unsigned int n){ int idx; for(int i=0;i=0&&idx<26){word[idx]+=1; } if(idx==-65||i==int(text.length()-1)){ cout<>sa>>si; cout<