Hackerrank - Project Euler+ #017 - Number to words

Hackerrank - Problem description

The problem description - Hackerrank.

Solution

For detailed informations look at the implementation.

I created basic number to word translations. The I find out how many times is a given number present in basic translations.

E.g. 12 324 is 12 x 1000, than "twelve thousand". The rest is without 12 000, it is 324. 324 constists of 3 x 100, then "three hundred" and 24 "twenty four". Together "twelve thousand three hundred twenty four"

I created solution in:

All solutions are also available on my GitHub profile.

Java

Leave a Reply