Ok, I think I did both, marked as resolved and as ready so I hope everything is fine now and you not lost any honor due to my actions.

I's possible to do it faster than O(n) if by that you mean trying every possible value for x (or y). The key is making use of the hint in the description...

You are basically brute-forcing the issue. By using the hint given in the descrption you can get a huge reduction in the possible solution space.

Thanks to ChristianECooper for the workaround regarding findall, that was driving me crazy 😜

Thanks for the quick follow-up re the descrption.

I changed my mark to "Ready" for the question whether it is ready to come out of beta. I hope that is what you meant by marking the issue as resolved? I'm new to the platform so I'm not sure that this is the process...

I would add the numbers in the output are to be in the order in which they are encountered in the input string, not e.g. sorted by size.

Another issue is that in the example "001234" already the first zero is a cubic number. Then the second zero is one too. Then 1 is one, too. Or make it clear that if the digits follow each other immediately (without spaces) then one first has to look for three digit numbers.

I solved the Kata but had to do a bit of try-and-error because as I mentioned I found the description not clear enough.

Otherwise nice Kata BTW!

The description is not very clear.

Same error, is somebody fixing this?