Thanks ! :)

(Er, "sir" would suit me very well... ;) )

Very nice! I was going to comment that this kata should probably never be done with java, but you, sir/madam have proved me wrong.

This solution is elegant, very readable and functional. Full 10/10.

100% agreed, this is a 7k problem.

Very good honest kata, requiring basic form. Also very heartening that finished solutions show that there really aren't any 'advanced' ways of doing it. This is probably the first kata I've seen so far that doesn't have a 'shortcut' -- there is no easy mathematical formula or a quick hack, you simply have to figure out the algorithm and do the legwork yourself.

Using Java and backtracking:

• assertEquals("1 9 99 10954 59999999", d.decompose(60000000));
• Completed in 309.329094 ms (92ms on my own comp)

I can't see your solution, so I can't really say, but this is not a very complex kata.

Try to avoid using expressions like "monotone numbers" (whatever it is) or calling "big numbers" what is basically a round number. It's confusing as hell.

Absolutely fantastic kata, with lots of corner cases and learning potential.

I am in awe.

Very good challenge in Java, only negative I can see is that there is not much flexibility in answers.

Oh yes. I replaced it with printer_error because I thought it was a trick.

The "Examples" are generic for all languages but when you train for Java the template for solution is:

public static String printerError(String s) {
        // your code
    }

Hope you saw that:-)