Think of it like you are speaking normally.
"add position[i] it the count is greater than or equal to 3, else add 0"

Yep.

Now it makes sense.

There are only 5 dice. Two triplets aren't possible.

I think this is not 100% correct.

For example:
[1, 1, 1, 1, 1, 1] should give 2000. Three 1's + Three 1's => 1000 + 1000.

The same goes for any repeating triplet.

Fixed.

Fixed.

Actual and expected were swapped, random tests were missing. All fixed.
Powered by Katafix 🤖

Java:

• tests generate warnings --> Note: src/test/java/SortByBinaryOnesTest.java uses or overrides a deprecated API. Note: Recompile with -Xlint:deprecation for details.

• JUnit5 should be enabled

Approved the fork.

At some point, the description must have been updated as it now specifies that the input consists solely of ASCII letters, which consists only of ['A'..'Z'] ++ ['a'..'z'].

Haskell fork which updates the tests to conform to this specification.

We are still interested
Side Node: These people have put a gun on me help me.
-> To : mcu13321

this is genius.

It's been five years. Can you write code like this now? We are still interested.

We are still interested B)