Deletions to Anagrams
Delete the minimum number of characters (from either string) so A and B become anagrams of each other. Print that minimum.
Input: two lines: string A, then string B.
Output: the minimum total deletions.
Constraints:
- 1 ≤ |A|, |B| ≤ 105
- lowercase letters
Sample Tests
Input 1
cde abc
Output 1
4
Input 2
aa aa
Output 2
0
Discussion (opens after you solve — no spoilers before)
No comments yet.