In Haskell, the solution doesn't seem to match the description. There is no requirement to return "Not a string".

Using string as a argument name is not a good idea, string is also a module name.

Ruby 3.0 should be enabled, see this to learn how to do it

Ruby 3.0 should be enabled, see this to learn how to do it

Ruby 3.0 should be enabled, see this to learn how to do it

Ruby 3.0 should be enabled, see this to learn how to do it

The only failing test case says: "Should return 2 for input 1"

How can that possibly be?
The Fibonacchi sequence is 0, 1, 1, 2, 3, 5, ... etc.
Ok, suppose we reduce that to what the author suggests 1, 2, 3, 5, ... etc.
But then in both cases the biggest numbers equal or less the input limit 1 is
1 or [0, 1, 1] where 1 is odd and can not add to the sum and 0 (0 % 2 == 0) doesn't add to the sum either.

What is the author trying to say by this test case? Am I missing something? Is this poor wording of the kata or is this my poor English?

Duplicate (as pointed out by Voile 2 years ago...)

When it fails (on submission), we don't know why (Got String.Chars not implemented for {1, 2} when i did IO.inspect(str)), it's not obvious for beginners... (Elixir)

And you have to block solutions that don't actually resolve your promises too.

Sequential promise resolving like this solution should be blocked.

A couple issues:

• This appears to be a duplicate kata.
• In the Description, it says:

If more than one item have the highest number of occurrences, return the item that occurs first in the array

It's not checking for the item that occurs first, but rather for the item whose last instance comes first.

If more than one item have the highest number of occurrences, return the number that occurs first in the array

What if only multiple strings have the highest number of occurrences?

should return 2 for input 1

Isn't 2 > 1?..

Needs random tests