Adapted from my Haskell solution.

I'm new to Haskell and functional programming overall, I opted to keep the code more readable than consise

Time complexity: O(n)

Auxiliary space: O(1)

?????

.

Can this solution be considered O(1), since the largest number of iterations that can happen in a single for loop is limited to 15?

Alien-level code

Very interesting kata, 10/10!

y are u shouting

I'm sorry for this :(

Fixed, please review.

• Please add assertion messages showing the inputs on failed tests.
• reference solution is visible to (and callable by) the solver. Please move it into FinalTest class and make it private.

the description was incorrect. fixed

CPU's have been real quiet since this dropped

I cannot resist the urge to use structs