An excellent point. Though for the scope of the problem it would hardly matter.

whattt? amazing

Was it really costing 5 kata?

Interesting, so map is a hash map. I'm just learning Go, and I thought was like map in Python to apply a function to all the elements in an array or slice.

Although it looks "cool" or whatever, the rules aren't as easy readable from the code as in implementations utilizing comparisons.

wth, how do you think like this :thumbsup

nice and cleas solution.
IMHO, it would've been perfect without named return

So good bro

genius really

wouldn't this be O(n) time where n = len(a)+len(b)? if we can assume all the map operations (make, insert, lookup) happen in constant time, then you have one loop over the entire array b and one loop over the entire array a which is O(len(a)+len(b)) = O(n)...

I don't see how this could become O( n(log(m)) ) since you aren't dividing the problem space anywhere (required for log(n))... Am I misremembering how these things work?