yes

yes, thanks

Actually, the recursion algorithm is the slowest, ~ O(2^n). The best solution would be O(n), huge difference.

There is one thing that the author forgets to mention is that whether there will be ** multiple while loops **.
I check the ranking first solution, the problem with that is something like

**.[blablabla[blabla]]blabla

will cause the problem.

I don't see how this would be better than recursion and how you can put the characters in the middle of the string, if you ask me, but ok :)

Found a small problem in the template solution. Fixed!

Fixed!

My failing tests are expecting a joined string of the possibilities.

e.g. Testing for "?10011000"

Expected: "010011000110011000",

instead got: ["010011000", "110011000"]

For ruby..

Yours is a very skillful solution indeed. Thanks for explaining its implementation.

I got the same issue and I just don't understand how come the result would be the same as the input. It's ridiculout!