thanks man, this just opened my mind to a few other solutions :D

This is my first problem and I am already surprised by the clever solutions out there :)

how come there's no need for a comparison between the modulus statement and its answer for it to work?

i used chat gpt to understand how it's works :]

looks very cool

Still not fixed.

I just used long doubles and regular round() function. Solution is literally a 1-line one.

My bad...

std::sort performs comparision based sort, which cannot have worst case algorithmic time complexity lower than O(n*log(n))

Well, it's O(2N) to be precise (an std::sort and a for loop). And yes, there is.

Is there even an O(n) solution to this problem? :)

I know this is a performance kata, but the fact that an O(N) solution (2nd best time complexity) doesn't pass is just ridiculous.

'Helloworld' = true 
'Helloworld ' = false
           ^ because of this