Yeah, there's something weird going on in that 6000-6200 range. I still haven't really figured it out. [shrug emoji]

I passed it with some hard-coding. Shame on me. I still don't understand when to go high or low in the range of 6000-6200. I'll go back and train again, trying again to figure it out and solve it more honestly. (In my defense, I planned to only hard-code until I discovered the pattern or rule. But I'm still working on that... )

What happens to the result of the add, sub, mul, and div operations? Specifically: Is the result pushed onto the stack as a new top value, or does it change the value of the current top value on the stack? This isn't clear from the description or the example.

I see what you mean. I am initializing the total of the ascii values to 0, so if there's no input, that zero never increases and eventually gets converted to a space. So if there's nothing but that space, I should return an empty string. Otherwise, spaces resulting from zeros should remain in the result.

Instructions should mention that in the case of a single space, a zero-length string should be returned instead. A space is not "empty" input.

Some might be wondering about the possibility of a negative number of lives (e.g., if Whisker starts with 1 life and then gets cursed). I accounted for this possibility in the way I wrote my solution, but it would probably be better to incorporate it into the description. So where it mentions reaching 0 or getting to 0, it might be better to say "0 or less."

The description seems to indicate that two passes are required, but my solution passed by checking for a zero after only one pass. That's a little confusing and should be clarified.

Thanks for your feedback, and for completing the kata. (It's funny, I created this kata a year ago, and now I'm raking leaves again.) I know it's a long description, and I'm sure that's why it hasn't been completed by many codewarriors. I thought I had already pared it down to the essentials, but I can take another look to see if anything else could be removed. I will say, though, that some kata simply can't be described in a short text, and it's often worthwhile to push yourself to read through the whole thing.

As for the whole numbers vs. fractions thing, I think this is something that you pick up through knowledge of the given programming language and how it handles numbers, especially with respect to rounding errors. It's just part of knowing the language and planning your approach accordingly.

Thoroughly enjoyed it! It was one of those cases where I first said, "Nah, I ain't reading all that... " Then I kicked myself in the butt to come back again and slog through the description, and I was glad I did. Some kata are just hard to explain without a lengthy description. The thorough example was helpful, too. Thanks for all the work you put into this!

Description should specify that the speed is expressed in length units per minute.

Description needs some work -- especially the fact that there is a missing URL, as someone pointed out TWO YEARS AGO.

Thanks for those replies. That was indeed the problem. So now I just have to figure out how to speed up my solution...

I'm confused. If we are supposed to return the minimum amount of money needed for the vacation, how do you explain this fixed test:

• money: 10
• days: 2
• cost: [3, 7, 6]
• expected: "money: 10" - Isn't the minimum "money: 9" ???

Thanks for a fantastic challenge! I learned a few things along the way.