Good, but you just need to avoid param mutation for the solution to stay pure without side effects.
Shouldn't it?
Cheers,

A testcase could be n = 4000, m = 4000, which will evaluate to -96 in i16

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