Yes. If the logical statement is never met then it would be an infinite loop. But in my case n would always equal to 0 at one point, so it terminates and return.

Replace seen := make(map[string]int, len(gloves)) to seen := make(map[string]int) in my solution, and you will get identical benchmark.

If you think what I have done is considered "clever" I have bad news for you..

Go Translation

Go Translation

Go Translation

Thanks. I have fixed it.

The current tests have K up to 10,000, while the length of each list only goes up to 300. The opposite of what we need to make O(N * log K) fast and O(N * log N) slow. I tested a few solutions with large N and small K instead, but I didn't find any combinations for which the dump-and-sort solution was slower than the others. I only spent a few minutes on this though, so @Gauntlet9868 or someone else might want to look into this more thoroughly.

@jcsahnwaldt I have tried to play around with the numbers. I have not been able to hit a mark where the O(N * Log K) beats the dump and sort solution. I have a feeling that we may timeout on generating such test cases before we can even do the tests.
I have enabled "Allow Contributors" flag, so others can chime in.

Thanks!

That was also my initial thought. However, I wanted to keep the Kata as close to its' origin as possible, since I have read on some other peoples translation feedback for other Katas, that some authors may insist on keeping the data types consistent between translations.
But your suggestion is fine with me. Just curious if Kata author may have any strong opinion about this.

Thanks! I did not know. Will do so moving forward.

Good catch. Fixed!

Go translation

Go translation

Go translation

Go translation