True!

I thought the same, but i written an more extensive code , because i'm dosnt understood indexOf method. Now i understand it and i have more power xd

This looks very inefficient.

I love this solution

Not sure why people think this is clever. This is literally the brute force solution.

God this is an ugly language

The code comment clearly says:

;Be sure to return longs. We don't want to return Clojure Ratios!

Probably tests are poorly written as you said. You can simply use a float for the dividend to get a decimal number instead of a ratio.

(/ 5.0 2)
=> 2.5

I propose the solution

(float 5/2)
=> 2.5

Right, the test doesn't match the problem, which means this entire kata is really poorly written or I'm still missing something.

Looks like the tests don't cover that.

How is this correct? It returns Ratios.

(find-average [1 2 3 4])
5/2

I like this one:

• covers every case where the total number of names could be different from the example (len(names) != 5)
• once you figure out the indices it works very intuitively to the "story" without a lot of thought paid to mathematics or other tricks; with only a few comments, you could actually re-tell the story that this solves
• it is also reasonably efficient, since a list is not utilized that may grow out of bounds
• this scales decently well too; we split the chance of integer overflow across everyone in the queue, effectively mitigating the chance by the number of unique people in the queue

Overall, not optimal but straightforward.

I am also facing the maketrans issue.

thanks!

It works now! cheers.