this method will count words that start with non-alphabetic characters (like "1st" or "_example") as neither positive nor negative.

I learned highschool math, i know what log is, but how the fuck am i supposed to come up with that ? This is so random to me yet it works.

Im equavalent to a stone in math, but solved this with math. I think its just comes with more and more practice, I kinda see where you need to use loops and where its better to use math.. Im just playing with numbers and somehow get the result. But im very dumb at math. And very often i need to loop things.

A problem with your code is not a kata issue:

The tests contain some very huge arrays, so think about performance.

Don't use nested loops.

There are solutions in Python that use list comprehension methods without timing out.

post your code, the test cases are limited

This goes on iterating until last element even though it found the unique one, right ? Is there a way to make reducer stop and just return the unique number when it finds it for better performance ?

awesome, works perfectly now. no need to change Int for Double :)

es que debes sumar la cantidad de horas que está pasando, si regresa en la mismo sitio entoces es verdadero

you like me :))))))))))))))))))