Yes, it's definitely completable (just checked it right now).
Note that the tests call both MorseCodeDecoder.decodeMorse AND MorseCodeDecoder.decodeBits, so you have to have some (even stub) implementations for both functions.
When guessing whether a particular sequence of 1s is a dot or a dash, one should take into account not only lengths of 1-sequences in the message, but also lengths of 0-sequences.
It's important to analyze the message as a whole, not the tokens separately.
101 is definitely .., i. e. I. 111000111 looks ambiguous, it can be .. (I) or - - (T T), there's no way to discern, that's why we have that rule that if you can't discern if it's a dot or a dash, assume it's a dot.
But 1110111 is not ambiguous at all.
Yes, it's definitely completable (just checked it right now).
Note that the tests call both
MorseCodeDecoder.decodeMorse
ANDMorseCodeDecoder.decodeBits
, so you have to have some (even stub) implementations for both functions.jolaf,
Just logged on because I realized this case. Sorry for the false alarm! Awesome that the tests are this thorough.
Is this kata completable on Java? The example test always fails for me, even when I hard coded the wright answer (return "HEY JUDE").
Expected: is "HEY JUDE"
but: was null
When guessing whether a particular sequence of
1
s is a dot or a dash, one should take into account not only lengths of1
-sequences in the message, but also lengths of0
-sequences.It's important to analyze the message as a whole, not the tokens separately.
101
is definitely..
, i. e.I
.111000111
looks ambiguous, it can be..
(I
) or- -
(T T
), there's no way to discern, that's why we have that rule that if you can't discern if it's a dot or a dash, assume it's a dot.But
1110111
is not ambiguous at all.Got "I", expected "M":
Does one of the tests need revision?
Reasoning:
If "I" is ".." and "M" is "--", the instructions to assume that an unknown input is a "dot" might be misleading for this test.
Thanks for the help and the great Kata.