Fixed!, Thanks for your help!

Hello. you have a nested for loop so that makes the complexity of your function O(n^2). Try to iterate over the string once or twice and think what you need to calculate during each step.

Thanks for the translation!

that solution is not exactly O(2n). I tested it on my machine and compared to the optimal which requires 1 pass its around 7-8 times slower.

nice! Thanks

hmm i think your solution is not O(n) thats why its failing the big tests...

O: nice!

Yes its fine. Thanks!

yep i did just that

Thank you for your advice. I will try to change it :)

ooooooof

pfff

damn..

nice kata!