Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
Just re-tested with the highest voted solution - still works. Are you trying the sample tests instead of submitting a solution?
Per the description, all numbers under 100 are non-bouncy.
I allowed contributors; didn't realize this was a requirement for getting out of beta.
Example test harness, hope this helps:
How do I get my kata approved by moderators?
How do I get my kata approved by moderators?
Submitted a Python translation which also includes random ranges. Moved the current tests to the example tests so people have something to test on before submitting.
It starts at -3 and ends at 1, thus -3-1. A-B, but in this case A happens to be negative and B positive.
Added both, thanks for the input.
I added some additional info about "what is a hostname" but other than that the above comment stands. I don't see a way to include test cases without giving away the answer. This is in line with many other "puzzle" problems, so I think it's reasonable.
This is sorta hard to answer without a spoiler, but some numbers can be simultaneously increasing and decreasing. If you can figure that out you can find your missing numbers and get the correct answer for all test cases.
I don't think there's an easy way to add tests without giving away the answers. Do you have an example description that is more descriptive?
For those struggling to figure out how to pass this due to lack of tests:
Method A: Bind your methods inside a class definition
@classmethod
def to_roman(self, n):
Method B: Manually instantiate your class instance
RomanNumerals = Roman()
test.assert_equals(RomanNumerals.to_roman(1000), 'M')
test.assert_equals(RomanNumerals.from_roman('M'), 1000)
See my solution for a bypass. Probably a lot of other ways, too.
Python translation has been submitted!
Loading more items...