"111000111" should be (TT) why (I)

111= - ;000 = pause between char and char ;111 = -;

sum is (- -) '-' : 'T'

or 111 = 1 and 000 =0 it will be

1 = . ; 0 = pause between Dash or Dot 1 = . ;

sum is (..) '..' : 'I'

How can I know his intention?

Kinda got everything done, but I don't understand how to do a standard string check without lengthening. I'm stumped.

The author didn't describe well enough the timings he told in the previous Kata of the series.
I was disappointed until I solved that Kata.

Explanation for those users, who as me, jumped onto 3rd Kata right away:  
There are 3 separate timings: short, middle, and long.  
All 3 for dots and short and middle for dashes.  
Length of short and middle timings (almost) similar for dots and dashes.
I hope this description helped someone.

In Haskell I get the following error when attempting:

expected: "SOS! THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG."
but got: "?! THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG. "

Weirdly this test goes through!
decodeMorse "... --- ... -.-.-- - .... . --.- ..- .. -.-. -.- -... .-. --- .-- -. ..-. --- -..- .--- ..- -- .--. ... --- ...- . .-. - .... . .-.. .- --.. -.-- -.. --- --. .-.-.-" shouldBe "SOS! THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG."

Test for '1111111111110000000000000000000000000000111111111111' to equal 'T T' should be added to the task's tests, existing solutions often fail on it, assuming that '111111111111' is a dot (and it's not the case when it can be both dot and dash)

Incorrect answer for input=" ...---... -.-.-- - .... . --.- ..- .. -.-. -.- -... .-. --- .-- -. ..-. --- -..- .--- ..- -- .--. ... --- ...- . .-. - .... . .-.. .- --.. -.-- -.. --- --. .-.-.- ": expected 'SOS! THE QUICK BROWN FOX JUMPS OVER T…' to equal 'SOS! THE QUICK BROWN FOX JUMPS OVER T…'

so ummm, what's the problem here?

My solution passed all the tests except the final one. Could you tell me what's in it. I can't figure out what I didn't look at in my solution.

Something's slightly off with the C++ boilerplate code. The code shows this:
std::string decodeBitsAdvanced (const char *bits) {

But the tests list this as a prototype:
std::string decodeBitsAdvanced (std::string bits) {

I assume it should be the latter, but this should be fixed up.

My JS code has passed the 'HEY JUDE' test, but when I press attempt it says timeout(took more than 12s). I have ran it several times on my computer, even tried online js compilers. It's running almost instantly everywhere. What should I do? I know my code does need some optimization, but I have got no clue where to even start.

No random tests in C#

Hi! I'm a little confused with description. The standard specifies that "Dot" is 1 time unit long, whereas "Dash" - 3 units. I don't understand why the example with 'HEY JUDE' -> 1100110011001100000011000000111111001100111111001111110000000000000011001111110011111100111111000000110011001111110000001111110011001100000011 contains duplicated bits for dots, dashes and pauses. Like in stead of 1010101 for H character, it is 11001100110011. Does this mean that an arbitrary binary code may have a different length for time unit which represents number of bits for dot, dash and pause?
Thanks in advance