Understood, thank you!

even an empty function will result in no output. this is because console.assert() is disabled in the preloaded section (which is invisible to you until you solve the kata). many things are disabled or otherwise hijacked in this kata, i am not sure about why this method is disabled in particular.

Dunno why this is a spoiler...

I did it in 628. Then I realized there were free letters from the get-go. DandDangDang!

So calling two separate where-filters is a logical AND, while combining two where-filters in one where-call is an OR?

// SELECT studentName, teacherName FROM teachers, students WHERE teachers.teacherId = students.tutor AND tutor = 1
query().select(student).from(teachers, students).where(teacherJoin).where(tutor1).execute(); //[{"studentName":"Michael","teacherName":"Peter"}] <- AND filter
// SELECT * FROM number WHERE number < 3 OR number > 4
query().select().from(numbers).where(lessThan3, greaterThan4).execute(); //[1, 2, 5, 7] <- OR filter

Perfect, thanks a lot, @hobovsky, I found the issue.
I was missing the final dot, as the dictionary I loaded for MORSE_CODE didn't include punctuation marks.

I can;t tell what is wrong with your solution without seeing your code, but I edited tests so messages are not truncated now. Run your solution again and you should be able to see where your answer is different from the expected one.

Double check for unnecessary leading or trailing spaces in your answer.

My code is not passing the Long messages handling test in TypeScript.
expected:
'THE QUICK BROWN FOX JUMPS OVER THE LA…' to equal
'THE QUICK BROWN FOX JUMPS OVER THE LA…'

This is abbreviated, of course, but when I run the TS file, I receive:
THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG

which seems about correct. What am I missing?

After this kata, you will feel an overwhelming sense of gratitude for having permit to type the letters of the alphabet.

Hats off! I found this one quite challenging!

I am trying to take up this challenge again, but cannot get below 41 lines.
Edit: Finally did it.

These hands of too many unique cards. Considering two hands there can only be 9 unique cards (2 for each hand and 5 for the river) and this one has 10.

Understood. So in my move count this is move 20, and the next move would be Red inserting E3, finishing the line before Yellow can. I guess I know what to fix my implementation then, thank you so much! :-))

And of course you were right that this was no issue, it was an edge case!

I think that most likely, your solution incorrectly sees a Yellow diagonal from B1 to F5 on move 21:

move 21, F_Yellow:

      Y      
      R   Y  
      R   R  
    R Y   Y  
R   Y R R R Y
Y Y R Y Y Y R
-------------
A B C D E F G

you should try to test your function with moves.slice(0, 21) and see the result