great kata, but my recursive algorightm doesnt pass, despite being o(log n) ;(

this is NOT best practice, it modifies given data

yoooooooooooooooooooooooo dark tower reference, im reading that rn

fixed!

why is this voted best practice if it modifies given data smh

worst, kata, ever. the test round up incorrectly which results in correct answers being "incorrect"

can anyone make python support?

i have done almost the same

I think my solution is much clearer than this

the top solution is much more readable and simple

My solution better no cap