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.
I would add a "performance" flag in the code, and disable it. This way users don't timeout when testing their solution, before even starting to think about optimising. Check this kata (which you have solved) for an example of using such flag. I suggest to also include this flag, together with at least 1 big test case, in sample tests.
I would split random tests in small batch and big (performance) batch. The small tests, you may want to add an "it" for each test case. For each of your random test batches, make the first one with small number of conversations using "it". In the last suite of random test batches, split the 300 tests into 100 and 200, and make the first one use "it".
Surely most of us already know, but the description should probably note that: in C and some other languages, the input ranges are
0 <= (x) <= 2^64-1
(which is smaller than 1.9 * 10^19) rather than10^32
.I like this Kata, but like so many other functional language katas it's probably assuming too much familiarity with the problem that needs to be solved.
For users too unfamiliar with those concepts, it's too hard to solve them, for those who know them, it seems trivial.
In this kata, apparently Haskell type and function notation is used to "explain" how to tackle the problem in LC, which assumes Haskell knowledge, for instance the difference between types and constructors.
Similarly, the sentence "This means that Scott encoded instances can be deconstructed, simply by providing a case for each option." requires quite a lot of reading and rereading, and assumes parallels to Haskell.
And in a typical Haskellian attitude, authors often ignore semantics in their description, even claim that types signatures are a sufficient substitute for semantics.
They tend to ignore that they're putting pseudo-semantic information into the NAMES of functions, and these names refer to concepts the authors (!) are familiar with.
In this kata, one example of this, is in the definition of Zero and Succ, and pred.
Please reread the description and try to see where you made such assumptions and try to clarify.
Else mark it as a puzzle, but as the kata is labeled 6 Kyu, I think it's better to add clarification.
(typo: corrospond -> correspond)
(you can remove the issue after you've considered my remarks)
( LC )
Check return values for illegally zero-padded
BinaryScott
numbers. ( I could help out with code for that ).This comment is hidden because it contains spoiler information about the solution