I don't normally like oneliners but this was a good chance to drop one, no regex required.

I think it's the first case, as you said it is written:

Interesting numbers are 3-or-more digit numbers that meet one or more of the following criteria:

So first and foremost, they need to have 3-or-more digits.

According to the description exactly as stated, if you put a 2-digit number in awesome_phrases (like 69) then it should not signal when reaching this number. Is that the expected behavior? Or should awesome_phrases be an exception to the 3-digit mileage rule?

You could make this a little more difficult by also accepting negative amounts (formatted correctly ;) and requiring the function to throw an error if the running total drops below zero.. it's fine for beginners though.

hey!

thanx for the feedback :D I'll check this out!

Graphics definetly should be remastered...

I think some people are still confused by the ASCII jumping ;)

It might help to show the edge case where the rabbit is at the far fence: e.g. [3,1,0,0],0 and [4,1,0,0],0 both have the rabbit jump and land on the end position of the field. In the first case the rabbit faces right and will bounce back onto the final bean; in the second one, the rabbit faces left and misses it.

Modified accordingly, thanks

If there is coffee in the glass, the bottom layer is always filled with \ character.

I initially understood this to mean that if prg>0, then the bottom layer is always filled. But in fact if prg is so low that it does not fill even the first layer, then it is empty too.

Maybe it could be clearer with "The slashes alternate between layers, starting with \ in the lowest one and / in the next layer."

Seeing some of the solutions, I am glad I avoided regex for this one.

literally the first line

string[] delimiters = new string[] { " ", ",", ".", ":", "_", "-", "/", "", ";", "!", "?" };

these are not the only delimiting characters, you need to split on everything that isn't in [a-zA-Z] and '

MFW you submit a solution and then immediately see the shortcut that everyone else used in their solutions

The very definition of test-driven development! The description is lost just like you, but you don't need it. Just go and pass the tests.

I found a really elegant solution in Python, a little bit verbose to set up but ending with a simple one line sum.

You can find the answer by going through every combination of parens and summing up how many are true. But to avoid time outs you need to not repeat yourself too much. The hint is that each set of parentheses you add splits the problem into parts that you probably already solved before.

A little disappointing that the tests are so undemanding. Even the very naive solutions can pass.