Applausing you for this one

//return output
return output

now that's a helpful comment lmao

@FArekkusu

Are you sure this code is O(n^2)? It appears to me that it is O(n), as it loops as many times as there are segments of 8 bytes in the input list

Of course, but it doesn't have to add 1 ... twice every time 😉

Could you expain this solution please? Struggling with understanding it a bit

How have I not thought of this, brilliant solution!

when you convert an interger to binary it becomes a string, you don't need to convert it into string on line 3 and line 4
other than that i love your solution :)

this is still the cleanest solution, 4 years later

Very readable, thanks for this!

Clean

Love this one, so simple

love this

;D

how is this not the best solution

Because it's O(n^2) when an obvious O(n) solution exists?

<3