We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I still think the solution is more readable if you use Counters and dictionaries. However you don't need to have nested for loops. This problem can be done in O(n) run time.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Strings: Making Anagrams
You are viewing a single comment's thread. Return to all comments →
I still think the solution is more readable if you use Counters and dictionaries. However you don't need to have nested for loops. This problem can be done in O(n) run time.