We consider two strings to be anagrams of each other if the first string's letters can be rearranged to form the second string. In other words, both strings must contain the same exact letters in the same exact frequency. For example,
dcbac are anagrams, but
dcbad are not.
Alice is taking a cryptography class and finding anagrams to be very useful. She decides on an encryption scheme involving two large strings where encryption is dependent on the minimum number of character deletions required to make the two strings anagrams. Can you help her find this number?
Given two strings, and , that may not be of the same length, determine the minimum number of character deletions required to make and anagrams. Any characters can be deleted from either of the strings.
For example, and . The only characters that match are the 's so we have to remove from and from for a total of deletions.
Complete the makingAnagrams function in the editor below. It should return an integer representing the minimum number of deletions needed to make the strings anagrams.
makingAnagrams has the following parameter(s):
- s1: a string
- s2: a string
The first line contains a single string, .
The second line contains a single string, .
- It is guaranteed that and consist of lowercase English letters, ascii[a-z].
Print a single integer denoting the minimum number of characters which must be deleted to make the two strings anagrams of each other.
We delete the following characters from our two strings to turn them into anagrams of each other:
We had to delete characters to make both strings anagrams.
Solution in Python
from collections import Counter def makingAnagrams(s1, s2): return len(s1)+len(s2)-sum((Counter(s1) & Counter(s2)).values())*2 print(makingAnagrams(input(), input()))