Lol, I tried my best to have the shortest answer possible and I almost went with this solution...

The rescue is really handy there!

Nope, this is not O(n^2). Just O(n) with a large coefficient (36, when corrected for digits).

Could you explain how this is O(n^2)?

But its less readable. Nice trade to discuss hahaha

I feel so outmatched right about now

clever-girl.gif

My advice is to break the while statemnt over several lines and add a statement that displays the result of each iteration. The patterns show what happens.

To answer the question: true until there is nothing left to replace. Then it ends.

I can't parse line 3. What's the condition that 'while' is checking, and what code does it execute if true?

This is amazing solution. First time in CW I meat rescue. I'll save this snippet. Great. Thank you

You don't need the return here :)