Given an array of strings, group anagrams together.
Input: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”], Output: [ [“ate”,”eat”,”tea”], [“nat”,”tan”], [“bat”] ] Note:
All inputs will be in lowercase. The order of your output does not matter.
I looked at today’s problem and thought to myself “heh, that’s cute”. Well…I had forgotten one important detail. In java this might have been a cute little exercise - but I wasn’t using java. Oh no, I had decided to use Go - a language in which I knew nothing about.
Fortunately, I was able to solve this entirely without cheating. However, it took at least an hour of research and repeatedly googling “how to do X golang”.
All said and done, my solution initally was too slow to pass the last “performance” test case. I sped it up by removing some redundant logic in the last funciton.