114. Make Anagrams
EasyCounting
Print the minimum number of characters to delete from the two strings (in total) so they become anagrams of each other.
Input format
Line 1: a Line 2: b (lowercase)
Output format
The number of deletions.
Example 1
Input
cde abc
Output
4
Example 2
Input
abc abc
Output
0
Constraints
1 ≤ |a|, |b| ≤ 10⁴
Read input from standard input and print the answer to standard output. Your code is judged against 4 test cases, most of them hidden.
Loading the MyLoginn IDE…