← Questions
Equalize two strings' letter counts by deleting one letter
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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 official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding