Equalize two strings' letter counts by deleting one letter
In each of two strings you pick one letter and delete any number of its occurrences (possibly none). Decide whether the two strings can end up similar, meaning every letter appears the same number of times in both.
No answer yet. Write the first one; the best answer gets endorsed.
