Random tests in Haskell only test inputs up to 100. I've made a fork that updates the random inputs to match the description (values up to 500,000)

Please provide more clarity in the description:

Find a place as far from other people as possible

I though you meant to maximize the distance to the nearest person, but that's not the case in the example.
Are we meant to maximize the 'average' distance, or use some other metric?

Some interesting math, recreationally speaking.

Well basically you get a message saying your solution is time-wise innefficient. You should provide a solution with code for production.

What did you learn?

Java translation

It's always great to learn something new finding direct solutions to these sorts of problems.

Merged.

C: in the random tests, the user function is tested against itself

fork fixing it, also clearing a warning and moving the testing code out of preloaded

After a quick scan, I only found C, C++, coffeescript and JS to have some kind of restrictions. The way I see it, either those translations should be softened, or every other translation should be updated, but then shouldn't it be 6 kyu? Nasty situation overall :/

But why are JS tests so restrictive? Many other translations don't require any optimizations, and that makes sense for 7kyu.

Are we trying to learn to code or doing a math class?

You can choose literally every other kata to solve, you do not need to solve math kata if you do not like them :)

Haskell translation

Description has also been updated to clarify that indexing is 1-based.

Are we trying to learn to code or doing a math class? why test giant numbers that require optimizaton of code on a 7 kyu?

Approved