Not at all! The author didnt say he wanted modularity, he just wants it to work! (assuming our max value is less than 2,147,483,647 of course.

I had the same problem. I was getting NumberFormatExceptions because I was trying to parse an integer that was greater than the integer max value. My advice to anyone with this issue: Try refactoring your code to use strings instead of integers where possible (any more of a hint would spoil the answer.)

I love the rube goldberg admissions.

Both commenters before me are fools. This is the most premium way of programming. I would hire this person over the others anyday.

So simple! I didn't even think of using regex. This site really gets me thinking outside the box.

Everytime I think I have an elegant solution, someone comes along with a simple return statement. Excellent inginuity!

I had a very similar solution, though yours looks a bit more memory effective than mine. This fails case-sensitivity though ;) (even if it wasnt a rule.)

I did the same thing with a switch, I like how he extruded the comparator to its own function. I didn't even think to just use a char array for memory then convert back to a string with the return line. I used a string array. (I also haven't coded in years xD) Very elegant!

Very efficient and easy on the eyes, but this code fails case-sensitivity (even though the challenge didn't really specify.) :)