You are viewing a single comment's thread. Return to all comments →
I concur. This was a very insightful solution.
I did it in O(nlog(n)) time (because I sorted the two arrays first). I'm surprised none of the test cases timed out. :-)
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 concur. This was a very insightful solution.
I did it in O(nlog(n)) time (because I sorted the two arrays first). I'm surprised none of the test cases timed out. :-)