when you tried anything and then reading wikipedia taking from it :))

very fun and nice little kata. thank you

this should be marked best practice, there is no absolutely reason to use ternaries like the current top answer

It needs more test cases for sizes that are not 1.

this is an interesting one!

yo! brilliant 👍

an4
читал задачу ничего не понял ,но посмотрел примеры и понял

Java translation

yeah, I always forget you can do it this way. it's smooth.

Agreed. The recursion has to be killing their time. My code is about 35% faster than theirs. I don't understand bitwise operators yet. My code and yours run neck and neck.

It seems like you should be able to shave some time off of yours by changing your for loop to somehow account for the actual bit size of 'n' instead of using 32 bits regardless of 'n'. A little above my grasp thus far in my coding journey.

Forked & approved

Enabled in this fork

the solution has: Time O(mloglog(m)+n(m/log⁡m)), Space O(m)
where m is max value from a given array

the illegal values! xD

thats what i mean, my solution was way too long compared to this beauty