Please follow the Troubleshooting Guide.

When testing out the code all goes well, but when trying to attempt timeout exceds and I even used 2 solutions.

The first one could've taken more time since it requires a validation of the whole array while the 2nd one doesn't and returns when finds x condition happen.

Please follow the Troubleshooting Guide.

You're telling us nothing. Help us help you!

Hi, I keep getting an error when validating my solution, I tried 2 different solutions and still gets stuck.

Haskell tests are pathetic. There are definitely no "very huge arrays" - max length is, ehm, 21 and the reference solution is O(n log n), and probably a slow one for that complexity.

See below how long this has been going on.

The Haskell tests are pathetic. The reference solution is too. Closing this, reraising on top.

Thanks for adding the test. Maybe closing.

At least in JavaScript there are now 50 random tests.

Maybe other languages have enough as well, but you didn't specify which ones and I'm not checking all of them. Closing.

Changed to number.

There aren't. Those are the input of several tests together.

Why are there test cases with more than two different numbers? Doesn't the description say they will all be equal except one? Java version test:
input:4.0 4.0 4.0 3.0 4.0 4.0 4.0 4.0 5.0 5.0 5.0 5.0 4.0 5.0 5.0 5.0 6.0 6.0 6.0 6.0 6.0 5.0 6.0 6.0 7.0 7.0 7.0 7.0 7.0 7.0 6.0 7.0 8.0 8.0 8.0 8.0 8.0 8.0 8.0 7.0 3.0 3.0 2.0 3.0 3.0 3.0 3.0 3.0
expected:<2.0> but was:<3.0>

ok I see now

Ok thanks. Maybe the kata should be reworded to reflect that they DO have to be.

Newer translations have some reducible fractions. To be on the safe side it is better to do a bit more work by simplifying fractions even if they don't have to be.

Newer translations have some reducible fractions. To be on the safe side it is better to do a bit more work by simplifying fractions even if they don't have to be.