I love this kata! It can be solved in so many ways! I suggest you try the following:

• Try the iterative and the recursive solutions.
• Try applying dynamic programming to both the iterative and the recursive solutions.
• Try to find a O(1) solution!
  Have you come up with more solutions? Please, reply.

Thats a really good advice, thank you!
I was boldly trying my solution for PowerShell and always takes too long!

Hi, I'd like to know what is spected for the 1st word if it weren't already title or lower case. The description seems somehow vague and the tests don't cover this case.

I give you some examples:

It seems that in the 3rd case TheStealthWarrior is a valid solution as well as THeStealthWarrior.

It does exactly the same as your solution, but instead of using if-else the max-function decides if (n-2)^3 should be calculated or to simply return 0, when n-2 is smaller than 0

Hi @krashblade. This is a bug fixing Kata. But not all bugs are relevant for all languages.

Specifically, the point of my Kata was to help a user to recognise bugs caused by accidentally leaving Object members variables unassigned. So I think the Kata is only meaningful for Object Oriented languages.

Translating it any non-OO languages (like C) does not really make any sense to me.

Could anyone please explain how this works?

Thanks for the feedback, but please see this new solution posted in response to a previous comment by another codewarrior.

Thank you. Fixed.

Good Thinking!!!

I don't know why they mark this as best practice...

In my opinion this Kata is way too easy for 7kyu
Edit: Im submitting in python which makes it easier!