Anagram deletion distance
Given two lowercase strings a and b, return the minimum total number of character deletions — you may delete from either string — needed to make them anagrams of each other. For example, 'cde' and 'abc' need 4 deletions: remove 'd' and 'e' from the first, 'a' and 'b' from the second, leaving 'c' and 'c'.
Implement
anagram_deletions(a: str, b: str) → intExamples
in
["cde","abc"]out4What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 14 min
solution.py
InputExpectedGot
["cde","abc"]4not run yetsample