5
Gabriel Freites
Last seen 9 years ago
Member for 9 years, 10 months, 23 days
Difficulty Normal
First-motoyasu.yamada
Pretty decent solution, but be carefull with de Order of the algorythm, for big n i think this can raise to O(n ** 2), try reading about Counter lyb on python, Counter, set, one line forloop and lambda function, this will help you to improve your code efficiency a lot :)
More
A little bit inefficient, good solution tho, try reading collections lyb in py, search for Counter, isalpha also helps a bit
More
