According to reality, this solution is O(m + n) which is the fastest it can get. Yours is O(m * n) which is one of the slowest.

almost had this one dammit

I'll get to this level eventually! haha

there's no slicing in there.

But this involves slicing in line 4...
Wasn't it a kata requirement to not use slices? 😕

Depends on your definition of "doesn't work."

pythonic code

Not only this is hard to read, but the performance is not very good.

balanced_num = balancedNum

it provides an alias to the snake_case version of the camelCase function name.

Example of function name aliasing:

p = print

p("Hello, World!")

Has anybody tested the performance of this ? it feels to me like recursivity would be less efficient than a regular loop here

Starting the loop from 0 is unecessary, wasting an iteration. Just a small detail

It's shocking how slow this solution is.